The hath package
Hath is a Haskell program for working with network blocks in CIDR notation. When dealing with blocks of network addresses, there are a few things that one usually wants to do with them:
Create a regular expression matching the CIDR block(s). This is because grep will throw up if you feed it CIDR.
Combine small blocks into larger ones. For example, if you have two consecutive /24s, they might combine into a larger /23.
View the result of block combination in a useful way.
Hath has four modes to perform these functions:
- This computes a (Perl-compatible) regular expression matching the input CIDR blocks. It's the default mode of operation.
- This combines small blocks into larger ones where possible, and eliminates redundant blocks. The output should be equivalent to the input, though.
- Shows only the blocks that would be removed by reduce; that is, it shows the ones that would get combined into larger blocks or are simply redundant.
- Shows what would change if you used reduce. Uses diff-like notation.
Combine two /24s into a /23:
$ hath reduced <<< "10.0.0.0/24 10.0.1.0/24" 10.0.0.0/23
Create a perl-compatible regex to be fed to grep:
$ grep -P `hath regexed -i cidrs.txt` mail.log
- No changelog available
|Versions||0.0.1, 0.0.2, 0.0.3, 0.0.4, 0.0.5, 0.1.0, 0.1.1, 0.1.2|
|Dependencies||base (==4.*), HUnit (==1.2.*), MissingH (==1.2.*), QuickCheck (==2.6.*), split (==0.2.*), test-framework (==0.8.*), test-framework-hunit (==0.3.*), test-framework-quickcheck2 (==0.3.*)|
|Maintainer||Michael Orlitzky <firstname.lastname@example.org>|
|Source repository||head: git clone http://michael.orlitzky.com/git/hath.git -b master|
|Upload date||Sat Jun 8 19:00:47 UTC 2013|
|Downloads||383 total (25 in last 30 days)|
For package maintainers and hackage trustees