Giter Club home page Giter Club logo

gogu's Introduction

Hi there ๐Ÿ‘‹

I'm Endre Simo, a software developer and open source enthusiast, having a deep passion for image processing, computer vision, real time and data intensive applications.

My Github account statistics:

github stats language stats

gogu's People

Contributors

actions-user avatar ernyoke avatar esimov avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar  avatar  avatar

gogu's Issues

[Feature Request] Provide implementation for LRU cache

Least recently used (LRU) cache is a data structure which provides O(1) time access for any stored value based on a key, while having the ability to provide an O(1) access to the last used value as well. The size of the cache is limited, when this limit is reached, the oldest values will be evicted.

A possible implementation for this data structure can be found in this PR: #4

Depending on your choice, it could be merged, or you could discard it and use it as a basis of a possible future implementation.

Both `slist` and `dlist` have methods which return unexported return types

Both slist and dlist have exported (public) methods which do return the inner implementation of their "node" type.

For example:

func (l *DList[T]) Unshift(data T) *doubleNode[T] {

This can be solved in two ways:

  1. Making singleNode and doubleNode public by exporting them;
  2. Avoid having to return these types for exported methods. Since singleNode and doubleNode are part of the inner implementation of their corresponding list, usually these types should be private. For example, if the take a look at the Java OpenJDK implementation of the LinkedList from the static library, we can see that the Node class is private and it is not used as a return type for anything which part of the public API. I suggest, having the same approach here as well.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.