Skip to content
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

bs.string: A module to manage strings #191

Open
3 tasks
theogiraudet opened this issue May 11, 2024 · 5 comments · May be fixed by #283
Open
3 tasks

bs.string: A module to manage strings #191

theogiraudet opened this issue May 11, 2024 · 5 comments · May be fixed by #283
Assignees
Labels
👋 Good first issue Good for newcomers ✨ Module New modules
Milestone

Comments

@theogiraudet
Copy link
Contributor

New facility functions to manipulate string:

  • To char array
  • Index of
  • Split according to a char
@theogiraudet theogiraudet added this to the 2.1.0 milestone May 11, 2024
@theogiraudet theogiraudet added ✨ Module New modules 👋 Good first issue Good for newcomers labels May 11, 2024
@aksiome aksiome moved this to 🏗 In progress in 📚 Bookshelf Jun 17, 2024
@aksiome aksiome removed this from the 2.2.0 milestone Sep 6, 2024
@aure31
Copy link

aure31 commented Oct 27, 2024

I can take this module

@aure31
Copy link

aure31 commented Oct 27, 2024

the different functions offered by the string module

bs.string:index_of

[inputs]
str: [str] the string (bs:in string.index_of.str)
letter: [char] the letter to find
index : [int]the nth occurance index

[output]
$string.index_of bs.out

[use]:
retrieves the index of the first recurrence of the character

bs.string:concat

[inputs]
str1 : [str] (bs:in string.concat.str)
str2 : [str]

[output]
bs:out string.concat

bs.string:length

[inputs]
str : [str] (bs:in string.length.str)
[output]
$string.length bs.out

bs.string:substr

[inputs]
str : [str] (bs:in string.substr.str)
start : [int]
end : [int]

[output]
bs:out string.substr

bs.string:lower

[inputs]
str : [str] (bs:in string.lower.str)

[output]
bs:out string.lower

bs.string:upper

[inputs]
str : [str] (bs:in string.upper.str)

[output]
bs:out string.upper

bs.string:char_at

[inputs]
str : [str] (bs:in string.char_at.str)
index : [int]

[output]
bs:out string.char_at

bs.string:to_list

[inputs]
str : [str] (bs:in string.to_list.str)

[output]
bs:out string.to_list [list]

bs.string:split

[inputs]
str : [str] (bs:in string.split.str)
caracter : [char]

[output]
bs:out string.split [list]

bs.string:replace

[inputs]
str : [str] (bs:in string.replace.str)
char : [char]
new_char : [char]

[output]
bs:out string.replace [str]

bs.string:replace_at

[inputs]
str : [str] (bs:in string.replace_at.str)
index : [int]
new_char : [char]

[output]
bs:out string.replace_at [str]

bs.string:join

[inputs]
strings : [list[str]] (bs:in string.upper.strings)
separator : [str]

[outputs]
bs:out string.join [str]

here's a non-exhaustive list of the different functions what do you think?

@theogiraudet
Copy link
Contributor Author

theogiraudet commented Nov 26, 2024

Hey @aure31 have you found time to start the module?
If you're still up for it, do you think we'll be able to release it in the next iteration (no date set yet)?

@aure31
Copy link

aure31 commented Nov 26, 2024

I start a little bit but the module it self is not too hard to make so I think i can finish it for the next iteration

@theogiraudet
Copy link
Contributor Author

I start a little bit but the module it self is not too hard to make so I think i can finish it for the next iteration

Perfect, I link this issue to the next milestone so.
Thanks!

@theogiraudet theogiraudet added this to the 3.0.0 milestone Nov 26, 2024
@aure31 aure31 linked a pull request Nov 30, 2024 that will close this issue
6 tasks
@theogiraudet theogiraudet linked a pull request Nov 30, 2024 that will close this issue
6 tasks
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
👋 Good first issue Good for newcomers ✨ Module New modules
Projects
None yet
Development

Successfully merging a pull request may close this issue.

4 participants