ethereum-libraries-string-utils
Advanced tools
A library provided by Arachnid and forked here by Modular to provide internal string utility functions for smart contracts on an Ethereum network. Big thanks to Nick Johnson for allowing us to add this to our collective library repository. The library is currently an exact copy of the original however we are in the process of adding external functionality for utf-8 byte arrays in contract storage.
This library includes only internal functions at this time and therefore does not need to be deployed for use.
Licensed under the Apache License, Version 2.0 (the "License"). You may not use this file except in compliance with the License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
npm install ethereum-libraries-string-utils
Test: npm run test
Test Coverage: npm run test:coverage
version 0.4.21
For direction and instructions on how the Solidity command line compiler works see the documentation.
The Standard JSON Input provides an easy interface to include libraries. Include the following as part of your JSON input file:
{
"language": "Solidity",
"sources":
{
"YourContract.sol": {
...
...
},
"StringUtilsLib.sol": {
"content": "[Contents of StringUtilsLib.sol]"
}
},
"settings":
{
...
"libraries": {}
}
}
Note: Since this library currently uses all internal or private functions the compiler will not create unlinked binary.
See the solc documentation for further information.
version 0.4.21
Solc-js provides javascript bindings for the Solidity compiler and can be found here. Please refer to their documentation for detailed use.
This version of Solc-js also uses the standard JSON input to compile a contract. The entry function is compileStandardWrapper() and you can create a standard JSON object explained under the solc section and incorporate it as follows:
var solc = require('solc');
var fs = require('fs');
var file = fs.readFileSync('/path/to/YourContract.sol','utf8');
var StringUtilsLib = fs.readFileSync('./path/to/StringUtilsLib.sol','utf8');
var input = {
"language": "Solidity",
"sources":
{
"YourContract.sol": {
"content": file
},
"StringUtilsLib.sol": {
"content": StringUtilsLib
}
},
"settings":
{
...
"libraries": {}
...
}
}
var output = JSON.parse(solc.compileStandardWrapper(JSON.stringify(input)));
//Where the output variable is a standard JSON output object.
See the Solc-js documentation for further information.
Functionality in this library is largely implemented using an abstraction called a 'slice'. A slice represents a part of a string - anything from the entire string to a single character, or even no characters at all (a 0-length slice). Since a slice only has to specify an offset and a length, copying and manipulating slices is a lot less expensive than copying and manipulating the strings they reference.
To further reduce gas costs, most functions on slice that need to return a slice modify the original one instead of allocating a new one; for instance, s.split(".") will return the text up to the first '.', modifying s to only contain the remainder of the string after the '.'. In situations where you do not want to modify the original slice, you can make a copy first with .copy(), for example: s.copy().split("."). Try and avoid using this idiom in loops; since Solidity has no memory management, it will result in allocating many short-lived slices that are later discarded.
Functions that return two slices come in two versions: a non-allocating version that takes the second slice as an argument, modifying it in place, and an allocating version that allocates and returns the second slice; see nextRune for example.
Functions that have to copy string data will return strings rather than slices; these can be cast back to slices for further processing if required.
import "./StringUtilsLib.sol";
contract Contract {
using StringUtilsLib for *;
// ...
}
var len = "Unicode snowman ☃".toSlice().len(); // 17
var s = "foo bar baz".toSlice();
var foo = s.split(" ".toSlice());
After the above code executes, s is now "bar baz", and foo is now "foo".
var s = "www.google.com".toSlice();
var delim = ".".toSlice();
var parts = new string[](s.count(delim) + 1);
for(uint i = 0; i < parts.length; i++) {
parts[i] = s.split(delim).toString();
}
var s = "www.google.com".toSlice();
strings.slice memory part;
s.split(".".toSlice(), part); // part and return value is "www"
s.split(".".toSlice(), part); // part and return value is "google"
This approach uses less memory than the above, by reusing the slice part for each section of string extracted.
var myString = mySlice.toString();
var s = "A B C B D".toSlice();
s.find("B".toSlice()); // "B C B D"
find modifies s to contain the part of the string from the first match onwards.
var s = "A B C B D".toSlice();
s.rfind("B".toSlice()); // "A B C B"
rfind modifies s to contain the part of the string from the last match back to the start.
var s = "A B C B D".toSlice();
var substring = s.copy().rfind("B".toSlice()); // "A B C B"
copy lets you cheaply duplicate a slice so you don't modify the original.
var s = "A B C B D".toSlice();
s.startsWith("A".toSlice()); // True
s.endsWith("D".toSlice()); // True
s.startsWith("B".toSlice()); // False
var s = "A B C B D".toSlice();
s.beyond("A ".toSlice()).until(" D".toSlice()); // "B C B"
beyond modifies s to contain the text after its argument; until modifies s to contain the text up to its argument. If the argument isn't found, s is unmodified.
var s = "A B C B D".toSlice();
var needle = "B".toSlice();
var substring = s.until(s.copy().find(needle).beyond(needle));
Calling find on a copy of s returns the part of the string from needle onwards; calling .beyond(needle) removes needle as a prefix, and finally calling s.until() removes the entire end of the string, leaving everything up to and including the first match.
var s = "abc".toSlice().concat("def".toSlice()); // "abcdef"
(StringUtilsLib.sol, line 95)
Returns a slice containing the entire string.
string self The string to make a slice from.
StringUtilsLib.slice A newly allocated slice containing the entire string.
(StringUtilsLib.sol, line 157)
Returns a new slice containing the same data as the current slice.
StringUtilsLib.slice self The slice to copy.
StringUtilsLib.slice A new slice containing the same data as self.
(StringUtilsLib.sol, line 166)
Copies a slice to a new string.
StringUtilsLib.slice self The slice to copy.
string A newly allocated string containing the slice's text.
(StringUtilsLib.sol, line 184)
Returns the length in runes of the slice. Note that this operation takes time proportional to the length of the slice; avoid using it in loops, and call slice.empty() if you only need to know whether the slice is empty or not.
StringUtilsLib.slice self The slice to operate on.
uint The length of the slice in runes.
(StringUtilsLib.sol, line 215)
Returns true if the slice is empty (has a length of 0).
StringUtilsLib.slice self The slice to operate on.
bool True if the slice is empty, false otherwise.
(StringUtilsLib.sol, line 228)
Returns a positive number if other comes lexicographically after self, a negative number if it comes before, or zero if the contents of the two slices are equal. Comparison is done per-rune, on unicode codepoints.
StringUtilsLib.slice self The first slice to compare.
StringUtilsLib.slice other The second slice to compare.
int The result of the comparison.
(StringUtilsLib.sol, line 261)
Returns true if the two slices contain the same text.
StringUtilsLib.slice self The first slice to compare.
StringUtilsLib.slice other The second slice to compare.
bool True if the slices are equal, false otherwise.
(StringUtilsLib.sol, line 272)
Extracts the first rune in the slice into rune, advancing the slice to point to the next rune and returning self.
StringUtilsLib.slice self The slice to operate on.
StringUtilsLib.slice rune The slice that will contain the first rune.
StringUtilsLib.slice rune
(StringUtilsLib.sol, line 314)
Returns the first rune in the slice, advancing the slice to point to the next rune.
StringUtilsLib.slice self The slice to operate on.
StringUtilsLib.slice A slice containing only the first rune from self.
(StringUtilsLib.sol, line 323)
Returns the number of the first codepoint in the slice.
StringUtilsLib.slice self The slice to operate on.
uint The number of the first codepoint in the slice.
(StringUtilsLib.sol, line 372)
Returns the keccak-256 hash of the slice.
StringUtilsLib.slice self The slice to hash.
bytes32 The hash of the slice.
(StringUtilsLib.sol, line 384)
Returns true if self starts with needle.
StringUtilsLib.slice self The slice to operate on.
StringUtilsLib.slice needle The slice to search for.
bool True if the slice starts with the provided text, false otherwise.
(StringUtilsLib.sol, line 410)
If self starts with needle, needle is removed from the beginning of self. Otherwise, self is unmodified.
StringUtilsLib.slice self The slice to operate on.
StringUtilsLib.slice needle The slice to search for.
StringUtilsLib.slice self
(StringUtilsLib.sol, line 439)
Returns true if the slice ends with needle.
StringUtilsLib.slice self The slice to operate on.
StringUtilsLib.slice needle The slice to search for.
bool True if the slice starts with the provided text, false otherwise.
(StringUtilsLib.sol, line 467)
If self ends with needle, needle is removed from the end of self. Otherwise, self is unmodified.
StringUtilsLib.slice self The slice to operate on.
StringUtilsLib.slice needle The slice to search for.
StringUtilsLib.slice self
(StringUtilsLib.sol, line 602)
Modifies self to contain everything from the first occurrence of needle to the end of the slice. self is set to the empty slice if needle is not found.
StringUtilsLib.slice self The slice to operate on.
StringUtilsLib.slice needle The text to search for.
StringUtilsLib.slice self
(StringUtilsLib.sol, line 617)
Modifies self to contain the part of the string from the start of self to the end of the first occurrence of needle. If needle is not found, self is set to the empty slice.
StringUtilsLib.slice self The slice to search and modify.
StringUtilsLib.slice needle The text to search for.
StringUtilsLib.slice self
(StringUtilsLib.sol, line 633)
Splits the slice, setting self to everything after the first occurrence of needle, and token to everything before it. If needle does not occur in self, self is set to the empty slice, and token is set to the entirety of self.
StringUtilsLib.slice self The slice to split.
StringUtilsLib.slice needle The text to search for in self.
StringUtilsLib.slice token An output parameter to which the first token is written.
StringUtilsLib.slice token
(StringUtilsLib.sol, line 656)
Splits the slice, setting self to everything after the first occurrence of needle, and returning everything before it. If needle does not occur in self, self is set to the empty slice, and the entirety of self is returned.
StringUtilsLib.slice self The slice to split.
StringUtilsLib.slice needle The text to search for in self.
StringUtilsLib.slice token The part of self up to the first occurrence of needle.
(StringUtilsLib.sol, line 670)
Splits the slice, setting self to everything before the last occurrence of needle, and token to everything after it. If needle does not occur in self, self is set to the empty slice, and token is set to the entirety of self.
StringUtilsLib.slice self The slice to split.
StringUtilsLib.slice needle The text to search for in self.
StringUtilsLib.slice token An output parameter to which the first token is written.
StringUtilsLib.slice token
(StringUtilsLib.sol, line 670)
Splits the slice, setting self to everything before the last occurrence of needle, and returning everything after it. If needle does not occur in self, self is set to the empty slice, and the entirety of self is returned.
StringUtilsLib.slice self The slice to split.
StringUtilsLib.slice needle The text to search for in self.
StringUtilsLib.slice token The part of self after the last occurrence of needle.
(StringUtilsLib.sol, line 702)
Counts the number of non overlapping occurrences of needle in self.
StringUtilsLib.slice self The slice to split.
StringUtilsLib.slice needle The text to search for in self.
uint count The number of occurrences of needle found in self.
(StringUtilsLib.sol, line 716)
Returns True if self contains needle.
StringUtilsLib.slice self The slice to search.
StringUtilsLib.slice needle The text to search for in self.
bool True if needle is found in self, false otherwise.
(StringUtilsLib.sol, line 727)
Returns a newly allocated string containing the concatenation of self and other.
StringUtilsLib.slice self The first slice to concatenate.
StringUtilsLib.slice other The second slice to concatenate.
string The concatenation of the two strings.
(StringUtilsLib.sol, line 744)
Joins an array of slices, using self as a delimiter, returning a newly allocated string.
StringUtilsLib.slice self The delimiter to use.
StringUtilsLib.slice[] parts A list of slices to join.
string A newly allocated string containing all the slices in parts, joined with self.
FAQs
String utility library for Ethereum smart contracts
The npm package ethereum-libraries-string-utils receives a total of 1 weekly downloads. As such, ethereum-libraries-string-utils popularity was classified as not popular.
We found that ethereum-libraries-string-utils demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
In this segment of the Risky Business podcast, Feross Aboukhadijeh and Patrick Gray discuss the challenges of tracking malware discovered in open source softare.
Research
Security News
A threat actor's playbook for exploiting the npm ecosystem was exposed on the dark web, detailing how to build a blockchain-powered botnet.
Security News
NVD’s backlog surpasses 20,000 CVEs as analysis slows and NIST announces new system updates to address ongoing delays.