ACompareNodesAlgorithm< Data, ConfigData > Class Template Reference

Abstract, templated compare algorithm class.

#include <CompareAlgorithms.h>

Inheritance diagram for ACompareNodesAlgorithm< Data, ConfigData >:

List of all members.

Public Member Functions
virtual int	Compare (const Data *Node1, const Data *Node2, const ConfigData *TConfigData)=0
	Compare function.

---

Detailed Description

template<class Data, class ConfigData>
class ACompareNodesAlgorithm< Data, ConfigData >

Definition at line 22 of file CompareAlgorithms.h.

---

Member Function Documentation

template<class Data, class ConfigData> virtual int ACompareNodesAlgorithm< Data, ConfigData >::Compare (  const Data *  Node1, const Data *  Node2, const ConfigData *  TConfigData )  [pure virtual]

Parameters: Node1  is the first item to compare Node2  is the second item to compare TConfigData  is any configurate data needed for the compare Returns: Returns -1 if Node1 < Node2. Returns 1 if Node1 > Node2. Returns 0 if Node1 = Node2 Implemented in SimpleCompareNodesAlgorithm< Data, ConfigData >, CompareFunctionCompareNodesAlgorithm< Data, ConfigData >, FCSIndirectCardCompareAlgorithm< Data, ConfigData >, FCSIndirectStatesCompareAlgorithm< Data >, CompareFunctionCompareNodesAlgorithm< FCSStateWithLocations, void >, CompareFunctionCompareNodesAlgorithm< FCSTalonStateData, void >, FCSIndirectCardCompareAlgorithm< FCSIndirectCard, void >, and FCSIndirectStatesCompareAlgorithm< FCSIndirectStateWithLocations< FCSStateWithLocations > * >. Referenced by BSearch(), FreecellSolverBSearch(), FCInternalHash< Key, ConfigData >::Insert(), and GLIBHash< Key, ConfigData >::LookupNode().

---

The documentation for this class was generated from the following file:

• CompareAlgorithms.h

---