- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 62 for naar (0.21 sec)
-
src/main/resources/fess_indices/fess/nl/stopwords.txt
van ik te dat die in een hij het niet zijn is was op aan met als voor had er maar om hem dan zou of wat mijn men dit zo door over ze zich bij ook tot je mij uit der daar haar naar heb hoe heeft hebben deze u want nog zal me zij nu ge geen omdat iets worden
Plain Text - Registered: Mon Apr 22 08:04:10 GMT 2024 - Last Modified: Mon Nov 27 12:59:36 GMT 2023 - 592 bytes - Viewed (0) -
src/main/resources/fess_indices/_aws/fess.json
"stopwords": ["de", "en", "van", "ik", "te", "dat", "die", "in", "een", "hij", "het", "niet", "zijn", "is", "was", "op", "aan", "met", "als", "voor", "had", "er", "maar", "om", "hem", "dan", "zou", "of", "wat", "mijn", "men", "dit", "zo", "door", "over", "ze", "zich", "bij", "ook", "tot", "je", "mij", "uit", "der", "daar", "haar", "naar", "heb", "hoe", "heeft", "hebben", "deze", "u", "want", "nog", "zal", "me", "zij", "nu", "ge", "geen", "omdat", "iets", "worden", "toch", "al", "waren", "veel", "meer",...
Json - Registered: Mon Apr 22 08:04:10 GMT 2024 - Last Modified: Tue Mar 23 12:38:28 GMT 2021 - 117.3K bytes - Viewed (0) -
src/main/resources/fess_indices/_cloud/fess.json
"stopwords": ["de", "en", "van", "ik", "te", "dat", "die", "in", "een", "hij", "het", "niet", "zijn", "is", "was", "op", "aan", "met", "als", "voor", "had", "er", "maar", "om", "hem", "dan", "zou", "of", "wat", "mijn", "men", "dit", "zo", "door", "over", "ze", "zich", "bij", "ook", "tot", "je", "mij", "uit", "der", "daar", "haar", "naar", "heb", "hoe", "heeft", "hebben", "deze", "u", "want", "nog", "zal", "me", "zij", "nu", "ge", "geen", "omdat", "iets", "worden", "toch", "al", "waren", "veel", "meer",...
Json - Registered: Mon Apr 22 08:04:10 GMT 2024 - Last Modified: Sat Feb 27 09:26:16 GMT 2021 - 117.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/MathTesting.java
return x.negate(); } }; /* * This list contains values that attempt to provoke overflow in integer operations. It contains * positive values on or near 2^N for N near multiples of 8 (near byte boundaries). */ static final ImmutableSet<Integer> POSITIVE_INTEGER_CANDIDATES; static final Iterable<Integer> NEGATIVE_INTEGER_CANDIDATES;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 11.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/MathTesting.java
return x.negate(); } }; /* * This list contains values that attempt to provoke overflow in integer operations. It contains * positive values on or near 2^N for N near multiples of 8 (near byte boundaries). */ static final ImmutableSet<Integer> POSITIVE_INTEGER_CANDIDATES; static final Iterable<Integer> NEGATIVE_INTEGER_CANDIDATES;
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 11.2K bytes - Viewed (0) -
src/bytes/boundary_test.go
} } func TestIndexNearPageBoundary(t *testing.T) { t.Parallel() q := dangerousSlice(t) if len(q) > 64 { // Only worry about when we're near the end of a page. q = q[len(q)-64:] } b := dangerousSlice(t) if len(b) > 256 { // Only worry about when we're near the end of a page. b = b[len(b)-256:] } for j := 1; j < len(q); j++ { q[j-1] = 1 // difference is only found on the last byte for i := range b {
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Thu Nov 30 20:05:58 GMT 2023 - 2.8K bytes - Viewed (0) -
okhttp/src/main/resources/okhttp3/internal/publicsuffix/PublicSuffixDatabase.gz
kasai.hyogo.jp kasama.ibaraki.jp kasamatsu.gifu.jp kasaoka.okayama.jp kashiba.nara.jp kashihara.nara.jp kashima.ibaraki.jp kashima.saga.jp kashiwa.chiba.jp kashiwara.osaka.jp kashiwazaki.niigata.jp kasserver.com kasuga.fukuoka.jp kasuga.hyogo.jp kasugai.aichi.jp kasukabe.saitama.jp kasumigaura.ibaraki.jp kasuya.fukuoka.jp kaszuby.pl katagami.akita.jp katano.osaka.jp katashina.gunma.jp katori.chiba.jp katowice.pl katsuragi.nara.jp katsuragi.wakayama.jp katsushika.tokyo.jp katsuura.chiba.jp katsuyama.fukui.jp...
Others - Registered: Fri Apr 26 11:42:10 GMT 2024 - Last Modified: Wed Dec 20 23:27:07 GMT 2023 - 40.4K bytes - Viewed (0) -
tensorflow/c/experimental/gradients/grad_test_helper.cc
memcpy(&danalytical[0], TF_TensorData(analytical_tensor), TF_TensorByteSize(analytical_tensor)); for (int j = 0; j < num_elem_numerical; j++) { ASSERT_NEAR(dnumerical[j], danalytical[j], abs_error); } TF_DeleteTensor(analytical_tensor); TF_DeleteTensor(numerical_tensor); delete[] danalytical; delete[] dnumerical; outputs[i]->Unref(); } }
C++ - Registered: Tue Mar 26 12:39:09 GMT 2024 - Last Modified: Wed Feb 28 13:53:47 GMT 2024 - 5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
this.predecessor = null; this.successor = null; return result; } /* * For discussion of the safety of the following methods for operating on predecessors and * successors, see the comments near the end of CompactHashMap, noting that the methods here call * requirePredecessors() and requireSuccessors(), which are defined at the end of this file. */ private int getPredecessor(int entry) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
links = null; return result; } /* * For discussion of the safety of the following methods for operating on predecessors and * successors, see the comments near the end of CompactHashMap, noting that the methods here call * link(), which is defined at the end of this file. */ private int getPredecessor(int entry) { return ((int) (link(entry) >>> 32)) - 1; }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0)