upstream/mercurial-mirror Files · tests/test-lrucachedict.py

cmdutil: implemented new lazy increasingwindows...

cmdutil: implemented new lazy increasingwindows Now log can work in a lazy way and get results as soon as they are processed. Performance Benchmarking: $ time hg log -l1 -qr "branch(default)" 0:9117c6561b0b real 0m2.303s user 0m2.252s sys 0m0.048s $ time ./hg log -l1 -qr "branch(default)" 0:9117c6561b0b real 0m0.238s user 0m0.199s sys 0m0.037s

Siddharth Agarwal - - Load All Authors

File last commit:

r19710:887ffa22 default


                r20553:86cefb15

default

Download file

             test-lrucachedict.py
        
                    38 lines
            
             | 871 B
            
                | text/x-python
            
             |
                PythonLexer
            
             / tests / test-lrucachedict.py
          
                    History
                
                 |
                  Annotation
                 | Raw
                 |Copy content
                 |Copy permalink

      from mercurial import util

      def printifpresent(d, xs):

          for x in xs:

              present = x in d

              print "'%s' in d: %s" % (x, present)

              if present:

                  print "d['%s']: %s" % (x, d[x])

      def test_lrucachedict():

          d = util.lrucachedict(4)

          d['a'] = 'va'

          d['b'] = 'vb'

          d['c'] = 'vc'

          d['d'] = 'vd'

          # all of these should be present

          printifpresent(d, ['a', 'b', 'c', 'd'])

          # 'a' should be dropped because it was least recently used

          d['e'] = 've'

          printifpresent(d, ['a', 'b', 'c', 'd', 'e'])

          # touch entries in some order (get or set).

          d['e']

          d['c'] = 'vc2'

          d['d']

          d['b'] = 'vb2'

          # 'e' should be dropped now

          d['f'] = 'vf'

          printifpresent(d, ['b', 'c', 'd', 'e', 'f'])

          d.clear()

          printifpresent(d, ['b', 'c', 'd', 'e', 'f'])

      if __name__ == '__main__':

          test_lrucachedict()

	Site-wide shortcuts
/	Use quick search box
g h	Goto home page
g g	Goto my private gists page
g G	Goto my public gists page
g 0-9	Goto bookmarked items from 0-9
n r	New repository page
n g	New gist page

	Repositories
g s	Goto summary page
g c	Goto changelog page
g f	Goto files page
g F	Goto files page with file search activated
g p	Goto pull requests page
g o	Goto repository settings
g O	Goto repository access permissions settings
t s	Toggle sidebar on some pages

				from mercurial import util

				def printifpresent(d, xs):
				for x in xs:
				present = x in d
				print "'%s' in d: %s" % (x, present)
				if present:
				print "d['%s']: %s" % (x, d[x])

				def test_lrucachedict():
				d = util.lrucachedict(4)
				d['a'] = 'va'
				d['b'] = 'vb'
				d['c'] = 'vc'
				d['d'] = 'vd'

				# all of these should be present
				printifpresent(d, ['a', 'b', 'c', 'd'])

				# 'a' should be dropped because it was least recently used
				d['e'] = 've'
				printifpresent(d, ['a', 'b', 'c', 'd', 'e'])

				# touch entries in some order (get or set).
				d['e']
				d['c'] = 'vc2'
				d['d']
				d['b'] = 'vb2'

				# 'e' should be dropped now
				d['f'] = 'vf'
				printifpresent(d, ['b', 'c', 'd', 'e', 'f'])

				d.clear()
				printifpresent(d, ['b', 'c', 'd', 'e', 'f'])

				if __name__ == '__main__':
				test_lrucachedict()