{"id":93699,"library":"depq","title":"Depq","description":"A Double-Ended Priority Queue library that supports insertion and deletion of elements with minimum and maximum priority, with tie-breaking by insertion order and priority updates.","status":"active","version":"0.7","language":"ruby","source_language":null,"source_url":"https://github.com/akr/depq","tags":["priority-queue","data-structure","algorithm","queue"],"install":[{"cmd":"gem install depq","lang":"bash","label":"gem install"},{"cmd":"# Gemfile\ngem 'depq', '~> 0.7'","lang":"ruby","label":"Gemfile"}],"dependencies":[],"imports":[{"symbol":"Depq","correct":"require 'depq'"}],"quickstart":{"code":"require 'depq'\nq = Depq.new\nq.push(3, 1)\nq.push(5, 2)\nputs q.min  # => 3\nputs q.max  # => 5","lang":"ruby","description":"Create a double-ended priority queue and retrieve min and max elements"},"warnings":[],"env_vars":null,"search_vec":"'algorithm':37 'break':24 'data':35 'data-structur':34 'delet':13 'depq':1 'doubl':4 'double-end':3 'element':15 'end':5 'insert':11,26 'librari':8 'maximum':19 'minimum':17 'order':27 'prioriti':6,20,29,32 'priority-queu':31 'queue':7,33,38 'structur':36 'support':10 'tie':23 'tie-break':22 'updat':30","created_at":"2026-06-19T09:54:23.730887+00:00","updated_at":"2026-06-19T09:54:23.730887+00:00","problems":[],"ecosystem":"rubygems","meta_description":null,"install_score":null,"quickstart_score":null,"quickstart_tag":null,"pypi_latest":null,"cli_name":null,"cli_version":null,"type":"library","homepage":"https://github.com/akr/depq","github":"https://github.com/akr/depq","docs":"http://www.rubydoc.info/gems/depq/","changelog":null,"pypi":null,"npm":null,"openapi_spec":null,"status_page":null,"smithery":null,"categories":["utility"],"base_url":null,"auth_type":null,"provenance":{"verified_status":null,"verified_at":null,"last_verified":"2026-06-19","next_check":"2026-12-16","install_tag":null}}