on ae6719f help sign in
ChangeLog.md−5
since splitsnapshots
unifiedsplit
@@ -1,10 +1,5 @@
1# Revision history for schematic
1# Revision history for schematic
2
2
3−## 0.5.0.0 -- 2019-02-20
4−
5−GHC 8.6, json generation by schema definition, validation bug fixes, better
6−parsing error messages.
7−
8## 0.4.3.0 -- 2018-07-12
3## 0.4.3.0 -- 2018-07-12
9
4
10GHC 8.4 support, dropping support for older GHC versions
5GHC 8.4 support, dropping support for older GHC versions
release+8−16
@@ -4,12 +4,6 @@ set -o xtrace
4
4
5dist=`stack path --dist-dir --stack-yaml ./stack.yaml 2> /dev/null`
5dist=`stack path --dist-dir --stack-yaml ./stack.yaml 2> /dev/null`
6
6
7−rootdir=`pwd`
8−
9−cabalfile=`ls *.cabal`
10−packagename="${cabalfile%%.*}"
11−version=`grep '^version:' schematic.cabal | rev | cut -d" " -f1 | rev`
12−
13echo -e "\033[1;36mTesting library...\033[0m"
7echo -e "\033[1;36mTesting library...\033[0m"
14stack test 2> /dev/null
8stack test 2> /dev/null
15
9
@@ -24,19 +18,17 @@ if [ "$?" -eq "0" ]; then
24 read -p "Hackage username: " username
18 read -p "Hackage username: " username
25 read -p "Hackage password: " -s password
19 read -p "Hackage password: " -s password
26 echo ""
20 echo ""
27− cabal upload -u $username -p $password dist/$packagename-$version.tar.gz
21+ cabal upload -u $username -p $password dist/$1-$2.tar.gz
28
22
29− docdir=`find .stack-work -name "$packagename-$version-docs"`
23+ docdir=$dist/doc/html
24+ cd $docdir
25+ doc=$1-$2-docs
30
26
31− echo -e "Compressing documentation from \033[1;34m$docdir\033[0m for \033[1;35m$packagename\033[0m-\033[1;33m$version\033[1;30m"
27+ echo -e "Compressing documentation from \033[1;34m$docdir\033[0m for \033[1;35m$1\033[0m-\033[1;33m$2\033[1;30m"
28+ cp -r $1 $doc
32− tar -c -v -z --format=ustar -f $docdir.tar.gz $docdir
29+ tar -c -v -z --format=ustar -f $doc.tar.gz $doc
33 echo -e "\033[1;32mUploading documentation to Hackage...\033[0m"
30 echo -e "\033[1;32mUploading documentation to Hackage...\033[0m"
34− cd $docdir
35− cd ..
36− curl -X PUT -H 'Content-Type: application/x-tar' -H 'Content-Encoding: gzip' --data-binary "$packagename-$version-docs.tar.gz" "https://$username:$password@hackage.haskell.org/package/$packagename-$version/candidate/docs"
31+ curl -X PUT -H 'Content-Type: application/x-tar' -H 'Content-Encoding: gzip' --data-binary "@$doc.tar.gz" "https://$username:$password@hackage.haskell.org/package/$1-$2/docs"
37− open "https://hackage.haskell.org/package/$packagename-$version/candidate/"
38− cd $rootdir
39− echo "To publish the candidate, use 'cabal upload --publish'."
40 exit $?
32 exit $?
41else
33else
42 echo -e "\033[1;31mNot in a stack-powered project\033[0m"
34 echo -e "\033[1;31mNot in a stack-powered project\033[0m"
schematic.cabal+3−4
@@ -1,7 +1,6 @@
1name: schematic
1name: schematic
2−version: 0.5.0.0
2+version: 0.4.3.0
3synopsis: JSON-biased spec and validation tool
3synopsis: JSON-biased spec and validation tool
4−description: JSON-biased spec and validation tool. Makes possible to have a schema as a haskell type and derive json instances, validation actions, JSON generation for property-test generically. Built-in lens support.
5license: BSD3
4license: BSD3
6license-file: LICENSE
5license-file: LICENSE
7author: Denis Redozubov
6author: Denis Redozubov
@@ -65,7 +64,7 @@ library
65 , TypeOperators
64 , TypeOperators
66 , TypeSynonymInstances
65 , TypeSynonymInstances
67 , UndecidableInstances
66 , UndecidableInstances
68− build-depends: base >=4.11 && <4.13
67+ build-depends: base >=4.11 && <4.12
69 , bytestring
68 , bytestring
70 , aeson >= 1
69 , aeson >= 1
71 , containers
70 , containers
@@ -95,7 +94,7 @@ test-suite spec
95 default-language: Haskell2010
94 default-language: Haskell2010
96 build-depends: HUnit
95 build-depends: HUnit
97 , aeson >= 1
96 , aeson >= 1
98− , base >=4.11 && <4.13
97+ , base >=4.11 && <4.12
99 , bytestring
98 , bytestring
100 , containers
99 , containers
101 , hjsonschema
100 , hjsonschema
src/Data/Schematic/DSL.hs+2−11
@@ -1,5 +1,4 @@
1{-# LANGUAGE AllowAmbiguousTypes #-}
1{-# LANGUAGE AllowAmbiguousTypes #-}
2−{-# LANGUAGE CPP #-}
3
2
4module Data.Schematic.DSL where
3module Data.Schematic.DSL where
5
4
@@ -18,19 +17,11 @@ import Data.Vinyl
18import Data.Vinyl.Functor
17import Data.Vinyl.Functor
19
18
20
19
21−#if MIN_VERSION_base(4,12,0)
22type Constructor a
20type Constructor a
23− = forall fields b
24− . (fields ~ FieldsOf a, FSubset fields b (FImage fields b), RMap fields)
21+ = forall fields b. (fields ~ FieldsOf a, FSubset fields b (FImage fields b))
25 => Rec (Tagged fields :. FieldRepr) b
22 => Rec (Tagged fields :. FieldRepr) b
26 -> JsonRepr ('SchemaObject fields)
23 -> JsonRepr ('SchemaObject fields)
27−#else
24+
28−type Constructor a
29− = forall fields b
30− . (fields ~ FieldsOf a, FSubset fields b (FImage fields b))
31− => Rec (Tagged fields :. FieldRepr) b
32− -> JsonRepr ('SchemaObject fields)
33−#endif
34withRepr :: Constructor a
25withRepr :: Constructor a
35withRepr = ReprObject . rmap (unTagged . getCompose) . fcast
26withRepr = ReprObject . rmap (unTagged . getCompose) . fcast
36
27
src/Data/Schematic/Generator.hs+55−34
@@ -1,13 +1,26 @@
1module Data.Schematic.Generator where
1module Data.Schematic.Generator where
2
2
3+import Control.Monad
4+import Data.Aeson (Object, Value(..))
5+import Data.HashMap.Lazy (HashMap)
6+import qualified Data.HashMap.Lazy as H
7+import Data.List
3−import Data.Maybe
8+import Data.Maybe
4−import Data.Schematic.Generator.Regex
9+import Data.Monoid
5−import {-# SOURCE #-} Data.Schematic.Schema
10+import Data.Schematic.Schema
6−import Data.Schematic.Verifier
11+import qualified Data.Set as S
7−import Data.Scientific
8−import Data.Text (Text, pack)
12+import Data.Text (Text, pack, unpack)
13+import qualified Data.Text as T (replicate)
14+import Data.Text.Lazy (toStrict)
15+import Data.Text.Lazy.Builder (Builder, singleton, toLazyText)
9import qualified Data.Vector as V
16import qualified Data.Vector as V
17+import Data.Schematic.Generator.Regex
18+import Data.Schematic.Verifier
19+import Test.SmallCheck
10−import Test.SmallCheck.Series
20+import Test.SmallCheck.Series
21+import Text.Regex.TDFA
22+import Text.Regex.TDFA.Pattern
23+import Text.Regex.TDFA.ReadRegex (parseRegex)
11
24
12maxHigh :: Int
25maxHigh :: Int
13maxHigh = 30
26maxHigh = 30
@@ -18,26 +31,25 @@ minLow = 2
18textLengthSeries :: Monad m => [VerifiedTextConstraint] -> Series m Text
31textLengthSeries :: Monad m => [VerifiedTextConstraint] -> Series m Text
19textLengthSeries =
32textLengthSeries =
20 \case
33 \case
21− [VTEq eq] -> pure $ pack $ take (fromIntegral eq) $ cycle "sample"
34+ [VTEq eq] -> pure $ pack $ take (fromIntegral eq) $ cycle "sample"
22 [VTBounds ml mh] -> do
35 [VTBounds ml mh] -> do
23− let
24− l = fromMaybe minLow (fromIntegral <$> ml) + 1
36+ let l = fromMaybe minLow (fromIntegral <$> ml) + 1
25− h = fromMaybe maxHigh (fromIntegral <$> mh) - 1
37+ h = fromMaybe maxHigh (fromIntegral <$> mh) - 1
26 n <- generate $ \depth -> take depth [l .. h]
38 n <- generate $ \depth -> take depth [l .. h]
27 pure $ pack $ take (fromIntegral n) $ cycle "sample"
39 pure $ pack $ take (fromIntegral n) $ cycle "sample"
28− _ -> pure "error"
40+ _ -> pure "error"
29
41
30textEnumSeries :: Monad m => [Text] -> Series m Text
42textEnumSeries :: Monad m => [Text] -> Series m Text
31textEnumSeries enum = generate $ \depth -> take depth enum
43textEnumSeries enum = generate $ \depth -> take depth enum
32
44
33−textSeries :: Monad m => [DemotedTextConstraint] -> Series m Text
45+textSeries :: Monad m => [DemotedTextConstraint] -> Series m Value
34textSeries cs = do
46textSeries cs = do
35 let mvcs = verifyTextConstraints cs
47 let mvcs = verifyTextConstraints cs
36 case mvcs of
48 case mvcs of
37 Just vcs -> do
49 Just vcs -> do
38 n <- textSeries' vcs
50 n <- textSeries' vcs
39− pure n
51+ pure $ String n
40− Nothing -> pure "error"
52+ Nothing -> pure Null
41
53
42textSeries' :: Monad m => [VerifiedTextConstraint] -> Series m Text
54textSeries' :: Monad m => [VerifiedTextConstraint] -> Series m Text
43textSeries' [] = pure "sample"
55textSeries' [] = pure "sample"
@@ -48,19 +60,19 @@ textSeries' vcs = do
48 Nothing -> do
60 Nothing -> do
49 let regexps = listToMaybe [x | VTRegex x _ _ <- vcs]
61 let regexps = listToMaybe [x | VTRegex x _ _ <- vcs]
50 case regexps of
62 case regexps of
51− Just e -> regexSeries e
63+ Just e -> regexSeries e
52 Nothing -> textLengthSeries vcs
64 Nothing -> textLengthSeries vcs
53
65
54−numberSeries :: Monad m => [DemotedNumberConstraint] -> Series m Scientific
66+numberSeries :: Monad m => [DemotedNumberConstraint] -> Series m Value
55numberSeries cs = do
67numberSeries cs = do
56 let mvcs = verifyNumberConstraints cs
68 let mvcs = verifyNumberConstraints cs
57 case mvcs of
69 case mvcs of
58 Just vcs -> do
70 Just vcs -> do
59 n <- numberSeries' vcs
71 n <- numberSeries' vcs
60− pure $ n
72+ pure $ Number $ fromIntegral n
61− Nothing -> pure 0
73+ Nothing -> pure Null
62
74
63−numberSeries' :: Monad m => VerifiedNumberConstraint -> Series m Scientific
75+numberSeries' :: Monad m => VerifiedNumberConstraint -> Series m Integer
64numberSeries' =
76numberSeries' =
65 \case
77 \case
66 VNEq eq -> pure $ fromIntegral eq
78 VNEq eq -> pure $ fromIntegral eq
@@ -70,22 +82,31 @@ numberSeries' =
70 n <- generate $ \depth -> take depth [l .. h]
82 n <- generate $ \depth -> take depth [l .. h]
71 pure $ fromIntegral n
83 pure $ fromIntegral n
72
84
73−arraySeries
85+arraySeries ::
74− :: (Monad m, Serial m (JsonRepr s))
75− => [DemotedArrayConstraint]
86+ Monad m => [DemotedArrayConstraint] -> DemotedSchema -> Series m Value
76− -> Series m (V.Vector (JsonRepr s))
77−arraySeries cs = do
87+arraySeries cs sch = do
78 let mvcs = verifyArrayConstraint cs
88 let mvcs = verifyArrayConstraint cs
79 case mvcs of
89 case mvcs of
80− Just vcs -> arraySeries' vcs
90+ Just vcs -> arraySeries' vcs sch
81− Nothing -> pure V.empty
91+ Nothing -> pure Null
82
92
83−arraySeries'
93+arraySeries' ::
84− :: forall m s. (Monad m, Serial m (JsonRepr s))
85− => Maybe VerifiedArrayConstraint
94+ Monad m => Maybe VerifiedArrayConstraint -> DemotedSchema -> Series m Value
86− -> Series m (V.Vector (JsonRepr s))
87−arraySeries' ml = do
95+arraySeries' ml sch = do
88− objs <- V.replicateM (maybe minRepeat f ml) (series :: Series m (JsonRepr s))
96+ objs <- V.replicateM (maybe minRepeat f ml) (valueSeries sch)
89− pure $ objs
97+ pure $ Array objs
90 where
98 where
91 f (VAEq l) = fromIntegral l
99 f (VAEq l) = fromIntegral l
100+
101+valueSeries :: Monad m => DemotedSchema -> Series m Value
102+valueSeries (DSchemaText cs) = textSeries cs
103+valueSeries (DSchemaNumber cs) = numberSeries cs
104+valueSeries DSchemaBoolean = Bool <$> pure True \/ pure False
105+valueSeries (DSchemaObject pairs') =
106+ Object <$> (decDepth $ mapM valueSeries $ H.fromList pairs')
107+valueSeries (DSchemaArray cs sch) = arraySeries cs sch
108+valueSeries DSchemaNull = pure Null
109+valueSeries (DSchemaOptional sch) = pure Null \/ valueSeries sch
110+valueSeries (DSchemaUnion schs) = do
111+ objs <- mapM valueSeries schs
112+ pure $ Array $ V.fromList objs
src/Data/Schematic/Generator/Regex.hs+22−13
@@ -1,15 +1,24 @@
1module Data.Schematic.Generator.Regex where
1module Data.Schematic.Generator.Regex where
2
2
3−import Control.Monad
3+import Control.Monad
4+import Data.Aeson (Object, Value(..))
5+import Data.HashMap.Lazy (HashMap)
6+import qualified Data.HashMap.Lazy as H
4−import Data.List
7+import Data.List
5−import Data.Maybe
8+import Data.Maybe
9+import Data.Monoid
10+import Data.Schematic.Schema
6import qualified Data.Set as S
11import qualified Data.Set as S
7−import Data.Text (Text, unpack)
12+import Data.Text (Text, pack, unpack)
8−import Data.Text.Lazy (toStrict)
13+import Data.Text.Lazy (toStrict)
9−import Data.Text.Lazy.Builder (Builder, singleton, toLazyText)
14+import Data.Text.Lazy.Builder (Builder, singleton, toLazyText)
15+import qualified Data.Vector as V
16+import Test.SmallCheck
10−import Test.SmallCheck.Series
17+import Test.SmallCheck.Series
18+import Text.Regex.TDFA
11−import Text.Regex.TDFA.Pattern
19+import Text.Regex.TDFA.Pattern
12−import Text.Regex.TDFA.ReadRegex (parseRegex)
20+import Text.Regex.TDFA.ReadRegex (parseRegex)
21+import Data.Schematic.Verifier
13
22
14
23
15minRepeat :: Int
24minRepeat :: Int
@@ -22,11 +31,11 @@ regexSeries :: (Monad m) => Text -> Series m Text
22regexSeries regexp =
31regexSeries regexp =
23 case parseRegex . unpack $ regexp of
32 case parseRegex . unpack $ regexp of
24 Right (p, _) -> toStrict . toLazyText <$> regexSeries' p
33 Right (p, _) -> toStrict . toLazyText <$> regexSeries' p
25− Left _ -> pure ""
34+ Left _ -> pure ""
26
35
27regexSeries' :: (Monad m) => Pattern -> Series m Builder
36regexSeries' :: (Monad m) => Pattern -> Series m Builder
28−regexSeries' pt =
37+regexSeries' p =
29− case pt of
38+ case p of
30 PEmpty -> pure mempty
39 PEmpty -> pure mempty
31 PChar {..} -> pure $ singleton getPatternChar
40 PChar {..} -> pure $ singleton getPatternChar
32 PAny {getPatternSet = PatternSet (Just cset) _ _ _} -> do
41 PAny {getPatternSet = PatternSet (Just cset) _ _ _} -> do
@@ -73,4 +82,4 @@ regexSeries' pt =
73 'D' -> notChars $ ['0' .. '9']
82 'D' -> notChars $ ['0' .. '9']
74 'W' -> notChars $ ['0' .. '9'] ++ '_' : ['a' .. 'z'] ++ ['A' .. 'Z']
83 'W' -> notChars $ ['0' .. '9'] ++ '_' : ['a' .. 'z'] ++ ['A' .. 'Z']
75 'S' -> notChars "\9\32"
84 'S' -> notChars "\9\32"
76− ch' -> [ch']
85+ ch -> [ch]
src/Data/Schematic/JsonSchema.hs+9−21
@@ -30,13 +30,13 @@ textConstraint :: DemotedTextConstraint -> State D4.Schema ()
30textConstraint (DTEq n) = modify $ \s -> s
30textConstraint (DTEq n) = modify $ \s -> s
31 { _schemaMinLength = pure $ fromIntegral n
31 { _schemaMinLength = pure $ fromIntegral n
32 , _schemaMaxLength = pure $ fromIntegral n }
32 , _schemaMaxLength = pure $ fromIntegral n }
33+textConstraint (DTLt n) = modify $ \s -> s
34+ { _schemaMaxLength = pure . fromIntegral $ n + 1 }
33textConstraint (DTLe n) = modify $ \s -> s
35textConstraint (DTLe n) = modify $ \s -> s
34 { _schemaMaxLength = pure . fromIntegral $ n }
36 { _schemaMaxLength = pure . fromIntegral $ n }
35−textConstraint (DTLt n) =
37+textConstraint (DTGt n) =
36 let n' = if n == 0 then 0 else n - 1
38 let n' = if n == 0 then 0 else n - 1
37− in modify $ \s -> s { _schemaMaxLength = pure . fromIntegral $ n' }
39+ in modify $ \s -> s { _schemaMinLength = pure . fromIntegral $ n' }
38−textConstraint (DTGt n) = modify $ \s -> s
39− { _schemaMinLength = pure . fromIntegral $ n + 1 }
40textConstraint (DTGe n) = modify $ \s -> s
40textConstraint (DTGe n) = modify $ \s -> s
41 { _schemaMinLength = pure . fromIntegral $ n }
41 { _schemaMinLength = pure . fromIntegral $ n }
42textConstraint (DTRegex r) = modify $ \s -> s { _schemaPattern = pure r }
42textConstraint (DTRegex r) = modify $ \s -> s { _schemaPattern = pure r }
@@ -48,30 +48,18 @@ numberConstraint :: DemotedNumberConstraint -> State D4.Schema ()
48numberConstraint (DNLe n) = modify $ \s -> s
48numberConstraint (DNLe n) = modify $ \s -> s
49 { _schemaMaximum = pure . fromIntegral $ n }
49 { _schemaMaximum = pure . fromIntegral $ n }
50numberConstraint (DNLt n) = modify $ \s -> s
50numberConstraint (DNLt n) = modify $ \s -> s
51− { _schemaMaximum = pure . fromIntegral $ n
51+ { _schemaMaximum = pure . fromIntegral $ n + 1 }
52− , _schemaExclusiveMaximum = pure True }
53numberConstraint (DNGt n) = modify $ \s -> s
52numberConstraint (DNGt n) = modify $ \s -> s
54− { _schemaMinimum = pure . fromIntegral $ n
55− , _schemaExclusiveMinimum = pure True }
56−numberConstraint (DNGe n) = modify $ \s -> s
57 { _schemaMinimum = pure . fromIntegral $ n }
53 { _schemaMinimum = pure . fromIntegral $ n }
54+numberConstraint (DNGe n) =
55+ let n' = if n == 0 then 0 else n - 1
56+ in modify $ \s -> s { _schemaMinimum = pure . fromIntegral $ n' }
58numberConstraint (DNEq n) = modify $ \s -> s
57numberConstraint (DNEq n) = modify $ \s -> s
59 { _schemaMinimum = pure $ fromIntegral n
58 { _schemaMinimum = pure $ fromIntegral n
60 , _schemaMaximum = pure $ fromIntegral n }
59 , _schemaMaximum = pure $ fromIntegral n }
61
60
62arrayConstraint :: DemotedArrayConstraint -> State D4.Schema ()
61arrayConstraint :: DemotedArrayConstraint -> State D4.Schema ()
63−arrayConstraint (DALe n) = modify $ \s -> s
62+arrayConstraint (DAEq _) = pure ()
64− { _schemaMaxItems = pure . fromIntegral $ n }
65−arrayConstraint (DALt n) =
66− let n' = if n == 0 then 0 else n - 1
67− in modify $ \s -> s { _schemaMaxItems = pure . fromIntegral $ n' }
68−arrayConstraint (DAGt n) = modify $ \s -> s
69− { _schemaMinItems = pure . fromIntegral $ n + 1 }
70−arrayConstraint (DAGe n) = modify $ \s -> s
71− { _schemaMinItems = pure . fromIntegral $ n }
72−arrayConstraint (DAEq n) = modify $ \s -> s
73− { _schemaMinItems = pure $ fromIntegral n
74− , _schemaMaxItems = pure $ fromIntegral n }
75
63
76toJsonSchema
64toJsonSchema
77 :: forall proxy schema
65 :: forall proxy schema
src/Data/Schematic/Migration.hs+2−10
@@ -1,6 +1,5 @@
1{-# LANGUAGE AllowAmbiguousTypes #-}
1{-# LANGUAGE AllowAmbiguousTypes #-}
2−{-# LANGUAGE CPP #-}
3−{-# LANGUAGE TemplateHaskell #-}
2+{-# LANGUAGE TemplateHaskell #-}
4
3
5module Data.Schematic.Migration where
4module Data.Schematic.Migration where
6
5
@@ -9,7 +8,7 @@ import Data.Schematic.DSL
9import Data.Schematic.Lens
8import Data.Schematic.Lens
10import Data.Schematic.Path
9import Data.Schematic.Path
11import Data.Schematic.Schema
10import Data.Schematic.Schema
12−import Data.Singletons.Prelude hiding ((:.), All)
11+import Data.Singletons.Prelude hiding (All, (:.))
13import Data.Singletons.TypeLits
12import Data.Singletons.TypeLits
14import Data.Tagged
13import Data.Tagged
15import Data.Vinyl
14import Data.Vinyl
@@ -157,17 +156,10 @@ data MList :: (Type -> Type) -> [Schema] -> Type where
157
156
158infixr 7 :&&
157infixr 7 :&&
159
158
160−#if MIN_VERSION_base(4,12,0)
161−migrateObject
162− :: forall m fs fh. (FSubset fs fs (FImage fs fs), Monad m, RMap fh, RMap fs)
163− => (Rec (Tagged fs :. FieldRepr) fh -> m (Rec (Tagged fs :. FieldRepr) fs))
164− -> Tagged ('SchemaObject fs) (JsonRepr ('SchemaObject fh) -> m (JsonRepr ('SchemaObject fs)))
165−#else
166migrateObject
159migrateObject
167 :: forall m fs fh. (FSubset fs fs (FImage fs fs), Monad m)
160 :: forall m fs fh. (FSubset fs fs (FImage fs fs), Monad m)
168 => (Rec (Tagged fs :. FieldRepr) fh -> m (Rec (Tagged fs :. FieldRepr) fs))
161 => (Rec (Tagged fs :. FieldRepr) fh -> m (Rec (Tagged fs :. FieldRepr) fs))
169 -> Tagged ('SchemaObject fs) (JsonRepr ('SchemaObject fh) -> m (JsonRepr ('SchemaObject fs)))
162 -> Tagged ('SchemaObject fs) (JsonRepr ('SchemaObject fh) -> m (JsonRepr ('SchemaObject fs)))
170−#endif
171migrateObject f = Tagged $ \(ReprObject r) -> do
163migrateObject f = Tagged $ \(ReprObject r) -> do
172 res <- f $ rmap (Compose . Tagged) r
164 res <- f $ rmap (Compose . Tagged) r
173 pure $ withRepr @('SchemaObject fs) res
165 pure $ withRepr @('SchemaObject fs) res
src/Data/Schematic/Path.hs+1
@@ -1,6 +1,7 @@
1module Data.Schematic.Path where
1module Data.Schematic.Path where
2
2
3import Data.Foldable as F
3import Data.Foldable as F
4+import Data.Monoid
4import Data.Singletons.Prelude
5import Data.Singletons.Prelude
5import Data.Singletons.TypeLits
6import Data.Singletons.TypeLits
6import Data.Text as T
7import Data.Text as T
src/Data/Schematic/Schema.hs+38−108
@@ -1,7 +1,6 @@
1{-# LANGUAGE AllowAmbiguousTypes #-}
1{-# LANGUAGE AllowAmbiguousTypes #-}
2−{-# LANGUAGE CPP #-}
3−{-# LANGUAGE OverloadedLists #-}
2+{-# LANGUAGE OverloadedLists #-}
4−{-# LANGUAGE OverloadedStrings #-}
3+{-# LANGUAGE OverloadedStrings #-}
5{-# OPTIONS_GHC -fprint-explicit-kinds #-}
4{-# OPTIONS_GHC -fprint-explicit-kinds #-}
6
5
7module Data.Schematic.Schema where
6module Data.Schematic.Schema where
@@ -13,7 +12,6 @@ import Data.Aeson.Types as J
13import Data.HashMap.Strict as H
12import Data.HashMap.Strict as H
14import Data.Kind
13import Data.Kind
15import Data.Maybe
14import Data.Maybe
16−import Data.Schematic.Generator
17import Data.Schematic.Instances ()
15import Data.Schematic.Instances ()
18import Data.Scientific
16import Data.Scientific
19import Data.Singletons.Prelude.List hiding (All, Union)
17import Data.Singletons.Prelude.List hiding (All, Union)
@@ -26,8 +24,7 @@ import Data.Vinyl hiding (Dict)
26import qualified Data.Vinyl.TypeLevel as V
24import qualified Data.Vinyl.TypeLevel as V
27import GHC.Exts
25import GHC.Exts
28import GHC.Generics (Generic)
26import GHC.Generics (Generic)
29−import GHC.TypeLits
30− (SomeNat(..), SomeSymbol(..), someNatVal, someSymbolVal)
27+import GHC.TypeLits (SomeNat(..), SomeSymbol(..), someSymbolVal, someNatVal)
31import Prelude as P
28import Prelude as P
32import Test.SmallCheck.Series
29import Test.SmallCheck.Series
33
30
@@ -59,25 +56,25 @@ instance SingKind TextConstraint where
59 STRegex s -> withKnownSymbol s (DTRegex $ T.pack $ symbolVal s)
56 STRegex s -> withKnownSymbol s (DTRegex $ T.pack $ symbolVal s)
60 STEnum s -> let
57 STEnum s -> let
61 d :: Sing (s :: [Symbol]) -> [Text]
58 d :: Sing (s :: [Symbol]) -> [Text]
62− d SNil = []
59+ d SNil = []
63 d (SCons ss@SSym fs) = T.pack (symbolVal ss) : d fs
60 d (SCons ss@SSym fs) = T.pack (symbolVal ss) : d fs
64 in DTEnum $ d s
61 in DTEnum $ d s
65 toSing = \case
62 toSing = \case
66 DTEq n -> case someNatVal n of
63 DTEq n -> case someNatVal n of
67 Just (SomeNat (_ :: Proxy n)) -> SomeSing (STEq (SNat :: Sing n))
64 Just (SomeNat (_ :: Proxy n)) -> SomeSing (STEq (SNat :: Sing n))
68− Nothing -> error "Negative singleton nat"
65+ Nothing -> error "Negative singleton nat"
69 DTLt n -> case someNatVal n of
66 DTLt n -> case someNatVal n of
70 Just (SomeNat (_ :: Proxy n)) -> SomeSing (STLt (SNat :: Sing n))
67 Just (SomeNat (_ :: Proxy n)) -> SomeSing (STLt (SNat :: Sing n))
71− Nothing -> error "Negative singleton nat"
68+ Nothing -> error "Negative singleton nat"
72 DTLe n -> case someNatVal n of
69 DTLe n -> case someNatVal n of
73 Just (SomeNat (_ :: Proxy n)) -> SomeSing (STLe (SNat :: Sing n))
70 Just (SomeNat (_ :: Proxy n)) -> SomeSing (STLe (SNat :: Sing n))
74− Nothing -> error "Negative singleton nat"
71+ Nothing -> error "Negative singleton nat"
75 DTGt n -> case someNatVal n of
72 DTGt n -> case someNatVal n of
76 Just (SomeNat (_ :: Proxy n)) -> SomeSing (STGt (SNat :: Sing n))
73 Just (SomeNat (_ :: Proxy n)) -> SomeSing (STGt (SNat :: Sing n))
77− Nothing -> error "Negative singleton nat"
74+ Nothing -> error "Negative singleton nat"
78 DTGe n -> case someNatVal n of
75 DTGe n -> case someNatVal n of
79 Just (SomeNat (_ :: Proxy n)) -> SomeSing (STGe (SNat :: Sing n))
76 Just (SomeNat (_ :: Proxy n)) -> SomeSing (STGe (SNat :: Sing n))
80− Nothing -> error "Negative singleton nat"
77+ Nothing -> error "Negative singleton nat"
81 DTRegex s -> case someSymbolVal (T.unpack s) of
78 DTRegex s -> case someSymbolVal (T.unpack s) of
82 SomeSymbol (_ :: Proxy n) -> SomeSing (STRegex (SSym :: Sing n))
79 SomeSymbol (_ :: Proxy n) -> SomeSing (STRegex (SSym :: Sing n))
83 DTEnum ss -> case toSing ss of
80 DTEnum ss -> case toSing ss of
@@ -164,79 +161,43 @@ instance SingKind NumberConstraint where
164 toSing = \case
161 toSing = \case
165 DNEq n -> case someNatVal n of
162 DNEq n -> case someNatVal n of
166 Just (SomeNat (_ :: Proxy n)) -> SomeSing (SNEq (SNat :: Sing n))
163 Just (SomeNat (_ :: Proxy n)) -> SomeSing (SNEq (SNat :: Sing n))
167− Nothing -> error "Negative singleton nat"
164+ Nothing -> error "Negative singleton nat"
168 DNGt n -> case someNatVal n of
165 DNGt n -> case someNatVal n of
169 Just (SomeNat (_ :: Proxy n)) -> SomeSing (SNGt (SNat :: Sing n))
166 Just (SomeNat (_ :: Proxy n)) -> SomeSing (SNGt (SNat :: Sing n))
170− Nothing -> error "Negative singleton nat"
167+ Nothing -> error "Negative singleton nat"
171 DNGe n -> case someNatVal n of
168 DNGe n -> case someNatVal n of
172 Just (SomeNat (_ :: Proxy n)) -> SomeSing (SNGe (SNat :: Sing n))
169 Just (SomeNat (_ :: Proxy n)) -> SomeSing (SNGe (SNat :: Sing n))
173− Nothing -> error "Negative singleton nat"
170+ Nothing -> error "Negative singleton nat"
174 DNLt n -> case someNatVal n of
171 DNLt n -> case someNatVal n of
175 Just (SomeNat (_ :: Proxy n)) -> SomeSing (SNLt (SNat :: Sing n))
172 Just (SomeNat (_ :: Proxy n)) -> SomeSing (SNLt (SNat :: Sing n))
176− Nothing -> error "Negative singleton nat"
173+ Nothing -> error "Negative singleton nat"
177 DNLe n -> case someNatVal n of
174 DNLe n -> case someNatVal n of
178 Just (SomeNat (_ :: Proxy n)) -> SomeSing (SNLe (SNat :: Sing n))
175 Just (SomeNat (_ :: Proxy n)) -> SomeSing (SNLe (SNat :: Sing n))
179− Nothing -> error "Negative singleton nat"
176+ Nothing -> error "Negative singleton nat"
180
177
181data ArrayConstraint
178data ArrayConstraint
182 = AEq Nat
179 = AEq Nat
183− | AGt Nat
184− | AGe Nat
185− | ALt Nat
186− | ALe Nat
187 deriving (Generic)
180 deriving (Generic)
188
181
189data DemotedArrayConstraint
182data DemotedArrayConstraint
190 = DAEq Integer
183 = DAEq Integer
191− | DAGt Integer
192− | DAGe Integer
193− | DALt Integer
194− | DALe Integer
195 deriving (Generic, Eq, Show)
184 deriving (Generic, Eq, Show)
196
185
197data instance Sing (ac :: ArrayConstraint) where
186data instance Sing (ac :: ArrayConstraint) where
198 SAEq :: Sing n -> Sing ('AEq n)
187 SAEq :: Sing n -> Sing ('AEq n)
199− SAGt :: Sing n -> Sing ('AGt n)
200− SAGe :: Sing n -> Sing ('AGe n)
201− SALt :: Sing n -> Sing ('ALt n)
202− SALe :: Sing n -> Sing ('ALe n)
203
188
204instance KnownNat n => SingI ('AEq n) where sing = SAEq sing
189instance KnownNat n => SingI ('AEq n) where sing = SAEq sing
205−instance KnownNat n => SingI ('AGt n) where sing = SAGt sing
206−instance KnownNat n => SingI ('AGe n) where sing = SAGe sing
207−instance KnownNat n => SingI ('ALt n) where sing = SALt sing
208−instance KnownNat n => SingI ('ALe n) where sing = SALe sing
209
190
210instance Eq (Sing ('AEq n)) where _ == _ = True
191instance Eq (Sing ('AEq n)) where _ == _ = True
211−instance Eq (Sing ('AGt n)) where _ == _ = True
212−instance Eq (Sing ('AGe n)) where _ == _ = True
213−instance Eq (Sing ('ALt n)) where _ == _ = True
214−instance Eq (Sing ('ALe n)) where _ == _ = True
215
192
216instance SingKind ArrayConstraint where
193instance SingKind ArrayConstraint where
217 type Demote ArrayConstraint = DemotedArrayConstraint
194 type Demote ArrayConstraint = DemotedArrayConstraint
218 fromSing = \case
195 fromSing = \case
219 SAEq n -> withKnownNat n (DAEq . fromIntegral $ natVal n)
196 SAEq n -> withKnownNat n (DAEq . fromIntegral $ natVal n)
220− SAGt n -> withKnownNat n (DAGt . fromIntegral $ natVal n)
221− SAGe n -> withKnownNat n (DAGe . fromIntegral $ natVal n)
222− SALt n -> withKnownNat n (DALt . fromIntegral $ natVal n)
223− SALe n -> withKnownNat n (DALe . fromIntegral $ natVal n)
224 toSing = \case
197 toSing = \case
225 DAEq n -> case someNatVal n of
198 DAEq n -> case someNatVal n of
226 Just (SomeNat (_ :: Proxy n)) -> SomeSing (SAEq (SNat :: Sing n))
199 Just (SomeNat (_ :: Proxy n)) -> SomeSing (SAEq (SNat :: Sing n))
227− Nothing -> error "Negative singleton nat"
228− DAGt n -> case someNatVal n of
229− Just (SomeNat (_ :: Proxy n)) -> SomeSing (SAGt (SNat :: Sing n))
230− Nothing -> error "Negative singleton nat"
231− DAGe n -> case someNatVal n of
232− Just (SomeNat (_ :: Proxy n)) -> SomeSing (SAGe (SNat :: Sing n))
233− Nothing -> error "Negative singleton nat"
234− DALt n -> case someNatVal n of
235− Just (SomeNat (_ :: Proxy n)) -> SomeSing (SALt (SNat :: Sing n))
236− Nothing -> error "Negative singleton nat"
237− DALe n -> case someNatVal n of
238− Just (SomeNat (_ :: Proxy n)) -> SomeSing (SALe (SNat :: Sing n))
239− Nothing -> error "Negative singleton nat"
200+ Nothing -> error "Negative singleton nat"
240
201
241data Schema
202data Schema
242 = SchemaText [TextConstraint]
203 = SchemaText [TextConstraint]
@@ -373,31 +334,6 @@ data JsonRepr :: Schema -> Type where
373 ReprOptional :: Maybe (JsonRepr s) -> JsonRepr ('SchemaOptional s)
334 ReprOptional :: Maybe (JsonRepr s) -> JsonRepr ('SchemaOptional s)
374 ReprUnion :: Union JsonRepr (h ': tl) -> JsonRepr ('SchemaUnion (h ': tl))
335 ReprUnion :: Union JsonRepr (h ': tl) -> JsonRepr ('SchemaUnion (h ': tl))
375
336
376−instance (Monad m, Serial m Text, SingI cs)
377− => Serial m (JsonRepr ('SchemaText cs)) where
378− series = decDepth $ fmap ReprText $ textSeries $ fromSing (sing :: Sing cs)
379−
380−instance (Monad m, Serial m Scientific, SingI cs)
381− => Serial m (JsonRepr ('SchemaNumber cs)) where
382− series = decDepth $ fmap ReprNumber
383− $ numberSeries $ fromSing (sing :: Sing cs)
384−
385−instance Monad m => Serial m (JsonRepr 'SchemaNull) where
386− series = cons0 ReprNull
387−
388−instance (Serial m (JsonRepr s), Serial m (V.Vector (JsonRepr s)), SingI cs)
389− => Serial m (JsonRepr ('SchemaArray cs s)) where
390− series = decDepth $ fmap ReprArray
391− $ arraySeries $ fromSing (sing :: Sing cs)
392−
393−instance (Serial m (JsonRepr s))
394− => Serial m (JsonRepr ('SchemaOptional s)) where
395− series = cons1 ReprOptional
396−
397−instance (Monad m, Serial m (Rec FieldRepr fs))
398− => Serial m (JsonRepr ('SchemaObject fs)) where
399− series = cons1 ReprObject
400−
401-- | Move to the union package
337-- | Move to the union package
402instance Show (JsonRepr ('SchemaText cs)) where
338instance Show (JsonRepr ('SchemaText cs)) where
403 show (ReprText t) = "ReprText " P.++ show t
339 show (ReprText t) = "ReprText " P.++ show t
@@ -405,31 +341,39 @@ instance Show (JsonRepr ('SchemaText cs)) where
405instance Show (JsonRepr ('SchemaNumber cs)) where
341instance Show (JsonRepr ('SchemaNumber cs)) where
406 show (ReprNumber n) = "ReprNumber " P.++ show n
342 show (ReprNumber n) = "ReprNumber " P.++ show n
407
343
408−instance Show (JsonRepr 'SchemaBoolean) where
409− show (ReprBoolean n) = "ReprBoolean " P.++ show n
410−
411instance Show (JsonRepr 'SchemaNull) where show _ = "ReprNull"
344instance Show (JsonRepr 'SchemaNull) where show _ = "ReprNull"
412
345
413instance Show (JsonRepr s) => Show (JsonRepr ('SchemaArray acs s)) where
346instance Show (JsonRepr s) => Show (JsonRepr ('SchemaArray acs s)) where
414 show (ReprArray v) = "ReprArray " P.++ show v
347 show (ReprArray v) = "ReprArray " P.++ show v
415
348
416−#if MIN_VERSION_base(4,12,0)
417−instance
418− ( V.RecAll FieldRepr fs Show, RMap fs, ReifyConstraint Show FieldRepr fs
419− , RecordToList fs )
420− => Show (JsonRepr ('SchemaObject fs)) where
421− show (ReprObject fs) = "ReprObject " P.++ show fs
422−#else
423instance V.RecAll FieldRepr fs Show => Show (JsonRepr ('SchemaObject fs)) where
349instance V.RecAll FieldRepr fs Show => Show (JsonRepr ('SchemaObject fs)) where
424 show (ReprObject fs) = "ReprObject " P.++ show fs
350 show (ReprObject fs) = "ReprObject " P.++ show fs
425−#endif
426
351
427instance Show (JsonRepr s) => Show (JsonRepr ('SchemaOptional s)) where
352instance Show (JsonRepr s) => Show (JsonRepr ('SchemaOptional s)) where
428 show (ReprOptional s) = "ReprOptional " P.++ show s
353 show (ReprOptional s) = "ReprOptional " P.++ show s
429
354
430−instance Show (Union JsonRepr (h ': tl))
355+instance (Monad m, Serial m Text)
431− => Show (JsonRepr ('SchemaUnion (h ': tl))) where
356+ => Serial m (JsonRepr ('SchemaText cs)) where
432− show (ReprUnion s) = "ReprUnion " P.++ show s
357+ series = cons1 ReprText
358+
359+instance (Monad m, Serial m Scientific)
360+ => Serial m (JsonRepr ('SchemaNumber cs)) where
361+ series = cons1 ReprNumber
362+
363+instance Monad m => Serial m (JsonRepr 'SchemaNull) where
364+ series = cons0 ReprNull
365+
366+instance (Serial m (V.Vector (JsonRepr s)))
367+ => Serial m (JsonRepr ('SchemaArray cs s)) where
368+ series = cons1 ReprArray
369+
370+instance (Serial m (JsonRepr s))
371+ => Serial m (JsonRepr ('SchemaOptional s)) where
372+ series = cons1 ReprOptional
373+
374+instance (Monad m, Serial m (Rec FieldRepr fs))
375+ => Serial m (JsonRepr ('SchemaObject fs)) where
376+ series = cons1 ReprObject
433
377
434instance Eq (Rec FieldRepr fs) => Eq (JsonRepr ('SchemaObject fs)) where
378instance Eq (Rec FieldRepr fs) => Eq (JsonRepr ('SchemaObject fs)) where
435 ReprObject a == ReprObject b = a == b
379 ReprObject a == ReprObject b = a == b
@@ -440,9 +384,6 @@ instance Eq (JsonRepr ('SchemaText cs)) where
440instance Eq (JsonRepr ('SchemaNumber cs)) where
384instance Eq (JsonRepr ('SchemaNumber cs)) where
441 ReprNumber a == ReprNumber b = a == b
385 ReprNumber a == ReprNumber b = a == b
442
386
443−instance Eq (JsonRepr 'SchemaBoolean) where
444− ReprBoolean a == ReprBoolean b = a == b
445−
446instance Eq (JsonRepr 'SchemaNull) where
387instance Eq (JsonRepr 'SchemaNull) where
447 ReprNull == ReprNull = True
388 ReprNull == ReprNull = True
448
389
@@ -452,10 +393,6 @@ instance Eq (JsonRepr s) => Eq (JsonRepr ('SchemaArray as s)) where
452instance Eq (JsonRepr s) => Eq (JsonRepr ('SchemaOptional s)) where
393instance Eq (JsonRepr s) => Eq (JsonRepr ('SchemaOptional s)) where
453 ReprOptional a == ReprOptional b = a == b
394 ReprOptional a == ReprOptional b = a == b
454
395
455−instance Eq (Union JsonRepr (h ': tl))
456− => Eq (JsonRepr ('SchemaUnion (h ': tl))) where
457− ReprUnion a == ReprUnion b = a == b
458−
459instance Ord (Rec FieldRepr fs) => Ord (JsonRepr ('SchemaObject fs)) where
396instance Ord (Rec FieldRepr fs) => Ord (JsonRepr ('SchemaObject fs)) where
460 ReprObject a `compare` ReprObject b = a `compare` b
397 ReprObject a `compare` ReprObject b = a `compare` b
461
398
@@ -465,9 +402,6 @@ instance Ord (JsonRepr ('SchemaText cs)) where
465instance Ord (JsonRepr ('SchemaNumber cs)) where
402instance Ord (JsonRepr ('SchemaNumber cs)) where
466 ReprNumber a `compare` ReprNumber b = a `compare` b
403 ReprNumber a `compare` ReprNumber b = a `compare` b
467
404
468−instance Ord (JsonRepr 'SchemaBoolean) where
469− ReprBoolean a `compare` ReprBoolean b = a `compare` b
470−
471instance Ord (JsonRepr 'SchemaNull) where
405instance Ord (JsonRepr 'SchemaNull) where
472 compare _ _ = EQ
406 compare _ _ = EQ
473
407
@@ -477,10 +411,6 @@ instance Ord (JsonRepr s) => Ord (JsonRepr ('SchemaArray as s)) where
477instance Ord (JsonRepr s) => Ord (JsonRepr ('SchemaOptional s)) where
411instance Ord (JsonRepr s) => Ord (JsonRepr ('SchemaOptional s)) where
478 ReprOptional a `compare` ReprOptional b = a `compare` b
412 ReprOptional a `compare` ReprOptional b = a `compare` b
479
413
480−instance Ord (Union JsonRepr (h ': tl))
481− => Ord (JsonRepr ('SchemaUnion (h ': tl))) where
482− ReprUnion a `compare` ReprUnion b = a `compare` b
483−
484instance IsList (JsonRepr ('SchemaArray cs s)) where
414instance IsList (JsonRepr ('SchemaArray cs s)) where
485 type Item (JsonRepr ('SchemaArray cs s)) = JsonRepr s
415 type Item (JsonRepr ('SchemaArray cs s)) = JsonRepr s
486 fromList = ReprArray . GHC.Exts.fromList
416 fromList = ReprArray . GHC.Exts.fromList
@@ -572,7 +502,7 @@ instance J.ToJSON (JsonRepr a) where
572 toJSON (ReprText t) = J.String t
502 toJSON (ReprText t) = J.String t
573 toJSON (ReprNumber n) = J.Number n
503 toJSON (ReprNumber n) = J.Number n
574 toJSON (ReprOptional s) = case s of
504 toJSON (ReprOptional s) = case s of
575− Just v -> toJSON v
505+ Just v -> toJSON v
576 Nothing -> J.Null
506 Nothing -> J.Null
577 toJSON (ReprArray v) = J.Array $ toJSON <$> v
507 toJSON (ReprArray v) = J.Array $ toJSON <$> v
578 toJSON (ReprObject r) = J.Object . H.fromList . fold $ r
508 toJSON (ReprObject r) = J.Object . H.fromList . fold $ r
src/Data/Schematic/Schema.hs-bootdeleted−95
@@ -1,95 +0,0 @@
1−module Data.Schematic.Schema where
2−
3−import Data.Kind
4−import Data.Maybe
5−import Data.Schematic.Instances ()
6−import Data.Scientific
7−import Data.Singletons.TH
8−import Data.Singletons.TypeLits
9−import Data.Text as T
10−import Data.Union
11−import Data.Vector as V
12−import Data.Vinyl hiding (Dict)
13−import Prelude as P
14−
15−data TextConstraint
16− = TEq Nat
17− | TLt Nat
18− | TLe Nat
19− | TGt Nat
20− | TGe Nat
21− | TRegex Symbol
22− | TEnum [Symbol]
23−
24−data DemotedTextConstraint
25− = DTEq Integer
26− | DTLt Integer
27− | DTLe Integer
28− | DTGt Integer
29− | DTGe Integer
30− | DTRegex Text
31− | DTEnum [Text]
32−
33−data NumberConstraint
34− = NLe Nat
35− | NLt Nat
36− | NGt Nat
37− | NGe Nat
38− | NEq Nat
39−
40−data DemotedNumberConstraint
41− = DNLe Integer
42− | DNLt Integer
43− | DNGt Integer
44− | DNGe Integer
45− | DNEq Integer
46−
47−data ArrayConstraint
48− = AEq Nat
49− | AGt Nat
50− | AGe Nat
51− | ALt Nat
52− | ALe Nat
53−
54−data DemotedArrayConstraint
55− = DAEq Integer
56− | DAGt Integer
57− | DAGe Integer
58− | DALt Integer
59− | DALe Integer
60−
61−data Schema
62− = SchemaText [TextConstraint]
63− | SchemaBoolean
64− | SchemaNumber [NumberConstraint]
65− | SchemaObject [(Symbol, Schema)]
66− | SchemaArray [ArrayConstraint] Schema
67− | SchemaNull
68− | SchemaOptional Schema
69− | SchemaUnion [Schema]
70−
71−data DemotedSchema
72− = DSchemaText [DemotedTextConstraint]
73− | DSchemaNumber [DemotedNumberConstraint]
74− | DSchemaBoolean
75− | DSchemaObject [(Text, DemotedSchema)]
76− | DSchemaArray [DemotedArrayConstraint] DemotedSchema
77− | DSchemaNull
78− | DSchemaOptional DemotedSchema
79− | DSchemaUnion [DemotedSchema]
80−
81−data FieldRepr :: (Symbol, Schema) -> Type where
82− FieldRepr
83− :: (SingI schema, KnownSymbol name)
84− => JsonRepr schema
85− -> FieldRepr '(name, schema)
86−
87−data JsonRepr :: Schema -> Type where
88− ReprText :: Text -> JsonRepr ('SchemaText cs)
89− ReprNumber :: Scientific -> JsonRepr ('SchemaNumber cs)
90− ReprBoolean :: Bool -> JsonRepr 'SchemaBoolean
91− ReprNull :: JsonRepr 'SchemaNull
92− ReprArray :: V.Vector (JsonRepr s) -> JsonRepr ('SchemaArray cs s)
93− ReprObject :: Rec FieldRepr fs -> JsonRepr ('SchemaObject fs)
94− ReprOptional :: Maybe (JsonRepr s) -> JsonRepr ('SchemaOptional s)
95− ReprUnion :: Union JsonRepr (h ': tl) -> JsonRepr ('SchemaUnion (h ': tl))
src/Data/Schematic/Validation.hs+17−45
@@ -58,42 +58,42 @@ validateTextConstraint (JSONPath path) t = \case
58 let
58 let
59 nlen = withKnownNat n $ natVal n
59 nlen = withKnownNat n $ natVal n
60 predicate = nlen == (fromIntegral $ T.length t)
60 predicate = nlen == (fromIntegral $ T.length t)
61− errMsg = "length should be == " <> T.pack (show nlen)
61+ errMsg = "length of " <> path <> " should be == " <> T.pack (show nlen)
62 warn = vWarning $ mmSingleton path (pure errMsg)
62 warn = vWarning $ mmSingleton path (pure errMsg)
63 unless predicate warn
63 unless predicate warn
64 STLt n -> do
64 STLt n -> do
65 let
65 let
66 nlen = withKnownNat n $ natVal n
66 nlen = withKnownNat n $ natVal n
67− predicate = nlen > (fromIntegral $ T.length t)
67+ predicate = nlen < (fromIntegral $ T.length t)
68− errMsg = "length should be < " <> T.pack (show nlen)
68+ errMsg = "length of " <> path <> " should be < " <> T.pack (show nlen)
69 warn = vWarning $ mmSingleton path (pure errMsg)
69 warn = vWarning $ mmSingleton path (pure errMsg)
70 unless predicate warn
70 unless predicate warn
71 STLe n -> do
71 STLe n -> do
72 let
72 let
73 nlen = withKnownNat n $ natVal n
73 nlen = withKnownNat n $ natVal n
74− predicate = nlen >= (fromIntegral $ T.length t)
74+ predicate = nlen <= (fromIntegral $ T.length t)
75− errMsg = "length should be <= " <> T.pack (show nlen)
75+ errMsg = "length of " <> path <> " should be <= " <> T.pack (show nlen)
76 warn = vWarning $ mmSingleton path (pure errMsg)
76 warn = vWarning $ mmSingleton path (pure errMsg)
77 unless predicate warn
77 unless predicate warn
78 STGt n -> do
78 STGt n -> do
79 let
79 let
80 nlen = withKnownNat n $ natVal n
80 nlen = withKnownNat n $ natVal n
81− predicate = nlen < (fromIntegral $ T.length t)
81+ predicate = nlen > (fromIntegral $ T.length t)
82− errMsg = "length should be > " <> T.pack (show nlen)
82+ errMsg = "length of " <> path <> " should be > " <> T.pack (show nlen)
83 warn = vWarning $ mmSingleton path (pure errMsg)
83 warn = vWarning $ mmSingleton path (pure errMsg)
84 unless predicate warn
84 unless predicate warn
85 STGe n -> do
85 STGe n -> do
86 let
86 let
87 nlen = withKnownNat n $ natVal n
87 nlen = withKnownNat n $ natVal n
88− predicate = nlen <= (fromIntegral $ T.length t)
88+ predicate = nlen >= (fromIntegral $ T.length t)
89− errMsg = "length should be >= " <> T.pack (show nlen)
89+ errMsg = "length of " <> path <> " should be >= " <> T.pack (show nlen)
90 warn = vWarning $ mmSingleton path (pure errMsg)
90 warn = vWarning $ mmSingleton path (pure errMsg)
91 unless predicate warn
91 unless predicate warn
92 STRegex r -> do
92 STRegex r -> do
93 let
93 let
94 regex = withKnownSymbol r $ fromSing r
94 regex = withKnownSymbol r $ fromSing r
95 predicate = matchTest (makeRegex (T.unpack regex) :: Regex) (T.unpack t)
95 predicate = matchTest (makeRegex (T.unpack regex) :: Regex) (T.unpack t)
96− errMsg = "must match " <> regex
96+ errMsg = path <> " must match " <> regex
97 warn = vWarning $ mmSingleton path (pure errMsg)
97 warn = vWarning $ mmSingleton path (pure errMsg)
98 unless predicate warn
98 unless predicate warn
99 STEnum ss -> do
99 STEnum ss -> do
@@ -101,7 +101,7 @@ validateTextConstraint (JSONPath path) t = \case
101 matching :: Sing (s :: [Symbol]) -> Bool
101 matching :: Sing (s :: [Symbol]) -> Bool
102 matching SNil = False
102 matching SNil = False
103 matching (SCons s@SSym fs) = T.pack (symbolVal s) == t || matching fs
103 matching (SCons s@SSym fs) = T.pack (symbolVal s) == t || matching fs
104− errMsg = "must be one of " <> T.pack (show (fromSing ss))
104+ errMsg = path <> " must be one of " <> T.pack (show (fromSing ss))
105 warn = vWarning $ mmSingleton path (pure errMsg)
105 warn = vWarning $ mmSingleton path (pure errMsg)
106 unless (matching ss) warn
106 unless (matching ss) warn
107
107
@@ -115,35 +115,35 @@ validateNumberConstraint (JSONPath path) num = \case
115 let
115 let
116 nlen = withKnownNat n $ natVal n
116 nlen = withKnownNat n $ natVal n
117 predicate = fromIntegral nlen == num
117 predicate = fromIntegral nlen == num
118− errMsg = "should be == " <> T.pack (show nlen)
118+ errMsg = path <> " should be == " <> T.pack (show nlen)
119 warn = vWarning $ mmSingleton path (pure errMsg)
119 warn = vWarning $ mmSingleton path (pure errMsg)
120 unless predicate warn
120 unless predicate warn
121 SNGt n -> do
121 SNGt n -> do
122 let
122 let
123 nlen = withKnownNat n $ natVal n
123 nlen = withKnownNat n $ natVal n
124 predicate = num > fromIntegral nlen
124 predicate = num > fromIntegral nlen
125− errMsg = "should be > " <> T.pack (show nlen)
125+ errMsg = path <> " should be > " <> T.pack (show nlen)
126 warn = vWarning $ mmSingleton path (pure errMsg)
126 warn = vWarning $ mmSingleton path (pure errMsg)
127 unless predicate warn
127 unless predicate warn
128 SNGe n -> do
128 SNGe n -> do
129 let
129 let
130 nlen = withKnownNat n $ natVal n
130 nlen = withKnownNat n $ natVal n
131 predicate = num >= fromIntegral nlen
131 predicate = num >= fromIntegral nlen
132− errMsg = "should be >= " <> T.pack (show nlen)
132+ errMsg = path <> " should be >= " <> T.pack (show nlen)
133 warn = vWarning $ mmSingleton path (pure errMsg)
133 warn = vWarning $ mmSingleton path (pure errMsg)
134 unless predicate warn
134 unless predicate warn
135 SNLt n -> do
135 SNLt n -> do
136 let
136 let
137 nlen = withKnownNat n $ natVal n
137 nlen = withKnownNat n $ natVal n
138 predicate = num < fromIntegral nlen
138 predicate = num < fromIntegral nlen
139− errMsg = "should be < " <> T.pack (show nlen)
139+ errMsg = path <> " should be < " <> T.pack (show nlen)
140 warn = vWarning $ mmSingleton path (pure errMsg)
140 warn = vWarning $ mmSingleton path (pure errMsg)
141 unless predicate warn
141 unless predicate warn
142 SNLe n -> do
142 SNLe n -> do
143 let
143 let
144 nlen = withKnownNat n $ natVal n
144 nlen = withKnownNat n $ natVal n
145 predicate = num <= fromIntegral nlen
145 predicate = num <= fromIntegral nlen
146− errMsg = "should be <= " <> T.pack (show nlen)
146+ errMsg = path <> " should be <= " <> T.pack (show nlen)
147 warn = vWarning $ mmSingleton path (pure errMsg)
147 warn = vWarning $ mmSingleton path (pure errMsg)
148 unless predicate warn
148 unless predicate warn
149
149
@@ -157,35 +157,7 @@ validateArrayConstraint (JSONPath path) v = \case
157 let
157 let
158 nlen = withKnownNat n $ natVal n
158 nlen = withKnownNat n $ natVal n
159 predicate = nlen == fromIntegral (V.length v)
159 predicate = nlen == fromIntegral (V.length v)
160− errMsg = "length should be == " <> T.pack (show nlen)
160+ errMsg = "length of " <> path <> " should be == " <> T.pack (show nlen)
161− warn = vWarning $ mmSingleton path (pure errMsg)
162− unless predicate warn
163− SAGt n -> do
164− let
165− nlen = withKnownNat n $ natVal n
166− predicate = fromIntegral (V.length v) > nlen
167− errMsg = "length should be > " <> T.pack (show nlen)
168− warn = vWarning $ mmSingleton path (pure errMsg)
169− unless predicate warn
170− SAGe n -> do
171− let
172− nlen = withKnownNat n $ natVal n
173− predicate = fromIntegral (V.length v) >= nlen
174− errMsg = "length should be >= " <> T.pack (show nlen)
175− warn = vWarning $ mmSingleton path (pure errMsg)
176− unless predicate warn
177− SALt n -> do
178− let
179− nlen = withKnownNat n $ natVal n
180− predicate = fromIntegral (V.length v) < nlen
181− errMsg = "length should be < " <> T.pack (show nlen)
182− warn = vWarning $ mmSingleton path (pure errMsg)
183− unless predicate warn
184− SALe n -> do
185− let
186− nlen = withKnownNat n $ natVal n
187− predicate = fromIntegral (V.length v) <= nlen
188− errMsg = "length should be <= " <> T.pack (show nlen)
189 warn = vWarning $ mmSingleton path (pure errMsg)
161 warn = vWarning $ mmSingleton path (pure errMsg)
190 unless predicate warn
162 unless predicate warn
191
163
src/Data/Schematic/Verifier/Array.hs+9−1
@@ -1,7 +1,15 @@
1module Data.Schematic.Verifier.Array where
1module Data.Schematic.Verifier.Array where
2
2
3+import Data.List
4+import Data.Maybe
3−import {-# SOURCE #-} Data.Schematic.Schema
5+import Data.Schematic
4import Data.Schematic.Verifier.Common
6import Data.Schematic.Verifier.Common
7+import Data.Singletons
8+import Data.Singletons.Prelude
9+import Data.Singletons.TypeLits
10+import Data.Text (Text)
11+import Data.Text.Array (Array)
12+import GHC.Generics
5
13
6data VerifiedArrayConstraint =
14data VerifiedArrayConstraint =
7 VAEq Integer
15 VAEq Integer
src/Data/Schematic/Verifier/Common.hs+3−3
@@ -17,9 +17,9 @@ simplifyDNGs = simplifyNumberConstraint maximum
17verifyDNEq :: [Integer] -> Maybe (Maybe Integer)
17verifyDNEq :: [Integer] -> Maybe (Maybe Integer)
18verifyDNEq x =
18verifyDNEq x =
19 case nub x of
19 case nub x of
20− [] -> Just Nothing
20+ [] -> Just Nothing
21− [y] -> Just $ Just y
21+ [x] -> Just $ Just x
22− (_:_:_) -> Nothing
22+ (x:y:_) -> Nothing
23
23
24verify3 :: Maybe Integer -> Maybe Integer -> Maybe Integer -> Maybe ()
24verify3 :: Maybe Integer -> Maybe Integer -> Maybe Integer -> Maybe ()
25verify3 (Just x) (Just y) (Just z) =
25verify3 (Just x) (Just y) (Just z) =
src/Data/Schematic/Verifier/Number.hs+18−9
@@ -1,28 +1,37 @@
1module Data.Schematic.Verifier.Number where
1module Data.Schematic.Verifier.Number where
2
2
3+import Data.List
4+import Data.Maybe
5+import Data.Schematic
3−import {-# SOURCE #-} Data.Schematic.Schema
6+import Data.Schematic.Schema
4import Data.Schematic.Verifier.Common
7import Data.Schematic.Verifier.Common
8+import Data.Singletons
9+import Data.Singletons.Prelude
10+import Data.Singletons.TypeLits
11+import Data.Text (Text)
12+import Data.Text.Array (Array)
13+import GHC.Generics
5
14
6toStrictNumber :: [DemotedNumberConstraint] -> [DemotedNumberConstraint]
15toStrictNumber :: [DemotedNumberConstraint] -> [DemotedNumberConstraint]
7toStrictNumber = map f
16toStrictNumber = map f
8 where
17 where
9 f (DNLe x) = DNLt (x + 1)
18 f (DNLe x) = DNLt (x + 1)
10 f (DNGe x) = DNGt (x - 1)
19 f (DNGe x) = DNGt (x - 1)
11− f x = x
20+ f x = x
12
21
13data VerifiedNumberConstraint
22data VerifiedNumberConstraint
14 = VNEq Integer
23 = VNEq Integer
15− | VNBounds (Maybe Integer) (Maybe Integer)
24+ | VNBounds (Maybe Integer)
25+ (Maybe Integer)
16 deriving (Show)
26 deriving (Show)
17
27
18−verifyNumberConstraints
28+verifyNumberConstraints ::
19− :: [DemotedNumberConstraint]
29+ [DemotedNumberConstraint]
20 -> Maybe VerifiedNumberConstraint
30 -> Maybe VerifiedNumberConstraint
21verifyNumberConstraints cs' = do
31verifyNumberConstraints cs' = do
22− let
23− cs = toStrictNumber cs'
32+ let cs = toStrictNumber cs'
24− mlt = simplifyDNLs [x | DNLt x <- cs]
33+ mlt = simplifyDNLs [x | DNLt x <- cs]
25− mgt = simplifyDNGs [x | DNGt x <- cs]
34+ mgt = simplifyDNGs [x | DNGt x <- cs]
26 meq <- verifyDNEq [x | DNEq x <- cs]
35 meq <- verifyDNEq [x | DNEq x <- cs]
27 verifyEquations mgt meq mlt
36 verifyEquations mgt meq mlt
28 Just $
37 Just $
src/Data/Schematic/Verifier/Text.hs+67−61
@@ -1,10 +1,19 @@
1module Data.Schematic.Verifier.Text where
1module Data.Schematic.Verifier.Text where
2
2
3import Control.Monad
3import Control.Monad
4+import Data.List
4import Data.Maybe
5import Data.Maybe
6+import Data.Schematic
5−import {-# SOURCE #-} Data.Schematic.Schema
7+import Data.Schematic.Schema
6import Data.Schematic.Verifier.Common
8import Data.Schematic.Verifier.Common
7−import Data.Text (Text, unpack)
9+import Data.Singletons
10+import Data.Singletons.Prelude
11+import Data.Singletons.TypeLits
12+import Data.Text (unpack)
13+import Data.Text (Text)
14+import Data.Text.Array (Array)
15+import GHC.Generics
16+import Text.Regex.TDFA
8import Text.Regex.TDFA.Pattern
17import Text.Regex.TDFA.Pattern
9import Text.Regex.TDFA.ReadRegex (parseRegex)
18import Text.Regex.TDFA.ReadRegex (parseRegex)
10
19
@@ -13,28 +22,29 @@ toStrictTextLength = map f
13 where
22 where
14 f (DTLe x) = DTLt (x + 1)
23 f (DTLe x) = DTLt (x + 1)
15 f (DTGe x) = DTGt (x - 1)
24 f (DTGe x) = DTGt (x - 1)
16− f x = x
25+ f x = x
17
26
18data VerifiedTextConstraint
27data VerifiedTextConstraint
19 = VTEq Integer
28 = VTEq Integer
20− | VTBounds (Maybe Integer) (Maybe Integer)
29+ | VTBounds (Maybe Integer)
30+ (Maybe Integer)
31+ | VTRegex Text
32+ Integer
21− | VTRegex Text Integer (Maybe Integer)
33+ (Maybe Integer)
22 | VTEnum [Text]
34 | VTEnum [Text]
23 deriving (Show)
35 deriving (Show)
24
36
25−verifyTextLengthConstraints
37+verifyTextLengthConstraints ::
26− :: [DemotedTextConstraint]
27− -> Maybe (Maybe VerifiedTextConstraint)
38+ [DemotedTextConstraint] -> Maybe (Maybe VerifiedTextConstraint)
28verifyTextLengthConstraints cs' = do
39verifyTextLengthConstraints cs' = do
29− let
30− cs = toStrictTextLength cs'
40+ let cs = toStrictTextLength cs'
31− mlt = simplifyDNLs [x | DTLt x <- cs]
41+ mlt = simplifyDNLs [x | DTLt x <- cs]
32− mgt = simplifyDNGs [x | DTGt x <- cs]
42+ mgt = simplifyDNGs [x | DTGt x <- cs]
33 meq <- verifyDNEq [x | DTEq x <- cs]
43 meq <- verifyDNEq [x | DTEq x <- cs]
34 verifyEquations mgt meq mlt
44 verifyEquations mgt meq mlt
35 case all isNothing ([mgt, meq, mlt] :: [Maybe Integer]) of
45 case all isNothing ([mgt, meq, mlt] :: [Maybe Integer]) of
36 True -> Just Nothing
46 True -> Just Nothing
37− _ ->
47+ _ ->
38 Just $
48 Just $
39 Just $
49 Just $
40 case meq of
50 case meq of
@@ -45,77 +55,73 @@ regexLength :: Text -> Maybe (Int, Maybe Int)
45regexLength regexp =
55regexLength regexp =
46 case parseRegex . unpack $ regexp of
56 case parseRegex . unpack $ regexp of
47 Right (p, _) -> Just (minRegexLength p, maxRegexLength p)
57 Right (p, _) -> Just (minRegexLength p, maxRegexLength p)
48− Left _ -> Nothing
58+ Left _ -> Nothing
49
59
50minRegexLength :: Pattern -> Int
60minRegexLength :: Pattern -> Int
51minRegexLength p =
61minRegexLength p =
52 case p of
62 case p of
53− PEmpty -> 0
63+ PEmpty -> 0
54− PChar {..} -> 1
64+ PChar {..} -> 1
55− PAny {..} -> 1
65+ PAny {getPatternSet = PatternSet (Just cset) _ _ _} -> 1
56− PAnyNot {..} -> 1
66+ PAnyNot {getPatternSet = PatternSet (Just cset) _ _ _} -> 1
57− PQuest _ -> 0
67+ PQuest p -> 0
58− PPlus sch -> minRegexLength $ PBound 1 Nothing sch
68+ PPlus p -> minRegexLength $ PBound 1 Nothing p
59− PStar _ sch -> minRegexLength $ PBound 0 Nothing sch
69+ PStar _ p -> minRegexLength $ PBound 0 Nothing p
60− PBound low _ sch -> low * minRegexLength sch
70+ PBound low mhigh p -> low * minRegexLength p
61− PConcat ps -> sum $ fmap minRegexLength ps
71+ PConcat ps -> sum $ fmap minRegexLength ps
62− POr xs -> minimum $ fmap minRegexLength xs
72+ POr xs -> minimum $ fmap minRegexLength xs
63− PDot _ -> 1
73+ PDot _ -> 1
64− PEscape {..} -> 1
74+ PEscape {..} -> 1
65− PCarat _ -> 0
75+ PCarat _ -> 0
66− PDollar _ -> 0
76+ PDollar _ -> 0
67− _ -> 0
77+ _ -> 0
68
78
69maxRegexLength :: Pattern -> Maybe Int
79maxRegexLength :: Pattern -> Maybe Int
70maxRegexLength p =
80maxRegexLength p =
71 case p of
81 case p of
72− PEmpty -> Just 0
82+ PEmpty -> Just 0
73− PChar _ _ -> Just 1
83+ PChar _ _ -> Just 1
74− PAny _ _ -> Just 1
84+ PAny _ _ -> Just 1
75− PAnyNot _ _ -> Just 1
85+ PAnyNot _ _ -> Just 1
76− PQuest _ -> Just 0
86+ PQuest _ -> Just 0
77− PPlus _ -> Nothing
87+ PPlus _ -> Nothing
78− PStar _ _ -> Nothing
88+ PStar _ _ -> Nothing
79− PBound _ mhigh sch -> (*) <$> mhigh <*> maxRegexLength sch
89+ PBound low mhigh p -> (*) <$> mhigh <*> maxRegexLength p
80− PConcat ps -> sum <$> mapM maxRegexLength ps
90+ PConcat ps -> sum <$> mapM maxRegexLength ps
81− POr xs -> maximum <$> mapM maxRegexLength xs
91+ POr xs -> maximum <$> mapM maxRegexLength xs
82− PDot _ -> Just 1
92+ PDot _ -> Just 1
83− PEscape _ _ -> Just 1
93+ PEscape _ _ -> Just 1
84− PCarat _ -> Just 0
94+ PCarat _ -> Just 0
85− PDollar _ -> Just 0
95+ PDollar _ -> Just 0
86− _ -> Just 0
96+ _ -> Just 0
87
97
88−verifyTextRegexConstraint
98+verifyTextRegexConstraint ::
89− :: [DemotedTextConstraint]
90− -> Maybe (Maybe VerifiedTextConstraint)
99+ [DemotedTextConstraint] -> Maybe (Maybe VerifiedTextConstraint)
91verifyTextRegexConstraint cs = do
100verifyTextRegexConstraint cs = do
92 let regexps = [x | DTRegex x <- cs]
101 let regexps = [x | DTRegex x <- cs]
93 case regexps of
102 case regexps of
94− [] -> Just Nothing
103+ [] -> Just Nothing
95 [x] -> do
104 [x] -> do
96 (l, mh) <- regexLength x
105 (l, mh) <- regexLength x
97 Just $ Just $ VTRegex x (fromIntegral l) (fromIntegral <$> mh)
106 Just $ Just $ VTRegex x (fromIntegral l) (fromIntegral <$> mh)
98− _ -> Nothing
107+ _ -> Nothing
99
108
100−verifyTextEnumConstraint
109+verifyTextEnumConstraint ::
101− :: [DemotedTextConstraint]
102− -> Maybe (Maybe VerifiedTextConstraint)
110+ [DemotedTextConstraint] -> Maybe (Maybe VerifiedTextConstraint)
103verifyTextEnumConstraint cs = do
111verifyTextEnumConstraint cs = do
104 let enums = concat [x | DTEnum x <- cs]
112 let enums = concat [x | DTEnum x <- cs]
105 case enums of
113 case enums of
106 [] -> Just Nothing
114 [] -> Just Nothing
107− x -> Just $ Just $ VTEnum x
115+ x -> Just $ Just $ VTEnum x
108
116
109−verifyTextConstraints
117+verifyTextConstraints ::
110− :: [DemotedTextConstraint]
111− -> Maybe [VerifiedTextConstraint]
118+ [DemotedTextConstraint] -> Maybe [VerifiedTextConstraint]
112verifyTextConstraints cs = do
119verifyTextConstraints cs = do
113 regexp <- verifyTextRegexConstraint cs
120 regexp <- verifyTextRegexConstraint cs
114− void $
115− case regexp of
121+ void $ case regexp of
116− Just (VTRegex _ l mh) ->
122+ Just (VTRegex _ l mh) ->
117− verifyTextLengthConstraints (DTGe l : cs ++ maybeToList (DTLe <$> mh))
123+ verifyTextLengthConstraints (DTGe l : cs ++ maybeToList (DTLe <$> mh))
118− _ -> pure Nothing
124+ _ -> pure Nothing
119 lengths <- verifyTextLengthConstraints cs
125 lengths <- verifyTextLengthConstraints cs
120 enums <- verifyTextEnumConstraint cs
126 enums <- verifyTextEnumConstraint cs
121 return $ catMaybes [lengths, enums, regexp]
127 return $ catMaybes [lengths, enums, regexp]
stack-13.7.yamldeleted−5
@@ -1,5 +0,0 @@
1−resolver: lts-13.7
2−extra-deps:
3− - hjsonpointer-1.4.0@rev:0
4− - hjsonschema-1.9.0@rev:0
5− - validationt-0.2.1.0
test/JsonSchemaSpec.hs−58
@@ -10,7 +10,6 @@ module JsonSchemaSpec (spec, main) where
10import Data.Aeson as J
10import Data.Aeson as J
11import Data.Maybe
11import Data.Maybe
12import Data.Proxy
12import Data.Proxy
13−import Data.ByteString.Lazy as B
14import Data.Schematic
13import Data.Schematic
15import Data.Vinyl
14import Data.Vinyl
16import JSONSchema.Draft4 as D4
15import JSONSchema.Draft4 as D4
@@ -32,27 +31,6 @@ exampleData = withRepr @SchemaExample $
32 :& field @"bar" (pure (ReprText "foo"))
31 :& field @"bar" (pure (ReprText "foo"))
33 :& RNil
32 :& RNil
34
33
35−type SchemaArrayExample = 'SchemaObject
36− '[ '("a1", 'SchemaArray '[ 'AGt 1 ] ('SchemaNumber '[]))
37− , '("a2", 'SchemaArray '[ 'AGe 1 ] ('SchemaNumber '[]))
38− , '("a3", 'SchemaArray '[ 'ALt 1 ] ('SchemaNumber '[]))
39− , '("a4", 'SchemaArray '[ 'ALe 1 ] ('SchemaNumber '[]))
40− ]
41−
42−type SchemaNumberExample = 'SchemaObject
43− '[ '("n1", 'SchemaNumber '[ 'NGt 1 ])
44− , '("n2", 'SchemaNumber '[ 'NGe 1 ])
45− , '("n3", 'SchemaNumber '[ 'NLt 1 ])
46− , '("n4", 'SchemaNumber '[ 'NLe 1 ])
47− ]
48−
49−type SchemaTextExample = 'SchemaObject
50− '[ '("t1", 'SchemaText '[ 'TGt 1 ])
51− , '("t2", 'SchemaText '[ 'TGe 1 ])
52− , '("t3", 'SchemaText '[ 'TLt 1 ])
53− , '("t4", 'SchemaText '[ 'TLe 1 ])
54− ]
55−
56spec :: Spec
34spec :: Spec
57spec = do
35spec = do
58 it "validates simple schema" $ do
36 it "validates simple schema" $ do
@@ -60,42 +38,6 @@ spec = do
60 fetchHTTPAndValidate schema (toJSON exampleData) >>= \case
38 fetchHTTPAndValidate schema (toJSON exampleData) >>= \case
61 Left _ -> fail "failed to validate test example"
39 Left _ -> fail "failed to validate test example"
62 Right _ -> pure ()
40 Right _ -> pure ()
63− it "validates schema with arrays" $ do
64− let
65− schema = D4.SchemaWithURI (fromJust $ toJsonSchema (Proxy @SchemaArrayExample)) Nothing
66− obj = withRepr @SchemaArrayExample $
67− field @"a1" [ReprNumber 13, ReprNumber 13]
68− :& field @"a2" [ReprNumber 13]
69− :& field @"a3" []
70− :& field @"a4" [ReprNumber 13]
71− :& RNil
72− fetchHTTPAndValidate schema (toJSON obj) >>= \case
73− Left e -> fail "failed to validate test example"
74− Right _ -> pure ()
75− it "validates schema with numbers" $ do
76− let
77− schema = D4.SchemaWithURI (fromJust $ toJsonSchema (Proxy @SchemaNumberExample)) Nothing
78− obj = withRepr @SchemaNumberExample $
79− field @"n1" 1.1
80− :& field @"n2" 1
81− :& field @"n3" 0.9
82− :& field @"n4" 1.0
83− :& RNil
84− fetchHTTPAndValidate schema (toJSON obj) >>= \case
85− Left e -> fail "failed to validate test example"
86− Right _ -> pure ()
87− it "validates schema with strings" $ do
88− let
89− schema = D4.SchemaWithURI (fromJust $ toJsonSchema (Proxy @SchemaTextExample)) Nothing
90− obj = withRepr @SchemaTextExample $
91− field @"t1" "11"
92− :& field @"t2" "1"
93− :& field @"t3" ""
94− :& field @"t4" "1"
95− :& RNil
96− fetchHTTPAndValidate schema (toJSON obj) >>= \case
97− Left e -> fail "failed to validate test example"
98− Right _ -> pure ()
99
41
100main :: IO ()
42main :: IO ()
101main = hspec spec
43main = hspec spec
test/SchemaSpec.hs+3−13
@@ -33,10 +33,6 @@ type SchemaExample = 'SchemaObject
33 '[ '("foo", 'SchemaArray '[ 'AEq 1] ('SchemaNumber '[ 'NGt 10]))
33 '[ '("foo", 'SchemaArray '[ 'AEq 1] ('SchemaNumber '[ 'NGt 10]))
34 , '("bar", 'SchemaOptional ('SchemaText '[ 'TEnum '["foo", "bar"]]))]
34 , '("bar", 'SchemaOptional ('SchemaText '[ 'TEnum '["foo", "bar"]]))]
35
35
36−type SchemaExample2 = 'SchemaObject
37− '[ '("foo", 'SchemaArray '[ 'AEq 2] ('SchemaText '[ 'TGt 10]))
38− , '("bar", 'SchemaOptional ('SchemaText '[ 'TRegex "[0-9]+"]))]
39−
40jsonExample :: JsonRepr SchemaExample
36jsonExample :: JsonRepr SchemaExample
41jsonExample = withRepr @SchemaExample
37jsonExample = withRepr @SchemaExample
42 $ field @"bar" (Just "bar")
38 $ field @"bar" (Just "bar")
@@ -80,11 +76,8 @@ schemaJson = "{\"foo\": [13], \"bar\": null}"
80schemaJson2 :: ByteString
76schemaJson2 :: ByteString
81schemaJson2 = "{\"foo\": [3], \"bar\": null}"
77schemaJson2 = "{\"foo\": [3], \"bar\": null}"
82
78
83−schemaJsonSeries :: Monad m => SC.Series m (JsonRepr SchemaExample)
79+schemaJsonSeries :: Monad m => SC.Series m Value
84−schemaJsonSeries = series
80+schemaJsonSeries = valueSeries $ fromSing (sing :: Sing SchemaExample)
85−
86−schemaJsonSeries2 :: Monad m => SC.Series m (JsonRepr SchemaExample2)
87−schemaJsonSeries2 = series
88
81
89spec :: Spec
82spec :: Spec
90spec = do
83spec = do
@@ -112,10 +105,7 @@ spec = do
112 `shouldSatisfy` isValid
105 `shouldSatisfy` isValid
113 it "validates json series" $ property $
106 it "validates json series" $ property $
114 SC.over schemaJsonSeries $ \x ->
107 SC.over schemaJsonSeries $ \x ->
115− isValid (parseAndValidateJson @SchemaExample (toJSON x))
108+ isValid (parseAndValidateJson @SchemaExample x)
116− it "validates json series 2" $ property $
117− SC.over schemaJsonSeries2 $ \x ->
118− isValid (parseAndValidateJson @SchemaExample2 (toJSON x))
119
109
120
110
121main :: IO ()
111main :: IO ()