HomeSort by relevance Sort by last modified time
    Searched refs:Stable (Results 1 - 13 of 13) sorted by null

  /prebuilts/go/darwin-x86/src/sort/
sort_test.go 133 Stable(StringSlice(data))
159 Stable(IntSlice(data))
185 Stable(IntSlice(data))
353 testBentleyMcIlroy(t, Stable, func(n int) int { return n * lg(n) * lg(n) / 3 })
406 Stable(IntSlice(data[0:]))
460 Stable(data)
462 t.Errorf("Stable didn't sort %d ints", n)
465 t.Errorf("Stable wasn't stable on %d ints", n)
470 Stable(data
    [all...]
sort.go 190 // data.Less and data.Swap. The sort is not guaranteed to be stable.
286 // Notes on stable sorting:
289 // experimentally to other stable in-place sorting algorithms.
298 // grow as n log n but the algorithm is not stable.
299 // - "Fast Stable In-Place Sorting with O(n) Data Moves" J.I. Munro and
303 // which have to be undone later (so not stable on any input).
312 // Stable sorts data while keeping the original order of equal elements.
316 func Stable(data Interface) {
342 // the SymMerge algorithm from Pok-Son Kim and Arne Kutzner, "Stable Minimum
464 Complexity of Stable Sortin
    [all...]
  /prebuilts/go/linux-x86/src/sort/
sort_test.go 133 Stable(StringSlice(data))
159 Stable(IntSlice(data))
185 Stable(IntSlice(data))
353 testBentleyMcIlroy(t, Stable, func(n int) int { return n * lg(n) * lg(n) / 3 })
406 Stable(IntSlice(data[0:]))
460 Stable(data)
462 t.Errorf("Stable didn't sort %d ints", n)
465 t.Errorf("Stable wasn't stable on %d ints", n)
470 Stable(data
    [all...]
sort.go 190 // data.Less and data.Swap. The sort is not guaranteed to be stable.
286 // Notes on stable sorting:
289 // experimentally to other stable in-place sorting algorithms.
298 // grow as n log n but the algorithm is not stable.
299 // - "Fast Stable In-Place Sorting with O(n) Data Moves" J.I. Munro and
303 // which have to be undone later (so not stable on any input).
312 // Stable sorts data while keeping the original order of equal elements.
316 func Stable(data Interface) {
342 // the SymMerge algorithm from Pok-Son Kim and Arne Kutzner, "Stable Minimum
464 Complexity of Stable Sortin
    [all...]
  /prebuilts/gdb/darwin-x86/lib/python2.7/test/
test_sort.py 66 class Stable(object):
76 return "Stable(%d, %d)" % (self.key, self.index)
119 s = [Stable(random.randrange(10), i) for i in xrange(n)]
121 augmented.sort() # forced stable because ties broken by index
122 x = [e for e, i in augmented] # a stable sort of s
  /prebuilts/gdb/linux-x86/lib/python2.7/test/
test_sort.py 66 class Stable(object):
76 return "Stable(%d, %d)" % (self.key, self.index)
119 s = [Stable(random.randrange(10), i) for i in xrange(n)]
121 augmented.sort() # forced stable because ties broken by index
122 x = [e for e, i in augmented] # a stable sort of s
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_sort.py 66 class Stable(object):
76 return "Stable(%d, %d)" % (self.key, self.index)
119 s = [Stable(random.randrange(10), i) for i in xrange(n)]
121 augmented.sort() # forced stable because ties broken by index
122 x = [e for e, i in augmented] # a stable sort of s
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_sort.py 66 class Stable(object):
76 return "Stable(%d, %d)" % (self.key, self.index)
119 s = [Stable(random.randrange(10), i) for i in xrange(n)]
121 augmented.sort() # forced stable because ties broken by index
122 x = [e for e, i in augmented] # a stable sort of s
  /prebuilts/go/darwin-x86/src/net/
addrselect.go 30 sort.Stable(&byRFC6724{
  /prebuilts/go/linux-x86/src/net/
addrselect.go 30 sort.Stable(&byRFC6724{
  /external/chromium-trace/catapult/third_party/gsutil/gslib/third_party/storage_apitools/
storage_v1_messages.py 321 this channel. Stable across different API versions.
    [all...]
  /external/chromium-trace/catapult/third_party/gsutil/third_party/apitools/samples/storage_sample/storage/
storage_v1_messages.py 309 this channel. Stable across different API versions.
    [all...]
storage_v1.py     [all...]

Completed in 271 milliseconds