/dports/games/odamex/odamex-src-0.7.0/server/src/ |
H A D | sv_pickup.cpp | 56 std::vector<player_t*> eligible; in EXTERN_CVAR() local 60 eligible.push_back(&*it); in EXTERN_CVAR() 64 if (eligible.empty()) { in EXTERN_CVAR() 69 if (eligible.size() < num_players) { in EXTERN_CVAR() 76 std::random_shuffle(eligible.begin(), eligible.end()); in EXTERN_CVAR() 77 eligible.resize(num_players); in EXTERN_CVAR() 83 for (std::vector<player_t*>::iterator it = eligible.begin();it != eligible.end();++it,++i) { in EXTERN_CVAR() 91 if ((eligible.size() % 2) == 1 && i == (eligible.size() - 1)) { in EXTERN_CVAR() 118 if (std::find(eligible.begin(), eligible.end(), &*it) == eligible.end()) { in EXTERN_CVAR()
|
/dports/devel/libxs/libxs-1.2.0/src/ |
H A D | dist.cpp | 31 eligible (0), in dist_t() 49 eligible++; in attach() 55 eligible++; in attach() 66 if (pipes.index (pipe_) >= eligible) in match() 101 if (i < (int) eligible) { in terminated() 103 pipes [eligible - 1] = NULL; in terminated() 106 --eligible; in terminated() 107 i = eligible; in terminated() 116 eligible++; in activated() 142 active = eligible; in send_to_matching() [all …]
|
/dports/math/vampire/vampire-4.5.1/Kernel/ |
H A D | LiteralSelector.cpp | 232 unsigned eligible=1; in select() local 239 if(eligible!=i) { in select() 240 swap((*c)[i],(*c)[eligible]); in select() 243 eligible++; in select() 247 eligible=1; in select() 252 ASS_LE(eligible,eligibleInp); in select() 257 if(eligible==1) { in select() 258 c->setSelected(eligible); in select() 262 ASS_G(eligible,1); in select() 263 doSelection(c, eligible); in select() [all …]
|
H A D | ELiteralSelector.cpp | 43 for(int li=((int)eligible)-1; li>=0; li--) { in getMaximalsInOrder() 76 void ELiteralSelector::doSelection(Clause* c, unsigned eligible) in doSelection() argument 85 for(int li=((int)eligible)-1; li>=0; li--) { in doSelection() 94 for(int li=((int)eligible)-1; li>=0; li--) { in doSelection() 104 for(int li=((int)eligible)-1; li>=0; li--) { in doSelection() 116 for(int li=((int)eligible)-1; li>=0; li--) { in doSelection() 130 for(int li=((int)eligible)-1; li>=0; li--) { in doSelection() 145 for(int li=((int)eligible)-1; li>=0; li--) { in doSelection() 168 sel = getMaximalsInOrder(c,eligible); in doSelection() 174 ASS(li<eligible); in doSelection() [all …]
|
H A D | BestLiteralSelector.hpp | 77 void doSelection(Clause* c, unsigned eligible) override in doSelection() argument 83 for(unsigned i=1;i<eligible;i++) { in doSelection() 96 ensureSomeColoredSelected(c, eligible); in doSelection() 143 void doSelection(Clause* c, unsigned eligible) override in doSelection() argument 149 litArr.initFromArray(eligible,*c); in doSelection() 176 ASS_L(besti,eligible); in doSelection() 193 if(selCnt==eligible) { in doSelection() 198 c->setSelected(eligible); in doSelection() 217 ASS_LE(selCnt,eligible); in doSelection() 224 ASS_L(i,eligible); in doSelection() [all …]
|
H A D | SpassLiteralSelector.cpp | 37 LiteralList* SpassLiteralSelector::getMaximalsInOrder(Clause* c, unsigned eligible) in getMaximalsInOrder() argument 43 for(int li=((int)eligible)-1; li>=0; li--) { in getMaximalsInOrder() 52 void SpassLiteralSelector::doSelection(Clause* c, unsigned eligible) in doSelection() argument 59 maximals = getMaximalsInOrder(c,eligible); in doSelection() 69 for(int li=((int)eligible)-1; li>=0; li--) { in doSelection() 88 sel = getMaximalsInOrder(c,eligible); in doSelection() 94 ASS(li<eligible); in doSelection() 108 ensureSomeColoredSelected(c, eligible); in doSelection()
|
H A D | MaximalLiteralSelector.cpp | 37 void MaximalLiteralSelector::doSelection(Clause* c, unsigned eligible) in doSelection() argument 44 for(int li=((int)eligible)-1; li>=0; li--) { in doSelection() 51 for(int li=((int)eligible)-1; li>=0; li--) { in doSelection() 79 ASS(li<eligible); in doSelection() 93 ensureSomeColoredSelected(c, eligible); in doSelection()
|
H A D | LiteralSelector.hpp | 59 void select(Clause* c, unsigned eligible=0); 63 static void ensureSomeColoredSelected(Clause* c, unsigned eligible); 106 virtual void doSelection(Clause* c, unsigned eligible) = 0; 141 void doSelection(Clause* c, unsigned eligible) override;
|
/dports/net/libzmq2/zeromq-2.2.0/src/ |
H A D | dist.cpp | 32 eligible (0), in dist_t() 54 eligible++; in attach() 60 eligible++; in attach() 85 if (pipes.index (pipe_) < eligible) in terminated() 86 eligible--; in terminated() 96 pipes.swap (pipes.index (pipe_), eligible); in activated() 97 eligible++; in activated() 102 pipes.swap (eligible - 1, active); in activated() 117 active = eligible; in send() 193 pipes.swap (active, eligible - 1); in write() [all …]
|
/dports/www/owncloud/owncloud/apps/files_external/3rdparty/google/apiclient-services/src/Google/Service/CloudMemorystoreforMemcached/ |
H A D | GoogleCloudSaasacceleratorManagementProvidersV1SloEligibility.php | 20 public $eligible; variable in Google_Service_CloudMemorystoreforMemcached_GoogleCloudSaasacceleratorManagementProvidersV1SloEligibility 23 public function setEligible($eligible) argument 25 $this->eligible = $eligible; 29 return $this->eligible;
|
/dports/www/owncloud/owncloud/apps/files_external/3rdparty/google/apiclient-services/src/Google/Service/CloudFilestore/ |
H A D | GoogleCloudSaasacceleratorManagementProvidersV1SloEligibility.php | 20 public $eligible; variable in Google_Service_CloudFilestore_GoogleCloudSaasacceleratorManagementProvidersV1SloEligibility 23 public function setEligible($eligible) argument 25 $this->eligible = $eligible; 29 return $this->eligible;
|
/dports/www/owncloud/owncloud/apps/files_external/3rdparty/google/apiclient-services/src/Google/Service/ManagedServiceforMicrosoftActiveDirectoryConsumerAPI/ |
H A D | GoogleCloudSaasacceleratorManagementProvidersV1SloEligibility.php | 20 public $eligible; variable in Google_Service_ManagedServiceforMicrosoftActiveDirectoryConsumerAPI_GoogleCloudSaasacceleratorManagementProvidersV1SloEligibility 23 public function setEligible($eligible) argument 25 $this->eligible = $eligible; 29 return $this->eligible;
|
/dports/sysutils/py-python-nomad/python-nomad-1.2.1/nomad/api/ |
H A D | node.py | 152 def eligible_node(self, id, eligible=None, ineligible=None): argument 168 if eligible is not None and ineligible is not None: 170 if eligible is None and ineligible is None: 173 if eligible is not None and eligible: 175 elif eligible is not None and not eligible:
|
/dports/lang/parrot/parrot-8.1.0/ |
H A D | api.yaml | 18 eligible: '3.1' 25 eligible: '3.4' 29 eligible: '3.4' 38 eligible: '3.4' 50 eligible: '3.1' 59 eligible: '2.7' 90 eligible: '2.4' 99 eligible: '1.1' 107 eligible: '3.1' 124 eligible: '3.1' [all …]
|
/dports/math/R-cran-FrF2/FrF2/R/ |
H A D | blockpick.R | 75 if (alias.block.2fis) {banned <- hilf$main; eligible <- c(fi2cols, hilf$freecols)} vector 76 else {banned <- c(hilf$main,fi2cols); eligible <- hilf$freecols} 77 if (length(eligible)<2^k.block-1 & !alias.block.2fis) 79 if (length(eligible)<2^k.block-1) stop("no adequate block design found") 81 perm <- t(combn(length(eligible),k.block)) ## rows are possible selections of k.block 83 if (g==0 & !alias.block.2fis) if (!all(bcols %in% eligible)) 85 perm <- matrix(which(eligible %in% bcols),nrow=1) 88 hilf <- digitsBase(eligible,ndigits=k) ## always k rows 111 bg <- eligible[perm[1,]] ## block generators 122 last <- which(apply(perm,1,function(obj) all(eligible[obj] %in% bcols)))
|
/dports/devel/fbthrift/fbthrift-2021.12.27.00/thrift/compiler/lib/cpp2/ |
H A D | util.cc | 179 enum class eligible { unknown, yes, no }; in operator ()() enum 183 return it->second ? eligible::yes : eligible::no; in operator ()() 200 return eligible::unknown; in operator ()() 203 return result ? eligible::yes : eligible::no; in operator ()() 206 if (result != eligible::unknown) { in operator ()() 207 return result == eligible::yes; in operator ()() 210 result = eligible::yes; in operator ()() 213 if (result == eligible::no) { in operator ()() 216 result = eligible::no; in operator ()() 223 result = eligible::yes; in operator ()() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/components/domain_reliability/ |
H A D | dispatcher.cc | 30 bool eligible; member 42 eligible(false) {} in Task() 85 DCHECK(task->eligible); in RunEligibleTasks() 103 DCHECK(!task->eligible); in MakeTaskWaiting() 114 DCHECK(!task->eligible); in MakeTaskEligible() 115 task->eligible = true; in MakeTaskEligible() 127 if (task->eligible) in RunAndDeleteTask()
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/components/domain_reliability/ |
H A D | dispatcher.cc | 30 bool eligible; member 42 eligible(false) {} in Task() 85 DCHECK(task->eligible); in RunEligibleTasks() 103 DCHECK(!task->eligible); in MakeTaskWaiting() 114 DCHECK(!task->eligible); in MakeTaskEligible() 115 task->eligible = true; in MakeTaskEligible() 127 if (task->eligible) in RunAndDeleteTask()
|
/dports/math/cvc4/CVC4-1.7/src/preprocessing/passes/ |
H A D | miplib_trick.cpp | 225 bool eligible = true; in applyInternal() local 237 eligible = false; in applyInternal() 244 eligible = false; in applyInternal() 251 eligible = false; in applyInternal() 261 eligible = false; in applyInternal() 299 if (!eligible) in applyInternal() 305 eligible = false; in applyInternal() 336 eligible = false; in applyInternal() 378 eligible = false; in applyInternal() 420 if (eligible) in applyInternal() [all …]
|
/dports/www/trac-devel/Trac-1.5.3/tracopt/versioncontrol/svn/ |
H A D | svn_prop.py | 236 eligible -= set(Ranges(revs)) 239 eligible -= set(Ranges(blocked)) 240 if eligible: 241 node = repos.get_node(spath, max(eligible)) 244 eligible = to_ranges(eligible) 246 spath, eligible)) 258 changed_nodes = [(node, min(eligible)) 262 for spath, node, eligible, row in eligible_infos: 264 eligible &= set(changed_revs[spath]) 266 eligible.clear() [all …]
|
/dports/mail/alpine/alpine-465e23b/alpine/ |
H A D | busy.c | 254 int arrsize, eligible, pick_this_one, i, j; in busy_cue() local 259 for(eligible = i = 0; i < arrsize; i++) in busy_cue() 261 eligible++; in busy_cue() 263 if(eligible == 0) /* reset */ in busy_cue() 264 for(eligible = i = 0; i < arrsize; i++){ in busy_cue() 266 eligible++; in busy_cue() 269 if(eligible > 0){ /* it will be */ in busy_cue() 270 pick_this_one = random() % eligible; in busy_cue()
|
/dports/editors/pico-alpine/alpine-465e23b/alpine/ |
H A D | busy.c | 254 int arrsize, eligible, pick_this_one, i, j; in busy_cue() local 259 for(eligible = i = 0; i < arrsize; i++) in busy_cue() 261 eligible++; in busy_cue() 263 if(eligible == 0) /* reset */ in busy_cue() 264 for(eligible = i = 0; i < arrsize; i++){ in busy_cue() 266 eligible++; in busy_cue() 269 if(eligible > 0){ /* it will be */ in busy_cue() 270 pick_this_one = random() % eligible; in busy_cue()
|
/dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/mysql-test/suite/rocksdb/r/ |
H A D | covered_unpack_info_format.result | 31 # Not eligible for optimization, access via fake_id of big row. 35 include/assert.inc [Not eligible for optimization, access via fake_id of big row.: 0 rocksdb_covere… 63 # No longer eligible for optimization since no covered bitmap was stored. 67 include/assert.inc [No longer eligible for optimization since no covered bitmap was stored.: 0 rock… 68 # Not eligible for optimization. 72 include/assert.inc [Not eligible for optimization.: 0 rocksdb_covered_secondary_key_lookups]
|
/dports/databases/percona57-server/percona-server-5.7.36-39/mysql-test/suite/rocksdb/r/ |
H A D | covered_unpack_info_format.result | 31 # Not eligible for optimization, access via fake_id of big row. 35 include/assert.inc [Not eligible for optimization, access via fake_id of big row.: 0 rocksdb_covere… 63 # No longer eligible for optimization since no covered bitmap was stored. 67 include/assert.inc [No longer eligible for optimization since no covered bitmap was stored.: 0 rock… 68 # Not eligible for optimization. 72 include/assert.inc [Not eligible for optimization.: 0 rocksdb_covered_secondary_key_lookups]
|
/dports/databases/percona57-client/percona-server-5.7.36-39/mysql-test/suite/rocksdb/r/ |
H A D | covered_unpack_info_format.result | 31 # Not eligible for optimization, access via fake_id of big row. 35 include/assert.inc [Not eligible for optimization, access via fake_id of big row.: 0 rocksdb_covere… 63 # No longer eligible for optimization since no covered bitmap was stored. 67 include/assert.inc [No longer eligible for optimization since no covered bitmap was stored.: 0 rock… 68 # Not eligible for optimization. 72 include/assert.inc [Not eligible for optimization.: 0 rocksdb_covered_secondary_key_lookups]
|