|
|
|
|
/*==LICENSE==*
|
|
|
|
|
|
|
|
|
|
CyanWorlds.com Engine - MMOG client, server and tools
|
|
|
|
|
Copyright (C) 2011 Cyan Worlds, Inc.
|
|
|
|
|
|
|
|
|
|
This program is free software: you can redistribute it and/or modify
|
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
|
|
|
|
|
|
You can contact Cyan Worlds, Inc. by email legal@cyan.com
|
|
|
|
|
or by snail mail at:
|
|
|
|
|
Cyan Worlds, Inc.
|
|
|
|
|
14617 N Newport Hwy
|
|
|
|
|
Mead, WA 99021
|
|
|
|
|
|
|
|
|
|
*==LICENSE==*/
|
|
|
|
|
#ifndef HS_STRING_TABLE_H
|
|
|
|
|
#define HS_STRING_TABLE_H
|
|
|
|
|
|
|
|
|
|
#include "HeadSpin.h"
|
|
|
|
|
|
|
|
|
|
class hsStringTable
|
|
|
|
|
{
|
|
|
|
|
public:
|
|
|
|
|
class Node {
|
|
|
|
|
protected:
|
|
|
|
|
Node(char c=0);
|
|
|
|
|
~Node();
|
|
|
|
|
public:
|
|
|
|
|
void* GetData();
|
|
|
|
|
void SetData(void* v);
|
|
|
|
|
friend class hsStringTable;
|
|
|
|
|
private:
|
|
|
|
|
Node* sib;
|
|
|
|
|
Node* kid;
|
|
|
|
|
char chr;
|
|
|
|
|
void* data;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
hsStringTable() {}
|
|
|
|
|
~hsStringTable();
|
|
|
|
|
void Reset();
|
|
|
|
|
Node* Find(const char* str);
|
|
|
|
|
Node* FindPartial(char* str, Int32 len=0) const;
|
|
|
|
|
void Register(const char* str, void* data);
|
|
|
|
|
|
|
|
|
|
typedef hsBool (hsStringTableCallback)(Node*);
|
|
|
|
|
hsBool Iterate(hsStringTableCallback* callback, Node* fromNode=nil);
|
|
|
|
|
private:
|
|
|
|
|
Node* FindRecur(Node* root, const char* str, hsBool createIfNeeded=false);
|
|
|
|
|
Node* FindPartialRecur(Node* root, char* str, Int32 len) const;
|
|
|
|
|
Node* AddRecur(Node* root, const char* str);
|
|
|
|
|
Node* FindLeafRecur(Node* root, char* str, Int32 len) const;
|
|
|
|
|
void RemoveNode(Node* root);
|
|
|
|
|
hsBool IterateRecur(Node* root, hsStringTableCallback* callback);
|
|
|
|
|
|
|
|
|
|
Node root;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#endif
|
