upstream/mercurial-mirror Files · mercurial/obsutil.py

dagop: compute depth in revancestors() generator...

dagop: compute depth in revancestors() generator Surprisingly, this makes revset benchmark slightly faster. I don't know why, but it appears that wrapping -inputrev by tuple is the key. So I decided to just enable depth computation by default. # reverse(ancestors(tip)) using hg repo 1) 0.081051 2) 0.075408

Boris Feld - - Load All Authors

File last commit:

r32879:1858fc23 default


                r33001:92d0945a

default

Download file

             obsutil.py
        
                    36 lines
            
             | 1.0 KiB
            
                | text/x-python
            
             |
                PythonLexer
            
             / mercurial / obsutil.py
          
                    History
                
                 |
                  Annotation
                 | Raw
                 |Copy content
                 |Copy permalink

      # obsutil.py - utility functions for obsolescence

      #

      # Copyright 2017 Boris Feld <boris.feld@octobus.net>

      #

      # This software may be used and distributed according to the terms of the

      # GNU General Public License version 2 or any later version.

      from __future__ import absolute_import

      def closestpredecessors(repo, nodeid):

          """yield the list of next predecessors pointing on visible changectx nodes

          This function respect the repoview filtering, filtered revision will be

          considered missing.

          """

          precursors = repo.obsstore.precursors

          stack = [nodeid]

          seen = set(stack)

          while stack:

              current = stack.pop()

              currentpreccs = precursors.get(current, ())

              for prec in currentpreccs:

                  precnodeid = prec[0]

                  # Basic cycle protection

                  if precnodeid in seen:

                      continue

                  seen.add(precnodeid)

                  if precnodeid in repo:

                      yield precnodeid

                  else:

                      stack.append(precnodeid)

	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

				# obsutil.py - utility functions for obsolescence
				#
				# Copyright 2017 Boris Feld <boris.feld@octobus.net>
				#
				# This software may be used and distributed according to the terms of the
				# GNU General Public License version 2 or any later version.

				from __future__ import absolute_import

				def closestpredecessors(repo, nodeid):
				"""yield the list of next predecessors pointing on visible changectx nodes

				This function respect the repoview filtering, filtered revision will be
				considered missing.
				"""

				precursors = repo.obsstore.precursors
				stack = [nodeid]
				seen = set(stack)

				while stack:
				current = stack.pop()
				currentpreccs = precursors.get(current, ())

				for prec in currentpreccs:
				precnodeid = prec[0]

				# Basic cycle protection
				if precnodeid in seen:
				continue
				seen.add(precnodeid)

				if precnodeid in repo:
				yield precnodeid
				else:
				stack.append(precnodeid)