Remove trailing whitespace

examples/ChaChaPolyCryptolIETF.md

@@ -2198,5 +2198,3 @@ True
 ```
 This check verifies the implementation of `ChaCha`, `Poly1305` and the `AEAD`
 construction all work with the provided test vectors.
-
-

examples/DES.cry

@@ -169,4 +169,3 @@ sbox8 = [[13, 2, 8, 4, 6, 15, 11, 1, 10, 9, 3, 14, 5, 0, 12, 7],
          [7, 11, 4, 1, 9, 12, 14, 2, 0, 6, 10, 13, 15, 3, 5, 8],
          [2, 1, 14, 7, 4, 10, 8, 13, 15, 12, 9, 0, 3, 5, 6, 11]
         ]
-

examples/MiniLock/prim/Blake2s.cry

@@ -685,4 +685,3 @@ kats = [ 0x69217a3079908094e11121d042354a7c1f55b6482ca1a51e1b250dfd1ed0eef9
        , 0xc08aa1c286d709fdc7473744977188c895ba011014247e4efa8d07e78fec695c
        , 0xf03f5789d3336b80d002d59fdf918bdb775b00956ed5528e86aa994acb38fe2d
        ]
-

examples/contrib/bivium.cry

@@ -51,4 +51,3 @@ suffix = 0b000000001000000000000000000001
 property Bivium_correct = (Bivium(iv1, iv2)) == test_keystream
 property Bivium_search (x, y) = (Bivium(x, y)) == test_keystream
 property Bivium_search_with_suffix (x, y) = (Bivium(x, y#suffix)) == test_keystream
-

examples/contrib/trivium.cry

@@ -54,4 +54,3 @@ test_keystream = 0b0111111101111011111101000011100000000000001000100000000000000
 
 property Trivium_correct = (Trivium(iv1, iv2, iv3)) == test_keystream
 property Trivium_search (x, y, z) = (Trivium(x, y, z)) == test_keystream
-

examples/funstuff/NQueens.cry

@@ -54,4 +54,3 @@ inRange : {n} (fin n, n >= 1) => Board n -> Position n -> Bit
 inRange qs x = x <= `(n - 1)
 
 property nQueensProve x = (nQueens x) == False
-

examples/funstuff/marble.cry

@@ -105,4 +105,3 @@ validMoveSequence moves = all [validMove a b | a <- moves | b <- drop`{1} moves]
 
 solutionInNmoves : {n} (fin n) => [n] Board -> Bit
 property solutionInNmoves ms = validMoveSequence ([start] # ms # [second])
-

examples/maliciousSHA/malicious_SHA1.cry

@@ -172,4 +172,3 @@ malicious_block ([H0, H1, H2, H3, H4], M) k =
            | W <- Ws | K <- (Ks k)
            | t <- [0..79]
            ]
-   

src/Cryptol/ModuleSystem/Monad.hs

@@ -444,5 +444,3 @@ getSolverConfig :: ModuleM T.SolverConfig
 getSolverConfig  = ModuleT $ do
   me <- get
   return (meSolverConfig me)
-
-

src/Cryptol/Parser/Lexer.x

@@ -246,6 +246,3 @@ primLexer cfg cs = run inp Normal
 
 -- vim: ft=haskell
 }
-
-
-

src/Cryptol/REPL/Monad.hs

@@ -730,6 +730,3 @@ z3exists = do
   case mPath of
     Nothing -> return (Just Z3NotFound)
     Just _  -> return Nothing
-
-
-

src/Cryptol/TypeCheck/InferTypes.hs

@@ -564,4 +564,3 @@ instance PP Solved where
         where suDoc = maybe empty pp mb
       Unsolved      -> text "unsolved"
       Unsolvable    -> text "unsolvable"
-

src/Cryptol/TypeCheck/Sanity.hs

@@ -533,5 +533,3 @@ lookupVar x =
      case Map.lookup x (roVars ro) of
        Just s -> return s
        Nothing -> reportError $ UndefinedVariable x
-
-

src/Cryptol/TypeCheck/Solver/Numeric/Fin.hs

@@ -89,5 +89,3 @@ cryIsFinType varInfo g ty =
 
   where
   solved ps = Solved Nothing [ g { goal = p } | p <- ps ]
-
-

src/Cryptol/TypeCheck/Solver/Numeric/ImportExport.hs

@@ -168,4 +168,3 @@ importType = go
        t2 <- go y
        t3 <- go z
        return (app f [t1,t2,t3])
-

src/Cryptol/TypeCheck/Solver/Numeric/Interval.hs

@@ -337,8 +337,3 @@ iLenFromThenTo i j k
   | Just x <- iIsExact i, Just y <- iIsExact j, Just z <- iIsExact k
   , Just r <- nLenFromThenTo x y z = iConst r
   | otherwise = iAnyFin
-
-
-
-
-

src/Cryptol/TypeCheck/Solver/Numeric/NonLin.hs

@@ -279,7 +279,3 @@ finishTodos =
            p'  <- nonLinPropM p
            ps' <- finishTodos
            return (p' : ps')
-
-
-
-

src/Cryptol/TypeCheck/Solver/Numeric/SMT.hs

@@ -515,5 +515,3 @@ linRel (x1,y1) (x2,y2) =
      let b = y1 - a * x1
      guard $ not $ a < 0 && b < 0   -- No way this will give a natural number.
      return (a,b)
-
-

src/Cryptol/TypeCheck/Solver/Numeric/Simplify.hs

@@ -841,6 +841,3 @@ cryNatOp op x y =
       Impossible -> PFalse -- It doesn't matter, but @false@ might anihilate.
       Return p   -> p
       If p t e   -> p :&& toProp t :|| Not p :&& toProp e
-
-
-

src/Cryptol/TypeCheck/Solver/Numeric/Simplify1.hs

@@ -509,5 +509,3 @@ eNoInf expr =
          (_, K Inf, _) -> Impossible
          (_, _, K Inf) -> Impossible
          _             -> return (f x' y' z')
-
-

src/Cryptol/TypeCheck/Solver/Numeric/SimplifyExpr.hs

@@ -211,6 +211,3 @@ crySimpExprStep1 expr =
       case (x,y,z) of
         (K a, K b, K c)   -> K `fmap` IN.nLenFromThenTo a b c
         _                 -> Nothing
-
-
-

tests/issues/issue225.cry

@@ -20,4 +20,3 @@ joinRotors (rotors, inputChar) = (rotors', outputChar)
                  ]
     rotors' = tail [ r | (_, _, r) <- ncrs ]
     (_, outputChar, _) = ncrs ! 0
-

tests/regression/AES.cry

@@ -213,5 +213,3 @@ sbox = [
    0xe1, 0xf8, 0x98, 0x11, 0x69, 0xd9, 0x8e, 0x94, 0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf,
    0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68, 0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16
    ]
-
-