HomeSort by relevance Sort by last modified time
    Searched refs:holes (Results 1 - 25 of 37) sorted by null

1 2

  /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/layout/gle2/
IncludeOverlayTest.java 43 private void checkSubtract(Rectangle rectangle, List<Rectangle> holes) {
44 Collection<Rectangle> result = IncludeOverlay.subtractRectangles(rectangle, holes);
47 // are within one of the holes then they are not in the result list and vice versa
54 for (Rectangle hole : holes) {
70 + " and holes=" + holes + " where inHole=inResult="
  /external/ltp/utils/ffsb-6.0-rc2/
filelist.c 92 b->holes = ffsb_malloc(sizeof(struct cirlist));
94 init_cirlist(b->holes);
112 while (!cl_empty(bf->holes)) {
113 struct ffsb_file *cur = cl_remove_head(bf->holes);
116 free(bf->holes);
138 /* First check "holes" for a file */
139 if (!cl_empty(b->holes)) {
140 oldfile = cl_remove_head(b->holes);
193 /* First check "holes" for a file */
280 /* add node to the cir. list of "holes" */
    [all...]
filelist.h 61 struct cirlist *holes; member in struct:benchfiles
66 uint32_t listsize; /* Sum size of nodes in files and holes */
80 * It first checks the "holes" list for any available filenames.
95 * put into holes list.
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/
IncludeOverlay.java 59 // to leave holes in the mask.
94 * Given a Rectangle, remove holes from it (specified as a collection of Rectangles) such
98 * @param holes the holes to subtract from the rectangle
99 * @return a list of sub rectangles that remain after subtracting out the given list of holes
103 Rectangle rectangle, Collection<Rectangle> holes) {
107 for (Rectangle hole : holes) {
  /system/update_engine/sample_images/
generate_images.sh 59 # sparse_empty: Files with no data blocks at all (only sparse holes).
63 # sparse: Files with some data blocks but also sparse holes.
78 sudo truncate --size=16384 "${mntdir}"/sparse-16k-holes
79 echo "a" | sudo dd of="${mntdir}"/sparse-16k-holes bs=1 seek=100 status=none
80 echo "b" | sudo dd of="${mntdir}"/sparse-16k-holes bs=1 seek=10000 status=none
  /packages/apps/Launcher3/tests/src/com/android/launcher3/model/
AddWorkspaceItemsTaskTest.java 74 // Second screen has 2 holes of sizes 3x2 and 2x3
93 // First screen has 2 holes of sizes 3x2 and 2x3
143 private int setupWorkspaceWithHoles(int startId, long screenId, Rect... holes) {
146 for (Rect r : holes) {
  /prebuilts/go/darwin-x86/doc/play/
solitaire.go 15 // ? are pegs, and ? are holes.
  /prebuilts/go/darwin-x86/test/
solitaire.go 20 // represent illegal fields, ? are pegs, and ? are holes.
  /prebuilts/go/linux-x86/doc/play/
solitaire.go 15 // ? are pegs, and ? are holes.
  /prebuilts/go/linux-x86/test/
solitaire.go 20 // represent illegal fields, ? are pegs, and ? are holes.
  /external/v8/src/runtime/
runtime-array.cc 176 // For holey elements, take samples from the buffer checking for holes
183 int holes = 0; local
186 ++holes;
189 int estimate = static_cast<int>((kNumberOfHoleCheckSamples - holes) /
  /external/v8/src/js/
array.js 98 var elements_threshold = length >> 2; // No more than 75% holes
846 // to obj itself, if obj has holes. Return one more than the maximal index
902 // Copy defined elements from the end to fill in all holes and undefineds
903 // in the beginning of the array. Write undefineds and holes at the end
914 // Maintain the invariant num_holes = the number of holes in the original
939 // Fill in the undefineds and the holes. There may be a hole where
979 // Move array holes and undefineds to the end using a Javascript function
    [all...]
  /external/v8/src/
objects-debug.cc 1313 int holes = 0; local
    [all...]
  /external/v8/tools/
codemap.js 191 // Static code entries can contain "holes" of unnamed code.
  /frameworks/native/services/surfaceflinger/
BufferLayer.cpp 184 // if not everything below us is covered, we plug the holes!
185 Region holes(clip.subtract(under));
186 if (!holes.isEmpty()) {
    [all...]
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/
value.go 21 // densely starting at 1. There is no guarantee that there won't be occasional holes, though.
  /prebuilts/go/darwin-x86/src/encoding/json/
encode.go 904 // because they can lead to security holes when
929 // and can lead to security holes there. It is valid JSON to
979 // because they can lead to security holes when
1004 // and can lead to security holes there. It is valid JSON to
    [all...]
  /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/
value.go 21 // densely starting at 1. There is no guarantee that there won't be occasional holes, though.
  /prebuilts/go/linux-x86/src/encoding/json/
encode.go 904 // because they can lead to security holes when
929 // and can lead to security holes there. It is valid JSON to
979 // because they can lead to security holes when
1004 // and can lead to security holes there. It is valid JSON to
    [all...]
  /prebuilts/go/darwin-x86/src/archive/tar/
common.go 217 // no holes in it). On the other hand, the zero value of sparseDatas implies
313 // fileState tracks the number of logical (includes sparse holes) and physical
489 return FormatUnknown, nil, headerError{"invalid sparse holes"}
reader.go 634 // then writeTo uses Seek to skip past holes defined in Header.SparseHoles,
690 sp sparseHoles // Normalized list of sparse holes
writer.go 437 // then readFrom uses Seek to skip past holes defined in Header.SparseHoles,
  /prebuilts/go/linux-x86/src/archive/tar/
common.go 217 // no holes in it). On the other hand, the zero value of sparseDatas implies
313 // fileState tracks the number of logical (includes sparse holes) and physical
489 return FormatUnknown, nil, headerError{"invalid sparse holes"}
reader.go 634 // then writeTo uses Seek to skip past holes defined in Header.SparseHoles,
690 sp sparseHoles // Normalized list of sparse holes
writer.go 437 // then readFrom uses Seek to skip past holes defined in Header.SparseHoles,

Completed in 645 milliseconds

1 2