module Network.QPACK.Token (
    quicIx,
) where

import Data.Array
import Data.Array.Base (unsafeAt)

hpack2QpackList :: [Int]
hpack2QpackList :: [Int]
hpack2QpackList =
    [ Int
0
    , Int
15
    , Int
1
    , Int
16
    , Int
17
    , -Int
1
    , Int
19
    , Int
31
    , Int
20
    , Int
18
    , Int
22
    , Int
2
    , -Int
1
    , Int
38
    , Int
23
    , Int
3
    , Int
24
    , -Int
1
    , Int
4
    , -Int
1
    , -Int
1
    , Int
25
    , Int
5
    , Int
6
    , Int
7
    , -Int
1
    , -Int
1
    , -Int
1
    , -Int
1
    , -Int
1
    , Int
8
    , Int
9
    , Int
43
    , -Int
1
    , Int
10
    , Int
11
    , Int
12
    , -Int
1
    , -Int
1
    , -Int
1
    , Int
26
    , Int
13
    , -Int
1
    , -Int
1
    , Int
46
    , Int
14
    , Int
27
    , -Int
1
    , Int
49
    , Int
28
    , -Int
1
    , -Int
1
    , -Int
1
    , -Int
1
    , Int
32
    , Int
21
    , Int
33
    , Int
34
    , Int
35
    , Int
36
    , Int
37
    , Int
39
    , Int
40
    , Int
41
    , Int
42
    , Int
44
    , Int
45
    , Int
47
    , Int
48
    , Int
29
    , Int
50
    , Int
51
    , Int
30
    , -Int
1
    ]

hpack2QpackTable :: Array Int Int
hpack2QpackTable :: Array Int Int
hpack2QpackTable = (Int, Int) -> [Int] -> Array Int Int
forall i e. Ix i => (i, i) -> [e] -> Array i e
listArray (Int
0, [Int] -> Int
forall a. [a] -> Int
forall (t :: * -> *) a. Foldable t => t a -> Int
length [Int]
hpack2QpackList Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
1) [Int]
hpack2QpackList

quicIx :: Int -> Int
quicIx :: Int -> Int
quicIx Int
ix = Array Int Int
hpack2QpackTable Array Int Int -> Int -> Int
forall i. Ix i => Array i Int -> Int -> Int
forall (a :: * -> * -> *) e i.
(IArray a e, Ix i) =>
a i e -> Int -> e
`unsafeAt` Int
ix