- Sort Score
- Num 10 results
- Language All
Results 1 - 6 of 6 for Arabic (0.19 seconds)
-
src/main/resources/fess_indices/fess.json
"type": "keyword_marker", "keywords_path": "${fess.dictionary.path}ar/protwords.txt" }, "arabic_stemmer": { "type": "stemmer", "language": "arabic" }, "arabic_override": { "type": "stemmer_override", "rules_path": "${fess.dictionary.path}ar/stemmer_override.txt" }, "armenian_stop": {
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sun Mar 15 07:52:55 GMT 2026 - 40K bytes - Click Count (0) -
src/main/resources/fess_indices/_aws/fess.json
"arabic_keywords": { "type": "keyword_marker", "keywords": ["مرحباا", "عالم", "بحث"] }, "arabic_stemmer": { "type": "stemmer", "language": "arabic" }, "arabic_override": { "type": "stemmer_override", "rules": [] }, "armenian_stop": { "type": "stop",
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sun Mar 15 07:52:55 GMT 2026 - 117.5K bytes - Click Count (0) -
src/main/resources/fess_indices/_cloud/fess.json
"arabic_keywords": { "type": "keyword_marker", "keywords": ["مرحباا", "عالم", "بحث"] }, "arabic_stemmer": { "type": "stemmer", "language": "arabic" }, "arabic_override": { "type": "stemmer_override", "rules": [] }, "armenian_stop": { "type": "stop",
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sun Mar 15 07:52:55 GMT 2026 - 117.5K bytes - Click Count (0) -
docs/en/docs/release-notes.md
* 🌐 Add French translation for `docs/fr/docs/index.md`. PR [#9265](https://github.com/tiangolo/fastapi/pull/9265) by [@frabc](https://github.com/frabc). * 🌐 Add Russian translation for `docs/ru/docs/tutorial/query-params-str-validations.md`. PR [#9267](https://github.com/tiangolo/fastapi/pull/9267) by [@dedkot01](https://github.com/dedkot01).
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Apr 03 12:07:04 GMT 2026 - 631K bytes - Click Count (0) -
src/bytes/bytes.go
if haveFastIndex { if j := bytealg.Index(s[i-last:], b[:n]); j >= 0 { return i + j - last } } else { // If bytealg.Index is not available a brute force search is // ~1.5-3x faster than Rabin-Karp since n is small. c0 := b[last] c1 := b[last-1] // There are at least 2 chars to match loop: for ; i < len(s); i++ { if s[i] == c0 && s[i-1] == c1 { for k := 2; k < n; k++ {Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Mar 12 17:56:55 GMT 2026 - 36.3K bytes - Click Count (0) -
src/bytes/bytes_test.go
{"fofofofofoofofoffofoobarfoo", "foobars", -1}, {"foofyfoobarfoobar", "y", 4}, {"oooooooooooooooooooooo", "r", -1}, {"oxoxoxoxoxoxoxoxoxoxoxoy", "oy", 22}, {"oxoxoxoxoxoxoxoxoxoxoxox", "oy", -1}, // test fallback to Rabin-Karp. {"000000000000000000000000000000000000000000000000000000000000000000000001", "0000000000000000000000000000000000000000000000000000000000000000001", 5}, // test fallback to IndexRune {"oxoxoxoxoxoxoxoxoxoxox☺", "☺", 22},Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Wed Mar 11 03:07:05 GMT 2026 - 62.9K bytes - Click Count (0)