Block or report user

Report or block dfoxfranke

Hide content and notifications from this user.

Contact Support about this user’s behavior.

Report abuse

Popular repositories

  1. nts

    IETF I-D for Network Time Security

    7 4

  2. libaes_siv

    An RFC5297-compliant C implementation of AES-SIV

    C 7 1

  3. how-ntp-works


  4. haskell-cld2

    Haskell bindings to Google's Compact Language Detector 2

    C++ 1 1

  5. conduit

    Forked from snoyberg/conduit

    A pull-based approach to streaming data.


  6. statistics

    Forked from bos/statistics

    A fast, high quality library for computing with statistics in Haskell.


48 contributions in the last year

Aug Sep Oct Nov Dec Jan Feb Mar Apr May Jun Jul Aug Mon Wed Fri

Contribution activity

August 2018

Created an issue in rust-lang/rust that received 9 comments

Getting the i'th smallest or largest element of a BTreeSet

I'm in need of a data structure implementing an ordered set in which the following operations are all O(log N): Insertion Deletion Looking up the …


Seeing something unexpected? Take a look at the GitHub profile guide.