{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:golang/github.com/adrianbrad/queue","name":"github.com/adrianbrad/queue","description":"Package queue provides multiple thread-safe generic queue implementations.\nCurrently, there are 2 available implementations:\n\nA blocking queue, which provides methods that wait for the\nqueue to have available elements when attempting to retrieve an element, and\nwaits for a free slot when attempting to insert an element.\n\nA priority queue based on a container.Heap. The elements in the queue\nmust implement the Lesser interface, and are ordered based on the\nLess method. The head of the queue is always the highest priority element.\n\nA circular queue, which is a queue that uses a fixed-size slice as\nif it were connected end-to-end. When the queue is full, adding a new element to the queue\noverwrites the oldest element.\n\nA linked queue, implemented as a singly linked list, offering O(1)\ntime complexity for enqueue and dequeue operations. The queue maintains pointers\nto both the head (front) and tail (end) of the list for efficient operations\nwithout the need for traversal.","version":"v1.7.0","softwareVersion":"v1.7.0","license":"https://spdx.org/licenses/MIT","codeRepository":"https://github.com/adrianbrad/queue","issueTracker":"https://github.com/adrianbrad/queue/issues","url":"https://github.com/adrianbrad/queue","programmingLanguage":{"@type":"ComputerLanguage","name":"Go"},"dateCreated":"2022-09-01","dateModified":"2026-04-21","datePublished":"2026-04-21","copyrightYear":2022,"downloadUrl":"https://proxy.golang.org/github.com/adrianbrad/queue/@v/v1.7.0.zip","softwareHelp":{"@type":"WebSite","url":"https://pkg.go.dev/github.com/adrianbrad/queue#section-documentation"},"applicationCategory":"go","runtimePlatform":"go","developmentStatus":"active","sameAs":["https://pkg.go.dev/github.com/adrianbrad/queue"],"https://www.w3.org/ns/activitystreams#likes":206,"https://forgefed.org/ns#forks":12}