OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:adjacent
(Results
201 - 225
of
948
) sorted by null
1
2
3
4
5
6
7
8
9
10
11
>>
/external/stlport/test/eh/
test_algo.cpp
115
// Check that
adjacent
items with the same value haven't been
/frameworks/av/drm/libdrmframework/plugins/forward-lock/internal-format/converter/
FwdLockConv.h
27
* The size of the data and header signatures combined. The signatures are
adjacent
to each other in
/frameworks/av/include/media/nbaio/
NBLog.h
191
static const size_t kSquashTimestamp = 5; // squash this many or more
adjacent
timestamps
/frameworks/base/core/java/android/text/
Spanned.java
32
* MARK and POINT are conceptually located <i>between</i> two
adjacent
characters.
/frameworks/base/packages/Keyguard/res/values/
attrs.xml
66
<!-- The space between
adjacent
pages of the PagedView. -->
/hardware/qcom/msm8960/original-kernel-headers/linux/
msm_ion.h
161
* @adjacent_mem_id: Id of heap that this heap must be
adjacent
to.
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/algorithm/string/
finder.hpp
205
If "compress token mode" is enabled,
adjacent
matching tokens are
/packages/apps/Launcher2/res/values/
attrs.xml
107
<!-- The space between
adjacent
pages of the PagedView. -->
/packages/apps/UnifiedEmail/src/com/android/mail/browse/
ConversationPagerController.java
80
*
adjacent
conversations.
/packages/apps/UnifiedEmail/src/com/android/mail/ui/
ConversationPositionTracker.java
188
// this to ensure the
adjacent
conversation information is loaded for calls to
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/
stl_tempbuf.h
74
* This function tries to obtain storage for @c len
adjacent
Tp
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/
stl_tempbuf.h
74
* This function tries to obtain storage for @c len
adjacent
Tp
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
stl_tempbuf.h
74
* This function tries to obtain storage for @c len
adjacent
Tp
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
stl_tempbuf.h
75
* This function tries to obtain storage for @c __len
adjacent
Tp
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
stl_tempbuf.h
74
* This function tries to obtain storage for @c len
adjacent
Tp
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
stl_tempbuf.h
75
* This function tries to obtain storage for @c __len
adjacent
Tp
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/
stl_tempbuf.h
73
* This function tries to obtain storage for @c __len
adjacent
Tp
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/
for_each_selectors.h
265
/** @brief Selector that returns the difference between two
adjacent
/external/chromium_org/courgette/
adjustment_method.cc
52
// we can quickly find Labels
adjacent
in address order.
101
//
adjacent
labels will have the same RVA difference.
329
// Now consider unassigned
adjacent
addresses
/external/chromium_org/third_party/icu/source/i18n/
ucol_wgt.cpp
242
/* lower and upper ranges collide or are directly
adjacent
: merge these two and remove all shorter ranges */
246
* merging directly
adjacent
ranges needs to subtract the 0/1 gaps in between;
420
* from merging
adjacent
ranges;
/external/chromium_org/third_party/mesa/src/src/gallium/winsys/radeon/drm/
radeon_drm_bo.c
328
/* Grow upper hole if it's
adjacent
*/
332
/* Merge lower hole if it's
adjacent
*/
343
/* Grow lower hole if it's
adjacent
*/
/external/icu4c/i18n/
ucol_wgt.cpp
255
/* lower and upper ranges collide or are directly
adjacent
: merge these two and remove all shorter ranges */
259
* merging directly
adjacent
ranges needs to subtract the 0/1 gaps in between;
433
* from merging
adjacent
ranges;
/external/mesa3d/src/gallium/winsys/radeon/drm/
radeon_drm_bo.c
328
/* Grow upper hole if it's
adjacent
*/
332
/* Merge lower hole if it's
adjacent
*/
343
/* Grow lower hole if it's
adjacent
*/
/external/chromium_org/third_party/WebKit/Source/core/rendering/
RenderTableCell.cpp
559
// Next, apply the start border of the enclosing colgroup but only if it is
adjacent
to the cell's edge.
582
// but only if it is
adjacent
to the cell's edge.
662
// Next, if it has a parent colgroup then we apply its end border but only if it is
adjacent
to the cell.
675
// This case is a colgroup without any col, we only compute it if it is
adjacent
to the cell's edge.
684
// If we have a parent colgroup, resolve the border only if it is
adjacent
to the cell.
[
all
...]
/dalvik/vm/analysis/
RegisterMap.cpp
95
* Histogram of the number of bits that differ between
adjacent
entries.
1102
Each entry consists of an address and a bit vector.
Adjacent
entries are
1106
Ideally we would avoid outputting
adjacent
entries with identical
[
all
...]
Completed in 2679 milliseconds
1
2
3
4
5
6
7
8
9
10
11
>>