SearchTreeNode.h

Go to the documentation of this file.

/*
 * SearchTreeNode.h
 *
 * Smalltalk like class library for C++
 * Node of tree. Header.
 *
 * Copyright (c) 2004 Milan Cermak
 */
/*
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library 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
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */
#ifndef __SEARCHTREENODE_H
#define __SEARCHTREENODE_H

#include <stlib/Object.h>

namespace Core {

class Dictionary;
class SequenceableCollection;
class String;

class SearchTreeNode : public Object
{
  protected:
    Dictionary *branches;
    Object *_value;

  public:
    SearchTreeNode(void);

    /* Class-accessing protocol */
    virtual String *className(void) const;
    virtual SearchTreeNode *createNewNode(void);

    /* Accessing protocol */
    virtual Object *at(SequenceableCollection *key);
    virtual Object *at(SequenceableCollection *key, Object *ifAbsentValue);
    virtual void put(SequenceableCollection *key, Object *value);

    virtual Object *atLongestPrefixOf(SequenceableCollection *key);

    /* Testing protocol */
    virtual bool includesKey(SequenceableCollection *key);

    /* Private protocol */
    virtual Object *valueAt(SequenceableCollection *key, int depth, bool prefix);
    virtual void putValueAt(SequenceableCollection *key, Object *value, int depth);

    virtual Object *privDeeperValueAt(SequenceableCollection *key,
                                      int depth, bool prefix);
};

};

#endif /* __SEARCHTREENODE_H */

---