mercurial/revlogutils/deltas.py

51351:bbbfa00d1e67

        # Why search for delta base if we cannot use a delta base ?
        # also see issue6056
        assert self.revlog.delta_config.general_delta
        self._candidates_iterator = self._refined_groups()
        self._last_good = None
        self._next_internal_group()

    def _next_internal_group(self):
        # self._internal_group can be larger than self.current_group
        self._internal_idx = 0
        group = self._candidates_iterator.send(self._last_good)

    def next_group(self, good_delta=None):
        old_good = self._last_good
        if good_delta is not None:
            self._last_good = good_delta.base
        if (self._internal_idx < len(self._internal_group)) and (
            old_good != good_delta
        ):
            # When the size of the candidate group is big, it can result in
            # a quite significant performance impact. To reduce this, we

        return True

    def _refined_groups(self):
        good = None
        # First we try to reuse a the delta contained in the bundle.  (or from
        # the source revlog)
        #
        # This logic only applies to general delta repositories and can be
        # disabled through configuration. Disabling reuse source delta is
        # useful when we want to make sure we recomputed "optimal" deltas.
        if (
            self.cachedelta is not None
            and self.cachedelta[2] > DELTA_BASE_REUSE_NO
        ):
            # Assume what we received from the server is a good choice
            # build delta will reuse the cache
            self.current_stage = _STAGE_CACHED
            good = yield (self.cachedelta[0],)
            if good is not None:
                yield None
                return
        groups = self._raw_groups()
        for candidates in groups:
            good = yield candidates
            if good is not None:
                break

51352:7083b33a2699

        # Why search for delta base if we cannot use a delta base ?
        # also see issue6056
        assert self.revlog.delta_config.general_delta
        self._candidates_iterator = self._refined_groups()
        self._last_good = None
        if (
            self.cachedelta is not None
            and self.cachedelta[2] > DELTA_BASE_REUSE_NO
            and self._pre_filter_rev(self.cachedelta[0])
        ):
            # First we try to reuse a the delta contained in the bundle.  (or from
            # the source revlog)
            #
            # This logic only applies to general delta repositories and can be
            # disabled through configuration. Disabling reuse source delta is
            # useful when we want to make sure we recomputed "optimal" deltas.
            self.current_stage = _STAGE_CACHED
            self._internal_group = (self.cachedelta[0],)
            self._internal_idx = 0
            self.current_group = self._internal_group
            self.tested.update(self.current_group)
        else:
            self._next_internal_group()

    def _next_internal_group(self):
        # self._internal_group can be larger than self.current_group
        self._internal_idx = 0
        group = self._candidates_iterator.send(self._last_good)

    def next_group(self, good_delta=None):
        old_good = self._last_good
        if good_delta is not None:
            self._last_good = good_delta.base
        if self.current_stage == _STAGE_CACHED and good_delta is not None:
            # the cache is good, let us use the cache as requested
            self._candidates_iterator = None
            self._internal_group = None
            self._internal_idx = None
            self.current_group = None
            return

        if (self._internal_idx < len(self._internal_group)) and (
            old_good != good_delta
        ):
            # When the size of the candidate group is big, it can result in
            # a quite significant performance impact. To reduce this, we

        return True

    def _refined_groups(self):
        good = None
        groups = self._raw_groups()
        for candidates in groups:
            good = yield candidates
            if good is not None:
                break