OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Stable
(Results
1 - 10
of
10
) sorted by null
/libcore/ojluni/src/main/java/java/lang/invoke/
Stable.java
31
* A field may be annotated as
stable
if all of its component variables
38
* as
stable
is called a
stable
variable, and its non-null or non-zero
39
* value is called a
stable
value.
47
* then the value indicated as
stable
is simply the value of the field.
49
* is not, the components of the array are <em>not</em> regarded as
stable
.
53
* are indicated to be
stable
.
56
* is regarded as a
stable
array of rank {@code N-1}.
58
* Fields which are declared {@code final} may also be annotated as
stable
.
59
* Since final fields already behave as
stable
values, such an annotatio
[
all
...]
/external/python/cpython3/Lib/test/
test_sort.py
67
class
Stable
(object):
76
return "
Stable
(%d, %d)" % (self.key, self.index)
125
s = [
Stable
(random.randrange(10), i) for i in range(n)]
127
augmented.sort() # forced
stable
because ties broken by index
128
x = [e for e, i in augmented] # a
stable
sort of s
/prebuilts/go/darwin-x86/src/sort/
sort.go
215
// data.Less and data.Swap. The sort is not guaranteed to be
stable
.
326
// Notes on
stable
sorting:
329
// experimentally to other
stable
in-place sorting algorithms.
338
// grow as n log n but the algorithm is not
stable
.
339
// - "Fast
Stable
In-Place Sorting with O(n) Data Moves" J.I. Munro and
343
// which have to be undone later (so not
stable
on any input).
352
//
Stable
sorts data while keeping the original order of equal elements.
356
func
Stable
(data Interface) {
357
stable
(data, data.Len())
360
func
stable
(data Interface, n int)
func
[
all
...]
/prebuilts/go/linux-x86/src/sort/
sort.go
215
// data.Less and data.Swap. The sort is not guaranteed to be
stable
.
326
// Notes on
stable
sorting:
329
// experimentally to other
stable
in-place sorting algorithms.
338
// grow as n log n but the algorithm is not
stable
.
339
// - "Fast
Stable
In-Place Sorting with O(n) Data Moves" J.I. Munro and
343
// which have to be undone later (so not
stable
on any input).
352
//
Stable
sorts data while keeping the original order of equal elements.
356
func
Stable
(data Interface) {
357
stable
(data, data.Len())
360
func
stable
(data Interface, n int)
func
[
all
...]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/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
/external/python/cpython2/Lib/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/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
Completed in 325 milliseconds