/dports/textproc/aspell-ispell/aspell-0.60.8/common/ |
H A D | generic_copy_ptr-t.hpp | 24 ptr_ = parms_.clone(other.ptr_); in GenericCopyPtr() 27 parms_ = other.parms_; in GenericCopyPtr() 35 if (ptr_ != 0) parms_.del(ptr_); in assign() 38 ptr_ = parms_.clone(other_ptr); in assign() 40 parms_.assign(ptr_, other_ptr); in assign() 42 parms_ = other_parms; in assign() 49 parms_.del(ptr_); in reset() 51 parms_ = other_parms; in reset() 58 parms_.del(ptr_); in ~GenericCopyPtr()
|
H A D | enumeration.hpp | 70 Parms parms_; member in acommon::MakeEnumeration 74 : i_(i), parms_(p) {} in MakeEnumeration() 85 if (parms_.endf(i_)) in next() 86 return parms_.end_state(); in next() 87 Value temp = parms_.deref(i_); in next() 93 return parms_.endf(i_); in at_end() 109 MakeAlwaysEndEnumerationParms<Value> parms_; member in acommon::MakeAlwaysEndEnumeration 117 Value next() {return parms_.end_state();} in next()
|
H A D | hash-t.hpp | 90 iterator put_me_here = find_i(parms_.key(to_insert), have); in insert() 91 if (have && !parms_.is_multi) in insert() 124 while (n != 0 && parms_.equal(parms_.key(n->data), k)) { in erase() 139 Size pos = parms_.hash(to_find) % table_size_; in find_i() 145 } else if (parms_.equal(parms_.key((*n)->data),to_find)) { in find_i() 167 while (!(last == e) && parms_.equal(parms_.key(*last), to_find)) { in equal_range_i() 202 Node * * put_me_here = table_ + (parms_.hash(parms_.key(n->data)) % table_size_); in resize_i() 218 parms_ = other.parms_; in copy()
|
H A D | generic_copy_ptr.hpp | 28 Parms parms_; member in acommon::GenericCopyPtr 33 : ptr_(p), parms_(parms) {} in GenericCopyPtr() 37 assign(other.ptr_, parms_); in operator =() 54 const Parms & parms() {return parms_;} in parms() 55 const Parms & parms() const {return parms_;} in parms()
|
/dports/textproc/aspell/aspell-0.60.8/common/ |
H A D | generic_copy_ptr-t.hpp | 24 ptr_ = parms_.clone(other.ptr_); in GenericCopyPtr() 27 parms_ = other.parms_; in GenericCopyPtr() 35 if (ptr_ != 0) parms_.del(ptr_); in assign() 38 ptr_ = parms_.clone(other_ptr); in assign() 40 parms_.assign(ptr_, other_ptr); in assign() 42 parms_ = other_parms; in assign() 49 parms_.del(ptr_); in reset() 51 parms_ = other_parms; in reset() 58 parms_.del(ptr_); in ~GenericCopyPtr()
|
H A D | enumeration.hpp | 70 Parms parms_; member in acommon::MakeEnumeration 74 : i_(i), parms_(p) {} in MakeEnumeration() 85 if (parms_.endf(i_)) in next() 86 return parms_.end_state(); in next() 87 Value temp = parms_.deref(i_); in next() 93 return parms_.endf(i_); in at_end() 109 MakeAlwaysEndEnumerationParms<Value> parms_; member in acommon::MakeAlwaysEndEnumeration 117 Value next() {return parms_.end_state();} in next()
|
H A D | hash-t.hpp | 90 iterator put_me_here = find_i(parms_.key(to_insert), have); in insert() 91 if (have && !parms_.is_multi) in insert() 124 while (n != 0 && parms_.equal(parms_.key(n->data), k)) { in erase() 139 Size pos = parms_.hash(to_find) % table_size_; in find_i() 145 } else if (parms_.equal(parms_.key((*n)->data),to_find)) { in find_i() 167 while (!(last == e) && parms_.equal(parms_.key(*last), to_find)) { in equal_range_i() 202 Node * * put_me_here = table_ + (parms_.hash(parms_.key(n->data)) % table_size_); in resize_i() 218 parms_ = other.parms_; in copy()
|
H A D | generic_copy_ptr.hpp | 28 Parms parms_; member in acommon::GenericCopyPtr 33 : ptr_(p), parms_(parms) {} in GenericCopyPtr() 37 assign(other.ptr_, parms_); in operator =() 54 const Parms & parms() {return parms_;} in parms() 55 const Parms & parms() const {return parms_;} in parms()
|
/dports/cad/iverilog/verilog-11.0/ |
H A D | PExpr.cc | 104 : parms_(p.size()) in PEAssignPattern() 109 parms_[idx] = *cur; in PEAssignPattern() 227 assert(parms_.size() == parms.size()); in PECallFunction() 230 parms_[tmp_idx++] = *idx; in PECallFunction() 248 assert(parms_.size() == parms.size()); in PECallFunction() 251 parms_[tmp_idx++] = *idx; in PECallFunction() 261 parms_[tmp_idx++] = *idx; in PECallFunction() 288 assert(parms_.size() == p.size()); in PEConcat() 291 parms_[tmp_idx++] = *idx; in PEConcat() 464 : parms_(p.size()) in PENewClass() [all …]
|
H A D | net_expr.cc | 242 delete parms_[idx]; in ~NetEConcat() 257 assert(idx < parms_.size()); in set() 258 assert(parms_[idx] == 0); in set() 259 parms_[idx] = e; in set() 497 if (parms_[idx]) delete parms_[idx]; in ~NetESFunc() 509 return parms_.size(); in nparms() 515 if (parms_[idx]) in parm() 516 delete parms_[idx]; in parm() 517 parms_[idx] = v; in parm() 523 return parms_[idx]; in parm() [all …]
|
H A D | Statement.cc | 167 : package_(0), path_(n), parms_(p.size()) in PCallTask() 170 for (size_t idx = 0 ; idx < parms_.size() ; idx += 1) { in PCallTask() 171 parms_[idx] = *cur; in PCallTask() 178 : package_(pkg), path_(n), parms_(p.size()) in PCallTask() 181 for (size_t idx = 0 ; idx < parms_.size() ; idx += 1) { in PCallTask() 182 parms_[idx] = *cur; in PCallTask() 189 : package_(0), parms_(p.size()) in PCallTask() 192 for (size_t idx = 0 ; idx < parms_.size() ; idx += 1) { in PCallTask() 193 parms_[idx] = *cur; in PCallTask() 235 : parms_(parms.size()) in PChainConstructor() [all …]
|
H A D | net_nex_input.cc | 72 if (parms_[0] == NULL) return new NexusSet; in nex_input() 74 for (unsigned idx = 1 ; idx < parms_.size() ; idx += 1) { in nex_input() 75 if (parms_[idx] == NULL) { in nex_input() 79 NexusSet*tmp = parms_[idx]->nex_input(rem_out, always_sens, nested_func); in nex_input() 174 if (parms_.empty()) return result; in nex_input() 176 for (unsigned idx = 0 ; idx < parms_.size() ; idx += 1) { in nex_input() 177 if (parms_[idx]) { in nex_input() 260 for (unsigned idx = 0 ; idx < parms_.size() ; idx += 1) { in nex_input() 591 if (parms_.empty()) return result; in nex_input() 593 for (unsigned idx = 0 ; idx < parms_.size() ; idx += 1) { in nex_input() [all …]
|
H A D | pform_dump.cc | 308 if (parms_[0]) out << *parms_[0]; in dump() 311 if (parms_[idx]) out << *parms_[idx]; in dump() 326 if (parms_[0]) parms_[0]->dump(out); in dump() 329 if (parms_[idx]) parms_[idx]->dump(out); in dump() 388 if (parms_[idx]) parms_[idx]->dump(out); in dump() 721 if (parms_) { in dump() 727 if (parms_[idx].parm) out << *parms_[idx].parm; in dump() 840 if (parms_[0]) in dump() 845 if (parms_[idx]) in dump() 915 if (parms_[0]) out << *parms_[0]; in dump() [all …]
|
H A D | dup_expr.cc | 124 NetEConcat*dup = new NetEConcat(parms_.size(), repeat_, expr_type_); in dup_expr() 127 for (unsigned idx = 0 ; idx < parms_.size() ; idx += 1) in dup_expr() 128 if (parms_[idx]) { in dup_expr() 129 NetExpr*tmp = parms_[idx]->dup_expr(); in dup_expr() 131 dup->parms_[idx] = tmp; in dup_expr() 280 vector<NetExpr*> tmp_parms (parms_.size()); in dup_expr() 283 ivl_assert(*this, parms_[idx]); in dup_expr() 284 tmp_parms[idx] = parms_[idx]->dup_expr(); in dup_expr()
|
H A D | PGate.cc | 269 npins_(0), parms_(0), nparms_(0), msb_(0), lsb_(0) in PGModule() 276 npins_(npins), parms_(0), nparms_(0), msb_(0), lsb_(0) in PGModule() 282 npins_(0), parms_(0), nparms_(0), msb_(0), lsb_(0) in PGModule() 298 assert(parms_ == 0); in set_parameters() 300 parms_ = pa; in set_parameters()
|
H A D | elab_anet.cc | 49 svector<NetNet*>nets (parms_.count()); in elaborate_anet() 55 if (parms_[idx] == 0) { in elaborate_anet() 62 nets[idx] = parms_[idx]->elaborate_anet(des, scope); in elaborate_anet()
|
/dports/textproc/aspell-ispell/aspell-0.60.8/modules/speller/default/ |
H A D | vector_hash-t.hpp | 49 parms_.make_nonexistent(*i); in nonexistent_vector() 57 MutableFindIterator j(this, parms_.key(d)); in insert() 59 if (!parms_.is_multi && !j.at_end()) in insert() 65 if (parms_.is_multi) in insert() 116 parms_.make_nonexistent(*pos); 123 } while (!parms_.is_nonexistent(*e)); 127 if (parms_.is_nonexistent(*pos)) { 129 if (parms_.is_nonexistent(*should_be)) { 131 parms_.make_nonexistent(*pos); 151 : parms_(p), size_(0) in VectorHashTable() [all …]
|
H A D | vector_hash.hpp | 165 Parms parms_; member in aspeller::VectorHashTable 169 const parms_type & parms() const {return parms_;} in parms() 176 parms_type & parms() {return parms_;} in parms() 190 return parms_.hash(d) % bucket_count(); in hash1() 193 return 1 + (parms_.hash(d) % (bucket_count() - 2)); in hash2() 217 : parms_(p), vector_(19), size_(0) {nonexistent_vector();} in VectorHashTable()
|
/dports/textproc/aspell/aspell-0.60.8/modules/speller/default/ |
H A D | vector_hash-t.hpp | 49 parms_.make_nonexistent(*i); in nonexistent_vector() 57 MutableFindIterator j(this, parms_.key(d)); in insert() 59 if (!parms_.is_multi && !j.at_end()) in insert() 65 if (parms_.is_multi) in insert() 116 parms_.make_nonexistent(*pos); 123 } while (!parms_.is_nonexistent(*e)); 127 if (parms_.is_nonexistent(*pos)) { 129 if (parms_.is_nonexistent(*should_be)) { 131 parms_.make_nonexistent(*pos); 151 : parms_(p), size_(0) in VectorHashTable() [all …]
|
H A D | vector_hash.hpp | 165 Parms parms_; member in aspeller::VectorHashTable 169 const parms_type & parms() const {return parms_;} in parms() 176 parms_type & parms() {return parms_;} in parms() 190 return parms_.hash(d) % bucket_count(); in hash1() 193 return 1 + (parms_.hash(d) % (bucket_count() - 2)); in hash2() 217 : parms_(p), vector_(19), size_(0) {nonexistent_vector();} in VectorHashTable()
|
/dports/cad/iverilog/verilog-11.0/vhdlpp/ |
H A D | entity_stream.cc | 29 if(!parms_.empty()) { in write_to_stream() 32 for(vector<InterfacePort*>::const_iterator it = parms_.begin(); in write_to_stream() 33 it != parms_.end(); ++it) { in write_to_stream() 36 if(it != parms_.begin()) in write_to_stream()
|
H A D | entity_emit.cc | 46 if (parms_.size() > 0) { in emit() 48 for (vector<InterfacePort*>::const_iterator cur = parms_.begin() in emit() 49 ; cur != parms_.end() ; ++cur) { in emit() 51 if (cur != parms_.begin()) in emit()
|
H A D | entity.cc | 46 parms_.push_back(parms->front()); in set_interface() 71 for (size_t idx = 0 ; idx < parms_.size() ; idx += 1) { in find_generic() 72 if (parms_[idx]->name == my_name) in find_generic() 73 return parms_[idx]; in find_generic()
|
/dports/security/seal/SEAL-3.7.2/native/bench/ |
H A D | bench.h | 36 : parms_(parms), context_(parms_, true, seal::sec_level_type::none) in BMEnv() 45 … galois_elts_all_.emplace_back(2 * static_cast<uint32_t>(parms_.poly_modulus_degree()) - 1); in BMEnv() 52 if (parms_.scheme() == seal::scheme_type::bfv) in BMEnv() 56 else if (parms_.scheme() == seal::scheme_type::ckks) in BMEnv() 65 pt_[i].resize(parms_.poly_modulus_degree()); in BMEnv() 80 return parms_; in parms() 260 pt.resize(parms_.poly_modulus_degree()); in randomize_pt_bfv() 262 randomize_array_mod(pt.data(), parms_.poly_modulus_degree(), parms_.plain_modulus()); in randomize_pt_bfv() 289 randomize_array_mod(msg.data(), batch_encoder_->slot_count(), parms_.plain_modulus()); in randomize_message_uint64() 302 seal::EncryptionParameters parms_;
|
/dports/cad/openroad/OpenROAD-2.0/src/ppl/src/ |
H A D | IOPlacer.cpp | 55 parms_ = std::make_unique<Parameters>(); in init() 73 *parms_ = Parameters(); in clear() 92 if (parms_->getReportHPWL()) { in initParms() 95 if (parms_->getForceSpread()) { in initParms() 100 if (parms_->getNumSlots() > -1) { in initParms() 101 slots_per_section_ = parms_->getNumSlots(); in initParms() 104 if (parms_->getSlotsFactor() > -1) { in initParms() 107 if (parms_->getUsageFactor() > -1) { in initParms() 179 const double seed = parms_->getRandSeed(); in randomPlacement() 337 int offset = parms_->getCornerAvoidance(); in findSlots() [all …]
|