// This file is part of The New Aspell

// Copyright (C) 2001 by Kevin Atkinson under the GNU LGPL license

// version 2.0 or 2.1.  You should have received a copy of the LGPL

// license along with this library if you did not you can find

// it at http://www.gnu.org/.

#ifndef autil__block_slist_hh

#define autil__block_slist_hh

// BlockSList provided a pool of nodes which can be used for singly

//   linked lists.  Nodes are allocated in large chunks instead of

//   one at a time which means that getting a new node is very fast.

//   Nodes returned are not initialized in any way.  A placement new

//   must be used to construct the data member and the destructor

//   must explicitly be called.

namespace acommon {

  template <typename T>

  class BlockSList {

  public:

    struct Node {

      Node * next;

      T      data;

    };

  private:

    void * first_block;

    Node * first_available;

    BlockSList(const BlockSList &);

    BlockSList & operator= (const BlockSList &);

  public:

    BlockSList() 

      // Default constructor.

      // add_block must be called before any nodes are available

      : first_block(0), first_available(0) {};

acommon::BlockSList<acommon::StringPair>::BlockSList()

Line

Count

Source

42

12.6k

      : first_block(0), first_available(0) {};

acommon::BlockSList<aspeller::Conds const*>::BlockSList()

Line

Count

Source

42

718

      : first_block(0), first_available(0) {};

acommon::BlockSList<char const*>::BlockSList()

Line

Count

Source

42

13.0k

      : first_block(0), first_available(0) {};

acommon::BlockSList<std::__1::pair<char const* const, acommon::Vector<char const*> > >::BlockSList()

Line

Count

Source

42

2.13k

      : first_block(0), first_available(0) {};

    Node * new_node() 

      // return a new_node if one is available or null otherwise

      // Note: the node's data member is NOT initialized in any way.

    {

      Node * n = first_available;

      if (n != 0)

  first_available = first_available->next;

      return n;

    }

acommon::BlockSList<acommon::StringPair>::new_node()

Line

Count

Source

47

676k

    {

48

676k

      Node * n = first_available;

49

676k

      if (n != 0)

50

676k

  first_available = first_available->next;

51

676k

      return n;

52

676k

    }

acommon::BlockSList<aspeller::Conds const*>::new_node()

Line

Count

Source

47

15.3k

    {

48

15.3k

      Node * n = first_available;

49

15.3k

      if (n != 0)

50

15.2k

  first_available = first_available->next;

51

15.3k

      return n;

52

15.3k

    }

acommon::BlockSList<char const*>::new_node()

Line

Count

Source

47

682k

    {

48

682k

      Node * n = first_available;

49

682k

      if (n != 0)

50

674k

  first_available = first_available->next;

51

682k

      return n;

52

682k

    }

Unexecuted instantiation: acommon::BlockSList<std::__1::pair<char const* const, acommon::Vector<char const*> > >::new_node()

    void remove_node(Node * n) 

      // marks the node as available

      // Note: the node's data member destructor is NOT called

    {

      n->next = first_available;

      first_available = n;

    }

    void add_block(unsigned int num);

    // allocate enough memory for an additional num nodes

    void clear();

    // free all memory.  add_block must then be called before any nodes

    // are available

    // Note: the node's data member destructor is NOT called

    ~BlockSList() {clear();}

acommon::BlockSList<acommon::StringPair>::~BlockSList()

Line

Count

Source

71

12.5k

    ~BlockSList() {clear();}

acommon::BlockSList<aspeller::Conds const*>::~BlockSList()

Line

Count

Source

71

718

    ~BlockSList() {clear();}

acommon::BlockSList<char const*>::~BlockSList()

Line

Count

Source

71

13.0k

    ~BlockSList() {clear();}

acommon::BlockSList<std::__1::pair<char const* const, acommon::Vector<char const*> > >::~BlockSList()

Line

Count

Source

71

2.13k

    ~BlockSList() {clear();}

  };

}

#endif