1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/core/sm_trie.cpp	Sun Jul 06 04:49:55 2008 +0000
     1.3 @@ -0,0 +1,121 @@
     1.4 +/**
     1.5 + * vim: set ts=4 :
     1.6 + * =============================================================================
     1.7 + * SourceMod
     1.8 + * Copyright (C) 2004-2008 AlliedModders LLC.  All rights reserved.
     1.9 + * =============================================================================
    1.10 + *
    1.11 + * This program is free software; you can redistribute it and/or modify it under
    1.12 + * the terms of the GNU General Public License, version 3.0, as published by the
    1.13 + * Free Software Foundation.
    1.14 + * 
    1.15 + * This program is distributed in the hope that it will be useful, but WITHOUT
    1.16 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
    1.17 + * FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more
    1.18 + * details.
    1.19 + *
    1.20 + * You should have received a copy of the GNU General Public License along with
    1.21 + * this program.  If not, see <http://www.gnu.org/licenses/>.
    1.22 + *
    1.23 + * As a special exception, AlliedModders LLC gives you permission to link the
    1.24 + * code of this program (as well as its derivative works) to "Half-Life 2," the
    1.25 + * "Source Engine," the "SourcePawn JIT," and any Game MODs that run on software
    1.26 + * by the Valve Corporation.  You must obey the GNU General Public License in
    1.27 + * all respects for all other code used.  Additionally, AlliedModders LLC grants
    1.28 + * this exception to all derivative works.  AlliedModders LLC defines further
    1.29 + * exceptions, found in LICENSE.txt (as of this writing, version JULY-31-2007),
    1.30 + * or <http://www.sourcemod.net/license.php>.
    1.31 + *
    1.32 + * Version: $Id$
    1.33 + */
    1.34 +
    1.35 +#include <string.h>
    1.36 +#include <assert.h>
    1.37 +#include <sm_trie_tpl.h>
    1.38 +#include "sm_trie.h"
    1.39 +
    1.40 +struct Trie
    1.41 +{
    1.42 +	KTrie<void *> k;
    1.43 +};
    1.44 +
    1.45 +Trie *sm_trie_create()
    1.46 +{
    1.47 +	return new Trie;
    1.48 +}
    1.49 +
    1.50 +void sm_trie_destroy(Trie *trie)
    1.51 +{
    1.52 +	delete trie;
    1.53 +}
    1.54 +
    1.55 +bool sm_trie_insert(Trie *trie, const char *key, void *value)
    1.56 +{
    1.57 +	return trie->k.insert(key, value);
    1.58 +}
    1.59 +
    1.60 +bool sm_trie_replace(Trie *trie, const char *key, void *value)
    1.61 +{
    1.62 +	return trie->k.replace(key, value);
    1.63 +}
    1.64 +
    1.65 +bool sm_trie_retrieve(Trie *trie, const char *key, void **value)
    1.66 +{
    1.67 +	void **pValue = trie->k.retrieve(key);
    1.68 +	
    1.69 +	if (!pValue)
    1.70 +	{
    1.71 +		return false;
    1.72 +	}
    1.73 +
    1.74 +	if (value)
    1.75 +	{
    1.76 +		*value = *pValue;
    1.77 +	}
    1.78 +
    1.79 +	return true;
    1.80 +}
    1.81 +
    1.82 +bool sm_trie_delete(Trie *trie, const char *key)
    1.83 +{
    1.84 +	return trie->k.remove(key);
    1.85 +}
    1.86 +
    1.87 +void sm_trie_clear(Trie *trie)
    1.88 +{
    1.89 +	trie->k.clear();
    1.90 +}
    1.91 +
    1.92 +size_t sm_trie_mem_usage(Trie *trie)
    1.93 +{
    1.94 +	return trie->k.mem_usage();
    1.95 +}
    1.96 +
    1.97 +struct trie_iter_data
    1.98 +{
    1.99 +	SM_TRIE_BAD_ITERATOR iter;
   1.100 +	void *ptr;
   1.101 +	Trie *pTrie;
   1.102 +};
   1.103 +
   1.104 +void our_trie_iterator(KTrie<void *> *pTrie, const char *name, void *& obj, void *data)
   1.105 +{
   1.106 +	trie_iter_data *our_iter;
   1.107 +
   1.108 +	our_iter = (trie_iter_data *)data;
   1.109 +	our_iter->iter(our_iter->pTrie, name, &obj, our_iter->ptr);
   1.110 +}
   1.111 +
   1.112 +void sm_trie_bad_iterator(Trie *trie,
   1.113 +						  char *buffer,
   1.114 +						  size_t maxlength,
   1.115 +						  SM_TRIE_BAD_ITERATOR iter,
   1.116 +						  void *data)
   1.117 +{
   1.118 +	trie_iter_data our_iter;
   1.119 +
   1.120 +	our_iter.iter = iter;
   1.121 +	our_iter.ptr = data;
   1.122 +	our_iter.pTrie = trie;
   1.123 +	trie->k.bad_iterator(buffer, maxlength, &our_iter, our_trie_iterator);
   1.124 +}