naturalsort

README

naturalsort

A simple natural string sorter for Go.

##Usage Implements the sort.Interface

called by sort.Sort(NaturalSort([]string)) ###Example

SampleStringArray := []string{
                       "z24", "z2", "z15", "z1",
                       "z3", "z20", "z5", "z11",
                       "z 21", "z22"}
sort.Sort(NaturalSort(SampleStringArray))

##Needless Description Inspired by Jeff Atwood's seminal blog post and structured similarly to Ian Griffiths' C# implementation. This uses a regex to split the numeric and non-numeric portions of the string into a chunky array. Next, the left and right sides' chunks are compared either by string comparrison (if either chunk is a non-numeric), or by integer (if both chunks are numeric) a character-by-character iterative function that compares numerical strings

Documentation

Index

• type NaturalSort
  • func (s NaturalSort) Len() int
  • func (s NaturalSort) Less(i, j int) bool
  • func (s NaturalSort) Swap(i, j int)

Types

type NaturalSort

type NaturalSort []string

func (NaturalSort) Len

func (s NaturalSort) Len() int

func (NaturalSort) Less

func (s NaturalSort) Less(i, j int) bool

func (NaturalSort) Swap

func (s NaturalSort) Swap(i, j int)