/** * Copyright (c) 2006 Michele Mastrogiovanni. * *   Licensed under the Apache License, Version 2.0 (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.apache.org/licenses/LICENSE-2.0 * *   Unless required by applicable law or agreed to in writing, software *   distributed under the License is distributed on an "AS IS" BASIS, *   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. *   See the License for the specific language governing permissions and *   limitations under the License. * */ #include "LinkedStatus.h"template<typename _DataNode, typename _DataTime>void LinkedStatus<_DataNode, _DataTime>::addState(_DataNode data, const _DataTime & time){	//	// Verifica se il messaggio è già presente e ordina l'inserimento.	//	for (_myList::iterator i = l.begin(); i != l.end(); i++) {		// Se il dato da inserire esiste, si scarta		if ((i->time) == time)			return;					if ((i->dataTime) < time) {			_myStruct d;			d.dataNode = data;			d.dataTime = time;			l.insert(i, d);			return;		}	}	_myStruct d;	d.dataNode = data;	d.dataTime = time;		l.push_back(d);	if (history == -1)		return;	if (l.size() > history)		l.pop_back();}template<typename _DataNode, typename _DataTime>_DataNode & LinkedStatus<_DataNode, _DataTime>::getState(const _DataTime time) {	for (_myList::iterator i = l.begin(); i != l.end(); i++)		if (i->dataTime == time)			return i->dataNode;	return empty;}template<typename _DataNode, typename _DataTime>_DataTime & LinkedStatus<_DataNode, _DataTime>::getLast(){	return (*(l.begin()));}		template<typename _DataNode, typename _DataTime>bool LinkedStatus<_DataNode, _DataTime>::isPresent(const _DataTime time) {	for (_myList::iterator i = l.begin(); i != l.end(); i++)		if (i->dataTime == time)			return true;	return false;}