Skip to content

Commit 462ebe0

Browse files
committed
Dropped the ads
1 parent 7fc70b9 commit 462ebe0

File tree

8 files changed

+0
-16
lines changed

8 files changed

+0
-16
lines changed

force-elems/README.md

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -34,5 +34,3 @@ And there's a hardcore mode (turned off by default, change `hardcore = False` to
3434
Replace `forceElems = undefined` in [`src/Lib.hs`](src/Lib.hs) with an actual definition of `forceElems`.
3535

3636
There's a small test suite. I run it with `stack test`.
37-
38-
If you enjoyed this or some other challenge and appreciate the effort or want to see answers, consider becoming a [sponsor of the project](https://github.com/sponsors/effectfully-ou).

h2-inspect-forced/README.md

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -99,5 +99,3 @@ Conditions:
9999
6. inspecting the heap directly using tools that GHC provides (e.g. via [`ghc-heap-view`](https://hackage.haskell.org/package/ghc-heap-view)) or libraries that are powered by those tools (e.g. [`nothunks`](https://hackage.haskell.org/package/nothunks)) is considered cheating
100100

101101
There's a small test suite. I run it with `stack test`.
102-
103-
If you enjoyed this or some other challenge and appreciate the effort or want to see answers, consider becoming a [sponsor of the project](https://github.com/sponsors/effectfully-ou).

h3-transform-typed/README.md

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -66,5 +66,3 @@ Conditions:
6666
2. don't worry about accidentally making underlying functions strict or laziness in general
6767

6868
There's a small test suite. I run it with `stack test`.
69-
70-
If you enjoyed this or some other challenge and appreciate the effort or want to see answers, consider becoming a [sponsor of the project](https://github.com/sponsors/effectfully-ou).

h4-largest-powers/README.md

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -85,5 +85,3 @@ There's a small test suite. Running it via `stack test` gives me the following (
8585

8686
Productivity 91.8% of total user, 91.8% of total elapsed
8787
```
88-
89-
If you enjoyed this or some other challenge and appreciate the effort or want to see answers, consider becoming a [sponsor of the project](https://github.com/sponsors/effectfully-ou).

h5-prerun-action/README.md

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -96,5 +96,3 @@ The hardcore mode is disabled by default, to enable it go to [test/Main.hs](./te
9696
There's a small test suite. I run it with `stack test`.
9797

9898
This is an April Fools' Day edition where the fool is me who thought that it wouldn't be hard to write a test suite for this task: I've spent several days trying to find an optimal set of parameters that triggers as many errors as possible while reporting false positives with reasonably small probability (testing concurrent IO without mocking is no easy task) without the test suite taking minutes to run. If you're getting an error having "got a deadlock" in it, try increasing the `tIMEOUT` constant in [`test/Main.hs`](test/Main.hs) (if tests still fail, probably there's a problem indeed).
99-
100-
If you enjoyed this or some other challenge and appreciate the effort or want to see answers, consider becoming a [sponsor of the project](https://github.com/sponsors/effectfully-ou).

h6-indexed-folds/README.md

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -35,5 +35,3 @@ ifoldl' :: (forall m. b m -> a -> b ('S m)) -> b 'Z -> Vec n a -> b n
3535
There's a hardcore mode of the challenge that imposes an additional requirement: `ifoldl'` has to run in linear time. The hardcore mode is disabled by default, to enable it go to [test/Main.hs](./test/Main.hs) and replace `hardcore = False` with `hardcore = True`.
3636

3737
There's a small test suite. I run it with `stack test`.
38-
39-
If you enjoyed this or some other challenge and appreciate the effort or want to see answers, consider becoming a [sponsor of the project](https://github.com/sponsors/effectfully-ou).

h7-shortest-longest/README.md

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -97,5 +97,3 @@ Rules:
9797
4. if there are multiple equal shortest sublists, all of them should be returned (i.e. you should not perform any deduplication)
9898

9999
There's a small test suite. I run it with `stack test`. If you run the tests and see errors mentioning `x(x)` for some `x`, that's how an infinite list of `x`s is printed.
100-
101-
If you enjoyed this or some other challenge and appreciate the effort or want to see answers, consider becoming a [sponsor of the project](https://github.com/sponsors/effectfully-ou).

h8-foldr-foldlprime/README.md

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -23,5 +23,3 @@ Rules:
2323
7. don't worry about things being garbage-collected properly or asynchronous exceptions
2424

2525
There's a small test suite. I run it with `stack test`.
26-
27-
If you enjoyed this or some other challenge and appreciate the effort or want to see answers, consider becoming a [sponsor of the project](https://github.com/sponsors/effectfully-ou).

0 commit comments

Comments
 (0)