/brz/remove-bazaar : contents of breezy/tests/test

: (revision 6670.4.8)

To get this branch, use:

bzr branch
http://gegoxaren.bato24.eu/bzr/brz/remove-bazaar

4763.2.4 by John Arbash Meinel merge bzr.2.1 in preparation for NEWS entry.	1	# Copyright (C) 2007-2010 Canonical Ltd
2592.1.4 by Robert Collins Create a GraphIndexBuilder.	2	#
	3	# This program is free software; you can redistribute it and/or modify
	4	# it under the terms of the GNU General Public License as published by
	5	# the Free Software Foundation; either version 2 of the License, or
	6	# (at your option) any later version.
	7	#
	8	# This program is distributed in the hope that it will be useful,
	9	# but WITHOUT ANY WARRANTY; without even the implied warranty of
	10	# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	11	# GNU General Public License for more details.
	12	#
	13	# You should have received a copy of the GNU General Public License
	14	# along with this program; if not, write to the Free Software
4183.7.1 by Sabin Iacob update FSF mailing address	15	# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
2592.1.4 by Robert Collins Create a GraphIndexBuilder.	16
	17	"""Tests for indices."""
	18
6624 by Jelmer Vernooĳ Merge Python3 porting work ('py3 pokes')	19	from .. import (
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	20	errors,
	21	tests,
	22	transport,
	23	)
6670.4.1 by Jelmer Vernooij Update imports.	24	from ..bzr import (
	25	index,
	26	)
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	27
	28
	29	class TestGraphIndexBuilder(tests.TestCaseWithMemoryTransport):
2592.1.4 by Robert Collins Create a GraphIndexBuilder.	30
2592.1.4 by Robert Collins Create a GraphIndexBuilder.	31	def test_build_index_empty(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	32	builder = index.GraphIndexBuilder()
2592.1.4 by Robert Collins Create a GraphIndexBuilder.	33	stream = builder.finish()
2592.1.4 by Robert Collins Create a GraphIndexBuilder.	34	contents = stream.read()
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	35	self.assertEqual(
	36	"Bazaar Graph Index 1\nnode_ref_lists=0\nkey_elements=1\nlen=0\n\n",
	37	contents)
2592.1.6 by Robert Collins Record the number of node reference lists a particular index has.	38
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	39	def test_build_index_empty_two_element_keys(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	40	builder = index.GraphIndexBuilder(key_elements=2)
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	41	stream = builder.finish()
	42	contents = stream.read()
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	43	self.assertEqual(
	44	"Bazaar Graph Index 1\nnode_ref_lists=0\nkey_elements=2\nlen=0\n\n",
	45	contents)
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	46
2592.1.6 by Robert Collins Record the number of node reference lists a particular index has.	47	def test_build_index_one_reference_list_empty(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	48	builder = index.GraphIndexBuilder(reference_lists=1)
2592.1.6 by Robert Collins Record the number of node reference lists a particular index has.	49	stream = builder.finish()
	50	contents = stream.read()
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	51	self.assertEqual(
	52	"Bazaar Graph Index 1\nnode_ref_lists=1\nkey_elements=1\nlen=0\n\n",
	53	contents)
2592.1.4 by Robert Collins Create a GraphIndexBuilder.	54
2592.1.10 by Robert Collins Make validate detect node reference parsing errors.	55	def test_build_index_two_reference_list_empty(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	56	builder = index.GraphIndexBuilder(reference_lists=2)
2592.1.10 by Robert Collins Make validate detect node reference parsing errors.	57	stream = builder.finish()
	58	contents = stream.read()
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	59	self.assertEqual(
	60	"Bazaar Graph Index 1\nnode_ref_lists=2\nkey_elements=1\nlen=0\n\n",
	61	contents)
2592.1.10 by Robert Collins Make validate detect node reference parsing errors.	62
2592.1.46 by Robert Collins Make GraphIndex accept nodes as key, value, references, so that the method	63	def test_build_index_one_node_no_refs(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	64	builder = index.GraphIndexBuilder()
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	65	builder.add_node(('akey', ), 'data')
2592.1.46 by Robert Collins Make GraphIndex accept nodes as key, value, references, so that the method	66	stream = builder.finish()
	67	contents = stream.read()
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	68	self.assertEqual(
	69	"Bazaar Graph Index 1\nnode_ref_lists=0\nkey_elements=1\nlen=1\n"
2592.1.46 by Robert Collins Make GraphIndex accept nodes as key, value, references, so that the method	70	"akey\x00\x00\x00data\n\n", contents)
	71
	72	def test_build_index_one_node_no_refs_accepts_empty_reflist(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	73	builder = index.GraphIndexBuilder()
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	74	builder.add_node(('akey', ), 'data', ())
2592.1.12 by Robert Collins Handle basic node adds.	75	stream = builder.finish()
2592.1.12 by Robert Collins Handle basic node adds.	76	contents = stream.read()
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	77	self.assertEqual(
	78	"Bazaar Graph Index 1\nnode_ref_lists=0\nkey_elements=1\nlen=1\n"
2592.1.43 by Robert Collins Various index tweaks and test clarity from John's review.	79	"akey\x00\x00\x00data\n\n", contents)
2592.1.12 by Robert Collins Handle basic node adds.	80
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	81	def test_build_index_one_node_2_element_keys(self):
2624.2.11 by Robert Collins Review comments.	82	# multipart keys are separated by \x00 - because they are fixed length,
	83	# not variable this does not cause any issues, and seems clearer to the
	84	# author.
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	85	builder = index.GraphIndexBuilder(key_elements=2)
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	86	builder.add_node(('akey', 'secondpart'), 'data')
	87	stream = builder.finish()
	88	contents = stream.read()
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	89	self.assertEqual(
	90	"Bazaar Graph Index 1\nnode_ref_lists=0\nkey_elements=2\nlen=1\n"
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	91	"akey\x00secondpart\x00\x00\x00data\n\n", contents)
	92
2592.1.21 by Robert Collins Empty values are ok.	93	def test_add_node_empty_value(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	94	builder = index.GraphIndexBuilder()
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	95	builder.add_node(('akey', ), '')
2592.1.21 by Robert Collins Empty values are ok.	96	stream = builder.finish()
2592.1.21 by Robert Collins Empty values are ok.	97	contents = stream.read()
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	98	self.assertEqual(
	99	"Bazaar Graph Index 1\nnode_ref_lists=0\nkey_elements=1\nlen=1\n"
2592.1.43 by Robert Collins Various index tweaks and test clarity from John's review.	100	"akey\x00\x00\x00\n\n", contents)
2592.1.21 by Robert Collins Empty values are ok.	101
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	102	def test_build_index_nodes_sorted(self):
2592.1.17 by Robert Collins Multi node sort order is defined.	103	# the highest sorted node comes first.
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	104	builder = index.GraphIndexBuilder()
2592.1.17 by Robert Collins Multi node sort order is defined.	105	# use three to have a good chance of glitching dictionary hash
	106	# lookups etc. Insert in randomish order that is not correct
	107	# and not the reverse of the correct order.
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	108	builder.add_node(('2002', ), 'data')
	109	builder.add_node(('2000', ), 'data')
	110	builder.add_node(('2001', ), 'data')
2592.1.17 by Robert Collins Multi node sort order is defined.	111	stream = builder.finish()
	112	contents = stream.read()
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	113	self.assertEqual(
	114	"Bazaar Graph Index 1\nnode_ref_lists=0\nkey_elements=1\nlen=3\n"
2592.1.43 by Robert Collins Various index tweaks and test clarity from John's review.	115	"2000\x00\x00\x00data\n"
	116	"2001\x00\x00\x00data\n"
	117	"2002\x00\x00\x00data\n"
2592.1.17 by Robert Collins Multi node sort order is defined.	118	"\n", contents)
	119
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	120	def test_build_index_2_element_key_nodes_sorted(self):
	121	# multiple element keys are sorted first-key, second-key.
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	122	builder = index.GraphIndexBuilder(key_elements=2)
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	123	# use three values of each key element, to have a good chance of
	124	# glitching dictionary hash lookups etc. Insert in randomish order that
	125	# is not correct and not the reverse of the correct order.
	126	builder.add_node(('2002', '2002'), 'data')
	127	builder.add_node(('2002', '2000'), 'data')
	128	builder.add_node(('2002', '2001'), 'data')
	129	builder.add_node(('2000', '2002'), 'data')
	130	builder.add_node(('2000', '2000'), 'data')
	131	builder.add_node(('2000', '2001'), 'data')
	132	builder.add_node(('2001', '2002'), 'data')
	133	builder.add_node(('2001', '2000'), 'data')
	134	builder.add_node(('2001', '2001'), 'data')
	135	stream = builder.finish()
	136	contents = stream.read()
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	137	self.assertEqual(
	138	"Bazaar Graph Index 1\nnode_ref_lists=0\nkey_elements=2\nlen=9\n"
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	139	"2000\x002000\x00\x00\x00data\n"
	140	"2000\x002001\x00\x00\x00data\n"
	141	"2000\x002002\x00\x00\x00data\n"
	142	"2001\x002000\x00\x00\x00data\n"
	143	"2001\x002001\x00\x00\x00data\n"
	144	"2001\x002002\x00\x00\x00data\n"
	145	"2002\x002000\x00\x00\x00data\n"
	146	"2002\x002001\x00\x00\x00data\n"
	147	"2002\x002002\x00\x00\x00data\n"
	148	"\n", contents)
	149
2592.1.19 by Robert Collins Node references are tab separated.	150	def test_build_index_reference_lists_are_included_one(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	151	builder = index.GraphIndexBuilder(reference_lists=1)
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	152	builder.add_node(('key', ), 'data', ([], ))
2592.1.19 by Robert Collins Node references are tab separated.	153	stream = builder.finish()
	154	contents = stream.read()
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	155	self.assertEqual(
	156	"Bazaar Graph Index 1\nnode_ref_lists=1\nkey_elements=1\nlen=1\n"
2592.1.43 by Robert Collins Various index tweaks and test clarity from John's review.	157	"key\x00\x00\x00data\n"
2592.1.19 by Robert Collins Node references are tab separated.	158	"\n", contents)
	159
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	160	def test_build_index_reference_lists_with_2_element_keys(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	161	builder = index.GraphIndexBuilder(reference_lists=1, key_elements=2)
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	162	builder.add_node(('key', 'key2'), 'data', ([], ))
	163	stream = builder.finish()
	164	contents = stream.read()
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	165	self.assertEqual(
	166	"Bazaar Graph Index 1\nnode_ref_lists=1\nkey_elements=2\nlen=1\n"
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	167	"key\x00key2\x00\x00\x00data\n"
	168	"\n", contents)
	169
2592.1.19 by Robert Collins Node references are tab separated.	170	def test_build_index_reference_lists_are_included_two(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	171	builder = index.GraphIndexBuilder(reference_lists=2)
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	172	builder.add_node(('key', ), 'data', ([], []))
2592.1.19 by Robert Collins Node references are tab separated.	173	stream = builder.finish()
	174	contents = stream.read()
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	175	self.assertEqual(
	176	"Bazaar Graph Index 1\nnode_ref_lists=2\nkey_elements=1\nlen=1\n"
2592.1.43 by Robert Collins Various index tweaks and test clarity from John's review.	177	"key\x00\x00\t\x00data\n"
2592.1.19 by Robert Collins Node references are tab separated.	178	"\n", contents)
	179
4744.2.7 by John Arbash Meinel Add .clear_cache() members to GraphIndexBuilder and BTreeBuilder.	180	def test_clear_cache(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	181	builder = index.GraphIndexBuilder(reference_lists=2)
4744.2.7 by John Arbash Meinel Add .clear_cache() members to GraphIndexBuilder and BTreeBuilder.	182	# This is a no-op, but the api should exist
	183	builder.clear_cache()
	184
2592.1.22 by Robert Collins Node references are byte offsets.	185	def test_node_references_are_byte_offsets(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	186	builder = index.GraphIndexBuilder(reference_lists=1)
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	187	builder.add_node(('reference', ), 'data', ([], ))
	188	builder.add_node(('key', ), 'data', ([('reference', )], ))
2592.1.22 by Robert Collins Node references are byte offsets.	189	stream = builder.finish()
	190	contents = stream.read()
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	191	self.assertEqual(
	192	"Bazaar Graph Index 1\nnode_ref_lists=1\nkey_elements=1\nlen=2\n"
	193	"key\x00\x0072\x00data\n"
2592.1.40 by Robert Collins Reverse index ordering - we do not have date prefixed revids.	194	"reference\x00\x00\x00data\n"
2592.1.22 by Robert Collins Node references are byte offsets.	195	"\n", contents)
	196
2592.1.23 by Robert Collins node reference delimiting tested.	197	def test_node_references_are_cr_delimited(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	198	builder = index.GraphIndexBuilder(reference_lists=1)
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	199	builder.add_node(('reference', ), 'data', ([], ))
	200	builder.add_node(('reference2', ), 'data', ([], ))
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	201	builder.add_node(('key', ), 'data',
	202	([('reference', ), ('reference2', )], ))
2592.1.23 by Robert Collins node reference delimiting tested.	203	stream = builder.finish()
	204	contents = stream.read()
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	205	self.assertEqual(
	206	"Bazaar Graph Index 1\nnode_ref_lists=1\nkey_elements=1\nlen=3\n"
	207	"key\x00\x00077\r094\x00data\n"
2592.1.43 by Robert Collins Various index tweaks and test clarity from John's review.	208	"reference\x00\x00\x00data\n"
	209	"reference2\x00\x00\x00data\n"
2592.1.23 by Robert Collins node reference delimiting tested.	210	"\n", contents)
	211
2592.1.24 by Robert Collins Delimiting of multiple reference lists is by \t	212	def test_multiple_reference_lists_are_tab_delimited(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	213	builder = index.GraphIndexBuilder(reference_lists=2)
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	214	builder.add_node(('keference', ), 'data', ([], []))
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	215	builder.add_node(('rey', ), 'data',
	216	([('keference', )], [('keference', )]))
2592.1.24 by Robert Collins Delimiting of multiple reference lists is by \t	217	stream = builder.finish()
	218	contents = stream.read()
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	219	self.assertEqual(
	220	"Bazaar Graph Index 1\nnode_ref_lists=2\nkey_elements=1\nlen=2\n"
2592.1.43 by Robert Collins Various index tweaks and test clarity from John's review.	221	"keference\x00\x00\t\x00data\n"
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	222	"rey\x00\x0059\t59\x00data\n"
2592.1.24 by Robert Collins Delimiting of multiple reference lists is by \t	223	"\n", contents)
	224
2592.1.25 by Robert Collins Fix and tune node offset calculation.	225	def test_add_node_referencing_missing_key_makes_absent(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	226	builder = index.GraphIndexBuilder(reference_lists=1)
	227	builder.add_node(('rey', ), 'data',
	228	([('beference', ), ('aeference2', )], ))
2592.1.25 by Robert Collins Fix and tune node offset calculation.	229	stream = builder.finish()
	230	contents = stream.read()
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	231	self.assertEqual(
	232	"Bazaar Graph Index 1\nnode_ref_lists=1\nkey_elements=1\nlen=1\n"
2592.1.43 by Robert Collins Various index tweaks and test clarity from John's review.	233	"aeference2\x00a\x00\x00\n"
	234	"beference\x00a\x00\x00\n"
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	235	"rey\x00\x00074\r059\x00data\n"
2592.1.25 by Robert Collins Fix and tune node offset calculation.	236	"\n", contents)
	237
2592.1.26 by Robert Collins Test digit buffering is accurate.	238	def test_node_references_three_digits(self):
	239	# test the node digit expands as needed.
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	240	builder = index.GraphIndexBuilder(reference_lists=1)
6651.2.2 by Martin Apply 2to3 xrange fix and fix up with sixish range	241	references = [(str(val), ) for val in range(8, -1, -1)]
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	242	builder.add_node(('2-key', ), '', (references, ))
2592.1.26 by Robert Collins Test digit buffering is accurate.	243	stream = builder.finish()
	244	contents = stream.read()
4789.28.2 by John Arbash Meinel Get rid of the GraphIndexBuilder/BTreeBuilder._keys attribute.	245	self.assertEqualDiff(
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	246	"Bazaar Graph Index 1\nnode_ref_lists=1\nkey_elements=1\nlen=1\n"
2592.1.40 by Robert Collins Reverse index ordering - we do not have date prefixed revids.	247	"0\x00a\x00\x00\n"
	248	"1\x00a\x00\x00\n"
	249	"2\x00a\x00\x00\n"
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	250	"2-key\x00\x00151\r145\r139\r133\r127\r121\r071\r065\r059\x00\n"
2592.1.40 by Robert Collins Reverse index ordering - we do not have date prefixed revids.	251	"3\x00a\x00\x00\n"
	252	"4\x00a\x00\x00\n"
	253	"5\x00a\x00\x00\n"
	254	"6\x00a\x00\x00\n"
	255	"7\x00a\x00\x00\n"
2592.1.26 by Robert Collins Test digit buffering is accurate.	256	"8\x00a\x00\x00\n"
2592.1.40 by Robert Collins Reverse index ordering - we do not have date prefixed revids.	257	"\n", contents)
	258
	259	def test_absent_has_no_reference_overhead(self):
	260	# the offsets after an absent record should be correct when there are
	261	# >1 reference lists.
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	262	builder = index.GraphIndexBuilder(reference_lists=2)
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	263	builder.add_node(('parent', ), '', ([('aail', ), ('zther', )], []))
2592.1.40 by Robert Collins Reverse index ordering - we do not have date prefixed revids.	264	stream = builder.finish()
	265	contents = stream.read()
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	266	self.assertEqual(
	267	"Bazaar Graph Index 1\nnode_ref_lists=2\nkey_elements=1\nlen=1\n"
2592.1.40 by Robert Collins Reverse index ordering - we do not have date prefixed revids.	268	"aail\x00a\x00\x00\n"
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	269	"parent\x00\x0059\r84\t\x00\n"
2592.1.40 by Robert Collins Reverse index ordering - we do not have date prefixed revids.	270	"zther\x00a\x00\x00\n"
2592.1.26 by Robert Collins Test digit buffering is accurate.	271	"\n", contents)
	272
2592.1.13 by Robert Collins Handle mismatched numbers of reference lists.	273	def test_add_node_bad_key(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	274	builder = index.GraphIndexBuilder()
2592.1.14 by Robert Collins Detect bad reference key values.	275	for bad_char in '\t\n\x0b\x0c\r\x00 ':
	276	self.assertRaises(errors.BadIndexKey, builder.add_node,
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	277	('a%skey' % bad_char, ), 'data')
	278	self.assertRaises(errors.BadIndexKey, builder.add_node,
	279	('', ), 'data')
	280	self.assertRaises(errors.BadIndexKey, builder.add_node,
	281	'not-a-tuple', 'data')
	282	# not enough length
	283	self.assertRaises(errors.BadIndexKey, builder.add_node,
	284	(), 'data')
	285	# too long
	286	self.assertRaises(errors.BadIndexKey, builder.add_node,
	287	('primary', 'secondary'), 'data')
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	288	# secondary key elements get checked too:
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	289	builder = index.GraphIndexBuilder(key_elements=2)
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	290	for bad_char in '\t\n\x0b\x0c\r\x00 ':
	291	self.assertRaises(errors.BadIndexKey, builder.add_node,
	292	('prefix', 'a%skey' % bad_char), 'data')
2592.1.12 by Robert Collins Handle basic node adds.	293
2592.1.13 by Robert Collins Handle mismatched numbers of reference lists.	294	def test_add_node_bad_data(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	295	builder = index.GraphIndexBuilder()
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	296	self.assertRaises(errors.BadIndexValue, builder.add_node, ('akey', ),
2592.1.46 by Robert Collins Make GraphIndex accept nodes as key, value, references, so that the method	297	'data\naa')
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	298	self.assertRaises(errors.BadIndexValue, builder.add_node, ('akey', ),
2592.1.46 by Robert Collins Make GraphIndex accept nodes as key, value, references, so that the method	299	'data\x00aa')
2592.1.12 by Robert Collins Handle basic node adds.	300
2592.1.13 by Robert Collins Handle mismatched numbers of reference lists.	301	def test_add_node_bad_mismatched_ref_lists_length(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	302	builder = index.GraphIndexBuilder()
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	303	self.assertRaises(errors.BadIndexValue, builder.add_node, ('akey', ),
2592.1.46 by Robert Collins Make GraphIndex accept nodes as key, value, references, so that the method	304	'data aa', ([], ))
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	305	builder = index.GraphIndexBuilder(reference_lists=1)
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	306	self.assertRaises(errors.BadIndexValue, builder.add_node, ('akey', ),
2592.1.46 by Robert Collins Make GraphIndex accept nodes as key, value, references, so that the method	307	'data aa')
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	308	self.assertRaises(errors.BadIndexValue, builder.add_node, ('akey', ),
2592.1.46 by Robert Collins Make GraphIndex accept nodes as key, value, references, so that the method	309	'data aa', (), )
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	310	self.assertRaises(errors.BadIndexValue, builder.add_node, ('akey', ),
2592.1.46 by Robert Collins Make GraphIndex accept nodes as key, value, references, so that the method	311	'data aa', ([], []))
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	312	builder = index.GraphIndexBuilder(reference_lists=2)
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	313	self.assertRaises(errors.BadIndexValue, builder.add_node, ('akey', ),
2592.1.46 by Robert Collins Make GraphIndex accept nodes as key, value, references, so that the method	314	'data aa')
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	315	self.assertRaises(errors.BadIndexValue, builder.add_node, ('akey', ),
2592.1.46 by Robert Collins Make GraphIndex accept nodes as key, value, references, so that the method	316	'data aa', ([], ))
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	317	self.assertRaises(errors.BadIndexValue, builder.add_node, ('akey', ),
2592.1.46 by Robert Collins Make GraphIndex accept nodes as key, value, references, so that the method	318	'data aa', ([], [], []))
2592.1.13 by Robert Collins Handle mismatched numbers of reference lists.	319
2592.1.14 by Robert Collins Detect bad reference key values.	320	def test_add_node_bad_key_in_reference_lists(self):
	321	# first list, first key - trivial
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	322	builder = index.GraphIndexBuilder(reference_lists=1)
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	323	self.assertRaises(errors.BadIndexKey, builder.add_node, ('akey', ),
	324	'data aa', ([('a key', )], ))
	325	# references keys must be tuples too
	326	self.assertRaises(errors.BadIndexKey, builder.add_node, ('akey', ),
	327	'data aa', (['not-a-tuple'], ))
	328	# not enough length
	329	self.assertRaises(errors.BadIndexKey, builder.add_node, ('akey', ),
	330	'data aa', ([()], ))
	331	# too long
	332	self.assertRaises(errors.BadIndexKey, builder.add_node, ('akey', ),
	333	'data aa', ([('primary', 'secondary')], ))
2592.1.14 by Robert Collins Detect bad reference key values.	334	# need to check more than the first key in the list
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	335	self.assertRaises(errors.BadIndexKey, builder.add_node, ('akey', ),
	336	'data aa', ([('agoodkey', ), ('that is a bad key', )], ))
2592.1.14 by Robert Collins Detect bad reference key values.	337	# and if there is more than one list it should be getting checked
	338	# too
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	339	builder = index.GraphIndexBuilder(reference_lists=2)
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	340	self.assertRaises(errors.BadIndexKey, builder.add_node, ('akey', ),
2592.1.46 by Robert Collins Make GraphIndex accept nodes as key, value, references, so that the method	341	'data aa', ([], ['a bad key']))
2592.1.14 by Robert Collins Detect bad reference key values.	342
2592.1.15 by Robert Collins Detect duplicate key insertion.	343	def test_add_duplicate_key(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	344	builder = index.GraphIndexBuilder()
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	345	builder.add_node(('key', ), 'data')
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	346	self.assertRaises(errors.BadIndexDuplicateKey,
	347	builder.add_node, ('key', ), 'data')
2592.1.15 by Robert Collins Detect duplicate key insertion.	348
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	349	def test_add_duplicate_key_2_elements(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	350	builder = index.GraphIndexBuilder(key_elements=2)
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	351	builder.add_node(('key', 'key'), 'data')
	352	self.assertRaises(errors.BadIndexDuplicateKey, builder.add_node,
	353	('key', 'key'), 'data')
	354
2592.1.16 by Robert Collins Can add keys after referencing them.	355	def test_add_key_after_referencing_key(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	356	builder = index.GraphIndexBuilder(reference_lists=1)
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	357	builder.add_node(('key', ), 'data', ([('reference', )], ))
	358	builder.add_node(('reference', ), 'data', ([],))
2592.1.16 by Robert Collins Can add keys after referencing them.	359
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	360	def test_add_key_after_referencing_key_2_elements(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	361	builder = index.GraphIndexBuilder(reference_lists=1, key_elements=2)
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	362	builder.add_node(('k', 'ey'), 'data', ([('reference', 'tokey')], ))
	363	builder.add_node(('reference', 'tokey'), 'data', ([],))
	364
3777.5.3 by John Arbash Meinel Add Builder.set_optimize(for_size=True) for GraphIndexBuilder and BTreeBuilder.	365	def test_set_optimize(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	366	builder = index.GraphIndexBuilder(reference_lists=1, key_elements=2)
3777.5.3 by John Arbash Meinel Add Builder.set_optimize(for_size=True) for GraphIndexBuilder and BTreeBuilder.	367	builder.set_optimize(for_size=True)
	368	self.assertTrue(builder._optimize_for_size)
	369	builder.set_optimize(for_size=False)
	370	self.assertFalse(builder._optimize_for_size)
	371
2592.1.5 by Robert Collins Trivial index reading.	372
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	373	class TestGraphIndex(tests.TestCaseWithMemoryTransport):
2592.1.5 by Robert Collins Trivial index reading.	374
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	375	def make_key(self, number):
	376	return (str(number) + 'X'*100,)
	377
	378	def make_value(self, number):
	379	return str(number) + 'Y'*100
	380
	381	def make_nodes(self, count=64):
	382	# generate a big enough index that we only read some of it on a typical
	383	# bisection lookup.
	384	nodes = []
	385	for counter in range(count):
	386	nodes.append((self.make_key(counter), self.make_value(counter), ()))
	387	return nodes
	388
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	389	def make_index(self, ref_lists=0, key_elements=1, nodes=[]):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	390	builder = index.GraphIndexBuilder(ref_lists, key_elements=key_elements)
2624.2.17 by Robert Collins Review feedback.	391	for key, value, references in nodes:
2624.2.17 by Robert Collins Review feedback.	392	builder.add_node(key, value, references)
2592.1.5 by Robert Collins Trivial index reading.	393	stream = builder.finish()
6083.1.1 by Jelmer Vernooij Use get_transport_from_{url,path} in more places.	394	trans = transport.get_transport_from_url('trace+' + self.get_url())
2890.2.1 by Robert Collins * ``bzrlib.index.GraphIndex`` now requires a size parameter to the	395	size = trans.put_file('index', stream)
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	396	return index.GraphIndex(trans, 'index', size)
2592.1.5 by Robert Collins Trivial index reading.	397
5074.4.3 by John Arbash Meinel Actually implement offset support for GraphIndex.	398	def make_index_with_offset(self, ref_lists=0, key_elements=1, nodes=[],
	399	offset=0):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	400	builder = index.GraphIndexBuilder(ref_lists, key_elements=key_elements)
5074.4.3 by John Arbash Meinel Actually implement offset support for GraphIndex.	401	for key, value, references in nodes:
	402	builder.add_node(key, value, references)
	403	content = builder.finish().read()
	404	size = len(content)
	405	trans = self.get_transport()
	406	trans.put_bytes('index', (' '*offset) + content)
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	407	return index.GraphIndex(trans, 'index', size, offset=offset)
5074.4.3 by John Arbash Meinel Actually implement offset support for GraphIndex.	408
4744.2.6 by John Arbash Meinel Start exposing an GraphIndex.clear_cache() member.	409	def test_clear_cache(self):
	410	index = self.make_index()
	411	# For now, we just want to make sure the api is available. As this is
	412	# old code, we don't really worry if it does anything.
	413	index.clear_cache()
	414
2592.1.7 by Robert Collins A validate that goes boom.	415	def test_open_bad_index_no_error(self):
	416	trans = self.get_transport()
	417	trans.put_bytes('name', "not an index\n")
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	418	idx = index.GraphIndex(trans, 'name', 13)
2592.1.7 by Robert Collins A validate that goes boom.	419
5074.4.3 by John Arbash Meinel Actually implement offset support for GraphIndex.	420	def test_with_offset(self):
	421	nodes = self.make_nodes(200)
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	422	idx = self.make_index_with_offset(offset=1234567, nodes=nodes)
	423	self.assertEqual(200, idx.key_count())
5074.4.3 by John Arbash Meinel Actually implement offset support for GraphIndex.	424
	425	def test_buffer_all_with_offset(self):
	426	nodes = self.make_nodes(200)
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	427	idx = self.make_index_with_offset(offset=1234567, nodes=nodes)
	428	idx._buffer_all()
	429	self.assertEqual(200, idx.key_count())
5074.4.3 by John Arbash Meinel Actually implement offset support for GraphIndex.	430
	431	def test_side_effect_buffering_with_offset(self):
	432	nodes = self.make_nodes(20)
	433	index = self.make_index_with_offset(offset=1234567, nodes=nodes)
	434	index._transport.recommended_page_size = lambda:64*1024
	435	subset_nodes = [nodes[0][0], nodes[10][0], nodes[19][0]]
	436	entries = [n[1] for n in index.iter_entries(subset_nodes)]
	437	self.assertEqual(sorted(subset_nodes), sorted(entries))
	438	self.assertEqual(20, index.key_count())
5074.4.2 by John Arbash Meinel Add 'offset=' to the GraphIndex api, but refuse to let it be nonzero for now.	439
2890.2.2 by Robert Collins Opening an index creates a map for the parsed bytes.	440	def test_open_sets_parsed_map_empty(self):
	441	index = self.make_index()
	442	self.assertEqual([], index._parsed_byte_map)
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	443	self.assertEqual([], index._parsed_key_map)
	444
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	445	def test_key_count_buffers(self):
	446	index = self.make_index(nodes=self.make_nodes(2))
	447	# reset the transport log
	448	del index._transport._activity[:]
	449	self.assertEqual(2, index.key_count())
	450	# We should have requested reading the header bytes
	451	self.assertEqual([
	452	('readv', 'index', [(0, 200)], True, index._size),
	453	],
	454	index._transport._activity)
	455	# And that should have been enough to trigger reading the whole index
	456	# with buffering
	457	self.assertIsNot(None, index._nodes)
	458
	459	def test_lookup_key_via_location_buffers(self):
	460	index = self.make_index()
	461	# reset the transport log
	462	del index._transport._activity[:]
	463	# do a _lookup_keys_via_location call for the middle of the file, which
	464	# is what bisection uses.
	465	result = index._lookup_keys_via_location(
	466	[(index._size // 2, ('missing', ))])
	467	# this should have asked for a readv request, with adjust_for_latency,
	468	# and two regions: the header, and half-way into the file.
	469	self.assertEqual([
	470	('readv', 'index', [(30, 30), (0, 200)], True, 60),
	471	],
	472	index._transport._activity)
	473	# and the result should be that the key cannot be present, because this
	474	# is a trivial index.
	475	self.assertEqual([((index._size // 2, ('missing', )), False)],
	476	result)
	477	# And this should have caused the file to be fully buffered
	478	self.assertIsNot(None, index._nodes)
	479	self.assertEqual([], index._parsed_byte_map)
	480
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	481	def test_first_lookup_key_via_location(self):
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	482	# We need enough data so that the _HEADER_READV doesn't consume the
	483	# whole file. We always read 800 bytes for every key, and the local
	484	# transport natural expansion is 4096 bytes. So we have to have >8192
	485	# bytes or we will trigger "buffer_all".
	486	# We also want the 'missing' key to fall within the range that did
	487	# read
	488	nodes = []
	489	index = self.make_index(nodes=self.make_nodes(64))
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	490	# reset the transport log
	491	del index._transport._activity[:]
2890.2.18 by Robert Collins Review feedback.	492	# do a _lookup_keys_via_location call for the middle of the file, which
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	493	# is what bisection uses.
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	494	start_lookup = index._size // 2
2890.2.18 by Robert Collins Review feedback.	495	result = index._lookup_keys_via_location(
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	496	[(start_lookup, ('40missing', ))])
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	497	# this should have asked for a readv request, with adjust_for_latency,
	498	# and two regions: the header, and half-way into the file.
	499	self.assertEqual([
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	500	('readv', 'index',
	501	[(start_lookup, 800), (0, 200)], True, index._size),
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	502	],
	503	index._transport._activity)
	504	# and the result should be that the key cannot be present, because this
	505	# is a trivial index.
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	506	self.assertEqual([((start_lookup, ('40missing', )), False)],
	507	result)
	508	# And this should not have caused the file to be fully buffered
	509	self.assertIs(None, index._nodes)
	510	# And the regions of the file that have been parsed should be in the
	511	# parsed_byte_map and the parsed_key_map
	512	self.assertEqual([(0, 4008), (5046, 8996)], index._parsed_byte_map)
	513	self.assertEqual([(None, self.make_key(26)),
	514	(self.make_key(31), self.make_key(48))],
	515	index._parsed_key_map)
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	516
	517	def test_parsing_non_adjacent_data_trims(self):
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	518	index = self.make_index(nodes=self.make_nodes(64))
2890.2.18 by Robert Collins Review feedback.	519	result = index._lookup_keys_via_location(
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	520	[(index._size // 2, ('40', ))])
	521	# and the result should be that the key cannot be present, because key is
	522	# in the middle of the observed data from a 4K read - the smallest transport
	523	# will do today with this api.
	524	self.assertEqual([((index._size // 2, ('40', )), False)],
	525	result)
	526	# and we should have a parse map that includes the header and the
	527	# region that was parsed after trimming.
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	528	self.assertEqual([(0, 4008), (5046, 8996)], index._parsed_byte_map)
	529	self.assertEqual([(None, self.make_key(26)),
	530	(self.make_key(31), self.make_key(48))],
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	531	index._parsed_key_map)
	532
2890.2.14 by Robert Collins Parse more than one segment of data from a single readv response if needed.	533	def test_parsing_data_handles_parsed_contained_regions(self):
	534	# the following patten creates a parsed region that is wholly within a
	535	# single result from the readv layer:
	536	# .... single-read (readv-minimum-size) ...
	537	# which then trims the start and end so the parsed size is < readv
	538	# miniumum.
	539	# then a dual lookup (or a reference lookup for that matter) which
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	540	# abuts or overlaps the parsed region on both sides will need to
2890.2.14 by Robert Collins Parse more than one segment of data from a single readv response if needed.	541	# discard the data in the middle, but parse the end as well.
	542	#
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	543	# we test this by doing a single lookup to seed the data, then
	544	# a lookup for two keys that are present, and adjacent -
2890.2.14 by Robert Collins Parse more than one segment of data from a single readv response if needed.	545	# we except both to be found, and the parsed byte map to include the
	546	# locations of both keys.
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	547	index = self.make_index(nodes=self.make_nodes(128))
2890.2.18 by Robert Collins Review feedback.	548	result = index._lookup_keys_via_location(
2890.2.14 by Robert Collins Parse more than one segment of data from a single readv response if needed.	549	[(index._size // 2, ('40', ))])
	550	# and we should have a parse map that includes the header and the
	551	# region that was parsed after trimming.
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	552	self.assertEqual([(0, 4045), (11759, 15707)], index._parsed_byte_map)
	553	self.assertEqual([(None, self.make_key(116)),
	554	(self.make_key(35), self.make_key(51))],
2890.2.14 by Robert Collins Parse more than one segment of data from a single readv response if needed.	555	index._parsed_key_map)
	556	# now ask for two keys, right before and after the parsed region
2890.2.18 by Robert Collins Review feedback.	557	result = index._lookup_keys_via_location(
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	558	[(11450, self.make_key(34)), (15707, self.make_key(52))])
2890.2.14 by Robert Collins Parse more than one segment of data from a single readv response if needed.	559	self.assertEqual([
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	560	((11450, self.make_key(34)),
	561	(index, self.make_key(34), self.make_value(34))),
	562	((15707, self.make_key(52)),
	563	(index, self.make_key(52), self.make_value(52))),
2890.2.14 by Robert Collins Parse more than one segment of data from a single readv response if needed.	564	],
	565	result)
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	566	self.assertEqual([(0, 4045), (9889, 17993)], index._parsed_byte_map)
2890.2.14 by Robert Collins Parse more than one segment of data from a single readv response if needed.	567
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	568	def test_lookup_missing_key_answers_without_io_when_map_permits(self):
	569	# generate a big enough index that we only read some of it on a typical
	570	# bisection lookup.
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	571	index = self.make_index(nodes=self.make_nodes(64))
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	572	# lookup the keys in the middle of the file
2890.2.18 by Robert Collins Review feedback.	573	result =index._lookup_keys_via_location(
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	574	[(index._size // 2, ('40', ))])
	575	# check the parse map, this determines the test validity
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	576	self.assertEqual([(0, 4008), (5046, 8996)], index._parsed_byte_map)
	577	self.assertEqual([(None, self.make_key(26)),
	578	(self.make_key(31), self.make_key(48))],
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	579	index._parsed_key_map)
	580	# reset the transport log
	581	del index._transport._activity[:]
	582	# now looking up a key in the portion of the file already parsed should
	583	# not create a new transport request, and should return False (cannot
	584	# be in the index) - even when the byte location we ask for is outside
	585	# the parsed region
2890.2.18 by Robert Collins Review feedback.	586	result = index._lookup_keys_via_location(
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	587	[(4000, ('40', ))])
	588	self.assertEqual([((4000, ('40', )), False)],
	589	result)
	590	self.assertEqual([], index._transport._activity)
	591
	592	def test_lookup_present_key_answers_without_io_when_map_permits(self):
	593	# generate a big enough index that we only read some of it on a typical
	594	# bisection lookup.
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	595	index = self.make_index(nodes=self.make_nodes(64))
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	596	# lookup the keys in the middle of the file
2890.2.18 by Robert Collins Review feedback.	597	result =index._lookup_keys_via_location(
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	598	[(index._size // 2, ('40', ))])
	599	# check the parse map, this determines the test validity
	600	self.assertEqual([(0, 4008), (5046, 8996)], index._parsed_byte_map)
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	601	self.assertEqual([(None, self.make_key(26)),
	602	(self.make_key(31), self.make_key(48))],
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	603	index._parsed_key_map)
	604	# reset the transport log
	605	del index._transport._activity[:]
	606	# now looking up a key in the portion of the file already parsed should
	607	# not create a new transport request, and should return False (cannot
	608	# be in the index) - even when the byte location we ask for is outside
	609	# the parsed region
3943.8.1 by Marius Kruger remove all trailing whitespace from bzr source	610	#
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	611	result = index._lookup_keys_via_location([(4000, self.make_key(40))])
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	612	self.assertEqual(
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	613	[((4000, self.make_key(40)),
	614	(index, self.make_key(40), self.make_value(40)))],
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	615	result)
	616	self.assertEqual([], index._transport._activity)
	617
	618	def test_lookup_key_below_probed_area(self):
	619	# generate a big enough index that we only read some of it on a typical
	620	# bisection lookup.
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	621	index = self.make_index(nodes=self.make_nodes(64))
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	622	# ask for the key in the middle, but a key that is located in the
	623	# unparsed region before the middle.
2890.2.18 by Robert Collins Review feedback.	624	result =index._lookup_keys_via_location(
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	625	[(index._size // 2, ('30', ))])
	626	# check the parse map, this determines the test validity
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	627	self.assertEqual([(0, 4008), (5046, 8996)], index._parsed_byte_map)
	628	self.assertEqual([(None, self.make_key(26)),
	629	(self.make_key(31), self.make_key(48))],
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	630	index._parsed_key_map)
	631	self.assertEqual([((index._size // 2, ('30', )), -1)],
	632	result)
	633
	634	def test_lookup_key_above_probed_area(self):
	635	# generate a big enough index that we only read some of it on a typical
	636	# bisection lookup.
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	637	index = self.make_index(nodes=self.make_nodes(64))
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	638	# ask for the key in the middle, but a key that is located in the
	639	# unparsed region after the middle.
2890.2.18 by Robert Collins Review feedback.	640	result =index._lookup_keys_via_location(
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	641	[(index._size // 2, ('50', ))])
	642	# check the parse map, this determines the test validity
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	643	self.assertEqual([(0, 4008), (5046, 8996)], index._parsed_byte_map)
	644	self.assertEqual([(None, self.make_key(26)),
	645	(self.make_key(31), self.make_key(48))],
2890.2.5 by Robert Collins Create a content lookup function for bisection in GraphIndex.	646	index._parsed_key_map)
	647	self.assertEqual([((index._size // 2, ('50', )), +1)],
	648	result)
2890.2.2 by Robert Collins Opening an index creates a map for the parsed bytes.	649
2890.2.6 by Robert Collins Add support for key references to the index lookup_keys_via_location bisection interface.	650	def test_lookup_key_resolves_references(self):
	651	# generate a big enough index that we only read some of it on a typical
	652	# bisection lookup.
	653	nodes = []
3665.3.5 by John Arbash Meinel Move the point at which we 'buffer_all' if we've read >50% of the index.	654	for counter in range(99):
	655	nodes.append((self.make_key(counter), self.make_value(counter),
	656	((self.make_key(counter + 20),),) ))
	657	index = self.make_index(ref_lists=1, nodes=nodes)
	658	# lookup a key in the middle that does not exist, so that when we can
	659	# check that the referred-to-keys are not accessed automatically.
	660	index_size = index._size
	661	index_center = index_size // 2
	662	result = index._lookup_keys_via_location(
	663	[(index_center, ('40', ))])
	664	# check the parse map - only the start and middle should have been
	665	# parsed.
	666	self.assertEqual([(0, 4027), (10198, 14028)], index._parsed_byte_map)
	667	self.assertEqual([(None, self.make_key(17)),
	668	(self.make_key(44), self.make_key(5))],
	669	index._parsed_key_map)
	670	# and check the transport activity likewise.
	671	self.assertEqual(
	672	[('readv', 'index', [(index_center, 800), (0, 200)], True,
	673	index_size)],
	674	index._transport._activity)
	675	# reset the transport log for testing the reference lookup
	676	del index._transport._activity[:]
	677	# now looking up a key in the portion of the file already parsed should
	678	# only perform IO to resolve its key references.
	679	result = index._lookup_keys_via_location([(11000, self.make_key(45))])
	680	self.assertEqual(
	681	[((11000, self.make_key(45)),
	682	(index, self.make_key(45), self.make_value(45),
	683	((self.make_key(65),),)))],
	684	result)
	685	self.assertEqual([('readv', 'index', [(15093, 800)], True, index_size)],
	686	index._transport._activity)
	687
	688	def test_lookup_key_can_buffer_all(self):
	689	nodes = []
2890.2.6 by Robert Collins Add support for key references to the index lookup_keys_via_location bisection interface.	690	for counter in range(64):
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	691	nodes.append((self.make_key(counter), self.make_value(counter),
	692	((self.make_key(counter + 20),),) ))
2890.2.6 by Robert Collins Add support for key references to the index lookup_keys_via_location bisection interface.	693	index = self.make_index(ref_lists=1, nodes=nodes)
	694	# lookup a key in the middle that does not exist, so that when we can
	695	# check that the referred-to-keys are not accessed automatically.
3665.3.5 by John Arbash Meinel Move the point at which we 'buffer_all' if we've read >50% of the index.	696	index_size = index._size
	697	index_center = index_size // 2
	698	result = index._lookup_keys_via_location([(index_center, ('40', ))])
2890.2.6 by Robert Collins Add support for key references to the index lookup_keys_via_location bisection interface.	699	# check the parse map - only the start and middle should have been
	700	# parsed.
	701	self.assertEqual([(0, 3890), (6444, 10274)], index._parsed_byte_map)
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	702	self.assertEqual([(None, self.make_key(25)),
	703	(self.make_key(37), self.make_key(52))],
2890.2.6 by Robert Collins Add support for key references to the index lookup_keys_via_location bisection interface.	704	index._parsed_key_map)
	705	# and check the transport activity likewise.
	706	self.assertEqual(
3665.3.5 by John Arbash Meinel Move the point at which we 'buffer_all' if we've read >50% of the index.	707	[('readv', 'index', [(index_center, 800), (0, 200)], True,
	708	index_size)],
2890.2.6 by Robert Collins Add support for key references to the index lookup_keys_via_location bisection interface.	709	index._transport._activity)
	710	# reset the transport log for testing the reference lookup
	711	del index._transport._activity[:]
	712	# now looking up a key in the portion of the file already parsed should
	713	# only perform IO to resolve its key references.
3665.3.5 by John Arbash Meinel Move the point at which we 'buffer_all' if we've read >50% of the index.	714	result = index._lookup_keys_via_location([(7000, self.make_key(40))])
2890.2.6 by Robert Collins Add support for key references to the index lookup_keys_via_location bisection interface.	715	self.assertEqual(
3665.3.5 by John Arbash Meinel Move the point at which we 'buffer_all' if we've read >50% of the index.	716	[((7000, self.make_key(40)),
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	717	(index, self.make_key(40), self.make_value(40),
	718	((self.make_key(60),),)))],
2890.2.6 by Robert Collins Add support for key references to the index lookup_keys_via_location bisection interface.	719	result)
3665.3.5 by John Arbash Meinel Move the point at which we 'buffer_all' if we've read >50% of the index.	720	# Resolving the references would have required more data read, and we
	721	# are already above the 50% threshold, so it triggered a _buffer_all
	722	self.assertEqual([('get', 'index')], index._transport._activity)
2890.2.6 by Robert Collins Add support for key references to the index lookup_keys_via_location bisection interface.	723
2592.1.5 by Robert Collins Trivial index reading.	724	def test_iter_all_entries_empty(self):
	725	index = self.make_index()
	726	self.assertEqual([], list(index.iter_all_entries()))
	727
2592.1.27 by Robert Collins Test missing end lines with non-empty indices.	728	def test_iter_all_entries_simple(self):
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	729	index = self.make_index(nodes=[(('name', ), 'data', ())])
2624.2.14 by Robert Collins Add source index to the index iteration API to allow mapping back to the origin of retrieved data.	730	self.assertEqual([(index, ('name', ), 'data')],
2592.1.27 by Robert Collins Test missing end lines with non-empty indices.	731	list(index.iter_all_entries()))
	732
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	733	def test_iter_all_entries_simple_2_elements(self):
	734	index = self.make_index(key_elements=2,
	735	nodes=[(('name', 'surname'), 'data', ())])
2624.2.14 by Robert Collins Add source index to the index iteration API to allow mapping back to the origin of retrieved data.	736	self.assertEqual([(index, ('name', 'surname'), 'data')],
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	737	list(index.iter_all_entries()))
	738
2592.1.28 by Robert Collins Basic two pass iter_all_entries.	739	def test_iter_all_entries_references_resolved(self):
	740	index = self.make_index(1, nodes=[
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	741	(('name', ), 'data', ([('ref', )], )),
	742	(('ref', ), 'refdata', ([], ))])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	743	self.assertEqual({(index, ('name', ), 'data', ((('ref',),),)),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	744	(index, ('ref', ), 'refdata', ((), ))},
2592.1.28 by Robert Collins Basic two pass iter_all_entries.	745	set(index.iter_all_entries()))
	746
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	747	def test_iter_entries_buffers_once(self):
	748	index = self.make_index(nodes=self.make_nodes(2))
	749	# reset the transport log
	750	del index._transport._activity[:]
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	751	self.assertEqual({(index, self.make_key(1), self.make_value(1))},
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	752	set(index.iter_entries([self.make_key(1)])))
	753	# We should have requested reading the header bytes
	754	# But not needed any more than that because it would have triggered a
	755	# buffer all
	756	self.assertEqual([
	757	('readv', 'index', [(0, 200)], True, index._size),
	758	],
	759	index._transport._activity)
	760	# And that should have been enough to trigger reading the whole index
	761	# with buffering
	762	self.assertIsNot(None, index._nodes)
	763
3665.3.3 by John Arbash Meinel If we read more than 50% of the whole index,	764	def test_iter_entries_buffers_by_bytes_read(self):
	765	index = self.make_index(nodes=self.make_nodes(64))
	766	list(index.iter_entries([self.make_key(10)]))
	767	# The first time through isn't enough to trigger a buffer all
	768	self.assertIs(None, index._nodes)
	769	self.assertEqual(4096, index._bytes_read)
	770	# Grabbing a key in that same page won't trigger a buffer all, as we
	771	# still haven't read 50% of the file
	772	list(index.iter_entries([self.make_key(11)]))
	773	self.assertIs(None, index._nodes)
	774	self.assertEqual(4096, index._bytes_read)
	775	# We haven't read more data, so reading outside the range won't trigger
	776	# a buffer all right away
	777	list(index.iter_entries([self.make_key(40)]))
	778	self.assertIs(None, index._nodes)
	779	self.assertEqual(8192, index._bytes_read)
3665.3.5 by John Arbash Meinel Move the point at which we 'buffer_all' if we've read >50% of the index.	780	# On the next pass, we will not trigger buffer all if the key is
	781	# available without reading more
3665.3.3 by John Arbash Meinel If we read more than 50% of the whole index,	782	list(index.iter_entries([self.make_key(32)]))
3665.3.5 by John Arbash Meinel Move the point at which we 'buffer_all' if we've read >50% of the index.	783	self.assertIs(None, index._nodes)
	784	# But if we would need to read more to resolve it, then we will
	785	# buffer all.
	786	list(index.iter_entries([self.make_key(60)]))
3665.3.3 by John Arbash Meinel If we read more than 50% of the whole index,	787	self.assertIsNot(None, index._nodes)
	788
2890.2.10 by Robert Collins Add test coverage to ensure \r's are not mangled by bisection parsing.	789	def test_iter_entries_references_resolved(self):
	790	index = self.make_index(1, nodes=[
	791	(('name', ), 'data', ([('ref', ), ('ref', )], )),
	792	(('ref', ), 'refdata', ([], ))])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	793	self.assertEqual({(index, ('name', ), 'data', ((('ref',),('ref',)),)),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	794	(index, ('ref', ), 'refdata', ((), ))},
2890.2.10 by Robert Collins Add test coverage to ensure \r's are not mangled by bisection parsing.	795	set(index.iter_entries([('name',), ('ref',)])))
	796
	797	def test_iter_entries_references_2_refs_resolved(self):
	798	index = self.make_index(2, nodes=[
	799	(('name', ), 'data', ([('ref', )], [('ref', )])),
	800	(('ref', ), 'refdata', ([], []))])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	801	self.assertEqual({(index, ('name', ), 'data', ((('ref',),), (('ref',),))),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	802	(index, ('ref', ), 'refdata', ((), ()))},
2890.2.10 by Robert Collins Add test coverage to ensure \r's are not mangled by bisection parsing.	803	set(index.iter_entries([('name',), ('ref',)])))
	804
2592.1.30 by Robert Collins Absent entries are not yeilded.	805	def test_iteration_absent_skipped(self):
2592.1.30 by Robert Collins Absent entries are not yeilded.	806	index = self.make_index(1, nodes=[
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	807	(('name', ), 'data', ([('ref', )], ))])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	808	self.assertEqual({(index, ('name', ), 'data', ((('ref',),),))},
2592.1.30 by Robert Collins Absent entries are not yeilded.	809	set(index.iter_all_entries()))
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	810	self.assertEqual({(index, ('name', ), 'data', ((('ref',),),))},
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	811	set(index.iter_entries([('name', )])))
	812	self.assertEqual([], list(index.iter_entries([('ref', )])))
2592.1.30 by Robert Collins Absent entries are not yeilded.	813
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	814	def test_iteration_absent_skipped_2_element_keys(self):
	815	index = self.make_index(1, key_elements=2, nodes=[
	816	(('name', 'fin'), 'data', ([('ref', 'erence')], ))])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	817	self.assertEqual({(index, ('name', 'fin'), 'data', ((('ref', 'erence'),),))},
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	818	set(index.iter_all_entries()))
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	819	self.assertEqual({(index, ('name', 'fin'), 'data', ((('ref', 'erence'),),))},
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	820	set(index.iter_entries([('name', 'fin')])))
	821	self.assertEqual([], list(index.iter_entries([('ref', 'erence')])))
	822
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	823	def test_iter_all_keys(self):
2592.1.29 by Robert Collins Basic iter_entries working.	824	index = self.make_index(1, nodes=[
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	825	(('name', ), 'data', ([('ref', )], )),
	826	(('ref', ), 'refdata', ([], ))])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	827	self.assertEqual({(index, ('name', ), 'data', ((('ref',),),)),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	828	(index, ('ref', ), 'refdata', ((), ))},
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	829	set(index.iter_entries([('name', ), ('ref', )])))
2592.1.29 by Robert Collins Basic iter_entries working.	830
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	831	def test_iter_nothing_empty(self):
2592.1.9 by Robert Collins Iterating no keys should work too.	832	index = self.make_index()
	833	self.assertEqual([], list(index.iter_entries([])))
	834
2592.1.5 by Robert Collins Trivial index reading.	835	def test_iter_missing_entry_empty(self):
2592.1.5 by Robert Collins Trivial index reading.	836	index = self.make_index()
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	837	self.assertEqual([], list(index.iter_entries([('a', )])))
2592.1.7 by Robert Collins A validate that goes boom.	838
2890.2.8 by Robert Collins Make the size of the index optionally None for the pack-names index.	839	def test_iter_missing_entry_empty_no_size(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	840	idx = self.make_index()
	841	idx = index.GraphIndex(idx._transport, 'index', None)
	842	self.assertEqual([], list(idx.iter_entries([('a', )])))
2890.2.8 by Robert Collins Make the size of the index optionally None for the pack-names index.	843
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	844	def test_iter_key_prefix_1_element_key_None(self):
	845	index = self.make_index()
	846	self.assertRaises(errors.BadIndexKey, list,
	847	index.iter_entries_prefix([(None, )]))
	848
	849	def test_iter_key_prefix_wrong_length(self):
	850	index = self.make_index()
	851	self.assertRaises(errors.BadIndexKey, list,
	852	index.iter_entries_prefix([('foo', None)]))
	853	index = self.make_index(key_elements=2)
	854	self.assertRaises(errors.BadIndexKey, list,
	855	index.iter_entries_prefix([('foo', )]))
	856	self.assertRaises(errors.BadIndexKey, list,
	857	index.iter_entries_prefix([('foo', None, None)]))
	858
	859	def test_iter_key_prefix_1_key_element_no_refs(self):
	860	index = self.make_index( nodes=[
	861	(('name', ), 'data', ()),
	862	(('ref', ), 'refdata', ())])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	863	self.assertEqual({(index, ('name', ), 'data'),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	864	(index, ('ref', ), 'refdata')},
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	865	set(index.iter_entries_prefix([('name', ), ('ref', )])))
	866
	867	def test_iter_key_prefix_1_key_element_refs(self):
	868	index = self.make_index(1, nodes=[
	869	(('name', ), 'data', ([('ref', )], )),
	870	(('ref', ), 'refdata', ([], ))])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	871	self.assertEqual({(index, ('name', ), 'data', ((('ref',),),)),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	872	(index, ('ref', ), 'refdata', ((), ))},
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	873	set(index.iter_entries_prefix([('name', ), ('ref', )])))
	874
	875	def test_iter_key_prefix_2_key_element_no_refs(self):
	876	index = self.make_index(key_elements=2, nodes=[
	877	(('name', 'fin1'), 'data', ()),
	878	(('name', 'fin2'), 'beta', ()),
	879	(('ref', 'erence'), 'refdata', ())])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	880	self.assertEqual({(index, ('name', 'fin1'), 'data'),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	881	(index, ('ref', 'erence'), 'refdata')},
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	882	set(index.iter_entries_prefix([('name', 'fin1'), ('ref', 'erence')])))
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	883	self.assertEqual({(index, ('name', 'fin1'), 'data'),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	884	(index, ('name', 'fin2'), 'beta')},
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	885	set(index.iter_entries_prefix([('name', None)])))
	886
	887	def test_iter_key_prefix_2_key_element_refs(self):
	888	index = self.make_index(1, key_elements=2, nodes=[
	889	(('name', 'fin1'), 'data', ([('ref', 'erence')], )),
	890	(('name', 'fin2'), 'beta', ([], )),
	891	(('ref', 'erence'), 'refdata', ([], ))])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	892	self.assertEqual({(index, ('name', 'fin1'), 'data', ((('ref', 'erence'),),)),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	893	(index, ('ref', 'erence'), 'refdata', ((), ))},
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	894	set(index.iter_entries_prefix([('name', 'fin1'), ('ref', 'erence')])))
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	895	self.assertEqual({(index, ('name', 'fin1'), 'data', ((('ref', 'erence'),),)),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	896	(index, ('name', 'fin2'), 'beta', ((), ))},
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	897	set(index.iter_entries_prefix([('name', None)])))
	898
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	899	def test_key_count_empty(self):
	900	index = self.make_index()
	901	self.assertEqual(0, index.key_count())
	902
	903	def test_key_count_one(self):
	904	index = self.make_index(nodes=[(('name', ), '', ())])
	905	self.assertEqual(1, index.key_count())
	906
	907	def test_key_count_two(self):
	908	index = self.make_index(nodes=[
	909	(('name', ), '', ()), (('foo', ), '', ())])
	910	self.assertEqual(2, index.key_count())
	911
3665.3.3 by John Arbash Meinel If we read more than 50% of the whole index,	912	def test_read_and_parse_tracks_real_read_value(self):
	913	index = self.make_index(nodes=self.make_nodes(10))
	914	del index._transport._activity[:]
	915	index._read_and_parse([(0, 200)])
	916	self.assertEqual([
	917	('readv', 'index', [(0, 200)], True, index._size),
	918	],
	919	index._transport._activity)
	920	# The readv expansion code will expand the initial request to 4096
	921	# bytes, which is more than enough to read the entire index, and we
	922	# will track the fact that we read that many bytes.
	923	self.assertEqual(index._size, index._bytes_read)
	924
	925	def test_read_and_parse_triggers_buffer_all(self):
3665.3.1 by John Arbash Meinel Updates to GraphIndex processing.	926	index = self.make_index(key_elements=2, nodes=[
	927	(('name', 'fin1'), 'data', ()),
	928	(('name', 'fin2'), 'beta', ()),
	929	(('ref', 'erence'), 'refdata', ())])
	930	self.assertTrue(index._size > 0)
	931	self.assertIs(None, index._nodes)
	932	index._read_and_parse([(0, index._size)])
	933	self.assertIsNot(None, index._nodes)
	934
2592.1.7 by Robert Collins A validate that goes boom.	935	def test_validate_bad_index_errors(self):
	936	trans = self.get_transport()
	937	trans.put_bytes('name', "not an index\n")
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	938	idx = index.GraphIndex(trans, 'name', 13)
	939	self.assertRaises(errors.BadIndexFormatSignature, idx.validate)
2592.1.8 by Robert Collins Empty files should validate ok.	940
2592.1.10 by Robert Collins Make validate detect node reference parsing errors.	941	def test_validate_bad_node_refs(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	942	idx = self.make_index(2)
2592.1.10 by Robert Collins Make validate detect node reference parsing errors.	943	trans = self.get_transport()
	944	content = trans.get_bytes('index')
	945	# change the options line to end with a rather than a parseable number
	946	new_content = content[:-2] + 'a\n\n'
	947	trans.put_bytes('index', new_content)
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	948	self.assertRaises(errors.BadIndexOptions, idx.validate)
2592.1.10 by Robert Collins Make validate detect node reference parsing errors.	949
2592.1.27 by Robert Collins Test missing end lines with non-empty indices.	950	def test_validate_missing_end_line_empty(self):
2592.1.11 by Robert Collins Detect truncated indices.	951	index = self.make_index(2)
	952	trans = self.get_transport()
	953	content = trans.get_bytes('index')
	954	# truncate the last byte
	955	trans.put_bytes('index', content[:-1])
	956	self.assertRaises(errors.BadIndexData, index.validate)
	957
2592.1.27 by Robert Collins Test missing end lines with non-empty indices.	958	def test_validate_missing_end_line_nonempty(self):
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	959	index = self.make_index(2, nodes=[(('key', ), '', ([], []))])
2592.1.27 by Robert Collins Test missing end lines with non-empty indices.	960	trans = self.get_transport()
	961	content = trans.get_bytes('index')
	962	# truncate the last byte
	963	trans.put_bytes('index', content[:-1])
	964	self.assertRaises(errors.BadIndexData, index.validate)
	965
2592.1.8 by Robert Collins Empty files should validate ok.	966	def test_validate_empty(self):
	967	index = self.make_index()
	968	index.validate()
2592.1.12 by Robert Collins Handle basic node adds.	969
2592.1.12 by Robert Collins Handle basic node adds.	970	def test_validate_no_refs_content(self):
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	971	index = self.make_index(nodes=[(('key', ), 'value', ())])
2592.1.12 by Robert Collins Handle basic node adds.	972	index.validate()
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	973
4011.5.3 by Andrew Bennetts Implement and test external_references on GraphIndex and BTreeGraphIndex.	974	# XXX: external_references tests are duplicated in test_btree_index. We
	975	# probably should have per_graph_index tests...
	976	def test_external_references_no_refs(self):
	977	index = self.make_index(ref_lists=0, nodes=[])
	978	self.assertRaises(ValueError, index.external_references, 0)
	979
	980	def test_external_references_no_results(self):
	981	index = self.make_index(ref_lists=1, nodes=[
	982	(('key',), 'value', ([],))])
	983	self.assertEqual(set(), index.external_references(0))
	984
	985	def test_external_references_missing_ref(self):
	986	missing_key = ('missing',)
	987	index = self.make_index(ref_lists=1, nodes=[
	988	(('key',), 'value', ([missing_key],))])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	989	self.assertEqual({missing_key}, index.external_references(0))
4011.5.3 by Andrew Bennetts Implement and test external_references on GraphIndex and BTreeGraphIndex.	990
	991	def test_external_references_multiple_ref_lists(self):
	992	missing_key = ('missing',)
	993	index = self.make_index(ref_lists=2, nodes=[
	994	(('key',), 'value', ([], [missing_key]))])
	995	self.assertEqual(set([]), index.external_references(0))
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	996	self.assertEqual({missing_key}, index.external_references(1))
4011.5.3 by Andrew Bennetts Implement and test external_references on GraphIndex and BTreeGraphIndex.	997
	998	def test_external_references_two_records(self):
	999	index = self.make_index(ref_lists=1, nodes=[
	1000	(('key-1',), 'value', ([('key-2',)],)),
	1001	(('key-2',), 'value', ([],)),
	1002	])
	1003	self.assertEqual(set([]), index.external_references(0))
	1004
4593.4.12 by John Arbash Meinel Name the specific index api _find_ancestors, and the public CombinedGraphIndex api find_ancestry()	1005	def test__find_ancestors(self):
4593.4.7 by John Arbash Meinel Basic implementation of a conforming interface for GraphIndex.	1006	key1 = ('key-1',)
	1007	key2 = ('key-2',)
	1008	index = self.make_index(ref_lists=1, key_elements=1, nodes=[
	1009	(key1, 'value', ([key2],)),
	1010	(key2, 'value', ([],)),
	1011	])
	1012	parent_map = {}
	1013	missing_keys = set()
4593.4.12 by John Arbash Meinel Name the specific index api _find_ancestors, and the public CombinedGraphIndex api find_ancestry()	1014	search_keys = index._find_ancestors([key1], 0, parent_map, missing_keys)
4593.4.7 by John Arbash Meinel Basic implementation of a conforming interface for GraphIndex.	1015	self.assertEqual({key1: (key2,)}, parent_map)
	1016	self.assertEqual(set(), missing_keys)
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1017	self.assertEqual({key2}, search_keys)
4593.4.12 by John Arbash Meinel Name the specific index api _find_ancestors, and the public CombinedGraphIndex api find_ancestry()	1018	search_keys = index._find_ancestors(search_keys, 0, parent_map,
	1019	missing_keys)
4593.4.7 by John Arbash Meinel Basic implementation of a conforming interface for GraphIndex.	1020	self.assertEqual({key1: (key2,), key2: ()}, parent_map)
	1021	self.assertEqual(set(), missing_keys)
	1022	self.assertEqual(set(), search_keys)
	1023
4593.4.12 by John Arbash Meinel Name the specific index api _find_ancestors, and the public CombinedGraphIndex api find_ancestry()	1024	def test__find_ancestors_w_missing(self):
4593.4.7 by John Arbash Meinel Basic implementation of a conforming interface for GraphIndex.	1025	key1 = ('key-1',)
	1026	key2 = ('key-2',)
	1027	key3 = ('key-3',)
	1028	index = self.make_index(ref_lists=1, key_elements=1, nodes=[
	1029	(key1, 'value', ([key2],)),
	1030	(key2, 'value', ([],)),
	1031	])
	1032	parent_map = {}
	1033	missing_keys = set()
4593.4.12 by John Arbash Meinel Name the specific index api _find_ancestors, and the public CombinedGraphIndex api find_ancestry()	1034	search_keys = index._find_ancestors([key2, key3], 0, parent_map,
	1035	missing_keys)
4593.4.7 by John Arbash Meinel Basic implementation of a conforming interface for GraphIndex.	1036	self.assertEqual({key2: ()}, parent_map)
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1037	self.assertEqual({key3}, missing_keys)
4593.4.7 by John Arbash Meinel Basic implementation of a conforming interface for GraphIndex.	1038	self.assertEqual(set(), search_keys)
	1039
4593.4.12 by John Arbash Meinel Name the specific index api _find_ancestors, and the public CombinedGraphIndex api find_ancestry()	1040	def test__find_ancestors_dont_search_known(self):
4593.4.7 by John Arbash Meinel Basic implementation of a conforming interface for GraphIndex.	1041	key1 = ('key-1',)
	1042	key2 = ('key-2',)
	1043	key3 = ('key-3',)
	1044	index = self.make_index(ref_lists=1, key_elements=1, nodes=[
	1045	(key1, 'value', ([key2],)),
	1046	(key2, 'value', ([key3],)),
	1047	(key3, 'value', ([],)),
	1048	])
	1049	# We already know about key2, so we won't try to search for key3
	1050	parent_map = {key2: (key3,)}
	1051	missing_keys = set()
4593.4.12 by John Arbash Meinel Name the specific index api _find_ancestors, and the public CombinedGraphIndex api find_ancestry()	1052	search_keys = index._find_ancestors([key1], 0, parent_map,
	1053	missing_keys)
4593.4.7 by John Arbash Meinel Basic implementation of a conforming interface for GraphIndex.	1054	self.assertEqual({key1: (key2,), key2: (key3,)}, parent_map)
	1055	self.assertEqual(set(), missing_keys)
	1056	self.assertEqual(set(), search_keys)
	1057
4634.71.1 by John Arbash Meinel Work around bug #402623 by allowing BTreeGraphIndex(...,unlimited_cache=True).	1058	def test_supports_unlimited_cache(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1059	builder = index.GraphIndexBuilder(0, key_elements=1)
4634.71.1 by John Arbash Meinel Work around bug #402623 by allowing BTreeGraphIndex(...,unlimited_cache=True).	1060	stream = builder.finish()
5609.9.4 by Vincent Ladeuil Use self.get_transport instead of transport.get_transport where possible.	1061	trans = self.get_transport()
4634.71.1 by John Arbash Meinel Work around bug #402623 by allowing BTreeGraphIndex(...,unlimited_cache=True).	1062	size = trans.put_file('index', stream)
	1063	# It doesn't matter what unlimited_cache does here, just that it can be
	1064	# passed
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1065	idx = index.GraphIndex(trans, 'index', size, unlimited_cache=True)
	1066
	1067
	1068	class TestCombinedGraphIndex(tests.TestCaseWithMemoryTransport):
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1069
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	1070	def make_index(self, name, ref_lists=0, key_elements=1, nodes=[]):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1071	builder = index.GraphIndexBuilder(ref_lists, key_elements=key_elements)
2624.2.17 by Robert Collins Review feedback.	1072	for key, value, references in nodes:
2624.2.17 by Robert Collins Review feedback.	1073	builder.add_node(key, value, references)
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1074	stream = builder.finish()
	1075	trans = self.get_transport()
2890.2.1 by Robert Collins * ``bzrlib.index.GraphIndex`` now requires a size parameter to the	1076	size = trans.put_file(name, stream)
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1077	return index.GraphIndex(trans, name, size)
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1078
3789.1.4 by John Arbash Meinel CombinedGraphIndex.iter_entries() is now able to reload on request.	1079	def make_combined_index_with_missing(self, missing=['1', '2']):
3789.1.3 by John Arbash Meinel CombinedGraphIndex can now reload when calling key_count().	1080	"""Create a CombinedGraphIndex which will have missing indexes.
	1081
	1082	This creates a CGI which thinks it has 2 indexes, however they have
	1083	been deleted. If CGI._reload_func() is called, then it will repopulate
	1084	with a new index.
	1085
3789.1.4 by John Arbash Meinel CombinedGraphIndex.iter_entries() is now able to reload on request.	1086	:param missing: The underlying indexes to delete
3789.1.3 by John Arbash Meinel CombinedGraphIndex can now reload when calling key_count().	1087	:return: (CombinedGraphIndex, reload_counter)
	1088	"""
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1089	idx1 = self.make_index('1', nodes=[(('1',), '', ())])
	1090	idx2 = self.make_index('2', nodes=[(('2',), '', ())])
	1091	idx3 = self.make_index('3', nodes=[
3789.1.3 by John Arbash Meinel CombinedGraphIndex can now reload when calling key_count().	1092	(('1',), '', ()),
	1093	(('2',), '', ())])
	1094
	1095	# total_reloads, num_changed, num_unchanged
	1096	reload_counter = [0, 0, 0]
	1097	def reload():
	1098	reload_counter[0] += 1
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1099	new_indices = [idx3]
	1100	if idx._indices == new_indices:
3789.1.3 by John Arbash Meinel CombinedGraphIndex can now reload when calling key_count().	1101	reload_counter[2] += 1
	1102	return False
	1103	reload_counter[1] += 1
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1104	idx._indices[:] = new_indices
3789.1.3 by John Arbash Meinel CombinedGraphIndex can now reload when calling key_count().	1105	return True
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1106	idx = index.CombinedGraphIndex([idx1, idx2], reload_func=reload)
3789.1.3 by John Arbash Meinel CombinedGraphIndex can now reload when calling key_count().	1107	trans = self.get_transport()
3789.1.4 by John Arbash Meinel CombinedGraphIndex.iter_entries() is now able to reload on request.	1108	for fname in missing:
	1109	trans.delete(fname)
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1110	return idx, reload_counter
3789.1.3 by John Arbash Meinel CombinedGraphIndex can now reload when calling key_count().	1111
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1112	def test_open_missing_index_no_error(self):
	1113	trans = self.get_transport()
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1114	idx1 = index.GraphIndex(trans, 'missing', 100)
	1115	idx = index.CombinedGraphIndex([idx1])
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1116
2592.1.37 by Robert Collins Add CombinedGraphIndex.insert_index.	1117	def test_add_index(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1118	idx = index.CombinedGraphIndex([])
	1119	idx1 = self.make_index('name', 0, nodes=[(('key', ), '', ())])
	1120	idx.insert_index(0, idx1)
	1121	self.assertEqual([(idx1, ('key', ), '')],
	1122	list(idx.iter_all_entries()))
2592.1.37 by Robert Collins Add CombinedGraphIndex.insert_index.	1123
4744.2.6 by John Arbash Meinel Start exposing an GraphIndex.clear_cache() member.	1124	def test_clear_cache(self):
	1125	log = []
	1126
	1127	class ClearCacheProxy(object):
	1128
	1129	def __init__(self, index):
	1130	self._index = index
	1131
	1132	def __getattr__(self, name):
	1133	return getattr(self._index)
	1134
	1135	def clear_cache(self):
	1136	log.append(self._index)
	1137	return self._index.clear_cache()
	1138
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1139	idx = index.CombinedGraphIndex([])
	1140	idx1 = self.make_index('name', 0, nodes=[(('key', ), '', ())])
	1141	idx.insert_index(0, ClearCacheProxy(idx1))
	1142	idx2 = self.make_index('name', 0, nodes=[(('key', ), '', ())])
	1143	idx.insert_index(1, ClearCacheProxy(idx2))
4744.2.6 by John Arbash Meinel Start exposing an GraphIndex.clear_cache() member.	1144	# CombinedGraphIndex should call 'clear_cache()' on all children
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1145	idx.clear_cache()
	1146	self.assertEqual(sorted([idx1, idx2]), sorted(log))
4744.2.6 by John Arbash Meinel Start exposing an GraphIndex.clear_cache() member.	1147
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1148	def test_iter_all_entries_empty(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1149	idx = index.CombinedGraphIndex([])
	1150	self.assertEqual([], list(idx.iter_all_entries()))
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1151
	1152	def test_iter_all_entries_children_empty(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1153	idx1 = self.make_index('name')
	1154	idx = index.CombinedGraphIndex([idx1])
	1155	self.assertEqual([], list(idx.iter_all_entries()))
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1156
	1157	def test_iter_all_entries_simple(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1158	idx1 = self.make_index('name', nodes=[(('name', ), 'data', ())])
	1159	idx = index.CombinedGraphIndex([idx1])
	1160	self.assertEqual([(idx1, ('name', ), 'data')],
	1161	list(idx.iter_all_entries()))
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1162
	1163	def test_iter_all_entries_two_indices(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1164	idx1 = self.make_index('name1', nodes=[(('name', ), 'data', ())])
	1165	idx2 = self.make_index('name2', nodes=[(('2', ), '', ())])
	1166	idx = index.CombinedGraphIndex([idx1, idx2])
	1167	self.assertEqual([(idx1, ('name', ), 'data'),
	1168	(idx2, ('2', ), '')],
	1169	list(idx.iter_all_entries()))
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1170
2592.1.39 by Robert Collins CombinedGraphIndex.iter_entries does not need to see all entries.	1171	def test_iter_entries_two_indices_dup_key(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1172	idx1 = self.make_index('name1', nodes=[(('name', ), 'data', ())])
	1173	idx2 = self.make_index('name2', nodes=[(('name', ), 'data', ())])
	1174	idx = index.CombinedGraphIndex([idx1, idx2])
	1175	self.assertEqual([(idx1, ('name', ), 'data')],
	1176	list(idx.iter_entries([('name', )])))
2592.1.39 by Robert Collins CombinedGraphIndex.iter_entries does not need to see all entries.	1177
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1178	def test_iter_all_entries_two_indices_dup_key(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1179	idx1 = self.make_index('name1', nodes=[(('name', ), 'data', ())])
	1180	idx2 = self.make_index('name2', nodes=[(('name', ), 'data', ())])
	1181	idx = index.CombinedGraphIndex([idx1, idx2])
	1182	self.assertEqual([(idx1, ('name', ), 'data')],
	1183	list(idx.iter_all_entries()))
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1184
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	1185	def test_iter_key_prefix_2_key_element_refs(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1186	idx1 = self.make_index('1', 1, key_elements=2, nodes=[
	1187	(('name', 'fin1'), 'data', ([('ref', 'erence')], ))])
	1188	idx2 = self.make_index('2', 1, key_elements=2, nodes=[
	1189	(('name', 'fin2'), 'beta', ([], )),
	1190	(('ref', 'erence'), 'refdata', ([], ))])
	1191	idx = index.CombinedGraphIndex([idx1, idx2])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1192	self.assertEqual({(idx1, ('name', 'fin1'), 'data',
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1193	((('ref', 'erence'),),)),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1194	(idx2, ('ref', 'erence'), 'refdata', ((), ))},
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1195	set(idx.iter_entries_prefix([('name', 'fin1'),
	1196	('ref', 'erence')])))
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1197	self.assertEqual({(idx1, ('name', 'fin1'), 'data',
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1198	((('ref', 'erence'),),)),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1199	(idx2, ('name', 'fin2'), 'beta', ((), ))},
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1200	set(idx.iter_entries_prefix([('name', None)])))
2624.2.9 by Robert Collins Introduce multiple component keys, which is what is needed to combine multiple knit indices into one.	1201
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1202	def test_iter_nothing_empty(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1203	idx = index.CombinedGraphIndex([])
	1204	self.assertEqual([], list(idx.iter_entries([])))
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1205
	1206	def test_iter_nothing_children_empty(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1207	idx1 = self.make_index('name')
	1208	idx = index.CombinedGraphIndex([idx1])
	1209	self.assertEqual([], list(idx.iter_entries([])))
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1210
	1211	def test_iter_all_keys(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1212	idx1 = self.make_index('1', 1, nodes=[(('name', ), 'data',
	1213	([('ref', )], ))])
	1214	idx2 = self.make_index('2', 1, nodes=[(('ref', ), 'refdata', ((), ))])
	1215	idx = index.CombinedGraphIndex([idx1, idx2])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1216	self.assertEqual({(idx1, ('name', ), 'data', ((('ref', ), ), )),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1217	(idx2, ('ref', ), 'refdata', ((), ))},
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1218	set(idx.iter_entries([('name', ), ('ref', )])))
3943.8.1 by Marius Kruger remove all trailing whitespace from bzr source	1219
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1220	def test_iter_all_keys_dup_entry(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1221	idx1 = self.make_index('1', 1, nodes=[(('name', ), 'data',
	1222	([('ref', )], )),
	1223	(('ref', ), 'refdata', ([], ))])
	1224	idx2 = self.make_index('2', 1, nodes=[(('ref', ), 'refdata', ([], ))])
	1225	idx = index.CombinedGraphIndex([idx1, idx2])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1226	self.assertEqual({(idx1, ('name', ), 'data', ((('ref',),),)),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1227	(idx1, ('ref', ), 'refdata', ((), ))},
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1228	set(idx.iter_entries([('name', ), ('ref', )])))
3943.8.1 by Marius Kruger remove all trailing whitespace from bzr source	1229
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1230	def test_iter_missing_entry_empty(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1231	idx = index.CombinedGraphIndex([])
	1232	self.assertEqual([], list(idx.iter_entries([('a', )])))
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1233
	1234	def test_iter_missing_entry_one_index(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1235	idx1 = self.make_index('1')
	1236	idx = index.CombinedGraphIndex([idx1])
	1237	self.assertEqual([], list(idx.iter_entries([('a', )])))
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1238
	1239	def test_iter_missing_entry_two_index(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1240	idx1 = self.make_index('1')
	1241	idx2 = self.make_index('2')
	1242	idx = index.CombinedGraphIndex([idx1, idx2])
	1243	self.assertEqual([], list(idx.iter_entries([('a', )])))
3943.8.1 by Marius Kruger remove all trailing whitespace from bzr source	1244
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1245	def test_iter_entry_present_one_index_only(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1246	idx1 = self.make_index('1', nodes=[(('key', ), '', ())])
	1247	idx2 = self.make_index('2', nodes=[])
	1248	idx = index.CombinedGraphIndex([idx1, idx2])
	1249	self.assertEqual([(idx1, ('key', ), '')],
	1250	list(idx.iter_entries([('key', )])))
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1251	# and in the other direction
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1252	idx = index.CombinedGraphIndex([idx2, idx1])
	1253	self.assertEqual([(idx1, ('key', ), '')],
	1254	list(idx.iter_entries([('key', )])))
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1255
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	1256	def test_key_count_empty(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1257	idx1 = self.make_index('1', nodes=[])
	1258	idx2 = self.make_index('2', nodes=[])
	1259	idx = index.CombinedGraphIndex([idx1, idx2])
	1260	self.assertEqual(0, idx.key_count())
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	1261
	1262	def test_key_count_sums_index_keys(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1263	idx1 = self.make_index('1', nodes=[
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	1264	(('1',), '', ()),
	1265	(('2',), '', ())])
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1266	idx2 = self.make_index('2', nodes=[(('1',), '', ())])
	1267	idx = index.CombinedGraphIndex([idx1, idx2])
	1268	self.assertEqual(3, idx.key_count())
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	1269
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1270	def test_validate_bad_child_index_errors(self):
	1271	trans = self.get_transport()
	1272	trans.put_bytes('name', "not an index\n")
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1273	idx1 = index.GraphIndex(trans, 'name', 13)
	1274	idx = index.CombinedGraphIndex([idx1])
	1275	self.assertRaises(errors.BadIndexFormatSignature, idx.validate)
2592.1.31 by Robert Collins Build a combined graph index to use multiple indices at once.	1276
	1277	def test_validate_empty(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1278	idx = index.CombinedGraphIndex([])
	1279	idx.validate()
2592.1.38 by Robert Collins Create an InMemoryGraphIndex for temporary indexing.	1280
3789.1.3 by John Arbash Meinel CombinedGraphIndex can now reload when calling key_count().	1281	def test_key_count_reloads(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1282	idx, reload_counter = self.make_combined_index_with_missing()
	1283	self.assertEqual(2, idx.key_count())
3789.1.3 by John Arbash Meinel CombinedGraphIndex can now reload when calling key_count().	1284	self.assertEqual([1, 1, 0], reload_counter)
	1285
3789.1.4 by John Arbash Meinel CombinedGraphIndex.iter_entries() is now able to reload on request.	1286	def test_key_count_no_reload(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1287	idx, reload_counter = self.make_combined_index_with_missing()
	1288	idx._reload_func = None
3789.1.4 by John Arbash Meinel CombinedGraphIndex.iter_entries() is now able to reload on request.	1289	# Without a _reload_func we just raise the exception
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1290	self.assertRaises(errors.NoSuchFile, idx.key_count)
3789.1.4 by John Arbash Meinel CombinedGraphIndex.iter_entries() is now able to reload on request.	1291
3789.1.3 by John Arbash Meinel CombinedGraphIndex can now reload when calling key_count().	1292	def test_key_count_reloads_and_fails(self):
3789.1.4 by John Arbash Meinel CombinedGraphIndex.iter_entries() is now able to reload on request.	1293	# We have deleted all underlying indexes, so we will try to reload, but
3789.1.3 by John Arbash Meinel CombinedGraphIndex can now reload when calling key_count().	1294	# still fail. This is mostly to test we don't get stuck in an infinite
	1295	# loop trying to reload
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1296	idx, reload_counter = self.make_combined_index_with_missing(
	1297	['1', '2', '3'])
	1298	self.assertRaises(errors.NoSuchFile, idx.key_count)
3789.1.3 by John Arbash Meinel CombinedGraphIndex can now reload when calling key_count().	1299	self.assertEqual([2, 1, 1], reload_counter)
	1300
3789.1.4 by John Arbash Meinel CombinedGraphIndex.iter_entries() is now able to reload on request.	1301	def test_iter_entries_reloads(self):
	1302	index, reload_counter = self.make_combined_index_with_missing()
	1303	result = list(index.iter_entries([('1',), ('2',), ('3',)]))
	1304	index3 = index._indices[0]
	1305	self.assertEqual([(index3, ('1',), ''), (index3, ('2',), '')],
	1306	result)
	1307	self.assertEqual([1, 1, 0], reload_counter)
	1308
	1309	def test_iter_entries_reloads_midway(self):
	1310	# The first index still looks present, so we get interrupted mid-way
	1311	# through
	1312	index, reload_counter = self.make_combined_index_with_missing(['2'])
	1313	index1, index2 = index._indices
	1314	result = list(index.iter_entries([('1',), ('2',), ('3',)]))
	1315	index3 = index._indices[0]
3789.1.5 by John Arbash Meinel CombinedGraphIndex.iter_all_entries() can now reload when needed.	1316	# We had already yielded '1', so we just go on to the next, we should
3789.1.6 by John Arbash Meinel CombinedGraphIndex.iter_entries_prefix can now reload when needed.	1317	# not yield '1' twice.
3789.1.4 by John Arbash Meinel CombinedGraphIndex.iter_entries() is now able to reload on request.	1318	self.assertEqual([(index1, ('1',), ''), (index3, ('2',), '')],
	1319	result)
	1320	self.assertEqual([1, 1, 0], reload_counter)
	1321
	1322	def test_iter_entries_no_reload(self):
	1323	index, reload_counter = self.make_combined_index_with_missing()
	1324	index._reload_func = None
	1325	# Without a _reload_func we just raise the exception
	1326	self.assertListRaises(errors.NoSuchFile, index.iter_entries, [('3',)])
	1327
	1328	def test_iter_entries_reloads_and_fails(self):
	1329	index, reload_counter = self.make_combined_index_with_missing(
	1330	['1', '2', '3'])
	1331	self.assertListRaises(errors.NoSuchFile, index.iter_entries, [('3',)])
	1332	self.assertEqual([2, 1, 1], reload_counter)
	1333
3789.1.5 by John Arbash Meinel CombinedGraphIndex.iter_all_entries() can now reload when needed.	1334	def test_iter_all_entries_reloads(self):
	1335	index, reload_counter = self.make_combined_index_with_missing()
	1336	result = list(index.iter_all_entries())
	1337	index3 = index._indices[0]
	1338	self.assertEqual([(index3, ('1',), ''), (index3, ('2',), '')],
	1339	result)
	1340	self.assertEqual([1, 1, 0], reload_counter)
	1341
	1342	def test_iter_all_entries_reloads_midway(self):
	1343	index, reload_counter = self.make_combined_index_with_missing(['2'])
	1344	index1, index2 = index._indices
	1345	result = list(index.iter_all_entries())
	1346	index3 = index._indices[0]
	1347	# We had already yielded '1', so we just go on to the next, we should
3789.1.6 by John Arbash Meinel CombinedGraphIndex.iter_entries_prefix can now reload when needed.	1348	# not yield '1' twice.
3789.1.5 by John Arbash Meinel CombinedGraphIndex.iter_all_entries() can now reload when needed.	1349	self.assertEqual([(index1, ('1',), ''), (index3, ('2',), '')],
	1350	result)
	1351	self.assertEqual([1, 1, 0], reload_counter)
	1352
	1353	def test_iter_all_entries_no_reload(self):
	1354	index, reload_counter = self.make_combined_index_with_missing()
	1355	index._reload_func = None
	1356	self.assertListRaises(errors.NoSuchFile, index.iter_all_entries)
	1357
	1358	def test_iter_all_entries_reloads_and_fails(self):
	1359	index, reload_counter = self.make_combined_index_with_missing(
	1360	['1', '2', '3'])
	1361	self.assertListRaises(errors.NoSuchFile, index.iter_all_entries)
3789.1.4 by John Arbash Meinel CombinedGraphIndex.iter_entries() is now able to reload on request.	1362
3789.1.6 by John Arbash Meinel CombinedGraphIndex.iter_entries_prefix can now reload when needed.	1363	def test_iter_entries_prefix_reloads(self):
	1364	index, reload_counter = self.make_combined_index_with_missing()
	1365	result = list(index.iter_entries_prefix([('1',)]))
	1366	index3 = index._indices[0]
	1367	self.assertEqual([(index3, ('1',), '')], result)
	1368	self.assertEqual([1, 1, 0], reload_counter)
	1369
	1370	def test_iter_entries_prefix_reloads_midway(self):
	1371	index, reload_counter = self.make_combined_index_with_missing(['2'])
	1372	index1, index2 = index._indices
	1373	result = list(index.iter_entries_prefix([('1',)]))
	1374	index3 = index._indices[0]
	1375	# We had already yielded '1', so we just go on to the next, we should
	1376	# not yield '1' twice.
	1377	self.assertEqual([(index1, ('1',), '')], result)
	1378	self.assertEqual([1, 1, 0], reload_counter)
	1379
	1380	def test_iter_entries_prefix_no_reload(self):
	1381	index, reload_counter = self.make_combined_index_with_missing()
	1382	index._reload_func = None
	1383	self.assertListRaises(errors.NoSuchFile, index.iter_entries_prefix,
	1384	[('1',)])
	1385
	1386	def test_iter_entries_prefix_reloads_and_fails(self):
	1387	index, reload_counter = self.make_combined_index_with_missing(
	1388	['1', '2', '3'])
	1389	self.assertListRaises(errors.NoSuchFile, index.iter_entries_prefix,
	1390	[('1',)])
	1391
5086.7.7 by Andrew Bennetts Add another test for propagating reorderings.	1392
	1393	def make_index_with_simple_nodes(self, name, num_nodes=1):
	1394	"""Make an index named after 'name', with keys named after 'name' too.
	1395
	1396	Nodes will have a value of '' and no references.
	1397	"""
	1398	nodes = [
	1399	(('index-%s-key-%s' % (name, n),), '', ())
	1400	for n in range(1, num_nodes+1)]
	1401	return self.make_index('index-%s' % name, 0, nodes=nodes)
	1402
5086.7.5 by Andrew Bennetts Add test for CombinedGraphIndex's auto-reordering behaviour.	1403	def test_reorder_after_iter_entries(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1404	# Four indices: [key1] in idx1, [key2,key3] in idx2, [] in idx3,
	1405	# [key4] in idx4.
	1406	idx = index.CombinedGraphIndex([])
	1407	idx.insert_index(0, self.make_index_with_simple_nodes('1'), '1')
	1408	idx.insert_index(1, self.make_index_with_simple_nodes('2'), '2')
	1409	idx.insert_index(2, self.make_index_with_simple_nodes('3'), '3')
	1410	idx.insert_index(3, self.make_index_with_simple_nodes('4'), '4')
	1411	idx1, idx2, idx3, idx4 = idx._indices
	1412	# Query a key from idx4 and idx2.
	1413	self.assertLength(2, list(idx.iter_entries(
5086.7.7 by Andrew Bennetts Add another test for propagating reorderings.	1414	[('index-4-key-1',), ('index-2-key-1',)])))
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1415	# Now idx2 and idx4 should be moved to the front (and idx1 should
	1416	# still be before idx3).
	1417	self.assertEqual([idx2, idx4, idx1, idx3], idx._indices)
	1418	self.assertEqual(['2', '4', '1', '3'], idx._index_names)
5086.7.5 by Andrew Bennetts Add test for CombinedGraphIndex's auto-reordering behaviour.	1419
5086.7.7 by Andrew Bennetts Add another test for propagating reorderings.	1420	def test_reorder_propagates_to_siblings(self):
	1421	# Two CombinedGraphIndex objects, with the same number of indicies with
	1422	# matching names.
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1423	cgi1 = index.CombinedGraphIndex([])
	1424	cgi2 = index.CombinedGraphIndex([])
5086.7.7 by Andrew Bennetts Add another test for propagating reorderings.	1425	cgi1.insert_index(0, self.make_index_with_simple_nodes('1-1'), 'one')
	1426	cgi1.insert_index(1, self.make_index_with_simple_nodes('1-2'), 'two')
	1427	cgi2.insert_index(0, self.make_index_with_simple_nodes('2-1'), 'one')
	1428	cgi2.insert_index(1, self.make_index_with_simple_nodes('2-2'), 'two')
	1429	index2_1, index2_2 = cgi2._indices
	1430	cgi1.set_sibling_indices([cgi2])
	1431	# Trigger a reordering in cgi1. cgi2 will be reordered as well.
	1432	list(cgi1.iter_entries([('index-1-2-key-1',)]))
	1433	self.assertEqual([index2_2, index2_1], cgi2._indices)
	1434	self.assertEqual(['two', 'one'], cgi2._index_names)
	1435
3789.1.7 by John Arbash Meinel CombinedGraphIndex.validate() will now reload.	1436	def test_validate_reloads(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1437	idx, reload_counter = self.make_combined_index_with_missing()
	1438	idx.validate()
3789.1.7 by John Arbash Meinel CombinedGraphIndex.validate() will now reload.	1439	self.assertEqual([1, 1, 0], reload_counter)
	1440
	1441	def test_validate_reloads_midway(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1442	idx, reload_counter = self.make_combined_index_with_missing(['2'])
	1443	idx.validate()
3789.1.7 by John Arbash Meinel CombinedGraphIndex.validate() will now reload.	1444
	1445	def test_validate_no_reload(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1446	idx, reload_counter = self.make_combined_index_with_missing()
	1447	idx._reload_func = None
	1448	self.assertRaises(errors.NoSuchFile, idx.validate)
3789.1.7 by John Arbash Meinel CombinedGraphIndex.validate() will now reload.	1449
	1450	def test_validate_reloads_and_fails(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1451	idx, reload_counter = self.make_combined_index_with_missing(
	1452	['1', '2', '3'])
	1453	self.assertRaises(errors.NoSuchFile, idx.validate)
3789.1.7 by John Arbash Meinel CombinedGraphIndex.validate() will now reload.	1454
4593.4.12 by John Arbash Meinel Name the specific index api _find_ancestors, and the public CombinedGraphIndex api find_ancestry()	1455	def test_find_ancestors_across_indexes(self):
4593.4.8 by John Arbash Meinel Implement CombinedGraphIndex.get_ancestry()	1456	key1 = ('key-1',)
	1457	key2 = ('key-2',)
	1458	key3 = ('key-3',)
	1459	key4 = ('key-4',)
	1460	index1 = self.make_index('12', ref_lists=1, nodes=[
	1461	(key1, 'value', ([],)),
	1462	(key2, 'value', ([key1],)),
	1463	])
	1464	index2 = self.make_index('34', ref_lists=1, nodes=[
	1465	(key3, 'value', ([key2],)),
	1466	(key4, 'value', ([key3],)),
	1467	])
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1468	c_index = index.CombinedGraphIndex([index1, index2])
4593.4.12 by John Arbash Meinel Name the specific index api _find_ancestors, and the public CombinedGraphIndex api find_ancestry()	1469	parent_map, missing_keys = c_index.find_ancestry([key1], 0)
4593.4.8 by John Arbash Meinel Implement CombinedGraphIndex.get_ancestry()	1470	self.assertEqual({key1: ()}, parent_map)
	1471	self.assertEqual(set(), missing_keys)
	1472	# Now look for a key from index2 which requires us to find the key in
	1473	# the second index, and then continue searching for parents in the
	1474	# first index
4593.4.12 by John Arbash Meinel Name the specific index api _find_ancestors, and the public CombinedGraphIndex api find_ancestry()	1475	parent_map, missing_keys = c_index.find_ancestry([key3], 0)
4593.4.8 by John Arbash Meinel Implement CombinedGraphIndex.get_ancestry()	1476	self.assertEqual({key1: (), key2: (key1,), key3: (key2,)}, parent_map)
	1477	self.assertEqual(set(), missing_keys)
	1478
4593.4.12 by John Arbash Meinel Name the specific index api _find_ancestors, and the public CombinedGraphIndex api find_ancestry()	1479	def test_find_ancestors_missing_keys(self):
4593.4.8 by John Arbash Meinel Implement CombinedGraphIndex.get_ancestry()	1480	key1 = ('key-1',)
	1481	key2 = ('key-2',)
	1482	key3 = ('key-3',)
	1483	key4 = ('key-4',)
	1484	index1 = self.make_index('12', ref_lists=1, nodes=[
	1485	(key1, 'value', ([],)),
	1486	(key2, 'value', ([key1],)),
	1487	])
	1488	index2 = self.make_index('34', ref_lists=1, nodes=[
	1489	(key3, 'value', ([key2],)),
	1490	])
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1491	c_index = index.CombinedGraphIndex([index1, index2])
4593.4.8 by John Arbash Meinel Implement CombinedGraphIndex.get_ancestry()	1492	# Searching for a key which is actually not present at all should
	1493	# eventually converge
4593.4.12 by John Arbash Meinel Name the specific index api _find_ancestors, and the public CombinedGraphIndex api find_ancestry()	1494	parent_map, missing_keys = c_index.find_ancestry([key4], 0)
4593.4.8 by John Arbash Meinel Implement CombinedGraphIndex.get_ancestry()	1495	self.assertEqual({}, parent_map)
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1496	self.assertEqual({key4}, missing_keys)
4593.4.8 by John Arbash Meinel Implement CombinedGraphIndex.get_ancestry()	1497
4593.4.12 by John Arbash Meinel Name the specific index api _find_ancestors, and the public CombinedGraphIndex api find_ancestry()	1498	def test_find_ancestors_no_indexes(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1499	c_index = index.CombinedGraphIndex([])
4593.4.8 by John Arbash Meinel Implement CombinedGraphIndex.get_ancestry()	1500	key1 = ('key-1',)
4593.4.12 by John Arbash Meinel Name the specific index api _find_ancestors, and the public CombinedGraphIndex api find_ancestry()	1501	parent_map, missing_keys = c_index.find_ancestry([key1], 0)
4593.4.8 by John Arbash Meinel Implement CombinedGraphIndex.get_ancestry()	1502	self.assertEqual({}, parent_map)
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1503	self.assertEqual({key1}, missing_keys)
4593.4.8 by John Arbash Meinel Implement CombinedGraphIndex.get_ancestry()	1504
4593.4.12 by John Arbash Meinel Name the specific index api _find_ancestors, and the public CombinedGraphIndex api find_ancestry()	1505	def test_find_ancestors_ghost_parent(self):
4593.4.8 by John Arbash Meinel Implement CombinedGraphIndex.get_ancestry()	1506	key1 = ('key-1',)
	1507	key2 = ('key-2',)
	1508	key3 = ('key-3',)
	1509	key4 = ('key-4',)
	1510	index1 = self.make_index('12', ref_lists=1, nodes=[
	1511	(key1, 'value', ([],)),
	1512	(key2, 'value', ([key1],)),
	1513	])
	1514	index2 = self.make_index('34', ref_lists=1, nodes=[
	1515	(key4, 'value', ([key2, key3],)),
	1516	])
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1517	c_index = index.CombinedGraphIndex([index1, index2])
4593.4.8 by John Arbash Meinel Implement CombinedGraphIndex.get_ancestry()	1518	# Searching for a key which is actually not present at all should
	1519	# eventually converge
4593.4.12 by John Arbash Meinel Name the specific index api _find_ancestors, and the public CombinedGraphIndex api find_ancestry()	1520	parent_map, missing_keys = c_index.find_ancestry([key4], 0)
4593.4.8 by John Arbash Meinel Implement CombinedGraphIndex.get_ancestry()	1521	self.assertEqual({key4: (key2, key3), key2: (key1,), key1: ()},
	1522	parent_map)
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1523	self.assertEqual({key3}, missing_keys)
4593.4.8 by John Arbash Meinel Implement CombinedGraphIndex.get_ancestry()	1524
4593.4.12 by John Arbash Meinel Name the specific index api _find_ancestors, and the public CombinedGraphIndex api find_ancestry()	1525	def test__find_ancestors_empty_index(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1526	idx = self.make_index('test', ref_lists=1, key_elements=1, nodes=[])
4593.4.11 by John Arbash Meinel Snapshot the work in progress.	1527	parent_map = {}
	1528	missing_keys = set()
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1529	search_keys = idx._find_ancestors([('one',), ('two',)], 0, parent_map,
	1530	missing_keys)
4593.4.11 by John Arbash Meinel Snapshot the work in progress.	1531	self.assertEqual(set(), search_keys)
	1532	self.assertEqual({}, parent_map)
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1533	self.assertEqual({('one',), ('two',)}, missing_keys)
4593.4.11 by John Arbash Meinel Snapshot the work in progress.	1534
2592.1.38 by Robert Collins Create an InMemoryGraphIndex for temporary indexing.	1535
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1536	class TestInMemoryGraphIndex(tests.TestCaseWithMemoryTransport):
2592.1.38 by Robert Collins Create an InMemoryGraphIndex for temporary indexing.	1537
2624.2.10 by Robert Collins Also add iter_key_prefix support to InMemoryGraphIndex.	1538	def make_index(self, ref_lists=0, key_elements=1, nodes=[]):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1539	result = index.InMemoryGraphIndex(ref_lists, key_elements=key_elements)
2592.1.38 by Robert Collins Create an InMemoryGraphIndex for temporary indexing.	1540	result.add_nodes(nodes)
	1541	return result
	1542
2624.2.1 by Robert Collins InMemoryGraphIndex.add_nodes was inconsistent with other metods for non-node-reference indices.	1543	def test_add_nodes_no_refs(self):
	1544	index = self.make_index(0)
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	1545	index.add_nodes([(('name', ), 'data')])
	1546	index.add_nodes([(('name2', ), ''), (('name3', ), '')])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1547	self.assertEqual({
2624.2.14 by Robert Collins Add source index to the index iteration API to allow mapping back to the origin of retrieved data.	1548	(index, ('name', ), 'data'),
	1549	(index, ('name2', ), ''),
	1550	(index, ('name3', ), ''),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1551	}, set(index.iter_all_entries()))
2624.2.1 by Robert Collins InMemoryGraphIndex.add_nodes was inconsistent with other metods for non-node-reference indices.	1552
2592.1.38 by Robert Collins Create an InMemoryGraphIndex for temporary indexing.	1553	def test_add_nodes(self):
	1554	index = self.make_index(1)
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	1555	index.add_nodes([(('name', ), 'data', ([],))])
	1556	index.add_nodes([(('name2', ), '', ([],)), (('name3', ), '', ([('r', )],))])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1557	self.assertEqual({
2624.2.14 by Robert Collins Add source index to the index iteration API to allow mapping back to the origin of retrieved data.	1558	(index, ('name', ), 'data', ((),)),
	1559	(index, ('name2', ), '', ((),)),
	1560	(index, ('name3', ), '', ((('r', ), ), )),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1561	}, set(index.iter_all_entries()))
2592.1.38 by Robert Collins Create an InMemoryGraphIndex for temporary indexing.	1562
	1563	def test_iter_all_entries_empty(self):
	1564	index = self.make_index()
	1565	self.assertEqual([], list(index.iter_all_entries()))
	1566
	1567	def test_iter_all_entries_simple(self):
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	1568	index = self.make_index(nodes=[(('name', ), 'data')])
2624.2.14 by Robert Collins Add source index to the index iteration API to allow mapping back to the origin of retrieved data.	1569	self.assertEqual([(index, ('name', ), 'data')],
2592.1.38 by Robert Collins Create an InMemoryGraphIndex for temporary indexing.	1570	list(index.iter_all_entries()))
	1571
	1572	def test_iter_all_entries_references(self):
	1573	index = self.make_index(1, nodes=[
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	1574	(('name', ), 'data', ([('ref', )], )),
	1575	(('ref', ), 'refdata', ([], ))])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1576	self.assertEqual({(index, ('name', ), 'data', ((('ref', ),),)),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1577	(index, ('ref', ), 'refdata', ((), ))},
2592.1.38 by Robert Collins Create an InMemoryGraphIndex for temporary indexing.	1578	set(index.iter_all_entries()))
	1579
	1580	def test_iteration_absent_skipped(self):
	1581	index = self.make_index(1, nodes=[
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	1582	(('name', ), 'data', ([('ref', )], ))])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1583	self.assertEqual({(index, ('name', ), 'data', ((('ref',),),))},
2592.1.38 by Robert Collins Create an InMemoryGraphIndex for temporary indexing.	1584	set(index.iter_all_entries()))
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1585	self.assertEqual({(index, ('name', ), 'data', ((('ref',),),))},
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	1586	set(index.iter_entries([('name', )])))
	1587	self.assertEqual([], list(index.iter_entries([('ref', )])))
2592.1.38 by Robert Collins Create an InMemoryGraphIndex for temporary indexing.	1588
	1589	def test_iter_all_keys(self):
	1590	index = self.make_index(1, nodes=[
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	1591	(('name', ), 'data', ([('ref', )], )),
	1592	(('ref', ), 'refdata', ([], ))])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1593	self.assertEqual({(index, ('name', ), 'data', ((('ref',),),)),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1594	(index, ('ref', ), 'refdata', ((), ))},
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	1595	set(index.iter_entries([('name', ), ('ref', )])))
2592.1.38 by Robert Collins Create an InMemoryGraphIndex for temporary indexing.	1596
2624.2.10 by Robert Collins Also add iter_key_prefix support to InMemoryGraphIndex.	1597	def test_iter_key_prefix_1_key_element_no_refs(self):
	1598	index = self.make_index( nodes=[
	1599	(('name', ), 'data'),
	1600	(('ref', ), 'refdata')])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1601	self.assertEqual({(index, ('name', ), 'data'),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1602	(index, ('ref', ), 'refdata')},
2624.2.10 by Robert Collins Also add iter_key_prefix support to InMemoryGraphIndex.	1603	set(index.iter_entries_prefix([('name', ), ('ref', )])))
	1604
	1605	def test_iter_key_prefix_1_key_element_refs(self):
	1606	index = self.make_index(1, nodes=[
	1607	(('name', ), 'data', ([('ref', )], )),
	1608	(('ref', ), 'refdata', ([], ))])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1609	self.assertEqual({(index, ('name', ), 'data', ((('ref',),),)),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1610	(index, ('ref', ), 'refdata', ((), ))},
2624.2.10 by Robert Collins Also add iter_key_prefix support to InMemoryGraphIndex.	1611	set(index.iter_entries_prefix([('name', ), ('ref', )])))
	1612
	1613	def test_iter_key_prefix_2_key_element_no_refs(self):
	1614	index = self.make_index(key_elements=2, nodes=[
	1615	(('name', 'fin1'), 'data'),
	1616	(('name', 'fin2'), 'beta'),
	1617	(('ref', 'erence'), 'refdata')])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1618	self.assertEqual({(index, ('name', 'fin1'), 'data'),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1619	(index, ('ref', 'erence'), 'refdata')},
2624.2.10 by Robert Collins Also add iter_key_prefix support to InMemoryGraphIndex.	1620	set(index.iter_entries_prefix([('name', 'fin1'), ('ref', 'erence')])))
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1621	self.assertEqual({(index, ('name', 'fin1'), 'data'),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1622	(index, ('name', 'fin2'), 'beta')},
2624.2.10 by Robert Collins Also add iter_key_prefix support to InMemoryGraphIndex.	1623	set(index.iter_entries_prefix([('name', None)])))
	1624
	1625	def test_iter_key_prefix_2_key_element_refs(self):
	1626	index = self.make_index(1, key_elements=2, nodes=[
	1627	(('name', 'fin1'), 'data', ([('ref', 'erence')], )),
	1628	(('name', 'fin2'), 'beta', ([], )),
	1629	(('ref', 'erence'), 'refdata', ([], ))])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1630	self.assertEqual({(index, ('name', 'fin1'), 'data', ((('ref', 'erence'),),)),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1631	(index, ('ref', 'erence'), 'refdata', ((), ))},
2624.2.10 by Robert Collins Also add iter_key_prefix support to InMemoryGraphIndex.	1632	set(index.iter_entries_prefix([('name', 'fin1'), ('ref', 'erence')])))
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1633	self.assertEqual({(index, ('name', 'fin1'), 'data', ((('ref', 'erence'),),)),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1634	(index, ('name', 'fin2'), 'beta', ((), ))},
2624.2.10 by Robert Collins Also add iter_key_prefix support to InMemoryGraphIndex.	1635	set(index.iter_entries_prefix([('name', None)])))
	1636
2592.1.38 by Robert Collins Create an InMemoryGraphIndex for temporary indexing.	1637	def test_iter_nothing_empty(self):
	1638	index = self.make_index()
	1639	self.assertEqual([], list(index.iter_entries([])))
	1640
	1641	def test_iter_missing_entry_empty(self):
	1642	index = self.make_index()
	1643	self.assertEqual([], list(index.iter_entries(['a'])))
	1644
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	1645	def test_key_count_empty(self):
	1646	index = self.make_index()
	1647	self.assertEqual(0, index.key_count())
	1648
	1649	def test_key_count_one(self):
	1650	index = self.make_index(nodes=[(('name', ), '')])
	1651	self.assertEqual(1, index.key_count())
	1652
	1653	def test_key_count_two(self):
	1654	index = self.make_index(nodes=[(('name', ), ''), (('foo', ), '')])
	1655	self.assertEqual(2, index.key_count())
	1656
2592.1.38 by Robert Collins Create an InMemoryGraphIndex for temporary indexing.	1657	def test_validate_empty(self):
	1658	index = self.make_index()
	1659	index.validate()
	1660
	1661	def test_validate_no_refs_content(self):
2624.2.5 by Robert Collins Change bzrlib.index.Index keys to be 1-tuples, not strings.	1662	index = self.make_index(nodes=[(('key', ), 'value')])
2592.1.38 by Robert Collins Create an InMemoryGraphIndex for temporary indexing.	1663	index.validate()
	1664
	1665
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1666	class TestGraphIndexPrefixAdapter(tests.TestCaseWithMemoryTransport):
2624.2.12 by Robert Collins Create an adapter between indices with differing key lengths.	1667
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1668	def make_index(self, ref_lists=1, key_elements=2, nodes=[],
	1669	add_callback=False):
	1670	result = index.InMemoryGraphIndex(ref_lists, key_elements=key_elements)
2624.2.12 by Robert Collins Create an adapter between indices with differing key lengths.	1671	result.add_nodes(nodes)
2624.2.13 by Robert Collins Implement add_node/add_nodes to the GraphIndexPrefixAdapter.	1672	if add_callback:
2624.2.17 by Robert Collins Review feedback.	1673	add_nodes_callback = result.add_nodes
2624.2.13 by Robert Collins Implement add_node/add_nodes to the GraphIndexPrefixAdapter.	1674	else:
2624.2.17 by Robert Collins Review feedback.	1675	add_nodes_callback = None
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1676	adapter = index.GraphIndexPrefixAdapter(
	1677	result, ('prefix', ), key_elements - 1,
2624.2.13 by Robert Collins Implement add_node/add_nodes to the GraphIndexPrefixAdapter.	1678	add_nodes_callback=add_nodes_callback)
2624.2.12 by Robert Collins Create an adapter between indices with differing key lengths.	1679	return result, adapter
	1680
2624.2.13 by Robert Collins Implement add_node/add_nodes to the GraphIndexPrefixAdapter.	1681	def test_add_node(self):
	1682	index, adapter = self.make_index(add_callback=True)
	1683	adapter.add_node(('key',), 'value', ((('ref',),),))
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1684	self.assertEqual({(index, ('prefix', 'key'), 'value',
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1685	((('prefix', 'ref'),),))},
2624.2.13 by Robert Collins Implement add_node/add_nodes to the GraphIndexPrefixAdapter.	1686	set(index.iter_all_entries()))
	1687
	1688	def test_add_nodes(self):
	1689	index, adapter = self.make_index(add_callback=True)
	1690	adapter.add_nodes((
	1691	(('key',), 'value', ((('ref',),),)),
	1692	(('key2',), 'value2', ((),)),
	1693	))
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1694	self.assertEqual({
2624.2.14 by Robert Collins Add source index to the index iteration API to allow mapping back to the origin of retrieved data.	1695	(index, ('prefix', 'key2'), 'value2', ((),)),
	1696	(index, ('prefix', 'key'), 'value', ((('prefix', 'ref'),),))
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1697	},
2624.2.13 by Robert Collins Implement add_node/add_nodes to the GraphIndexPrefixAdapter.	1698	set(index.iter_all_entries()))
	1699
2624.2.12 by Robert Collins Create an adapter between indices with differing key lengths.	1700	def test_construct(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1701	idx = index.InMemoryGraphIndex()
	1702	adapter = index.GraphIndexPrefixAdapter(idx, ('prefix', ), 1)
2624.2.12 by Robert Collins Create an adapter between indices with differing key lengths.	1703
	1704	def test_construct_with_callback(self):
5273.1.7 by Vincent Ladeuil No more use of the get_transport imported symbol, all uses are through	1705	idx = index.InMemoryGraphIndex()
	1706	adapter = index.GraphIndexPrefixAdapter(idx, ('prefix', ), 1,
	1707	idx.add_nodes)
2624.2.12 by Robert Collins Create an adapter between indices with differing key lengths.	1708
	1709	def test_iter_all_entries_cross_prefix_map_errors(self):
	1710	index, adapter = self.make_index(nodes=[
	1711	(('prefix', 'key1'), 'data1', ((('prefixaltered', 'key2'),),))])
	1712	self.assertRaises(errors.BadIndexData, list, adapter.iter_all_entries())
	1713
	1714	def test_iter_all_entries(self):
	1715	index, adapter = self.make_index(nodes=[
	1716	(('notprefix', 'key1'), 'data', ((), )),
	1717	(('prefix', 'key1'), 'data1', ((), )),
	1718	(('prefix', 'key2'), 'data2', ((('prefix', 'key1'),),))])
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1719	self.assertEqual({(index, ('key1', ), 'data1', ((),)),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1720	(index, ('key2', ), 'data2', ((('key1',),),))},
2624.2.12 by Robert Collins Create an adapter between indices with differing key lengths.	1721	set(adapter.iter_all_entries()))
	1722
	1723	def test_iter_entries(self):
	1724	index, adapter = self.make_index(nodes=[
	1725	(('notprefix', 'key1'), 'data', ((), )),
	1726	(('prefix', 'key1'), 'data1', ((), )),
	1727	(('prefix', 'key2'), 'data2', ((('prefix', 'key1'),),))])
	1728	# ask for many - get all
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1729	self.assertEqual({(index, ('key1', ), 'data1', ((),)),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1730	(index, ('key2', ), 'data2', ((('key1', ),),))},
2624.2.12 by Robert Collins Create an adapter between indices with differing key lengths.	1731	set(adapter.iter_entries([('key1', ), ('key2', )])))
	1732	# ask for one, get one
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1733	self.assertEqual({(index, ('key1', ), 'data1', ((),))},
2624.2.12 by Robert Collins Create an adapter between indices with differing key lengths.	1734	set(adapter.iter_entries([('key1', )])))
	1735	# ask for missing, get none
	1736	self.assertEqual(set(),
	1737	set(adapter.iter_entries([('key3', )])))
	1738
	1739	def test_iter_entries_prefix(self):
	1740	index, adapter = self.make_index(key_elements=3, nodes=[
	1741	(('notprefix', 'foo', 'key1'), 'data', ((), )),
	1742	(('prefix', 'prefix2', 'key1'), 'data1', ((), )),
	1743	(('prefix', 'prefix2', 'key2'), 'data2', ((('prefix', 'prefix2', 'key1'),),))])
	1744	# ask for a prefix, get the results for just that prefix, adjusted.
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1745	self.assertEqual({(index, ('prefix2', 'key1', ), 'data1', ((),)),
6619.3.12 by Jelmer Vernooĳ Use 2to3 set_literal fixer.	1746	(index, ('prefix2', 'key2', ), 'data2', ((('prefix2', 'key1', ),),))},
2624.2.12 by Robert Collins Create an adapter between indices with differing key lengths.	1747	set(adapter.iter_entries_prefix([('prefix2', None)])))
	1748
2624.2.16 by Robert Collins Add a key_count method to GraphIndex and friends, allowing optimisation of length calculations by the index.	1749	def test_key_count_no_matching_keys(self):
	1750	index, adapter = self.make_index(nodes=[
	1751	(('notprefix', 'key1'), 'data', ((), ))])
	1752	self.assertEqual(0, adapter.key_count())
	1753
	1754	def test_key_count_some_keys(self):
	1755	index, adapter = self.make_index(nodes=[
	1756	(('notprefix', 'key1'), 'data', ((), )),
	1757	(('prefix', 'key1'), 'data1', ((), )),
	1758	(('prefix', 'key2'), 'data2', ((('prefix', 'key1'),),))])
	1759	self.assertEqual(2, adapter.key_count())
	1760
2624.2.12 by Robert Collins Create an adapter between indices with differing key lengths.	1761	def test_validate(self):
	1762	index, adapter = self.make_index()
	1763	calls = []
	1764	def validate():
	1765	calls.append('called')
	1766	index.validate = validate
	1767	adapter.validate()
	1768	self.assertEqual(['called'], calls)