/dports/math/ogdf/OGDF/src/ogdf/planarity/ |
H A D | EmbedderMinDepth.cpp | 155 spqrTrees[bT] = new StaticSPQRTree(blockG[bT]); in computeBlockGraphs() 200 nodeLength[bT].init(blockG[bT], 0); in bottomUpTraversal() 249 M_B[bT].pushBack(pBCTree->cutVertex(cT, bT)); in topDownTraversal() 253 M_B[bT].pushBack(pBCTree->cutVertex(cT, bT)); in topDownTraversal() 325 nodeLength[bT][nH_to_nBlockEmbedding[bT][*(M_B[bT].begin())]] = 0; in topDownTraversal() 356 nodeLength[bT][nH_to_nBlockEmbedding[bT][*(M_B[bT].begin())]] = 1; in topDownTraversal() 421 nodeLength[bT][nH_to_nBlockEmbedding[bT][*(M_B[bT].begin())]] = 0; in topDownTraversal() 488 M_B[bT].pushBack(pBCTree->cutVertex(cT, bT)); in topDownTraversal() 492 M_B[bT].pushBack(pBCTree->cutVertex(cT, bT)); in topDownTraversal() 514 M2[bT].pushBack(pBCTree->cutVertex(cT, bT)); in topDownTraversal() [all …]
|
H A D | EmbedderMaxFace.cpp | 126 m_cH = pBCTree->cutVertex(bT->firstAdj()->twinNode(), bT); in computeBlockGraphs() 128 nBlockEmbedding_to_nH[bT], eBlockEmbedding_to_eH[bT], in computeBlockGraphs() 129 nH_to_nBlockEmbedding[bT], eH_to_eBlockEmbedding[bT]); in computeBlockGraphs() 130 nodeLength[bT].init(blockG[bT], 0); in computeBlockGraphs() 131 cstrLength[bT].init(blockG[bT], 0); in computeBlockGraphs() 136 spqrTrees[bT] = new StaticSPQRTree(blockG[bT]); in computeBlockGraphs() 143 …computeNodeLength(bT, [&](node vH) -> int& { return nodeLength[bT][nH_to_nBlockEmbedding[bT][vH]];… in constraintMaxFace() 147 blockG[bT], in constraintMaxFace() 152 cstrLength[bT][nH_to_nBlockEmbedding[bT][cH]] = cstrLengthBc; in constraintMaxFace() 161 blockG[bT], in maximumFaceRec() [all …]
|
H A D | EmbedderMinDepthMaxFace.cpp | 257 md_M_B[bT].pushBack(pBCTree->cutVertex(cT, bT)); in topDownTraversal() 261 md_M_B[bT].pushBack(pBCTree->cutVertex(cT, bT)); in topDownTraversal() 334 M2[bT].pushBack(pBCTree->cutVertex(cT2, bT)); in topDownTraversal() 338 M2[bT].pushBack(pBCTree->cutVertex(cT2, bT)); in topDownTraversal() 430 M2[bT].pushBack(pBCTree->cutVertex(cT2, bT)); in topDownTraversal() 434 M2[bT].pushBack(pBCTree->cutVertex(cT2, bT)); in topDownTraversal() 463 M2[bT].pushBack(pBCTree->cutVertex(cT2, bT)); in topDownTraversal() 467 M2[bT].pushBack(pBCTree->cutVertex(cT2, bT)); in topDownTraversal() 508 md_M_B[bT].pushBack(pBCTree->cutVertex(cT, bT)); in topDownTraversal() 534 M2[bT].pushBack(pBCTree->cutVertex(cT, bT)); in topDownTraversal() [all …]
|
H A D | EmbedderMaxFaceLayers.cpp | 39 const node& bT, in embedBlock() argument 43 treeNodeTreated[bT] = true; in embedBlock() 46 cH = pBCTree->cutVertex(cT, bT); in embedBlock() 48 EdgeArray<int> edgeLength(blockG[bT], 1); in embedBlock() 51 blockG[bT], in embedBlock() 52 nodeLength[bT], in embedBlock() 54 nBlockEmbedding_to_nH[bT], in embedBlock() 55 eBlockEmbedding_to_eH[bT], in embedBlock() 56 cH == nullptr ? nullptr : nH_to_nBlockEmbedding[bT][cH], in embedBlock()
|
H A D | EmbedderMinDepthMaxFaceLayers.cpp | 38 const node& bT, in embedBlock() argument 42 treeNodeTreated[bT] = true; in embedBlock() 45 cH = pBCTree->cutVertex(cT, bT); in embedBlock() 48 if (cT != nullptr && md_M_B[bT].size() == 1 && *(md_M_B[bT].begin()) == cH) in embedBlock() 51 for (ListIterator<node> iterator = M2[bT].begin(); iterator.valid(); ++iterator) in embedBlock() 57 for (ListIterator<node> iterator = md_M_B[bT].begin(); iterator.valid(); ++iterator) in embedBlock() 66 nodeInBlock = (*(pBCTree->hEdges(bT).begin()))->source(); in embedBlock()
|
H A D | EmbedderMinDepthPiTa.cpp | 226 node bT = rootBlockNode; in doCall() local 233 bT = ae_cT2->twinNode(); in doCall() 668 return bT; in computeBlockMapping() 772 if (e->source() == bT) in embedBlocks() 788 m_cH = pBCTree->cutVertex(bT->firstAdj()->twinNode(), bT); in embedBlocks() 790 nBlockEmbedding_to_nH[bT], eBlockEmbedding_to_eH[bT], in embedBlocks() 791 nH_to_nBlockEmbedding[bT], eH_to_eBlockEmbedding[bT]); in embedBlocks() 792 planarEmbed(blockG[bT]); in embedBlocks() 793 nodeLength[bT].init(blockG[bT], 0); in embedBlocks() 829 node bT = e_vT_bT->source(); in embedCutVertex() local [all …]
|
/dports/misc/vxl/vxl-3.3.2/core/vil/ |
H A D | vil_math_sse.h | 34 template<class aT, class bT, class dT> 37 const bT* pxB, std::ptrdiff_t isB, 41 template<class aT, class bT, class dT> 43 const aT* pxA, const bT* pxB, dT* pxD, 46 template<class aT, class bT, class dT> 49 const bT* pxB, std::ptrdiff_t isB, 53 #define VIL_MATH_IMAGE_ABS_DIFF_1D_SSE_SPECIALIZE_DECL(aT,bT,dT) \ argument 55 void vil_math_image_abs_difference_1d_sse<aT,bT,dT>( \ 56 const aT* pxA, const bT* pxB, dT* pxD, \ 59 void vil_math_image_abs_difference_1d<aT,bT,dT>( \ [all …]
|
H A D | vil_math.h | 798 const bT* rowB = planeB; in vil_math_image_sum() 803 const bT* pixelB = rowB; in vil_math_image_sum() 840 const bT* rowB = planeB; in vil_math_image_product() 845 const bT* pixelB = rowB; in vil_math_image_product() 873 const bT* rowB = planeB; in vil_math_image_max() 878 const bT* pixelB = rowB; in vil_math_image_max() 906 const bT* rowB = planeB; in vil_math_image_min() 911 const bT* pixelB = rowB; in vil_math_image_min() 952 const bT* rowB = planeB; in vil_math_image_ratio() 1054 const bT* rowB = planeB; in vil_math_image_abs_difference() [all …]
|
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bdd/dsd/ |
H A D | dsdCheck.c | 201 DdNode * bE[4], * bT[4]; in Dsd_CheckRootFunctionIdentity_rec() local 227 bE[i] = bT[i] = bA[i]; in Dsd_CheckRootFunctionIdentity_rec() 244 bF1next = bT[0]; in Dsd_CheckRootFunctionIdentity_rec() 245 bC1next = bT[2]; in Dsd_CheckRootFunctionIdentity_rec() 254 bF2next = bT[1]; in Dsd_CheckRootFunctionIdentity_rec() 255 bC2next = bT[3]; in Dsd_CheckRootFunctionIdentity_rec() 270 bF1next = bT[0]; in Dsd_CheckRootFunctionIdentity_rec() 271 bC1next = bT[2]; in Dsd_CheckRootFunctionIdentity_rec() 287 bF2next = bT[1]; in Dsd_CheckRootFunctionIdentity_rec() 288 bC2next = bT[3]; in Dsd_CheckRootFunctionIdentity_rec() [all …]
|
/dports/finance/quantlib/QuantLib-1.20/ql/pricingengines/vanilla/ |
H A D | bjerksundstenslandengine.cpp | 33 Real rT, Real bT, Real variance) { in phi() argument 39 Real kappa = 2.0 * bT / variance + (2.0 * gamma - 1.0); in phi() 49 Real bT = std::log(dD/rfD); in americanCallApproximation() local 52 Real beta = (0.5 - bT/variance) + in americanCallApproximation() 53 std::sqrt(std::pow((bT/variance - 0.5), Real(2.0)) in americanCallApproximation() 57 Real B0 = std::max(X, rT / (rT - bT) * X); in americanCallApproximation() 70 *(1 - phi(S, beta, I, I, rT, bT, variance)) in americanCallApproximation() 71 + S * phi(S, 1.0, I, I, rT, bT, variance) in americanCallApproximation() 72 - S * phi(S, 1.0, X, I, rT, bT, variance) in americanCallApproximation() 73 - X * phi(S, 0.0, I, I, rT, bT, variance) in americanCallApproximation() [all …]
|
/dports/math/ogdf/OGDF/include/ogdf/planarity/ |
H A D | EmbedderMaxFace.h | 68 forEachIngoingNeighbor(bT, [&](node vT) { in computeNodeLength() 69 node vH = pBCTree->cutVertex(vT, bT); in computeNodeLength() 83 const node& bT, 93 node tmp_bT_opt = bT; 108 forEachIngoingNeighbor(bT, [&](node cT) { 109 node cH = pBCTree->cutVertex(cT, bT); 134 if (pT != bT) { 159 const node bT, in internalEmbedBlock() argument 268 void computeBlockGraphs(const node& bT, const node& cH); 277 virtual int constraintMaxFace(const node& bT, const node& cH); [all …]
|
H A D | EmbedderMinDepthMaxFace.h | 69 int bottomUpTraversal(const node &bT, const node &cH); 82 void topDownTraversal(const node &bT); 84 int constraintMaxFace(const node &bT, const node &cH) override; 86 void maximumFaceRec(const node &bT, node &bT_opt, int &ell_opt) override; 88 virtual void embedBlock(const node& bT, const node& cT, ListIterator<adjEntry>& after) override;
|
H A D | EmbedderMinDepth.h | 65 void computeBlockGraphs(const node& bT, const node& cH); 77 int bottomUpTraversal(const node& bT, const node& cH); 90 void topDownTraversal(const node& bT); 98 void embedBlock(const node& bT); 110 void embedBlock(const node& bT, const node& cT, ListIterator<adjEntry>& after);
|
/dports/science/madness/madness-ebb3fd7/src/madness/tensor/mtxmq_graveyard/ |
H A D | mtxmq.h | 55 template <typename aT, typename bT, typename cT> 57 cT* MADNESS_RESTRICT c, const aT* a, const bT* b) { in mTxmq() 72 template <typename aT, typename bT, typename cT> 74 cT* MADNESS_RESTRICT c, const aT* a, const bT* b) { 95 template <typename aT, typename bT, typename cT> 97 cT* c, const aT* a, const bT* b) { in mTxmq_padding() 112 bT* b_buf = (bT*)malloc(sizeof(bT)*dimk*effj); in mTxmq_padding() 114 bT* bp = b_buf; in mTxmq_padding() 116 memcpy(bp, b, sizeof(bT)*dimj); in mTxmq_padding() 145 if (free_b) free((bT*)b); in mTxmq_padding()
|
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/jdk.accessibility/windows/native/jaccesswalker/ |
H A D | jaccesswalker.cpp | 337 BOOL bT ( FALSE ); in IsInaccessibleJavaWindow() local 344 if ( ( bT ) in IsInaccessibleJavaWindow() 358 if ( ( bT ) in IsInaccessibleJavaWindow() 370 if ( ( bT ) in IsInaccessibleJavaWindow() 376 } else if ( ( bT ) in IsInaccessibleJavaWindow() 400 } else if ( ( bT ) in IsInaccessibleJavaWindow() 410 } else if ( ( bT ) in IsInaccessibleJavaWindow() 422 if ( ( bT ) in IsInaccessibleJavaWindow() 428 } else if ( ( bT ) in IsInaccessibleJavaWindow() 442 if ( ( bT ) in IsInaccessibleJavaWindow() [all …]
|
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/jdk.accessibility/windows/native/jaccesswalker/ |
H A D | jaccesswalker.cpp | 337 BOOL bT ( FALSE ); in IsInaccessibleJavaWindow() local 344 if ( ( bT ) in IsInaccessibleJavaWindow() 358 if ( ( bT ) in IsInaccessibleJavaWindow() 370 if ( ( bT ) in IsInaccessibleJavaWindow() 376 } else if ( ( bT ) in IsInaccessibleJavaWindow() 400 } else if ( ( bT ) in IsInaccessibleJavaWindow() 410 } else if ( ( bT ) in IsInaccessibleJavaWindow() 422 if ( ( bT ) in IsInaccessibleJavaWindow() 428 } else if ( ( bT ) in IsInaccessibleJavaWindow() 442 if ( ( bT ) in IsInaccessibleJavaWindow() [all …]
|
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/jdk.accessibility/windows/native/jaccesswalker/ |
H A D | jaccesswalker.cpp | 337 BOOL bT ( FALSE ); in IsInaccessibleJavaWindow() local 344 if ( ( bT ) in IsInaccessibleJavaWindow() 358 if ( ( bT ) in IsInaccessibleJavaWindow() 370 if ( ( bT ) in IsInaccessibleJavaWindow() 376 } else if ( ( bT ) in IsInaccessibleJavaWindow() 400 } else if ( ( bT ) in IsInaccessibleJavaWindow() 410 } else if ( ( bT ) in IsInaccessibleJavaWindow() 422 if ( ( bT ) in IsInaccessibleJavaWindow() 428 } else if ( ( bT ) in IsInaccessibleJavaWindow() 442 if ( ( bT ) in IsInaccessibleJavaWindow() [all …]
|
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/jdk.accessibility/windows/native/jaccesswalker/ |
H A D | jaccesswalker.cpp | 337 BOOL bT ( FALSE ); in IsInaccessibleJavaWindow() local 344 if ( ( bT ) in IsInaccessibleJavaWindow() 358 if ( ( bT ) in IsInaccessibleJavaWindow() 370 if ( ( bT ) in IsInaccessibleJavaWindow() 376 } else if ( ( bT ) in IsInaccessibleJavaWindow() 400 } else if ( ( bT ) in IsInaccessibleJavaWindow() 410 } else if ( ( bT ) in IsInaccessibleJavaWindow() 422 if ( ( bT ) in IsInaccessibleJavaWindow() 428 } else if ( ( bT ) in IsInaccessibleJavaWindow() 442 if ( ( bT ) in IsInaccessibleJavaWindow() [all …]
|
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/jdk.accessibility/windows/native/jaccesswalker/ |
H A D | jaccesswalker.cpp | 337 BOOL bT ( FALSE ); in IsInaccessibleJavaWindow() local 344 if ( ( bT ) in IsInaccessibleJavaWindow() 358 if ( ( bT ) in IsInaccessibleJavaWindow() 370 if ( ( bT ) in IsInaccessibleJavaWindow() 376 } else if ( ( bT ) in IsInaccessibleJavaWindow() 400 } else if ( ( bT ) in IsInaccessibleJavaWindow() 410 } else if ( ( bT ) in IsInaccessibleJavaWindow() 422 if ( ( bT ) in IsInaccessibleJavaWindow() 428 } else if ( ( bT ) in IsInaccessibleJavaWindow() 442 if ( ( bT ) in IsInaccessibleJavaWindow() [all …]
|
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/jdk.accessibility/windows/native/jaccesswalker/ |
H A D | jaccesswalker.cpp | 337 BOOL bT ( FALSE ); in IsInaccessibleJavaWindow() local 344 if ( ( bT ) in IsInaccessibleJavaWindow() 358 if ( ( bT ) in IsInaccessibleJavaWindow() 370 if ( ( bT ) in IsInaccessibleJavaWindow() 376 } else if ( ( bT ) in IsInaccessibleJavaWindow() 400 } else if ( ( bT ) in IsInaccessibleJavaWindow() 410 } else if ( ( bT ) in IsInaccessibleJavaWindow() 422 if ( ( bT ) in IsInaccessibleJavaWindow() 428 } else if ( ( bT ) in IsInaccessibleJavaWindow() 442 if ( ( bT ) in IsInaccessibleJavaWindow() [all …]
|
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/jdk.accessibility/windows/native/jaccesswalker/ |
H A D | jaccesswalker.cpp | 337 BOOL bT ( FALSE ); in IsInaccessibleJavaWindow() local 344 if ( ( bT ) in IsInaccessibleJavaWindow() 358 if ( ( bT ) in IsInaccessibleJavaWindow() 370 if ( ( bT ) in IsInaccessibleJavaWindow() 376 } else if ( ( bT ) in IsInaccessibleJavaWindow() 400 } else if ( ( bT ) in IsInaccessibleJavaWindow() 410 } else if ( ( bT ) in IsInaccessibleJavaWindow() 422 if ( ( bT ) in IsInaccessibleJavaWindow() 428 } else if ( ( bT ) in IsInaccessibleJavaWindow() 442 if ( ( bT ) in IsInaccessibleJavaWindow() [all …]
|
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/jdk.accessibility/windows/native/jaccesswalker/ |
H A D | jaccesswalker.cpp | 337 BOOL bT ( FALSE ); in IsInaccessibleJavaWindow() local 344 if ( ( bT ) in IsInaccessibleJavaWindow() 358 if ( ( bT ) in IsInaccessibleJavaWindow() 370 if ( ( bT ) in IsInaccessibleJavaWindow() 376 } else if ( ( bT ) in IsInaccessibleJavaWindow() 400 } else if ( ( bT ) in IsInaccessibleJavaWindow() 410 } else if ( ( bT ) in IsInaccessibleJavaWindow() 422 if ( ( bT ) in IsInaccessibleJavaWindow() 428 } else if ( ( bT ) in IsInaccessibleJavaWindow() 442 if ( ( bT ) in IsInaccessibleJavaWindow() [all …]
|
/dports/science/madness/madness-ebb3fd7/src/madness/tensor/ |
H A D | mxm.h | 163 template <typename aT, typename bT, typename cT> 190 template <typename aT, typename bT, typename cT> 203 template <typename aT, typename bT, typename cT> 216 template <typename aT, typename bT, typename cT> 229 template <typename aT, typename bT, typename cT> 248 template <typename aT, typename bT, typename cT> 500 cT* c, const aT* a, const bT* b) { in mTxmq_padding() 515 bT* b_buf = (bT*)malloc(sizeof(bT)*dimk*effj); in mTxmq_padding() 517 bT* bp = b_buf; in mTxmq_padding() 519 memcpy(bp, b, sizeof(bT)*dimj); in mTxmq_padding() [all …]
|
/dports/textproc/dsssl-docbook-modular/docbook-dsssl-1.79/bin/ |
H A D | collateindex.pl | 458 my($bT) = $b->{'tsortas'} || $b->{'tertiary'}; 467 $bT =~ s/^\s*//; $bT =~ s/\s*$//; $bT = uc($bT); 488 && ($aT eq $bT) 605 my($bT) = $b->{'tsortas'} || $b->{'tertiary'}; 613 $bT =~ s/^\s*//; $bT =~ s/\s*$//; $bT = uc($bT); 617 if ($aT eq $bT) { 626 return $aT cmp $bT;
|
/dports/math/gretl/gretl-2021d/share/scripts/misc/ |
H A D | LLTestim.inp | 41 # bT = ( 1, 1, 76 matrix bT, 89 alpha(t)=bT*alpha(t-1)+w(t); (1.2a) 96 bT = m x m matrix (transition matrix) 115 matrix at_t = bT*at_t 117 matrix pt_t1 = qform(bT,pt_t)+Sigma_w 150 matrix bT) 175 matrix *bT, 193 matrix bT = { 1, 1; 0, 1 } 194 scalar m = cols(bT) [all …]
|