BTreeAccessBaseImpl.h

Go to the documentation of this file.
00001 /*
00002 // $Id: //open/dev/fennel/btree/BTreeAccessBaseImpl.h#8 $
00003 // Fennel is a library of data storage and processing components.
00004 // Copyright (C) 2005-2009 The Eigenbase Project
00005 // Copyright (C) 2005-2009 SQLstream, Inc.
00006 // Copyright (C) 2005-2009 LucidEra, Inc.
00007 // Portions Copyright (C) 1999-2009 John V. Sichi
00008 //
00009 // This program is free software; you can redistribute it and/or modify it
00010 // under the terms of the GNU General Public License as published by the Free
00011 // Software Foundation; either version 2 of the License, or (at your option)
00012 // any later version approved by The Eigenbase Project.
00013 //
00014 // This program is distributed in the hope that it will be useful,
00015 // but WITHOUT ANY WARRANTY; without even the implied warranty of
00016 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
00017 // GNU General Public License for more details.
00018 //
00019 // You should have received a copy of the GNU General Public License
00020 // along with this program; if not, write to the Free Software
00021 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
00022 */
00023 
00024 #ifndef Fennel_BTreeAccessBaseImpl_Included
00025 #define Fennel_BTreeAccessBaseImpl_Included
00026 
00027 #include "fennel/btree/BTreeAccessBase.h"
00028 #include "fennel/btree/BTreeNodeAccessor.h"
00029 
00030 FENNEL_BEGIN_NAMESPACE
00031 
00032 inline BTreeNodeAccessor &BTreeAccessBase::getLeafNodeAccessor(
00033     BTreeNode const &node)
00034 {
00035     assert(!node.height);
00036     return *pLeafNodeAccessor;
00037 }
00038 
00039 inline BTreeNodeAccessor &BTreeAccessBase::getNonLeafNodeAccessor(
00040     BTreeNode const &node)
00041 {
00042     assert(node.height);
00043     return *pNonLeafNodeAccessor;
00044 }
00045 
00046 inline BTreeNodeAccessor &BTreeAccessBase::getNodeAccessor(
00047     BTreeNode const &node)
00048 {
00049     if (node.height) {
00050         return *pNonLeafNodeAccessor;
00051     } else {
00052         return *pLeafNodeAccessor;
00053     }
00054 }
00055 
00056 inline PageId BTreeAccessBase::getChildForCurrent()
00057 {
00058     TupleDatum &childDatum = pNonLeafNodeAccessor->tupleData.back();
00059     pChildAccessor->unmarshalValue(
00060         pNonLeafNodeAccessor->tupleAccessor,childDatum);
00061     return *reinterpret_cast<PageId const *>(childDatum.pData);
00062 }
00063 
00064 inline PageId BTreeAccessBase::getChild(BTreeNode const &node,uint iChild)
00065 {
00066     getNonLeafNodeAccessor(node).accessTuple(node,iChild);
00067     return getChildForCurrent();
00068 }
00069 
00070 inline PageId BTreeAccessBase::getRightSibling(PageId pageId)
00071 {
00072     return getSegment()->getPageSuccessor(pageId);
00073 }
00074 
00075 inline void BTreeAccessBase::setRightSibling(
00076     BTreeNode &leftNode,PageId leftPageId,PageId rightPageId)
00077 {
00078     getSegment()->setPageSuccessor(leftPageId,rightPageId);
00079     leftNode.rightSibling = rightPageId;
00080 }
00081 
00082 FENNEL_END_NAMESPACE
00083 
00084 #endif
00085 
00086 // End BTreeAccessBaseImpl.h

Generated on Mon Jun 22 04:00:13 2009 for Fennel by  doxygen 1.5.1