RhodeCode

            } else {

              _right.set(_parent[arc], e);

            }

          }

          splay(s);

        } else {

          _right.set(e, _right[arc]);

          _parent.set(_right[arc], e);

          if (_parent[arc] != INVALID) {

            if (_left[_parent[arc]] == arc) {

              _left.set(_parent[arc], e);

            } else {

              _right.set(_parent[arc], e);

            }

          } else {

    /// <em>d</em> is the number of outgoing arcs of \c s.

    ///\param s The source node

    ///\param t The target node

    ///\return An arc from \c s to \c t if there exists,

    ///\ref INVALID otherwise.

    Arc operator()(Node s, Node t) const

    {

      Arc a = _head[s];

      while (true) {

        if (_g.target(a) == t) {

          const_cast<DynArcLookUp&>(*this).splay(a);

          return a;

        } else if (t < _g.target(a)) {

          if (_left[a] == INVALID) {

            const_cast<DynArcLookUp&>(*this).splay(a);

            return INVALID;

    /// outgoing arcs of \c s.

    ///\param s The source node

    ///\param t The target node

    ///\return An arc from \c s to \c t if there exists, \ref INVALID

    /// otherwise.

    Arc findFirst(Node s, Node t) const

    {

      Arc a = _head[s];

      Arc r = INVALID;

      while (true) {

        if (_g.target(a) < t) {

          if (_right[a] == INVALID) {

            const_cast<DynArcLookUp&>(*this).splay(a);

            return r;

          } else {

            a = _right[a];