/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/util/qparse/ |
H A D | query_tree_print.cpp | 62 if (qnode.IsNot()) { in PrintElement() 68 if (!qnode.IsExplicit()) { in PrintElement() 98 switch (qnode.GetType()) { in operator ()() 100 PrintElement(qnode.GetStrValue(), qnode); in operator ()() 103 PrintElement('"' + qnode.GetStrValue() + '"', qnode); in operator ()() 106 PrintElement(NStr::Int8ToString(qnode.GetInt()) + "L", qnode); in operator ()() 109 PrintElement(NStr::DoubleToString(qnode.GetDouble()) + "F", qnode); in operator ()() 112 PrintElement(NStr::BoolToString(qnode.GetBool()), qnode); in operator ()() 115 PrintElement(qnode.GetStrValue() + "()", qnode); in operator ()() 160 if (qnode.IsNot()) { in operator ()() [all …]
|
H A D | lexer.inc | 295 *lvalp = qnode = 309 *lvalp = qnode = 342 *lvalp = qnode = 371 *lvalp = qnode = 392 *lvalp = qnode = 410 *lvalp = qnode = 429 *lvalp = qnode = 448 *lvalp = qnode = 466 *lvalp = qnode = 484 *lvalp = qnode = [all …]
|
H A D | query_exec.cpp | 44 void CQueryFunctionBase::MakeArgVector(CQueryParseTree::TNode& qnode, in MakeArgVector() argument 48 CTreeNode<CQueryParseNode>::TNodeList_I it = qnode.SubNodeBegin(); in MakeArgVector() 49 CTreeNode<CQueryParseNode>::TNodeList_I it_end = qnode.SubNodeEnd(); in MakeArgVector() 58 CQueryFunctionBase::GetArg0(CQueryParseTree::TNode& qnode) in GetArg0() argument 60 CTreeNode<CQueryParseNode>::TNodeList_I it = qnode.SubNodeBegin(); in GetArg0() 61 CTreeNode<CQueryParseNode>::TNodeList_I it_end = qnode.SubNodeEnd(); in GetArg0()
|
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/db/bdb/ |
H A D | bdb_query.cpp | 71 m_NodeType = qnode.m_NodeType; in CBDB_QueryNode() 72 m_Value = qnode.m_Value; in CBDB_QueryNode() 74 m_NotFlag = qnode.m_NotFlag; in CBDB_QueryNode() 80 m_NodeType = qnode.m_NodeType; in operator =() 81 m_Value = qnode.m_Value; in operator =() 83 m_NotFlag = qnode.m_NotFlag; in operator =() 233 if (qnode.HasValue()) { in operator ()() 564 SetResult(qnode, res); in Eval() 697 qnode.SetValue("1"); in Eval() 730 qnode.SetValue("0"); in Eval() [all …]
|
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/include/util/qparse/ |
H A D | query_exec_bv.hpp | 107 TBVContainer* c = this->GetContainer(qnode); in MakeContainer() 117 BV* ArgToRes(CQueryParseTree::TNode& qnode, in ArgToRes() argument 124 bv_cont = this->MakeContainer(qnode); in ArgToRes() 203 virtual void Evaluate(CQueryParseTree::TNode& qnode) in Evaluate() argument 206 this->MakeArgVector(qnode, args); in Evaluate() 217 bv_res = this->ArgToRes(qnode, args[0]); in Evaluate() 239 virtual void Evaluate(CQueryParseTree::TNode& qnode) in Evaluate() argument 242 this->MakeArgVector(qnode, args); in Evaluate() 249 bv_res = this->ArgToRes(qnode, args[0]); in Evaluate() 291 this->MakeArgVector(qnode, args); in Evaluate() [all …]
|
H A D | query_exec.hpp | 86 virtual void Evaluate(CQueryParseTree::TNode& qnode) = 0; 98 void MakeArgVector(CQueryParseTree::TNode& qnode, 103 CQueryParseTree::TNode* GetArg0(CQueryParseTree::TNode& qnode); 258 CQueryParseNode& qnode = tr.GetValue(); in operator ()() local 259 CQueryParseNode::EType func_type = qnode.GetType(); in operator ()() 277 qnode.SetElapsed(sw.Elapsed()); in operator ()() 290 if (qnode.IsValue()) { in operator ()() 303 if (qnode.IsValue()) { in operator ()() 307 "Query execution failed. Unknown function:" + qnode.GetOrig()); in operator ()() 314 qnode.SetElapsed(sw.Elapsed()); in operator ()()
|
/dports/science/PETSc/petsc-3.14.1/src/contrib/fun3d/comp/ |
H A D | user.F | 208 qnode(5,k) = qnode(1,k)*Twall/ggm1 3403 dq1 = weight*(qnode(1,node2) - qnode(1,node1)) 3404 dq2 = weight*(qnode(2,node2) - qnode(2,node1)) 3405 dq3 = weight*(qnode(3,node2) - qnode(3,node1)) 3406 dq4 = weight*(qnode(4,node2) - qnode(4,node1)) 3407 dq5 = weight*(qnode(5,node2) - qnode(5,node1)) 3464 dq1 = weight*(qnode(1,node1) - qnode(1,node2)) 3465 dq2 = weight*(qnode(2,node1) - qnode(2,node2)) 3466 dq3 = weight*(qnode(3,node1) - qnode(3,node2)) 3467 dq4 = weight*(qnode(4,node1) - qnode(4,node2)) [all …]
|
H A D | flow.c | 88 PetscScalar *qnode; in main() local 237 ierr = VecGetArray(user.grid->qnode, &qnode);CHKERRQ(ierr); in main() 250 qnode, in main() 269 ierr = VecRestoreArray(user.grid->qnode, &qnode);CHKERRQ(ierr); in main() 308 ierr = VecGetArray(grid->qnode,&qnode);CHKERRQ(ierr); in FormInitialGuess() 311 ierr = VecRestoreArray(grid->qnode,&qnode);CHKERRQ(ierr); in FormInitialGuess() 2247 PetscScalar *qnode; in WriteRestartFile() local 2344 …mach = PetscSqrtReal((qnode[in+1]*qnode[in+1]+qnode[in+2]*qnode[in+2]+qnode[in+3]*qnode[in+3])/((p… in WriteRestartFile() 2350 fprintf(fptr1,"%g %g %g\n",qnode[in+1],qnode[in+2],qnode[in+3]); in WriteRestartFile() 2375 …mach = PetscSqrtReal((qnode[in+1]*qnode[in+1]+qnode[in+2]*qnode[in+2]+qnode[in+3]*qnode[in+3])/((p… in WriteRestartFile() [all …]
|
/dports/www/yt-dlp/yt-dlp-2021.12.27/yt_dlp/extractor/ |
H A D | noz.py | 53 for qnode in doc.findall(compat_xpath('.//article/movie/file/qualities/qual')): 55 qnode, './html_urls/video_url', 'format', 'video/mp4') 60 'format_name': xpath_text(qnode, './name'), 61 'format_id': '%s-%s' % ('http', xpath_text(qnode, './id')), 62 'height': int_or_none(xpath_text(qnode, './height')), 63 'width': int_or_none(xpath_text(qnode, './width')), 64 'tbr': int_or_none(xpath_text(qnode, './bitrate'), scale=1000), 67 f4m_url = xpath_text(qnode, 'url_hd2') 73 qnode, './html_urls/video_url',
|
/dports/www/youtube_dl/youtube-dl/youtube_dl/extractor/ |
H A D | noz.py | 53 for qnode in doc.findall(compat_xpath('.//article/movie/file/qualities/qual')): 55 qnode, './html_urls/video_url', 'format', 'video/mp4') 60 'format_name': xpath_text(qnode, './name'), 61 'format_id': '%s-%s' % ('http', xpath_text(qnode, './id')), 62 'height': int_or_none(xpath_text(qnode, './height')), 63 'width': int_or_none(xpath_text(qnode, './width')), 64 'tbr': int_or_none(xpath_text(qnode, './bitrate'), scale=1000), 67 f4m_url = xpath_text(qnode, 'url_hd2') 73 qnode, './html_urls/video_url',
|
/dports/devel/vcglib/vcglib-2020.09/vcg/space/index/kdtree/ |
H A D | kdtree.h | 225 Node& node = mNodes[qnode.nodeId]; in doQueryK() 261 mNodeStack[count].sq = qnode.sq; in doQueryK() 263 qnode.sq = new_off*new_off; in doQueryK() 293 Node & node = mNodes[qnode.nodeId]; in doQueryDist() 295 if (qnode.sq < sqrareDist) in doQueryDist() 325 mNodeStack[count].sq = qnode.sq; in doQueryDist() 326 qnode.sq = new_off*new_off; in doQueryDist() 359 Node & node = mNodes[qnode.nodeId]; in doQueryClosest() 361 if (qnode.sq < minDist) in doQueryClosest() 391 mNodeStack[count].sq = qnode.sq; in doQueryClosest() [all …]
|
H A D | kdtree_face.h | 145 QueryNode& qnode = mNodeStack[count - 1]; in GetClosest() local 146 Node& node = mNodes[qnode.nodeId]; in GetClosest() 148 if (qnode.sq < minDist) in GetClosest() 182 qnode.nodeId = node.firstChildId + 1; in GetClosest() 188 qnode.nodeId = node.firstChildId; in GetClosest() 191 mNodeStack[count].sq = qnode.sq; in GetClosest() 192 qnode.sq = new_off; in GetClosest() 198 qnode.nodeId = node.firstChildId; in GetClosest() 200 qnode.nodeId = node.firstChildId + 1; in GetClosest()
|
/dports/graphics/wdune/wdune-1.926/vcglib/vcg/space/index/kdtree/ |
H A D | kdtree.h | 225 Node& node = mNodes[qnode.nodeId]; in doQueryK() 261 mNodeStack[count].sq = qnode.sq; in doQueryK() 263 qnode.sq = new_off*new_off; in doQueryK() 293 Node & node = mNodes[qnode.nodeId]; in doQueryDist() 295 if (qnode.sq < sqrareDist) in doQueryDist() 325 mNodeStack[count].sq = qnode.sq; in doQueryDist() 326 qnode.sq = new_off*new_off; in doQueryDist() 359 Node & node = mNodes[qnode.nodeId]; in doQueryClosest() 361 if (qnode.sq < minDist) in doQueryClosest() 391 mNodeStack[count].sq = qnode.sq; in doQueryClosest() [all …]
|
H A D | kdtree_face.h | 97 QueryNode& qnode = mNodeStack[count - 1]; variable 98 Node& node = mNodes[qnode.nodeId]; 100 if (qnode.sq < minDist) 134 qnode.nodeId = node.firstChildId + 1; 140 qnode.nodeId = node.firstChildId; 143 mNodeStack[count].sq = qnode.sq; 144 qnode.sq = new_off; 150 qnode.nodeId = node.firstChildId; 152 qnode.nodeId = node.firstChildId + 1;
|
/dports/security/unicornscan/unicornscan-0.4.2/src/unilib/ |
H A D | qfifo.c | 35 typedef struct qnode { struct 36 struct qnode *last; argument 37 struct qnode *next; argument 39 } qnode; typedef 46 qnode *top; 47 qnode *bottom; 105 qnode *qnew=NULL; in fifo_push() 111 qnew=(qnode *)MALLOC(sizeof(qnode)); in fifo_push() 289 qnode *cur=NULL; in fifo_find() 331 qnode *cur=NULL; in fifo_order() [all …]
|
/dports/graphics/embree/embree-3.13.2/kernels/geometry/ |
H A D | subgrid.h | 337 qnode.clear(); in clear() 361 qnode.init_dim(node); in SubGridQBVHN() 378 typename BVHN<N>::QuantizedBaseNode qnode; member 388 cout << "lowerX " << sg.qnode.dequantizeLowerX() << embree_endl; 389 cout << "upperX " << sg.qnode.dequantizeUpperX() << embree_endl; 390 cout << "lowerY " << sg.qnode.dequantizeLowerY() << embree_endl; 391 cout << "upperY " << sg.qnode.dequantizeUpperY() << embree_endl; 432 qnode.clear(); in clear() 463 qnode.node0.init_dim(node0); in SubGridMBQBVHN() 464 qnode.node1.init_dim(node1); in SubGridMBQBVHN() [all …]
|
H A D | subgrid_intersector.h | 64 size_t mask = isec1.intersect(&prim[i].qnode,tray,dist); in intersect() 87 size_t mask = isec1.intersect(&prim[i].qnode,tray,dist); in occluded() 166 size_t mask = isec1.intersect(&prim[i].qnode,tray,dist); in intersect() 189 size_t mask = isec1.intersect(&prim[i].qnode,tray,dist); in occluded() 298 size_t m_valid = movemask(prim[j].qnode.validMask()); in intersect() 316 size_t m_valid = movemask(prim[j].qnode.validMask()); in occluded() 337 size_t mask = isec1.intersect(&prim[i].qnode,tray,dist); in intersect() 357 size_t mask = isec1.intersect(&prim[i].qnode,tray,dist); in occluded() 444 size_t m_valid = movemask(prim[j].qnode.validMask()); in intersect() 462 size_t m_valid = movemask(prim[j].qnode.validMask()); in occluded() [all …]
|
/dports/misc/rump/buildrump.sh-b914579/src/lib/libc/gen/ |
H A D | sysctlgetmibinfo.c | 133 struct sysctlnode *h, *i, *o, qnode; in relearnhead() local 154 memset(&qnode, 0, sizeof(qnode)); in relearnhead() 155 qnode.sysctl_flags = SYSCTL_VERSION; in relearnhead() 159 rc = sysctl(&name, 1, h, &so, &qnode, sizeof(qnode)); in relearnhead() 277 struct sysctlnode qnode; in __learn_tree() local 301 memset(&qnode, 0, sizeof(qnode)); in __learn_tree() 302 qnode.sysctl_flags = SYSCTL_VERSION; in __learn_tree() 304 &qnode, sizeof(qnode)); in __learn_tree() 325 &qnode, sizeof(qnode)); in __learn_tree()
|
/dports/sysutils/liburcu/userspace-rcu-0.13.0/doc/examples/wfcqueue/ |
H A D | cds_wfcq_dequeue.c | 64 struct cds_wfcq_node *qnode; in main() local 67 qnode = cds_wfcq_dequeue_blocking(&myqueue_head, &myqueue_tail); in main() 68 if (!qnode) { in main() 72 node = caa_container_of(qnode, struct mynode, node); in main()
|
H A D | cds_wfcq_enqueue.c | 37 struct cds_wfcq_node *qnode; in main() local 64 __cds_wfcq_for_each_blocking(&myqueue_head, &myqueue_tail, qnode) { in main() 66 caa_container_of(qnode, struct mynode, node); in main()
|
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/util/qparse/test/ |
H A D | test_qparse.cpp | 81 CQueryParseNode& qnode = tr.GetValue(); in operator ()() local 93 IQueryParseUserObject* uo = qnode.GetUserObject(); in operator ()() 100 qnode.SetUserObject(eval_res); in operator ()() 106 switch (qnode.GetType()) { in operator ()() 113 const string& v = qnode.GetStrValue(); in operator ()() 118 res = qnode.GetInt(); in operator ()() 121 res = (int)qnode.GetDouble(); in operator ()() 124 res = qnode.GetBool(); in operator ()() 181 if (qnode.IsNot()) { in operator ()()
|
/dports/sysutils/liburcu/userspace-rcu-0.13.0/doc/examples/rculfqueue/ |
H A D | cds_lfq_dequeue.c | 86 struct cds_lfq_node_rcu *qnode; in main() local 94 qnode = cds_lfq_dequeue_rcu(&myqueue); in main() 96 if (!qnode) { in main() 100 node = caa_container_of(qnode, struct mynode, node); in main()
|
/dports/www/p5-HTML5-DOM/HTML5-DOM-1.25/third_party/modest/source/myhtml/ |
H A D | parser.c | 25 mythread_queue_node_t *qnode = (mythread_queue_node_t*)ctx; in myhtml_parser_stream() local 27 …if((((myhtml_tree_t*)(qnode->context))->parse_flags & MyHTML_TREE_PARSE_FLAGS_WITHOUT_BUILD_TREE) … in myhtml_parser_stream() 28 while(myhtml_rules_tree_dispatcher(qnode->context, qnode->args)){} in myhtml_parser_stream() 187 mythread_queue_node_t *qnode = (mythread_queue_node_t*)ctx; in myhtml_parser_worker() local 189 myhtml_tree_t* tree = qnode->context; in myhtml_parser_worker() 190 myhtml_token_node_t* token = qnode->args; in myhtml_parser_worker() 301 mythread_queue_node_t *qnode = (mythread_queue_node_t*)ctx; in myhtml_parser_worker_stream() local 303 myhtml_parser_worker(thread_id, qnode); in myhtml_parser_worker_stream() 304 myhtml_parser_stream(thread_id, qnode); in myhtml_parser_worker_stream()
|
/dports/net/mpich/mpich-3.4.3/modules/izem/src/lock/ |
H A D | zm_hmpr.c | 36 ret = zm_wskip_wait(L->waitq, &N->qnode); in zm_hmpr_acquire() 54 ret = zm_wskip_wake(L->waitq, N->qnode); in zm_hmpr_release() 62 if ((N->p == 0) && (N->qnode != NULL)) in zm_hmpr_raise_prio() 63 return zm_wskip_skip(N->qnode); in zm_hmpr_raise_prio()
|
/dports/net/netatalk3/netatalk-3.1.12/include/atalk/ |
H A D | queue.h | 26 typedef struct qnode { struct 27 struct qnode *prev; argument 28 struct qnode *next; argument
|