gotamer/tuple A tuple is an ordered list of mixed type elements

Copyright © 2013 Dennis T Kaplan <http://www.robotamer.com>

Use of this source code is governed by a MIT style license that can be found in the README file.

type Tuple struct {
    T map[uint]interface{}
    // contains filtered or unexported fields
}

func New(i ...interface{}) (t *Tuple)

New will create and fill a Tuple with v mixed values

func (t *Tuple) Add(v interface{}) uint

Add will append a value to your Tuple and return its key

func (t *Tuple) Del(k uint)

Del will remove the entry with the given index key k, and reindex the keys

func (t *Tuple) Edit(k uint, v interface{})

Here for backwords compatibility

func (t *Tuple) Find(i interface{}) (k uint)

Find will return the index key for the given value i

func (t *Tuple) Get(k uint) interface{}

Get will return the value of the given index key k

func (t *Tuple) Has(i interface{}) bool

Has will check if an elemet exists

func (t *Tuple) Keys() []uint

Keys returns a slice list of keys from the given Tuple

func (t *Tuple) Len() uint

Len will return the count of items in the tuple A Tuple with index keys from 0 to 5 returns length of 6

func (t *Tuple) Max() (m uint)

Max returns the largest key from the given Tuple

func (t *Tuple) Min() (m uint)

Min returns the smallest key from the given Tuple

func (t *Tuple) Purge(k uint)

Purge will remove the entry with the given index key k, and reindex the keys

func (t *Tuple) ReKey()

ReKey will reindex the keys

func (t *Tuple) Set(k uint, v interface{})

Set will replace the value of the given key k with the given value v

func (t *Tuple) Walker() (c chan interface{})

The Walker() iterates over the Tuple map and returns them in FIFO order.

for i := range Walker() {
	fmt.Println(i)
}

func (t *Tuple) Walker2() (c chan interface{})

The Walker() iterates over the Tuple map and returns them in FIFO order.

for i := range Walker() {
	fmt.Println(i)
}

bitbucket.org/gotamer/tuple