(text: T)
| 1315 | /// A `u64` representing the hash value of the input byte slice. |
| 1316 | #[inline(always)] |
| 1317 | pub fn hash<T>(text: T) -> u64 |
| 1318 | where |
| 1319 | T: AsRef<[u8]>, |
| 1320 | { |
| 1321 | hash_with_seed(text, 0) |
| 1322 | } |
| 1323 | |
| 1324 | /// Locates the first matching substring within `haystack` that equals `needle`. |
| 1325 | /// This function is similar to the `memmem()` function in LibC, but, unlike `strstr()`, |
searching dependent graphs…