igushev's comments

igushev | 6 years ago | on: When a Startup Should and Should Not Hire Contractors

The article is about startups mostly. There’re lots of non-technical founders who think they can outsource everything and build a company and it won’t work. I tried to provide some guidelines in the article.

igushev | 6 years ago | on: Show HN: Frontend in the Cloud – Native Mobile Apps on Python – Open-Source

If someone interested to learn more or collaborate, happy to chat!

igushev | 6 years ago | on: Show HN: Frontend in the Cloud – Native Mobile Apps on Python – Open-Source

https://github.com/igushev/fase_lib — Fase library to develop the server of a Fase Service;

https://github.com/igushev/fase_ios — iOS client for a Fase Service;

https://github.com/igushev/fase_android — Android client for a Fase Service;

Examples of Fase Services:

https://github.com/igushev/notes_fase — Saves and synchronizes notes.

igushev | 6 years ago | on: Show HN: Social Service for Internet Unified Reputation and Real Small Gifts

Any feedback is welcomed!

igushev | 6 years ago | on: Show HN: Array with Constant Time Access and Fast Insertion and Deletion

I also found out about tiered vectors only in this thread. At the time of implementation I tried to Google for something like this but didn't find.

igushev | 6 years ago | on: Show HN: Array with Constant Time Access and Fast Insertion and Deletion

I mentioned that extension in the published paper, but complexity of access becomes O(d) where d is number of dimensions.

igushev | 6 years ago | on: Show HN: Array with Constant Time Access and Fast Insertion and Deletion

Yes, the structure is sensitive for that and benefits a lot from using reserve(). I need to add automatic restructuring to maintain perfect k.

igushev | 6 years ago | on: Show HN: Array with Constant Time Access and Fast Insertion and Deletion

It seems I need to add automatic restructuring to the structure, so it would maintain perfect lengths of DEQs

igushev | 6 years ago | on: Show HN: Array with Constant Time Access and Fast Insertion and Deletion

I also need to add automatic restructuring when it expands or shrinks significantly.

igushev | 6 years ago | on: Show HN: Array with Constant Time Access and Fast Insertion and Deletion

Thanks for feedback!

igushev | 6 years ago | on: Show HN: Array with Constant Time Access and Fast Insertion and Deletion

There is a disclaimer about that: https://github.com/igushev/IgushArray#limitations

igushev | 6 years ago | on: Show HN: Array with Constant Time Access and Fast Insertion and Deletion

Interesting that some people found an article about tiered vectors, I didn't find it back then. I implemented this structure many many years ago and also published in Bauman Moscow State Technical University magazine back in 2012: http://engjournal.ru/articles/101/101.pdf (in Russian)

igushev | 6 years ago | on: Show HN: Array with Constant Time Access and Fast Insertion and Deletion

That is true. The complexities in Big O notations, but I put all real-life measurements in README.md, so readers could see. On small item counts the complexity of data structure itself makes it performs worse comparing to std::vectors, only on large item counts it performs betters. Note that access is slower then std::vector due to complexity of data structure but multiplier is always the same.

igushev | 6 years ago | on: Show HN: Array with Constant Time Access and Fast Insertion and Deletion

That's a good point. That would make computation of indexes much more complicated though

igushev | 6 years ago | on: Show HN: Array with Constant Time Access and Fast Insertion and Deletion

That sounds like trees are silver bullets but they're not and that's why we have variety of basic data structures.

igushev | 6 years ago | on: Show HN: Array with Constant Time Access and Fast Insertion and Deletion

Thanks for feedback! Any naming suggestions? :-)

igushev | 6 years ago | on: Show HN: Array with Constant Time Access and Fast Insertion and Deletion

Thanks for feedback! I’ll update the README.md

igushev | 6 years ago | on: Show HN: Array with Constant Time Access and Fast Insertion and Deletion

DEQs also allocate internal arrays with hardcoded size only (8 in std, if I remember correctly)

igushev | 6 years ago | on: Show HN: Array with Constant Time Access and Fast Insertion and Deletion

I need to read the paper, but on high-level looks indeed similar.

igushev | 6 years ago | on: Show HN: Array with Constant Time Access and Fast Insertion and Deletion

Correct. I need to add automatic restructuring. Currently structure sensitive and benefits a lot from using reserve() method