-
-
Notifications
You must be signed in to change notification settings - Fork 13
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
ledger #325
base: main
Are you sure you want to change the base?
ledger #325
Conversation
Hello 👋 Thanks for your PR. This repo does not currently have dedicated maintainers. Our cross-track maintainers team will attempt to review and merge your PR, but it will likely take longer for your PR to be reviewed. If you enjoy contributing to Exercism and have a track-record of doing so successfully, you might like to become an Exercism maintainer for this track. Please feel free to ask any questions, or chat to us about anything to do with this PR or the reviewing process on the Exercism forum. (cc @exercism/cross-track-maintainers) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Looks much better
}; | ||
|
||
let formatted_value = format_number(int_value, negative, currency, locale); | ||
let mut extra = ""; |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
let mut extra = ""; | |
let mut padding = ""; |
more accurate
i += 1; | ||
} | ||
|
||
const AMOUNT_COLUMN_WIDTH: usize = 13; |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Move all constants outside to the top of the file, and outside any functions
fn format_amount(amount_in_cents: @i32, currency: @Currency, locale: @Locale) -> ByteArray { | ||
let amount_in_cents = format!("{amount_in_cents}"); | ||
let mut int_value: u32 = 0; | ||
let mut negative = false; | ||
let mut i = 0; | ||
|
||
if amount_in_cents[i] == '-' { | ||
negative = true; | ||
i += 1; | ||
} | ||
|
||
const AMOUNT_COLUMN_WIDTH: usize = 13; | ||
while i < amount_in_cents.len() { | ||
let zero_ascii = '0'; | ||
if let Option::Some(digit) = Option::Some(amount_in_cents[i] - zero_ascii) { | ||
int_value = int_value * 10 + digit.into(); | ||
} | ||
i += 1; | ||
}; |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This is unnecessary logic - the first line turns an integer amount_in_cents
value into a bytearray, and then immediately after in this while loop, it parses that same bytearray back into an integer.
Refactor this to utilize the original integer value directly.
You can even move negative
into the formatter, thus removing the extra function parameter, and doing away with the local variable
if fraction < 10 { | ||
result.append_byte('0'); | ||
fraction.append_formatted_to_byte_array(ref result, 10); | ||
} else { | ||
fraction.append_formatted_to_byte_array(ref result, 10); | ||
} |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
if fraction < 10 { | |
result.append_byte('0'); | |
fraction.append_formatted_to_byte_array(ref result, 10); | |
} else { | |
fraction.append_formatted_to_byte_array(ref result, 10); | |
} | |
if fraction < 10 { | |
result.append_byte('0'); | |
} | |
fraction.append_formatted_to_byte_array(ref result, 10); |
let whole = value / 100; | ||
|
||
result += add_sep(whole, locale); | ||
let fraction = value % 100; |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
move fraction
closer to where it's actually used
Locale::en_US => { | ||
day += "/"; | ||
month += "/"; | ||
ByteArrayTrait::concat(@month, @ByteArrayTrait::concat(@day, @year)) | ||
}, | ||
Locale::nl_NL => { | ||
day += "-"; | ||
month += "-"; | ||
ByteArrayTrait::concat(@day, @ByteArrayTrait::concat(@month, @year)) | ||
}, |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Why not use the shorter format!
?
fn split_date(date: @ByteArray) -> (ByteArray, ByteArray, ByteArray) { | ||
let mut year = ""; | ||
let mut month = ""; | ||
let mut day = ""; | ||
let mut sep = 0; | ||
let mut i = 0; | ||
|
||
while i < date.len() { | ||
if sep == 0 && i < 4 && date[i] != '-' { | ||
year.append_byte(date[i]); | ||
} else if date[i] == '-' { | ||
sep += 1; | ||
} else if sep == 1 && i < 7 && date[i] != '-' { | ||
month.append_byte(date[i]); | ||
} else { | ||
day.append_byte(date[i]); | ||
} | ||
i += 1; | ||
}; | ||
|
||
(year, month, day) | ||
} |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Here's a more efficient solution:
fn split_date(date: @ByteArray) -> (ByteArray, ByteArray, ByteArray) { | |
let mut year = ""; | |
let mut month = ""; | |
let mut day = ""; | |
let mut sep = 0; | |
let mut i = 0; | |
while i < date.len() { | |
if sep == 0 && i < 4 && date[i] != '-' { | |
year.append_byte(date[i]); | |
} else if date[i] == '-' { | |
sep += 1; | |
} else if sep == 1 && i < 7 && date[i] != '-' { | |
month.append_byte(date[i]); | |
} else { | |
day.append_byte(date[i]); | |
} | |
i += 1; | |
}; | |
(year, month, day) | |
} | |
fn split_date(date: ByteArray) -> (ByteArray, ByteArray, ByteArray) { | |
// Helper to append bytes to a ByteArray | |
#[cairofmt::skip] | |
let append_range = |start: usize, end: usize| -> ByteArray { | |
let mut part = ""; | |
for i in start..end { | |
part.append_byte(date[i]); | |
}; | |
part | |
}; | |
// Find separator positions | |
let mut separators = array![]; | |
for i in 0..date.len() { | |
if date[i] == '-' { | |
separators.append(i); | |
} | |
}; | |
// Extract year, month, and day | |
let year = append_range(0, *separators[0]); | |
let month = append_range(*separators[0] + 1, *separators[1]); | |
let day = append_range(*separators[1] + 1, date.len()); | |
(year, month, day) | |
} |
Benefits:
- Avoids multiple checks during iteration.
- The logic is broken into meaningful parts, making the code easier to test and reuse.
- The intent of each section is clear and self-contained
- More gas efficient
|
||
|
||
fn add_sep(whole: u32, locale: @Locale) -> ByteArray { | ||
let mut result = ""; |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
redundant result
, you can remove it and return values directly
let mut temp = ""; | ||
@whole.append_formatted_to_byte_array(ref temp, 10); |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
let mut temp = ""; | |
@whole.append_formatted_to_byte_array(ref temp, 10); | |
let temp = format!("{whole}"); |
no need to overcomplicate things
Entry { date: "2015-01-01", description: "Buy present", amount_in_cents: -1000 }, | ||
Entry { date: "2015-01-02", description: "Get present", amount_in_cents: 1000 }, |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Double check that all test entries are in correct order
let entries = array![ | ||
Entry { date: "2015-01-01", description: "Something", amount_in_cents: -1 }, | ||
Entry { date: "2015-01-01", description: "Something", amount_in_cents: 0 }, | ||
Entry { date: "2015-01-01", description: "Something", amount_in_cents: 1 }, |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
let locale = Locale::en_US; | ||
let entries = array![ | ||
Entry { date: "2015-01-01", description: "Buy present", amount_in_cents: -1000 }, | ||
Entry { date: "2015-01-01", description: "Get present", amount_in_cents: 1000 }, |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
hi @0xNeshi sorry for the late update, I only have this part left to fix,
I am having trouble thinking of how best to implement this sorting, the current code I have output the ledger in the same order it was enterred, I want the expected to be the same as expected in canonincal-data.json reason for my wrong oder entry
order.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
The change should be as simple as just iterating the entries from the end (once the tests pass them in correct order)
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Hey @Falilah, I took another look at this and your initial solution wasn't quite right.
According to the canonical data you shared, the entries aren't processed in order from first to last or last to first - instead, they're processed by handling all negative amount_in_cents
before positive amount_in_cents
. You can see this pattern in other examples with multiple entries too.
You'll want to update your processing logic to match this approach.
} | ||
|
||
pub fn format_entries( | ||
currency: Currency, locale: Locale, entries: Array<Entry>, |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
My eyes hurt looking at this implementation, which means you did a great job! :)
Closes #196
Opened instead of #316
I have not done the switches you recommended in the previous one and reason is that I am still thinking of how best to write the sorting logic of the
ByteArray
.