[RFC 9112 section 7.1](https://datatracker.ietf.org/doc/html/rfc9112#section-7.1) requires the chunked response body to end with `0\r\n\r\n`. The writer previously emitted only `0\r\n`, which strict clients treated as an incomplete response. Chunked responses now include the final CRLF after the zero-size chunk.

Reviewed-on: #1476
Reviewed-by: vyzo <vyzo@noreply.git.cons.io>

@@ -0,0 +5,4 @@
+(import :std/error
+        :std/text/pregexp
+        :std/encoding/hex
+        (only-in :std/crypto/digest md5)

@@ -0,0 +112,4 @@
+
+(def (deque->list (dq : deque))
+  => :list
+  (let lp ((n dq.back :- node) (r [] :- :list))

@@ -0,0 +178,4 @@
+(defstruct lru-cache-iterator (cursor (value :- :procedure))
+  final: #t)
+
+(implement Iterator lru-cache-iterator

@@ -0,0 +2,4 @@
+;;; (C) vyzo at hackzen.org
+;;; heap based priority queues
+(import :std/error)
+(export pqueue make-pqueue pqueue? pqueue-empty? pqueue-size

@@ -0,0 +9,4 @@
+        :std/interface
+        :std/iter/interface
+        :std/iter/iterators)
+(export rbtree rbtree? make-rbtree

@@ -0,0 +180,4 @@
+(def rbtree-iter-key-e (lambda (k v) k))
+(def rbtree-iter-val-e (lambda (k v) v))
+
+(def (in-rbtree (rbt : rbtree))

@@ -0,0 +165,4 @@
+(defstruct rbtree-iterator (stack (value :- :procedure))
+  final: #t)
+
+(implement Iterator rbtree-iterator

@@ -0,0 +36,4 @@
+      (set! next.prev new)
+      new)))
+
+(defstruct Deque ((front :- Node)

@@ -0,0 +11,4 @@
+;; the module is statically type checked anyway.
+(declare (not safe))
+
+(defstruct PQueue ((e    : :vector)

@@ -0,0 +29,4 @@
+        RBTree-cmp)
+
+;; rbtree structure
+(defstruct RBTree (root (cmp :- :procedure))

@@ -0,0 +13,4 @@
+        push-back! pop-back! peek-back
+        deque->list
+        DequeForwardIterator DequeForwardIterator?
+        DequeReverseIterator DequeReverseIterator?

@@ -0,0 +157,4 @@
+   (lambda (self)
+     (Iterator (make-DequeForwardIterator self.front)))))
+
+(def (deque-reverse-iter (dq : Deque))