⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 mudarray.h

📁 MudMaster 2000 的C++源码
💻 H
字号:
/************************************************************************************
	Copyright (c) 2000 Aaron O'Neil
	All rights reserved.

	Redistribution and use in source and binary forms, with or without
	modification, are permitted provided that the following conditions
	are met:

		1) Redistributions of source code must retain the above copyright notice, 
				this list of conditions and the following disclaimer.
		2) Redistributions in binary form must reproduce the above copyright notice, 
				this list of conditions and the following disclaimer in the documentation
				and/or other materials provided with the distribution.
		3) Redistributions in binary form must reproduce the above copyright notice on
				program startup. Additional credits for program modification are acceptable
				but original copyright and credits must be visible at startup.
		4) You may charge a reasonable copying fee for any distribution of Mud Master. 
				You may charge any fee you choose for support of Mud Master. You may not 
				charge a fee for Mud Master itself.

  THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
	IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
	OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
	IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
	INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
	NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
	DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
	THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
	(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
	THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

**************************************************************************************/

#define DEFAULT_ARRAY_SIZE				150
#define DEFAULT_ARRAY_GROW_SIZE		20

#define ARRAY_ELEMENTS(ptr) ((ptr->bSingleDim) ? (ptr->nDim[0]) : (ptr->nDim[0]*ptr->nDim[1]))
#define ARRAY_INDEX_VALID(ptr,row,col) ((ptr->bSingleDim) ? (row>0&&row<=ptr->nDim[0]) : (row>0&&row<=ptr->nDim[0]&&col>0&&col<=ptr->nDim[1]))
#define ARRAY_INDEX(ptr,row,col) ((ptr->bSingleDim) ? (row-1) : ((row-1)*ptr->nDim[1]+(col-1)))

struct ARRAY
{
	CString	strName;			// Name of the array.
	CString	strGroup;		// Name of the group.
	BOOL		bSingleDim;		// TRUE when single dimensional.
	int		nDim[2];			// Dimensions of the array.
	CString  *pstrArray;
};

class CMudArray
{
public:
	CMudArray();
	~CMudArray();

	int Add(const char *pszName, BOOL bSingleDim, int nRows, 
		int nCols, const char *pszGroup);

	BOOL Remove(const char *pszName);
	BOOL Remove(int nIndex);
	void RemoveAll();
	int  RemoveGroup(const char *pszGroup);

	BOOL Assign(ARRAY *ptr, int nRow, int nCol, const char *pszValue);
	BOOL GetItem(ARRAY *ptr, int nRow, int nCol, CString &strItem);

	ARRAY* GetFirst();
	ARRAY* GetNext();
	ARRAY* GetAt(int nIndex);
	ARRAY* FindExact(const char *pszName);

	int GetCount()			{ return(m_nCount); }
	int GetFindIndex()	{ return(m_nGetIndex); }

	void HashIt();

private:
	CPtrArray m_ptrList;
	int m_nCount;

	int m_nGetIndex;

	CHashTable m_htHash;
};

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -