mirror of
https://github.com/facebookresearch/faiss.git
synced 2026-10-12 02:13:36 +00:00
Summary: Pull Request resolved: https://github.com/facebookresearch/faiss/pull/5444 We fix every remaining flake8 E501 (line > 80 chars) violation in fbcode/faiss/ (excluding gpu/), closing out a lint-cleanup initiative that a June 29, 2026 diff stack (9a05463576 -> d304e29b9a -> 7d140d86ca) explicitly promised but left 41% incomplete. The middle diff in that stack aligned .flake8's max-line-length to black's 80-char width and stated the remaining 277 violations after the config change were "genuine lint (E501 long strings/URLs, F401/F841/B011, etc.), addressed in later commits in this stack." The follow-up commit fixed only the F401/F403/F841/B011 categories (45 issues) and never touched E501, leaving 192 violations across 53 files live in trunk. A direct re-scan today found 201 violations across 54 files (two files gained lines since the original count). We fixed 183 violations across 52 files. Two of the originally-flagged files, benchs/bench_rabitq.py and demos/index_pq_flat_separate_codes_from_codebook.py, already carry a file-level `# flake8: noqa` directive (the second is a Bento/Grimaldi notebook export that also fails standalone py_compile due to embedded shell magic) -- flake8 ignores both files entirely, so no changes were needed there and they are excluded from this diff. Fix approach, by category: - The large majority of violations are prose: docstrings and comments rewrapped at word boundaries, preserving each file's existing indentation and docstring conventions. No wording was changed. - Code lines (function calls, f-strings, assert messages, long argument lists) were reflowed in black-compatible style: parenthesization, comma breaks, or implicit adjacent string-literal concatenation. Every touched file is confirmed unchanged by `black --line-length 80 --diff` after the edit. - A small number of genuinely unwrappable long URLs (no reasonable break point) were suppressed with `# noqa: E501` rather than force-wrapped, matching the precedent set by the original black-format diff stack. - demos/offline_ivf/offline_ivf.py: a repeated, non-trivial ratio expression used in both an assert condition and its (lazily-evaluated) failure message was hoisted into a single local variable, eliminating the duplicate computation. The expression is pure and deterministic (built from already-computed arrays), so this is behaviorally identical to the original -- not a functional change. - `arc lint -a` additionally auto-fixed a real bug it detected while processing these files: `raise NotImplemented` -> `raise NotImplementedError` in contrib/evaluation.py (the sentinel object NotImplemented is not an exception type; raising it produces a TypeError masking the intended NotImplementedError). It also added a missing trailing newline in benchs/fb/bench_index_binary_from_float.py and, in the same file, rewrote the `#!/usr/bin/env python2` shebang to `#!/usr/bin/env fbpython` -- that rewrite was reverted by hand, since the file still does `import cPickle` (a Python 2-only module), so the auto-fix would have made the shebang describe an interpreter the script cannot actually run under. Fixing the underlying py2-to-py3 migration is out of scope for this line-length-only sweep. - Rebasing onto master (this diff's base commit had drifted) surfaced two concurrent upstream fixes to `check_ref_knn_with_draws(...)` calls in tests/test_ivf_flat_panorama.py and tests/test_refine_panorama.py (an unrelated in-flight correctness fix passing `D_panorama`/`atol` instead of a stale `D_regular` arg with no `atol`). The rebase took upstream's corrected arguments and re-applied only this diff's line-wrap on top. We verified zero functional change with an AST-level check: every string and f-string literal in every touched file was extracted before and after the edit and compared with whitespace normalized, confirming no wording, value, or expression was altered beyond the intended `# noqa: E501` suffixes and the one documented ratio-hoisting simplification above. Reviewed By: mnorris11 Differential Revision: D112525458 fbshipit-source-id: e4b85d73dafcaac779f3522a383a66e490fa942a
548 lines
17 KiB
Python
548 lines
17 KiB
Python
# Copyright (c) Meta Platforms, Inc. and affiliates.
|
|
#
|
|
# This source code is licensed under the MIT license found in the
|
|
# LICENSE file in the root directory of this source tree.
|
|
|
|
import os
|
|
import numpy as np
|
|
import faiss
|
|
import getpass
|
|
|
|
|
|
from .vecs_io import (
|
|
fvecs_read,
|
|
ivecs_read,
|
|
bvecs_mmap,
|
|
fvecs_mmap,
|
|
bvecs_iter,
|
|
bvecs_iter_chunked,
|
|
)
|
|
from .exhaustive_search import knn
|
|
|
|
|
|
class Dataset:
|
|
"""Generic abstract class for a test dataset"""
|
|
|
|
def __init__(self):
|
|
"""the constructor should set the following fields:"""
|
|
self.d = -1
|
|
self.metric = "L2" # or IP
|
|
self.nq = -1
|
|
self.nb = -1
|
|
self.nt = -1
|
|
|
|
def get_queries(self):
|
|
"""return the queries as a (nq, d) array"""
|
|
raise NotImplementedError()
|
|
|
|
def get_train(self, maxtrain=None):
|
|
"""return the queries as a (nt, d) array"""
|
|
raise NotImplementedError()
|
|
|
|
def get_database(self):
|
|
"""return the queries as a (nb, d) array"""
|
|
raise NotImplementedError()
|
|
|
|
def database_iterator(self, bs=128, split=(1, 0)):
|
|
"""returns an iterator on database vectors.
|
|
bs is the number of vectors per batch
|
|
split = (nsplit, rank) means the dataset is split in nsplit
|
|
shards and we want shard number rank
|
|
The default implementation just iterates over the full matrix
|
|
returned by get_dataset.
|
|
"""
|
|
xb = self.get_database()
|
|
nsplit, rank = split
|
|
i0, i1 = self.nb * rank // nsplit, self.nb * (rank + 1) // nsplit
|
|
for j0 in range(i0, i1, bs):
|
|
yield xb[j0 : min(j0 + bs, i1)]
|
|
|
|
def get_groundtruth(self, k=None):
|
|
"""return the ground truth for k-nearest neighbor search"""
|
|
raise NotImplementedError()
|
|
|
|
def get_groundtruth_range(self, thresh=None):
|
|
"""return the ground truth for range search"""
|
|
raise NotImplementedError()
|
|
|
|
def __str__(self):
|
|
return (
|
|
f"dataset in dimension {self.d}, with metric {self.metric}, "
|
|
f"size: Q {self.nq} B {self.nb} T {self.nt}"
|
|
)
|
|
|
|
def check_sizes(self):
|
|
"""runs the previous and checks the sizes of the matrices"""
|
|
assert self.get_queries().shape == (self.nq, self.d)
|
|
if self.nt > 0:
|
|
xt = self.get_train(maxtrain=123)
|
|
assert xt.shape == (123, self.d), "shape=%s" % (xt.shape,)
|
|
assert self.get_database().shape == (self.nb, self.d)
|
|
assert self.get_groundtruth(k=13).shape == (self.nq, 13)
|
|
|
|
|
|
class SyntheticDataset(Dataset):
|
|
"""A dataset that is not completely random but still challenging to
|
|
index
|
|
"""
|
|
|
|
def __init__(self, d, nt, nb, nq, metric="L2", seed=1338):
|
|
Dataset.__init__(self)
|
|
self.d, self.nt, self.nb, self.nq = d, nt, nb, nq
|
|
d1 = 10 # intrinsic dimension (more or less)
|
|
n = nb + nt + nq
|
|
rs = np.random.RandomState(seed)
|
|
x = rs.normal(size=(n, d1))
|
|
x = np.dot(x, rs.rand(d1, d))
|
|
# now we have a d1-dim ellipsoid in d-dimensional space
|
|
# higher factor (>4) -> higher frequency -> less linear
|
|
x = x * (rs.rand(d) * 4 + 0.1)
|
|
x = np.sin(x)
|
|
x = x.astype("float32")
|
|
self.metric = metric
|
|
self.xt = x[:nt]
|
|
self.xb = x[nt : nt + nb]
|
|
self.xq = x[nt + nb :]
|
|
|
|
def get_queries(self):
|
|
return self.xq
|
|
|
|
def get_train(self, maxtrain=None):
|
|
maxtrain = maxtrain if maxtrain is not None else self.nt
|
|
return self.xt[:maxtrain]
|
|
|
|
def get_database(self):
|
|
return self.xb
|
|
|
|
def get_groundtruth(self, k=100):
|
|
return knn(
|
|
self.xq,
|
|
self.xb,
|
|
k,
|
|
(
|
|
faiss.METRIC_L2
|
|
if self.metric == "L2"
|
|
else faiss.METRIC_INNER_PRODUCT
|
|
),
|
|
)[1]
|
|
|
|
|
|
############################################################################
|
|
# The following datasets are a few standard open-source datasets
|
|
# they should be stored in a directory, and we start by guessing where
|
|
# that directory is
|
|
############################################################################
|
|
|
|
username = getpass.getuser()
|
|
|
|
for dataset_basedir in (
|
|
"/datasets01/simsearch/041218/",
|
|
"/mnt/vol/gfsai-flash3-east/ai-group/datasets/simsearch/",
|
|
f"/home/{username}/simsearch/data/",
|
|
):
|
|
if os.path.exists(dataset_basedir):
|
|
break
|
|
else:
|
|
# users can link their data directory to `./data`
|
|
dataset_basedir = "data/"
|
|
|
|
|
|
def set_dataset_basedir(path):
|
|
global dataset_basedir
|
|
dataset_basedir = path
|
|
|
|
|
|
class DatasetSIFT1M(Dataset):
|
|
"""
|
|
The original dataset is available at: http://corpus-texmex.irisa.fr/
|
|
(ANN_SIFT1M)
|
|
"""
|
|
|
|
def __init__(self):
|
|
Dataset.__init__(self)
|
|
self.d, self.nt, self.nb, self.nq = 128, 100000, 1000000, 10000
|
|
self.basedir = dataset_basedir + "sift1M/"
|
|
|
|
def get_queries(self):
|
|
return fvecs_read(self.basedir + "sift_query.fvecs")
|
|
|
|
def get_train(self, maxtrain=None):
|
|
maxtrain = maxtrain if maxtrain is not None else self.nt
|
|
return fvecs_read(self.basedir + "sift_learn.fvecs")[:maxtrain]
|
|
|
|
def get_database(self):
|
|
return fvecs_read(self.basedir + "sift_base.fvecs")
|
|
|
|
def get_groundtruth(self, k=None):
|
|
gt = ivecs_read(self.basedir + "sift_groundtruth.ivecs")
|
|
if k is not None:
|
|
assert k <= 100
|
|
gt = gt[:, :k]
|
|
return gt
|
|
|
|
|
|
def sanitize(x):
|
|
return np.ascontiguousarray(x, dtype="float32")
|
|
|
|
|
|
class DatasetBigANN(Dataset):
|
|
"""
|
|
The original dataset is available at: http://corpus-texmex.irisa.fr/
|
|
(ANN_SIFT1B)
|
|
"""
|
|
|
|
def __init__(self, nb_M=1000):
|
|
Dataset.__init__(self)
|
|
assert nb_M in (1, 2, 5, 10, 20, 50, 100, 200, 500, 1000)
|
|
self.nb_M = nb_M
|
|
nb = nb_M * 10**6
|
|
self.d, self.nt, self.nb, self.nq = 128, 10**8, nb, 10000
|
|
self.basedir = dataset_basedir + "bigann/"
|
|
|
|
def get_queries(self):
|
|
return sanitize(bvecs_mmap(self.basedir + "bigann_query.bvecs")[:])
|
|
|
|
def get_train(self, maxtrain=None):
|
|
maxtrain = maxtrain if maxtrain is not None else self.nt
|
|
return sanitize(
|
|
bvecs_mmap(self.basedir + "bigann_learn.bvecs")[:maxtrain]
|
|
)
|
|
|
|
def get_groundtruth(self, k=None):
|
|
gt = ivecs_read(self.basedir + "gnd/idx_%dM.ivecs" % self.nb_M)
|
|
if k is not None:
|
|
assert k <= 100
|
|
gt = gt[:, :k]
|
|
return gt
|
|
|
|
def get_database(self):
|
|
assert self.nb_M < 100, "dataset too large, use iterator"
|
|
return sanitize(
|
|
bvecs_mmap(self.basedir + "bigann_base.bvecs")[: self.nb]
|
|
)
|
|
|
|
def database_iterator(self, bs=128, split=(1, 0)):
|
|
xb = bvecs_mmap(self.basedir + "bigann_base.bvecs")
|
|
nsplit, rank = split
|
|
i0, i1 = self.nb * rank // nsplit, self.nb * (rank + 1) // nsplit
|
|
for j0 in range(i0, i1, bs):
|
|
yield sanitize(xb[j0 : min(j0 + bs, i1)])
|
|
|
|
|
|
class DatasetDeep1B(Dataset):
|
|
"""
|
|
See
|
|
https://github.com/facebookresearch/faiss/tree/main/benchs#getting-deep1b
|
|
on how to get the data
|
|
"""
|
|
|
|
def __init__(self, nb=10**9):
|
|
Dataset.__init__(self)
|
|
nb_to_name = {
|
|
10**5: "100k",
|
|
10**6: "1M",
|
|
10**7: "10M",
|
|
10**8: "100M",
|
|
10**9: "1B",
|
|
}
|
|
assert nb in nb_to_name
|
|
self.d, self.nt, self.nb, self.nq = 96, 358480000, nb, 10000
|
|
self.basedir = dataset_basedir + "deep1b/"
|
|
self.gt_fname = "%sdeep%s_groundtruth.ivecs" % (
|
|
self.basedir,
|
|
nb_to_name[self.nb],
|
|
)
|
|
|
|
def get_queries(self):
|
|
return sanitize(fvecs_read(self.basedir + "deep1B_queries.fvecs"))
|
|
|
|
def get_train(self, maxtrain=None):
|
|
maxtrain = maxtrain if maxtrain is not None else self.nt
|
|
return sanitize(fvecs_mmap(self.basedir + "learn.fvecs")[:maxtrain])
|
|
|
|
def get_groundtruth(self, k=None):
|
|
gt = ivecs_read(self.gt_fname)
|
|
if k is not None:
|
|
assert k <= 100
|
|
gt = gt[:, :k]
|
|
return gt
|
|
|
|
def get_database(self):
|
|
assert self.nb <= 10**8, "dataset too large, use iterator"
|
|
return sanitize(fvecs_mmap(self.basedir + "base.fvecs")[: self.nb])
|
|
|
|
def database_iterator(self, bs=128, split=(1, 0)):
|
|
xb = fvecs_mmap(self.basedir + "base.fvecs")
|
|
nsplit, rank = split
|
|
i0, i1 = self.nb * rank // nsplit, self.nb * (rank + 1) // nsplit
|
|
for j0 in range(i0, i1, bs):
|
|
yield sanitize(xb[j0 : min(j0 + bs, i1)])
|
|
|
|
|
|
class DatasetGlove(Dataset):
|
|
"""
|
|
Data from http://ann-benchmarks.com/glove-100-angular.hdf5
|
|
"""
|
|
|
|
def __init__(self, loc=None, download=False):
|
|
import h5py
|
|
|
|
assert not download, "not implemented"
|
|
if not loc:
|
|
loc = dataset_basedir + "glove/glove-100-angular.hdf5"
|
|
self.glove_h5py = h5py.File(loc, "r")
|
|
# IP and L2 are equivalent in this case, but it is traditionally
|
|
# seen as an IP dataset
|
|
self.metric = "IP"
|
|
self.d, self.nt = 100, 0
|
|
self.nb = self.glove_h5py["train"].shape[0]
|
|
self.nq = self.glove_h5py["test"].shape[0]
|
|
|
|
def get_queries(self):
|
|
xq = np.array(self.glove_h5py["test"])
|
|
faiss.normalize_L2(xq)
|
|
return xq
|
|
|
|
def get_database(self):
|
|
xb = np.array(self.glove_h5py["train"])
|
|
faiss.normalize_L2(xb)
|
|
return xb
|
|
|
|
def get_groundtruth(self, k=None):
|
|
gt = self.glove_h5py["neighbors"]
|
|
if k is not None:
|
|
assert k <= 100
|
|
gt = gt[:, :k]
|
|
return gt
|
|
|
|
|
|
class DatasetMusic100(Dataset):
|
|
"""
|
|
get dataset from
|
|
https://github.com/stanis-morozov/ip-nsw#dataset
|
|
"""
|
|
|
|
def __init__(self):
|
|
Dataset.__init__(self)
|
|
self.d, self.nt, self.nb, self.nq = 100, 0, 10**6, 10000
|
|
self.metric = "IP"
|
|
self.basedir = dataset_basedir + "music-100/"
|
|
|
|
def get_queries(self):
|
|
xq = np.fromfile(self.basedir + "query_music100.bin", dtype="float32")
|
|
xq = xq.reshape(-1, 100)
|
|
return xq
|
|
|
|
def get_database(self):
|
|
xb = np.fromfile(
|
|
self.basedir + "database_music100.bin", dtype="float32"
|
|
)
|
|
xb = xb.reshape(-1, 100)
|
|
return xb
|
|
|
|
def get_groundtruth(self, k=None):
|
|
gt = np.load(self.basedir + "gt.npy")
|
|
if k is not None:
|
|
assert k <= 100
|
|
gt = gt[:, :k]
|
|
return gt
|
|
|
|
|
|
class DatasetGIST1M(Dataset):
|
|
"""
|
|
The original dataset is available at: http://corpus-texmex.irisa.fr/
|
|
(ANN_GIST1M)
|
|
"""
|
|
|
|
def __init__(self):
|
|
Dataset.__init__(self)
|
|
self.d, self.nt, self.nb, self.nq = 960, 100000, 1000000, 10000
|
|
self.basedir = dataset_basedir + "gist1M/"
|
|
|
|
def get_queries(self):
|
|
return fvecs_read(self.basedir + "gist_query.fvecs")
|
|
|
|
def get_train(self, maxtrain=None):
|
|
maxtrain = maxtrain if maxtrain is not None else self.nt
|
|
return fvecs_read(self.basedir + "gist_learn.fvecs")[:maxtrain]
|
|
|
|
def get_database(self):
|
|
return fvecs_read(self.basedir + "gist_base.fvecs")
|
|
|
|
def get_groundtruth(self, k=None):
|
|
gt = ivecs_read(self.basedir + "gist_groundtruth.ivecs")
|
|
if k is not None:
|
|
assert k <= 100
|
|
gt = gt[:, :k]
|
|
return gt
|
|
|
|
|
|
class DatasetDINO10B(Dataset):
|
|
"""
|
|
Data from https://dl.fbaipublicfiles.com/large_objects/dino_vitl_10B/
|
|
The dataset contains 10 billion 1024-d vectors extracted from image
|
|
patches from the YFCC100M dataset, using a Dino-ViT-L 16 model
|
|
(facebook/dinov3-vitl16-pretrain-lvd1689m).
|
|
The dataset is sharded in multiple chunked .bvecs files. Downloading
|
|
instructions can be obtained with
|
|
"wget https://dl.fbaipublicfiles.com/large_objects/dino_vitl_10B/README.md".
|
|
Supported sizes : 100k 200k 500k 1M ... 5B 10B listed in supported_nbs
|
|
(see __init__).
|
|
"""
|
|
|
|
def __init__(self, nb, ignore_supported=False):
|
|
Dataset.__init__(self)
|
|
supported_nbs = [
|
|
100_000,
|
|
200_000,
|
|
500_000,
|
|
1_000_000,
|
|
2_000_000,
|
|
5_000_000,
|
|
10_000_000,
|
|
20_000_000,
|
|
50_000_000,
|
|
100_000_000,
|
|
200_000_000,
|
|
500_000_000,
|
|
1_000_000_000,
|
|
2_000_000_000,
|
|
5_000_000_000,
|
|
10_000_000_000,
|
|
]
|
|
if nb not in supported_nbs and not ignore_supported:
|
|
raise ValueError(
|
|
f"Unsupported dataset size: {nb}, supported values are: "
|
|
f"{supported_nbs}"
|
|
)
|
|
if not os.path.exists(dataset_basedir):
|
|
raise ValueError(
|
|
"Provided dataset base directory does not exist: "
|
|
f"{dataset_basedir}"
|
|
)
|
|
self.basedir = dataset_basedir + "dino_vitl_10B/"
|
|
self.indexdir = self.basedir + "chunked_base_10B"
|
|
assert os.path.exists(
|
|
self.indexdir
|
|
), f"Index path should exist, check your dataset path: {self.indexdir}"
|
|
self.queriesdir = self.basedir + "queries_clean.bvecs"
|
|
assert os.path.exists(self.queriesdir), (
|
|
f"Queries path should exist as dataset size {nb} is supported: "
|
|
f"{self.queriesdir}"
|
|
)
|
|
self.gtsdir = (
|
|
self.basedir
|
|
+ "gts/"
|
|
+ "gts_dino_patch_"
|
|
+ str(nb)
|
|
+ "_"
|
|
+ "k10.npy"
|
|
)
|
|
self.train_queriesdir = self.basedir + "train_queries_99M.bvecs"
|
|
self.nb = nb
|
|
self.d = 1024
|
|
self.nq = 100_000
|
|
self.nt = 99_000_000
|
|
self.metric = "L2"
|
|
|
|
def get_queries(self):
|
|
"""Get all vectors as a single array"""
|
|
queries = bvecs_mmap(self.queriesdir)
|
|
return sanitize(queries)
|
|
|
|
def get_train(self, maxtrain=None):
|
|
"""Get training query vectors as a single array"""
|
|
if maxtrain is None or maxtrain > 10_000_000:
|
|
raise NotImplementedError(
|
|
"The training set is potentially too large to fit in RAM "
|
|
"(400 GB of data). Please use train_iterator or use "
|
|
"maxtrain parameter below 10_000_000 to get the first "
|
|
"maxtrain training vectors."
|
|
)
|
|
return sanitize(bvecs_mmap(self.train_queriesdir)[:maxtrain])
|
|
|
|
def get_database(self):
|
|
"""Get all database vectors as a single array"""
|
|
if self.nb > 10_000_000:
|
|
raise NotImplementedError(
|
|
"The dataset is potentially too large to fit in RAM. "
|
|
"Please use database_iterator or use a dataset size equal "
|
|
"to or below 10_000_000."
|
|
)
|
|
else:
|
|
return sanitize(
|
|
bvecs_iter_chunked(self.indexdir, batch_size=self.nb).__next__()
|
|
)
|
|
|
|
def database_iterator(self, bs=10_000):
|
|
"""Iterator over the database of size nb, corresponding to the
|
|
first nb vectors in the .bvecs file"""
|
|
total_read = 0
|
|
for batch in bvecs_iter_chunked(self.indexdir, batch_size=bs):
|
|
if total_read + batch.shape[0] > self.nb:
|
|
batch = batch[: self.nb - total_read]
|
|
yield sanitize(batch)
|
|
total_read += batch.shape[0]
|
|
if total_read >= self.nb:
|
|
break
|
|
|
|
def train_iterator(self, bs=10_000):
|
|
"""Iterator over all training query vectors in the .bvecs file"""
|
|
for batch in bvecs_iter(self.train_queriesdir, batch_size=bs):
|
|
yield sanitize(batch)
|
|
|
|
def get_groundtruth(self, k=10):
|
|
"""Get ground truth from .npy file"""
|
|
if k > 10:
|
|
raise NotImplementedError(
|
|
"Ground truth files only available for k<=10"
|
|
)
|
|
gts = np.load(self.gtsdir)
|
|
gts = gts[:, :k]
|
|
return gts
|
|
|
|
def distance(self):
|
|
return "euclidean"
|
|
|
|
|
|
def dataset_from_name(dataset="deep1M", download=False):
|
|
"""converts a string describing a dataset to a Dataset object
|
|
Supports sift1M, bigann1M..bigann1B, deep1M..deep1B, music-100 and glove
|
|
"""
|
|
|
|
if dataset == "sift1M":
|
|
return DatasetSIFT1M()
|
|
|
|
elif dataset == "gist1M":
|
|
return DatasetGIST1M()
|
|
|
|
elif dataset.startswith("bigann"):
|
|
dbsize = 1000 if dataset == "bigann1B" else int(dataset[6:-1])
|
|
return DatasetBigANN(nb_M=dbsize)
|
|
|
|
elif dataset.startswith("deep"):
|
|
|
|
szsuf = dataset[4:]
|
|
if szsuf[-1] == "M":
|
|
dbsize = 10**6 * int(szsuf[:-1])
|
|
elif szsuf == "1B":
|
|
dbsize = 10**9
|
|
elif szsuf[-1] == "k":
|
|
dbsize = 1000 * int(szsuf[:-1])
|
|
else:
|
|
raise AssertionError("did not recognize suffix " + szsuf)
|
|
return DatasetDeep1B(nb=dbsize)
|
|
|
|
elif dataset == "music-100":
|
|
return DatasetMusic100()
|
|
|
|
elif dataset == "glove":
|
|
return DatasetGlove(download=download)
|
|
|
|
elif dataset.startswith("dino"):
|
|
dbsize = 10_000_000_000 if dataset == "dino10B" else int(dataset[4:])
|
|
return DatasetDINO10B(nb=dbsize)
|
|
|
|
else:
|
|
raise RuntimeError("unknown dataset " + dataset)
|