Hoogle Search
Within LTS Haskell 24.42 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
LambdaHack Game.LambdaHack.Server.Fov No documentation available.
PerceptionCache :: FovValid CacheBeforeLucid -> PerActor -> PerceptionCacheLambdaHack Game.LambdaHack.Server.Fov No documentation available.
-
LambdaHack Game.LambdaHack.Server.FovDigital Progress along an arc with a constant distance from (0, 0).
module Game.LambdaHack.Server.
PeriodicM Server operations performed periodically in the game loop and related operations.
module Game.LambdaHack.Server.
ProtocolM The server definitions for the server-client communication protocol.
-
OpenAL Sound.OpenAL.AL.Source No documentation available.
-
OpenAL Sound.OpenAL.AL.Source No documentation available.
-
Priority Search Queue A priority search queue efficiently supports the operations of both a search tree and a priority queue. A Binding is a product of a key and a priority. Bindings can be inserted, deleted, modified and queried in logarithmic time, and the binding with the least priority can be retrieved in constant time. A queue can be built from a list of bindings, sorted by keys, in linear time.
-
A priority search queue (henceforth queue) efficiently supports the operations of both a search tree and a priority queue. A Binding is a product of a key and a priority. Bindings can be inserted, deleted, modified and queried in logarithmic time, and the binding with the least priority can be retrieved in constant time. A queue can be built from a list of bindings, sorted by keys, in linear time. This implementation is due to Ralf Hinze.
-
PSQueue Data.PSQueue A mapping from keys k to priorites p.