searchengines-web/MeiliSearch
searchengines-web/MeiliSearch
1
0
Fork 0
mirror of https://github.com/meilisearch/MeiliSearch synced 2024-11-26 14:54:27 +01:00
Code Issues Releases Wiki Activity

Correctly mark non-tests as non-tests

Browse Source
This commit is contained in:
Louis Dureuil 2023-11-06 11:03:56 +01:00
parent 1b2ea6cf19
commit 1bccf2079e
No known key found for this signature in database
2 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
milli/src/search/facet/facet_sort_ascending.rs
View File

@ -13,7 +13,7 @@ use crate::heed_codec::ByteSliceRefCodec;
/// The documents returned by the iterator are grouped by the facet values that /// The documents returned by the iterator are grouped by the facet values that
/// determined their rank. For example, given the documents: /// determined their rank. For example, given the documents:
/// ///
/// ```ignore /// ```text
/// 0: { "colour": ["blue", "green"] } /// 0: { "colour": ["blue", "green"] }
/// 1: { "colour": ["blue", "red"] } /// 1: { "colour": ["blue", "red"] }
/// 2: { "colour": ["orange", "red"] } /// 2: { "colour": ["orange", "red"] }
@ -22,7 +22,7 @@ use crate::heed_codec::ByteSliceRefCodec;
/// ``` /// ```
/// Then calling the function on the candidates `[0, 2, 3, 4]` will return an iterator /// Then calling the function on the candidates `[0, 2, 3, 4]` will return an iterator
/// over the following elements: /// over the following elements:
/// ```ignore /// ```text
/// [0, 4] // corresponds to all the documents within the candidates that have the facet value "blue" /// [0, 4] // corresponds to all the documents within the candidates that have the facet value "blue"
/// [3] // same for "green" /// [3] // same for "green"
/// [2] // same for "orange" /// [2] // same for "orange"

4
milli/src/update/facet/mod.rs
View File

@ -14,7 +14,7 @@ The databases must be able to return results for queries such as:
The algorithms that implement these queries are found in the `src/search/facet` folder. The algorithms that implement these queries are found in the `src/search/facet` folder.
To make these queries fast to compute, the database adopts a tree structure: To make these queries fast to compute, the database adopts a tree structure:
```ignore ```text
┌───────────────────────────────┬───────────────────────────────┬───────────────┐ ┌───────────────────────────────┬───────────────────────────────┬───────────────┐
┌───────┐ │ "ab" (2) │ "gaf" (2) │ "woz" (1) │ ┌───────┐ │ "ab" (2) │ "gaf" (2) │ "woz" (1) │
│Level 2│ │ │ │ │ │Level 2│ │ │ │ │
@ -41,7 +41,7 @@ These documents all contain a facet value that is contained within `ab .. gaf`.
In the database, each node is represented by a key/value pair encoded as a [`FacetGroupKey`] and a In the database, each node is represented by a key/value pair encoded as a [`FacetGroupKey`] and a
[`FacetGroupValue`], which have the following format: [`FacetGroupValue`], which have the following format:
```ignore ```text
FacetGroupKey: FacetGroupKey:
- field id : u16 - field id : u16
- level : u8 - level : u8