OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:points
(Results
551 - 575
of
7862
) sorted by null
<<
21
22
23
24
25
26
27
28
29
30
>>
/external/curl/docs/libcurl/
curl_multi_fdset.3
43
If the \fIread_fd_set\fP argument is not a null pointer, it
points
to an
47
If the \fIwrite_fd_set\fP argument is not a null pointer, it
points
to an
51
If the \fIexc_fd_set\fP argument is not a null pointer, it
points
to an object
/external/deqp/doc/testspecs/GLES2/
functional.scissors.txt
27
-
Points
41
+ Partially clipped
points
50
listed above.
Points
are tested in a somewhat limited fashion since
/external/deqp/doc/testspecs/GLES31/
functional.vertex_attribute_binding.txt
35
+ Drawing with all attributes sourced from different binding
points
39
- Binding same buffer object to multiple binding
points
53
+ Use of all vertex attribute binding
points
/external/dng_sdk/source/
dng_gain_map.h
54
/// samples (
points
), sample spacing, origin, and number of color planes.
57
const dng_point &
points
,
64
const dng_point &
Points
() const
/external/fonttools/Lib/fontTools/pens/
boundsPen.py
14
bounding box of all control
points
, so may be larger than the
15
actual bounding box if there are curves that don't have
points
56
have
points
on their extremes. This is somewhat slower to compute
/external/icu/icu4c/source/common/
punycode.h
36
* The output will be represented as an array of ASCII code
points
.
42
* This function handles a limited amount of code
points
61
* too many code
points
.
/external/icu/icu4c/source/i18n/
digitaffixesandpadding.h
82
* The field width in code
points
. The format method inserts instances of
84
* the entire formatted string contains this many code
points
. If the
85
* formatted string already exceeds this many code
points
, the format method
esctrn.h
27
* supplemental characters are handled as 32-bit code
points
or as two
28
* 16-bit code units. Most escape forms handle 32-bit code
points
,
71
* If true, supplementals are handled as 32-bit code
points
. If
/external/icu/icu4c/source/layout/
LEFontInstance.cpp
115
void LEFontInstance::unitsToPoints(LEPoint &units, LEPoint &
points
) const
117
points
.fX = xUnitsToPoints(units.fX);
118
points
.fY = yUnitsToPoints(units.fY);
/external/libavc/encoder/
ih264e_cabac_structs.h
100
/*
Points
either to u1_y_ac_csbp_top_mb or u1_y_ac_csbp_bot_mb */
111
/*
Points
either to u1_uv_ac_csbp_top_mb or u1_uv_ac_csbp_bot_mb */
122
/*
Points
either to u1_yuv_dc_csbp_top_mb or u1_yuv_dc_csbp_bot_mb */
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/LinearMath/
btGrahamScan2dConvexHull.h
101
//step 2: sort all
points
, based on 'angle' with this anchor
109
//step 3: keep all 'convex'
points
and discard concave
points
(using back tracking)
/external/libgdx/extensions/gdx-bullet/jni/swig-src/collision/com/badlogic/gdx/physics/bullet/collision/
GIM_TRIANGLE_CONTACT.java
107
public void merge_points(btVector4 plane, float margin, btVector3
points
, int point_count) {
108
CollisionJNI.GIM_TRIANGLE_CONTACT_merge_points(swigCPtr, this, btVector4.getCPtr(plane), plane, margin, btVector3.getCPtr(
points
),
points
, point_count);
/external/mesa3d/src/mesa/math/
m_eval.h
42
*
points
I decided to use the Horner scheme.
44
* A cubic Bezier curve with control
points
b0, b1, b2, b3 can be
74
* for max(uorder,vorder)
points
is needed in the
/external/opencv3/samples/cpp/
kalman.cpp
20
" The real and the estimated
points
are connected with yellow line segment,\n"
21
" the real and the measured
points
are connected with red line segment.\n"
71
// plot
points
/external/opencv3/samples/cpp/tutorial_code/calib3d/real_time_pose_estimation/src/
RobustMatcher.h
50
// return the number of removed
points
60
// Match feature
points
using ratio and symmetry test
65
// Match feature
points
using ratio test
/external/opencv3/samples/python2/
kalman.py
7
The real and the estimated
points
are connected with yellow line segment,
8
the real and the measured
points
are connected with red line segment.
58
# plot
points
/external/skia/gm/
pathcontourstart.cpp
119
SkAutoTArray<SkPoint>
points
(n);
120
path.getPoints(
points
.get(), n);
121
canvas->drawPoints(SkCanvas::kPoints_PointMode, n,
points
.get(), fPointsPaint);
/external/v8/test/mjsunit/
debug-enable-disable-breakpoints.js
32
// Simple debug event handler which just counts the number of break
points
hit.
47
// This tests enabeling and disabling of break
points
including the case
48
// with several break
points
in the same location.
/external/valgrind/memcheck/tests/x86-solaris/
scalar.stderr.exp
16
Syscall param fstatat64(path)
points
to unaddressable byte(s)
20
Syscall param fstatat64(buf)
points
to unaddressable byte(s)
36
Syscall param openat64(filename)
points
to unaddressable byte(s)
55
Syscall param openat64(filename)
points
to unaddressable byte(s)
83
Syscall param getdents64(dirp)
points
to unaddressable byte(s)
120
Syscall param statvfs64(path)
points
to unaddressable byte(s)
124
Syscall param statvfs64(buf)
points
to unaddressable byte(s)
152
Syscall param fstatvfs64(buf)
points
to unaddressable byte(s)
165
Syscall param setrlimit64(rlim)
points
to unaddressable byte(s)
178
Syscall param getrlimit64(rlim)
points
to unaddressable byte(s
[
all
...]
/frameworks/support/compat/java/android/support/v4/view/animation/
PathInterpolatorCompat.java
41
* loop back on itself such that there can be two
points
sharing the same x coordinate.
54
* Create an {@link Interpolator} for a quadratic Bezier curve. The end
points
69
* Create an {@link Interpolator} for a cubic Bezier curve. The end
points
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/typing/
typing_weighting.cpp
51
// Only cases of the code
points
are different.
58
// Base code
points
are the same but the code point is intentionally input.
74
// Base code
points
are the same and the cases are different.
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/
cast.h
43
* 1) has a typedef element_type which names tehe type it
points
to.
63
* pointer equivalent of the address it
points
to, and must have an
64
* element_type typedef which names the type it
points
to.
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/
cast.h
43
* 1) has a typedef element_type which names tehe type it
points
to.
63
* pointer equivalent of the address it
points
to, and must have an
64
* element_type typedef which names the type it
points
to.
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/
cast.h
43
* 1) has a typedef element_type which names tehe type it
points
to.
63
* pointer equivalent of the address it
points
to, and must have an
64
* element_type typedef which names the type it
points
to.
/prebuilts/misc/darwin-x86_64/sdl2/include/SDL2/
SDL_rect.h
111
* \brief Calculate a minimal rectangle enclosing a set of
points
113
* \return SDL_TRUE if any
points
were within the clipping rect
115
extern DECLSPEC SDL_bool SDLCALL SDL_EnclosePoints(const SDL_Point *
points
,
Completed in 2175 milliseconds
<<
21
22
23
24
25
26
27
28
29
30
>>