Home
last modified time | relevance | path

Searched refs:V1 (Results 101 – 125 of 16520) sorted by relevance

12345678910>>...661

/dports/math/xlapack/lapack-3.10.0/SRC/
H A Ddcombssq.f59 SUBROUTINE DCOMBSSQ( V1, V2 ) argument
67 DOUBLE PRECISION V1( 2 ), V2( 2 )
81 IF( V1( 1 ).GE.V2( 1 ) ) THEN
82 IF( V1( 1 ).NE.ZERO ) THEN
83 V1( 2 ) = V1( 2 ) + ( V2( 1 ) / V1( 1 ) )**2 * V2( 2 )
85 V1( 2 ) = V1( 2 ) + V2( 2 )
88 V1( 2 ) = V2( 2 ) + ( V1( 1 ) / V2( 1 ) )**2 * V1( 2 )
89 V1( 1 ) = V2( 1 )
H A Dscombssq.f59 SUBROUTINE SCOMBSSQ( V1, V2 ) argument
67 REAL V1( 2 ), V2( 2 )
81 IF( V1( 1 ).GE.V2( 1 ) ) THEN
82 IF( V1( 1 ).NE.ZERO ) THEN
83 V1( 2 ) = V1( 2 ) + ( V2( 1 ) / V1( 1 ) )**2 * V2( 2 )
85 V1( 2 ) = V1( 2 ) + V2( 2 )
88 V1( 2 ) = V2( 2 ) + ( V1( 1 ) / V2( 1 ) )**2 * V1( 2 )
89 V1( 1 ) = V2( 1 )
/dports/math/blas/lapack-3.10.0/SRC/
H A Ddcombssq.f59 SUBROUTINE DCOMBSSQ( V1, V2 ) argument
67 DOUBLE PRECISION V1( 2 ), V2( 2 )
81 IF( V1( 1 ).GE.V2( 1 ) ) THEN
82 IF( V1( 1 ).NE.ZERO ) THEN
83 V1( 2 ) = V1( 2 ) + ( V2( 1 ) / V1( 1 ) )**2 * V2( 2 )
85 V1( 2 ) = V1( 2 ) + V2( 2 )
88 V1( 2 ) = V2( 2 ) + ( V1( 1 ) / V2( 1 ) )**2 * V1( 2 )
89 V1( 1 ) = V2( 1 )
H A Dscombssq.f59 SUBROUTINE SCOMBSSQ( V1, V2 ) argument
67 REAL V1( 2 ), V2( 2 )
81 IF( V1( 1 ).GE.V2( 1 ) ) THEN
82 IF( V1( 1 ).NE.ZERO ) THEN
83 V1( 2 ) = V1( 2 ) + ( V2( 1 ) / V1( 1 ) )**2 * V2( 2 )
85 V1( 2 ) = V1( 2 ) + V2( 2 )
88 V1( 2 ) = V2( 2 ) + ( V1( 1 ) / V2( 1 ) )**2 * V1( 2 )
89 V1( 1 ) = V2( 1 )
/dports/math/lapacke/lapack-3.10.0/SRC/
H A Ddcombssq.f59 SUBROUTINE DCOMBSSQ( V1, V2 ) argument
67 DOUBLE PRECISION V1( 2 ), V2( 2 )
81 IF( V1( 1 ).GE.V2( 1 ) ) THEN
82 IF( V1( 1 ).NE.ZERO ) THEN
83 V1( 2 ) = V1( 2 ) + ( V2( 1 ) / V1( 1 ) )**2 * V2( 2 )
85 V1( 2 ) = V1( 2 ) + V2( 2 )
88 V1( 2 ) = V2( 2 ) + ( V1( 1 ) / V2( 1 ) )**2 * V1( 2 )
89 V1( 1 ) = V2( 1 )
H A Dscombssq.f59 SUBROUTINE SCOMBSSQ( V1, V2 ) argument
67 REAL V1( 2 ), V2( 2 )
81 IF( V1( 1 ).GE.V2( 1 ) ) THEN
82 IF( V1( 1 ).NE.ZERO ) THEN
83 V1( 2 ) = V1( 2 ) + ( V2( 1 ) / V1( 1 ) )**2 * V2( 2 )
85 V1( 2 ) = V1( 2 ) + V2( 2 )
88 V1( 2 ) = V2( 2 ) + ( V1( 1 ) / V2( 1 ) )**2 * V1( 2 )
89 V1( 1 ) = V2( 1 )
/dports/math/lapack/lapack-3.10.0/SRC/
H A Ddcombssq.f59 SUBROUTINE DCOMBSSQ( V1, V2 ) argument
67 DOUBLE PRECISION V1( 2 ), V2( 2 )
81 IF( V1( 1 ).GE.V2( 1 ) ) THEN
82 IF( V1( 1 ).NE.ZERO ) THEN
83 V1( 2 ) = V1( 2 ) + ( V2( 1 ) / V1( 1 ) )**2 * V2( 2 )
85 V1( 2 ) = V1( 2 ) + V2( 2 )
88 V1( 2 ) = V2( 2 ) + ( V1( 1 ) / V2( 1 ) )**2 * V1( 2 )
89 V1( 1 ) = V2( 1 )
H A Dscombssq.f59 SUBROUTINE SCOMBSSQ( V1, V2 ) argument
67 REAL V1( 2 ), V2( 2 )
81 IF( V1( 1 ).GE.V2( 1 ) ) THEN
82 IF( V1( 1 ).NE.ZERO ) THEN
83 V1( 2 ) = V1( 2 ) + ( V2( 1 ) / V1( 1 ) )**2 * V2( 2 )
85 V1( 2 ) = V1( 2 ) + V2( 2 )
88 V1( 2 ) = V2( 2 ) + ( V1( 1 ) / V2( 1 ) )**2 * V1( 2 )
89 V1( 1 ) = V2( 1 )
/dports/math/cblas/lapack-3.10.0/SRC/
H A Ddcombssq.f59 SUBROUTINE DCOMBSSQ( V1, V2 ) argument
67 DOUBLE PRECISION V1( 2 ), V2( 2 )
81 IF( V1( 1 ).GE.V2( 1 ) ) THEN
82 IF( V1( 1 ).NE.ZERO ) THEN
83 V1( 2 ) = V1( 2 ) + ( V2( 1 ) / V1( 1 ) )**2 * V2( 2 )
85 V1( 2 ) = V1( 2 ) + V2( 2 )
88 V1( 2 ) = V2( 2 ) + ( V1( 1 ) / V2( 1 ) )**2 * V1( 2 )
89 V1( 1 ) = V2( 1 )
H A Dscombssq.f59 SUBROUTINE SCOMBSSQ( V1, V2 ) argument
67 REAL V1( 2 ), V2( 2 )
81 IF( V1( 1 ).GE.V2( 1 ) ) THEN
82 IF( V1( 1 ).NE.ZERO ) THEN
83 V1( 2 ) = V1( 2 ) + ( V2( 1 ) / V1( 1 ) )**2 * V2( 2 )
85 V1( 2 ) = V1( 2 ) + V2( 2 )
88 V1( 2 ) = V2( 2 ) + ( V1( 1 ) / V2( 1 ) )**2 * V1( 2 )
89 V1( 1 ) = V2( 1 )
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/clang/test/Analysis/
H A Dptr-sort.cpp11 std::vector<int> V1 = {a, b}; in PointerSorting() local
14 std::is_sorted(V1.begin(), V1.end()); // no-warning in PointerSorting()
15 std::nth_element(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
16 std::partial_sort(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
17 std::sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
18 std::stable_sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
19 std::partition(V1.begin(), V1.end(), f); // no-warning in PointerSorting()
20 std::stable_partition(V1.begin(), V1.end(), g); // no-warning in PointerSorting()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/clang/test/Analysis/
H A Dptr-sort.cpp11 std::vector<int> V1 = {a, b}; in PointerSorting() local
14 std::is_sorted(V1.begin(), V1.end()); // no-warning in PointerSorting()
15 std::nth_element(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
16 std::partial_sort(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
17 std::sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
18 std::stable_sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
19 std::partition(V1.begin(), V1.end(), f); // no-warning in PointerSorting()
20 std::stable_partition(V1.begin(), V1.end(), g); // no-warning in PointerSorting()
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/clang/test/Analysis/
H A Dptr-sort.cpp11 std::vector<int> V1 = {a, b}; in PointerSorting() local
14 std::is_sorted(V1.begin(), V1.end()); // no-warning in PointerSorting()
15 std::nth_element(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
16 std::partial_sort(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
17 std::sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
18 std::stable_sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
19 std::partition(V1.begin(), V1.end(), f); // no-warning in PointerSorting()
20 std::stable_partition(V1.begin(), V1.end(), g); // no-warning in PointerSorting()
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/clang/test/Analysis/
H A Dptr-sort.cpp11 std::vector<int> V1 = {a, b}; in PointerSorting() local
14 std::is_sorted(V1.begin(), V1.end()); // no-warning in PointerSorting()
15 std::nth_element(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
16 std::partial_sort(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
17 std::sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
18 std::stable_sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
19 std::partition(V1.begin(), V1.end(), f); // no-warning in PointerSorting()
20 std::stable_partition(V1.begin(), V1.end(), g); // no-warning in PointerSorting()
/dports/devel/llvm12/llvm-project-12.0.1.src/clang/test/Analysis/
H A Dptr-sort.cpp11 std::vector<int> V1 = {a, b}; in PointerSorting() local
14 std::is_sorted(V1.begin(), V1.end()); // no-warning in PointerSorting()
15 std::nth_element(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
16 std::partial_sort(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
17 std::sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
18 std::stable_sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
19 std::partition(V1.begin(), V1.end(), f); // no-warning in PointerSorting()
20 std::stable_partition(V1.begin(), V1.end(), g); // no-warning in PointerSorting()
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/clang/test/Analysis/
H A Dptr-sort.cpp11 std::vector<int> V1 = {a, b}; in PointerSorting() local
14 std::is_sorted(V1.begin(), V1.end()); // no-warning in PointerSorting()
15 std::nth_element(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
16 std::partial_sort(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
17 std::sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
18 std::stable_sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
19 std::partition(V1.begin(), V1.end(), f); // no-warning in PointerSorting()
20 std::stable_partition(V1.begin(), V1.end(), g); // no-warning in PointerSorting()
/dports/devel/llvm10/llvm-10.0.1.src/tools/clang/test/Analysis/
H A Dptr-sort.cpp11 std::vector<int> V1 = {a, b}; in PointerSorting() local
14 std::is_sorted(V1.begin(), V1.end()); // no-warning in PointerSorting()
15 std::nth_element(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
16 std::partial_sort(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
17 std::sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
18 std::stable_sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
19 std::partition(V1.begin(), V1.end(), f); // no-warning in PointerSorting()
20 std::stable_partition(V1.begin(), V1.end(), g); // no-warning in PointerSorting()
/dports/devel/llvm11/llvm-11.0.1.src/tools/clang/test/Analysis/
H A Dptr-sort.cpp11 std::vector<int> V1 = {a, b}; in PointerSorting() local
14 std::is_sorted(V1.begin(), V1.end()); // no-warning in PointerSorting()
15 std::nth_element(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
16 std::partial_sort(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
17 std::sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
18 std::stable_sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
19 std::partition(V1.begin(), V1.end(), f); // no-warning in PointerSorting()
20 std::stable_partition(V1.begin(), V1.end(), g); // no-warning in PointerSorting()
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/clang/test/Analysis/
H A Dptr-sort.cpp11 std::vector<int> V1 = {a, b}; in PointerSorting() local
14 std::is_sorted(V1.begin(), V1.end()); // no-warning in PointerSorting()
15 std::nth_element(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
16 std::partial_sort(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
17 std::sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
18 std::stable_sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
19 std::partition(V1.begin(), V1.end(), f); // no-warning in PointerSorting()
20 std::stable_partition(V1.begin(), V1.end(), g); // no-warning in PointerSorting()
/dports/devel/llvm90/llvm-9.0.1.src/tools/clang/test/Analysis/
H A Dptr-sort.cpp11 std::vector<int> V1 = {a, b}; in PointerSorting() local
14 std::is_sorted(V1.begin(), V1.end()); // no-warning in PointerSorting()
15 std::nth_element(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
16 std::partial_sort(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
17 std::sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
18 std::stable_sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
19 std::partition(V1.begin(), V1.end(), f); // no-warning in PointerSorting()
20 std::stable_partition(V1.begin(), V1.end(), g); // no-warning in PointerSorting()
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/clang/test/Analysis/
H A Dptr-sort.cpp11 std::vector<int> V1 = {a, b}; in PointerSorting() local
14 std::is_sorted(V1.begin(), V1.end()); // no-warning in PointerSorting()
15 std::nth_element(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
16 std::partial_sort(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
17 std::sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
18 std::stable_sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
19 std::partition(V1.begin(), V1.end(), f); // no-warning in PointerSorting()
20 std::stable_partition(V1.begin(), V1.end(), g); // no-warning in PointerSorting()
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/clang/test/Analysis/
H A Dptr-sort.cpp11 std::vector<int> V1 = {a, b}; in PointerSorting() local
14 std::is_sorted(V1.begin(), V1.end()); // no-warning in PointerSorting()
15 std::nth_element(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
16 std::partial_sort(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
17 std::sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
18 std::stable_sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
19 std::partition(V1.begin(), V1.end(), f); // no-warning in PointerSorting()
20 std::stable_partition(V1.begin(), V1.end(), g); // no-warning in PointerSorting()
/dports/devel/llvm13/llvm-project-13.0.1.src/clang/test/Analysis/
H A Dptr-sort.cpp11 std::vector<int> V1 = {a, b}; in PointerSorting() local
14 std::is_sorted(V1.begin(), V1.end()); // no-warning in PointerSorting()
15 std::nth_element(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
16 std::partial_sort(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
17 std::sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
18 std::stable_sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
19 std::partition(V1.begin(), V1.end(), f); // no-warning in PointerSorting()
20 std::stable_partition(V1.begin(), V1.end(), g); // no-warning in PointerSorting()
/dports/lang/clang-mesa/clang-13.0.1.src/test/Analysis/
H A Dptr-sort.cpp11 std::vector<int> V1 = {a, b}; in PointerSorting() local
14 std::is_sorted(V1.begin(), V1.end()); // no-warning in PointerSorting()
15 std::nth_element(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
16 std::partial_sort(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
17 std::sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
18 std::stable_sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
19 std::partition(V1.begin(), V1.end(), f); // no-warning in PointerSorting()
20 std::stable_partition(V1.begin(), V1.end(), g); // no-warning in PointerSorting()
/dports/biology/gatk/gatk-4.2.0.0/src/main/java/org/broadinstitute/hellbender/tools/spark/sv/utils/
H A DSVIntervalTree.java440 V1 setValue( final V1 value );
443 static final class Node<V1> implements Entry<V1> {
480 public V1 setValue( final V1 value ) {
498 Node<V1> insertLeft( final SVInterval interval, final V1 value, final Node<V1> root ) {
507 Node<V1> insertRight( final SVInterval interval, final V1 value, final Node<V1> root ) {
556 Node<V1> remove( final Node<V1> initialRoot ) {
616 … static <V1> Node<V1> getNextOverlapper( final Node<V1> startingNode, final SVInterval interval ) {
639 static <V1> Node<V1> findByRank( final Node<V1> startingNode, final int initialRank ) {
688 private Node<V1> spliceOut( final Node<V1> child, final Node<V1> initialRoot ) {
809 …private static <V1> Node<V1> insertFixup( final Node<V1> initialDaughter, final Node<V1> initialRo…
[all …]

12345678910>>...661