In my spare time I have been reading about Go, and going through video and blog tutorials to try to get some experience with the language. I've bee...
For further actions, you may consider blocking this person and/or reporting abuse
A day or two ago I made github.com/nektro/sdrie which is a single file library to make a
map
object that allows you to set an expiration on the keys.Internally there is a native
map
protected with a semaphore that stores the actual data as well as alist
that keeps a linked list of the currently active keys.Currently, in the background, it loops through the list and checks if the associated key in the map is supposed to be dead. However, the ideal situation would be for the list to be in order of expiration, so that the loop only has to check the first one instead of the entire thing.
If you'd like to tackle this, I'd be happy to accept the contribution/help you through it. 💜 If you have any questions, feel free to message me!
Okay, I would like to follow up on this. Follow back for DM
Few things to clarify:
line *list.List -> is used only for removing the keys based on its expiration as a storage?
We might use min heap and check if the root is still alive or not and delete it?
I've been working on a tool for taking notes in the terminal. It's still early stages and I'm also a beginner in Go.
You could take a look at it here if you're interested: github.com/noculture/notes
Hi Rapulu, awesome-beginners has a list divided by programming language, including Go.
It might help :)
lol, Thanks but I don't think I can handle them.
PRs welcome:
github.com/theodesp/go-heaps
issuehunt.io/repos?search=go
Here is a list of open-source projects on golang - devglan.com/programming/golang-ope...