Popularity

1.6

Growing

Activity

0.0

Stable

Stars 13

Watchers 2

Forks 4

Last Commit over 2 years ago

Programming language: Go

License: MIT License

Tags: Data Structures

Latest version: v0.3.0

goterator alternatives and similar packages

Based on the "Data Structures" category.
Alternatively, view goterator alternatives based on common mentions on social networks and blogs.

gods

9.8 5.1 goterator VS gods

GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
go-datastructures

9.5 0.0 goterator VS go-datastructures

A collection of useful, performant, and threadsafe Go datastructures.

Access the most powerful time series database as a service

Ingest, store, & analyze all types of time series data in a fully-managed, purpose-built database. Keep data forever with low-cost storage and superior data compression.

Promo www.influxdata.com

golang-set

8.7 3.2 goterator VS golang-set

A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
gota

8.6 0.0 goterator VS gota

Gota: DataFrames and data wrangling in Go (Golang)
FSM for Go

8.4 3.8 goterator VS FSM for Go

Finite State Machine for Go
roaring

8.3 3.5 goterator VS roaring

Roaring bitmaps in Go (golang)
willf/bloom

8.2 6.8 goterator VS willf/bloom

Go package implementing Bloom filters
gocache

8.1 5.7 goterator VS gocache

☔️ A complete Go cache library that brings you multiple ways of managing your caches
boomfilters

7.9 0.0 goterator VS boomfilters

Probabilistic data structures for processing continuous, unbounded streams.
bitset

7.6 3.2 goterator VS bitset

Go package implementing bitsets
cuckoofilter

7.4 0.0 goterator VS cuckoofilter

Cuckoo Filter: Practically Better Than Bloom
gostl

7.3 0.0 goterator VS gostl

Data structure and algorithm library for go, designed to provide functions similar to C++ STL
hyperloglog

7.2 0.0 goterator VS hyperloglog

HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
algorithms

7.2 0.0 goterator VS algorithms

CLRS study. Codes are written with golang.
trie

7.1 0.0 goterator VS trie

Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
merkletree

6.7 0.0 goterator VS merkletree

A Merkle Tree implementation written in Go.
ttlcache

6.5 6.4 goterator VS ttlcache

An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
go-geoindex

6.5 0.0 goterator VS go-geoindex

Go native library for fast point tracking and K-Nearest queries
conjungo

6.2 0.0 goterator VS conjungo

A small flexible merge library in go
hilbert

6.0 0.0 goterator VS hilbert

Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.
mafsa

6.0 0.0 goterator VS mafsa

MA-FSA implementation with Minimal Perfect Hashing
Bloomfilter

6.0 0.0 goterator VS Bloomfilter

Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go
goskiplist

5.9 0.0 goterator VS goskiplist

A skip list implementation in Go
go-adaptive-radix-tree

5.9 0.0 goterator VS go-adaptive-radix-tree

Adaptive Radix Trees implemented in Go
levenshtein

5.7 0.0 goterator VS levenshtein

Go implementation to calculate Levenshtein Distance.
goconcurrentqueue

5.7 0.0 goterator VS goconcurrentqueue

Go concurrent-safe, goroutine-safe, thread-safe queue
binpacker

5.5 0.0 goterator VS binpacker

A binary stream packer and unpacker
cuckoo-filter

5.5 0.0 goterator VS cuckoo-filter

Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现，优于布隆过滤器，可以定制化过滤器参数，并进行了空间优化
bitmap

5.3 3.1 goterator VS bitmap

Simple dense bitmap index in Go with binary operators
bit

5.1 0.0 goterator VS bit

Bitset data structure
iter

5.0 0.0 goterator VS iter

Go implementation of C++ STL iterators and algorithms.
bloom

4.9 0.0 goterator VS bloom

Bloom filters implemented in Go.
encoding

4.7 0.0 goterator VS encoding

Integer Compression Libraries for Go
ring

4.6 0.0 goterator VS ring

Package ring provides a high performance and thread safe Go implementation of a bloom filter.
skiplist

4.4 0.0 goterator VS skiplist

skiplist for golang
go-rquad

4.4 0.0 goterator VS go-rquad

:pushpin: State of the art point location and neighbour finding algorithms for region quadtrees, in Go
remember-go

4.4 0.0 goterator VS remember-go

Cache Slow Database Queries
deque

4.4 5.8 goterator VS deque

A highly optimized double-ended queue
go-mcache

4.2 0.0 goterator VS go-mcache

Fast in-memory key:value store/cache with TTL
crunch

4.0 0.0 goterator VS crunch

take bytes out of things easily ✨🍪
set

3.8 0.0 goterator VS set

A simple Set data structure implementation in Go (Golang) using LinkedHashMap.
nan

3.7 0.0 goterator VS nan

Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers
memlog

3.7 0.0 goterator VS memlog

A Kafka log inspired in-memory and append-only data structure
goset

3.4 0.0 goterator VS goset

Set is a useful collection but there is no built-in implementation in Go lang.
timedmap

3.4 0.0 goterator VS timedmap

A thread safe map which has expiring key-value pairs.
count-min-log

3.2 0.0 goterator VS count-min-log

Go implementation of Count-Min-Log
hide

3.2 0.0 goterator VS hide

ID type with marshalling to/from hash to prevent sending IDs to clients.
ptrie

3.1 0.0 goterator VS ptrie

A prefix tree implementation in go
cmap

3.1 1.2 goterator VS cmap

a thread-safe concurrent map for go
pipeline

3.0 0.0 goterator VS pipeline

Pipelines using goroutines

Do you think we are missing an alternative of goterator or a related project?

Add another 'Data Structures' Package

Popular Comparisons

README

Goterator

Iterator implementation for Golang to provide map and reduce functionalities.

Package

import (
    "github.com/yaa110/goterator"
    "github.com/yaa110/goterator/generator"
)

Getting Started

Create a generator from slices

words := []interface{}{"an", "example", "of", "goterator"}

gen := generator.NewSlice(words)

Create a generator from channels

chn := make(chan interface{}, 4)
chn <- "an"
chn <- "example"
chn <- "of"
chn <- "goterator"
close(chn)

gen := generator.NewChannel(chn)

Create custom generators

type TestGenerator struct {
    words []string
    i     int
    value string
}

func (g *TestGenerator) Next() bool {
    if g.i == len(g.words) {
        return false
    }
    g.value = g.words[g.i]
    g.i++
    return true
}

func (g *TestGenerator) Value() interface{} {
    return g.value
}

gen := &TestGenerator{
    words: []string{"an", "example", "of", "goterator"},
    i: 0,
    value: "",
}

Iterate over generators

lengths := goterator.New(gen).Map(func(word interface{}) interface{} {
    return len(word.(string))
}).Collect()

assert.Equal([]interface{}{2, 7, 2, 9}, lengths)

Please for more information about mappers and reducers (consumers) check the documentation.