Simple Diff Algorithm
draft-cheney-simplediff-00

Document Type Expired Internet-Draft (individual)
Last updated 2018-04-19 (latest revision 2017-10-03)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-cheney-simplediff-00.txt

Abstract

This document describes a simplified algorithm for performing computational comparisons. The design goal is to achieve an approach that uses the smallest amount of logic. Necessary secondary goals include an approach that is language agnostic, fast, extensible, and more predictable than other similar algorithms.

Authors

Austin Cheney (info@prettydiff.com)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)