Deques for Mythryl based on finger trees, with amortized O(1) complexity, and O(log n) worst case operations. This code implements deques using finger trees. Previous implementations of deques (e.g. in Haskell) were based on 2-3 trees with size-annotating nodes. This code was written in Mythryl: http://www.mythryl.org * Description This implementation is based on finger trees of plain, always balanced binary trees; to this effect the finger structure has been modified to allow easy assembling and disassembling of trees, by intermixing trees with items. This should improve performance, and reduces code size by remove the need for additional rebalancing steps. * Copyright Copyright (c) 2012 Michele Bini <firstname.lastname@example.org> Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.