Lines Matching defs:end
211 BTree::Node::Copy(const Node* origin, uint32 start, uint32 end, int length)
220 // like removing [0, start - 1] and keeping [start, end]
222 _Copy(origin, 0, start, end, length);
224 // removing all items in [start, end]
227 if (end + 1 < origin->ItemCount()) {
228 // ..., end] -->
230 length += origin->_CalculateSpace(start, end);
231 _Copy(origin, start, end + 1, origin->ItemCount() - 1, length);
234 // inserting in [start, end] - make a hole for later
238 length -= origin->_CalculateSpace(start, end);
239 _Copy(origin, end + 1, start, origin->ItemCount() - 1, length);
248 BTree::Node::MoveEntries(uint32 start, uint32 end, int length) const
259 end++;
261 // removing [start, end]
262 TRACE("Node::MoveEntries() removing ... start %" B_PRIu32 " end %"
263 B_PRIu32 " length %i\n", start, end, length);
264 length += _CalculateSpace(start, end - 1);
267 // inserting into [start, end] - make room for later
268 TRACE("Node::MoveEntries() inserting ... start %" B_PRIu32 " end %"
269 B_PRIu32 " length %i\n", start, end, length);
270 length -= _CalculateSpace(start, end - 1);
272 start = end;
273 end = tmp;
276 if (end >= ItemCount())
279 int dataSize = _CalculateSpace(end, ItemCount() - 1, 2);
281 memmove(base + start * entrySize, base + end * entrySize,
282 _CalculateSpace(end, ItemCount() - 1));
285 int num = start - end;