/external/srtp/include/ |
srtp.h | 172 * @brief points to an EKT policy 178 * @brief points to EKT stream data 237 * @brief An srtp_t points to an SRTP session structure. 253 * @brief An srtp_stream_t points to an SRTP stream structure. 285 * points to the resulting SRTP packet and *len_ptr is the number of 301 * the function returns, it points to the srtp packet. 306 * Otherwise, the value of the data to which it points is undefined. 324 * err_status_ok is returned, then srtp_hdr points to the resulting 340 * (before the call). after the function returns, it points to the 342 * the data to which it points is undefined [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
stl_multimap.h | 309 * Returns a read/write iterator that points to the first pair in the 318 * Returns a read-only (constant) iterator that points to the first pair 327 * Returns a read/write iterator that points one past the last pair in 336 * Returns a read-only (constant) iterator that points one past the last 345 * Returns a read/write reverse iterator that points to the last pair in 354 * Returns a read-only (constant) reverse iterator that points to the 363 * Returns a read/write reverse iterator that points to one before the 372 * Returns a read-only (constant) reverse iterator that points to one 382 * Returns a read-only (constant) iterator that points to the first pair 391 * Returns a read-only (constant) iterator that points one past the las [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
stl_multimap.h | 309 * Returns a read/write iterator that points to the first pair in the 318 * Returns a read-only (constant) iterator that points to the first pair 327 * Returns a read/write iterator that points one past the last pair in 336 * Returns a read-only (constant) iterator that points one past the last 345 * Returns a read/write reverse iterator that points to the last pair in 354 * Returns a read-only (constant) reverse iterator that points to the 363 * Returns a read/write reverse iterator that points to one before the 372 * Returns a read-only (constant) reverse iterator that points to one 382 * Returns a read-only (constant) iterator that points to the first pair 391 * Returns a read-only (constant) iterator that points one past the las [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
stl_multimap.h | 309 * Returns a read/write iterator that points to the first pair in the 318 * Returns a read-only (constant) iterator that points to the first pair 327 * Returns a read/write iterator that points one past the last pair in 336 * Returns a read-only (constant) iterator that points one past the last 345 * Returns a read/write reverse iterator that points to the last pair in 354 * Returns a read-only (constant) reverse iterator that points to the 363 * Returns a read/write reverse iterator that points to one before the 372 * Returns a read-only (constant) reverse iterator that points to one 382 * Returns a read-only (constant) iterator that points to the first pair 391 * Returns a read-only (constant) iterator that points one past the las [all...] |
/prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
stl_multimap.h | 345 * Returns a read/write iterator that points to the first pair in the 354 * Returns a read-only (constant) iterator that points to the first pair 363 * Returns a read/write iterator that points one past the last pair in 372 * Returns a read-only (constant) iterator that points one past the last 381 * Returns a read/write reverse iterator that points to the last pair in 390 * Returns a read-only (constant) reverse iterator that points to the 399 * Returns a read/write reverse iterator that points to one before the 408 * Returns a read-only (constant) reverse iterator that points to one 418 * Returns a read-only (constant) iterator that points to the first pair 427 * Returns a read-only (constant) iterator that points one past the las [all...] |
/external/freetype/src/base/ |
ftstroke.c | 306 FT_Vector* points; member in struct:FT_StrokeBorderRec_ 334 if ( FT_RENEW_ARRAY( border->points, old_max, cur_max ) || 364 border->points[start] = border->points[count]; 368 /* reverse the points */ 370 FT_Vector* vec1 = border->points + start + 1; 371 FT_Vector* vec2 = border->points + count - 1; 425 border->points[border->num_points - 1] = *to; 431 FT_IS_SMALL( border->points[border->num_points - 1].x - to->x ) && 432 FT_IS_SMALL( border->points[border->num_points - 1].y - to->y ) [all...] |
/external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/ |
Collision.java | 40 * Functions used for computing contact points, distance queries, and TOI queries. Collision methods 109 ContactID id = manifold1.points[i].id; 114 if (manifold2.points[j].id.isEqual(id)) { 123 ContactID id = manifold2.points[i].id; 128 if (manifold1.points[j].id.isEqual(id)) { 148 // Start with no output points 155 // Calculate the distance of end points to the line 159 // If the points are behind the plane 167 // If the points are on different sides of the plane 233 manifold.points[0].localPoint.set(circle2p) [all...] |
/external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/base/ |
ftstroke.c | 316 FT_Vector* points; member in struct:FT_StrokeBorderRec_ 344 if ( FT_RENEW_ARRAY( border->points, old_max, cur_max ) || 374 border->points[start] = border->points[count]; 378 /* reverse the points */ 380 FT_Vector* vec1 = border->points + start + 1; 381 FT_Vector* vec2 = border->points + count - 1; 435 border->points[border->num_points - 1] = *to; 441 FT_IS_SMALL( border->points[border->num_points - 1].x - to->x ) && 442 FT_IS_SMALL( border->points[border->num_points - 1].y - to->y ) [all...] |
/external/pdfium/third_party/freetype/src/base/ |
ftstroke.c | 316 FT_Vector* points; member in struct:FT_StrokeBorderRec_ 344 if ( FT_RENEW_ARRAY( border->points, old_max, cur_max ) || 374 border->points[start] = border->points[count]; 378 /* reverse the points */ 380 FT_Vector* vec1 = border->points + start + 1; 381 FT_Vector* vec2 = border->points + count - 1; 435 border->points[border->num_points - 1] = *to; 441 FT_IS_SMALL( border->points[border->num_points - 1].x - to->x ) && 442 FT_IS_SMALL( border->points[border->num_points - 1].y - to->y ) [all...] |
/external/chromium-trace/catapult/dashboard/dashboard/ |
find_anomalies.py | 8 points in a Test for potential regressions or improvements, and creates 24 # Number of points to fetch and pass to FindChangePoints. A different number 41 # In some cases (e.g. if some points are deleted) it might be possible 93 max_num_rows: The maximum number of points to get. 104 # to get the newest points. 190 True if there is a match found among the ref build series change points.
|
/external/icu/android_icu4j/src/main/java/android/icu/impl/ |
CharTrie.java | 51 * or the leadUnitValue for lead surrogate code points. 54 * @param initialValue the initial value that is set for all code points 134 * Gets the value to the data which this lead surrogate character points 149 * Lead surrogate code points are treated as normal code points, with 247 * Gets the offset to the data which the surrogate pair points to.
|
IntTrie.java | 55 * or the leadUnitValue for lead surrogate code points. 58 * @param initialValue the initial value that is set for all code points 135 * Gets the value to the data which this lead surrogate character points 150 * Lead surrogate code points are treated as normal code points, with 260 * Gets the offset to the data which the surrogate pair points to.
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
CharTrie.java | 50 * or the leadUnitValue for lead surrogate code points. 53 * @param initialValue the initial value that is set for all code points 133 * Gets the value to the data which this lead surrogate character points 148 * Lead surrogate code points are treated as normal code points, with 246 * Gets the offset to the data which the surrogate pair points to.
|
IntTrie.java | 54 * or the leadUnitValue for lead surrogate code points. 57 * @param initialValue the initial value that is set for all code points 134 * Gets the value to the data which this lead surrogate character points 149 * Lead surrogate code points are treated as normal code points, with 259 * Gets the offset to the data which the surrogate pair points to.
|
/external/opencv/cv/include/ |
cv.h | 362 Returns the number of retrieved points. */ 449 The reader is used to iteratively get coordinates of all the chain points. 486 Calculates optical flow between two images for certain set of points (i.e. 650 /* Calculates Voronoi tesselation (i.e. coordinates of Voronoi points) */ 654 /* Removes all Voronoi points from the tesselation */ 723 /* Finds high-curvature points of the contour */ 739 CVAPI(CvRect) cvBoundingRect( CvArr* points, int update CV_DEFAULT(0) ); 745 /* Finds minimum area rotated rectangle bounding a set of points */ 746 CVAPI(CvBox2D) cvMinAreaRect2( const CvArr* points, 749 /* Finds minimum enclosing circle for a set of points */ 798 CVAPI(CvBox2D) cvFitEllipse2( const CvArr* points ); variable [all...] |
/external/opencv3/modules/calib3d/src/ |
circlesgrid.hpp | 65 void findGrid(const std::vector<cv::Point2f> &points, cv::Size patternSize, std::vector<cv::Point2f>& centers); 67 //cluster 2d points by geometric coordinates 68 void hierarchicalClustering(const std::vector<cv::Point2f> &points, const cv::Size &patternSize, std::vector<cv::Point2f> &patternPoints); 172 float computeGraphConfidence(const std::vector<Graph> &basisGraphs, bool addRow, const std::vector<size_t> &points, 177 void addPoint(cv::Point2f pt, std::vector<size_t> &points); 199 void getCornerSegments(const std::vector<std::vector<size_t> > &points, std::vector<std::vector<Segment> > &segments,
|
/external/opencv3/modules/videostab/include/opencv2/videostab/ |
global_motion.hpp | 71 @param points0 Source set of 2D points (32F). 72 @param points1 Destination set of 2D points (32F). 83 @param points0 Source set of 2D points (32F). 84 @param points1 Destination set of 2D points (32F). 115 @param points0 Source set of 2D points (32F). 116 @param points1 Destination set of 2D points (32F).
|
/external/opencv3/samples/cpp/ |
points_classifier.cpp | 18 const string winName = "points"; 61 // draw points 270 // classify coordinate plane points using the bayes classifier, i.e. 303 cv::namedWindow( "points", 1 ); 307 imshow( "points", img ); 308 setMouseCallback( "points", on_mouse );
|
/frameworks/base/core/java/android/hardware/camera2/params/ |
TonemapCurve.java | 37 * <p>The total number of points {@code (Pin, Pout)} for each color channel can be no more than 81 * <p>Values are stored as a contiguous array of {@code (Pin, Pout)} points.</p> 157 * Get the number of points stored in this tonemap curve for the specified color channel. 160 * @return number of points stored in this tonemap for that color's curve (>= 0) 207 * Values are stored as packed {@code (Pin, Pout}) points, and there are a total of 208 * {@link #getPointCount} points for that respective channel.</p>
|
/frameworks/rs/scriptc/ |
rs_vector_math.rsh | 63 * distance: Distance between two points 65 * Compute the distance between two points. 139 * fast_distance: Approximate distance between two points 141 * Computes the approximate distance between two points. 271 * native_distance: Approximate distance between two points 273 * Computes the approximate distance between two points.
|
/packages/apps/Camera2/src/com/android/camera/processing/imagebackend/ |
TaskImageContainer.java | 214 * Returns a crop rectangle whose points are a strict subset of the points 220 * be set of all points. 230 * Returns a crop rectangle whose points are a strict subset of the points 238 * be set of all points.
|
/packages/apps/Launcher3/src/com/android/launcher3/ |
InvariantDeviceProfile.java | 248 final float width, final float height, ArrayList<InvariantDeviceProfile> points) { 251 ArrayList<InvariantDeviceProfile> pointsByNearness = points; 264 ArrayList<InvariantDeviceProfile> points) { 267 InvariantDeviceProfile p = points.get(0); 273 for (int i = 0; i < points.size() && i < KNEARESTNEIGHBOR; ++i) { 274 p = new InvariantDeviceProfile(points.get(i));
|
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/internal/ |
GestureTrailDrawingPoints.java | 30 * This class holds drawing points to represent a gesture trail. The gesture trail may contain 33 * On the other hand, {@link GestureStrokeDrawingPoints} class holds drawing points of each gesture 34 * stroke. This class holds drawing points of those gesture strokes to draw as a gesture trail. 35 * Drawing points in this class will be asynchronously removed when fading out animation goes. 87 // the interpolated points in the last segment of gesture stroke, it may need recalculation 181 // Skip too old trail points.
|
/prebuilts/sdk/renderscript/include/ |
rs_vector_math.rsh | 63 * distance: Distance between two points 65 * Compute the distance between two points. 139 * fast_distance: Approximate distance between two points 141 * Computes the approximate distance between two points. 271 * native_distance: Approximate distance between two points 273 * Computes the approximate distance between two points.
|
/external/icu/icu4c/source/tools/gensprep/ |
filterRFC3454.pl | 167 print $outFH "\n# Total code points $count\n\n"; 220 $comment = "# This table contains code points from Table A.1 from RFC 3454\n"; 229 $comment = "# This table contains code points from Table B.1 from RFC 3454\n"; 238 $comment = $warning."# This table contains code points from Table B.2 from RFC 3454\n"; 247 $comment = $warning."# This table contains code points from Table B.3 from RFC 3454\n"; 256 $comment = "# code points from $line"; 278 print $outFH "\n# Total code points 30\n"; 297 print $outFH "\n# Total code points 8\n"; 354 print $outFH "\n# Total code points 43\n"; 367 # points are mapped to nothing. COMBINING GRAPHEME JOINER (U+034F) an [all...] |