go-datastructures

go-datastructures copied to clipboard

ringbuffer: dif is never less than zero

1

Since dif is of type uint64, it can never be less than 0. Instead, when attempting to put an item into a full queue or get an item from an...

YutaMiyake

Clean code and fix issues reported by staticcheck

5

sarroutbi

first try

1

tannermiller-wf

fix some typos

1

cuishuang

Adds generic binary heap and d-ary heap

5

Adds generic binary heap and d-ary heap. After a quick look into the what's already provided in this project, I didn't find those more basic datastructures. I thought they could...

Florimond

Queue Get func

1

When the queue is empty and you use Get I get a strange error instead of ErrEmptyQueue error and please add any error when using Get will output a shorter...

Maxi135798642

State of rtree different after insert/delete (0,0,0,0) and insert/delete (0,0,10,10)

3

The state of rtree is different after insert/delete (0,0,0,0) and insert/delete (0,0,10,10). The difference is that maxHilbert changed from 0 to 34 in the (0,0,10,10) case. Is this intentional or...

Robert-M-Muench

RingBuffer with a size of 1 should not be allowed due to an insert bug, so increment a size of one, by one.

2

RingBuffer with a size of 1 will have a mask of 0 which uncovers a bug in the algorithm since the mask value must only contain ones (left padded with...

hedisam

migrating to go module system

2

viggin543

Change traverse implemention to in-order traverse

2

the current traverse implemention has several weakness: 1. unable to stop traverse, thus unable to reduce traverse time complexity around O(logN) 2. out-of-order, ordinary traverse method should be pre-order, in-order,...

qiuchengxuan