table.hpp

机甲指挥官2源代码

//===========================================================================//
// File:	table.hh                                                         //
// Contents: Interface specification for Tables                              //
//---------------------------------------------------------------------------//
// Copyright (C) Microsoft Corporation. All rights reserved.                 //
//===========================================================================//

#pragma once

#include "Stuff.hpp"
#include "SortedSocket.hpp"
#include "MemoryBlock.hpp"

namespace Stuff {

	//~~~~~~~~~~~~~~~~~~~~~~~~~~~~ TableEntry ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

	class Table;

	class TableEntry:
		public Link
	{
	public:
		TableEntry(
			Table *table,
			Plug *plug
		);
		~TableEntry();
	};

	//~~~~~~~~~~~~~~~~~~~~~~~~~~~~ TableEntryOf ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

	enum {TableEntry_Memoryblock_Allocation=100};

	template <class V> class TableEntryOf:
		public TableEntry
	{
	public:
		TableEntryOf(
			Table *table,
			Plug *plug,
			const V &value
		);
		~TableEntryOf();

		void*
			operator new(size_t);
		void
			operator delete(void *where);

		V
			GetValue()
				{return value;}
		V*
			GetValuePointer()
				{return &value;}

	private:
		static MemoryBlock
			*allocatedMemory;
		static CollectionSize
			allocationCount;

		V value;
	};

	//~~~~~~~~~~~~~~~~~~~~~~~~~~ TableEntryOf templates ~~~~~~~~~~~~~~~~~~~~~~~~

	template <class V> MemoryBlock*
		TableEntryOf<V>::allocatedMemory = NULL;
	template <class V> CollectionSize
		TableEntryOf<V>::allocationCount = 0;

	template <class V>
		TableEntryOf<V>::TableEntryOf(
			Table *table,
			Plug *plug,
			const V &value
		):
			TableEntry(table, plug)
	{
		this->value = value;
	}

	template <class V>
		TableEntryOf<V>::~TableEntryOf()
	{
	}

	template <class V> void*
		TableEntryOf<V>::operator new(size_t)
	{
		Verify(allocationCount >= 0);
		if (allocationCount++ == 0)
		{
			allocatedMemory =
				new MemoryBlock(
					sizeof(TableEntryOf<V>),
					TableEntry_Memoryblock_Allocation,
					TableEntry_Memoryblock_Allocation,
					"Stuff::TableEntryOf",
					Stuff::ConnectionEngineHeap
				);
			Register_Object(allocatedMemory);
		}
		Verify(allocationCount < INT_MAX);
		Check_Object(allocatedMemory);
		return allocatedMemory->New();
	}

	template <class V> void
		TableEntryOf<V>::operator delete(void *where)
	{
		Check_Object(allocatedMemory);
		allocatedMemory->Delete(where);
		if (--allocationCount == 0)
		{
			Unregister_Object(allocatedMemory);
			delete allocatedMemory;
			allocatedMemory = NULL;
		}
		Verify(allocationCount >= 0);
	}

	//~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Table ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

	const IteratorPosition TableNullIndex = -1;

	class Table:
		public SortedSocket
	{
		friend class TableEntry;
		friend class TableIterator;

	public:
		//
		//--------------------------------------------------------------------
		//--------------------------------------------------------------------
		// Public interface
		//--------------------------------------------------------------------
		//--------------------------------------------------------------------
		//

		//
		//--------------------------------------------------------------------
		// Constructor, Destructor and testing
		//--------------------------------------------------------------------
		//
		Table(
			Node *node,
			bool has_unique_entries
		);
		~Table();

		void
			TestInstance();
		static bool
			TestClass();
		static bool
			ProfileClass();

		//
		//-----------------------------------------------------------------------
		// IsEmpty - Returns true if the socket contains no plugs.
		//-----------------------------------------------------------------------
		//
		bool
			IsEmpty();

	protected:
		//
		//--------------------------------------------------------------------
		//--------------------------------------------------------------------
		// Protected interface
		//--------------------------------------------------------------------
		//--------------------------------------------------------------------
		//
		void
			AddImplementation(Plug *plug);
		void
			AddValueImplementation(
				Plug *plug,
				const void *value
			);
		Plug
			*FindImplementation(const void *value);
#if 0
		Plug
			*FindCloseImplementation(const void *value);
#endif

	private:
		//
		//--------------------------------------------------------------------
		//--------------------------------------------------------------------
		// Private interface
		//--------------------------------------------------------------------
		//--------------------------------------------------------------------
		//
		virtual TableEntry
			*MakeTableEntry(
				Plug *plug,
				const void *value
			);

		virtual int
			CompareTableEntries(
				TableEntry *entry1,
				TableEntry *entry2
			);

		virtual int
			CompareValueToTableEntry(
				const void *value,
				TableEntry *entry
			);

		void
			AddTableEntry(TableEntry *entry);
		void
			SortTableEntries();
		IteratorPosition
			SearchForValue(const void *value);
#if 0
		IteratorPosition
			SearchForCloseValue(const void *value);
#endif
		IteratorPosition
			SearchForTableEntry(TableEntry *entry);
		void
			RemoveNthTableEntry(CollectionSize index);

		//
		//--------------------------------------------------------------------
		// Private data
		//--------------------------------------------------------------------
		//
		TableEntry **array;
		CollectionSize
			numItems,
			maxItems;
	};

	//~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ TableOf ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

	template <class T, class V> class TableOf:
		public Table
	{
	public:
		//
		//--------------------------------------------------------------------
		//--------------------------------------------------------------------
		// Public interface
		//--------------------------------------------------------------------
		//--------------------------------------------------------------------
		//
		TableOf(
			Node *node,
			bool has_unique_entries
		);
		~TableOf();

		//
		//--------------------------------------------------------------------
		// Socket methods (see Socket for full listing)
		//--------------------------------------------------------------------
		//
		void
			AddValue(
				T plug,
				const V &value
			)
				{AddValueImplementation(Cast_Object(Plug*,plug), &value);}
		void
			Remove(T plug)
				{RemovePlug(Cast_Object(Plug*,plug));}
		T
			Find(const V &value)
				{return (T)FindImplementation(&value);}
#if 0
		T
			FindClose(const V &value)
				{return (T)FindCloseImplementation(&value);}
#endif

	private:
		//
		//--------------------------------------------------------------------
		//--------------------------------------------------------------------
		// Private interface
		//--------------------------------------------------------------------
		//--------------------------------------------------------------------
		//
		TableEntry*
			MakeTableEntry(
				Plug *plug,
				const void *value
			)
				{
					return
						new TableEntryOf<V>(
							this,
							plug,
							*Cast_Pointer(const V*, value)
						);
				}
		int
			CompareTableEntries(
				TableEntry *entry1,
				TableEntry *entry2
			);
		int
			CompareValueToTableEntry(
				const void *value,
				TableEntry *entry
			);
	};

	//~~~~~~~~~~~~~~~~~~~~~~~~~~~~ TableOf templates ~~~~~~~~~~~~~~~~~~~~~~~~~~~

	template <class T, class V>
		TableOf<T, V>::TableOf(
			Node *node,
			bool has_unique_entries
		):
			Table(
				node,
				has_unique_entries
			)
	{
	}

	template <class T, class V>
		TableOf<T, V>::~TableOf()
	{
	}

	template <class T, class V> int
		TableOf<T, V>::CompareTableEntries(
			TableEntry *entry1,
			TableEntry *entry2
		)
	{
      V *ptr1 = Cast_Object(TableEntryOf<V>*, entry1)->GetValuePointer();
      V *ptr2 = Cast_Object(TableEntryOf<V>*, entry2)->GetValuePointer();

      Check_Pointer(ptr1);
      Check_Pointer(ptr2);

   	if (*ptr1 == *ptr2)
      	return 0;
      else
      	return ((*ptr1 > *ptr2) ? 1 : -1);
	}

	template <class T, class V> int
		TableOf<T, V>::CompareValueToTableEntry(
			const void *value,
			TableEntry *link
		)
	{
		Check_Pointer(value);

      V *ptr = Cast_Object(TableEntryOf<V>*, link)->GetValuePointer();
      Check_Pointer(ptr);

      if (*Cast_Pointer(const V*, value) == *ptr)
      	return 0;
      else
      	return (*Cast_Pointer(const V*, value) > *ptr) ? 1 : -1;
	}

	//~~~~~~~~~~~~~~~~~~~~~~~~~~~~ TableIterator ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

	class TableIterator:
		public SortedIterator
	{
	public:
		//
		//--------------------------------------------------------------------
		//--------------------------------------------------------------------
		// Public interface
		//--------------------------------------------------------------------
		//--------------------------------------------------------------------
		//

		//
		//--------------------------------------------------------------------
		// Constructors, Destructor and testing
		//--------------------------------------------------------------------
		//
		explicit TableIterator(Table *table);
		~TableIterator();
		void
			TestInstance();

		//
		//--------------------------------------------------------------------
		// Iterator methods (see Iterator for full listing)
		//--------------------------------------------------------------------
		//
		void
			First();
		void
			Last();
		void
			Next();
		void
			Previous();
		CollectionSize
			GetSize();
		void
			Remove();

	protected:
		//
		//--------------------------------------------------------------------
		//--------------------------------------------------------------------
		// Protected interface
		//--------------------------------------------------------------------
		//--------------------------------------------------------------------
		//
		void*
			ReadAndNextImplementation();
		void*
			ReadAndPreviousImplementation();
		void*
			GetCurrentImplementation();
		void*
			GetNthImplementation(CollectionSize index);
		Plug*
			FindImplementation(const void *value);

		TableEntry*
			GetCurrentEntry()
				{return NthEntry(currentPosition);}

	private:
		//
		//--------------------------------------------------------------------
		//--------------------------------------------------------------------
		// Private interface
		//--------------------------------------------------------------------
		//--------------------------------------------------------------------
		//
		void
			ReceiveMemo(
				IteratorMemo memo,
				void *content
			);

		TableEntry*
			NthEntry(CollectionSize index)
				#if defined(_ARMOR)
					;
				#else
					{return array[index];}
				#endif

		void
			IncrementPosition()
				{if (++currentPosition >= numItems) currentPosition = TableNullIndex;}
		void
			DecrementPosition()
				{if (--currentPosition < 0) currentPosition = TableNullIndex;}

		//
		//--------------------------------------------------------------------
		// Private data
		//--------------------------------------------------------------------
		//
		TableEntry **array;
		CollectionSize numItems;
		IteratorPosition currentPosition;			
	};
	
	//~~~~~~~~~~~~~~~~~~~~~~~~~~~ TableIteratorOf ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

	template <class T, class V> class TableIteratorOf:
		public TableIterator
	{
	public:
  		//
		//--------------------------------------------------------------------
		//--------------------------------------------------------------------
		// Public interface
		//--------------------------------------------------------------------
		//--------------------------------------------------------------------
		//

		//
		//--------------------------------------------------------------------
		// Constructors and Destructor
		//--------------------------------------------------------------------
		//
		explicit TableIteratorOf(TableOf<T, V> *table);
		Iterator*
			MakeClone();
		~TableIteratorOf();

		//
		//--------------------------------------------------------------------
		// Iterator methods (see Iterator for full listing)
		//--------------------------------------------------------------------
		//
		T
			ReadAndNext()
				{return (T)ReadAndNextImplementation();}
		T
			ReadAndPrevious()
				{return (T)ReadAndPreviousImplementation();}
		T
			GetCurrent()
				{return (T)GetCurrentImplementation();}
		T
			GetNth(CollectionSize index)
				{return (T)GetNthImplementation(index);}
		T
			Find(const V &value)
				{return (T)FindImplementation(&value);}
		V
			GetValue()
				{return Cast_Object(TableEntryOf<V>*, GetCurrentEntry())->GetValue();}
	};

	//~~~~~~~~~~~~~~~~~~~~~~~~ TableIteratorOf templates ~~~~~~~~~~~~~~~~~~~~~~~

	template <class T, class V>
		TableIteratorOf<T, V>::TableIteratorOf(TableOf<T, V> *table):
			TableIterator(table)
	{
	}

	template <class T, class V> Iterator*
		TableIteratorOf<T, V>::MakeClone()
	{
		return new TableIteratorOf<T, V>(*this);
	}

	template <class T, class V>
		TableIteratorOf<T, V>::~TableIteratorOf()
	{
	}

}