BucketList Class Reference

#include <Index.h>

Collaboration diagram for BucketList:

[legend]

Public Member Functions
	BucketList ()
	BucketList (HashIndexNode *h)
DbRetVal	insert (Chunk *chunk, Database *db, void *key, void *tuple)
DbRetVal	remove (Chunk *chunk, Database *db, void *key)
BucketIter	getIterator ()

---

Detailed Description

Definition at line 50 of file Index.h.

---

Constructor & Destructor Documentation

BucketList::BucketList

(

)

[inline]

Definition at line 54 of file Index.h.

{ head = NULL;}

BucketList::BucketList

(

HashIndexNode *

h

)

[inline]

Definition at line 55 of file Index.h.

{ head = h; }

---

Member Function Documentation

BucketIter BucketList::getIterator

(

)

[inline]

Definition at line 58 of file Index.h.

References BucketIter::iter.

Referenced by HashIndex::insert().

    {
        BucketIter it;
        it.iter = head;
        return it;
    }

Here is the caller graph for this function:

DbRetVal BucketList::insert	(	Chunk *	chunk,
		Database *	db,
		void *	key,
		void *	tuple
	)

Definition at line 20 of file BucketList.cxx.

References Chunk::allocate(), DM_HashIndex, HashIndexNode::next_, OK, printDebug, printError, HashIndexNode::ptrToKey_, and HashIndexNode::ptrToTuple_.

Referenced by HashIndex::insert(), and HashIndex::update().

{
    DbRetVal rv = OK;
    HashIndexNode *newNode;// (HashIndexNode*) chunk->allocate(db, &rv);
    newNode= (HashIndexNode*) chunk->allocate(db, &rv);
    if (NULL == newNode)
    {
        printError(rv, "Unable to allocate HashIndex node");
        return rv;
    }
    printDebug(DM_HashIndex,"Hash Index node allocated:%x", newNode);
    newNode->ptrToKey_ = key;
    newNode->ptrToTuple_ = tuple;
    newNode->next_ = NULL;

    //If this is the first node, set it as head
    if (NULL == head)
    {
        printDebug(DM_HashIndex, "BucketList:insert head is null key:%x",key);
        head = newNode;
        return OK;
    }

    HashIndexNode *it = head;
    while (NULL != it->next_) it = it->next_;
    it->next_ = newNode;
    printDebug(DM_HashIndex, "BucketList:insert adding it to the end of list key:%x", key);
    return rv;
}

Here is the call graph for this function:

Here is the caller graph for this function:

DbRetVal BucketList::remove	(	Chunk *	chunk,
		Database *	db,
		void *	key
	)

Definition at line 50 of file BucketList.cxx.

References ErrNotFound, Chunk::free(), HashIndexNode::next_, OK, printError, HashIndexNode::ptrToKey_, and SplCase.

Referenced by HashIndex::insert(), HashIndex::remove(), and HashIndex::update().

{
    if (NULL == head) return ErrNotFound;
    HashIndexNode *ite = head, *prev = head;
    while (ite != NULL)
    {
        if (ite->ptrToKey_ ==  keyPtr)
        {
            prev->next_ = ite->next_;
            chunk->free(db, ite);
            if ( ite == head) { head = NULL; return SplCase; }
            return OK;
        }
        prev = ite;
        ite = ite->next_;
    }
    printError(ErrNotFound, "Node not found in the bucket list");
    return ErrNotFound;
}

Here is the call graph for this function:

Here is the caller graph for this function:

---

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

• include/Index.h
• src/server/BucketList.cxx

---