Elrman.h is working at the moment. I did cheat a lot in converting the nroff to markdown. It doesn't really
implement the nroff state machine. But at least on my machine the results are readable. I suspect there is
a point of diminishing returns in attempting to reverse engineer the nroff and some pages will just not work
since they don't follow the format.
iex(2)> Erlman.h(":binary.split")
def :binary.split
split(Subject, Pattern) -> Parts
Types:
Subject = binary()
Pattern = binary() | [binary()] | cp()
Parts = [binary()]
The same as split(Subject, Pattern, []).
def :binary.split
split(Subject, Pattern, Options) -> Parts
Types:
Subject = binary()
Pattern = binary() | [binary()] | cp()
Options = [Option]
Option = {scope, part()} | trim | global
Parts = [binary()]
Splits Subject into a list of binaries based on Pattern. If the option global
is not given, only the first occurrence of Pattern in Subject will give rise to
a split. The parts of Pattern actually found in Subject are not included in the
result. Example:
1> binary:split(<<1,255,4,0,0,0,2,3>>, [<<0,0,0>>,<<2>>],[]). [<<1,255,4>>,
<<2,3>>] 2> binary:split(<<0,1,0,0,4,255,255,9>>, [<<0,0>>,
<<255,255>>],[global]). [<<0,1>>,<<4>>,<<9>>]
Summary of options: 2
[:ok, :ok]
iex(3)> Erlman.h(":binary")
:binary
BINARY 3 "STDLIB 2.4" "ERICSSON AB" "ERLANG MODULE DEFINITION"
NAME
binary - Library for handling binary data
DESCRIPTION
This module contains functions for manipulating byte-oriented binaries.
Although the majority of functions could be implemented using bit-syntax, the
functions in this library are highly optimized and are expected to either
execute faster or consume less memory (or both) than a counterpart written in
pure Erlang. The module is implemented according to the EEP (Erlang Enhancement
Proposal) 31.
Note: The library handles byte-oriented data. Bitstrings that are not binaries
(does not contain whole octets of bits) will result in a badarg exception being
thrown from any of the functions in this module.
DATA TYPES
cp()
Opaque data-type representing a compiled search-pattern. Guaranteed to be a
tuple() to allow programs to distinguish it from non precompiled search
patterns.
part() = {Start :: integer() >= 0, Length :: integer()}
A representaion of a part (or range) in a binary. Start is a zero-based offset
into a binary() and Length is the length of that part. As input to functions in
this module, a reverse part specification is allowed, constructed with a
negative Length, so that the part of the binary begins at Start + Length and is
-Length long. This is useful for referencing the last N bytes of a binary as
{size(Binary), -N}. The functions in this module always return part()'s with
positive Length.
:ok