Home
last modified time | relevance | path

Searched refs:gi1 (Results 1 – 25 of 650) sorted by relevance

12345678910>>...26

/dports/net-mgmt/librenms/librenms-21.5.1/tests/snmpsim/
H A Dciscosb_sg350x-48.snmprec85 1.3.6.1.2.1.47.1.1.1.1.7.68425857|4|gi1/0/25
86 1.3.6.1.2.1.47.1.1.1.1.7.68425858|4|gi1/0/1
87 1.3.6.1.2.1.47.1.1.1.1.7.68425859|4|gi1/0/26
88 1.3.6.1.2.1.47.1.1.1.1.7.68425860|4|gi1/0/2
90 1.3.6.1.2.1.47.1.1.1.1.7.68425862|4|gi1/0/3
92 1.3.6.1.2.1.47.1.1.1.1.7.68425864|4|gi1/0/4
94 1.3.6.1.2.1.47.1.1.1.1.7.68425866|4|gi1/0/5
96 1.3.6.1.2.1.47.1.1.1.1.7.68425868|4|gi1/0/6
98 1.3.6.1.2.1.47.1.1.1.1.7.68425870|4|gi1/0/7
100 1.3.6.1.2.1.47.1.1.1.1.7.68425872|4|gi1/0/8
[all …]
/dports/biology/star/STAR-2.7.9a/source/
H A DTranscriptome_geneFullAlignOverlap.cpp12 int64 gi1=-1; in geneFullAlignOverlap() local
17 gi1=binarySearch1a<uint64>(be1, geneFull.s, (int32) nGe); in geneFullAlignOverlap()
19 … while (gi1>=0 && geneFull.eMax[gi1]>=a.exons[ib][EX_G]) {//these exons may overlap this block in geneFullAlignOverlap()
20 if (geneFull.e[gi1]>=a.exons[ib][EX_G]) {//this gene overlaps the block in geneFullAlignOverlap()
21 int32 str1 = geneFull.str[gi1]==1 ? a.Str : 1-a.Str; in geneFullAlignOverlap()
23 readAnnot.geneFull.insert(geneFull.g[gi1]); in geneFullAlignOverlap()
27 --gi1;// go to the previous gene in geneFullAlignOverlap()
/dports/science/berkeleygw/BGW-2.0.0/BSE/
H A Dw_sum.f9041 integer :: isv, ig, i1, i1p, gi1, gi1p
57 gi1 = ofs1+i1
60 tempw(ig, gi1, gi1p, isv) = wptcol(ig) * m11p_conj(i1, i1p, isv)
76 gi1 = ofs1+i1
79 tempb(ig, gi1, gi1p, isv) = tempb(ig, gi1, gi1p, isv) + &
H A Dgx_sum.f90105 integer :: gi1, gi1p, gi2, gi2p
125 gi1 = i1 + ofs1
128 + xct%n1b_co*xct%n1b_co*(gi2-1) + xct%n1b_co*(gi1p-1) + gi1 -1
130 iit = peinf%wown(1,i2p_in,ikp,1,i2_in,ik) + xct%n1b_co*(gi1p-1) + gi1 -1
/dports/cad/netgen/netgen-6.2.2105/libsrc/meshing/
H A Dbasegeom.hpp39 const EdgePointGeomInfo& gi1, in PointBetween() argument
45 newgi = gi1; in PointBetween()
83 const PointGeomInfo& gi1, in PointBetween() argument
89 newgi.trignum = gi1.trignum; in PointBetween()
90 newgi.u = 0.5 * (gi1.u + gi1.u); in PointBetween()
91 newgi.v = 0.5 * (gi1.v + gi2.v); in PointBetween()
99 const PointGeomInfo& gi1,
170 const PointGeomInfo & gi1, in PointBetween() argument
177 faces[surfi-1]->PointBetween(p1, p2, secpoint, gi1, gi2, newp, newgi); in PointBetween()
H A Dbasegeom.cpp22 auto p1 = GetPoint(gi1); in RestrictHTrig()
37 gi_mid.u = (gi0.u + gi1.u + gi2.u)/3; in RestrictHTrig()
38 gi_mid.v = (gi0.v + gi1.v + gi2.v)/3; in RestrictHTrig()
59 gi_m.u = 0.5 * (gi1.u + gi2.u); in RestrictHTrig()
60 gi_m.v = 0.5 * (gi1.v + gi2.v); in RestrictHTrig()
75 gi_m.u = 0.5 * (gi0.u + gi1.u); in RestrictHTrig()
76 gi_m.v = 0.5 * (gi0.v + gi1.v); in RestrictHTrig()
443 PointGeomInfo gi0, gi1; in MeshSurface() local
444 gi0.trignum = gi1.trignum = k+1; in MeshSurface()
447 gi1.u = seg.epgeominfo[1].u; in MeshSurface()
[all …]
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/apps/mason2/
H A Dmason_tests.cpp177 GenomicInterval gi1( 0, 1000, 0, 1000, '+', GenomicInterval::NORMAL); in SEQAN_DEFINE_TEST() local
183 appendValue(intervals, TInterval(gi1.svBeginPos, gi1.svEndPos, gi1)); in SEQAN_DEFINE_TEST()
190 positionMap.svBreakpoints.insert(std::make_pair(gi1.svEndPos, 1)); in SEQAN_DEFINE_TEST()
204 SEQAN_ASSERT(gi1 == positionMap.getGenomicInterval( 0)); in SEQAN_DEFINE_TEST()
205 SEQAN_ASSERT(gi1 == positionMap.getGenomicInterval( 999)); in SEQAN_DEFINE_TEST()
247 GenomicInterval gi1( 0, 1000, 1000, 2000, '+', GenomicInterval::NORMAL); in SEQAN_DEFINE_TEST() local
252 appendValue(intervals, TInterval(gi1.svBeginPos, gi1.svEndPos, gi1)); in SEQAN_DEFINE_TEST()
258 positionMap.svBreakpoints.insert(std::make_pair(gi1.svEndPos, 1)); in SEQAN_DEFINE_TEST()
269 SEQAN_ASSERT(gi1 == positionMap.getGenomicInterval( 0)); in SEQAN_DEFINE_TEST()
270 SEQAN_ASSERT(gi1 == positionMap.getGenomicInterval( 999)); in SEQAN_DEFINE_TEST()
/dports/math/libmesh/libmesh-1.6.2/contrib/libHilbert/include/Hilbert/
H A DGrayCodeRank.hpp176 FBV_UINT gi0, gi1, g0; in grayCodeRankInv() local
177 gi1 = gi0 = g0 = 0; in grayCodeRankInv()
184 gi1 = gi0; in grayCodeRankInv()
186 g0 = gi0 ^ gi1; in grayCodeRankInv()
194 gi1 = gi0; in grayCodeRankInv()
195 gi0 = g0 ^ gi1; in grayCodeRankInv()
/dports/devel/gnulib/gnulib-20140202-stable/modules/
H A Dpipe-filter-gi-tests2 tests/test-pipe-filter-gi1.sh
3 tests/test-pipe-filter-gi1.c
21 TESTS += test-pipe-filter-gi1.sh test-pipe-filter-gi2.sh
22 check_PROGRAMS += test-pipe-filter-gi1 test-pipe-filter-gi2-main test-pipe-filter-gi2-child
/dports/security/pkcs11-tools/pkcs11-tools-2.5.0/.gnulib/modules/
H A Dpipe-filter-gi-tests2 tests/test-pipe-filter-gi1.sh
3 tests/test-pipe-filter-gi1.c
20 TESTS += test-pipe-filter-gi1.sh test-pipe-filter-gi2.sh
21 check_PROGRAMS += test-pipe-filter-gi1 test-pipe-filter-gi2-main test-pipe-filter-gi2-child
/dports/biology/cd-hit/cdhit-4.8.1/psi-cd-hit/
H A Dfetch_fasta_by_ids.pl5 my %gi1 = ();
13 $gi1{$ll} = 1;
24 $flag = ( $gi1{$gi} ) ? 1 : 0;
H A Dfetch_fasta_exclude_ids.pl5 my %gi1 = ();
13 $gi1{$ll} = 1;
24 $flag = ( $gi1{$gi} ) ? 0 : 1;
/dports/devel/gnulib/gnulib-20140202-stable/tests/
H A Dtest-pipe-filter-gi1.sh16 ./test-pipe-filter-gi1${EXEEXT} ${TR} "${srcdir}/test-pipe-filter-gi1.sh" || exit 1
18 ./test-pipe-filter-gi1${EXEEXT} ${TR} "${srcdir}/test-pipe-filter-gi1.c" || exit 1
20 ./test-pipe-filter-gi1${EXEEXT} ${TR} "${srcdir}/test-vasnprintf-posix.c" || exit 1
/dports/security/pkcs11-tools/pkcs11-tools-2.5.0/.gnulib/tests/
H A Dtest-pipe-filter-gi1.sh16 ${CHECKER} ./test-pipe-filter-gi1${EXEEXT} ${TR} "${srcdir}/test-pipe-filter-gi1.sh" || exit 1
18 ${CHECKER} ./test-pipe-filter-gi1${EXEEXT} ${TR} "${srcdir}/test-pipe-filter-gi1.c" || exit 1
20 ${CHECKER} ./test-pipe-filter-gi1${EXEEXT} ${TR} "${srcdir}/test-vasnprintf-posix.c" || exit 1
/dports/math/p5-Graph/Graph-0.9725/t/
H A D99_misc.t13 my $gi1 = Graph->new;
14 $gi1->set_vertex_attribute('x', shape => 1);
15 $gi1->set_edge_attribute(qw(x y), weight => 2);
16 is_deeply [ $gi0->ingest($gi1)->as_hashes ], [
/dports/emulators/vice/vice-3.5/src/lib/liblame/libmp3lame/i386/
H A Dfft3dn.nas92 pmov mm1, [r1+r4*2] ;gi1
100 pxor mm1, mm7 ;gi1 | -gi1
102 pfsub mm0, mm1 ;gi0-gi1|gi0+gi1 = g1 | g0
106 pfadd mm0, mm2 ;g1+g3|g0+g2 = gi1 | gi0
165 pupldq mm4, mm4 ; gi1 | gi1
170 pfmul mm4, mm1 ;-c2 * gi1 | s2 * gi1
222 pfadd mm4, mm1 ;fi0 | gi1
328 pupldq mm3, [r1+r4*2] ;gi1|gi0
331 pfpnacc mm3, mm3 ;gi0+gi1 |gi0-gi1 = f0|f1
442 pfpnacc mm2, mm2 ;gi1 | gi3
/dports/audio/lame/lame-3.100/libmp3lame/i386/
H A Dfft3dn.nas92 pmov mm1, [r1+r4*2] ;gi1
100 pxor mm1, mm7 ;gi1 | -gi1
102 pfsub mm0, mm1 ;gi0-gi1|gi0+gi1 = g1 | g0
106 pfadd mm0, mm2 ;g1+g3|g0+g2 = gi1 | gi0
165 pupldq mm4, mm4 ; gi1 | gi1
170 pfmul mm4, mm1 ;-c2 * gi1 | s2 * gi1
222 pfadd mm4, mm1 ;fi0 | gi1
328 pupldq mm3, [r1+r4*2] ;gi1|gi0
331 pfpnacc mm3, mm3 ;gi0+gi1 |gi0-gi1 = f0|f1
442 pfpnacc mm2, mm2 ;gi1 | gi3
/dports/emulators/libretro-vice/vice-libretro-5725415/vice/src/lib/liblame/libmp3lame/i386/
H A Dfft3dn.nas92 pmov mm1, [r1+r4*2] ;gi1
100 pxor mm1, mm7 ;gi1 | -gi1
102 pfsub mm0, mm1 ;gi0-gi1|gi0+gi1 = g1 | g0
106 pfadd mm0, mm2 ;g1+g3|g0+g2 = gi1 | gi0
165 pupldq mm4, mm4 ; gi1 | gi1
170 pfmul mm4, mm1 ;-c2 * gi1 | s2 * gi1
222 pfadd mm4, mm1 ;fi0 | gi1
328 pupldq mm3, [r1+r4*2] ;gi1|gi0
331 pfpnacc mm3, mm3 ;gi0+gi1 |gi0-gi1 = f0|f1
442 pfpnacc mm2, mm2 ;gi1 | gi3
/dports/math/cgal/CGAL-5.3/include/CGAL/Minkowski_sum_3/
H A Dbipartite_nary_union_sorted_combined.h192 GM_iterator gi0, gi1; in bipartite_nary_union_sorted_combined() local
194 for(gi1 = GM1.begin(); gi1 != GM1.end(); ++gi1) { in bipartite_nary_union_sorted_combined()
195 pq.insert(std::make_pair(gi0->second+(CGAL::ORIGIN-gi1->second), in bipartite_nary_union_sorted_combined()
196 std::make_pair(gi0, gi1))); in bipartite_nary_union_sorted_combined()
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/Netgen/libsrc/stlgeom/
H A Dmeshstlsurface.cpp395 const EdgePointGeomInfo & gi1 = seg.epgeominfo[0]; in STLSurfaceMeshing() local
398 newgi.dist = 0.5 * (gi1.dist + gi2.dist); in STLSurfaceMeshing()
399 newgi.edgenr = gi1.edgenr; in STLSurfaceMeshing()
408 newp = geom.GetLine (gi1.edgenr)-> in STLSurfaceMeshing()
1026 const PointGeomInfo & gi1, in PointBetween() argument
1037 if (gi1.trignum > 0) in PointBetween()
1043 ((STLGeometry&)geom).SelectChartOfTriangle (gi1.trignum); in PointBetween()
1054 if (!newgi.trignum) newgi.trignum = gi1.trignum; in PointBetween()
1089 const EdgePointGeomInfo & gi1, in PointBetween() argument
1103 newgi.dist = (1.0-secpoint) * gi1.dist + secpoint*gi2.dist; in PointBetween()
[all …]
/dports/science/elmerfem/elmerfem-release-9.0/ElmerGUI/netgen/libsrc/stlgeom/
H A Dmeshstlsurface.cpp395 const EdgePointGeomInfo & gi1 = seg.epgeominfo[0]; in STLSurfaceMeshing() local
398 newgi.dist = 0.5 * (gi1.dist + gi2.dist); in STLSurfaceMeshing()
399 newgi.edgenr = gi1.edgenr; in STLSurfaceMeshing()
408 newp = geom.GetLine (gi1.edgenr)-> in STLSurfaceMeshing()
1026 const PointGeomInfo & gi1, in PointBetween() argument
1037 if (gi1.trignum > 0) in PointBetween()
1043 ((STLGeometry&)geom).SelectChartOfTriangle (gi1.trignum); in PointBetween()
1054 if (!newgi.trignum) newgi.trignum = gi1.trignum; in PointBetween()
1089 const EdgePointGeomInfo & gi1, in PointBetween() argument
1103 newgi.dist = (1.0-secpoint) * gi1.dist + secpoint*gi2.dist; in PointBetween()
[all …]
/dports/science/elmerfem/elmerfem-release-9.0/ElmerGUI/netgen/libsrc/meshing/
H A Dadfront2.hpp150 void SetGeomInfo (const PointGeomInfo & gi1, const PointGeomInfo & gi2) in SetGeomInfo() argument
152 geominfo[0] = gi1; in SetGeomInfo()
228 const PointGeomInfo & gi1, const PointGeomInfo & gi2);
/dports/devel/boost-docs/boost_1_72_0/libs/graph/test/
H A Dsubgraph.cpp170 subgraph_t::children_iterator gi1, gi2; in test_main() local
172 gi1 = gi2++; in test_main()
173 tie(vi_start, vi_end) = vertices(*gi1); in test_main()
182 (*gi1).create_subgraph(vi_start, vi); in test_main()
183 (*gi1).create_subgraph(++vi, vi_end); in test_main()
/dports/devel/boost-python-libs/boost_1_72_0/libs/graph/test/
H A Dsubgraph.cpp170 subgraph_t::children_iterator gi1, gi2; in test_main() local
172 gi1 = gi2++; in test_main()
173 tie(vi_start, vi_end) = vertices(*gi1); in test_main()
182 (*gi1).create_subgraph(vi_start, vi); in test_main()
183 (*gi1).create_subgraph(++vi, vi_end); in test_main()
/dports/devel/boost-libs/boost_1_72_0/libs/graph/test/
H A Dsubgraph.cpp170 subgraph_t::children_iterator gi1, gi2; in test_main() local
172 gi1 = gi2++; in test_main()
173 tie(vi_start, vi_end) = vertices(*gi1); in test_main()
182 (*gi1).create_subgraph(vi_start, vi); in test_main()
183 (*gi1).create_subgraph(++vi, vi_end); in test_main()

12345678910>>...26