-
Notifications
You must be signed in to change notification settings - Fork 22
/
ADTSection.scala
163 lines (151 loc) · 5.76 KB
/
ADTSection.scala
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
/*
* Copyright 2016-2020 47 Degrees Open Source <https://www.47deg.com>
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package circelib
import io.circe.syntax._
import org.scalaexercises.definitions.Section
import org.scalatest.flatspec.AnyFlatSpec
import org.scalatest.matchers.should.Matchers
/**
* =ADTs encoding and decoding=
*
* The most straightforward way to encode / decode ADTs is by using generic derivation for the case
* classes but explicitly defined instances for the ADT type.
*
* @param name
* ADT (Algebraic Data Types)
*/
object ADTSection extends AnyFlatSpec with Matchers with Section {
import helpers.ADTHelpers._
/**
* Consider the following ADT:
* {{{
* sealed trait Event
*
* case class Foo(i: Int) extends Event
* case class Bar(s: String) extends Event
* case class Baz(c: Char) extends Event
* case class Qux(values: List[String]) extends Event
* }}}
*
* And the encoder / decoder instances:
* {{{
* import cats.syntax.functor._
* import io.circe.{ Decoder, Encoder }, io.circe.generic.auto._
* import io.circe.syntax._
*
* object GenericDerivation {
* implicit val encodeEvent: Encoder[Event] = Encoder.instance {
* case foo @ Foo(_) => foo.asJson
* case bar @ Bar(_) => bar.asJson
* case baz @ Baz(_) => baz.asJson
* case qux @ Qux(_) => qux.asJson
* }
*
* implicit val decodeEvent: Decoder[Event] =
* List[Decoder[Event]](
* Decoder[Foo].widen,
* Decoder[Bar].widen,
* Decoder[Baz].widen,
* Decoder[Qux].widen
* ).reduceLeft(_ or _)
* }
* }}}
*
* Note that we have to call `widen` (which is provided by Cats’s `Functor` syntax, which we bring
* into scope with the first import) on the decoders because the `Decoder` type class is not
* covariant. The invariance of circe’s type classes is a matter of some controversy (`Argonaut`
* for example has gone from invariant to covariant and back), but it has enough benefits that
* it’s unlikely to change, which means we need workarounds like this occasionally.
*
* It’s also worth noting that our explicit `Encoder` and `Decoder` instances will take precedence
* over the generically-derived instances we would otherwise get from the
* `io.circe.generic.auto._` import (see slides from Travis Brown’s talk here for some discussion
* of how this prioritization works).
*
* We can use these instances like this:
*/
def genericDerivation(res0: Either[String, Event], res1: String) = {
import GenericDerivation._
import io.circe.parser.decode
decode[Event]("{ \"i\": 1000 }") shouldBe res0
(Foo(100): Event).asJson.noSpaces shouldBe res1
}
/**
* =A more generic solution=
*
* We can avoid the fuss of writing out all the cases by using the `circe-shapes` module:
* {{{
* object ShapesDerivation {
* import shapeless.{ Coproduct, Generic }
*
* implicit def encodeAdtNoDiscr[A, Repr <: Coproduct](implicit
* gen: Generic.Aux[A, Repr],
* encodeRepr: Encoder[Repr]
* ): Encoder[A] = encodeRepr.contramap(gen.to)
*
* implicit def decodeAdtNoDiscr[A, Repr <: Coproduct](implicit
* gen: Generic.Aux[A, Repr],
* decodeRepr: Decoder[Repr]
* ): Decoder[A] = decodeRepr.map(gen.from)
*
* }
* }}}
*
* And then:
*/
def shapesDerivation(res0: Either[String, Event], res1: String) = {
import ShapesDerivation._
import io.circe.generic.auto._
import io.circe.shapes._
import io.circe.parser.decode
decode[Event]("{ \"i\": 1000 }") shouldBe res0
(Foo(100): Event).asJson.noSpaces shouldBe res1
}
/**
* This will work for any ADT anywhere that `encodeAdtNoDiscr` and `decodeAdtNoDiscr` are in
* scope. If we wanted it to be more limited, we could replace the generic `A` with our ADT types
* in those definitions, or we could make the definitions non-implicit and define implicit
* instances explicitly for the ADTs we want encoded this way.
*
* The main drawback of this approach (apart from the extra `circe-shapes` dependency) is that the
* constructors will be tried in alphabetical order, which may not be what we want if we have
* ambiguous case classes (where the member names and types are the same).
*
* =The future=
*
* The `generic-extras` module provides a little more configurability in this respect. We can
* write the following, for example:
* {{{
* object GenericExtraDerivation {
* import io.circe.generic.extras.Configuration
*
* implicit val genDevConfig: Configuration =
* Configuration.default.withDiscriminator("what_am_i")
* }
* }}}
*
* Instead of a wrapper object in the JSON we have an extra field that indicates the constructor.
* This isn’t the default behavior since it has some weird corner cases (e.g. if one of our case
* classes had a member named `what_am_i`), but in many cases it’s reasonable and it’s been
* supported in `generic-extras` since that module was introduced.
*/
def genericExtrasADT(res0: Either[String, Event]) = {
import GenericExtraDerivation._
import io.circe.parser.decode
import io.circe.generic.extras.auto._
decode[Event]("{ \"i\": 1000, \"what_am_i\": \"Foo\" }") shouldBe res0
}
}