← Back to branch summary

~bzr-pqm/bzr/bzr.dev

« back to all changes in this revision

Viewing changes to bzrlib/tests/test_bisect_multi.py

  • Committer: Vincent Ladeuil
  • Date: 2008-09-11 19:36:38 UTC
  • mfrom: (3703 +trunk)
  • mto: (3705.1.1 trunk2)
  • mto: This revision was merged to the branch mainline in revision 3708.
  • Revision ID: v.ladeuil+lp@free.fr-20080911193638-wtjyc1kcmacc6t1f
merge bzr.dev

Show diffs side-by-side

added added

removed removed

Lines of Context:
bzrlib/tests/test_bisect_multi.py
1
 
# Copyright (C) 2007, 2009, 2011 Canonical Ltd
 
1
# Copyright (C) 2007 Canonical Ltd
2
2
#
3
3
# This program is free software; you can redistribute it and/or modify
4
4
# it under the terms of the GNU General Public License as published by
12
12
#
13
13
# You should have received a copy of the GNU General Public License
14
14
# along with this program; if not, write to the Free Software
15
 
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
 
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
16
16
 
17
17
"""Tests for bisect_multi."""
18
18
 
 
19
from bzrlib import errors
19
20
from bzrlib.bisect_multi import bisect_multi_bytes
20
21
from bzrlib.tests import TestCase
21
22
 
33
34
 
34
35
    def test_lookup_missing_key_no_content(self):
35
36
        """Doing a lookup in a zero-length file still does a single request.
36
 
 
 
37
        
37
38
        This makes sense because the bisector cannot tell how long content is
38
39
        and its more flexible to only stop when the content object says 'False'
39
40
        for a given location, key pair.
314
315
            ], calls)
315
316
 
316
317
    def test_change_direction_in_single_key_search(self):
317
 
        # check that we can search down, up, down again -
 
318
        # check that we can search down, up, down again - 
318
319
        # so length 8, goes 4, 6, 5
319
320
        calls = []
320
321
        def missing_at_5(location_keys):