Re: [go-nuts] The most performant deque of all time?

gt;>> Regards > >>> > >>> > >>> ===== > >>> Freddy Martínez García > >>> Software Engineer > >>> B.S. Computer Science > >>> LinkedIn: https://ar.linkedin.com/in/freddy-m

Re: [go-nuts] The most performant deque of all time?

> have an additional 400 lines of integration tests - if those are full > coverage they should be more than enough IMO, but again, just something to > think about and to each his own. > > > > On Nov 26, 2018, at 9:56 PM, Christian Petrin > wrote: > > Moved the non-uni

Re: [go-nuts] The most performant deque of all time?

actored - all of those types > of tests break. > > I’m of the opinion - test the behavior comprehensively, and expose > the expected usage (and corresponding design) there. > > > On Nov 26, 2018, at 11:58 AM, Christian Petrin il.com> wrote: > > Hi Robert, > > th

Re: [go-nuts] The most performant deque of all time?

ot in a different _test package) it > seems it was a mistake, as they still only exercise the public API - > that’s a hint to me that you are doing something wrong. > > > > On Nov 26, 2018, at 2:34 PM, Christian Petrin > wrote: > > It's funny because I'

Re: [go-nuts] The most performant deque of all time?

k. > > I’m of the opinion - test the behavior comprehensively, and expose the > expected usage (and corresponding design) there. > > On Nov 26, 2018, at 11:58 AM, Christian Petrin > wrote: > > Hi Robert, > > the deque has unit, integration and API tests. The unit tests, I a

Re: [go-nuts] The most performant deque of all time?

at they cannot access > the internal details. This makes them brittle and hard to follow. > > For reference, look at the Go stdlib sync/map.go and sync/map_test.go. All > of the tests are in sync_test for all of the structs/methods. > > > On Nov 26, 2018, at 10:59 AM, Christian

[go-nuts] The most performant deque of all time?

Hello, I'm working on a logging system called CloudLogger and to cut to the chase, CloudLogger needs an unbounded in-memory queue. The idea is to use the queue as a sequential data store. As there's no telling beforehand how much data will need to be stor