|
sl@0
|
1 |
// Copyright (c) 1998-2009 Nokia Corporation and/or its subsidiary(-ies).
|
|
sl@0
|
2 |
// All rights reserved.
|
|
sl@0
|
3 |
// This component and the accompanying materials are made available
|
|
sl@0
|
4 |
// under the terms of "Eclipse Public License v1.0"
|
|
sl@0
|
5 |
// which accompanies this distribution, and is available
|
|
sl@0
|
6 |
// at the URL "http://www.eclipse.org/legal/epl-v10.html".
|
|
sl@0
|
7 |
//
|
|
sl@0
|
8 |
// Initial Contributors:
|
|
sl@0
|
9 |
// Nokia Corporation - initial contribution.
|
|
sl@0
|
10 |
//
|
|
sl@0
|
11 |
// Contributors:
|
|
sl@0
|
12 |
//
|
|
sl@0
|
13 |
// Description:
|
|
sl@0
|
14 |
//
|
|
sl@0
|
15 |
|
|
sl@0
|
16 |
#include "UB_STD.H"
|
|
sl@0
|
17 |
|
|
sl@0
|
18 |
EXPORT_C void MBtreeNodeOrg::Init(TAny* aNode) const
|
|
sl@0
|
19 |
//
|
|
sl@0
|
20 |
// Default node initialisation just zero filling.
|
|
sl@0
|
21 |
//
|
|
sl@0
|
22 |
{
|
|
sl@0
|
23 |
Mem::FillZ(aNode,KPoolPageSize);
|
|
sl@0
|
24 |
}
|
|
sl@0
|
25 |
|
|
sl@0
|
26 |
EXPORT_C TBool MBtreeLeafOrg::Search(const TAny* aNode,const TAny* aKey,const MBtreeKey& aComp,TBool aLast,TInt& aPos) const
|
|
sl@0
|
27 |
//
|
|
sl@0
|
28 |
// Default to using a binary search through the node, using KeyAt and the key's comparison.
|
|
sl@0
|
29 |
// if aLast is 1, aEntry is the first > the key, return true if previous entry is a match
|
|
sl@0
|
30 |
// if aLast is 0, aEntry is the first entry >= the key, return true is current entry is a match
|
|
sl@0
|
31 |
//
|
|
sl@0
|
32 |
{
|
|
sl@0
|
33 |
TInt match=EFalse;
|
|
sl@0
|
34 |
TInt rr=LastEntry(aNode)-1;
|
|
sl@0
|
35 |
TInt ll=0;
|
|
sl@0
|
36 |
__ASSERT_DEBUG(rr>=-1,Panic(EBadEntryCount));
|
|
sl@0
|
37 |
while (ll<=rr)
|
|
sl@0
|
38 |
{
|
|
sl@0
|
39 |
TInt mm=(rr+ll)>>1;
|
|
sl@0
|
40 |
TInt res=aComp.Compare(aKey,aComp.Key(EntryPtr(aNode,mm)));
|
|
sl@0
|
41 |
if (res==0)
|
|
sl@0
|
42 |
match=ETrue;
|
|
sl@0
|
43 |
if (res+aLast<=0)
|
|
sl@0
|
44 |
rr=mm-1; // compare < 0 or match and aLast=0
|
|
sl@0
|
45 |
else
|
|
sl@0
|
46 |
ll=mm+1; // compare > 0 or match and aLast=1
|
|
sl@0
|
47 |
}
|
|
sl@0
|
48 |
aPos=ll;
|
|
sl@0
|
49 |
return match;
|
|
sl@0
|
50 |
}
|
|
sl@0
|
51 |
|
|
sl@0
|
52 |
EXPORT_C TBool MBtreeLeafOrg::InsertOverflow(TAny*,TAny*,TInt,TBool,const TDesC8&) const
|
|
sl@0
|
53 |
//
|
|
sl@0
|
54 |
// For simple implementations allow this to be unimplemented. Report failure
|
|
sl@0
|
55 |
//
|
|
sl@0
|
56 |
{
|
|
sl@0
|
57 |
return EFalse;
|
|
sl@0
|
58 |
}
|
|
sl@0
|
59 |
|
|
sl@0
|
60 |
EXPORT_C TBool MBtreeIndexOrg::Search(const TAny* aNode,const TAny* aKey,const MBtreeKey& aComp,TBool aLast,TInt& aPos) const
|
|
sl@0
|
61 |
//
|
|
sl@0
|
62 |
// Default to using a binary search through the node, using KeyAt and the key's comparison.
|
|
sl@0
|
63 |
// if aLast is 1, aEntry is the first > the key
|
|
sl@0
|
64 |
// if aLast is 0, aEntry is the first entry >= the key
|
|
sl@0
|
65 |
//
|
|
sl@0
|
66 |
{
|
|
sl@0
|
67 |
TInt rr=LastEntry(aNode);
|
|
sl@0
|
68 |
TInt ll=-1;
|
|
sl@0
|
69 |
__ASSERT_DEBUG(rr>0,Panic(EBadEntryCount));
|
|
sl@0
|
70 |
while (rr>ll+1)
|
|
sl@0
|
71 |
{
|
|
sl@0
|
72 |
TInt mm=(rr+ll)>>1;
|
|
sl@0
|
73 |
if (aComp.Compare(aKey,EntryPtr(aNode,mm))+aLast<=0)
|
|
sl@0
|
74 |
rr=mm; // compare < 0 or match and aLast=0
|
|
sl@0
|
75 |
else
|
|
sl@0
|
76 |
ll=mm; // compare > 0 or match and aLast=1
|
|
sl@0
|
77 |
}
|
|
sl@0
|
78 |
aPos=rr;
|
|
sl@0
|
79 |
return EFalse; // return not used
|
|
sl@0
|
80 |
}
|
|
sl@0
|
81 |
|
|
sl@0
|
82 |
EXPORT_C TBool MBtreeIndexOrg::InsertOverflow(TAny*,TAny*,TInt,TBool,const TDesC8&,TPageRef,const TDesC8&,TBtreePivot&) const
|
|
sl@0
|
83 |
//
|
|
sl@0
|
84 |
// For simple implementations allow this to be unimplemented. Report failure.
|
|
sl@0
|
85 |
//
|
|
sl@0
|
86 |
{
|
|
sl@0
|
87 |
return EFalse;
|
|
sl@0
|
88 |
}
|
|
sl@0
|
89 |
|
|
sl@0
|
90 |
EXPORT_C TBool MBtreeIndexOrg::Update(TAny*,TInt,const TDesC8&) const
|
|
sl@0
|
91 |
//
|
|
sl@0
|
92 |
// Allow to be unimplemented. Return failure.
|
|
sl@0
|
93 |
//
|
|
sl@0
|
94 |
{
|
|
sl@0
|
95 |
return EFalse;
|
|
sl@0
|
96 |
}
|
|
sl@0
|
97 |
|