| /dports/math/jags/JAGS-4.3.0/src/modules/mix/samplers/ |
| H A D | DirichletCat.cc | 44 vector<StochasticNode *> const &snodes = gv->nodes(); in makeParMap() local
46 unsigned int N = snodes[0]->length(); in makeParMap()
47 for (unsigned int i = 0; i < snodes.size(); ++i) { in makeParMap()
48 if (snodes[i]->length() != N) { in makeParMap()
51 parmap[snodes[i]] = vector<double>(N); in makeParMap()
61 vector<StochasticNode*> snodes = gv->nodes(); in canSample() local
63 if (isBounded(snodes[i])) return false; in canSample()
64 if (snodes[i]->distribution()->name() != "ddirch") in canSample()
71 sset.insert(snodes[i]); in canSample()
72 dset.insert(snodes[i]); in canSample()
[all …]
|
| H A D | NormMix.cc | 64 for (unsigned int j = 0; j < snodes.size(); ++j) { in NormMix()
65 unsigned int length_j = snodes[j]->length(); in NormMix()
66 if (isDirch(snodes[j])) { in NormMix()
77 snodes[j]->support(lp, up, length_j, chain); in NormMix()
149 if (snodes.empty()) in canSample()
152 for (unsigned int i = 0; i < snodes.size(); ++i) { in canSample()
153 if (snodes[i]->isDiscreteValued()) { in canSample()
161 if (!isSupportFixed(snodes[i])) { in canSample()
165 if (isDirch(snodes[i])) { in canSample()
170 if (!snodes[i]->parents()[0]->isFixed()) { in canSample()
[all …]
|
| H A D | CatDirichlet.cc | 40 vector<StochasticNode*> const &snodes = _gv->nodes(); in update() local
43 for (unsigned int i = 0; i < snodes.size(); ++i) { in update()
45 int index = static_cast<int>(*snodes[i]->value(_chain)) - 1; in update()
|
| H A D | DirichletCatFactory.cc | 59 DirichletCatFactory::makeSampler(vector<StochasticNode*> const &snodes, in makeSampler() argument
62 GraphView *gv = new GraphView(snodes, graph); in makeSampler()
64 unsigned int nchain = snodes[0]->nchain(); in makeSampler()
|
| /dports/lang/kawa/kawa-3.1.1/gnu/xquery/util/ |
| H A D | RelativeStepFilter.java | 22 SortedNodes snodes; field in RelativeStepFilter
58 if (snodes == null) in writePosition()
59 snodes = new SortedNodes(); in writePosition()
60 snodes.writePosition(seq, ipos); in writePosition()
65 if (snodes != null) in finish()
66 snodes.consume(base); in finish()
67 snodes = null; in finish()
|
| /dports/math/jags/JAGS-4.3.0/src/modules/dic/ |
| H A D | WAICMonitor.cc | 26 WAICMonitor::WAICMonitor(vector<StochasticNode const *> const &snodes) in WAICMonitor() argument
27 : Monitor("mean", toNodeVec(snodes)), _snodes(snodes), in WAICMonitor()
28 _nchain(snodes[0]->nchain()), in WAICMonitor()
29 _mlik(_nchain, vector<double>(snodes.size(), 0)), in WAICMonitor()
30 _vlik(_nchain, vector<double>(snodes.size(), 0)), in WAICMonitor()
31 _values(snodes.size(), 0), in WAICMonitor()
|
| H A D | PDTraceFactory.cc | 37 vector<StochasticNode *> const &snodes = model->stochasticNodes(); in getMonitor() local
38 for (unsigned int i = 0; i < snodes.size(); ++i) { in getMonitor()
39 if (snodes[i]->isFixed()) { in getMonitor()
40 observed_nodes.push_back(snodes[i]); in getMonitor()
42 if (!isSupportFixed(snodes[i])) { in getMonitor()
|
| H A D | PDMonitorFactory.cc | 41 vector<StochasticNode *> const &snodes = model->stochasticNodes(); in getMonitor() local
42 for (unsigned int i = 0; i < snodes.size(); ++i) { in getMonitor()
43 if (snodes[i]->isFixed()) { in getMonitor()
44 if (isSupportFixed(snodes[i])) { in getMonitor()
45 observed_nodes.push_back(snodes[i]); in getMonitor()
|
| H A D | PDMonitor.cc | 25 PDMonitor::PDMonitor(vector<StochasticNode const *> const &snodes, in PDMonitor() argument
28 : Monitor("mean", toNodeVec(snodes)), _snodes(snodes), _rngs(rngs), in PDMonitor()
30 _values(snodes.size(), 0), _weights(snodes.size(), 0), in PDMonitor()
|
| H A D | DevianceTrace.cc | 25 snodes) in DevianceTrace()
26 : Monitor("trace", toNode(snodes)), _values(snodes[0]->nchain()), in DevianceTrace()
27 _snodes(snodes) in DevianceTrace()
|
| H A D | DevianceMonitorFactory.cc | 33 vector<StochasticNode *> const &snodes = model->stochasticNodes(); in getMonitor() local
35 for (unsigned int i = 0; i < snodes.size(); ++i) { in getMonitor()
36 if (snodes[i]->isFixed()) { in getMonitor()
37 observed_snodes.push_back(snodes[i]); in getMonitor()
|
| H A D | WAICMonitorFactory.cc | 29 vector<StochasticNode *> const &snodes = model->stochasticNodes(); in getMonitor() local
30 for (vector<StochasticNode *>::const_iterator p = snodes.begin(); in getMonitor()
31 p != snodes.end(); ++p) in getMonitor()
|
| H A D | PDTrace.cc | 24 PDTrace::PDTrace(vector<StochasticNode const *> const &snodes, in PDTrace() argument
26 : Monitor("trace", toNodeVec(snodes)), in PDTrace()
27 _snodes(snodes), _rngs(rngs), _nrep(nrep), in PDTrace()
|
| H A D | PoptMonitor.cc | 14 PoptMonitor::PoptMonitor(vector<StochasticNode const *> const &snodes, in PoptMonitor() argument
16 : PDMonitor(snodes, rngs, nrep, 2.0) in PoptMonitor()
|
| /dports/math/jags/JAGS-4.3.0/src/lib/sampler/ |
| H A D | Linear.cc | 41 bool checkAdditive(vector<StochasticNode*> const &snodes, in checkAdditive() argument
46 for (unsigned int i = 0; i < snodes.size(); ++i) { in checkAdditive()
47 SingletonGraphView sgv(snodes[i], graph); in checkAdditive()
61 ancestors.insert(snodes.begin(), snodes.end()); in checkAdditive()
65 snodes.begin(); p != snodes.end(); ++p) in checkAdditive()
71 GraphView gv(snodes, graph); in checkAdditive()
|
| /dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/src/3rdparty/adaptagrams/libcola/ |
| H A D | cola.cpp | 485 vector<straightener::Node*> snodes; in straighten() local
518 total_length+=snodes[u]->euclidean_distance(snodes[v]); in straighten()
528 *snodes[u],*snodes[v],*snodes[b],-potBendWeight)); in straighten()
537 *snodes[u],*snodes[v],*snodes[b],-bendWeight)); in straighten()
542 SparseMap Q(snodes.size()); in straighten()
571 gp->straighten(&sparseQ,cs,snodes); in straighten()
575 for(unsigned i=0;i<snodes.size();i++) { in straighten()
576 snodes[i]->pos[dim] = r[i]; in straighten()
579 sedges[i]->createRouteFromPath(snodes); in straighten()
594 for(unsigned i=0;i<snodes.size();i++) { in straighten()
[all …]
|
| /dports/math/jags/JAGS-4.3.0/src/modules/bugs/samplers/ |
| H A D | SumMethod.cc | 123 bool SumMethod::canSample(vector<StochasticNode*> const &snodes, in canSample() argument
127 StochasticNode *sumchild = isCandidate(snodes[0], graph); in canSample()
129 for (unsigned int i = 1; i < snodes.size(); ++i) { in canSample()
130 if (isCandidate(snodes[i], graph) != sumchild) return false; in canSample()
135 for (unsigned int i = 1; i < snodes.size(); ++i) { in canSample()
136 if (snodes[i]->isDiscreteValued() != discrete) return false; in canSample()
141 GraphView gv(snodes, graph, true); in canSample()
170 for (unsigned int i = 0; i < snodes.size(); ++i) { in canSample()
171 lgraph.insert(snodes[i]); in canSample()
174 return checkAdditive(snodes, lgraph, true); in canSample()
|
| /dports/math/jags/JAGS-4.3.0/src/modules/glm/samplers/ |
| H A D | GLMMethod.cc | 55 vector<StochasticNode *> const &snodes = _view->nodes(); in calDesign() local
84 for (unsigned int i = 0; i < snodes.size(); ++i) { in calDesign()
86 unsigned int length = snodes[i]->length(); in calDesign()
97 double const *xold = snodes[i]->value(_chain); in calDesign()
219 vector<StochasticNode*> const &snodes = _view->nodes(); in symbolic() local
220 for (vector<StochasticNode*>::const_iterator p = snodes.begin(); in symbolic()
221 p != snodes.end(); ++p) in symbolic()
282 vector<StochasticNode*> const &snodes = _view->nodes(); in calCoef() local
283 for (vector<StochasticNode*>::const_iterator p = snodes.begin(); in calCoef()
284 p != snodes.end(); ++p) in calCoef()
|
| /dports/math/octave-forge-msh/msh/inst/ |
| H A D | msh3e_surface_mesh.m | 23 ## @deftypefn {Function File} {[@var{emesh},@var{snodes},@var{ssides},@var{striangles}]} = @
29 ## Return the vector @var{snodes} containing the references to input
40 function [emesh,snodes,ssides,striangles] = msh3e_surface_mesh(mesh,nsrf,nsides)
61 [snodes,ii,jj] = unique(tmp);
62 nds = 1:length(snodes);
66 points = mesh.p(:,snodes);
95 [tmp1, nds, tmp2] = intersect(snodes,enodes);
|
| /dports/math/py-graphillion/Graphillion-1.3/src/subsetting/dd/ |
| H A D | DdBuilder.hpp | 261 MyList<SpecNode> &snodes = snodeTable[i]; in construct() local
272 t != snodes.end(); ++t) { in construct()
308 for (; !snodes.empty(); snodes.pop_front()) { in construct()
309 SpecNode* p = snodes.front(); in construct()
542 t != snodes.end(); ++t) { in construct()
609 for (; !snodes.empty(); snodes.pop_front()) { in construct()
1081 mm += snodes.size(); in subset()
1404 MyList<SpecNode> &snodes = snodeTable[i]; in dumpStep() local
1405 size_t const m = snodes.size(); in dumpStep()
1412 assert(!snodes.empty()); in dumpStep()
[all …]
|
| /dports/net/frr7-pythontools/frr-frr-7.5.1/tools/ |
| H A D | gen_northbound_callbacks.c | 125 struct list *snodes; in generate_callback_name() local
128 snodes = list_new(); in generate_callback_name()
136 listnode_add_head(snodes, snode); in generate_callback_name()
140 for (ALL_LIST_ELEMENTS_RO(snodes, ln, snode)) { in generate_callback_name()
145 list_delete(&snodes); in generate_callback_name()
|
| /dports/net/frr7/frr-frr-7.5.1/tools/ |
| H A D | gen_northbound_callbacks.c | 125 struct list *snodes; in generate_callback_name() local
128 snodes = list_new(); in generate_callback_name()
136 listnode_add_head(snodes, snode); in generate_callback_name()
140 for (ALL_LIST_ELEMENTS_RO(snodes, ln, snode)) { in generate_callback_name()
145 list_delete(&snodes); in generate_callback_name()
|
| /dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/lib/atc/ |
| H A D | SchrodingerSolver.cpp | 175 int snodes = slice.size(); in solve() local
179 if (nfixed != snodes) { in solve()
184 evals1.reset(snodes,1); in solve()
185 evecs1.reset(snodes,snodes); in solve()
188 for (int j = 0; j < snodes; j++) eindex.insert(iEVal++); in solve()
191 for (int j = 0; j < snodes; j++) eindex.insert(j); in solve()
194 n1.reset(snodes,1); in solve()
202 aveE_f /= snodes; in solve()
209 for (int mode = 0; mode < snodes-nfixed; mode++) { in solve()
|
| /dports/biology/treepuzzle/tree-puzzle-5.2/src/ |
| H A D | treesort.c | 133 int *snodes; in initctree() local
136 snodes = (int *) calloc((size_t) (4 * 2 * Maxspc), sizeof(int)); in initctree()
137 if (snodes == NULL) maerror("snodes in copytree"); in initctree()
140 snodes[n]=-1; in initctree()
142 return snodes; in initctree()
149 void freectree(int **snodes) in freectree() argument
151 free(*snodes); in freectree()
152 *snodes = NULL; in freectree()
|
| /dports/net/cjdns/cjdns-cjdns-v21.1/subnode/ |
| H A D | SupernodeHunter_admin.c | 105 struct Address** snodes; in listSnodes() local
106 int count = SupernodeHunter_listSnodes(ctx->snh, &snodes, requestAlloc); in listSnodes()
109 List_addString(snodeList, Key_stringify(snodes[i]->key, requestAlloc), requestAlloc); in listSnodes()
|