Simple Diff Algorithm
draft-cheney-simplediff-00
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Author | Austin Cheney | ||
| Last updated | 2018-04-19 (Latest revision 2017-10-03) | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
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
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)