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

ancestor.missingancestors: turn into a state-keeping class...

ancestor.missingancestors: turn into a state-keeping class This allows multiple efficient missing ancestor queries against the same set of bases. In upcoming patches we'll also define ways to grow the set of bases. The fact that the test output hasn't changed establishes this patch's correctness.

Siddharth Agarwal - - Load All Authors

File last commit:

r19710:887ffa22 default


                r23334:59e6e5dd

default

Download file

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

        Siddharth Agarwal
    
util: add an LRU cache dict...

              r18603
            
      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'])

        Siddharth Agarwal
    
lrucachedict: implement clear()

              r19710
            
          d.clear()

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

        Siddharth Agarwal
    
util: add an LRU cache dict...

              r18603
            
      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

Siddharth Agarwal util: add an LRU cache dict...	r18603	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'])

Siddharth Agarwal lrucachedict: implement clear()	r19710	d.clear()
		printifpresent(d, ['b', 'c', 'd', 'e', 'f'])

Siddharth Agarwal util: add an LRU cache dict...	r18603	if __name__ == '__main__':
		test_lrucachedict()