1247
1247
Queries against the combined index will be made against the first index,
1248
and then the second and so on. The order of index's can thus influence
1248
and then the second and so on. The order of indices can thus influence
1249
1249
performance significantly. For example, if one index is on local disk and a
1250
1250
second on a remote server, the local disk index should be before the other
1251
1251
in the index list.
1253
Also, queries tend to need results from the same indices as previous
1254
queries. So the indices will be reordered after every query to put the
1255
indices that had the result(s) of that query first (while otherwise
1256
preserving the relative ordering).
1254
1259
def __init__(self, indices, reload_func=None):
1262
1267
self._indices = indices
1263
1268
self._reload_func = reload_func
1269
# Sibling indices are other CombinedGraphIndex that we should call
1270
# _move_to_front_by_name on when we auto-reorder ourself.
1271
self._sibling_indices = []
1272
# A list of names that corresponds to the instances in self._indices,
1273
# so _index_names[0] is always the name for _indices[0], etc. Sibling
1274
# indices must all use the same set of names as each other.
1275
self._index_names = [None] * len(self._indices)
1265
1277
def __repr__(self):
1266
1278
return "%s(%s)" % (
1290
1302
has_key = _has_key_from_parent_map
1292
def insert_index(self, pos, index):
1304
def insert_index(self, pos, index, name=None):
1293
1305
"""Insert a new index in the list of indices to query.
1295
1307
:param pos: The position to insert the index.
1296
1308
:param index: The index to insert.
1309
:param name: a name for this index, e.g. a pack name. These names can
1310
be used to reflect index reorderings to related CombinedGraphIndex
1311
instances that use the same names. (see set_sibling_indices)
1298
1313
self._indices.insert(pos, index)
1314
self._index_names.insert(pos, name)
1300
1316
def iter_all_entries(self):
1301
1317
"""Iterate over all keys within the index
1326
1342
value and are only reported once.
1328
1344
:param keys: An iterable providing the keys to be retrieved.
1329
:return: An iterable of (index, key, reference_lists, value). There is no
1330
defined order for the result iteration - it will be in the most
1345
:return: An iterable of (index, key, reference_lists, value). There is
1346
no defined order for the result iteration - it will be in the most
1331
1347
efficient order for the index.
1333
1349
keys = set(keys)
1336
1353
for index in self._indices:
1339
1357
for node in index.iter_entries(keys):
1340
1358
keys.remove(node[1])
1362
hit_indices.append(index)
1343
1364
except errors.NoSuchFile:
1344
1365
self._reload_or_raise()
1366
self._move_to_front(hit_indices)
1346
1368
def iter_entries_prefix(self, keys):
1347
1369
"""Iterate over keys within the index using prefix matching.
1369
1391
seen_keys = set()
1372
1395
for index in self._indices:
1373
1397
for node in index.iter_entries_prefix(keys):
1374
1398
if node[1] in seen_keys:
1376
1400
seen_keys.add(node[1])
1404
hit_indices.append(index)
1379
1406
except errors.NoSuchFile:
1380
1407
self._reload_or_raise()
1408
self._move_to_front(hit_indices)
1410
def _move_to_front(self, hit_indices):
1411
"""Rearrange self._indices so that hit_indices are first.
1413
Order is maintained as much as possible, e.g. the first unhit index
1414
will be the first index in _indices after the hit_indices, and the
1415
hit_indices will be present in exactly the order they are passed to
1418
_move_to_front propagates to all objects in self._sibling_indices by
1419
calling _move_to_front_by_name.
1421
if self._indices[:len(hit_indices)] == hit_indices:
1422
# The 'hit_indices' are already at the front (and in the same
1423
# order), no need to re-order
1425
hit_names = self._move_to_front_by_index(hit_indices)
1426
for sibling_idx in self._sibling_indices:
1427
sibling_idx._move_to_front_by_name(hit_names)
1429
def _move_to_front_by_index(self, hit_indices):
1430
"""Core logic for _move_to_front.
1432
Returns a list of names corresponding to the hit_indices param.
1434
indices_info = zip(self._index_names, self._indices)
1435
if 'index' in debug.debug_flags:
1436
mutter('CombinedGraphIndex reordering: currently %r, promoting %r',
1437
indices_info, hit_indices)
1440
new_hit_indices = []
1443
for offset, (name, idx) in enumerate(indices_info):
1444
if idx in hit_indices:
1445
hit_names.append(name)
1446
new_hit_indices.append(idx)
1447
if len(new_hit_indices) == len(hit_indices):
1448
# We've found all of the hit entries, everything else is
1450
unhit_names.extend(self._index_names[offset+1:])
1451
unhit_indices.extend(self._indices[offset+1:])
1454
unhit_names.append(name)
1455
unhit_indices.append(idx)
1457
self._indices = new_hit_indices + unhit_indices
1458
self._index_names = hit_names + unhit_names
1459
if 'index' in debug.debug_flags:
1460
mutter('CombinedGraphIndex reordered: %r', self._indices)
1463
def _move_to_front_by_name(self, hit_names):
1464
"""Moves indices named by 'hit_names' to front of the search order, as
1465
described in _move_to_front.
1467
# Translate names to index instances, and then call
1468
# _move_to_front_by_index.
1469
indices_info = zip(self._index_names, self._indices)
1471
for name, idx in indices_info:
1472
if name in hit_names:
1473
hit_indices.append(idx)
1474
self._move_to_front_by_index(hit_indices)
1382
1476
def find_ancestry(self, keys, ref_list_num):
1383
1477
"""Find the complete ancestry for the given set of keys.
added
removed
bzrlib/index.py
