Home
last modified time | relevance | path

Searched refs:sequence1 (Results 1 – 25 of 343) sorted by relevance

12345678910>>...14

/dports/www/dolibarr13/dolibarr-13.0.5/htdocs/ticket/class/
H A Dutils_diff.class.php41 $sequence1 = $string1;
46 $sequence1 = preg_split('/\R/', $string1);
48 $end1 = count($sequence1) - 1;
54 && $sequence1[$start] == $sequence2[$start]) {
60 && $sequence1[$end1] == $sequence2[$end2]) {
74 $diff[] = array($sequence1[$index], self::UNMODIFIED);
80 $end2 = ($compareCharacters ? strlen($sequence1) : count($sequence1));
83 $diff[] = array($sequence1[$index], self::UNMODIFIED);
115 * @param string $sequence1 the first sequence
157 * @param string $sequence1 the first sequence
[all …]
/dports/www/dolibarr/dolibarr-14.0.3/htdocs/core/class/
H A Dutils_diff.class.php41 $sequence1 = $string1;
46 $sequence1 = preg_split('/\R/', $string1);
48 $end1 = count($sequence1) - 1;
54 && $sequence1[$start] == $sequence2[$start]) {
60 && $sequence1[$end1] == $sequence2[$end2]) {
74 $diff[] = array($sequence1[$index], self::UNMODIFIED);
80 $end2 = ($compareCharacters ? strlen($sequence1) : count($sequence1));
82 $diff[] = array($sequence1[$index], self::UNMODIFIED);
114 * @param string $sequence1 the first sequence
156 * @param string $sequence1 the first sequence
[all …]
/dports/science/libghemical/libghemical-3.0.0/src/
H A Dchn_info.cpp43 sequence1 = NULL; in chn_info()
61 sequence1 = new char[length + 1]; in chn_info()
62 for (i32s n1 = 0;n1 < length;n1++) sequence1[n1] = 0; in chn_info()
63 sequence1[length] = 0; // endmark in chn_info()
84 if (p1.sequence1 != NULL) in chn_info()
86 sequence1 = new char[length + 1]; in chn_info()
87 for (i32s n1 = 0;n1 < length;n1++) sequence1[n1] = p1.sequence1[n1]; in chn_info()
89 sequence1[length] = 0; // endmark in chn_info()
91 else sequence1 = NULL; in chn_info()
138 if (sequence1 != NULL) delete[] sequence1; in ~chn_info()
/dports/graphics/geos/geos-3.9.1/tests/unit/geom/
H A DCoordinateArraySequenceTest.cpp381 sequence1.add(c1); in test()
382 sequence1.add(c2); in test()
383 sequence1.add(c3); in test()
395 ensure(sequence1 != sequence2); in test()
396 ensure(sequence2 != sequence1); in test()
399 sequence1.add(c3); in test()
405 sequence1.add(c3); in test()
408 ensure(sequence1 != sequence2); in test()
409 ensure(sequence2 != sequence1); in test()
427 sequence1.add(c1); in test()
[all …]
/dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.Collections.Immutable/src/System/Collections/Immutable/
H A DImmutableExtensions.cs46 …internal static bool CollectionEquals<T>(this IEnumerable<T> sequence1, IEnumerable<T> sequence2, … in CollectionEquals() argument
48 if (sequence1 == sequence2) in CollectionEquals()
53 if ((sequence1 == null) ^ (sequence2 == null)) in CollectionEquals()
59 if (sequence1.TryGetCount(out count1) && sequence2.TryGetCount(out count2)) in CollectionEquals()
72 return sequence1.SequenceEqual(sequence2, equalityComparer); in CollectionEquals()
84 …internal static bool CollectionEquals<T>(this IEnumerable<T> sequence1, IEnumerable sequence2, IEq… in CollectionEquals() argument
86 if (sequence1 == sequence2) in CollectionEquals()
91 if ((sequence1 == null) ^ (sequence2 == null)) in CollectionEquals()
97 if (sequence1.TryGetCount(out count1) && sequence2.TryGetCount<T>(out count2)) in CollectionEquals()
120 return sequence1.SequenceEqual(sequence2OfT, equalityComparerOfT); in CollectionEquals()
[all …]
/dports/lang/abcl/abcl-src-1.8.0/src/org/armedbear/lisp/
H A Dsearch.lisp118 (defun search (sequence1 sequence2 &rest args &key from-end (test #'eql)
120 (let ((end1 (or end1 (length sequence1)))
125 (list-search sequence2 sequence1)
126 (vector-search sequence2 sequence1)
127 (apply #'sequence:search sequence1 sequence2 args))))
129 (defun simple-search (sequence1 sequence2)
130 (cond ((and (stringp sequence1) (stringp sequence2))
131 (simple-string-search sequence1 sequence2))
133 (simple-vector-search sequence1 sequence2))
135 (search sequence1 sequence2 :from-end nil))))
H A Dmismatch.lisp75 (defun mismatch (sequence1 sequence2 &rest args &key from-end test test-not
78 (if (and (or (listp sequence1) (arrayp sequence1))
80 (with-start-end start1 end1 sequence1
88 (funcall key (elt sequence1 i1))
96 (funcall key (elt sequence1 i1))
99 (apply #'sequence:mismatch sequence1 sequence2 args)))
/dports/biology/py-ont-fast5-api/ont_fast5_api-release_4.0.0/test/
H A Dtest_alignment_tools.py51 sequence1 = ''.join(np.random.choice(['A', 'C', 'G', 'T'], 100))
53 sequence2 = ''.join([bc[letter] for letter in sequence1[::-1]])
77 align.add_alignment_data('template', sam1, sequence1)
79 align.add_alignment_data('2d', sam3, sequence1)
84 self.assertEqual(sequence1, seq)
90 self.assertEqual(sequence1, seq)
/dports/security/hashcat/hashcat-6.2.5/OpenCL/
H A Dm16100_a1-pure.cl92 u32 sequence1[4];
100 sequence1[0] = 0;
101 sequence1[1] = 0;
102 sequence1[2] = 0;
103 sequence1[3] = 0;
113 md5_update_64 (&ctx, sequence0, sequence1, sequence2, sequence3, 2);
250 u32 sequence1[4];
258 sequence1[0] = 0;
259 sequence1[1] = 0;
260 sequence1[2] = 0;
[all …]
H A Dm16100_a0-pure.cl99 u32 sequence1[4];
107 sequence1[0] = 0;
108 sequence1[1] = 0;
109 sequence1[2] = 0;
110 sequence1[3] = 0;
120 md5_update_64 (&ctx, sequence0, sequence1, sequence2, sequence3, 2);
261 u32 sequence1[4];
269 sequence1[0] = 0;
270 sequence1[1] = 0;
271 sequence1[2] = 0;
[all …]
H A Dm16100_a3-pure.cl109 u32x sequence1[4];
117 sequence1[0] = 0;
118 sequence1[1] = 0;
119 sequence1[2] = 0;
120 sequence1[3] = 0;
130 md5_update_vector_64 (&ctx, sequence0, sequence1, sequence2, sequence3, 2);
284 u32x sequence1[4];
292 sequence1[0] = 0;
293 sequence1[1] = 0;
294 sequence1[2] = 0;
[all …]
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform.team/bundles/org.eclipse.core.net/src/org/eclipse/core/internal/net/
H A DStringUtil.java68 public static final boolean equals(final CharSequence sequence1, in equals() argument
70 if (sequence1 == sequence2) { in equals()
72 } else if (sequence1 == null || sequence2 == null) { in equals()
75 return sequence1.equals(sequence2); in equals()
/dports/net/kea/kea-2.0.1/src/lib/http/tests/
H A Dtls_client_unittests.cc396 ASSERT_TRUE(sequence1); in testConsecutiveRequests()
402 EXPECT_NE(sequence1->intValue(), sequence2->intValue()); in testConsecutiveRequests()
458 ASSERT_TRUE(sequence1); in testMultipleDestinations()
464 EXPECT_NE(sequence1->intValue(), sequence2->intValue()); in testMultipleDestinations()
522 ASSERT_TRUE(sequence1); in testMultipleTlsContexts()
528 EXPECT_NE(sequence1->intValue(), sequence2->intValue()); in testMultipleTlsContexts()
562 ASSERT_TRUE(sequence1); in testIdleConnection()
590 EXPECT_NE(sequence1->intValue(), sequence2->intValue()); in testIdleConnection()
955 ASSERT_TRUE(sequence1); in testConnectCloseCallbacks()
1044 ASSERT_TRUE(sequence1); in testCloseIfOutOfBand()
[all …]
/dports/devel/boost-docs/boost_1_72_0/boost/graph/
H A Dbipartite.hpp152 … BiDirectionalIterator1, BiDirectionalIterator1> sequence1, std::pair <BiDirectionalIterator2, in reverse_mismatch() argument
155 if (sequence1.first == sequence1.second || sequence2.first == sequence2.second) in reverse_mismatch()
156 return std::make_pair (sequence1.first, sequence2.first); in reverse_mismatch()
158 BiDirectionalIterator1 iter1 = sequence1.second; in reverse_mismatch()
171 if (iter1 == sequence1.first) in reverse_mismatch()
/dports/devel/R-cran-BH/BH/inst/include/boost/graph/
H A Dbipartite.hpp154 std::pair< BiDirectionalIterator1, BiDirectionalIterator1 > sequence1, in reverse_mismatch()
157 if (sequence1.first == sequence1.second in reverse_mismatch()
159 return std::make_pair(sequence1.first, sequence2.first); in reverse_mismatch()
161 BiDirectionalIterator1 iter1 = sequence1.second; in reverse_mismatch()
174 if (iter1 == sequence1.first) in reverse_mismatch()
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/
H A Dbipartite.hpp152 … BiDirectionalIterator1, BiDirectionalIterator1> sequence1, std::pair <BiDirectionalIterator2, in reverse_mismatch() argument
155 if (sequence1.first == sequence1.second || sequence2.first == sequence2.second) in reverse_mismatch()
156 return std::make_pair (sequence1.first, sequence2.first); in reverse_mismatch()
158 BiDirectionalIterator1 iter1 = sequence1.second; in reverse_mismatch()
171 if (iter1 == sequence1.first) in reverse_mismatch()
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/
H A Dbipartite.hpp155 std::pair< BiDirectionalIterator1, BiDirectionalIterator1 > sequence1, in reverse_mismatch()
158 if (sequence1.first == sequence1.second in reverse_mismatch()
160 return std::make_pair(sequence1.first, sequence2.first); in reverse_mismatch()
162 BiDirectionalIterator1 iter1 = sequence1.second; in reverse_mismatch()
175 if (iter1 == sequence1.first) in reverse_mismatch()
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/
H A Dbipartite.hpp155 std::pair< BiDirectionalIterator1, BiDirectionalIterator1 > sequence1, in reverse_mismatch()
158 if (sequence1.first == sequence1.second in reverse_mismatch()
160 return std::make_pair(sequence1.first, sequence2.first); in reverse_mismatch()
162 BiDirectionalIterator1 iter1 = sequence1.second; in reverse_mismatch()
175 if (iter1 == sequence1.first) in reverse_mismatch()
/dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/
H A Dbipartite.hpp152 … BiDirectionalIterator1, BiDirectionalIterator1> sequence1, std::pair <BiDirectionalIterator2, in reverse_mismatch() argument
155 if (sequence1.first == sequence1.second || sequence2.first == sequence2.second) in reverse_mismatch()
156 return std::make_pair (sequence1.first, sequence2.first); in reverse_mismatch()
158 BiDirectionalIterator1 iter1 = sequence1.second; in reverse_mismatch()
171 if (iter1 == sequence1.first) in reverse_mismatch()
/dports/databases/xtrabackup/boost_1_59_0/boost/graph/
H A Dbipartite.hpp152 … BiDirectionalIterator1, BiDirectionalIterator1> sequence1, std::pair <BiDirectionalIterator2, in reverse_mismatch() argument
155 if (sequence1.first == sequence1.second || sequence2.first == sequence2.second) in reverse_mismatch()
156 return std::make_pair (sequence1.first, sequence2.first); in reverse_mismatch()
158 BiDirectionalIterator1 iter1 = sequence1.second; in reverse_mismatch()
171 if (iter1 == sequence1.first) in reverse_mismatch()
/dports/databases/percona57-server/boost_1_59_0/boost/graph/
H A Dbipartite.hpp152 … BiDirectionalIterator1, BiDirectionalIterator1> sequence1, std::pair <BiDirectionalIterator2, in reverse_mismatch() argument
155 if (sequence1.first == sequence1.second || sequence2.first == sequence2.second) in reverse_mismatch()
156 return std::make_pair (sequence1.first, sequence2.first); in reverse_mismatch()
158 BiDirectionalIterator1 iter1 = sequence1.second; in reverse_mismatch()
171 if (iter1 == sequence1.first) in reverse_mismatch()
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/
H A Dbipartite.hpp152 … BiDirectionalIterator1, BiDirectionalIterator1> sequence1, std::pair <BiDirectionalIterator2, in reverse_mismatch() argument
155 if (sequence1.first == sequence1.second || sequence2.first == sequence2.second) in reverse_mismatch()
156 return std::make_pair (sequence1.first, sequence2.first); in reverse_mismatch()
158 BiDirectionalIterator1 iter1 = sequence1.second; in reverse_mismatch()
171 if (iter1 == sequence1.first) in reverse_mismatch()
/dports/databases/percona57-client/boost_1_59_0/boost/graph/
H A Dbipartite.hpp152 … BiDirectionalIterator1, BiDirectionalIterator1> sequence1, std::pair <BiDirectionalIterator2, in reverse_mismatch() argument
155 if (sequence1.first == sequence1.second || sequence2.first == sequence2.second) in reverse_mismatch()
156 return std::make_pair (sequence1.first, sequence2.first); in reverse_mismatch()
158 BiDirectionalIterator1 iter1 = sequence1.second; in reverse_mismatch()
171 if (iter1 == sequence1.first) in reverse_mismatch()
/dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/
H A Dbipartite.hpp152 … BiDirectionalIterator1, BiDirectionalIterator1> sequence1, std::pair <BiDirectionalIterator2, in reverse_mismatch() argument
155 if (sequence1.first == sequence1.second || sequence2.first == sequence2.second) in reverse_mismatch()
156 return std::make_pair (sequence1.first, sequence2.first); in reverse_mismatch()
158 BiDirectionalIterator1 iter1 = sequence1.second; in reverse_mismatch()
171 if (iter1 == sequence1.first) in reverse_mismatch()
/dports/devel/boost-libs/boost_1_72_0/boost/graph/
H A Dbipartite.hpp152 … BiDirectionalIterator1, BiDirectionalIterator1> sequence1, std::pair <BiDirectionalIterator2, in reverse_mismatch() argument
155 if (sequence1.first == sequence1.second || sequence2.first == sequence2.second) in reverse_mismatch()
156 return std::make_pair (sequence1.first, sequence2.first); in reverse_mismatch()
158 BiDirectionalIterator1 iter1 = sequence1.second; in reverse_mismatch()
171 if (iter1 == sequence1.first) in reverse_mismatch()

12345678910>>...14