Home
last modified time | relevance | path

Searched refs:d_set (Results 1 – 25 of 59) sorted by relevance

123

/dports/science/rdkit/rdkit-Release_2021_03_5/Code/Query/
H A DSetQuery.h34 if (d_set.find(what) == this->d_set.end()) this->d_set.insert(what); in insert()
38 void clear() { this->d_set.clear(); } in clear()
43 return (this->d_set.find(mfArg) != this->d_set.end()) ^ this->getNegation(); in Match()
51 for (i = this->d_set.begin(); i != this->d_set.end(); ++i) { in copy()
61 return d_set.begin(); in beginSet()
64 return d_set.end(); in endSet()
66 unsigned int size() const { return rdcast<unsigned int>(d_set.size()); }; in size()
75 std::copy(d_set.begin(), d_set.end(), in getFullDescription()
82 CONTAINER_TYPE d_set;
/dports/math/cvc4/CVC4-1.7/src/context/
H A Dcddense_set.h44 std::vector<bool>& d_set;
52 : d_set(set), d_cleanUp(cleanup) in RemoveIntCleanup()
59 Assert(d_set[x]); in operator()
60 d_set[x] = false; in operator()
67 std::vector<bool> d_set; variable
73 : d_set(), d_list(c, true, RemoveIntCleanup(d_set, cleanup)) in d_set() function
78 if(x < d_set.size()){ in contains()
79 return d_set[x]; in contains()
87 if(x >= d_set.size()){ in insert()
88 d_set.resize(x+1, false); in insert()
[all …]
/dports/devel/silentbob/silentbob-3.0/src/
H A Dehash.cxx93 char * d_set; in from_file() local
108 d_set = strchr (m_buf, '='); in from_file()
109 if (! d_set) in from_file()
112 *d_set = '\0'; in from_file()
113 ++d_set; in from_file()
114 strip (d_set); in from_file()
116 printf ("%s = %s\n", m_buf, d_set); in from_file()
117 set (m_buf, strdup (d_set)); in from_file()
H A Ddhash.cxx108 char * d_set;
127 d_set = d_key;
128 *d_set = '\0';
133 while (*(++d_set) && (*d_set == ' ' || *d_set == '\t'));
135 set (m_buf, strdup (d_set));
/dports/textproc/yodl/yodl-5fa97b175c85581d01329013cfdb4239f019b023/yodl/src/subst/
H A Dsstateinsert.c14 size_t last = string_length(&sp->d_set); /* set */ in s_state_insert()
16 string_addchar(&sp->d_set, (char)*key); /* add key's 1st char */ in s_state_insert()
17 sp->d_str = string_str(&sp->d_set); /* and set the state's ptr */ in s_state_insert()
H A Dsstatenew.c7 string_construct(&sp->d_set, 0); in s_state_new()
8 sp->d_str = string_str(&sp->d_set); /* locally avail. searchstring */ in s_state_new()
H A Dsubst.ih7 String d_set;
/dports/math/cvc4/CVC4-1.7/src/theory/quantifiers/fmf/
H A Dbounded_integers.h56 std::map< Node, std::vector< Node > > d_set; variable
167 …bool isBoundVar( Node q, Node v ) { return std::find( d_set[q].begin(), d_set[q].end(), v )!=d_set… in isBoundVar()
169 unsigned getNumBoundVars( Node q ) { return d_set[q].size(); } in getNumBoundVars()
170 Node getBoundVar( Node q, int i ) { return d_set[q][i]; } in getBoundVar()
H A Dbounded_integers.cpp97 return std::find( d_set[f].begin(), d_set[f].end(), v )!=d_set[f].end(); in isBound()
304 d_set_nums[q][v] = d_set[q].size(); in setBoundedVar()
305 d_set[q].push_back( v ); in setBoundedVar()
427 if( std::find( d_set[f].begin(), d_set[f].end(), v )!=d_set[f].end() ){ in checkOwnership()
469 for( unsigned i=0; i<d_set[f].size(); i++) { in checkOwnership()
470 Node v = d_set[f][i]; in checkOwnership()
674 Assert( d_set_nums[q][d_set[q][i]]==i ); in getRsiSubsitution()
675 Trace("bound-int-rsi") << "Look up the value for " << d_set[q][i] << " " << i << std::endl; in getRsiSubsitution()
677 Assert( q[0][v]==d_set[q][i] ); in getRsiSubsitution()
680 vars.push_back( d_set[q][i] ); in getRsiSubsitution()
/dports/net-mgmt/net-snmp/net-snmp-5.9/agent/mibgroup/host/
H A Dhr_disk.c334 details_set *d_set = NULL; in parse_disk_config() local
368 d_set = (details_set *) calloc(sizeof(details_set), 1); in parse_disk_config()
369 if (!d_set) { in parse_disk_config()
373 SNMP_FREE(d_set); in parse_disk_config()
400 SNMP_FREE(d_set); in parse_disk_config()
406 (*d_set)[i] = (*d_set)[i] ^ (unsigned char) 0xff; in parse_disk_config()
409 di_curr->item_details = (void *) d_set; in parse_disk_config()
421 SNMP_FREE(d_set); in parse_disk_config()
440 SNMP_FREE(d_set); in parse_disk_config()
478 details_set *d_set; in match_disk_config_item() local
[all …]
/dports/dns/powerdns/pdns-4.5.2/pdns/
H A Ddnsrecords.hh591 NSECBitmap(const NSECBitmap& rhs): d_set(rhs.d_set) in NSECBitmap()
599 d_set = rhs.d_set; in operator =()
607 NSECBitmap(NSECBitmap&& rhs): d_bitset(std::move(rhs.d_bitset)), d_set(std::move(rhs.d_set)) in NSECBitmap()
615 return d_set.count(type); in isSet()
620 if (d_set.size() >= 200) { in set()
628 d_set.insert(type); in set()
637 return d_set.size(); in count()
652 for (const auto& type : d_set) { in migrateToBitSet()
655 d_set.clear(); in migrateToBitSet()
663 std::set<uint16_t> d_set; member in NSECBitmap
H A Dmisc.hh208 d_set=tv; in setTimeval()
212 return d_set; in getTimeval()
215 struct timeval d_set{0, 0}; struct in DTime
220 return d_set.tv_sec; in time()
225 gettimeofday(&d_set, nullptr); in set()
233 int ret=1000000*(now.tv_sec-d_set.tv_sec)+(now.tv_usec-d_set.tv_usec); in udiff()
236 d_set = now; in udiff()
H A Dnsecrecords.cc90 for (const auto& type : d_set) { in toPacket()
158 for(const auto& type : d_set) { in getZoneRepresentation()
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/brec/
H A Dbrec_part_hierarchy_learner.cxx496 bsta_sample_set<double,1> d_set; in layer_n_fit_distributions() local
497 if (!bsta_sample_set_marginalize(*set, 0, d_set)) { in layer_n_fit_distributions()
501 d_set.set_bandwidth(d_bandwidth_); in layer_n_fit_distributions()
512 d_ms.find_modes(d_set, 0.01); in layer_n_fit_distributions()
513 d_ms.trim_modes(d_set, 2*d_delta); in layer_n_fit_distributions()
811 bsta_sample_set<double,1> d_set; in print_to_m_file_layer_n() local
812 if (!bsta_sample_set_marginalize(*set, 0, d_set)) { in print_to_m_file_layer_n()
818 d_set.set_bandwidth(d_bandwidth_); in print_to_m_file_layer_n()
821 d_ms.find_modes(d_set, 0.01); in print_to_m_file_layer_n()
822 d_ms.trim_modes(d_set, 2*d_hist->delta()); in print_to_m_file_layer_n()
[all …]
/dports/mail/neomutt/neomutt-20211029/mutt/
H A Dbuffer.c384 const bool d_set = (dir[0] != '\0'); in mutt_buffer_concat_path() local
386 if (!d_set && !f_set) in mutt_buffer_concat_path()
390 const bool slash = d_set && (dir[d_len - 1] == '/'); in mutt_buffer_concat_path()
393 if (!f_set || !d_set || slash) in mutt_buffer_concat_path()
/dports/dns/dnsdist/dnsdist-1.6.1/
H A Dmisc.hh208 d_set=tv; in setTimeval()
212 return d_set; in getTimeval()
215 struct timeval d_set{0, 0}; struct in DTime
220 return d_set.tv_sec; in time()
225 gettimeofday(&d_set, nullptr); in set()
233 int ret=1000000*(now.tv_sec-d_set.tv_sec)+(now.tv_usec-d_set.tv_usec); in udiff()
236 d_set = now; in udiff()
/dports/sysutils/vector/vector-0.10.0/cargo-crates/regalloc-0.0.25/src/
H A Danalysis_control_flow.rs257 let mut d_set: Set<BlockIx>; localVariable
284 d_set = t_set.clone();
285 d_set.insert(block_ix);
286 if !d_set.equals(&dom_map[block_ix]) {
288 dom_map[block_ix] = d_set;
/dports/www/firefox/firefox-99.0/third_party/rust/regalloc/src/
H A Danalysis_control_flow.rs259 let mut d_set: Set<BlockIx>; localVariable
286 d_set = t_set.clone();
287 d_set.insert(block_ix);
288 if !d_set.equals(&dom_map[block_ix]) {
290 dom_map[block_ix] = d_set;
/dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/regalloc/src/
H A Danalysis_control_flow.rs259 let mut d_set: Set<BlockIx>; localVariable
286 d_set = t_set.clone();
287 d_set.insert(block_ix);
288 if !d_set.equals(&dom_map[block_ix]) {
290 dom_map[block_ix] = d_set;
/dports/lang/rust/rustc-1.58.1-src/vendor/regalloc/src/
H A Danalysis_control_flow.rs259 let mut d_set: Set<BlockIx>; localVariable
286 d_set = t_set.clone();
287 d_set.insert(block_ix);
288 if !d_set.equals(&dom_map[block_ix]) {
290 dom_map[block_ix] = d_set;
/dports/www/firefox-esr/firefox-91.8.0/third_party/rust/regalloc/src/
H A Danalysis_control_flow.rs259 let mut d_set: Set<BlockIx>; localVariable
286 d_set = t_set.clone();
287 d_set.insert(block_ix);
288 if !d_set.equals(&dom_map[block_ix]) {
290 dom_map[block_ix] = d_set;
/dports/lang/spidermonkey78/firefox-78.9.0/third_party/rust/regalloc/src/
H A Danalysis_control_flow.rs258 let mut d_set: Set<BlockIx>; localVariable
285 d_set = t_set.clone();
286 d_set.insert(block_ix);
287 if !d_set.equals(&dom_map[block_ix]) {
289 dom_map[block_ix] = d_set;
/dports/math/polymake/polymake-4.5/apps/topaz/include/
H A DFiltration.h74 const auto d_set = HD.nodes_of_rank(d+1); in Filtration() local
75 Int n = d_set.size();//number of d-simplices in Filtration()
82 for (Int f : d_set) { // iterate d-simplices in Filtration()
/dports/security/suricata/suricata-6.0.4/src/
H A Ddetect-engine-port.c839 int o_set = 0, n_set = 0, d_set = 0; in DetectPortParseDo() local
893 } else if (d_set == 1) { in DetectPortParseDo()
928 d_set = 0; in DetectPortParseDo()
948 d_set = 1; in DetectPortParseDo()
965 if (d_set == 1) { in DetectPortParseDo()
998 d_set = 0; in DetectPortParseDo()
/dports/dns/gdnsd2/gdnsd-2.4.3/libgdmaps/
H A Dgdgeoip2.c295 #define mmdb_lookup_double_(d_out, d_set, ...) do {\ argument
299 d_set = true;\

123