Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP
A simple priority queue service built with libevent.
Shell C Python
Tree: 88ad4d23be

Fetching latest commit…

Cannot retrieve the latest commit at this time

Failed to load latest commit information.
Makefile
README.markdown
barbershop.c
bst.c
bst.h
client.c

README.markdown

Barbershop

Barbershop is a fast, lightweight priority queue system for a specific use case that is undisclosed. The goal is to create a TCP/IP based service that uses libev(ent) to create a shifting priority queue.

Internally a list of items is tracked, each having a priority. Some connections to the daemon set/update item priorities while other connections want to pop something off of the list based on priority.

As items are added, the hash of items and priorities is updated.

TODO

  • Add next functionality.
  • Add stats structure and expose it.
  • Make fast and lightweight.
  • Clean up the binary search tree interface and make it items specific.
  • Move the scores container to it's own source file.
  • Create a legit benchmark tool.
  • Add input args to the client tool.
Something went wrong with that request. Please try again.