HomeSort by relevance Sort by last modified time
    Searched full:lines (Results 801 - 825 of 5102) sorted by null

<<31323334353637383940>>

  /external/libvpx/libvpx/test/
intrapred_test.cc 111 // check that all subsequent lines are equal to the first
125 // check that all lines equal the top border
254 // We use 17 lines so we have one line above us for top-prediction.
336 // We use 9 lines so we have one line above us for top-prediction.
357 // We use 9 lines so we have one line above us for top-prediction.
  /external/opencv/cvaux/src/
cvcorrespond.cpp 324 icvDynamicCorrespondMulti( int lines, /* number of scanlines */
340 if( (lines < 1) ||
351 for( n = 0; n < lines; n++ )
387 cvDynamicCorrespondMulti( int lines, /* number of scanlines */
396 IPPI_CALL( icvDynamicCorrespondMulti( lines, /* number of scanlines */
  /external/toybox/toys/posix/
grep.c 1 /* grep.c - print lines what match given regular expression
17 Show lines matching regular expressions. If no -e, first argument is
26 -i case insensitive -m stop after this many lines matched
32 -c count of matching lines -l show matching filenames
198 // Add all -f lines to -e list. (Yes, this is leaking allocation context for
  /external/v8/tools/push-to-trunk/
git_recipes.py 57 # Extract the lines in the footer block.
58 lines = []
62 del(lines[:])
64 lines.append(line)
67 for line in lines:
  /frameworks/av/services/camera/libcameraservice/device3/
Camera3OutputStream.cpp 230 String8 lines; local
231 lines.appendFormat(" Stream[%d]: Output\n", mId);
232 lines.appendFormat(" Consumer name: %s\n", mConsumerName.string());
233 write(fd, lines.string(), lines.size());
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/test/
intrapred_test.cc 111 // check that all subsequent lines are equal to the first
125 // check that all lines equal the top border
254 // We use 17 lines so we have one line above us for top-prediction.
336 // We use 9 lines so we have one line above us for top-prediction.
357 // We use 9 lines so we have one line above us for top-prediction.