-module Main
+module Main (main)
where
import Control.Monad (when)
import Data.List ((\\), intercalate)
+import qualified Data.List as List (sort)
import Data.Maybe (catMaybes, isNothing)
-import Data.String.Utils (splitWs)
-import System.Exit (ExitCode(..), exitWith)
+import System.Exit (ExitCode( ExitFailure ), exitWith)
import System.IO (stderr, hPutStrLn)
import Text.Read (readMaybe)
import Cidr (
- Cidr(..),
+ Cidr(),
combine_all,
enumerate,
max_octet1,
min_octet2,
min_octet3,
min_octet4 )
-import CommandLine (Args(..), get_args)
+import qualified Cidr ( normalize )
+import CommandLine(
+ Args( Regexed, Reduced, Duped, Diffed, Listed, barriers, normalize, sort ),
+ get_args )
import ExitCodes ( exit_invalid_cidr )
import Octet ()
-- 5. Stick an address boundary on either side of the result if
-- use_barriers is True.
--
-cidr_to_regex :: Bool -> Cidr.Cidr -> String
+cidr_to_regex :: Bool -> Cidr -> String
cidr_to_regex use_barriers cidr =
let f = if use_barriers then add_barriers else id in
f (intercalate "\\." [range1, range2, range3, range4])
-- This reads stdin.
input <- getContents
- let cidr_strings = splitWs input
+ let cidr_strings = words input
let cidrs = map readMaybe cidr_strings :: [Maybe Cidr]
when (any isNothing cidrs) $ do
-- Output the bad lines, safely.
let pairs = zip cidr_strings cidrs
- let print_pair (x, Nothing) = hPutStrLn stderr (" * " ++ x)
+
+ let print_pair :: (String, Maybe Cidr) -> IO ()
+ print_pair (x, Nothing) = hPutStrLn stderr (" * " ++ x)
print_pair (_, _) = return ()
mapM_ print_pair pairs
let cidrs' = combine_all valid_cidrs
let regexes = map (cidr_to_regex (barriers args)) cidrs'
putStrLn $ alternate regexes
- Reduced{} ->
- mapM_ print (combine_all valid_cidrs)
+ Reduced{} -> do
+ -- Pre-normalize all CIDRs if the user asked for it.
+ let nrml_func = if (normalize args) then Cidr.normalize else id
+ let sort_func = if (sort args) then List.sort else id :: [Cidr] -> [Cidr]
+ mapM_ (print . nrml_func) (sort_func $ combine_all valid_cidrs)
Duped{} ->
mapM_ print dupes
where