Equals returns true if a given slice has the same contents with the slice

Sort calls the build-in sort.Sort to sort data in the slice.

Add appends the specified element to the end of this slice.

BinarySearch searchs a specified element e in a *sorted* list with binary search algorithm. If the list values are not sorted, the return values are u

Add appends the specified element to the end of this slice.

Insert inserts specified elements at the specified position. NOTE: the insertion algorithm is much better than the slice-trick in go community wiki

Add appends the specified element to the end of this slice.

Add appends the specified element to the end of this slice.

Cols returns the number of columns

Fill sets the elements between from, inclusive, and to, exclusive, to a speicified value.

Rows returns the number of rows

Add appends string presentation of the specified elements to the end of this slice.

The Len method in sort.Interface.

WriteString appends the contents of str to the slice, growing the slice as needed. The return value n is the length of str; err is always nil.

In returns true if the specified element is in the set, false otherwise

LinePos returns a string of format "filename:pos" of a position in the source. For skip == 0, it returns the position of the caller (the line call Lin

ReadRune implements io.RuneReader interface.

InsertSlice inserts string presentation of elements of a slice at the specified position.

Merge merges the current *sorted* elements with another *sorted* slice of elements. All elements should be sorted by the same comparator.

NewStrSet creates a string set with specified elements. You need to use this function only when you want to create a StrSet with intial elements. Diff

RemoveRange removes all of the elements whose index is between from, inclusive, and to, exclusive, from this slice. The holes in the original slice ar

Equals checks whether the set has same elements with another set.

Read implements io.Reader interface. After some bytes are read, the slice shrinks.

The Swap method in sort.Interface.

* wrappers of path/filepath package */ Abs is a wrapper to filepath.Abs It returns an absolute representation of path. If the path is not absolute it

Clear sets the slice to an zero-length slice.

* Deepest returns the deepest non-NestedError error, which is the original cause error. */

Elements returns all elements in the set as a string slice. NOTE the order of elements may change even if the set doesnot change.

Insert inserts the specified element at the specified position. NOTE: the insertion algorithm is much better than the slice-trick in go community wiki

InsertSlice inserts the elements of a slice at the specified position. This method is useful when some elements in a slice *NOT* of type []interface{}

NewIntMatrix creates a new IntMatrix instance with specified number of rows and columns

Write implements io.Writer interface Bytes are appended to the tail of the slice.

Clear sets the slice to an zero-length slice.

Clear removes all of the elements from this slice.

Clone clones an IntMatrix

Close implements io.Closer interface. It does nothing.

Delete removes elements from the set

Ext is a wrapper to filepath.Ext

Fill sets the elements between from, inclusive, and to, exclusive, to a speicified value.

Fill sets the elements between from, inclusive, and to, exclusive, to a speicified value.

Insert inserts string presentation of the specified elements at the specified position. NOTE: the insertion algorithm is much better than the slice-tr

Insert inserts the specified element at the specified position. NOTE: the insertion algorithm is much better than the slice-trick in go community wiki

Join connect elems to the tail of path

* NestErrorf returns nil if err == nil, otherwise it returns a *NestedError error with a formatted message */

Pop retrieves and removes the head of this queue, or returns nil if this queue is empty.

Pop retrieves and removes the head of this queue, or returns nil if this queue is empty.

Pop removes the minimum element (according to Less) from the heap and place it at the last element of the heap. The complexity is O(log(n)) where n =

Push pushes the last element of the heap, which is considered not as the part of the heap, onto the heap. The complexity is O(log(n)) where n = h.Len(

Put adds elements to the set. The set can be nil

Remove removes the element at the specified position in this slice. The hole in the original slice is filled with a zero value.

Remove removes the element at the specified position in this slice.

Remove removes the element at the specified position in this slice. The hole in the original slice is filled with a nil value.

Remove removes the element at the specified position in this slice.

Remove removes the element at the specified position in this slice.

RemoveRange removes all of the elements whose index is between from, inclusive, and to, exclusive, from this slice. The holes in the original slice ar

RemoveRange removes all of the elements whose index is between from, inclusive, and to, exclusive, from this slice.

Deprecated. Use sortp.SortF in "github.com/golangplus/sort" instead.

Stat is a wrappter to os.Stat

String returns the string presentation of the set

WriteItoa converts i into text of the specified base and write to s.

WriteRune writes a single Unicode code point, returning the number of bytes written and any error.

* AssertStrSetEquals shows error message when act and exp are equal string sets. */

Base returns the last element of path. Trailing path separators are removed before extracting the last element. If the path is empty, Base returns "."

Clear removes all of the elements from this slice.

Clear removes all of the elements from this slice.

DiffSlicePair compares two sorted slices, returns the difference of each relative to the other.

Do calls the function f if and only if the method is being called for the first time with this receiver. In other words, given var once Once{F: f} if

Error implements error interface

Fill sets the elements between from, inclusive, and to, exclusive, to a speicified value.

Fill sets the elements between from, inclusive, and to, exclusive, to a speicified value.

Fill sets all elements of the matrix to a specified value

Get fetches the object from the box atomically

Insert inserts the specified element at the specified position. NOTE: the insertion algorithm is much better than the slice-trick in go community wiki

Len returns the number of elements in this queue.

Len returns the number of elements in this queue.

MapKeyAsStrings returns the keys of a map as a string slice. if m is not a map, it panics. Keys are extracted by reflection which doesn't guarentee th

NewIntPriorityQueue creates a IntPriorityQueue instance with a specified campare function.

NewIntPriorityQueueCap creates a IntPriorityQueue instance with a specified compare function and a capacity

NewPriorityQueue creates a PriorityQueue instance with a specified compare function.

NewPriorityQueue creates a PriorityQueue instance with a specified compare function and a capacity

Open is a wrapper to os.Open. It opens the named file for reading. If successful, methods on the returned file can be used for reading; the associate

Peek retrieves the head of this queue, or returns 0 if this queue is empty.

Peek retrieves the head of this queue, or returns nil if this queue is empty.

The Pop method in heap.Interface.

PrettyString returns a pretty text form of the matrix. This function is mainly for debugging.

Push inserts the specified element into this priority queue.

The Push method in heap.Interface.

Push inserts the specified element into this priority queue.