upstream/mercurial-mirror Files · mercurial/utils/repoviewutil.py

rust-pyo3: dagop submodule implementation...

rust-pyo3: dagop submodule implementation This is the first demonstration that the passing of objects through the Python interpreter from `rustext` to `pyo3_rustext` actually works. In the Python tests, we conflate the presence of the `pyo3_rustext` package with that of `rustext`, as we do not plan to support building one and not the other (we hope to convert fully to PyO3 soon). The skipping is actually done by the base test class. The implementation of `rank` is as trivial as it was in `hg-cpython`, yet it required to be able to convert exceptions from `vcsgraph`.

Matt Harbison - - Load All Authors

File last commit:

r52756:f4733654 default


                r53310:20fe0bf9

default

Download file

             repoviewutil.py
        
                    53 lines
            
             | 1.6 KiB
            
                | text/x-python
            
             |
                PythonLexer
            
             / mercurial / utils / repoviewutil.py
          
                    History
                
                 |
                  Annotation
                 | Raw
                 |Copy content
                 |Copy permalink

      # repoviewutil.py - constaints data relevant to repoview.py and other module

      #

      # Copyright 2012 Pierre-Yves David <pierre-yves.david@ens-lyon.org>

      #                Logilab SA        <contact@logilab.fr>

      #

      # 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 annotations

      from .. import error

      ### Nearest subset relation

      # Nearest subset of filter X is a filter Y so that:

      # * Y is included in X,

      # * X - Y is as small as possible.

      # This create and ordering used for branchmap purpose.

      # the ordering may be partial

      subsettable = {

          None: b'visible',

          b'visible-hidden': b'visible',

          b'visible': b'served',

          b'served.hidden': b'served',

          b'served': b'immutable',

          b'immutable': b'base',

      }

      def get_ordered_subset():

          """return a list of subset name from dependencies to dependents"""

          _unfinalized = set(subsettable.values())

          ordered = []

          # the subset table is expected to be small so we do the stupid N² version

          # of the algorithm

          while _unfinalized:

              this_level = []

              for candidate in _unfinalized:

                  dependency = subsettable.get(candidate)

                  if dependency not in _unfinalized:

                      this_level.append(candidate)

              if not this_level:

                  msg = "cyclic dependencies in repoview subset %r"

                  msg %= subsettable

                  raise error.ProgrammingError(msg)

              this_level.sort(key=lambda x: x if x is not None else '')

              ordered.extend(this_level)

              _unfinalized.difference_update(this_level)

          return ordered

	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

				# repoviewutil.py - constaints data relevant to repoview.py and other module
				#
				# Copyright 2012 Pierre-Yves David <pierre-yves.david@ens-lyon.org>
				# Logilab SA <contact@logilab.fr>
				#
				# 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 annotations

				from .. import error

				### Nearest subset relation
				# Nearest subset of filter X is a filter Y so that:
				# * Y is included in X,
				# * X - Y is as small as possible.
				# This create and ordering used for branchmap purpose.
				# the ordering may be partial
				subsettable = {
				None: b'visible',
				b'visible-hidden': b'visible',
				b'visible': b'served',
				b'served.hidden': b'served',
				b'served': b'immutable',
				b'immutable': b'base',
				}


				def get_ordered_subset():
				"""return a list of subset name from dependencies to dependents"""
				_unfinalized = set(subsettable.values())
				ordered = []

				# the subset table is expected to be small so we do the stupid N² version
				# of the algorithm
				while _unfinalized:
				this_level = []
				for candidate in _unfinalized:
				dependency = subsettable.get(candidate)
				if dependency not in _unfinalized:
				this_level.append(candidate)

				if not this_level:
				msg = "cyclic dependencies in repoview subset %r"
				msg %= subsettable
				raise error.ProgrammingError(msg)

				this_level.sort(key=lambda x: x if x is not None else '')

				ordered.extend(this_level)
				_unfinalized.difference_update(this_level)

				return ordered