HomeSort by relevance Sort by last modified time
    Searched defs:borders (Results 1 - 10 of 10) sorted by null

  /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
partial_sum.h 112 difference_type* borders; local
123 borders = new difference_type[num_threads + 2];
126 equally_split(n, num_threads + 1, borders);
133 borders[0] = 0;
136 borders[i] = borderstart;
139 borders[num_threads + 1] = n;
151 parallel_partial_sum_basecase(begin + 1, begin + borders[1],
153 ::new(&(sums[iam])) value_type(*(result + borders[1] - 1));
158 value_type(std::accumulate(begin + borders[iam] + 1,
159 begin + borders[iam + 1]
    [all...]
queue.h 63 _GLIBCXX_VOLATILE lcas_t borders; member in class:__gnu_parallel::RestrictedBoundedConcurrentQueue
72 borders = encode2(0, 0);
85 lcas_t former_borders = borders;
94 fetch_and_add(&borders, encode2(1, 0));
104 decode2(borders, former_front, former_back);
110 if (compare_and_swap(&borders, former_borders, new_borders))
116 decode2(borders, former_front, former_back);
128 decode2(borders, former_front, former_back);
134 if (compare_and_swap(&borders, former_borders, new_borders))
140 decode2(borders, former_front, former_back)
    [all...]
unique_copy.h 67 difference_type *borders; local
76 borders = new difference_type[num_threads + 2];
77 equally_split(size, num_threads + 1, borders);
92 begin = borders[0] + 1; // == 1
93 end = borders[iam + 1];
109 begin = borders[iam]; //one part
110 end = borders[iam + 1];
137 begin = borders[num_threads];
169 delete[] borders;
find.h 112 difference_type* borders; local
123 borders = new difference_type[num_threads + 1];
124 equally_split(length, num_threads, borders);
128 difference_type start = borders[iam], stop = borders[iam + 1];
153 delete[] borders;
set_operations.h 375 difference_type *borders; local
389 borders = new difference_type[num_threads + 2];
390 equally_split(size, num_threads + 1, borders);
401 const difference_type rank = borders[iam + 1];
multiway_merge.h 1207 difference_type* borders = local
    [all...]
  /external/webkit/Source/WebCore/html/
HTMLTableElement.cpp 347 // Whether or not to hide the top/right/bottom/left borders.
352 bool borders[4] = { false, false, false, false }; local
359 borders[cTop] = true;
362 borders[cBottom] = true;
365 borders[cTop] = borders[cBottom] = true;
368 borders[cLeft] = borders[cRight] = true;
371 borders[cLeft] = true;
374 borders[cRight] = true
509 CellBorders borders = cellBorders(); local
    [all...]
  /external/webkit/Source/WebCore/rendering/
RenderTableCell.cpp 250 // so we ignore outside borders. This should not be a problem because it means that
252 // includes any outside borders of this cell.
339 // (1) Borders with the 'border-style' of 'hidden' take precedence over all other conflicting
340 // borders. Any border with this value suppresses all borders at this location.
341 // (2) Borders with a style of 'none' have the lowest priority. Only if the border properties of all
344 // (3) If none of the styles are 'hidden' and at least one of them is not 'none', then narrow borders
379 // The first part of rule #3 above. Wider borders win.
383 // The borders have equal width. Sort by border style.
428 // (5) Our column and column group's start borders
957 CollapsedBorders borders; local
    [all...]
  /external/freetype/src/base/
ftstroke.c 286 /***** STROKE BORDERS *****/
308 FT_Bool movable; /* TRUE for ends of lineto borders */
780 FT_StrokeBorderRec borders[2]; member in struct:FT_StrokerRec_
806 ft_stroke_border_init( &stroker->borders[0], memory );
807 ft_stroke_border_init( &stroker->borders[1], memory );
849 ft_stroke_border_reset( &stroker->borders[0] );
850 ft_stroke_border_reset( &stroker->borders[1] );
865 ft_stroke_border_done( &stroker->borders[0] );
866 ft_stroke_border_done( &stroker->borders[1] );
882 FT_StrokeBorder border = stroker->borders + side
    [all...]
  /prebuilt/common/netbeans-visual/
org-netbeans-api-visual.jar 

Completed in 3035 milliseconds