TermSpec.hs

{-# OPTIONS_GHC -fno-warn-orphans #-}
{-# OPTIONS_GHC -fno-warn-type-defaults #-}
{-# LANGUAGE ScopedTypeVariables #-}

module Foreign.Erlang.TermSpec ( spec ) where

import           Data.Binary           (decode, encode)
import           Data.ByteString.Char8 ()
import qualified Data.ByteString.Lazy  as B
import           Data.Word             ()
import           Foreign.Erlang.Term
import           Test.Hspec
import           Test.QuickCheck

spec :: Spec
spec = do
  describe "Pid"
    $ do it "has a Binary instance such that decode is the inverse of encode"
           $ property
           $ \ (p :: Pid) ->
               fromTerm (decode (encode (toTerm p))) `shouldBe` (Just p)
         it "represents all valid Erlang pids"
           $ property
           $ \ x y z ->
               let p = pid "nodename" x y z
               in fromTerm (decode (encode (toTerm p))) `shouldBe` (Just p)
  describe "Integer"
    $ it "has a Binary instance such that decode is the inverse of encode"
    $ property
    $ \ (i :: Integer) ->
        fromTerm (decode (encode (integer i))) `shouldBe` (Just i)
  describe "The largest small_big_ext Integer"
    $ do let i = 2^(8 * 255) - 1
         it "has a Binary instance such that decode is the inverse of encode"
           $ fromTerm (decode (encode (integer i))) `shouldBe` (Just i)
         it "is converted to a valid erlang binary"
           $ B.unpack (encode (integer i)) `shouldBe`
           [110,255,0
           ,255,255,255,255,255,255,255,255,255,255,255,255,255,255
           ,255,255,255,255,255,255,255,255,255,255,255,255,255,255
           ,255,255,255,255,255,255,255,255,255,255,255,255,255,255
           ,255,255,255,255,255,255,255,255,255,255,255,255,255,255
           ,255,255,255,255,255,255,255,255,255,255,255,255,255,255
           ,255,255,255,255,255,255,255,255,255,255,255,255,255,255
           ,255,255,255,255,255,255,255,255,255,255,255,255,255,255
           ,255,255,255,255,255,255,255,255,255,255,255,255,255,255
           ,255,255,255,255,255,255,255,255,255,255,255,255,255,255
           ,255,255,255,255,255,255,255,255,255,255,255,255,255,255
           ,255,255,255,255,255,255,255,255,255,255,255,255,255,255
           ,255,255,255,255,255,255,255,255,255,255,255,255,255,255
           ,255,255,255,255,255,255,255,255,255,255,255,255,255,255
           ,255,255,255,255,255,255,255,255,255,255,255,255,255,255
           ,255,255,255,255,255,255,255,255,255,255,255,255,255,255
           ,255,255,255,255,255,255,255,255,255,255,255,255,255,255
           ,255,255,255,255,255,255,255,255,255,255,255,255,255,255
           ,255,255,255,255,255,255,255,255,255,255,255,255,255,255
           ,255,255,255]
  describe "The smallest large_big_ext Integer"
    $ it "has a Binary instance such that decode is the inverse of encode"
    $ let i = 2^(8 * 255)
       in fromTerm (decode (encode (integer i))) `shouldBe` (Just i)
  describe "Term"
    $ it "has a Binary instance such that decode is the inverse of encode"
    $ property
    $ \ (t :: Term) ->
        decode (encode t) `shouldBe` t