~bzr-pqm/bzr/bzr.dev

« back to all changes in this revision

Viewing changes to bzrlib/benchmarks/bench_workingtree.py

  • Committer: Canonical.com Patch Queue Manager
  • Date: 2006-09-20 13:59:17 UTC
  • mfrom: (1551.8.25 Aaron's mergeable stuff)
  • Revision ID: pqm@pqm.ubuntu.com-20060920135917-9b085ce8e1ba0d18
Fix deprecated use of pending_merges

Show diffs side-by-side

added added

removed removed

Lines of Context:
1
 
# Copyright (C) 2006 Canonical Ltd
 
1
# Copyright (C) 2006 by Canonical Ltd
2
2
#
3
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.
 
4
# it under the terms of the GNU General Public License version 2 as published by
 
5
# the Free Software Foundation.
7
6
#
8
7
# This program is distributed in the hope that it will be useful,
9
8
# but WITHOUT ANY WARRANTY; without even the implied warranty of
18
17
 
19
18
import os
20
19
 
21
 
from bzrlib import ignores
22
20
from bzrlib.benchmarks import Benchmark
23
21
from bzrlib.workingtree import WorkingTree
24
22
 
27
25
 
28
26
    def test_list_files_kernel_like_tree(self):
29
27
        tree = self.make_kernel_like_added_tree()
30
 
        tree.lock_read()
31
 
        try:
32
 
            self.time(list, tree.list_files())
33
 
        finally:
34
 
            tree.unlock()
 
28
        self.time(list, tree.list_files())
35
29
 
36
30
    def test_list_files_unknown_kernel_like_tree(self):
37
31
        tree = self.make_kernel_like_tree(link_working=True)
45
39
            if root == '.':
46
40
                continue
47
41
            tree.add(root)
48
 
        tree.lock_read()
49
 
        try:
50
 
            self.time(list, tree.list_files())
51
 
        finally:
52
 
            tree.unlock()
 
42
        self.time(list, tree.list_files())
53
43
 
54
44
    def test_is_ignored_single_call(self):
55
45
        """How long does is_ignored take to initialise and check one file."""
63
53
            for x in xrange(10824):
64
54
                t.is_ignored(str(x))
65
55
        self.time(call_is_ignored_10824_not_ignored)
66
 
 
67
 
    def test_is_ignored_10_patterns(self):
68
 
        t = self.make_branch_and_tree('.')
69
 
        ignores.add_runtime_ignores([u'*.%i' % i for i in range(1, 9)])
70
 
        ignores.add_runtime_ignores(['./foo', 'foo/bar'])
71
 
        self.time(t.is_ignored,'bar')
72
 
        ignores._runtime_ignores = set()
73
 
 
74
 
    def test_is_ignored_50_patterns(self):
75
 
        t = self.make_branch_and_tree('.')
76
 
        ignores.add_runtime_ignores([u'*.%i' % i for i in range(1, 49)])
77
 
        ignores.add_runtime_ignores(['./foo', 'foo/bar'])
78
 
        self.time(t.is_ignored,'bar')
79
 
        ignores._runtime_ignores = set()
80
 
 
81
 
    def test_is_ignored_100_patterns(self):
82
 
        t = self.make_branch_and_tree('.')
83
 
        ignores.add_runtime_ignores([u'*.%i' % i for i in range(1, 99)])
84
 
        ignores.add_runtime_ignores(['./foo', 'foo/bar'])
85
 
        self.time(t.is_ignored,'bar')
86
 
        ignores._runtime_ignores = set()
87
 
 
88
 
    def test_is_ignored_1000_patterns(self):
89
 
        t = self.make_branch_and_tree('.')
90
 
        ignores.add_runtime_ignores([u'*.%i' % i for i in range(1, 999)])
91
 
        ignores.add_runtime_ignores(['./foo', 'foo/bar'])
92
 
        self.time(t.is_ignored,'bar')
93
 
        ignores._runtime_ignores = set()
94
 
 
95
 
    def test_walkdirs_kernel_like_tree(self):
96
 
        """Walking a kernel sized tree is fast!(150ms)."""
97
 
        self.make_kernel_like_tree()
98
 
        self.run_bzr('add')
99
 
        tree = WorkingTree.open('.')
100
 
        # on roberts machine: this originally took:  157ms/4177ms
101
 
        # plain os.walk takes 213ms on this tree
102
 
        self.time(list, tree.walkdirs())
103
 
 
104
 
    def test_walkdirs_kernel_like_tree_unknown(self):
105
 
        """Walking a kernel sized tree is fast!(150ms)."""
106
 
        self.make_kernel_like_tree()
107
 
        tree = WorkingTree.open('.')
108
 
        # on roberts machine: this originally took:  157ms/4177ms
109
 
        # plain os.walk takes 213ms on this tree
110
 
        self.time(list, tree.walkdirs())