//******************************************************************************************************
// TimeSortedDataPointScanner.cs - Gbtc
//
// Copyright © 2012, Grid Protection Alliance. All Rights Reserved.
//
// Licensed to the Grid Protection Alliance (GPA) under one or more contributor license agreements. See
// the NOTICE file distributed with this work for additional information regarding copyright ownership.
// The GPA licenses this file to you under the MIT License (MIT), the "License"; you may
// not use this file except in compliance with the License. You may obtain a copy of the License at:
//
// http://www.opensource.org/licenses/MIT
//
// Unless agreed to in writing, the subject software distributed under the License is distributed on an
// "AS-IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. Refer to the
// License for the specific language governing permissions and limitations.
//
// Code Modification History:
// ----------------------------------------------------------------------------------------------------
// 11/08/2011 - J. Ritchie Carroll
// Generated original version of source code.
// 11/30/2011 - J. Ritchie Carroll
// Modified to support buffer optimized ISupportBinaryImage.
// 12/14/2012 - Starlynn Danyelle Gilliam
// Modified Header.
//
//******************************************************************************************************
using System;
using System.Collections.Generic;
using System.Linq;
namespace GSF.Historian.Files
{
///
/// Reads a series of data points from an in sorted order.
///
public class TimeSortedArchiveFileScanner : IArchiveFileScanner
{
#region [ Members ]
// Fields
private ArchiveFileAllocationTable m_fileAllocationTable;
private IEnumerable m_historianIDs;
private TimeTag m_startTime;
private TimeTag m_endTime;
private IDataPoint m_resumeFrom;
private EventHandler> m_dataReadExceptionHandler;
#endregion
#region [ Properties ]
///
/// Gets or sets the file allocation table of
/// the file that this scanner is reading from.
///
public ArchiveFileAllocationTable FileAllocationTable
{
get
{
return m_fileAllocationTable;
}
set
{
m_fileAllocationTable = value;
}
}
///
/// Gets or sets the collection of
/// point IDs to be scanned from the file.
///
public IEnumerable HistorianIDs
{
get
{
return m_historianIDs;
}
set
{
m_historianIDs = value;
}
}
///
/// Gets or sets the minimum value of the timestamps
/// of the data points returned by the scanner.
///
public TimeTag StartTime
{
get
{
return m_startTime;
}
set
{
m_startTime = value;
}
}
///
/// Gets or sets the maximum value of the timestamps
/// of the data points returned by the scanner.
///
public TimeTag EndTime
{
get
{
return m_endTime;
}
set
{
m_endTime = value;
}
}
///
/// Gets or sets the data point from which to resume
/// the scan if it was interrupted by a rollover.
///
public IDataPoint ResumeFrom
{
get
{
return m_resumeFrom;
}
set
{
m_resumeFrom = value;
}
}
///
/// Gets or sets the handler used to handle
/// errors that occur while scanning the file.
///
public EventHandler> DataReadExceptionHandler
{
get
{
return m_dataReadExceptionHandler;
}
set
{
m_dataReadExceptionHandler = value;
}
}
#endregion
#region [ Methods ]
///
/// Reads all s in time sorted order for the specified historian IDs.
///
/// Each for the specified historian IDs.
public IEnumerable Read()
{
List> enumerators = new List>();
// Setup enumerators for scanners that have data
foreach (DataPointScanner scanner in GetScanners())
{
IEnumerator enumerator = scanner.Read().GetEnumerator();
// Add enumerator to the list if it has at least one value
if (enumerator.MoveNext())
enumerators.Add(enumerator);
}
// Start publishing data points in time-sorted order
if (enumerators.Count > 0)
{
List completed = new List();
IDataPoint dataPoint;
do
{
TimeTag publishTime = TimeTag.MaxValue;
// Find minimum publication time for current values
foreach (IEnumerator enumerator in enumerators)
{
dataPoint = enumerator.Current;
if (dataPoint?.Time.CompareTo(publishTime) < 0)
publishTime = dataPoint.Time;
}
int index = 0;
// Publish all values at the current time
foreach (IEnumerator enumerator in enumerators)
{
bool enumerationComplete = false;
dataPoint = enumerator.Current;
if (dataPoint?.Time.CompareTo(publishTime) <= 0)
{
// Attempt to advance to next data point, tracking completed enumerators
if (!enumerator.MoveNext())
{
enumerationComplete = true;
completed.Add(index);
}
yield return dataPoint;
// Make sure any point IDs with duplicated times directly follow
if (!enumerationComplete)
{
while (enumerator.Current?.Time.CompareTo(publishTime) <= 0)
{
yield return enumerator.Current;
if (!enumerator.MoveNext())
{
completed.Add(index);
break;
}
}
}
}
index++;
}
// Remove completed enumerators
if (completed.Count > 0)
{
completed.Sort();
for (int i = completed.Count - 1; i >= 0; i--)
{
enumerators.RemoveAt(completed[i]);
}
completed.Clear();
}
}
while (enumerators.Count > 0);
}
}
// Gets the list of data point scanners used to
// scan the file for data belonging to this query.
private List GetScanners()
{
List dataPointScanners = new List();
if (m_historianIDs != null && m_historianIDs.Any())
{
TimeTag startTime = m_startTime ?? TimeTag.MinValue;
TimeTag endTime = m_endTime ?? TimeTag.MaxValue;
int resumeFromHistorianID = 0;
bool includeStartTime = true;
// Set up parameters needed to properly resume a query after rollover
if ((object)m_resumeFrom != null)
{
resumeFromHistorianID = m_resumeFrom.HistorianID;
startTime = m_resumeFrom.Time ?? startTime;
includeStartTime = false;
}
// Create data point scanners for each historian ID
List historianIDs = m_historianIDs.ToList();
historianIDs.Sort();
foreach (int historianID in historianIDs)
{
dataPointScanners.Add(new DataPointScanner(m_fileAllocationTable, historianID, startTime, endTime, includeStartTime, m_dataReadExceptionHandler));
if (historianID == resumeFromHistorianID)
includeStartTime = true;
}
}
return dataPointScanners;
}
#endregion
}
}