/external/mesa3d/src/gallium/auxiliary/gallivm/ |
lp_bld_sample_soa.c | 694 LLVMValueRef neighbors[2][2][4]; local 759 data_ptr, neighbors[0][0]); 764 data_ptr, neighbors[0][1]); 770 neighbors[0][0][chan], 771 neighbors[0][1][chan]); 783 data_ptr, neighbors[1][0]); 788 data_ptr, neighbors[1][1]); 794 neighbors[0][0][chan], 795 neighbors[0][1][chan], 796 neighbors[1][0][chan] [all...] |
/external/jpeg/ |
jcsample.c | 43 * eight neighbors. P's weight is 1-8*SF and each neighbor's weight is SF, 315 * eight edge-adjacent neighbors contribute SF to each of two smoothed 355 /* The edge-neighbors count twice as much as corner-neighbors */ 357 /* Add in the corner-neighbors */
|
/external/qemu/distrib/jpeg-6b/ |
jcsample.c | 43 * eight neighbors. P's weight is 1-8*SF and each neighbor's weight is SF, 315 * eight edge-adjacent neighbors contribute SF to each of two smoothed 355 /* The edge-neighbors count twice as much as corner-neighbors */ 357 /* Add in the corner-neighbors */
|
/external/chromium_org/third_party/mesa/src/src/mesa/program/ |
register_allocate.c | 39 * register regardless of what its neighbors choose, so that node is 45 * their neighbors. Because they were pushed on the stack only when 425 /* Check if any of our neighbors conflict with this register choice. */
|
/external/mesa3d/src/mesa/program/ |
register_allocate.c | 39 * register regardless of what its neighbors choose, so that node is 45 * their neighbors. Because they were pushed on the stack only when 425 /* Check if any of our neighbors conflict with this register choice. */
|
/external/opencv/cv/src/ |
_cvkdtree.hpp | 301 struct bbf_nn { // info on found neighbors (approx k nearest) 381 // finds (with high probability) the k nearest neighbors of d, 383 // ret_nn_pq is an array containing the (at most) k nearest neighbors
|
cvhaar.cpp | [all...] |
/external/libvpx/libvpx/vp9/common/ |
vp9_mvref_common.c | 228 // Check the rest of the neighbors in much the same way 258 // go back through the neighbors and find motion vectors from
|
vp9_entropy.h | 83 are decoded, e.g., prior to the first token, a zero means that my neighbors
|
/external/ceres-solver/internal/ceres/ |
visibility_based_preconditioner.cc | 485 const HashSet<int>& neighbors = forest.Neighbors(cluster1); local 486 for (HashSet<int>::const_iterator it2 = neighbors.begin(); 487 it2 != neighbors.end();
|
/external/tremolo/Tremolo/ |
floor1.c | 172 /* discover our neighbors for decode where we don't use fit flags 173 (that would push the neighbors outward) */
|
/external/chromium/base/synchronization/ |
condition_variable_win.cc | 241 // Stitch neighbors together. 271 // Make sure both of our neighbors have links that point back to us. 273 // do a local check to (and returning from) our immediate neighbors.
|
/external/chromium_org/base/synchronization/ |
condition_variable_win.cc | 434 // Stitch neighbors together. 464 // Make sure both of our neighbors have links that point back to us. 466 // do a local check to (and returning from) our immediate neighbors.
|
/packages/apps/Gallery2/src/com/android/gallery3d/ui/ |
PhotoView.java | [all...] |
/external/chromium_org/third_party/WebKit/Source/core/animation/ |
KeyframeAnimationEffect.cpp | 284 // - Interior keyframes with the same offset as both their neighbors
|
/external/chromium_org/third_party/skia/src/core/ |
SkBitmapHeap.h | 270 * recent. Points the LookupEntry's old neighbors at each other, and sets fLeastRecentlyUsed
|
/external/opencv/cv/include/ |
cvtypes.h | 378 int neighbors; member in struct:CvAvgComp
|
/external/skia/src/core/ |
SkBitmapHeap.h | 270 * recent. Points the LookupEntry's old neighbors at each other, and sets fLeastRecentlyUsed
|
/packages/apps/LegacyCamera/jni/feature_mos/src/mosaic/ |
Blend.cpp | 839 // project point and then triangulate to neighbors 849 // scan the neighbors to see if this is a valid position 923 // project point and then triangulate to neighbors [all...] |
/packages/apps/Settings/src/com/android/settings/widget/ |
ChartSweepView.java | 159 public void setNeighbors(ChartSweepView... neighbors) { 160 mNeighbors = neighbors;
|
/external/jmonkeyengine/engine/src/tools/jme3tools/converters/model/strip/ |
Stripifier.java | 387 //first time, find a face with few neighbors (look for an edge
634 // Returns the number of neighbors that this face has
[all...] |
/external/libvorbis/lib/ |
floor1.c | 212 course, the neighbors can change (if a position is declined), but 246 /* discover our neighbors for decode where we don't use fit flags 247 (that would push the neighbors outward) */
|
/external/opencv/ml/include/ |
ml.h | 274 // k Nearest Neighbors 290 const float** neighbors=0, CvMat* neighbor_responses=0, CvMat* dist=0 ) const; 305 float* neighbor_responses, const float** neighbors, float* dist ) const; [all...] |
/external/chromium_org/third_party/skia/src/pdf/ |
SkPDFImage.cpp | 390 // transparent pixels with their surrounding neighbors
|
/external/libvpx/libvpx/examples/includes/geshi/geshi/ |
scilab.php | 157 'nansum', 'narsimul', 'NDcost', 'ndgrid', 'ndims', 'nearfloat', 'nehari', 'neighbors', 'netclose', 'netwindow',
|