Update some RFC links

This commit is contained in:
Nigel Tao committed 2020-03-12 16:58:38 +11:00
1 parent 3690e83d86
commit 07d99dc2e1
2 files changed
+5 -5

No files matched your search

+3 -3
View File
@@ -8,10 +8,10 @@ Status: Draft (as of September 2019). There is no compatibility guarantee yet.
RAC is a *compressed* file format that allows *random access* (not just
sequential access) to the decompressed contents. In comparison to some other
popular compression formats, all four of the
[Zlib](https://tools.ietf.org/html/rfc1950),
[Brotli](https://tools.ietf.org/html/rfc7932),
[Zlib](https://www.ietf.org/rfc/rfc1950.txt),
[Brotli](https://www.ietf.org/rfc/rfc7932.txt),
[LZ4](https://github.com/lz4/lz4/blob/master/doc/lz4_Frame_format.md) and
[Zstandard](https://tools.ietf.org/html/rfc8478) specifications explicitly
[Zstandard](https://www.ietf.org/rfc/rfc8478.txt) specifications explicitly
contain the identical phrase: "the data format defined by this specification
does not attempt to allow random access to compressed data".
+2 -2
View File
@@ -33,8 +33,8 @@ pub struct decoder? implements base.token_decoder(
// maximum is 1024 (stack is 1024 bits or 128 bytes), also known as
// decoder_depth_max_incl.
//
// The [JSON spec](https://tools.ietf.org/html/rfc7159) clearly states, "an
// implementation may set limits on the maximum depth of nesting".
// The [JSON spec](https://www.ietf.org/rfc/rfc8259.txt) clearly states,
// "an implementation may set limits on the maximum depth of nesting".
//
// In comparison, as of February 2020, the Chromium web browser's JSON
// parser's maximum recursion depth is 200: