SbPList.h

Go to the documentation of this file.

/*
 *
 *  Copyright (C) 2000 Silicon Graphics, Inc.  All Rights Reserved. 
 *
 *  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.
 *
 *  Further, this software is distributed without any warranty that it is
 *  free of the rightful claim of any third person regarding infringement
 *  or the like.  Any license provided herein, whether implied or
 *  otherwise, applies only to this software file.  Patent licenses, if
 *  any, provided herein do not apply to combinations of this program with
 *  other software, or any other product whatsoever.
 * 
 *  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
 *
 *  Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy,
 *  Mountain View, CA  94043, or:
 * 
 *  http://www.sgi.com 
 * 
 *  For further information regarding this notice, see: 
 * 
 *  http://oss.sgi.com/projects/GenInfo/NoticeExplan/
 *
 */
 
 
/*
 * Copyright (C) 1990,91   Silicon Graphics, Inc.
 *
 _______________________________________________________________________
 ______________  S I L I C O N   G R A P H I C S   I N C .  ____________
 |
 |   $Revision: 1.3 $
 |
 |   Description:
 |      This contains the definition of the SbPList generic pointer
 |      list class. An SbPList is a list of (void *) pointers that
 |      allows easy insertion, removal, and other operations.
 |
 |      The SbIntList class allows lists of integers to be created.
 |
 |   Author(s)          : Paul S. Strauss, Nick Thompson, Gavin Bell
 |
 ______________  S I L I C O N   G R A P H I C S   I N C .  ____________
 _______________________________________________________________________
 */
 
#ifndef _SB_PLIST_
#define _SB_PLIST_
 
#include <Inventor/system/SbSystem.h>
#include <Inventor/SbBasic.h>
#include <Inventor/SbLinear.h>
 
 
 
 
class INVENTOR_API SbPList {
  public:
 
    SbPList();
 
    SbPList(int initSize);
 
    SbPList(const SbPList &pl);
 
    ~SbPList();
 
    void        append(void * ptr)
        { if (nPtrs + 1 > ptrsSize) expand(nPtrs + 1);
          ptrs[nPtrs++] = ptr; }
 
    int         find(const void *ptr) const;
 
    void        insert(void *ptr, int addBefore);
 
    void        remove(int which);
 
    int         getLength() const               { return nPtrs;   }
 
    void        truncate(int start)
        { nPtrs = start; }
 
    void        copy(const SbPList &pl);
 
    SbPList &   operator =(const SbPList &pl)   { copy(pl); return *this; }
 
    void *&     operator [](int i) const
        { if (i >= nPtrs) grow(i); return ptrs[i]; }
 
    bool           operator ==(const SbPList &pl) const
        { return pl.nPtrs == nPtrs ? compare(pl) : FALSE; }
    bool           operator !=(const SbPList &pl) const
        { return pl.nPtrs == nPtrs ? ! compare(pl) : TRUE; }
  
  SoINTERNAL public:
    void *      get(int i) const { return ptrs[i]; }
    void        set(int i, void *j) { ptrs[i] = j; }
 
  private:
 
    bool           compare(const SbPList &pl) const;
 
    void **     ptrs;           
    int         nPtrs;          
    int         ptrsSize;       
 
    void        grow(int max) const;
 
    void        setSize(int size)
        { if (size > ptrsSize) expand(size); nPtrs = size; }
 
    void        expand(int size);
};
 
 
 
SoINTERNAL class INVENTOR_API SbIntList : public SbPList {
 
  public:
    SbIntList()                                 {}
    SbIntList(int initSize) : SbPList(initSize) {}
 
    void        append(int integer)
        { ((SbPList *) this)->append((void *) (size_t) integer); }
 
    int         find(int integer)
        { return ((SbPList *) this)->find((void *) (size_t) integer); }
 
    void        insert(int integer, int addBefore)
        { ((SbPList *) this)->insert((void *) (size_t) integer, addBefore); }
 
    int &       operator [](int i) const
        { return ( (int &) ( (*(const SbPList *) this) [i] ) ); }
        // support for 64bit, big-endian:
        // An ugly cast that makes sure that when we cast from void* to
        // int&, we get the rightmost four bytes, rather than the upper
        // bytes.  
        // { return ((int &)*(((char*)&((*(const SbPList *) this) [i]) ) + 4 ));}
};
 
 
SoINTERNAL class INVENTOR_API SbVec3fList : public SbPList {
 
  public:
     SbVec3fList() {}
    ~SbVec3fList();
 
    void        append(SbVec3f *vec)
        { ((SbPList *) this)->append((void *) new SbVec3f(vec->getValue())); }
 
    void        insert(SbVec3f *vec, int addBefore)
        { ((SbPList *) this)->insert((void *) new SbVec3f(vec->getValue()),
                addBefore); }
 
    SbVec3f *   operator [](int i) const
        { return ( (SbVec3f *) ( (*(const SbPList *) this) [i] ) ); }
};
 
 
class SbString;
 
SoEXTENDER class INVENTOR_API SbStringList : public SbPList {
  public:
    void        append(SbString *string)
        { ((SbPList *) this)->append((void *) string); }
 
    int          find(SbString *string)
        { return ((SbPList *) this)->find((void *) string); }
 
    void        insert(SbString *string, int addBefore)
        { ((SbPList *) this)->insert((void *) string, addBefore); }
 
    SbString *& operator [](int i) const
        { return ( (SbString *&) ( (*(const SbPList *) this) [i] ) ); }
};
 
#endif /* _SB_PLIST_ */