OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:rank
(Results
51 - 75
of
305
) sorted by null
1
2
3
4
5
6
7
8
9
10
11
>>
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/tr1/
type_traits
357
///
rank
359
struct
rank
363
struct
rank
<_Tp[_Size]>
364
: public integral_constant<std::size_t, 1 +
rank
<_Tp>::value> { };
367
struct
rank
<_Tp[]>
368
: public integral_constant<std::size_t, 1 +
rank
<_Tp>::value> { };
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/tr1/
type_traits
357
///
rank
359
struct
rank
363
struct
rank
<_Tp[_Size]>
364
: public integral_constant<std::size_t, 1 +
rank
<_Tp>::value> { };
367
struct
rank
<_Tp[]>
368
: public integral_constant<std::size_t, 1 +
rank
<_Tp>::value> { };
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/
type_traits
354
///
rank
356
struct
rank
360
struct
rank
<_Tp[_Size]>
361
: public integral_constant<std::size_t, 1 +
rank
<_Tp>::value> { };
364
struct
rank
<_Tp[]>
365
: public integral_constant<std::size_t, 1 +
rank
<_Tp>::value> { };
/external/eigen/Eigen/src/Geometry/
Umeyama.h
143
Index
rank
= 0; for (Index i=0; i<m; ++i) if (!internal::isMuchSmallerThan(d.coeff(i),d.coeff(0))) ++
rank
;
local
144
if (
rank
== m-1) {
/dalvik/vm/compiler/
InlineTransformation.cpp
27
int
rank
= calleeRegId -
local
29
assert(
rank
>= 0);
31
return invoke->arg[
rank
];
33
return invoke->vC +
rank
;
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/
dot.stg
52
{
rank
=same; rankdir=TB; <states; separator="; ">}
/external/chromium/chrome/browser/history/
top_sites_database.cc
149
int
rank
= GetURLRank(url);
local
150
if (
rank
== -1) {
233
LOG(WARNING) << "Updating
rank
of an unknown URL: " << url.url.spec();
262
// Set the url's
rank
.
/external/guava/guava-tests/test/com/google/common/collect/
OrderingTest.java
853
final int
rank
;
855
Composite(T value, int
rank
) {
857
this.
rank
=
rank
;
860
// natural order is by
rank
only; the test will compound() this with the
864
return
rank
< that.
rank
? -1 :
rank
> that.
rank
? 1 : 0;
/packages/apps/QuickSearchBox/src/com/android/quicksearchbox/
Logger.java
50
* {@code suggestionCursor}, ordered by
rank
.
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/tree_policy/
sample_tree_node_update.hpp
66
// Updates the
rank
of a node through a node_iterator node_it; end_nd_it is the end node iterator.
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/trie_policy/
sample_trie_node_update.hpp
66
// Updates the
rank
of a node through a node_iterator node_it; end_nd_it is the end node iterator.
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/tree_policy/
sample_tree_node_update.hpp
66
// Updates the
rank
of a node through a node_iterator node_it; end_nd_it is the end node iterator.
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/trie_policy/
sample_trie_node_update.hpp
66
// Updates the
rank
of a node through a node_iterator node_it; end_nd_it is the end node iterator.
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/detail/tree_policy/
sample_tree_node_update.hpp
66
// Updates the
rank
of a node through a node_iterator node_it; end_nd_it is the end node iterator.
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/detail/trie_policy/
sample_trie_node_update.hpp
66
// Updates the
rank
of a node through a node_iterator node_it; end_nd_it is the end node iterator.
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/tree_policy/
sample_tree_node_update.hpp
66
// Updates the
rank
of a node through a node_iterator node_it; end_nd_it is the end node iterator.
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/trie_policy/
sample_trie_node_update.hpp
66
// Updates the
rank
of a node through a node_iterator node_it; end_nd_it is the end node iterator.
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/tree_policy/
sample_tree_node_update.hpp
66
// Updates the
rank
of a node through a node_iterator node_it; end_nd_it is the end node iterator.
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/trie_policy/
sample_trie_node_update.hpp
66
// Updates the
rank
of a node through a node_iterator node_it; end_nd_it is the end node iterator.
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/tree_policy/
sample_tree_node_update.hpp
66
// Updates the
rank
of a node through a node_iterator node_it; end_nd_it is the end node iterator.
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/trie_policy/
sample_trie_node_update.hpp
66
// Updates the
rank
of a node through a node_iterator node_it; end_nd_it is the end node iterator.
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/tree_policy/
sample_tree_node_update.hpp
66
// Updates the
rank
of a node through a node_iterator node_it; end_nd_it is the end node iterator.
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/trie_policy/
sample_trie_node_update.hpp
66
// Updates the
rank
of a node through a node_iterator node_it; end_nd_it is the end node iterator.
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/tree_policy/
sample_tree_node_update.hpp
66
// Updates the
rank
of a node through a node_iterator node_it; end_nd_it is the end node iterator.
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/trie_policy/
sample_trie_node_update.hpp
66
// Updates the
rank
of a node through a node_iterator node_it; end_nd_it is the end node iterator.
Completed in 1310 milliseconds
1
2
3
4
5
6
7
8
9
10
11
>>