sot/source/sdstor/stgavl.hxx

   1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
   2 /*
   3  * This file is part of the LibreOffice project.
   4  *
   5  * This Source Code Form is subject to the terms of the Mozilla Public
   6  * License, v. 2.0. If a copy of the MPL was not distributed with this
   7  * file, You can obtain one at http://mozilla.org/MPL/2.0/.
   8  *
   9  * This file incorporates work covered by the following license notice:
  10  *
  11  *   Licensed to the Apache Software Foundation (ASF) under one or more
  12  *   contributor license agreements. See the NOTICE file distributed
  13  *   with this work for additional information regarding copyright
  14  *   ownership. The ASF licenses this file to you under the Apache
  15  *   License, Version 2.0 (the "License"); you may not use this file
  16  *   except in compliance with the License. You may obtain a copy of
  17  *   the License at http://www.apache.org/licenses/LICENSE-2.0 .
  18  */
  19
  20 #ifndef INCLUDED_SOT_SOURCE_SDSTOR_STGAVL_HXX
  21 #define INCLUDED_SOT_SOURCE_SDSTOR_STGAVL_HXX
  22
  23 // This is an abstract base class for nodes.
  24 // Especially, the compare function must be implemented.
  25
  26 class StgAvlNode
  27 {
  28     friend class StgAvlIterator;
  29 private:
  30     short Locate( StgAvlNode*, StgAvlNode**, StgAvlNode**, StgAvlNode** );
  31     short Adjust( StgAvlNode**, StgAvlNode* );
  32     StgAvlNode* RotLL();
  33     StgAvlNode* RotLR();
  34     StgAvlNode* RotRR();
  35     StgAvlNode* RotRL();
  36     void   StgEnum( short& );
  37     static StgAvlNode* Rem( StgAvlNode**, StgAvlNode*, bool );
  38 protected:
  39     short nId;                          // iterator ID
  40     short nBalance;                     // indicates tree balance
  41     StgAvlNode* pLeft, *pRight;         // leaves
  42     StgAvlNode();
  43 public:
  44     virtual ~StgAvlNode();
  45     StgAvlNode* Find( StgAvlNode* );
  46     static bool Insert( StgAvlNode**, StgAvlNode* );
  47     static bool Remove( StgAvlNode**, StgAvlNode*, bool bDel = true );
  48     static bool Move( StgAvlNode**, StgAvlNode**, StgAvlNode* );
  49     virtual short Compare( const StgAvlNode* ) const = 0;
  50 };
  51
  52 // The iterator class provides single stepping through an AVL tree.
  53
  54 class StgAvlIterator {
  55     StgAvlNode* pRoot;                  // root entry (parent)
  56     short       nCount;                 // tree size
  57     short       nCur;                   // current element
  58     StgAvlNode* Find( short );
  59 public:
  60     StgAvlIterator( StgAvlNode* );
  61     StgAvlNode* First();
  62     StgAvlNode* Next();
  63 };
  64
  65 #endif
  66
  67 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */