Lines 120-126
Link Here
|
120 |
ValueType nValue = 0; |
120 |
ValueType nValue = 0; |
121 |
if (!mbTreeSearchEnabled) |
121 |
if (!mbTreeSearchEnabled) |
122 |
{ |
122 |
{ |
123 |
maSegments.search(nPos, nValue); |
123 |
maSegments.search(nPos, nValue).second; |
124 |
return nValue; |
124 |
return nValue; |
125 |
} |
125 |
} |
126 |
|
126 |
|
Lines 127-133
Link Here
|
127 |
if (!maSegments.is_tree_valid()) |
127 |
if (!maSegments.is_tree_valid()) |
128 |
maSegments.build_tree(); |
128 |
maSegments.build_tree(); |
129 |
|
129 |
|
130 |
maSegments.search_tree(nPos, nValue); |
130 |
maSegments.search_tree(nPos, nValue).second; |
131 |
return nValue; |
131 |
return nValue; |
132 |
} |
132 |
} |
133 |
|
133 |
|
Lines 171-183
Link Here
|
171 |
if (!maSegments.is_tree_valid()) |
171 |
if (!maSegments.is_tree_valid()) |
172 |
maSegments.build_tree(); |
172 |
maSegments.build_tree(); |
173 |
|
173 |
|
174 |
if (!maSegments.search_tree(nPos, nValue, &nPos1, &nPos2)) |
174 |
if (!maSegments.search_tree(nPos, nValue, &nPos1, &nPos2).second) |
175 |
return false; |
175 |
return false; |
176 |
} |
176 |
} |
177 |
else |
177 |
else |
178 |
{ |
178 |
{ |
179 |
// Conduct leaf-node only search. Faster when searching between range insertion. |
179 |
// Conduct leaf-node only search. Faster when searching between range insertion. |
180 |
if (!maSegments.search(nPos, nValue, &nPos1, &nPos2)) |
180 |
if (!maSegments.search(nPos, nValue, &nPos1, &nPos2).second) |
181 |
return false; |
181 |
return false; |
182 |
} |
182 |
} |
183 |
|
183 |
|