-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfana.cabal
200 lines (183 loc) · 7.52 KB
/
fana.cabal
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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
cabal-version: 3.0
name: fana
version: 0.0.0.211
synopsis: Some commonly useful stuff
category: Tools, Optics, Testing, Serialization
license-file: _license_.txt
license: CC0-1.0 AND 0BSD AND MIT-0
author: Zoltán Tóth libeako.github.io
maintainer: same as author
build-type: Simple
description:
A library containing stuff useful generally in Haskell.
= Content
* Various tools to work better with the Haskell language. See "Fana.Haskell.AaaReadme".
* Optics. See "Fana.Optic.AaaReadme".
* A very simple but useful testing library. See "Fana.Develop.Test.Define".
* Bidirectional serialization. See "Fana.Serial.Bidir.Serializer"
* Indented text output. See "Fana.Serial.Print.Indent".
* A show mechanism that supports fast compositition of the output with arbitrary grouping.
See "Fana.Serial.Print.Show".
* Recursion schemes. Only basics. See "Fana.Data.Recurse".
* Serialization of trees from list of elements with their hights.
See "Fana.Data.Tree.ParseFromElemList".
* The serialization library of the configuration language "Simco". See "Fana.Serial.Bidir.Instances.Text.PropertyTree.Simco.IndentedTextSerial".
= Style
Primarily simple.
I sacrificed run-time efficiency for simplicity at several places. But not asymptotically.
For example i rather go over a collection twice than
maintain a traversing function that does a mixed job with the elements.
I avoided advanced techniques, I leaned toward down-to-earth choices.
A good example is that i settled with concrete representation of optics.
= Naming
Import with qualification.
= Others
Ideally this library should be several libraries, but i want to save time from maintaing version bounds of many connected libraries.
source-repository head
type: git
location: https://github.com/libeako/haskell-fana
common common
hs-source-dirs:
Haskell
default-language: Haskell2010
default-extensions:
EmptyDataDecls EmptyCase LambdaCase
NoImplicitPrelude NoMonomorphismRestriction
InstanceSigs StandaloneDeriving
BangPatterns
TypeOperators ExplicitForAll ScopedTypeVariables TypeApplications OverloadedStrings
TypeInType RankNTypes GADTs ConstraintKinds
AllowAmbiguousTypes
LiberalTypeSynonyms
TypeFamilies TypeFamilyDependencies
FlexibleContexts FlexibleInstances MultiParamTypeClasses QuantifiedConstraints
DefaultSignatures
DeriveFunctor DeriveFoldable DeriveTraversable
GeneralizedNewtypeDeriving
ghc-options:
-fno-warn-tabs
-fwarn-incomplete-patterns -fwarn-incomplete-uni-patterns
-Wname-shadowing -Wincomplete-record-updates -Woverflowed-literals -Wmonomorphism-restriction
-Wwrong-do-bind -Wunticked-promoted-constructors -Wunsupported-llvm-version
-Worphans -Wsemigroup -Wnoncanonical-monoid-instances -Wnoncanonical-monad-instances
-Wredundant-constraints -Wunused-imports -Wunused-packages -Wmissing-signatures -Wcompat
-Wno-missing-home-modules -fshow-warning-groups
-fspecialise-aggressively -fexpose-all-unfoldings
build-depends:
adjunctions >=4.3 && <4.5
, base >=4.12 && <4.20
, constraints >=0.10 && <0.14
, containers >=0.5 && <0.7
, data-default-class >=0.1 && <0.2
, distributive >=0.5 && <0.6
, mtl >=2.2 && <2.3
library
import : common
exposed-modules:
Fana.Convert
Fana.Data.Boole
Fana.Data.CollectionWithEmpty
Fana.Data.Either
Fana.Data.Enum
Fana.Data.Filter
Fana.Data.Function
Fana.Data.FunctionUpIo
Fana.Data.HasSingle
Fana.Data.HeteroPair
Fana.Data.HomoPair
Fana.Data.Identified
Fana.Data.Key.ElementsHaveKey
Fana.Data.Key.LensToMaybeElement
Fana.Data.Key.Map.Interface
Fana.Data.Key.Map.KeyIsString
Fana.Data.Key.Traversable
Fana.Data.List
Fana.Data.Maybe
Fana.Data.Recurse
Fana.Data.Tree.ChildrenWithInfo
Fana.Data.Tree.Discriminating
Fana.Data.Tree.Leaf
Fana.Data.Tree.OfBase
Fana.Data.Tree.SerializeHight
Fana.Data.Tree.Uniform
Fana.Data.Zippable
Fana.Develop.Test.Define
Fana.Develop.Test.Run
Fana.Develop.Trace
Fana.Haskell.AaaReadme
Fana.Haskell.DescribingClass
Fana.Haskell.TypePair
Fana.Haskell.Wrap
Fana.Math.Algebra.Category
Fana.Math.Algebra.Category.ConvertThenCompose
Fana.Math.Algebra.Category.Functor.Monoidal.Monad.MethodFromMethod
Fana.Math.Algebra.Category.Functor.Monoidal.Monad.FreeOverFunctor
Fana.Math.Algebra.Category.Functor.Monoidal.Utilities
Fana.Math.Algebra.Category.Functor.Pro
Fana.Math.Algebra.Category.Functor.Product
Fana.Math.Algebra.Category.OnTypePairs
Fana.Math.Algebra.Monoid.Accumulate
Fana.Meta.Test.All
Fana.Meta.Test.Data.Tree.Map.KeyIsString
Fana.Meta.Test.Data.Tree.SerializeHight
Fana.OperatingSystem.ExitCode
Fana.Optic.AaaReadme
Fana.Optic.Concrete.AaaReadme
Fana.Optic.Concrete.Categories.AffineTraverse
Fana.Optic.Concrete.Categories.Down
Fana.Optic.Concrete.Categories.Interfaces
Fana.Optic.Concrete.Categories.FnUp
Fana.Optic.Concrete.Categories.Fold
Fana.Optic.Concrete.Categories.Iso
Fana.Optic.Concrete.Categories.Lens
Fana.Optic.Concrete.Categories.PartialIso
Fana.Optic.Concrete.Categories.Prism
Fana.Optic.Concrete.Categories.Traversal
Fana.Optic.Concrete.Categories.Up
Fana.Optic.Concrete.Combine
Fana.Optic.Concrete.Common
Fana.Optic.Concrete.Prelude
Fana.Optic.Laarhoven.Lens
Fana.Optic.Laarhoven.Traverse
Fana.Optic.Profunctor.Access.Get
Fana.Optic.Profunctor.Access.Over
Fana.Optic.Profunctor.Access.Set
Fana.Optic.Profunctor.AdaptIso
Fana.Optic.Profunctor.Categories
Fana.Optic.Profunctor.Equality
Fana.Optic.Profunctor.Interface
Fana.Optic.Profunctor.Optic
Fana.Optic.Profunctor.Prelude
Fana.Prelude
Fana.Prelude.FromBase
Fana.Prelude.FromElse
Fana.PropertyTree.Data
Fana.PropertyTree.Serialize
Fana.Serial.Bidir.Instances.Basic
Fana.Serial.Bidir.Instances.Conditioned
Fana.Serial.Bidir.Instances.Concrete
Fana.Serial.Bidir.Instances.Decorate
Fana.Serial.Bidir.Instances.Enum
Fana.Serial.Bidir.Instances.FlatSum
Fana.Serial.Bidir.Instances.Maybe
Fana.Serial.Bidir.Instances.Multiple
Fana.Serial.Bidir.Instances.ProductSum
Fana.Serial.Bidir.Instances.Tag
Fana.Serial.Bidir.Instances.Text.Indent
Fana.Serial.Bidir.Instances.Text.Delimiters
Fana.Serial.Bidir.Instances.Text.PropertyTree.Simco.Data
Fana.Serial.Bidir.Instances.Text.PropertyTree.Simco.AsAbstract
Fana.Serial.Bidir.Instances.Text.PropertyTree.Simco.AsText
Fana.Serial.Bidir.Instances.Text.PropertyTree.Simco.NodeSerial
Fana.Serial.Bidir.Instances.WithStartPosition
Fana.Serial.Bidir.Meta.Test.Main
Fana.Serial.Bidir.Meta.Test.Instances
Fana.Serial.Bidir.Parse
Fana.Serial.Bidir.Serializer
Fana.Serial.Bidir.Test
Fana.Serial.Print.Indent
Fana.Serial.Print.Show
test-suite try
import : common
type: exitcode-stdio-1.0
main-is: ../TestMain.hs