1See also http://pvp.haskell.org/faq
2
3## 1.3.1.0
4
5- Merge <http://hackage.haskell.org/package/regex-tdfa-text> into `regex-tdfa`; see <https://github.com/haskell-hvr/regex-tdfa/issues/4>.
6- Don't inject `ghc-options: -O2` by default anymore (see #7 for rationale) and introduce `force-O2` cabal flag to control the injection of `ghc-options: -O2`.
7  Note that you can conveniently control optimization levels on a per-package granularity via `cabal.project` files; see [cabal's user-guide](https://cabal.readthedocs.io/en/latest/nix-local-build.html#configuring-builds-with-cabal-project) for more details.
8
9# 1.3.0
10
11- Same as 1.2.3.3 release; see <https://github.com/ChrisKuklewicz/regex-tdfa/issues/29>.
12- Compatibility with GHC 8.8 and regex-base-0.9.4 (h/t @asr).
13- Turned `regex-tdfa-unittest` into a `regex-tdfa` testsuite.
14
15----
16
17### 1.2.3.3 (deprecated)
18
19* Compatibility with GHC 8.8 and regex-base-0.9.4 (h/t @asr).
20* Turned `regex-tdfa-unittest` into a `regex-tdfa` testsuite.
21
22### 1.2.3.2
23
24* Significantly improved documentation (h/t William Yao).
25
26### 1.2.3.1
27
28* Compatibility with `containers-0.6`.
29
30## 1.2.3
31
32* Added `Semigroup` instances for some types (h/t Herbert Valerio Riedel).
33
34## 1.2.2
35
36* New maintainer.
37* Now we don't reexport the problematic `Show` instance for functions.
38
39## 1.2.1
40
41* Updated dependency versions.
42
43# 1.2.0
44
45"Almost ghc-7.8" with the array 0.4 changes for `Data.Array.Unsafe`
46
47----
48
49# 1.1.8
50
51Make ghc-7.0.2 on platorm 2011.2.0.0.0 happy
52
53# 1.1.7
54
55fix url below
56
57# 1.1.6
58
59Fix bug preventing `[]] [-] [^]] [^-]` (thanks to Maxime Henrion)
60
61# 1.1.5
62
63try `needUniqTags` in `POr` in CorePattern.hs, try `toAdvice b` for `PStar child`
64
65# 1.1.4
66
67fixed
68
69# 1.1.3
70
71BROKEN after 100 characters the `compressOrbit` dies!
72
73# 1.1.2
74
75worked
76
77# 1.1.1
78
79add gnu escapes
80
81# 1.1.0
82
83NewDFA code working
84
85# 1.0.7
86
87make NewDFA directory and String_NC
88
89# 1.0.6
90
91try NewDFATest_SBS with `uncons`
92
93# 1.0.5
94
95use `uncons` on SBS
96
97# 1.0.4
98
99try repaired NewDFATest_SBS
100
101* np13: try to improve readability with the `mm` combinator? Yes!
102* np12: expand `o` in the case where `t` lookup get `Nothing`? Yes – this is the fix!?
103* np11: break multi to not look at `o` and just return `True`? Yes !!!!
104* np10: Peel off `CharMap`/`IntMap` and DFA/DT with pattern matching? No
105* np9:  `INLINE` `endOf`? No
106* np8:  np6 and `NOINLINE` `endOff`? No
107* np7:  just return `True`? Fast
108* np6:  comment out ans check? No
109* np5:  comment out all `Multi0` code? No
110* np4:  comment out all `Single0` and `Single` code? No
111* np3:  `!off` the multi? No
112* np2:  comment out all Testing code? No
113
114# 1.0.3
115
116try to alter `matchTest` to not have the `Bool` args? No
117
118# 1.0.2
119
120arg, the prof is fast and the normal slow!
121
122# 1.0.1
123
124add NewDFATest.hs
125
126# 0.99.20
127
128go to many vs single?
129
130# 0.99.19
131
132try for pre-comparison of orbit-logs!
133
134# 0.99.18
135
136try alternate lazy/strict strategy in NewDFA. Fix offset laziness.
137
138# 0.99.17
139
140radical removal of flag array and adding of `SetVal` to handle groups
141
142# 0.99.16
143
144performance? up to v15
145
146# 0.99.15
147
148get string with NewDFA testing, unit tests and 1000 random regex pass
149
150# 0.99.14
151
152start changing to the new real DFA
153
154# 0.99.13
155
156more cleanup
157
158# 0.99.12
159
160try to debug 0.99.11: fixed `updateWinner`
161
162# 0.99.11
163
164improve above fix and make stuff work better – HAS BUG, along with old TDFA!
165
166# 0.99.10
167
168fixed `((.?)*)*` patterns by changing `PStar nullView` when `mayFirstBeNull`
169
170# 0.99.9
171
172testing changing `bestTrans`/`chooseWith`/`choose` to include `enterOrbit`/`newFlags`/`(_,True)` info
173
174# 0.99.8
175
176testing changing `Maximize` to `Minimize` for `Tag`s, decide `(a*)*` is canonical problem
177
178# 0.99.7
179
180Use `(PGroup Nothing)` in `Pattern` to decompose `PBound`
181
182# 0.99.6
183
184change to nested `nonEmpty` calls for `PBound`
185
186# 0.99.5
187
188remove `PNonEmpty` constructor
189
190# 0.99.4
191
192tests `pnonempty' = \ p -> POr [ PEmpty, p ]` instead of `PNonEmpty`
193