-
Notifications
You must be signed in to change notification settings - Fork 905
drop unindent and indoc dependencies
#5608
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
Merged
Changes from 3 commits
Commits
Show all changes
4 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1 @@ | ||
| Drop `indoc` and `unindent` dependencies. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -26,4 +26,5 @@ pub mod pymethods; | |
| pub mod pymodule; | ||
| #[doc(hidden)] | ||
| pub mod trampoline; | ||
| pub mod unindent; | ||
| pub mod wrap; | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,229 @@ | ||
| use crate::impl_::concat::slice_copy_from_slice; | ||
|
|
||
| /// This is a reimplementation of the `indoc` crate's unindent functionality: | ||
| /// | ||
| /// 1. Count the leading spaces of each line, ignoring the first line and any lines that are empty or contain spaces only. | ||
| /// 2. Take the minimum. | ||
| /// 3. If the first line is empty i.e. the string begins with a newline, remove the first line. | ||
| /// 4. Remove the computed number of spaces from the beginning of each line. | ||
| const fn unindent_bytes(bytes: &mut [u8]) -> usize { | ||
| if bytes.is_empty() { | ||
| // nothing to do | ||
| return bytes.len(); | ||
| } | ||
|
|
||
| // scan for leading spaces (ignoring first line and empty lines) | ||
| let mut i = 0; | ||
|
|
||
| // skip first line | ||
| i = advance_to_next_line(bytes, i); | ||
|
|
||
| let mut to_unindent = usize::MAX; | ||
|
|
||
| // for remaining lines, count leading spaces | ||
| 'lines: while i < bytes.len() { | ||
| let line_leading_spaces = count_spaces(bytes, i); | ||
| i += line_leading_spaces; | ||
|
|
||
| // line only had spaces, ignore for the count | ||
| if let Some(eol) = consume_eol(bytes, i) { | ||
| i = eol; | ||
| continue 'lines; | ||
davidhewitt marked this conversation as resolved.
Outdated
Show resolved
Hide resolved
|
||
| } | ||
|
|
||
| // this line has content, consider its leading spaces | ||
| if line_leading_spaces < to_unindent { | ||
| to_unindent = line_leading_spaces; | ||
| } | ||
|
|
||
| i = advance_to_next_line(bytes, i); | ||
| } | ||
|
|
||
| if to_unindent == usize::MAX { | ||
| // all lines were empty, nothing to unindent | ||
| return bytes.len(); | ||
| } | ||
|
|
||
| // now copy from the original buffer, bringing values forward as needed | ||
| let mut read_idx = 0; | ||
| let mut write_idx = 0; | ||
|
|
||
| match consume_eol(bytes, read_idx) { | ||
| // skip empty first line | ||
| Some(eol) => read_idx = eol, | ||
| // copy non-empty first line as-is | ||
| None => { | ||
| while read_idx < bytes.len() { | ||
| let value = bytes[read_idx]; | ||
| bytes[write_idx] = value; | ||
| read_idx += 1; | ||
| write_idx += 1; | ||
| if value == b'\n' { | ||
| break; | ||
| } | ||
| } | ||
davidhewitt marked this conversation as resolved.
Show resolved
Hide resolved
|
||
| } | ||
| }; | ||
|
|
||
| while read_idx < bytes.len() { | ||
| let mut leading_spaces_skipped = 0; | ||
| while leading_spaces_skipped < to_unindent | ||
| && read_idx < bytes.len() | ||
| && bytes[read_idx] == b' ' | ||
| { | ||
| leading_spaces_skipped += 1; | ||
| read_idx += 1; | ||
| } | ||
|
|
||
| assert!( | ||
| leading_spaces_skipped == to_unindent || consume_eol(bytes, read_idx).is_some(), | ||
| "removed fewer spaces than expected on non-empty line" | ||
| ); | ||
|
|
||
| // copy remainder of line | ||
| while read_idx < bytes.len() { | ||
| let value = bytes[read_idx]; | ||
| bytes[write_idx] = value; | ||
| read_idx += 1; | ||
| write_idx += 1; | ||
| if value == b'\n' { | ||
| break; | ||
| } | ||
| } | ||
| } | ||
|
|
||
| write_idx | ||
| } | ||
|
|
||
| const fn advance_to_next_line(bytes: &[u8], mut i: usize) -> usize { | ||
| while i < bytes.len() { | ||
| if let Some(eol) = consume_eol(bytes, i) { | ||
| return eol; | ||
| } | ||
| i += 1; | ||
| } | ||
| i | ||
| } | ||
|
|
||
| const fn count_spaces(bytes: &[u8], mut i: usize) -> usize { | ||
| let mut count = 0; | ||
| while i < bytes.len() && bytes[i] == b' ' { | ||
| count += 1; | ||
| i += 1; | ||
| } | ||
| count | ||
| } | ||
|
|
||
| const fn consume_eol(bytes: &[u8], i: usize) -> Option<usize> { | ||
| if bytes.len() == i { | ||
| // special case: treat end of buffer as EOL without consuming anything | ||
| Some(i) | ||
| } else if bytes.len() > i && bytes[i] == b'\n' { | ||
| Some(i + 1) | ||
| } else if bytes[i] == b'\r' && bytes.len() > i + 1 && bytes[i + 1] == b'\n' { | ||
| Some(i + 2) | ||
| } else { | ||
| None | ||
| } | ||
| } | ||
|
|
||
| pub const fn unindent_sized<const N: usize>(src: &[u8]) -> ([u8; N], usize) { | ||
| let mut out: [u8; N] = [0; N]; | ||
| slice_copy_from_slice(&mut out, src); | ||
| let new_len = unindent_bytes(&mut out); | ||
| (out, new_len) | ||
| } | ||
|
|
||
| /// Helper for `py_run!` macro which unindents a string at compile time. | ||
| #[macro_export] | ||
| #[doc(hidden)] | ||
| macro_rules! unindent { | ||
| ($value:expr) => {{ | ||
| const RAW: &str = $value; | ||
| const LEN: usize = RAW.len(); | ||
| const UNINDENTED: ([u8; LEN], usize) = | ||
| $crate::impl_::unindent::unindent_sized::<LEN>(RAW.as_bytes()); | ||
| // SAFETY: this removes only spaces and preserves all other contents | ||
| unsafe { ::core::str::from_utf8_unchecked(UNINDENTED.0.split_at(UNINDENTED.1).0) } | ||
| }}; | ||
| } | ||
|
|
||
| pub use crate::unindent; | ||
|
|
||
| /// Equivalent of the `unindent!` macro, but works at runtime. | ||
| pub fn unindent(s: &str) -> String { | ||
| let mut bytes = s.as_bytes().to_owned(); | ||
| let unindented_size = unindent_bytes(&mut bytes); | ||
| bytes.resize(unindented_size, 0); | ||
| String::from_utf8(bytes).unwrap() | ||
| } | ||
|
|
||
| #[cfg(test)] | ||
| mod tests { | ||
| use super::*; | ||
|
|
||
| const SAMPLE_1_WITH_FIRST_LINE: &str = " first line | ||
| line one | ||
|
|
||
| line two | ||
| "; | ||
|
|
||
| const UNINDENTED_1: &str = " first line\nline one\n\n line two\n"; | ||
|
|
||
| const SAMPLE_2_EMPTY_FIRST_LINE: &str = " | ||
| line one | ||
|
|
||
| line two | ||
| "; | ||
| const UNINDENTED_2: &str = "line one\n\n line two\n"; | ||
|
|
||
| const SAMPLE_3_NO_INDENT: &str = " | ||
| no indent | ||
| here"; | ||
|
|
||
| const UNINDENTED_3: &str = "no indent\n here"; | ||
|
|
||
| const ALL_CASES: &[(&str, &str)] = &[ | ||
| (SAMPLE_1_WITH_FIRST_LINE, UNINDENTED_1), | ||
| (SAMPLE_2_EMPTY_FIRST_LINE, UNINDENTED_2), | ||
| (SAMPLE_3_NO_INDENT, UNINDENTED_3), | ||
| ]; | ||
|
|
||
| // run const tests for each sample to ensure they work at compile time | ||
|
|
||
| #[test] | ||
| fn test_unindent_const() { | ||
| const UNINDENTED: &str = unindent!(SAMPLE_1_WITH_FIRST_LINE); | ||
| assert_eq!(UNINDENTED, UNINDENTED_1); | ||
| } | ||
|
|
||
| #[test] | ||
| fn test_unindent_const_removes_empty_first_line() { | ||
| const UNINDENTED: &str = unindent!(SAMPLE_2_EMPTY_FIRST_LINE); | ||
| assert_eq!(UNINDENTED, UNINDENTED_2); | ||
| } | ||
|
|
||
| #[test] | ||
| fn test_unindent_const_no_indent() { | ||
| const UNINDENTED: &str = unindent!(SAMPLE_3_NO_INDENT); | ||
| assert_eq!(UNINDENTED, UNINDENTED_3); | ||
| } | ||
|
|
||
| #[test] | ||
| fn test_unindent_macro_runtime() { | ||
| // this variation on the test ensures full coverage (const eval not included in coverage) | ||
| const INDENTED: &str = SAMPLE_1_WITH_FIRST_LINE; | ||
| const LEN: usize = INDENTED.len(); | ||
| let (unindented, unindented_size) = unindent_sized::<LEN>(INDENTED.as_bytes()); | ||
| let unindented = std::str::from_utf8(&unindented[..unindented_size]).unwrap(); | ||
| assert_eq!(unindented, UNINDENTED_1); | ||
| } | ||
|
|
||
| #[test] | ||
| fn test_unindent_function() { | ||
| for (indented, expected) in ALL_CASES { | ||
| let unindented = unindent(indented); | ||
| assert_eq!(&unindented, expected); | ||
| } | ||
| } | ||
| } | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Uh oh!
There was an error while loading. Please reload this page.