Home
last modified time | relevance | path

Searched refs:cons_ (Results 1 – 25 of 93) sorted by relevance

1234

/dports/math/bcps/CHiPPS-BiCePS-releases-0.99.2/Bcps/src/
H A DBcpsNodeDesc.cpp106 delete cons_; in ~BcpsNodeDesc()
107 cons_ = NULL; in ~BcpsNodeDesc()
155 cons_->numAdd = 0; in initToNull()
671 if (cons_->lbSoft.posModify) delete [] cons_->lbSoft.posModify; in setConSoftBound()
672 if (cons_->lbSoft.entries) delete [] cons_->lbSoft.entries; in setConSoftBound()
693 if (cons_->ubSoft.posModify) delete [] cons_->ubSoft.posModify; in setConSoftBound()
694 if (cons_->ubSoft.entries) delete [] cons_->ubSoft.entries; in setConSoftBound()
805 if (cons_->lbHard.posModify) delete [] cons_->lbHard.posModify; in setConHardBound()
806 if (cons_->lbHard.entries) delete [] cons_->lbHard.entries; in setConHardBound()
827 if (cons_->ubHard.posModify) delete [] cons_->ubHard.posModify; in setConHardBound()
[all …]
H A DBcpsNodeDesc.h137 BcpsObjectListMod *cons_; variable
317 delete [] cons_->objects; in appendAddedConstraints()
318 cons_->numAdd = numAll; in appendAddedConstraints()
319 cons_->objects = allAdd; in appendAddedConstraints()
326 if (cons_->objects) { in setAddedConstraints()
330 delete [] cons_->objects; in setAddedConstraints()
332 cons_->numAdd = numAdd; in setAddedConstraints()
333 cons_->objects = addCons; in setAddedConstraints()
339 if ( cons_->posRemove) delete [] cons_->posRemove; in delConstraints()
340 cons_->numRemove = numDel; in delConstraints()
[all …]
/dports/lang/clisp/clisp-df3b9f6fdcff22832898e89a989eb499c0f842ed/src/
H A Dspvw_walk.d85 fun(arg,with_typecode(p),sizeof(cons_)); in map_heap_objects()
86 p += sizeof(cons_); in map_heap_objects()
94 fun(arg,with_typecode(p),sizeof(cons_)); in map_heap_objects()
95 p += sizeof(cons_); in map_heap_objects()
106 fun(arg,with_typecode(p),sizeof(cons_)); in map_heap_objects()
107 p += sizeof(cons_); in map_heap_objects()
115 fun(arg,with_typecode(p),sizeof(cons_)); in map_heap_objects()
116 p += sizeof(cons_); in map_heap_objects()
140 fun(arg,with_typecode(p),sizeof(cons_)); in map_heap_objects()
141 p += sizeof(cons_); in map_heap_objects()
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/testsuite/g++.dg/cpp0x/
H A Dnullptr30.C10 struct cons_ { struct
17 constexpr cons_() {} in cons_() function
18 constexpr cons_(H const &h, T const &t) : head(h), tail(t) {} in cons_() argument
21 constexpr cons_<H, T> cons (H const &h, T const &t = nil) { return
22 cons_<H,T>(h,t); }
28 using type = cons_<H, typename list_s<T...>::type>;
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/testsuite/g++.dg/cpp0x/
H A Dnullptr30.C10 struct cons_ { struct
17 constexpr cons_() {} in cons_() argument
18 constexpr cons_(H const &h, T const &t) : head(h), tail(t) {} in cons_() function
21 constexpr cons_<H, T> cons (H const &h, T const &t = nil) { return
22 cons_<H,T>(h,t); }
28 using type = cons_<H, typename list_s<T...>::type>;
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/testsuite/g++.dg/cpp0x/
H A Dnullptr30.C10 struct cons_ { struct
17 constexpr cons_() {} in cons_() argument
18 constexpr cons_(H const &h, T const &t) : head(h), tail(t) {} in cons_() function
21 constexpr cons_<H, T> cons (H const &h, T const &t = nil) { return
22 cons_<H,T>(h,t); }
28 using type = cons_<H, typename list_s<T...>::type>;
/dports/lang/gcc9/gcc-9.4.0/gcc/testsuite/g++.dg/cpp0x/
H A Dnullptr30.C10 struct cons_ { struct
17 constexpr cons_() {} in cons_() argument
18 constexpr cons_(H const &h, T const &t) : head(h), tail(t) {} in cons_() argument
21 constexpr cons_<H, T> cons (H const &h, T const &t = nil) { return
22 cons_<H,T>(h,t); }
28 using type = cons_<H, typename list_s<T...>::type>;
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/testsuite/g++.dg/cpp0x/
H A Dnullptr30.C10 struct cons_ { struct
17 constexpr cons_() {} in cons_() argument
18 constexpr cons_(H const &h, T const &t) : head(h), tail(t) {} in cons_() function
21 constexpr cons_<H, T> cons (H const &h, T const &t = nil) { return
22 cons_<H,T>(h,t); }
28 using type = cons_<H, typename list_s<T...>::type>;
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/testsuite/g++.dg/cpp0x/
H A Dnullptr30.C10 struct cons_ { struct
17 constexpr cons_() {} in cons_() argument
18 constexpr cons_(H const &h, T const &t) : head(h), tail(t) {} in cons_() function
21 constexpr cons_<H, T> cons (H const &h, T const &t = nil) { return
22 cons_<H,T>(h,t); }
28 using type = cons_<H, typename list_s<T...>::type>;
/dports/devel/avr-gcc/gcc-10.2.0/gcc/testsuite/g++.dg/cpp0x/
H A Dnullptr30.C10 struct cons_ { struct
17 constexpr cons_() {} in cons_() argument
18 constexpr cons_(H const &h, T const &t) : head(h), tail(t) {} in cons_() argument
21 constexpr cons_<H, T> cons (H const &h, T const &t = nil) { return
22 cons_<H,T>(h,t); }
28 using type = cons_<H, typename list_s<T...>::type>;
/dports/lang/gnat_util/gcc-6-20180516/gcc/testsuite/g++.dg/cpp0x/
H A Dnullptr30.C10 struct cons_ { struct
17 constexpr cons_() {} in cons_() argument
18 constexpr cons_(H const &h, T const &t) : head(h), tail(t) {} in cons_() argument
21 constexpr cons_<H, T> cons (H const &h, T const &t = nil) { return
22 cons_<H,T>(h,t); }
28 using type = cons_<H, typename list_s<T...>::type>;
/dports/lang/gcc11/gcc-11.2.0/gcc/testsuite/g++.dg/cpp0x/
H A Dnullptr30.C10 struct cons_ {
17 constexpr cons_() {}
18 constexpr cons_(H const &h, T const &t) : head(h), tail(t) {}
21 constexpr cons_<H, T> cons (H const &h, T const &t = nil) { return
22 cons_<H,T>(h,t); }
28 using type = cons_<H, typename list_s<T...>::type>;
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/testsuite/g++.dg/cpp0x/
H A Dnullptr30.C10 struct cons_ { struct
17 constexpr cons_() {} in cons_() argument
18 constexpr cons_(H const &h, T const &t) : head(h), tail(t) {} in cons_() argument
21 constexpr cons_<H, T> cons (H const &h, T const &t = nil) { return
22 cons_<H,T>(h,t); }
28 using type = cons_<H, typename list_s<T...>::type>;
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/testsuite/g++.dg/cpp0x/
H A Dnullptr30.C10 struct cons_ { struct
17 constexpr cons_() {} in cons_() function
18 constexpr cons_(H const &h, T const &t) : head(h), tail(t) {} in cons_() argument
21 constexpr cons_<H, T> cons (H const &h, T const &t = nil) { return
22 cons_<H,T>(h,t); }
28 using type = cons_<H, typename list_s<T...>::type>;
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/testsuite/g++.dg/cpp0x/
H A Dnullptr30.C10 struct cons_ { struct
17 constexpr cons_() {} in cons_() argument
18 constexpr cons_(H const &h, T const &t) : head(h), tail(t) {} in cons_() function
21 constexpr cons_<H, T> cons (H const &h, T const &t = nil) { return
22 cons_<H,T>(h,t); }
28 using type = cons_<H, typename list_s<T...>::type>;
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/testsuite/g++.dg/cpp0x/
H A Dnullptr30.C10 struct cons_ { struct
17 constexpr cons_() {} in cons_() argument
18 constexpr cons_(H const &h, T const &t) : head(h), tail(t) {} in cons_() argument
21 constexpr cons_<H, T> cons (H const &h, T const &t = nil) { return
22 cons_<H,T>(h,t); }
28 using type = cons_<H, typename list_s<T...>::type>;
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/testsuite/g++.dg/cpp0x/
H A Dnullptr30.C10 struct cons_ { struct
17 constexpr cons_() {} in cons_() argument
18 constexpr cons_(H const &h, T const &t) : head(h), tail(t) {} in cons_() function
21 constexpr cons_<H, T> cons (H const &h, T const &t = nil) { return
22 cons_<H,T>(h,t); }
28 using type = cons_<H, typename list_s<T...>::type>;
/dports/lang/gcc10/gcc-10.3.0/gcc/testsuite/g++.dg/cpp0x/
H A Dnullptr30.C10 struct cons_ { struct
17 constexpr cons_() {} in cons_() argument
18 constexpr cons_(H const &h, T const &t) : head(h), tail(t) {} in cons_() argument
21 constexpr cons_<H, T> cons (H const &h, T const &t = nil) { return
22 cons_<H,T>(h,t); }
28 using type = cons_<H, typename list_s<T...>::type>;
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/testsuite/g++.dg/cpp0x/
H A Dnullptr30.C10 struct cons_ { struct
17 constexpr cons_() {} in cons_() argument
18 constexpr cons_(H const &h, T const &t) : head(h), tail(t) {} in cons_() function
21 constexpr cons_<H, T> cons (H const &h, T const &t = nil) { return
22 cons_<H,T>(h,t); }
28 using type = cons_<H, typename list_s<T...>::type>;
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/testsuite/g++.dg/cpp0x/
H A Dnullptr30.C10 struct cons_ { struct
17 constexpr cons_() {} in cons_() argument
18 constexpr cons_(H const &h, T const &t) : head(h), tail(t) {} in cons_() argument
21 constexpr cons_<H, T> cons (H const &h, T const &t = nil) { return
22 cons_<H,T>(h,t); }
28 using type = cons_<H, typename list_s<T...>::type>;
/dports/lang/gcc8/gcc-8.5.0/gcc/testsuite/g++.dg/cpp0x/
H A Dnullptr30.C10 struct cons_ { struct
17 constexpr cons_() {} in cons_() argument
18 constexpr cons_(H const &h, T const &t) : head(h), tail(t) {} in cons_() argument
21 constexpr cons_<H, T> cons (H const &h, T const &t = nil) { return
22 cons_<H,T>(h,t); }
28 using type = cons_<H, typename list_s<T...>::type>;
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/testsuite/g++.dg/cpp0x/
H A Dnullptr30.C10 struct cons_ { struct
17 constexpr cons_() {} in cons_() argument
18 constexpr cons_(H const &h, T const &t) : head(h), tail(t) {} in cons_() argument
21 constexpr cons_<H, T> cons (H const &h, T const &t = nil) { return
22 cons_<H,T>(h,t); }
28 using type = cons_<H, typename list_s<T...>::type>;
/dports/japanese/zinnia/zinnia-0.06/
H A Dsexp.h23 value_.cons_.car_ = cell; in set_car()
27 value_.cons_.cdr_ = cell; in set_cdr()
33 const Cell *car() const { return value_.cons_.car_; } in car()
34 const Cell *cdr() const { return value_.cons_.cdr_; } in cdr()
54 cons_t cons_; member
/dports/math/clingo/clingo-5.5.1/clasp/src/
H A Dcb_enumerator.cpp247 cons_.clear(); in doInit()
265 for (LitVec::iterator it = cons_.begin(), end = cons_.end(); it != end; ++it) { in doInit()
282 return new QueryFinder(cons_, model(), ctx.numVars() + 1); in doInit()
286 cons_.push_back(p); in addLit()
294 for (LitVec::iterator it = cons_.begin(), end = cons_.end(); it != end; ++it) { in addCurrent()
298 for (LitVec::iterator it = cons_.begin(), end = cons_.end(); it != end; ++it) { in addCurrent()
/dports/math/clasp/clasp-3.3.5/src/
H A Dcb_enumerator.cpp247 cons_.clear(); in doInit()
265 for (LitVec::iterator it = cons_.begin(), end = cons_.end(); it != end; ++it) { in doInit()
282 return new QueryFinder(cons_, model(), ctx.numVars() + 1); in doInit()
286 cons_.push_back(p); in addLit()
294 for (LitVec::iterator it = cons_.begin(), end = cons_.end(); it != end; ++it) { in addCurrent()
298 for (LitVec::iterator it = cons_.begin(), end = cons_.end(); it != end; ++it) { in addCurrent()

1234