diff options
| author | Gregor Kleen <gkleen@yggdrasil.li> | 2015-08-04 15:49:31 +0200 |
|---|---|---|
| committer | Gregor Kleen <gkleen@yggdrasil.li> | 2015-08-04 15:49:31 +0200 |
| commit | 06fa7aa2751c03bb2aad49e12b4273b9d97ebed8 (patch) | |
| tree | 071711be9fd68ddb5073d9287aad15598e888a57 /provider | |
| parent | 411e3ca598ac3cc0b3bbdd66e47ca4101b84ebf9 (diff) | |
| download | dirty-haskell.org-06fa7aa2751c03bb2aad49e12b4273b9d97ebed8.tar dirty-haskell.org-06fa7aa2751c03bb2aad49e12b4273b9d97ebed8.tar.gz dirty-haskell.org-06fa7aa2751c03bb2aad49e12b4273b9d97ebed8.tar.bz2 dirty-haskell.org-06fa7aa2751c03bb2aad49e12b4273b9d97ebed8.tar.xz dirty-haskell.org-06fa7aa2751c03bb2aad49e12b4273b9d97ebed8.zip | |
typos and tagging
Diffstat (limited to 'provider')
| -rw-r--r-- | provider/posts/beuteltier-1.lhs | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/provider/posts/beuteltier-1.lhs b/provider/posts/beuteltier-1.lhs index c8f3e6c..9cc2364 100644 --- a/provider/posts/beuteltier-1.lhs +++ b/provider/posts/beuteltier-1.lhs | |||
| @@ -1,6 +1,7 @@ | |||
| 1 | --- | 1 | --- |
| 2 | title: On the Design of Overly Complicated Feedreaders | 2 | title: On the Design of Overly Complicated Feedreaders |
| 3 | published: 2015-08-04 | 3 | published: 2015-08-04 |
| 4 | tags: Beuteltier | ||
| 4 | --- | 5 | --- |
| 5 | 6 | ||
| 6 | I like feedreaders. | 7 | I like feedreaders. |
| @@ -32,7 +33,7 @@ of) access to what we call a backstore. A backstore is, to us, an instance of th | |||
| 32 | typeclass `Beutel` which contains the most primitive of primitives for storing, searching | 33 | typeclass `Beutel` which contains the most primitive of primitives for storing, searching |
| 33 | for and deleting representations of the objects we care about from the store. | 34 | for and deleting representations of the objects we care about from the store. |
| 34 | 35 | ||
| 35 | It is recommended that reader not try to follow the rest of this post linearly but start | 36 | It is recommended that the reader not try to follow the rest of this post linearly but start |
| 36 | at the end with the definition of the `Beutel` class and work their way backwards. | 37 | at the end with the definition of the `Beutel` class and work their way backwards. |
| 37 | 38 | ||
| 38 | > {-# LANGUAGE FlexibleInstances, StandaloneDeriving, KindSignatures, MultiParamTypeClasses, TypeFamilies #-} | 39 | > {-# LANGUAGE FlexibleInstances, StandaloneDeriving, KindSignatures, MultiParamTypeClasses, TypeFamilies #-} |
| @@ -186,7 +187,7 @@ to using a `Map` for reasons of deduplication. Inserting into a `Map` carries so | |||
| 186 | guarantees that keys end up being unique. | 187 | guarantees that keys end up being unique. |
| 187 | 188 | ||
| 188 | Note below: creation of a `SubObject` is an update. It is thus expected, that `SubObject`s | 189 | Note below: creation of a `SubObject` is an update. It is thus expected, that `SubObject`s |
| 189 | created at the same time as the `Object` they are associated to contain encode an update | 190 | created at the same time as the `Object` they are associated to encode an update |
| 190 | time that matches the `Object`s creation time. | 191 | time that matches the `Object`s creation time. |
| 191 | 192 | ||
| 192 | > -- | Contents of an object | 193 | > -- | Contents of an object |
