From 3d9b15e311412feb1e9cb15664cd62858603c7df Mon Sep 17 00:00:00 2001
From: Denys Zadorozhnyi <dzadorozhnyi@polygon.technology>
Date: Tue, 26 Nov 2024 11:17:40 +0200
Subject: [PATCH] chore: fix doc test false positive

---
 midenc-debug/src/felt.rs | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/midenc-debug/src/felt.rs b/midenc-debug/src/felt.rs
index ac77d4d97..24248c38e 100644
--- a/midenc-debug/src/felt.rs
+++ b/midenc-debug/src/felt.rs
@@ -282,11 +282,11 @@ impl<const N: usize> PopFromStack for [u8; N] {
 ///
 /// Given a byte slice laid out like so:
 ///
-///     [b0, b1, b2, b3, b4, b5, b6, b7, .., b31]
+/// [b0, b1, b2, b3, b4, b5, b6, b7, .., b31]
 ///
 /// This will produce a vector of words laid out like so:
 ///
-///     [[{b0, ..b3}, {b4, ..b7}, {b8..b11}, {b12, ..b15}], ..]
+/// [[{b0, ..b3}, {b4, ..b7}, {b8..b11}, {b12, ..b15}], ..]
 ///
 /// In other words, it produces words that when placed on the stack and written to memory
 /// word-by-word, that memory will be laid out in the correct byte order.