go.uber.org/yarpc@v1.72.1/internal/humanize/join.go (about)

     1  // Copyright (c) 2022 Uber Technologies, Inc.
     2  //
     3  // Permission is hereby granted, free of charge, to any person obtaining a copy
     4  // of this software and associated documentation files (the "Software"), to deal
     5  // in the Software without restriction, including without limitation the rights
     6  // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
     7  // copies of the Software, and to permit persons to whom the Software is
     8  // furnished to do so, subject to the following conditions:
     9  //
    10  // The above copyright notice and this permission notice shall be included in
    11  // all copies or substantial portions of the Software.
    12  //
    13  // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
    14  // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
    15  // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
    16  // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
    17  // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
    18  // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
    19  // THE SOFTWARE.
    20  
    21  package humanize
    22  
    23  import "fmt"
    24  
    25  // QuotedJoin transforms a list of terms into an English (Chicago Manual Style)
    26  // serial comma delimited list with the given conjunction ("and", "or") and
    27  // each term enquoted.
    28  // It displays the "none" case if the list is empty, like "no soup".
    29  func QuotedJoin(terms []string, conjunction, none string) string {
    30  	switch len(terms) {
    31  	case 0:
    32  		return none
    33  	case 1:
    34  		return fmt.Sprintf("%q", terms[0])
    35  	case 2:
    36  		return fmt.Sprintf("%q %s %q", terms[0], conjunction, terms[1])
    37  	default:
    38  		i := 1
    39  		inner := ""
    40  		for ; i < len(terms)-1; i++ {
    41  			inner = fmt.Sprintf("%s, %q", inner, terms[i])
    42  		}
    43  		// first, inner, inner, and/or last
    44  		return fmt.Sprintf("%q%s, %s %q", terms[0], inner, conjunction, terms[i])
    45  	}
    46  }