comparison tests/test-parseindex.t @ 26061:be8a4e0800d8

reachableroots: use baseset lazy sorting

smartset sorting is lazy (so faster in some case) and better (informs that the
set is sorted allowing some optimisation). So we rely on it directly.

Some test output are updated because we now have more information (ordering).

26060:4ee2af2194d4

  >         print 'uncaught error?'
  >     except TypeError as inst:
  >         print inst
  > EOF
  good heads:
  0: <baseset [0]>
  1: <baseset [0]>
  -1: <baseset []>
  bad heads:
  2: head out of range
  10000: head out of range
  -2: head out of range
  -10000: head out of range
  None: an integer is required
  good roots:
  0: <baseset [0]>
  1: <baseset [1]>
  -1: <baseset [-1]>
  out-of-range roots are ignored:
  2: <baseset []>
  10000: <baseset []>
  -2: <baseset []>
  -10000: <baseset []>
  bad roots:
  None: an integer is required

  $ cd ..

26061:be8a4e0800d8

  >         print 'uncaught error?'
  >     except TypeError as inst:
  >         print inst
  > EOF
  good heads:
  0: <baseset+ [0]>
  1: <baseset+ [0]>
  -1: <baseset+ []>
  bad heads:
  2: head out of range
  10000: head out of range
  -2: head out of range
  -10000: head out of range
  None: an integer is required
  good roots:
  0: <baseset+ [0]>
  1: <baseset+ [1]>
  -1: <baseset+ [-1]>
  out-of-range roots are ignored:
  2: <baseset+ []>
  10000: <baseset+ []>
  -2: <baseset+ []>
  -10000: <baseset+ []>
  bad roots:
  None: an integer is required

  $ cd ..