git.iko.soy/rowtype-yoga/purescript-arraybuffer-builder
on master help sign in
purs-tidy
60ad0c1James Brock
src/Data/ArrayBuffer/Builder.purs+24−25
@@ -10,31 +10,30 @@
10-- | [`Data.ArrayBuffer.ArrayBuffer`](https://pursuit.purescript.org/packages/purescript-arraybuffer/docs/Data.ArrayBuffer.ArrayBuffer)
10-- | [`Data.ArrayBuffer.ArrayBuffer`](https://pursuit.purescript.org/packages/purescript-arraybuffer/docs/Data.ArrayBuffer.ArrayBuffer)
11-- | in package __purescript-arraybuffer__.
11-- | in package __purescript-arraybuffer__.
12module Data.ArrayBuffer.Builder
12module Data.ArrayBuffer.Builder
13−( PutM
13+ ( PutM
14−, Put
14+ , Put
15−, execPutM
15+ , execPutM
16−, execPut
16+ , execPut
17−, subBuilder
17+ , subBuilder
18−, putArrayBuffer
18+ , putArrayBuffer
19−, putDataView
19+ , putDataView
20−, putDataBuff
20+ , putDataBuff
21−, putUint8
21+ , putUint8
22−, putInt8
22+ , putInt8
23−, putUint16be
23+ , putUint16be
24−, putUint16le
24+ , putUint16le
25−, putInt16be
25+ , putInt16be
26−, putInt16le
26+ , putInt16le
27−, putUint32be
27+ , putUint32be
28−, putUint32le
28+ , putUint32le
29−, putInt32be
29+ , putInt32be
30−, putInt32le
30+ , putInt32le
31−, putFloat32be
31+ , putFloat32be
32−, putFloat32le
32+ , putFloat32le
33−, putFloat64be
33+ , putFloat64be
34−, putFloat64le
34+ , putFloat64le
35−, module Data.ArrayBuffer.Builder.Internal
35+ , module Data.ArrayBuffer.Builder.Internal
36−)
37−where
36+ ) where
38
37
39import Prelude
38import Prelude
40
39
src/Data/ArrayBuffer/Internal.purs+46−44
@@ -79,33 +79,32 @@
79-- | so that if we want to change the `Builder` implementation later then we can.
79-- | so that if we want to change the `Builder` implementation later then we can.
80-- |
80-- |
81module Data.ArrayBuffer.Builder.Internal
81module Data.ArrayBuffer.Builder.Internal
82−( Builder(..)
82+ ( Builder(..)
83−, (<>>)
83+ , (<>>)
84−, DataBuff(..)
84+ , DataBuff(..)
85−, toView
85+ , toView
86−, execBuilder
86+ , execBuilder
87−, length
87+ , length
88−, foldl
88+ , foldl
89−, foldM
89+ , foldM
90−, singleton
90+ , singleton
91−, cons
91+ , cons
92−, snoc
92+ , snoc
93−, encodeUint8
93+ , encodeUint8
94−, encodeInt8
94+ , encodeInt8
95−, encodeUint16be
95+ , encodeUint16be
96−, encodeUint16le
96+ , encodeUint16le
97−, encodeInt16be
97+ , encodeInt16be
98−, encodeInt16le
98+ , encodeInt16le
99−, encodeUint32be
99+ , encodeUint32be
100−, encodeUint32le
100+ , encodeUint32le
101−, encodeInt32be
101+ , encodeInt32be
102−, encodeInt32le
102+ , encodeInt32le
103−, encodeFloat32be
103+ , encodeFloat32be
104−, encodeFloat32le
104+ , encodeFloat32le
105−, encodeFloat64be
105+ , encodeFloat64be
106−, encodeFloat64le
106+ , encodeFloat64le
107−)
108−where
107+ ) where
109
108
110import Prelude
109import Prelude
111
110
@@ -131,7 +130,7 @@ data DataBuff
131-- Concerning DataViews.
130-- Concerning DataViews.
132-- https://v8.dev/blog/dataview
131-- https://v8.dev/blog/dataview
133
132
134− -- | View the contents of `DataBuff` as a `DataView`.
133+-- | View the contents of `DataBuff` as a `DataView`.
135toView :: DataBuff -> DataView
134toView :: DataBuff -> DataView
136toView (Buff ab) = DV.whole ab
135toView (Buff ab) = DV.whole ab
137toView (View dv) = dv
136toView (View dv) = dv
@@ -191,11 +190,12 @@ instance semigroupBuilder :: Semigroup Builder where
191 append Null r = r
190 append Null r = r
192 append l (Node Null rx rr) = Node l rx rr -- this is the snoc case
191 append l (Node Null rx rr) = Node l rx rr -- this is the snoc case
193 append (Node ll lx Null) r = Node ll lx r -- found the rightmost Null
192 append (Node ll lx Null) r = Node ll lx r -- found the rightmost Null
194− -- of the left tree
193+ -- of the left tree
195 append (Node ll lx lr) r = Node ll lx $ append lr r -- search down the right
194 append (Node ll lx lr) r = Node ll lx $ append lr r -- search down the right
195+
196− -- side of the left tree
196+-- side of the left tree
197− -- to find the rightmost
197+-- to find the rightmost
198− -- Null
198+-- Null
199
199
200infixl 5 append as <>>
200infixl 5 append as <>>
201
201
@@ -211,18 +211,18 @@ foldM :: forall m a. MonadRec m => (a -> DataBuff -> m a) -> a -> Builder -> m a
211-- The Art of Computer Programming 2.3.1
211-- The Art of Computer Programming 2.3.1
212-- Inorder traversal using a stack
212-- Inorder traversal using a stack
213-- https://yuyuan.org/MorrisAlgorithm/
213-- https://yuyuan.org/MorrisAlgorithm/
214−foldM f a0 b = tailRecM outer {p: b, stack: Nil, accum: a0}
214+foldM f a0 b = tailRecM outer { p: b, stack: Nil, accum: a0 }
215 where
215 where
216− outer {p,stack,accum} = do
216+ outer { p, stack, accum } = do
217− stack' <- tailRecM inner {p_:p,stack_:stack}
217+ stack' <- tailRecM inner { p_: p, stack_: stack }
218 case uncons stack' of
218 case uncons stack' of
219 Nothing -> pure $ Done accum
219 Nothing -> pure $ Done accum
220− Just {head: Node _ x r, tail} -> do
220+ Just { head: Node _ x r, tail } -> do
221 accum' <- f accum x
221 accum' <- f accum x
222− pure $ Loop {p: r, stack: tail, accum: accum'}
222+ pure $ Loop { p: r, stack: tail, accum: accum' }
223− Just {head:Null} -> pure $ Done accum
223+ Just { head: Null } -> pure $ Done accum
224− inner {p_:Null,stack_} = pure $ Done stack_
224+ inner { p_: Null, stack_ } = pure $ Done stack_
225− inner {p_: n@(Node l _ _), stack_} = pure $ Loop {p_: l, stack_: n:stack_}
225+ inner { p_: n@(Node l _ _), stack_ } = pure $ Loop { p_: l, stack_: n : stack_ }
226
226
227-- | Construct a `Builder` with a single `DataBuff`. *O(1)*
227-- | Construct a `Builder` with a single `DataBuff`. *O(1)*
228singleton :: DataBuff -> Builder
228singleton :: DataBuff -> Builder
@@ -233,8 +233,8 @@ singleton buf = Node Null buf Null
233length :: Builder -> ByteLength
233length :: Builder -> ByteLength
234length bldr = foldl (\b a -> b + len a) 0 bldr
234length bldr = foldl (\b a -> b + len a) 0 bldr
235 where
235 where
236− len (Buff ab) = AB.byteLength ab
236+ len (Buff ab) = AB.byteLength ab
237− len (View dv) = DV.byteLength dv
237+ len (View dv) = DV.byteLength dv
238
238
239-- | Prepend a `DataBuff` to the beginning of the `Builder`. *O(1)*
239-- | Prepend a `DataBuff` to the beginning of the `Builder`. *O(1)*
240cons :: DataBuff -> Builder -> Builder
240cons :: DataBuff -> Builder -> Builder
@@ -259,9 +259,11 @@ execBuilder bldr = do
259 aview <- liftEffect $ toUint8Array a
259 aview <- liftEffect $ toUint8Array a
260 _ <- liftEffect $ AT.setTyped newview (Just offset) aview
260 _ <- liftEffect $ AT.setTyped newview (Just offset) aview
261 pure $ offset + AT.byteLength aview
261 pure $ offset + AT.byteLength aview
262+ )
263+ 0
262− ) 0 bldr
264+ bldr
263 pure buf
265 pure buf
264− where
266+ where
265 toUint8Array :: DataBuff -> Effect Uint8Array
267 toUint8Array :: DataBuff -> Effect Uint8Array
266 toUint8Array (Buff ab) = AT.whole ab
268 toUint8Array (Buff ab) = AT.whole ab
267 toUint8Array (View dv) =
269 toUint8Array (View dv) =
test/Main.purs+18−16
@@ -22,48 +22,48 @@ asBytes x = do
22putTest :: String -> Array Int -> PutM Effect Unit -> Effect Unit
22putTest :: String -> Array Int -> PutM Effect Unit -> Effect Unit
23putTest label expected put = do
23putTest label expected put = do
24 actual <- asBytes =<< execPut put
24 actual <- asBytes =<< execPut put
25− assertEqual' label {actual,expected}
25+ assertEqual' label { actual, expected }
26
26
27buildTest :: String -> Array Int -> Effect Builder -> Effect Unit
27buildTest :: String -> Array Int -> Effect Builder -> Effect Unit
28buildTest label expected bldr = do
28buildTest label expected bldr = do
29 actual <- asBytes =<< execBuilder =<< bldr
29 actual <- asBytes =<< execBuilder =<< bldr
30− assertEqual' label {actual,expected}
30+ assertEqual' label { actual, expected }
31
31
32main :: Effect Unit
32main :: Effect Unit
33main = do
33main = do
34− putTest "Test 0" [6,7,8] do
34+ putTest "Test 0" [ 6, 7, 8 ] do
35 putInt8 6
35 putInt8 6
36 putInt8 7
36 putInt8 7
37 putInt8 8
37 putInt8 8
38
38
39− putTest "Test 1" [255,254] do
39+ putTest "Test 1" [ 255, 254 ] do
40 putInt16be (-2)
40 putInt16be (-2)
41
41
42− putTest "Test 3" [3,0,0,0] do
42+ putTest "Test 3" [ 3, 0, 0, 0 ] do
43 putInt32le 3
43 putInt32le 3
44
44
45− buildTest "Test 4" [1,2,3,4] do
45+ buildTest "Test 4" [ 1, 2, 3, 4 ] do
46 b1 <- Buff <$> encodeInt8 1
46 b1 <- Buff <$> encodeInt8 1
47 b2 <- Buff <$> encodeInt8 2
47 b2 <- Buff <$> encodeInt8 2
48 b3 <- Buff <$> encodeInt8 3
48 b3 <- Buff <$> encodeInt8 3
49 b4 <- Buff <$> encodeInt8 4
49 b4 <- Buff <$> encodeInt8 4
50 pure $ singleton b1 <> singleton b2 <> singleton b3 <> singleton b4
50 pure $ singleton b1 <> singleton b2 <> singleton b3 <> singleton b4
51
51
52− buildTest "Test 5" [1,2,3,4] do
52+ buildTest "Test 5" [ 1, 2, 3, 4 ] do
53 b1 <- Buff <$> encodeInt8 1
53 b1 <- Buff <$> encodeInt8 1
54 b2 <- Buff <$> encodeInt8 2
54 b2 <- Buff <$> encodeInt8 2
55 b3 <- Buff <$> encodeInt8 3
55 b3 <- Buff <$> encodeInt8 3
56 b4 <- Buff <$> encodeInt8 4
56 b4 <- Buff <$> encodeInt8 4
57 pure $ singleton b1 <>> singleton b2 <>> singleton b3 <>> singleton b4
57 pure $ singleton b1 <>> singleton b2 <>> singleton b3 <>> singleton b4
58
58
59− buildTest "Test 6" [1,2,3,4] do
59+ buildTest "Test 6" [ 1, 2, 3, 4 ] do
60 b1 <- Buff <$> encodeInt8 1
60 b1 <- Buff <$> encodeInt8 1
61 b2 <- Buff <$> encodeInt8 2
61 b2 <- Buff <$> encodeInt8 2
62 b3 <- Buff <$> encodeInt8 3
62 b3 <- Buff <$> encodeInt8 3
63 b4 <- Buff <$> encodeInt8 4
63 b4 <- Buff <$> encodeInt8 4
64 pure $ singleton b1 <> (singleton b2 <> singleton b3) <> singleton b4
64 pure $ singleton b1 <> (singleton b2 <> singleton b3) <> singleton b4
65
65
66− buildTest "Test 6" [1,2,3,4,5,6,7,8] do
66+ buildTest "Test 6" [ 1, 2, 3, 4, 5, 6, 7, 8 ] do
67 b1 <- Buff <$> encodeInt8 1
67 b1 <- Buff <$> encodeInt8 1
68 b2 <- Buff <$> encodeInt8 2
68 b2 <- Buff <$> encodeInt8 2
69 b3 <- Buff <$> encodeInt8 3
69 b3 <- Buff <$> encodeInt8 3
@@ -73,9 +73,11 @@ main = do
73 b7 <- Buff <$> encodeInt8 7
73 b7 <- Buff <$> encodeInt8 7
74 b8 <- Buff <$> encodeInt8 8
74 b8 <- Buff <$> encodeInt8 8
75 pure $ singleton b1 <> (singleton b2 <> singleton b3) <> singleton b4
75 pure $ singleton b1 <> (singleton b2 <> singleton b3) <> singleton b4
76+ <> singleton b5
76− <> singleton b5 <> (singleton b6 <> singleton b7) <> singleton b8
77+ <> (singleton b6 <> singleton b7)
78+ <> singleton b8
77
79
78− buildTest "Test 7" [1,2,3,4,5,6,7,8] do
80+ buildTest "Test 7" [ 1, 2, 3, 4, 5, 6, 7, 8 ] do
79 b1 <- Buff <$> encodeInt8 1
81 b1 <- Buff <$> encodeInt8 1
80 b2 <- Buff <$> encodeInt8 2
82 b2 <- Buff <$> encodeInt8 2
81 b3 <- Buff <$> encodeInt8 3
83 b3 <- Buff <$> encodeInt8 3
@@ -85,16 +87,16 @@ main = do
85 b7 <- Buff <$> encodeInt8 7
87 b7 <- Buff <$> encodeInt8 7
86 b8 <- Buff <$> encodeInt8 8
88 b8 <- Buff <$> encodeInt8 8
87 pure $ ((singleton b1 <> singleton b2) <> (singleton b3 <> singleton b4))
89 pure $ ((singleton b1 <> singleton b2) <> (singleton b3 <> singleton b4))
88− <> ((singleton b5 <> singleton b6) <> (singleton b7 <> singleton b8))
90+ <> ((singleton b5 <> singleton b6) <> (singleton b7 <> singleton b8))
89
91
90− buildTest "Test 8" [1,2,3,4] do
92+ buildTest "Test 8" [ 1, 2, 3, 4 ] do
91 b1 <- Buff <$> encodeInt8 1
93 b1 <- Buff <$> encodeInt8 1
92 b2 <- Buff <$> encodeInt8 2
94 b2 <- Buff <$> encodeInt8 2
93 b3 <- Buff <$> encodeInt8 3
95 b3 <- Buff <$> encodeInt8 3
94 b4 <- Buff <$> encodeInt8 4
96 b4 <- Buff <$> encodeInt8 4
95 pure $ (cons b1 (singleton b2)) <> (cons b3 (singleton b4))
97 pure $ (cons b1 (singleton b2)) <> (cons b3 (singleton b4))
96
98
97− putTest "Test 9" [1,2,2,3,4] do
99+ putTest "Test 9" [ 1, 2, 2, 3, 4 ] do
98 x <- subBuilder do
100 x <- subBuilder do
99 putInt8 3
101 putInt8 3
100 putInt8 4
102 putInt8 4
@@ -103,7 +105,7 @@ main = do
103 putInt8 $ length x
105 putInt8 $ length x
104 tell x
106 tell x
105
107
106− buildTest "Test 10" [1,2,3,4,5,6,7,8] do
108+ buildTest "Test 10" [ 1, 2, 3, 4, 5, 6, 7, 8 ] do
107 b1 <- View <$> DV.whole <$> encodeInt8 1
109 b1 <- View <$> DV.whole <$> encodeInt8 1
108 b2 <- View <$> DV.whole <$> encodeInt8 2
110 b2 <- View <$> DV.whole <$> encodeInt8 2
109 b3 <- View <$> DV.whole <$> encodeInt8 3
111 b3 <- View <$> DV.whole <$> encodeInt8 3
@@ -113,7 +115,7 @@ main = do
113 b7 <- View <$> DV.whole <$> encodeInt8 7
115 b7 <- View <$> DV.whole <$> encodeInt8 7
114 b8 <- View <$> DV.whole <$> encodeInt8 8
116 b8 <- View <$> DV.whole <$> encodeInt8 8
115 pure $ ((singleton b1 <> singleton b2) <> (singleton b3 <> singleton b4))
117 pure $ ((singleton b1 <> singleton b2) <> (singleton b3 <> singleton b4))
116− <> ((singleton b5 <> singleton b6) <> (singleton b7 <> singleton b8))
118+ <> ((singleton b5 <> singleton b6) <> (singleton b7 <> singleton b8))
117
119
118 let stackblower = Array.replicate 20000 2
120 let stackblower = Array.replicate 20000 2
119 putTest "Stack test" stackblower do
121 putTest "Stack test" stackblower do