faiss/docs/html/search/classes_6f.js

var searchData=
[
  ['occurrence',['Occurrence',['../structfaiss_1_1MatrixStats_1_1Occurrence.html',1,'faiss::MatrixStats']]],
  ['ondiskinvertedlists',['OnDiskInvertedLists',['../structfaiss_1_1OnDiskInvertedLists.html',1,'faiss']]],
  ['onerecallatrcriterion',['OneRecallAtRCriterion',['../structfaiss_1_1OneRecallAtRCriterion.html',1,'faiss']]],
  ['ongoingprefetch',['OngoingPrefetch',['../structfaiss_1_1OnDiskInvertedLists_1_1OngoingPrefetch.html',1,'faiss::OnDiskInvertedLists']]],
  ['operatingpoint',['OperatingPoint',['../structfaiss_1_1OperatingPoint.html',1,'faiss']]],
  ['operatingpoints',['OperatingPoints',['../structfaiss_1_1OperatingPoints.html',1,'faiss']]],
  ['opqmatrix',['OPQMatrix',['../structfaiss_1_1OPQMatrix.html',1,'faiss']]]
];
Initial commit 2017-02-23 06:26:44 +08:00			`var searchData=`
			`[`
Facebook sync (May 2019) + relicense (#838) Changelog: - changed license: BSD+Patents -> MIT - propagates exceptions raised in sub-indexes of IndexShards and IndexReplicas - support for searching several inverted lists in parallel (parallel_mode != 0) - better support for PQ codes where nbit != 8 or 16 - IVFSpectralHash implementation: spectral hash codes inside an IVF - 6-bit per component scalar quantizer (4 and 8 bit were already supported) - combinations of inverted lists: HStackInvertedLists and VStackInvertedLists - configurable number of threads for OnDiskInvertedLists prefetching (including 0=no prefetch) - more test and demo code compatible with Python 3 (print with parentheses) - refactored benchmark code: data loading is now in a single file 2019-05-28 22:17:22 +08:00			`['occurrence',['Occurrence',['../structfaiss_1_1MatrixStats_1_1Occurrence.html',1,'faiss::MatrixStats']]],`
sync with FB version 2018-02-23 (#347) - support on-disk IVF 2018-02-23 23:44:31 +08:00			`['ondiskinvertedlists',['OnDiskInvertedLists',['../structfaiss_1_1OnDiskInvertedLists.html',1,'faiss']]],`
Initial commit 2017-02-23 06:26:44 +08:00			`['onerecallatrcriterion',['OneRecallAtRCriterion',['../structfaiss_1_1OneRecallAtRCriterion.html',1,'faiss']]],`
sync with FB version 2018-02-23 (#347) - support on-disk IVF 2018-02-23 23:44:31 +08:00			`['ongoingprefetch',['OngoingPrefetch',['../structfaiss_1_1OnDiskInvertedLists_1_1OngoingPrefetch.html',1,'faiss::OnDiskInvertedLists']]],`
Initial commit 2017-02-23 06:26:44 +08:00			`['operatingpoint',['OperatingPoint',['../structfaiss_1_1OperatingPoint.html',1,'faiss']]],`
			`['operatingpoints',['OperatingPoints',['../structfaiss_1_1OperatingPoints.html',1,'faiss']]],`
Facebook sync (May 2019) + relicense (#838) Changelog: - changed license: BSD+Patents -> MIT - propagates exceptions raised in sub-indexes of IndexShards and IndexReplicas - support for searching several inverted lists in parallel (parallel_mode != 0) - better support for PQ codes where nbit != 8 or 16 - IVFSpectralHash implementation: spectral hash codes inside an IVF - 6-bit per component scalar quantizer (4 and 8 bit were already supported) - combinations of inverted lists: HStackInvertedLists and VStackInvertedLists - configurable number of threads for OnDiskInvertedLists prefetching (including 0=no prefetch) - more test and demo code compatible with Python 3 (print with parentheses) - refactored benchmark code: data loading is now in a single file 2019-05-28 22:17:22 +08:00			`['opqmatrix',['OPQMatrix',['../structfaiss_1_1OPQMatrix.html',1,'faiss']]]`
Initial commit 2017-02-23 06:26:44 +08:00			`];`