bucketlink< T > Class Template Reference

: Used by class bucket. This is a linked list class. More...

#include <bucketlink.h>

Inheritance diagram for bucketlink< T >:

Collaboration diagram for bucketlink< T >:

List of all members.

Public Member Functions
	bucketlink ()
	Construct an empty link.
	bucketlink (T *data_)
	Construct with data.
template<typename I2 >
void	insertafterself (bucketlink< T > *b, I2 &fn)
	Insert the link in the list in order.
Public Attributes
T *	data
	Hold the data.
bucketlink *	next
	The next link in the chain.
Static Public Attributes
static uint	insertafterselfcounter = 0
	Set to zero before inserting, then you can compare after insertion to see the chain length.

---

Detailed Description

template<typename T>
class bucketlink< T >

: Used by class bucket. This is a linked list class.

Definition at line 22 of file bucketlink.h.

---

Constructor & Destructor Documentation

template<typename T>

bucketlink< T >::bucketlink

(

)

[inline]

Construct an empty link.

Definition at line 33 of file bucketlink.h.

    : data(0), next(0) 
    {}

template<typename T>

bucketlink< T >::bucketlink

(

T *

data_

)

[inline]

Construct with data.

Definition at line 37 of file bucketlink.h.

    : data(data_), next(0)
    {}

---

Member Function Documentation

template<typename T>

template<typename I2 >

void bucketlink< T >::insertafterself	(	bucketlink< T > *	b,
		I2 &	fn
	)			[inline]

Insert the link in the list in order.

This routine can only insert after itself and not before.

Definition at line 61 of file bucketlink.h.

References bucketlink< T >::data, bucketlink< T >::insertafterselfcounter, bucketlink< T >::next, and SHOW.

Referenced by buckethybrid< T, HFN, C >::eval(), and bucket< T, HFN >::eval().

{
  assert(b!=0);
  assert( fn(*(b->data),*(this->data))==false );

insertafterselfcounter=0;

  bucketlink<T>* cp = next;
  bucketlink<T>* cp0 = this;
  for ( ;cp!=0; )
  {

    ++insertafterselfcounter;
#ifdef DEBUG_BUCKETLINK
cout << SHOW(insertafterselfcounter) << endl;
#endif

    if (fn(*(b->data),*(cp->data)))
    {
      b->next = cp;
      cp0->next = b;
      return;
    }

    cp0 = cp;
    cp = cp->next;
  }

  // Insert at the end of the list.
  cp0->next = b;
  b->next=0;
}

---

Member Data Documentation

template<typename T>

T* bucketlink< T >::data

Hold the data.

Definition at line 27 of file bucketlink.h.

Referenced by buckethybrid< T, HFN, C >::copy(), bucket< T, HFN >::copy(), buckethybrid< T, HFN, C >::eval(), bucket< T, HFN >::eval(), hashtable< T, HFN >::insert(), bucketlink< T >::insertafterself(), hashtable< T, HFN >::insertInverse(), buckethybrid< T, HFN, C >::move(), cfcontainerhash::operator()(), cfcontainerhash::operator[](), and hashtable< T, HFN >::remove().

template<typename T>

uint bucketlink< T >::insertafterselfcounter = 0 [inline, static]

Set to zero before inserting, then you can compare after insertion to see the chain length.

Definition at line 43 of file bucketlink.h.

Referenced by bucketlink< T >::insertafterself().

template<typename T>

bucketlink* bucketlink< T >::next

The next link in the chain.

Definition at line 30 of file bucketlink.h.

Referenced by buckethybrid< T, HFN, C >::copy(), bucket< T, HFN >::copy(), buckethybrid< T, HFN, C >::eval(), bucket< T, HFN >::eval(), hashtable< T, HFN >::insert(), bucketlink< T >::insertafterself(), hashtable< T, HFN >::insertInverse(), buckethybrid< T, HFN, C >::move(), and hashtable< T, HFN >::remove().

---

The documentation for this class was generated from the following file:

• bucket/bucketlink.h