HomeSort by: relevance | last modified time | path
    Searched defs:adjacent (Results 1 - 4 of 4) sorted by relevancy

  /src/external/bsd/openldap/dist/servers/slapd/
phonetic.c 119 char code, adjacent, ch; local
129 adjacent = '0';
143 code = (adjacent != '1') ? '1' : '0';
153 code = (adjacent != '2') ? '2' : '0';
157 code = (adjacent != '3') ? '3' : '0';
160 code = (adjacent != '4') ? '4' : '0';
164 code = (adjacent != '5') ? '5' : '0';
167 code = (adjacent != '6') ? '6' : '0';
170 adjacent = '0';
174 adjacent = code
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
IntervalMap.h 126 // Adjacent intervals that map to the same value are coalesced.
129 // in an interval, and if two intervals are adjacent so they can be coalesced.
155 /// adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.
157 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapInfo
180 /// adjacent - Return true when the intervals [x;a) and [b;y) can coalesce.
181 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapHalfOpenInfo
553 // The intervals are kept sorted and fully coalesced so there are no adjacent
562 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
643 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) {
646 if (i != Size && value(i) == y && Traits::adjacent(b, start(i)))
    [all...]
  /src/external/mit/isl/dist/
isl_scheduler.c 3294 /* For each conditional validity constraint that is adjacent
3308 int adjacent; local
3317 adjacent = domain_intersects(validity, condition_sink);
3318 if (adjacent >= 0 && !adjacent)
3319 adjacent = range_intersects(validity, condition_source);
3320 if (adjacent < 0)
3322 if (!adjacent)
3338 * and enforce conditional validity constraints that are adjacent
3347 * then turn all adjacent conditional validity constraints int
5469 int adjacent, local; local
    [all...]
  /src/external/gpl3/gcc/dist/gcc/cp/
pt.cc 8270 tree adjacent = DECL_TI_ARGS (DECL_TEMPLATE_RESULT (arg_tmpl)); local
8271 adjacent = TMPL_ARGS_LEVEL (adjacent, TMPL_ARGS_DEPTH (adjacent) - 1);
8272 TREE_VEC_ELT (full_pargs, level - 1) = adjacent;

Completed in 54 milliseconds