| // Copyright 2018 The CUE Authors |
| // |
| // 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. |
| |
| // Copyright 2018 The Go Authors. All rights reserved. |
| // Use of this source code is governed by a BSD-style |
| // license that can be found in the LICENSE file. |
| |
| //go:generate qgo -exclude=Rune$,Func$,^Map$,Special$,EqualFold,Byte,Title$,All$ extract strings |
| |
| package strings |
| |
| import "strings" |
| |
| // Compare returns an integer comparing two strings lexicographically. |
| // The result will be 0 if a==b, -1 if a < b, and +1 if a > b. |
| // |
| // Compare is included only for symmetry with package bytes. |
| // It is usually clearer and always faster to use the built-in |
| // string comparison operators ==, <, >, and so on. |
| func Compare(a, b string) int { |
| return strings.Compare(a, b) |
| } |
| |
| // Count counts the number of non-overlapping instances of substr in s. |
| // If substr is an empty string, Count returns 1 + the number of Unicode code points in s. |
| func Count(s, substr string) int { |
| return strings.Count(s, substr) |
| } |
| |
| // Contains reports whether substr is within s. |
| func Contains(s, substr string) bool { |
| return strings.Contains(s, substr) |
| } |
| |
| // ContainsAny reports whether any Unicode code points in chars are within s. |
| func ContainsAny(s, chars string) bool { |
| return strings.ContainsAny(s, chars) |
| } |
| |
| // LastIndex returns the index of the last instance of substr in s, or -1 if substr is not present in s. |
| func LastIndex(s, substr string) int { |
| return strings.LastIndex(s, substr) |
| } |
| |
| // IndexAny returns the index of the first instance of any Unicode code point |
| // from chars in s, or -1 if no Unicode code point from chars is present in s. |
| func IndexAny(s, chars string) int { |
| return strings.IndexAny(s, chars) |
| } |
| |
| // LastIndexAny returns the index of the last instance of any Unicode code |
| // point from chars in s, or -1 if no Unicode code point from chars is |
| // present in s. |
| func LastIndexAny(s, chars string) int { |
| return strings.LastIndexAny(s, chars) |
| } |
| |
| // SplitN slices s into substrings separated by sep and returns a slice of |
| // the substrings between those separators. |
| // |
| // The count determines the number of substrings to return: |
| // n > 0: at most n substrings; the last substring will be the unsplit remainder. |
| // n == 0: the result is nil (zero substrings) |
| // n < 0: all substrings |
| // |
| // Edge cases for s and sep (for example, empty strings) are handled |
| // as described in the documentation for Split. |
| func SplitN(s, sep string, n int) []string { |
| return strings.SplitN(s, sep, n) |
| } |
| |
| // SplitAfterN slices s into substrings after each instance of sep and |
| // returns a slice of those substrings. |
| // |
| // The count determines the number of substrings to return: |
| // n > 0: at most n substrings; the last substring will be the unsplit remainder. |
| // n == 0: the result is nil (zero substrings) |
| // n < 0: all substrings |
| // |
| // Edge cases for s and sep (for example, empty strings) are handled |
| // as described in the documentation for SplitAfter. |
| func SplitAfterN(s, sep string, n int) []string { |
| return strings.SplitAfterN(s, sep, n) |
| } |
| |
| // Split slices s into all substrings separated by sep and returns a slice of |
| // the substrings between those separators. |
| // |
| // If s does not contain sep and sep is not empty, Split returns a |
| // slice of length 1 whose only element is s. |
| // |
| // If sep is empty, Split splits after each UTF-8 sequence. If both s |
| // and sep are empty, Split returns an empty slice. |
| // |
| // It is equivalent to SplitN with a count of -1. |
| func Split(s, sep string) []string { |
| return strings.Split(s, sep) |
| } |
| |
| // SplitAfter slices s into all substrings after each instance of sep and |
| // returns a slice of those substrings. |
| // |
| // If s does not contain sep and sep is not empty, SplitAfter returns |
| // a slice of length 1 whose only element is s. |
| // |
| // If sep is empty, SplitAfter splits after each UTF-8 sequence. If |
| // both s and sep are empty, SplitAfter returns an empty slice. |
| // |
| // It is equivalent to SplitAfterN with a count of -1. |
| func SplitAfter(s, sep string) []string { |
| return strings.SplitAfter(s, sep) |
| } |
| |
| // Fields splits the string s around each instance of one or more consecutive white space |
| // characters, as defined by unicode.IsSpace, returning a slice of substrings of s or an |
| // empty slice if s contains only white space. |
| func Fields(s string) []string { |
| return strings.Fields(s) |
| } |
| |
| // Join concatenates the elements of a to create a single string. The separator string |
| // sep is placed between elements in the resulting string. |
| func Join(a []string, sep string) string { |
| return strings.Join(a, sep) |
| } |
| |
| // HasPrefix tests whether the string s begins with prefix. |
| func HasPrefix(s, prefix string) bool { |
| return strings.HasPrefix(s, prefix) |
| } |
| |
| // HasSuffix tests whether the string s ends with suffix. |
| func HasSuffix(s, suffix string) bool { |
| return strings.HasSuffix(s, suffix) |
| } |
| |
| // Repeat returns a new string consisting of count copies of the string s. |
| // |
| // It panics if count is negative or if |
| // the result of (len(s) * count) overflows. |
| func Repeat(s string, count int) string { |
| return strings.Repeat(s, count) |
| } |
| |
| // ToUpper returns a copy of the string s with all Unicode letters mapped to their upper case. |
| func ToUpper(s string) string { |
| return strings.ToUpper(s) |
| } |
| |
| // ToLower returns a copy of the string s with all Unicode letters mapped to their lower case. |
| func ToLower(s string) string { |
| return strings.ToLower(s) |
| } |
| |
| // Trim returns a slice of the string s with all leading and |
| // trailing Unicode code points contained in cutset removed. |
| func Trim(s string, cutset string) string { |
| return strings.Trim(s, cutset) |
| } |
| |
| // TrimLeft returns a slice of the string s with all leading |
| // Unicode code points contained in cutset removed. |
| // |
| // To remove a prefix, use TrimPrefix instead. |
| func TrimLeft(s string, cutset string) string { |
| return strings.TrimLeft(s, cutset) |
| } |
| |
| // TrimRight returns a slice of the string s, with all trailing |
| // Unicode code points contained in cutset removed. |
| // |
| // To remove a suffix, use TrimSuffix instead. |
| func TrimRight(s string, cutset string) string { |
| return strings.TrimRight(s, cutset) |
| } |
| |
| // TrimSpace returns a slice of the string s, with all leading |
| // and trailing white space removed, as defined by Unicode. |
| func TrimSpace(s string) string { |
| return strings.TrimSpace(s) |
| } |
| |
| // TrimPrefix returns s without the provided leading prefix string. |
| // If s doesn't start with prefix, s is returned unchanged. |
| func TrimPrefix(s, prefix string) string { |
| return strings.TrimPrefix(s, prefix) |
| } |
| |
| // TrimSuffix returns s without the provided trailing suffix string. |
| // If s doesn't end with suffix, s is returned unchanged. |
| func TrimSuffix(s, suffix string) string { |
| return strings.TrimSuffix(s, suffix) |
| } |
| |
| // Replace returns a copy of the string s with the first n |
| // non-overlapping instances of old replaced by new. |
| // If old is empty, it matches at the beginning of the string |
| // and after each UTF-8 sequence, yielding up to k+1 replacements |
| // for a k-rune string. |
| // If n < 0, there is no limit on the number of replacements. |
| func Replace(s, old, new string, n int) string { |
| return strings.Replace(s, old, new, n) |
| } |
| |
| // Index returns the index of the first instance of substr in s, or -1 if substr is not present in s. |
| func Index(s, substr string) int { |
| return strings.Index(s, substr) |
| } |