-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathncd-tree.cabal
More file actions
111 lines (105 loc) · 4.06 KB
/
ncd-tree.cabal
File metadata and controls
111 lines (105 loc) · 4.06 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
cabal-version: 2.2
name: ncd-tree
version: 0.1.0.0
synopsis: text similarity search using normalized compression distance and VP trees
description:
ncd-tree is a Haskell library that implements a data structure and query layer for efficient
similarity search based on the Normalized Compression Distance (NCD) metric
and Vantage Point (VP) trees. It allows users to store and query large
datasets of text documents, enabling fast retrieval of similar texts based
on their compressed representations.
This library is particularly useful for applications such as
document clustering and recommendation systems.
NCD is a parameter-free, universal similarity metric based on information distance,
which quantifies how similar two objects are by measuring the length of their
compressed concatenation relative to their individual compressed lengths.
VP trees are a type of metric tree that organizes data points in a way that
allows for efficient nearest neighbor searches in metric spaces.
homepage: https://github.com/ocramz/ncd-tree
license: BSD-3-Clause
license-file: LICENSE
author: Marco Zocca
maintainer: ocramz
copyright: 2025 Marco Zocca
category: Data
build-type: Simple
extra-source-files: README.md
CHANGELOG.md
tested-with: GHC == 9.10.3
library
default-language: Haskell2010
hs-source-dirs: src
exposed-modules: Data.NCDTree
build-depends: base >= 4.7 && < 5
, bytestring
, heaps
, vector
, vector-algorithms
, zlib
ghc-options: -Wall
-Wcompat
-Widentities
-Wincomplete-record-updates
-Wincomplete-uni-patterns
-Wmissing-export-lists
-Wmissing-home-modules
-Wpartial-fields
-Wredundant-constraints
-- executable ncd-tree
-- default-language: Haskell2010
-- hs-source-dirs: app
-- main-is: Main.hs
-- build-depends: base
-- , ncd-tree
-- ghc-options: -Wall
-- -Wcompat
-- -Widentities
-- -Wincomplete-record-updates
-- -Wincomplete-uni-patterns
-- -Wmissing-export-lists
-- -Wmissing-home-modules
-- -Wpartial-fields
-- -Wredundant-constraints
-- -threaded
-- -rtsopts
-- -with-rtsopts=-N
test-suite spec
default-language: Haskell2010
type: exitcode-stdio-1.0
hs-source-dirs: test
main-is: Spec.hs
other-modules: Data.NCDTreeSpec
build-depends: base
, ncd-tree
, bytestring
, heaps
, hspec
, hspec-discover
, QuickCheck
ghc-options: -Wall
-Wcompat
-Widentities
-Wincomplete-record-updates
-Wincomplete-uni-patterns
-Wmissing-export-lists
-Wmissing-home-modules
-Wpartial-fields
-Wredundant-constraints
benchmark bench
default-language: Haskell2010
type: exitcode-stdio-1.0
hs-source-dirs: bench
main-is: Main.hs
build-depends: base
, ncd-tree
, bytestring
, benchpress
, deepseq
, heaps
ghc-options: -Wall
-O2
-threaded
-rtsopts
source-repository head
type: git
location: https://github.com/ocramz/ncd-tree