<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html>
<head>
<!-- Generated by HsColour, http://www.cs.york.ac.uk/fp/darcs/hscolour/ -->
<title>Graphics/UI/Gtk/ModelView/TreeStore.hs</title>
<link type='text/css' rel='stylesheet' href='hscolour.css' />
</head>
<body>
<pre><a name="line-1"></a><span class='hs-comment'>-- -*-haskell-*-</span>
<a name="line-2"></a><span class='hs-comment'>-- GIMP Toolkit (GTK) CustomStore TreeModel</span>
<a name="line-3"></a><span class='hs-comment'>--</span>
<a name="line-4"></a><span class='hs-comment'>-- Author : Duncan Coutts, Axel Simon</span>
<a name="line-5"></a><span class='hs-comment'>--</span>
<a name="line-6"></a><span class='hs-comment'>-- Created: 11 Feburary 2006</span>
<a name="line-7"></a><span class='hs-comment'>--</span>
<a name="line-8"></a><span class='hs-comment'>-- Copyright (C) 2005 Duncan Coutts, Axel Simon</span>
<a name="line-9"></a><span class='hs-comment'>--</span>
<a name="line-10"></a><span class='hs-comment'>-- This library is free software; you can redistribute it and/or</span>
<a name="line-11"></a><span class='hs-comment'>-- modify it under the terms of the GNU Lesser General Public</span>
<a name="line-12"></a><span class='hs-comment'>-- License as published by the Free Software Foundation; either</span>
<a name="line-13"></a><span class='hs-comment'>-- version 2.1 of the License, or (at your option) any later version.</span>
<a name="line-14"></a><span class='hs-comment'>--</span>
<a name="line-15"></a><span class='hs-comment'>-- This library is distributed in the hope that it will be useful,</span>
<a name="line-16"></a><span class='hs-comment'>-- but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="line-17"></a><span class='hs-comment'>-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span>
<a name="line-18"></a><span class='hs-comment'>-- Lesser General Public License for more details.</span>
<a name="line-19"></a><span class='hs-comment'>--</span>
<a name="line-20"></a><span class='hs-comment'>-- |</span>
<a name="line-21"></a><span class='hs-comment'>-- Maintainer : gtk2hs-users@lists.sourceforge.net</span>
<a name="line-22"></a><span class='hs-comment'>-- Stability : provisional</span>
<a name="line-23"></a><span class='hs-comment'>-- Portability : portable (depends on GHC)</span>
<a name="line-24"></a><span class='hs-comment'>--</span>
<a name="line-25"></a><span class='hs-comment'>-- Standard model to store hierarchical data.</span>
<a name="line-26"></a><span class='hs-comment'>--</span>
<a name="line-27"></a><span class='hs-keyword'>module</span> <span class='hs-conid'>Graphics</span><span class='hs-varop'>.</span><span class='hs-conid'>UI</span><span class='hs-varop'>.</span><span class='hs-conid'>Gtk</span><span class='hs-varop'>.</span><span class='hs-conid'>ModelView</span><span class='hs-varop'>.</span><span class='hs-conid'>TreeStore</span> <span class='hs-layout'>(</span>
<a name="line-28"></a>
<a name="line-29"></a><span class='hs-comment'>-- * Types</span>
<a name="line-30"></a> <span class='hs-conid'>TreeStore</span><span class='hs-layout'>,</span>
<a name="line-31"></a>
<a name="line-32"></a><span class='hs-comment'>-- * Constructors</span>
<a name="line-33"></a> <span class='hs-varid'>treeStoreNew</span><span class='hs-layout'>,</span>
<a name="line-34"></a> <span class='hs-varid'>treeStoreNewDND</span><span class='hs-layout'>,</span>
<a name="line-35"></a>
<a name="line-36"></a><span class='hs-comment'>-- * Implementation of Interfaces</span>
<a name="line-37"></a> <span class='hs-varid'>treeStoreDefaultDragSourceIface</span><span class='hs-layout'>,</span>
<a name="line-38"></a> <span class='hs-varid'>treeStoreDefaultDragDestIface</span><span class='hs-layout'>,</span>
<a name="line-39"></a>
<a name="line-40"></a><span class='hs-comment'>-- * Methods</span>
<a name="line-41"></a> <span class='hs-varid'>treeStoreGetValue</span><span class='hs-layout'>,</span>
<a name="line-42"></a> <span class='hs-varid'>treeStoreGetTree</span><span class='hs-layout'>,</span>
<a name="line-43"></a> <span class='hs-varid'>treeStoreLookup</span><span class='hs-layout'>,</span>
<a name="line-44"></a>
<a name="line-45"></a> <span class='hs-varid'>treeStoreSetValue</span><span class='hs-layout'>,</span>
<a name="line-46"></a>
<a name="line-47"></a> <span class='hs-varid'>treeStoreInsert</span><span class='hs-layout'>,</span>
<a name="line-48"></a> <span class='hs-varid'>treeStoreInsertTree</span><span class='hs-layout'>,</span>
<a name="line-49"></a> <span class='hs-varid'>treeStoreInsertForest</span><span class='hs-layout'>,</span>
<a name="line-50"></a>
<a name="line-51"></a> <span class='hs-varid'>treeStoreRemove</span><span class='hs-layout'>,</span>
<a name="line-52"></a> <span class='hs-varid'>treeStoreClear</span><span class='hs-layout'>,</span>
<a name="line-53"></a>
<a name="line-54"></a> <span class='hs-varid'>treeStoreChange</span><span class='hs-layout'>,</span>
<a name="line-55"></a> <span class='hs-varid'>treeStoreChangeM</span><span class='hs-layout'>,</span>
<a name="line-56"></a> <span class='hs-layout'>)</span> <span class='hs-keyword'>where</span>
<a name="line-57"></a>
<a name="line-58"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>Bits</span>
<a name="line-59"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>Word</span> <span class='hs-layout'>(</span><span class='hs-conid'>Word</span><span class='hs-layout'>)</span>
<a name="line-60"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>Maybe</span> <span class='hs-layout'>(</span> <span class='hs-varid'>fromMaybe</span><span class='hs-layout'>,</span> <span class='hs-varid'>isJust</span> <span class='hs-layout'>)</span>
<a name="line-61"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>Tree</span>
<a name="line-62"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Control</span><span class='hs-varop'>.</span><span class='hs-conid'>Monad</span> <span class='hs-layout'>(</span> <span class='hs-varid'>liftM</span><span class='hs-layout'>,</span> <span class='hs-varid'>when</span> <span class='hs-layout'>)</span>
<a name="line-63"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Control</span><span class='hs-varop'>.</span><span class='hs-conid'>Exception</span> <span class='hs-layout'>(</span><span class='hs-varid'>assert</span><span class='hs-layout'>)</span>
<a name="line-64"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>IORef</span>
<a name="line-65"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Graphics</span><span class='hs-varop'>.</span><span class='hs-conid'>UI</span><span class='hs-varop'>.</span><span class='hs-conid'>Gtk</span><span class='hs-varop'>.</span><span class='hs-conid'>ModelView</span><span class='hs-varop'>.</span><span class='hs-conid'>Types</span>
<a name="line-66"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Graphics</span><span class='hs-varop'>.</span><span class='hs-conid'>UI</span><span class='hs-varop'>.</span><span class='hs-conid'>Gtk</span><span class='hs-varop'>.</span><span class='hs-conid'>Types</span> <span class='hs-layout'>(</span><span class='hs-conid'>GObjectClass</span><span class='hs-layout'>(</span><span class='hs-keyglyph'>..</span><span class='hs-layout'>)</span><span class='hs-layout'>,</span> <span class='hs-conid'>TreeModelClass</span><span class='hs-layout'>)</span>
<a name="line-67"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Graphics</span><span class='hs-varop'>.</span><span class='hs-conid'>UI</span><span class='hs-varop'>.</span><span class='hs-conid'>Gtk</span><span class='hs-varop'>.</span><span class='hs-conid'>ModelView</span><span class='hs-varop'>.</span><span class='hs-conid'>CustomStore</span>
<a name="line-68"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Graphics</span><span class='hs-varop'>.</span><span class='hs-conid'>UI</span><span class='hs-varop'>.</span><span class='hs-conid'>Gtk</span><span class='hs-varop'>.</span><span class='hs-conid'>ModelView</span><span class='hs-varop'>.</span><span class='hs-conid'>TreeModel</span>
<a name="line-69"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Graphics</span><span class='hs-varop'>.</span><span class='hs-conid'>UI</span><span class='hs-varop'>.</span><span class='hs-conid'>Gtk</span><span class='hs-varop'>.</span><span class='hs-conid'>ModelView</span><span class='hs-varop'>.</span><span class='hs-conid'>TreeDrag</span>
<a name="line-70"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Control</span><span class='hs-varop'>.</span><span class='hs-conid'>Monad</span><span class='hs-varop'>.</span><span class='hs-conid'>Trans</span> <span class='hs-layout'>(</span> <span class='hs-varid'>liftIO</span> <span class='hs-layout'>)</span>
<a name="line-71"></a>
<a name="line-72"></a><span class='hs-comment'>--------------------------------------------</span>
<a name="line-73"></a><span class='hs-comment'>-- internal model data types</span>
<a name="line-74"></a><span class='hs-comment'>--</span>
<a name="line-75"></a>
<a name="line-76"></a><a name="TreeStore"></a><span class='hs-comment'>-- | A store for hierarchical data.</span>
<a name="line-77"></a><a name="TreeStore"></a><span class='hs-comment'>--</span>
<a name="line-78"></a><a name="TreeStore"></a><span class='hs-keyword'>newtype</span> <span class='hs-conid'>TreeStore</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>TreeStore</span> <span class='hs-layout'>(</span><span class='hs-conid'>CustomStore</span> <span class='hs-layout'>(</span><span class='hs-conid'>IORef</span> <span class='hs-layout'>(</span><span class='hs-conid'>Store</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span>
<a name="line-79"></a>
<a name="line-80"></a><span class='hs-keyword'>instance</span> <span class='hs-conid'>TypedTreeModelClass</span> <span class='hs-conid'>TreeStore</span>
<a name="line-81"></a><span class='hs-keyword'>instance</span> <span class='hs-conid'>TreeModelClass</span> <span class='hs-layout'>(</span><span class='hs-conid'>TreeStore</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span>
<a name="line-82"></a><span class='hs-keyword'>instance</span> <span class='hs-conid'>GObjectClass</span> <span class='hs-layout'>(</span><span class='hs-conid'>TreeStore</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyword'>where</span>
<a name="line-83"></a> <span class='hs-varid'>toGObject</span> <span class='hs-layout'>(</span><span class='hs-conid'>TreeStore</span> <span class='hs-varid'>tm</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>toGObject</span> <span class='hs-varid'>tm</span>
<a name="line-84"></a> <span class='hs-varid'>unsafeCastGObject</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>TreeStore</span> <span class='hs-varop'>.</span> <span class='hs-varid'>unsafeCastGObject</span>
<a name="line-85"></a>
<a name="line-86"></a><a name="Depth"></a><span class='hs-comment'>-- | Maximum number of nodes on each level.</span>
<a name="line-87"></a><a name="Depth"></a><span class='hs-comment'>--</span>
<a name="line-88"></a><a name="Depth"></a><span class='hs-comment'>-- * These numbers determine how many bits in a 'TreeIter' are devoted to</span>
<a name="line-89"></a><a name="Depth"></a><span class='hs-comment'>-- each level. Hence, these numbers reflect log2 of the maximum number</span>
<a name="line-90"></a><a name="Depth"></a><span class='hs-comment'>-- of nodes at a level, rounded up.</span>
<a name="line-91"></a><a name="Depth"></a><span class='hs-comment'>--</span>
<a name="line-92"></a><a name="Depth"></a><span class='hs-keyword'>type</span> <span class='hs-conid'>Depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>[</span><span class='hs-conid'>Int</span><span class='hs-keyglyph'>]</span>
<a name="line-93"></a>
<a name="line-94"></a><a name="Store"></a><span class='hs-keyword'>data</span> <span class='hs-conid'>Store</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Store</span> <span class='hs-layout'>{</span>
<a name="line-95"></a> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Depth</span><span class='hs-layout'>,</span>
<a name="line-96"></a> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Cache</span> <span class='hs-varid'>a</span>
<a name="line-97"></a><span class='hs-layout'>}</span>
<a name="line-98"></a>
<a name="line-99"></a><a name="treeStoreNew"></a><span class='hs-comment'>-- | Create a new list store.</span>
<a name="line-100"></a><span class='hs-comment'>--</span>
<a name="line-101"></a><span class='hs-comment'>-- * The given rose tree determines the initial content and may be the empty</span>
<a name="line-102"></a><span class='hs-comment'>-- list. Each 'Tree' in the forest corresponds to one top-level node.</span>
<a name="line-103"></a><span class='hs-comment'>--</span>
<a name="line-104"></a><span class='hs-definition'>treeStoreNew</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Forest</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>IO</span> <span class='hs-layout'>(</span><span class='hs-conid'>TreeStore</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span>
<a name="line-105"></a><span class='hs-definition'>treeStoreNew</span> <span class='hs-varid'>forest</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>treeStoreNewDND</span> <span class='hs-varid'>forest</span>
<a name="line-106"></a> <span class='hs-layout'>(</span><span class='hs-conid'>Just</span> <span class='hs-varid'>treeStoreDefaultDragSourceIface</span><span class='hs-layout'>)</span>
<a name="line-107"></a> <span class='hs-layout'>(</span><span class='hs-conid'>Just</span> <span class='hs-varid'>treeStoreDefaultDragDestIface</span><span class='hs-layout'>)</span>
<a name="line-108"></a>
<a name="line-109"></a><a name="treeStoreNewDND"></a><span class='hs-comment'>-- | Create a new list store.</span>
<a name="line-110"></a><span class='hs-comment'>--</span>
<a name="line-111"></a><span class='hs-comment'>-- * In addition to 'treeStoreNew', this function takes an two interfaces</span>
<a name="line-112"></a><span class='hs-comment'>-- to implement user-defined drag-and-drop functionality.</span>
<a name="line-113"></a><span class='hs-comment'>--</span>
<a name="line-114"></a><span class='hs-definition'>treeStoreNewDND</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Forest</span> <span class='hs-varid'>a</span> <span class='hs-comment'>-- ^ the inital tree stored in this model</span>
<a name="line-115"></a> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Maybe</span> <span class='hs-layout'>(</span><span class='hs-conid'>DragSourceIface</span> <span class='hs-conid'>TreeStore</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-comment'>-- ^ an optional interface for drags</span>
<a name="line-116"></a> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Maybe</span> <span class='hs-layout'>(</span><span class='hs-conid'>DragDestIface</span> <span class='hs-conid'>TreeStore</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-comment'>-- ^ an optional interface to handle drops</span>
<a name="line-117"></a> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>IO</span> <span class='hs-layout'>(</span><span class='hs-conid'>TreeStore</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span>
<a name="line-118"></a><span class='hs-definition'>treeStoreNewDND</span> <span class='hs-varid'>forest</span> <span class='hs-varid'>mDSource</span> <span class='hs-varid'>mDDest</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>do</span>
<a name="line-119"></a> <span class='hs-varid'>storeRef</span> <span class='hs-keyglyph'><-</span> <span class='hs-varid'>newIORef</span> <span class='hs-conid'>Store</span> <span class='hs-layout'>{</span>
<a name="line-120"></a> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>calcForestDepth</span> <span class='hs-varid'>forest</span><span class='hs-layout'>,</span>
<a name="line-121"></a> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>storeToCache</span> <span class='hs-varid'>forest</span>
<a name="line-122"></a> <span class='hs-layout'>}</span>
<a name="line-123"></a> <span class='hs-keyword'>let</span> <span class='hs-varid'>withStore</span> <span class='hs-varid'>f</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>readIORef</span> <span class='hs-varid'>storeRef</span> <span class='hs-varop'>>>=</span> <span class='hs-varid'>return</span> <span class='hs-varop'>.</span> <span class='hs-varid'>f</span>
<a name="line-124"></a> <span class='hs-varid'>withStoreUpdateCache</span> <span class='hs-varid'>f</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>do</span>
<a name="line-125"></a> <span class='hs-varid'>store</span> <span class='hs-keyglyph'><-</span> <span class='hs-varid'>readIORef</span> <span class='hs-varid'>storeRef</span>
<a name="line-126"></a> <span class='hs-keyword'>let</span> <span class='hs-layout'>(</span><span class='hs-varid'>result</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache'</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>f</span> <span class='hs-varid'>store</span>
<a name="line-127"></a> <span class='hs-varid'>writeIORef</span> <span class='hs-varid'>storeRef</span> <span class='hs-varid'>store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>cache'</span> <span class='hs-layout'>}</span>
<a name="line-128"></a> <span class='hs-varid'>return</span> <span class='hs-varid'>result</span>
<a name="line-129"></a>
<a name="line-130"></a> <span class='hs-varid'>customStoreNew</span> <span class='hs-varid'>storeRef</span> <span class='hs-conid'>TreeStore</span> <span class='hs-conid'>TreeModelIface</span> <span class='hs-layout'>{</span>
<a name="line-131"></a> <span class='hs-varid'>treeModelIfaceGetFlags</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>return</span> <span class='hs-conid'>[]</span><span class='hs-layout'>,</span>
<a name="line-132"></a>
<a name="line-133"></a> <span class='hs-varid'>treeModelIfaceGetIter</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>\</span><span class='hs-varid'>path</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>withStore</span> <span class='hs-varop'>$</span>
<a name="line-134"></a> <span class='hs-keyglyph'>\</span><span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>d</span> <span class='hs-layout'>}</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>fromPath</span> <span class='hs-varid'>d</span> <span class='hs-varid'>path</span><span class='hs-layout'>,</span>
<a name="line-135"></a>
<a name="line-136"></a> <span class='hs-varid'>treeModelIfaceGetPath</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>\</span><span class='hs-varid'>iter</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>withStore</span> <span class='hs-varop'>$</span>
<a name="line-137"></a> <span class='hs-keyglyph'>\</span><span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>d</span> <span class='hs-layout'>}</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>toPath</span> <span class='hs-varid'>d</span> <span class='hs-varid'>iter</span><span class='hs-layout'>,</span>
<a name="line-138"></a>
<a name="line-139"></a> <span class='hs-varid'>treeModelIfaceGetRow</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>\</span><span class='hs-varid'>iter</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>withStoreUpdateCache</span> <span class='hs-varop'>$</span>
<a name="line-140"></a> <span class='hs-keyglyph'>\</span><span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>d</span><span class='hs-layout'>,</span> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>cache</span> <span class='hs-layout'>}</span> <span class='hs-keyglyph'>-></span>
<a name="line-141"></a> <span class='hs-keyword'>case</span> <span class='hs-varid'>checkSuccess</span> <span class='hs-varid'>d</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>cache</span> <span class='hs-keyword'>of</span>
<a name="line-142"></a> <span class='hs-layout'>(</span><span class='hs-conid'>True</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache'</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-layout'>(</span><span class='hs-keyword'>_</span><span class='hs-layout'>,</span> <span class='hs-layout'>(</span><span class='hs-conid'>Node</span> <span class='hs-layout'>{</span> <span class='hs-varid'>rootLabel</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>val</span> <span class='hs-layout'>}</span><span class='hs-conop'>:</span><span class='hs-keyword'>_</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span><span class='hs-conop'>:</span><span class='hs-keyword'>_</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span>
<a name="line-143"></a> <span class='hs-layout'>(</span><span class='hs-varid'>val</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache'</span><span class='hs-layout'>)</span>
<a name="line-144"></a> <span class='hs-keyword'>_</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>error</span> <span class='hs-str'>"TreeStore.getRow: iter does not refer to a valid entry"</span><span class='hs-layout'>,</span>
<a name="line-145"></a>
<a name="line-146"></a> <span class='hs-varid'>treeModelIfaceIterNext</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>\</span><span class='hs-varid'>iter</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>withStoreUpdateCache</span> <span class='hs-varop'>$</span>
<a name="line-147"></a> <span class='hs-keyglyph'>\</span><span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>d</span><span class='hs-layout'>,</span> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>cache</span> <span class='hs-layout'>}</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>iterNext</span> <span class='hs-varid'>d</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>cache</span><span class='hs-layout'>,</span>
<a name="line-148"></a>
<a name="line-149"></a> <span class='hs-varid'>treeModelIfaceIterChildren</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>\</span><span class='hs-varid'>mIter</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>withStoreUpdateCache</span> <span class='hs-varop'>$</span>
<a name="line-150"></a> <span class='hs-keyglyph'>\</span><span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>d</span><span class='hs-layout'>,</span> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>cache</span> <span class='hs-layout'>}</span> <span class='hs-keyglyph'>-></span>
<a name="line-151"></a> <span class='hs-keyword'>let</span> <span class='hs-varid'>iter</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>fromMaybe</span> <span class='hs-varid'>invalidIter</span> <span class='hs-varid'>mIter</span>
<a name="line-152"></a> <span class='hs-keyword'>in</span> <span class='hs-varid'>iterNthChild</span> <span class='hs-varid'>d</span> <span class='hs-num'>0</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>cache</span><span class='hs-layout'>,</span>
<a name="line-153"></a>
<a name="line-154"></a> <span class='hs-varid'>treeModelIfaceIterHasChild</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>\</span><span class='hs-varid'>iter</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>withStoreUpdateCache</span> <span class='hs-varop'>$</span>
<a name="line-155"></a> <span class='hs-keyglyph'>\</span><span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>d</span><span class='hs-layout'>,</span> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>cache</span> <span class='hs-layout'>}</span> <span class='hs-keyglyph'>-></span>
<a name="line-156"></a> <span class='hs-keyword'>let</span> <span class='hs-layout'>(</span><span class='hs-varid'>mIter</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache'</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>iterNthChild</span> <span class='hs-varid'>d</span> <span class='hs-num'>0</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>cache</span>
<a name="line-157"></a> <span class='hs-keyword'>in</span> <span class='hs-layout'>(</span><span class='hs-varid'>isJust</span> <span class='hs-varid'>mIter</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache'</span><span class='hs-layout'>)</span><span class='hs-layout'>,</span>
<a name="line-158"></a>
<a name="line-159"></a> <span class='hs-varid'>treeModelIfaceIterNChildren</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>\</span><span class='hs-varid'>mIter</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>withStoreUpdateCache</span> <span class='hs-varop'>$</span>
<a name="line-160"></a> <span class='hs-keyglyph'>\</span><span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>d</span><span class='hs-layout'>,</span> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>cache</span> <span class='hs-layout'>}</span> <span class='hs-keyglyph'>-></span>
<a name="line-161"></a> <span class='hs-keyword'>let</span> <span class='hs-varid'>iter</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>fromMaybe</span> <span class='hs-varid'>invalidIter</span> <span class='hs-varid'>mIter</span>
<a name="line-162"></a> <span class='hs-keyword'>in</span> <span class='hs-varid'>iterNChildren</span> <span class='hs-varid'>d</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>cache</span><span class='hs-layout'>,</span>
<a name="line-163"></a>
<a name="line-164"></a> <span class='hs-varid'>treeModelIfaceIterNthChild</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>\</span><span class='hs-varid'>mIter</span> <span class='hs-varid'>idx</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>withStoreUpdateCache</span> <span class='hs-varop'>$</span>
<a name="line-165"></a> <span class='hs-keyglyph'>\</span><span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>d</span><span class='hs-layout'>,</span> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>cache</span> <span class='hs-layout'>}</span> <span class='hs-keyglyph'>-></span>
<a name="line-166"></a> <span class='hs-keyword'>let</span> <span class='hs-varid'>iter</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>fromMaybe</span> <span class='hs-varid'>invalidIter</span> <span class='hs-varid'>mIter</span>
<a name="line-167"></a> <span class='hs-keyword'>in</span> <span class='hs-varid'>iterNthChild</span> <span class='hs-varid'>d</span> <span class='hs-varid'>idx</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>cache</span><span class='hs-layout'>,</span>
<a name="line-168"></a>
<a name="line-169"></a> <span class='hs-varid'>treeModelIfaceIterParent</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>\</span><span class='hs-varid'>iter</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>withStore</span> <span class='hs-varop'>$</span>
<a name="line-170"></a> <span class='hs-keyglyph'>\</span><span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>d</span> <span class='hs-layout'>}</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>iterParent</span> <span class='hs-varid'>d</span> <span class='hs-varid'>iter</span><span class='hs-layout'>,</span>
<a name="line-171"></a>
<a name="line-172"></a> <span class='hs-varid'>treeModelIfaceRefNode</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>\</span><span class='hs-keyword'>_</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>return</span> <span class='hs-conid'>()</span><span class='hs-layout'>,</span>
<a name="line-173"></a> <span class='hs-varid'>treeModelIfaceUnrefNode</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>\</span><span class='hs-keyword'>_</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>return</span> <span class='hs-conid'>()</span>
<a name="line-174"></a> <span class='hs-layout'>}</span> <span class='hs-varid'>mDSource</span> <span class='hs-varid'>mDDest</span>
<a name="line-175"></a>
<a name="line-176"></a>
<a name="line-177"></a><a name="treeStoreDefaultDragSourceIface"></a><span class='hs-comment'>-- | Default drag functions for</span>
<a name="line-178"></a><span class='hs-comment'>-- 'Graphics.UI.Gtk.ModelView.TreeStore'. These functions allow the rows of</span>
<a name="line-179"></a><span class='hs-comment'>-- the model to serve as drag source. Any row is allowed to be dragged and the</span>
<a name="line-180"></a><span class='hs-comment'>-- data set in the 'SelectionDataM' object is set with 'treeSetRowDragData',</span>
<a name="line-181"></a><span class='hs-comment'>-- i.e. it contains the model and the 'TreePath' to the row.</span>
<a name="line-182"></a><span class='hs-definition'>treeStoreDefaultDragSourceIface</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>DragSourceIface</span> <span class='hs-conid'>TreeStore</span> <span class='hs-varid'>row</span>
<a name="line-183"></a><span class='hs-definition'>treeStoreDefaultDragSourceIface</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>DragSourceIface</span> <span class='hs-layout'>{</span>
<a name="line-184"></a> <span class='hs-varid'>treeDragSourceRowDraggable</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>\</span><span class='hs-keyword'>_</span> <span class='hs-keyword'>_</span><span class='hs-keyglyph'>-></span> <span class='hs-varid'>return</span> <span class='hs-conid'>True</span><span class='hs-layout'>,</span>
<a name="line-185"></a> <span class='hs-varid'>treeDragSourceDragDataGet</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>treeSetRowDragData</span><span class='hs-layout'>,</span>
<a name="line-186"></a> <span class='hs-varid'>treeDragSourceDragDataDelete</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>\</span><span class='hs-varid'>model</span> <span class='hs-varid'>dest</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-keyword'>_</span><span class='hs-conop'>:</span><span class='hs-keyword'>_</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-keyword'>do</span>
<a name="line-187"></a> <span class='hs-varid'>liftIO</span> <span class='hs-varop'>$</span> <span class='hs-varid'>treeStoreRemove</span> <span class='hs-varid'>model</span> <span class='hs-varid'>dest</span>
<a name="line-188"></a> <span class='hs-varid'>return</span> <span class='hs-conid'>True</span>
<a name="line-189"></a>
<a name="line-190"></a> <span class='hs-layout'>}</span>
<a name="line-191"></a>
<a name="line-192"></a><a name="treeStoreDefaultDragDestIface"></a><span class='hs-comment'>-- | Default drop functions for 'Graphics.UI.Gtk.ModelView.TreeStore'. These</span>
<a name="line-193"></a><span class='hs-comment'>-- functions accept a row and insert the row into the new location if it is</span>
<a name="line-194"></a><span class='hs-comment'>-- dragged into a tree view</span>
<a name="line-195"></a><span class='hs-comment'>-- that uses the same model.</span>
<a name="line-196"></a><span class='hs-definition'>treeStoreDefaultDragDestIface</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>DragDestIface</span> <span class='hs-conid'>TreeStore</span> <span class='hs-varid'>row</span>
<a name="line-197"></a><span class='hs-definition'>treeStoreDefaultDragDestIface</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>DragDestIface</span> <span class='hs-layout'>{</span>
<a name="line-198"></a> <span class='hs-varid'>treeDragDestRowDropPossible</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>\</span><span class='hs-varid'>model</span> <span class='hs-varid'>dest</span> <span class='hs-keyglyph'>-></span> <span class='hs-keyword'>do</span>
<a name="line-199"></a> <span class='hs-varid'>mModelPath</span> <span class='hs-keyglyph'><-</span> <span class='hs-varid'>treeGetRowDragData</span>
<a name="line-200"></a> <span class='hs-keyword'>case</span> <span class='hs-varid'>mModelPath</span> <span class='hs-keyword'>of</span>
<a name="line-201"></a> <span class='hs-conid'>Nothing</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>return</span> <span class='hs-conid'>False</span>
<a name="line-202"></a> <span class='hs-conid'>Just</span> <span class='hs-layout'>(</span><span class='hs-varid'>model'</span><span class='hs-layout'>,</span> <span class='hs-varid'>source</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>return</span> <span class='hs-layout'>(</span><span class='hs-varid'>toTreeModel</span> <span class='hs-varid'>model</span><span class='hs-varop'>==</span><span class='hs-varid'>toTreeModel</span> <span class='hs-varid'>model'</span><span class='hs-layout'>)</span><span class='hs-layout'>,</span>
<a name="line-203"></a> <span class='hs-varid'>treeDragDestDragDataReceived</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>\</span><span class='hs-varid'>model</span> <span class='hs-varid'>dest</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-keyword'>_</span><span class='hs-conop'>:</span><span class='hs-keyword'>_</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-keyword'>do</span>
<a name="line-204"></a> <span class='hs-varid'>mModelPath</span> <span class='hs-keyglyph'><-</span> <span class='hs-varid'>treeGetRowDragData</span>
<a name="line-205"></a> <span class='hs-keyword'>case</span> <span class='hs-varid'>mModelPath</span> <span class='hs-keyword'>of</span>
<a name="line-206"></a> <span class='hs-conid'>Nothing</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>return</span> <span class='hs-conid'>False</span>
<a name="line-207"></a> <span class='hs-conid'>Just</span> <span class='hs-layout'>(</span><span class='hs-varid'>model'</span><span class='hs-layout'>,</span> <span class='hs-varid'>source</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-keyword'>_</span><span class='hs-conop'>:</span><span class='hs-keyword'>_</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span>
<a name="line-208"></a> <span class='hs-keyword'>if</span> <span class='hs-varid'>toTreeModel</span> <span class='hs-varid'>model</span><span class='hs-varop'>/=</span><span class='hs-varid'>toTreeModel</span> <span class='hs-varid'>model'</span> <span class='hs-keyword'>then</span> <span class='hs-varid'>return</span> <span class='hs-conid'>False</span>
<a name="line-209"></a> <span class='hs-keyword'>else</span> <span class='hs-varid'>liftIO</span> <span class='hs-varop'>$</span> <span class='hs-keyword'>do</span>
<a name="line-210"></a> <span class='hs-varid'>row</span> <span class='hs-keyglyph'><-</span> <span class='hs-varid'>treeStoreGetTree</span> <span class='hs-varid'>model</span> <span class='hs-varid'>source</span>
<a name="line-211"></a> <span class='hs-varid'>treeStoreInsertTree</span> <span class='hs-varid'>model</span> <span class='hs-layout'>(</span><span class='hs-varid'>init</span> <span class='hs-varid'>dest</span><span class='hs-layout'>)</span> <span class='hs-layout'>(</span><span class='hs-varid'>last</span> <span class='hs-varid'>dest</span><span class='hs-layout'>)</span> <span class='hs-varid'>row</span>
<a name="line-212"></a> <span class='hs-varid'>return</span> <span class='hs-conid'>True</span>
<a name="line-213"></a> <span class='hs-layout'>}</span>
<a name="line-214"></a>
<a name="line-215"></a><span class='hs-comment'>--------------------------------------------</span>
<a name="line-216"></a><span class='hs-comment'>-- low level bit-twiddling utility functions</span>
<a name="line-217"></a><span class='hs-comment'>--</span>
<a name="line-218"></a>
<a name="line-219"></a><span class='hs-comment'>-- TODO: figure out how these things work when Word is 64 bits</span>
<a name="line-220"></a>
<a name="line-221"></a><a name="bitsNeeded"></a><span class='hs-definition'>bitsNeeded</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Word</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Int</span>
<a name="line-222"></a><span class='hs-definition'>bitsNeeded</span> <span class='hs-varid'>n</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>bitsNeeded'</span> <span class='hs-num'>0</span> <span class='hs-varid'>n</span>
<a name="line-223"></a> <span class='hs-keyword'>where</span> <span class='hs-varid'>bitsNeeded'</span> <span class='hs-varid'>b</span> <span class='hs-num'>0</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>b</span>
<a name="line-224"></a> <span class='hs-varid'>bitsNeeded'</span> <span class='hs-varid'>b</span> <span class='hs-varid'>n</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>bitsNeeded'</span> <span class='hs-layout'>(</span><span class='hs-varid'>b</span><span class='hs-varop'>+</span><span class='hs-num'>1</span><span class='hs-layout'>)</span> <span class='hs-layout'>(</span><span class='hs-varid'>n</span> <span class='hs-varop'>`shiftR`</span> <span class='hs-num'>1</span><span class='hs-layout'>)</span>
<a name="line-225"></a>
<a name="line-226"></a><a name="getBitSlice"></a><span class='hs-definition'>getBitSlice</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>TreeIter</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Int</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Int</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Word</span>
<a name="line-227"></a><span class='hs-definition'>getBitSlice</span> <span class='hs-layout'>(</span><span class='hs-conid'>TreeIter</span> <span class='hs-keyword'>_</span> <span class='hs-varid'>a</span> <span class='hs-varid'>b</span> <span class='hs-varid'>c</span><span class='hs-layout'>)</span> <span class='hs-varid'>off</span> <span class='hs-varid'>count</span> <span class='hs-keyglyph'>=</span>
<a name="line-228"></a> <span class='hs-varid'>getBitSliceWord</span> <span class='hs-varid'>a</span> <span class='hs-varid'>off</span> <span class='hs-varid'>count</span>
<a name="line-229"></a> <span class='hs-varop'>.|.</span> <span class='hs-varid'>getBitSliceWord</span> <span class='hs-varid'>b</span> <span class='hs-layout'>(</span><span class='hs-varid'>off</span><span class='hs-comment'>-</span><span class='hs-num'>32</span><span class='hs-layout'>)</span> <span class='hs-varid'>count</span>
<a name="line-230"></a> <span class='hs-varop'>.|.</span> <span class='hs-varid'>getBitSliceWord</span> <span class='hs-varid'>c</span> <span class='hs-layout'>(</span><span class='hs-varid'>off</span><span class='hs-comment'>-</span><span class='hs-num'>64</span><span class='hs-layout'>)</span> <span class='hs-varid'>count</span>
<a name="line-231"></a>
<a name="line-232"></a> <span class='hs-keyword'>where</span> <span class='hs-varid'>getBitSliceWord</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Word</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Int</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Int</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Word</span>
<a name="line-233"></a> <span class='hs-varid'>getBitSliceWord</span> <span class='hs-varid'>word</span> <span class='hs-varid'>off</span> <span class='hs-varid'>count</span> <span class='hs-keyglyph'>=</span>
<a name="line-234"></a> <span class='hs-varid'>word</span> <span class='hs-varop'>`shiftR`</span> <span class='hs-varid'>off</span> <span class='hs-varop'>.&.</span> <span class='hs-layout'>(</span><span class='hs-num'>1</span> <span class='hs-varop'>`shiftL`</span> <span class='hs-varid'>count</span> <span class='hs-comment'>-</span> <span class='hs-num'>1</span><span class='hs-layout'>)</span>
<a name="line-235"></a>
<a name="line-236"></a><a name="setBitSlice"></a><span class='hs-definition'>setBitSlice</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>TreeIter</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Int</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Int</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Word</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreeIter</span>
<a name="line-237"></a><span class='hs-definition'>setBitSlice</span> <span class='hs-layout'>(</span><span class='hs-conid'>TreeIter</span> <span class='hs-varid'>stamp</span> <span class='hs-varid'>a</span> <span class='hs-varid'>b</span> <span class='hs-varid'>c</span><span class='hs-layout'>)</span> <span class='hs-varid'>off</span> <span class='hs-varid'>count</span> <span class='hs-varid'>value</span> <span class='hs-keyglyph'>=</span>
<a name="line-238"></a> <span class='hs-varid'>assert</span> <span class='hs-layout'>(</span><span class='hs-varid'>value</span> <span class='hs-varop'><</span> <span class='hs-num'>1</span> <span class='hs-varop'>`shiftL`</span> <span class='hs-varid'>count</span><span class='hs-layout'>)</span> <span class='hs-varop'>$</span>
<a name="line-239"></a> <span class='hs-conid'>TreeIter</span> <span class='hs-varid'>stamp</span>
<a name="line-240"></a> <span class='hs-layout'>(</span><span class='hs-varid'>setBitSliceWord</span> <span class='hs-varid'>a</span> <span class='hs-varid'>off</span> <span class='hs-varid'>count</span> <span class='hs-varid'>value</span><span class='hs-layout'>)</span>
<a name="line-241"></a> <span class='hs-layout'>(</span><span class='hs-varid'>setBitSliceWord</span> <span class='hs-varid'>b</span> <span class='hs-layout'>(</span><span class='hs-varid'>off</span><span class='hs-comment'>-</span><span class='hs-num'>32</span><span class='hs-layout'>)</span> <span class='hs-varid'>count</span> <span class='hs-varid'>value</span><span class='hs-layout'>)</span>
<a name="line-242"></a> <span class='hs-layout'>(</span><span class='hs-varid'>setBitSliceWord</span> <span class='hs-varid'>c</span> <span class='hs-layout'>(</span><span class='hs-varid'>off</span><span class='hs-comment'>-</span><span class='hs-num'>64</span><span class='hs-layout'>)</span> <span class='hs-varid'>count</span> <span class='hs-varid'>value</span><span class='hs-layout'>)</span>
<a name="line-243"></a>
<a name="line-244"></a> <span class='hs-keyword'>where</span> <span class='hs-varid'>setBitSliceWord</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Word</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Int</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Int</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Word</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Word</span>
<a name="line-245"></a> <span class='hs-varid'>setBitSliceWord</span> <span class='hs-varid'>word</span> <span class='hs-varid'>off</span> <span class='hs-varid'>count</span> <span class='hs-varid'>value</span> <span class='hs-keyglyph'>=</span>
<a name="line-246"></a> <span class='hs-keyword'>let</span> <span class='hs-varid'>mask</span> <span class='hs-keyglyph'>=</span> <span class='hs-layout'>(</span><span class='hs-num'>1</span> <span class='hs-varop'>`shiftL`</span> <span class='hs-varid'>count</span> <span class='hs-comment'>-</span> <span class='hs-num'>1</span><span class='hs-layout'>)</span> <span class='hs-varop'>`shiftL`</span> <span class='hs-varid'>off</span>
<a name="line-247"></a> <span class='hs-keyword'>in</span> <span class='hs-layout'>(</span><span class='hs-varid'>word</span> <span class='hs-varop'>.&.</span> <span class='hs-varid'>complement</span> <span class='hs-varid'>mask</span><span class='hs-layout'>)</span> <span class='hs-varop'>.|.</span> <span class='hs-layout'>(</span><span class='hs-varid'>value</span> <span class='hs-varop'>`shiftL`</span> <span class='hs-varid'>off</span><span class='hs-layout'>)</span>
<a name="line-248"></a>
<a name="line-249"></a>
<a name="line-250"></a><a name="iterPrefixEqual"></a><span class='hs-definition'>iterPrefixEqual</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>TreeIter</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreeIter</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Int</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Bool</span>
<a name="line-251"></a><span class='hs-definition'>iterPrefixEqual</span> <span class='hs-layout'>(</span><span class='hs-conid'>TreeIter</span> <span class='hs-keyword'>_</span> <span class='hs-varid'>a1</span> <span class='hs-varid'>b1</span> <span class='hs-varid'>c1</span><span class='hs-layout'>)</span> <span class='hs-layout'>(</span><span class='hs-conid'>TreeIter</span> <span class='hs-keyword'>_</span> <span class='hs-varid'>a2</span> <span class='hs-varid'>b2</span> <span class='hs-varid'>c2</span><span class='hs-layout'>)</span> <span class='hs-varid'>pos</span>
<a name="line-252"></a> <span class='hs-keyglyph'>|</span> <span class='hs-varid'>pos</span><span class='hs-varop'>></span><span class='hs-num'>64</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>let</span> <span class='hs-varid'>mask</span> <span class='hs-keyglyph'>=</span> <span class='hs-num'>1</span> <span class='hs-varop'>`shiftL`</span> <span class='hs-layout'>(</span><span class='hs-varid'>pos</span><span class='hs-comment'>-</span><span class='hs-num'>64</span><span class='hs-layout'>)</span> <span class='hs-comment'>-</span> <span class='hs-num'>1</span> <span class='hs-keyword'>in</span>
<a name="line-253"></a> <span class='hs-varid'>a1</span><span class='hs-varop'>==</span><span class='hs-varid'>a2</span> <span class='hs-varop'>&&</span> <span class='hs-varid'>b1</span><span class='hs-varop'>==</span><span class='hs-varid'>b2</span> <span class='hs-varop'>&&</span> <span class='hs-layout'>(</span><span class='hs-varid'>c1</span> <span class='hs-varop'>.&.</span> <span class='hs-varid'>mask</span><span class='hs-layout'>)</span> <span class='hs-varop'>==</span> <span class='hs-layout'>(</span><span class='hs-varid'>c2</span> <span class='hs-varop'>.&.</span> <span class='hs-varid'>mask</span><span class='hs-layout'>)</span>
<a name="line-254"></a> <span class='hs-keyglyph'>|</span> <span class='hs-varid'>pos</span><span class='hs-varop'>></span><span class='hs-num'>32</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>let</span> <span class='hs-varid'>mask</span> <span class='hs-keyglyph'>=</span> <span class='hs-num'>1</span> <span class='hs-varop'>`shiftL`</span> <span class='hs-layout'>(</span><span class='hs-varid'>pos</span><span class='hs-comment'>-</span><span class='hs-num'>32</span><span class='hs-layout'>)</span> <span class='hs-comment'>-</span> <span class='hs-num'>1</span> <span class='hs-keyword'>in</span>
<a name="line-255"></a> <span class='hs-varid'>a1</span><span class='hs-varop'>==</span><span class='hs-varid'>a2</span> <span class='hs-varop'>&&</span> <span class='hs-layout'>(</span><span class='hs-varid'>b1</span> <span class='hs-varop'>.&.</span> <span class='hs-varid'>mask</span><span class='hs-layout'>)</span> <span class='hs-varop'>==</span> <span class='hs-layout'>(</span><span class='hs-varid'>b2</span> <span class='hs-varop'>.&.</span> <span class='hs-varid'>mask</span><span class='hs-layout'>)</span>
<a name="line-256"></a> <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>let</span> <span class='hs-varid'>mask</span> <span class='hs-keyglyph'>=</span> <span class='hs-num'>1</span> <span class='hs-varop'>`shiftL`</span> <span class='hs-varid'>pos</span> <span class='hs-comment'>-</span> <span class='hs-num'>1</span> <span class='hs-keyword'>in</span>
<a name="line-257"></a> <span class='hs-layout'>(</span><span class='hs-varid'>a1</span> <span class='hs-varop'>.&.</span> <span class='hs-varid'>mask</span><span class='hs-layout'>)</span> <span class='hs-varop'>==</span> <span class='hs-layout'>(</span><span class='hs-varid'>a2</span> <span class='hs-varop'>.&.</span> <span class='hs-varid'>mask</span><span class='hs-layout'>)</span>
<a name="line-258"></a>
<a name="line-259"></a><a name="invalidIter"></a><span class='hs-comment'>-- | The invalid tree iterator.</span>
<a name="line-260"></a><span class='hs-comment'>--</span>
<a name="line-261"></a><span class='hs-definition'>invalidIter</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>TreeIter</span>
<a name="line-262"></a><span class='hs-definition'>invalidIter</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>TreeIter</span> <span class='hs-num'>0</span> <span class='hs-num'>0</span> <span class='hs-num'>0</span> <span class='hs-num'>0</span>
<a name="line-263"></a>
<a name="line-264"></a><a name="showIterBits"></a><span class='hs-definition'>showIterBits</span> <span class='hs-layout'>(</span><span class='hs-conid'>TreeIter</span> <span class='hs-keyword'>_</span> <span class='hs-varid'>a</span> <span class='hs-varid'>b</span> <span class='hs-varid'>c</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>[</span><span class='hs-varid'>showBits</span> <span class='hs-varid'>a</span><span class='hs-layout'>,</span> <span class='hs-varid'>showBits</span> <span class='hs-varid'>b</span><span class='hs-layout'>,</span> <span class='hs-varid'>showBits</span> <span class='hs-varid'>c</span><span class='hs-keyglyph'>]</span>
<a name="line-265"></a>
<a name="line-266"></a><a name="showBits"></a><span class='hs-definition'>showBits</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Bits</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>=></span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>String</span>
<a name="line-267"></a><span class='hs-definition'>showBits</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>[</span> <span class='hs-keyword'>if</span> <span class='hs-varid'>testBit</span> <span class='hs-varid'>a</span> <span class='hs-varid'>i</span> <span class='hs-keyword'>then</span> <span class='hs-chr'>'1'</span> <span class='hs-keyword'>else</span> <span class='hs-chr'>'0'</span> <span class='hs-keyglyph'>|</span> <span class='hs-varid'>i</span> <span class='hs-keyglyph'><-</span> <span class='hs-keyglyph'>[</span><span class='hs-num'>0</span><span class='hs-keyglyph'>..</span><span class='hs-varid'>bitSize</span> <span class='hs-varid'>a</span> <span class='hs-comment'>-</span> <span class='hs-num'>1</span><span class='hs-keyglyph'>]</span> <span class='hs-keyglyph'>]</span>
<a name="line-268"></a>
<a name="line-269"></a><a name="calcForestDepth"></a><span class='hs-comment'>-- | Calculate the maximum number of nodes on a per-level basis.</span>
<a name="line-270"></a><span class='hs-comment'>--</span>
<a name="line-271"></a><span class='hs-definition'>calcForestDepth</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Forest</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Depth</span>
<a name="line-272"></a><span class='hs-definition'>calcForestDepth</span> <span class='hs-varid'>f</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>map</span> <span class='hs-varid'>bitsNeeded</span> <span class='hs-varop'>$</span>
<a name="line-273"></a> <span class='hs-varid'>takeWhile</span> <span class='hs-layout'>(</span><span class='hs-varop'>/=</span><span class='hs-num'>0</span><span class='hs-layout'>)</span> <span class='hs-varop'>$</span>
<a name="line-274"></a> <span class='hs-varid'>foldr</span> <span class='hs-varid'>calcTreeDepth</span> <span class='hs-layout'>(</span><span class='hs-varid'>repeat</span> <span class='hs-num'>0</span><span class='hs-layout'>)</span> <span class='hs-varid'>f</span>
<a name="line-275"></a> <span class='hs-keyword'>where</span>
<a name="line-276"></a> <span class='hs-varid'>calcTreeDepth</span> <span class='hs-conid'>Node</span> <span class='hs-layout'>{</span> <span class='hs-varid'>subForest</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>f</span> <span class='hs-layout'>}</span> <span class='hs-layout'>(</span><span class='hs-varid'>d</span><span class='hs-conop'>:</span><span class='hs-varid'>ds</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span>
<a name="line-277"></a> <span class='hs-layout'>(</span><span class='hs-varid'>d</span><span class='hs-varop'>+</span><span class='hs-num'>1</span><span class='hs-layout'>)</span><span class='hs-conop'>:</span> <span class='hs-varid'>zipWith</span> <span class='hs-varid'>max</span> <span class='hs-varid'>ds</span> <span class='hs-layout'>(</span><span class='hs-varid'>foldr</span> <span class='hs-varid'>calcTreeDepth</span> <span class='hs-layout'>(</span><span class='hs-varid'>repeat</span> <span class='hs-num'>0</span><span class='hs-layout'>)</span> <span class='hs-varid'>f</span><span class='hs-layout'>)</span>
<a name="line-278"></a>
<a name="line-279"></a>
<a name="line-280"></a><a name="toPath"></a><span class='hs-comment'>-- | Convert an iterator into a path.</span>
<a name="line-281"></a><span class='hs-comment'>--</span>
<a name="line-282"></a><span class='hs-definition'>toPath</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Depth</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreeIter</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreePath</span>
<a name="line-283"></a><span class='hs-definition'>toPath</span> <span class='hs-varid'>d</span> <span class='hs-varid'>iter</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>gP</span> <span class='hs-num'>0</span> <span class='hs-varid'>d</span>
<a name="line-284"></a> <span class='hs-keyword'>where</span>
<a name="line-285"></a> <span class='hs-varid'>gP</span> <span class='hs-varid'>pos</span> <span class='hs-conid'>[]</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>[]</span>
<a name="line-286"></a> <span class='hs-varid'>gP</span> <span class='hs-varid'>pos</span> <span class='hs-layout'>(</span><span class='hs-varid'>d</span><span class='hs-conop'>:</span><span class='hs-varid'>ds</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>let</span> <span class='hs-varid'>idx</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>getBitSlice</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>d</span> <span class='hs-keyword'>in</span>
<a name="line-287"></a> <span class='hs-keyword'>if</span> <span class='hs-varid'>idx</span><span class='hs-varop'>==</span><span class='hs-num'>0</span> <span class='hs-keyword'>then</span> <span class='hs-conid'>[]</span> <span class='hs-keyword'>else</span> <span class='hs-varid'>fromIntegral</span> <span class='hs-layout'>(</span><span class='hs-varid'>idx</span><span class='hs-comment'>-</span><span class='hs-num'>1</span><span class='hs-layout'>)</span> <span class='hs-conop'>:</span> <span class='hs-varid'>gP</span> <span class='hs-layout'>(</span><span class='hs-varid'>pos</span><span class='hs-varop'>+</span><span class='hs-varid'>d</span><span class='hs-layout'>)</span> <span class='hs-varid'>ds</span>
<a name="line-288"></a>
<a name="line-289"></a><a name="fromPath"></a><span class='hs-comment'>-- | Try to convert a path into a 'TreeIter'.</span>
<a name="line-290"></a><span class='hs-comment'>--</span>
<a name="line-291"></a><span class='hs-definition'>fromPath</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Depth</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreePath</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Maybe</span> <span class='hs-conid'>TreeIter</span>
<a name="line-292"></a><span class='hs-definition'>fromPath</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>fP</span> <span class='hs-num'>0</span> <span class='hs-varid'>invalidIter</span>
<a name="line-293"></a> <span class='hs-keyword'>where</span>
<a name="line-294"></a> <span class='hs-varid'>fP</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>ti</span> <span class='hs-keyword'>_</span> <span class='hs-conid'>[]</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Just</span> <span class='hs-varid'>ti</span> <span class='hs-comment'>-- the remaining bits are zero anyway</span>
<a name="line-295"></a> <span class='hs-varid'>fP</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>ti</span> <span class='hs-conid'>[]</span> <span class='hs-keyword'>_</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Nothing</span>
<a name="line-296"></a> <span class='hs-varid'>fP</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>ti</span> <span class='hs-layout'>(</span><span class='hs-varid'>d</span><span class='hs-conop'>:</span><span class='hs-varid'>ds</span><span class='hs-layout'>)</span> <span class='hs-layout'>(</span><span class='hs-varid'>p</span><span class='hs-conop'>:</span><span class='hs-varid'>ps</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>let</span> <span class='hs-varid'>idx</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>fromIntegral</span> <span class='hs-layout'>(</span><span class='hs-varid'>p</span><span class='hs-varop'>+</span><span class='hs-num'>1</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Word</span> <span class='hs-keyword'>in</span>
<a name="line-297"></a> <span class='hs-keyword'>if</span> <span class='hs-varid'>idx</span> <span class='hs-varop'>>=</span> <span class='hs-varid'>bit</span> <span class='hs-varid'>d</span> <span class='hs-keyword'>then</span> <span class='hs-conid'>Nothing</span> <span class='hs-keyword'>else</span>
<a name="line-298"></a> <span class='hs-varid'>fP</span> <span class='hs-layout'>(</span><span class='hs-varid'>pos</span><span class='hs-varop'>+</span><span class='hs-varid'>d</span><span class='hs-layout'>)</span> <span class='hs-layout'>(</span><span class='hs-varid'>setBitSlice</span> <span class='hs-varid'>ti</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>d</span> <span class='hs-varid'>idx</span><span class='hs-layout'>)</span> <span class='hs-varid'>ds</span> <span class='hs-varid'>ps</span>
<a name="line-299"></a>
<a name="line-300"></a>
<a name="line-301"></a><a name="Cache"></a><span class='hs-comment'>-- | The 'Cache' type synonym is only used iternally. What it represents</span>
<a name="line-302"></a><a name="Cache"></a><span class='hs-comment'>-- the stack during a (fictional) lookup operations.</span>
<a name="line-303"></a><a name="Cache"></a><span class='hs-comment'>-- The topmost frame is the node</span>
<a name="line-304"></a><a name="Cache"></a><span class='hs-comment'>-- for which this lookup was started and the innermost frame (the last</span>
<a name="line-305"></a><a name="Cache"></a><span class='hs-comment'>-- element of the list) contains the root of the tree.</span>
<a name="line-306"></a><a name="Cache"></a><span class='hs-comment'>--</span>
<a name="line-307"></a><a name="Cache"></a><span class='hs-keyword'>type</span> <span class='hs-conid'>Cache</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>[</span><span class='hs-layout'>(</span><span class='hs-conid'>TreeIter</span><span class='hs-layout'>,</span> <span class='hs-conid'>Forest</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span><span class='hs-keyglyph'>]</span>
<a name="line-308"></a>
<a name="line-309"></a>
<a name="line-310"></a><a name="storeToCache"></a><span class='hs-comment'>-- | Create a traversal structure that allows a pre-order traversal in linear</span>
<a name="line-311"></a><span class='hs-comment'>-- time.</span>
<a name="line-312"></a><span class='hs-comment'>--</span>
<a name="line-313"></a><span class='hs-comment'>-- * The returned structure points at the root of the first level which doesn't</span>
<a name="line-314"></a><span class='hs-comment'>-- really exist, but serves to indicate that it is before the very first</span>
<a name="line-315"></a><span class='hs-comment'>-- node.</span>
<a name="line-316"></a><span class='hs-comment'>--</span>
<a name="line-317"></a><span class='hs-definition'>storeToCache</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Forest</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Cache</span> <span class='hs-varid'>a</span>
<a name="line-318"></a><span class='hs-definition'>storeToCache</span> <span class='hs-conid'>[]</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>[]</span>
<a name="line-319"></a><span class='hs-definition'>storeToCache</span> <span class='hs-varid'>forest</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>[</span><span class='hs-layout'>(</span><span class='hs-varid'>invalidIter</span><span class='hs-layout'>,</span> <span class='hs-keyglyph'>[</span><span class='hs-conid'>Node</span> <span class='hs-varid'>root</span> <span class='hs-varid'>forest</span><span class='hs-keyglyph'>]</span><span class='hs-layout'>)</span><span class='hs-keyglyph'>]</span>
<a name="line-320"></a> <span class='hs-keyword'>where</span>
<a name="line-321"></a> <span class='hs-varid'>root</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>error</span> <span class='hs-str'>"TreeStore.storeToCache: accessed non-exitent root of tree"</span>
<a name="line-322"></a>
<a name="line-323"></a><a name="cacheToStore"></a><span class='hs-comment'>-- | Extract the store from the cache data structure.</span>
<a name="line-324"></a><span class='hs-definition'>cacheToStore</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Cache</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Forest</span> <span class='hs-varid'>a</span>
<a name="line-325"></a><span class='hs-definition'>cacheToStore</span> <span class='hs-conid'>[]</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>[]</span>
<a name="line-326"></a><span class='hs-definition'>cacheToStore</span> <span class='hs-varid'>cache</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>case</span> <span class='hs-varid'>last</span> <span class='hs-varid'>cache</span> <span class='hs-keyword'>of</span> <span class='hs-layout'>(</span><span class='hs-keyword'>_</span><span class='hs-layout'>,</span> <span class='hs-keyglyph'>[</span><span class='hs-conid'>Node</span> <span class='hs-keyword'>_</span> <span class='hs-varid'>forest</span><span class='hs-keyglyph'>]</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>forest</span>
<a name="line-327"></a>
<a name="line-328"></a><a name="advanceCache"></a><span class='hs-comment'>-- | Advance the traversal structure to the given 'TreeIter'.</span>
<a name="line-329"></a><span class='hs-comment'>--</span>
<a name="line-330"></a><span class='hs-definition'>advanceCache</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Depth</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreeIter</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Cache</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Cache</span> <span class='hs-varid'>a</span>
<a name="line-331"></a><span class='hs-definition'>advanceCache</span> <span class='hs-varid'>depth</span> <span class='hs-varid'>goal</span> <span class='hs-conid'>[]</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>[]</span>
<a name="line-332"></a><span class='hs-definition'>advanceCache</span> <span class='hs-varid'>depth</span> <span class='hs-varid'>goal</span> <span class='hs-varid'>cache</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-layout'>(</span><span class='hs-varid'>rootIter</span><span class='hs-layout'>,</span><span class='hs-keyword'>_</span><span class='hs-layout'>)</span><span class='hs-conop'>:</span><span class='hs-keyword'>_</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span>
<a name="line-333"></a> <span class='hs-varid'>moveToSameLevel</span> <span class='hs-num'>0</span> <span class='hs-varid'>depth</span>
<a name="line-334"></a> <span class='hs-keyword'>where</span>
<a name="line-335"></a> <span class='hs-varid'>moveToSameLevel</span> <span class='hs-varid'>pos</span> <span class='hs-conid'>[]</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>cache</span>
<a name="line-336"></a> <span class='hs-varid'>moveToSameLevel</span> <span class='hs-varid'>pos</span> <span class='hs-layout'>(</span><span class='hs-varid'>d</span><span class='hs-conop'>:</span><span class='hs-varid'>ds</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span>
<a name="line-337"></a> <span class='hs-keyword'>let</span>
<a name="line-338"></a> <span class='hs-varid'>goalIdx</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>getBitSlice</span> <span class='hs-varid'>goal</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>d</span>
<a name="line-339"></a> <span class='hs-varid'>curIdx</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>getBitSlice</span> <span class='hs-varid'>rootIter</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>d</span>
<a name="line-340"></a> <span class='hs-varid'>isNonZero</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>d</span> <span class='hs-layout'>(</span><span class='hs-varid'>ti</span><span class='hs-layout'>,</span><span class='hs-keyword'>_</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>getBitSlice</span> <span class='hs-varid'>ti</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>d</span><span class='hs-varop'>/=</span><span class='hs-num'>0</span>
<a name="line-341"></a> <span class='hs-keyword'>in</span>
<a name="line-342"></a> <span class='hs-keyword'>if</span> <span class='hs-varid'>goalIdx</span><span class='hs-varop'>==</span><span class='hs-varid'>curIdx</span> <span class='hs-keyword'>then</span> <span class='hs-varid'>moveToSameLevel</span> <span class='hs-layout'>(</span><span class='hs-varid'>pos</span><span class='hs-varop'>+</span><span class='hs-varid'>d</span><span class='hs-layout'>)</span> <span class='hs-varid'>ds</span> <span class='hs-keyword'>else</span>
<a name="line-343"></a> <span class='hs-keyword'>if</span> <span class='hs-varid'>goalIdx</span><span class='hs-varop'>==</span><span class='hs-num'>0</span> <span class='hs-keyword'>then</span> <span class='hs-varid'>dropWhile</span> <span class='hs-layout'>(</span><span class='hs-varid'>isNonZero</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>d</span><span class='hs-layout'>)</span> <span class='hs-varid'>cache</span> <span class='hs-keyword'>else</span>
<a name="line-344"></a> <span class='hs-keyword'>if</span> <span class='hs-varid'>curIdx</span><span class='hs-varop'>==</span><span class='hs-num'>0</span> <span class='hs-keyword'>then</span> <span class='hs-varid'>moveToChild</span> <span class='hs-varid'>pos</span> <span class='hs-layout'>(</span><span class='hs-varid'>d</span><span class='hs-conop'>:</span><span class='hs-varid'>ds</span><span class='hs-layout'>)</span> <span class='hs-varid'>cache</span> <span class='hs-keyword'>else</span>
<a name="line-345"></a> <span class='hs-keyword'>if</span> <span class='hs-varid'>goalIdx</span><span class='hs-varop'><</span><span class='hs-varid'>curIdx</span> <span class='hs-keyword'>then</span>
<a name="line-346"></a> <span class='hs-varid'>moveToChild</span> <span class='hs-varid'>pos</span> <span class='hs-layout'>(</span><span class='hs-varid'>d</span><span class='hs-conop'>:</span><span class='hs-varid'>ds</span><span class='hs-layout'>)</span> <span class='hs-layout'>(</span><span class='hs-varid'>dropWhile</span> <span class='hs-layout'>(</span><span class='hs-varid'>isNonZero</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>d</span><span class='hs-layout'>)</span> <span class='hs-varid'>cache</span><span class='hs-layout'>)</span>
<a name="line-347"></a> <span class='hs-keyword'>else</span> <span class='hs-keyword'>let</span>
<a name="line-348"></a> <span class='hs-comment'>-- advance the current iterator to coincide with the goal iterator</span>
<a name="line-349"></a> <span class='hs-comment'>-- at this level</span>
<a name="line-350"></a> <span class='hs-varid'>moveWithinLevel</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>d</span> <span class='hs-layout'>(</span><span class='hs-layout'>(</span><span class='hs-varid'>ti</span><span class='hs-layout'>,</span><span class='hs-varid'>forest</span><span class='hs-layout'>)</span><span class='hs-conop'>:</span><span class='hs-varid'>parents</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>let</span>
<a name="line-351"></a> <span class='hs-varid'>diff</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>fromIntegral</span> <span class='hs-layout'>(</span><span class='hs-varid'>goalIdx</span><span class='hs-comment'>-</span><span class='hs-varid'>curIdx</span><span class='hs-layout'>)</span>
<a name="line-352"></a> <span class='hs-layout'>(</span><span class='hs-varid'>dropped</span><span class='hs-layout'>,</span> <span class='hs-varid'>remain</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>splitAt</span> <span class='hs-varid'>diff</span> <span class='hs-varid'>forest</span>
<a name="line-353"></a> <span class='hs-varid'>advance</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>length</span> <span class='hs-varid'>dropped</span>
<a name="line-354"></a> <span class='hs-varid'>ti'</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>setBitSlice</span> <span class='hs-varid'>ti</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>d</span> <span class='hs-layout'>(</span><span class='hs-varid'>curIdx</span><span class='hs-varop'>+</span><span class='hs-varid'>fromIntegral</span> <span class='hs-varid'>advance</span><span class='hs-layout'>)</span>
<a name="line-355"></a> <span class='hs-keyword'>in</span>
<a name="line-356"></a> <span class='hs-keyword'>if</span> <span class='hs-varid'>advance</span><span class='hs-varop'>==</span><span class='hs-varid'>diff</span> <span class='hs-keyword'>then</span> <span class='hs-varid'>moveToChild</span> <span class='hs-layout'>(</span><span class='hs-varid'>pos</span><span class='hs-varop'>+</span><span class='hs-varid'>d</span><span class='hs-layout'>)</span> <span class='hs-varid'>ds</span> <span class='hs-layout'>(</span><span class='hs-layout'>(</span><span class='hs-varid'>ti'</span><span class='hs-layout'>,</span><span class='hs-varid'>remain</span><span class='hs-layout'>)</span><span class='hs-conop'>:</span><span class='hs-varid'>parents</span><span class='hs-layout'>)</span>
<a name="line-357"></a> <span class='hs-keyword'>else</span> <span class='hs-layout'>(</span><span class='hs-varid'>ti'</span><span class='hs-layout'>,</span><span class='hs-varid'>remain</span><span class='hs-layout'>)</span><span class='hs-conop'>:</span><span class='hs-varid'>parents</span> <span class='hs-comment'>-- node not found</span>
<a name="line-358"></a> <span class='hs-keyword'>in</span> <span class='hs-varid'>moveWithinLevel</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>d</span> <span class='hs-varop'>$</span> <span class='hs-keyword'>case</span> <span class='hs-varid'>ds</span> <span class='hs-keyword'>of</span>
<a name="line-359"></a> <span class='hs-conid'>[]</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>cache</span>
<a name="line-360"></a> <span class='hs-layout'>(</span><span class='hs-varid'>d'</span><span class='hs-conop'>:</span><span class='hs-keyword'>_</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>dropWhile</span> <span class='hs-layout'>(</span><span class='hs-varid'>isNonZero</span> <span class='hs-layout'>(</span><span class='hs-varid'>pos</span><span class='hs-varop'>+</span><span class='hs-varid'>d</span><span class='hs-layout'>)</span> <span class='hs-varid'>d'</span><span class='hs-layout'>)</span> <span class='hs-varid'>cache</span>
<a name="line-361"></a>
<a name="line-362"></a> <span class='hs-comment'>-- Descend into the topmost forest to find the goal iterator. The position</span>
<a name="line-363"></a> <span class='hs-comment'>-- and the remainding depths specify the index in the cache that is zero.</span>
<a name="line-364"></a> <span class='hs-comment'>-- All indices in front of pos coincide with that of the goal iterator.</span>
<a name="line-365"></a> <span class='hs-varid'>moveToChild</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Int</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Depth</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Cache</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Cache</span> <span class='hs-varid'>a</span>
<a name="line-366"></a> <span class='hs-varid'>moveToChild</span> <span class='hs-varid'>pos</span> <span class='hs-conid'>[]</span> <span class='hs-varid'>cache</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>cache</span> <span class='hs-comment'>-- we can't set more than the leaf</span>
<a name="line-367"></a> <span class='hs-varid'>moveToChild</span> <span class='hs-varid'>pos</span> <span class='hs-layout'>(</span><span class='hs-varid'>d</span><span class='hs-conop'>:</span><span class='hs-varid'>ds</span><span class='hs-layout'>)</span> <span class='hs-varid'>cache</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-layout'>(</span><span class='hs-varid'>ti</span><span class='hs-layout'>,</span><span class='hs-varid'>forest</span><span class='hs-layout'>)</span><span class='hs-conop'>:</span><span class='hs-varid'>parents</span><span class='hs-layout'>)</span>
<a name="line-368"></a> <span class='hs-keyglyph'>|</span> <span class='hs-varid'>getBitSlice</span> <span class='hs-varid'>goal</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>d</span> <span class='hs-varop'>==</span> <span class='hs-num'>0</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>cache</span>
<a name="line-369"></a> <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>case</span> <span class='hs-varid'>forest</span> <span class='hs-keyword'>of</span>
<a name="line-370"></a> <span class='hs-conid'>[]</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>cache</span> <span class='hs-comment'>-- impossible request</span>
<a name="line-371"></a> <span class='hs-conid'>Node</span> <span class='hs-layout'>{</span> <span class='hs-varid'>subForest</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>children</span> <span class='hs-layout'>}</span><span class='hs-conop'>:</span><span class='hs-keyword'>_</span> <span class='hs-keyglyph'>-></span>
<a name="line-372"></a> <span class='hs-keyword'>let</span>
<a name="line-373"></a> <span class='hs-varid'>childIdx</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Int</span>
<a name="line-374"></a> <span class='hs-varid'>childIdx</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>fromIntegral</span> <span class='hs-layout'>(</span><span class='hs-varid'>getBitSlice</span> <span class='hs-varid'>goal</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>d</span><span class='hs-layout'>)</span><span class='hs-comment'>-</span><span class='hs-num'>1</span>
<a name="line-375"></a> <span class='hs-layout'>(</span><span class='hs-varid'>dropped</span><span class='hs-layout'>,</span> <span class='hs-varid'>remain</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>splitAt</span> <span class='hs-varid'>childIdx</span> <span class='hs-varid'>children</span>
<a name="line-376"></a> <span class='hs-varid'>advanced</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>length</span> <span class='hs-varid'>dropped</span>
<a name="line-377"></a> <span class='hs-varid'>ti'</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>setBitSlice</span> <span class='hs-varid'>ti</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>d</span> <span class='hs-layout'>(</span><span class='hs-varid'>fromIntegral</span> <span class='hs-varid'>advanced</span><span class='hs-varop'>+</span><span class='hs-num'>1</span><span class='hs-layout'>)</span>
<a name="line-378"></a> <span class='hs-keyword'>in</span> <span class='hs-keyword'>if</span> <span class='hs-varid'>advanced</span><span class='hs-varop'><</span><span class='hs-varid'>childIdx</span> <span class='hs-keyword'>then</span> <span class='hs-layout'>(</span><span class='hs-layout'>(</span><span class='hs-varid'>ti'</span><span class='hs-layout'>,</span><span class='hs-varid'>remain</span><span class='hs-layout'>)</span><span class='hs-conop'>:</span><span class='hs-varid'>cache</span><span class='hs-layout'>)</span> <span class='hs-keyword'>else</span>
<a name="line-379"></a> <span class='hs-varid'>moveToChild</span> <span class='hs-layout'>(</span><span class='hs-varid'>pos</span><span class='hs-varop'>+</span><span class='hs-varid'>d</span><span class='hs-layout'>)</span> <span class='hs-varid'>ds</span> <span class='hs-layout'>(</span><span class='hs-layout'>(</span><span class='hs-varid'>ti'</span><span class='hs-layout'>,</span><span class='hs-varid'>remain</span><span class='hs-layout'>)</span><span class='hs-conop'>:</span><span class='hs-varid'>cache</span><span class='hs-layout'>)</span>
<a name="line-380"></a>
<a name="line-381"></a><a name="checkSuccess"></a><span class='hs-comment'>-- | Advance to the given iterator and return weather this was successful.</span>
<a name="line-382"></a><span class='hs-comment'>-- </span>
<a name="line-383"></a><span class='hs-definition'>checkSuccess</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Depth</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreeIter</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Cache</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-conid'>Bool</span><span class='hs-layout'>,</span> <span class='hs-conid'>Cache</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span>
<a name="line-384"></a><span class='hs-definition'>checkSuccess</span> <span class='hs-varid'>depth</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>cache</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>case</span> <span class='hs-varid'>advanceCache</span> <span class='hs-varid'>depth</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>cache</span> <span class='hs-keyword'>of</span>
<a name="line-385"></a> <span class='hs-varid'>cache'</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-layout'>(</span><span class='hs-varid'>cur</span><span class='hs-layout'>,</span><span class='hs-varid'>sibs</span><span class='hs-layout'>)</span><span class='hs-conop'>:</span><span class='hs-keyword'>_</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-varid'>cmp</span> <span class='hs-varid'>cur</span> <span class='hs-varid'>iter</span> <span class='hs-varop'>&&</span> <span class='hs-varid'>not</span> <span class='hs-layout'>(</span><span class='hs-varid'>null</span> <span class='hs-varid'>sibs</span><span class='hs-layout'>)</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache'</span><span class='hs-layout'>)</span>
<a name="line-386"></a> <span class='hs-conid'>[]</span> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-conid'>False</span><span class='hs-layout'>,</span> <span class='hs-conid'>[]</span><span class='hs-layout'>)</span>
<a name="line-387"></a> <span class='hs-keyword'>where</span>
<a name="line-388"></a> <span class='hs-varid'>cmp</span> <span class='hs-layout'>(</span><span class='hs-conid'>TreeIter</span> <span class='hs-keyword'>_</span> <span class='hs-varid'>a1</span> <span class='hs-varid'>b1</span> <span class='hs-varid'>c1</span><span class='hs-layout'>)</span> <span class='hs-layout'>(</span><span class='hs-conid'>TreeIter</span> <span class='hs-keyword'>_</span> <span class='hs-varid'>a2</span> <span class='hs-varid'>b2</span> <span class='hs-varid'>c2</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span>
<a name="line-389"></a> <span class='hs-varid'>a1</span><span class='hs-varop'>==</span><span class='hs-varid'>a2</span> <span class='hs-varop'>&&</span> <span class='hs-varid'>b1</span><span class='hs-varop'>==</span><span class='hs-varid'>b2</span> <span class='hs-varop'>&&</span> <span class='hs-varid'>c2</span><span class='hs-varop'>==</span><span class='hs-varid'>c2</span>
<a name="line-390"></a> <span class='hs-varid'>cache'</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-layout'>(</span><span class='hs-varid'>cur</span><span class='hs-layout'>,</span><span class='hs-varid'>sibs</span><span class='hs-layout'>)</span><span class='hs-conop'>:</span><span class='hs-keyword'>_</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>advanceCache</span> <span class='hs-varid'>depth</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>cache</span>
<a name="line-391"></a>
<a name="line-392"></a><a name="getTreeIterLeaf"></a><span class='hs-comment'>-- | Get the leaf index of this iterator.</span>
<a name="line-393"></a><span class='hs-comment'>--</span>
<a name="line-394"></a><span class='hs-comment'>-- * Due to the way we construct the 'TreeIter's, we can check which the last</span>
<a name="line-395"></a><span class='hs-comment'>-- level of an iterator is: The bit sequence of level n is zero if n is</span>
<a name="line-396"></a><span class='hs-comment'>-- greater or equal to the level that the iterator refers to. The returned</span>
<a name="line-397"></a><span class='hs-comment'>-- triple is (pos, leaf, zero) such that pos..pos+leaf denotes the leaf</span>
<a name="line-398"></a><span class='hs-comment'>-- index and pos+leaf..pos+leaf+zero denotes the bit field that is zero.</span>
<a name="line-399"></a><span class='hs-comment'>--</span>
<a name="line-400"></a><span class='hs-definition'>getTreeIterLeaf</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Depth</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreeIter</span> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-conid'>Int</span><span class='hs-layout'>,</span> <span class='hs-conid'>Int</span><span class='hs-layout'>,</span> <span class='hs-conid'>Int</span><span class='hs-layout'>)</span>
<a name="line-401"></a><span class='hs-definition'>getTreeIterLeaf</span> <span class='hs-varid'>ds</span> <span class='hs-varid'>ti</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>gTIL</span> <span class='hs-num'>0</span> <span class='hs-num'>0</span> <span class='hs-varid'>ds</span>
<a name="line-402"></a> <span class='hs-keyword'>where</span>
<a name="line-403"></a> <span class='hs-varid'>gTIL</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>dCur</span> <span class='hs-layout'>(</span><span class='hs-varid'>dNext</span><span class='hs-conop'>:</span><span class='hs-varid'>ds</span><span class='hs-layout'>)</span>
<a name="line-404"></a> <span class='hs-keyglyph'>|</span> <span class='hs-varid'>getBitSlice</span> <span class='hs-varid'>ti</span> <span class='hs-layout'>(</span><span class='hs-varid'>pos</span><span class='hs-varop'>+</span><span class='hs-varid'>dCur</span><span class='hs-layout'>)</span> <span class='hs-varid'>dNext</span><span class='hs-varop'>==</span><span class='hs-num'>0</span> <span class='hs-keyglyph'>=</span> <span class='hs-layout'>(</span><span class='hs-varid'>pos</span><span class='hs-layout'>,</span><span class='hs-varid'>dCur</span><span class='hs-layout'>,</span><span class='hs-varid'>dNext</span><span class='hs-layout'>)</span>
<a name="line-405"></a> <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>gTIL</span> <span class='hs-layout'>(</span><span class='hs-varid'>pos</span><span class='hs-varop'>+</span><span class='hs-varid'>dCur</span><span class='hs-layout'>)</span> <span class='hs-varid'>dNext</span> <span class='hs-varid'>ds</span>
<a name="line-406"></a> <span class='hs-varid'>gTIL</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>d</span> <span class='hs-conid'>[]</span> <span class='hs-keyglyph'>=</span> <span class='hs-layout'>(</span><span class='hs-varid'>pos</span><span class='hs-layout'>,</span> <span class='hs-varid'>d</span><span class='hs-layout'>,</span> <span class='hs-num'>0</span><span class='hs-layout'>)</span>
<a name="line-407"></a>
<a name="line-408"></a><a name="iterNext"></a><span class='hs-comment'>-- | Move an iterator forwards on the same level.</span>
<a name="line-409"></a><span class='hs-comment'>--</span>
<a name="line-410"></a><span class='hs-definition'>iterNext</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Depth</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreeIter</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Cache</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-conid'>Maybe</span> <span class='hs-conid'>TreeIter</span><span class='hs-layout'>,</span> <span class='hs-conid'>Cache</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span>
<a name="line-411"></a><span class='hs-definition'>iterNext</span> <span class='hs-varid'>depth</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>cache</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>let</span>
<a name="line-412"></a> <span class='hs-layout'>(</span><span class='hs-varid'>pos</span><span class='hs-layout'>,</span><span class='hs-varid'>leaf</span><span class='hs-layout'>,</span><span class='hs-varid'>child</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>getTreeIterLeaf</span> <span class='hs-varid'>depth</span> <span class='hs-varid'>iter</span>
<a name="line-413"></a> <span class='hs-varid'>curIdx</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>getBitSlice</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>leaf</span>
<a name="line-414"></a> <span class='hs-varid'>nextIdx</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>curIdx</span><span class='hs-varop'>+</span><span class='hs-num'>1</span>
<a name="line-415"></a> <span class='hs-varid'>nextIter</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>setBitSlice</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>leaf</span> <span class='hs-varid'>nextIdx</span>
<a name="line-416"></a> <span class='hs-keyword'>in</span>
<a name="line-417"></a> <span class='hs-keyword'>if</span> <span class='hs-varid'>nextIdx</span><span class='hs-varop'>==</span><span class='hs-varid'>bit</span> <span class='hs-varid'>leaf</span> <span class='hs-keyword'>then</span> <span class='hs-layout'>(</span><span class='hs-conid'>Nothing</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache</span><span class='hs-layout'>)</span> <span class='hs-keyword'>else</span>
<a name="line-418"></a> <span class='hs-keyword'>case</span> <span class='hs-varid'>checkSuccess</span> <span class='hs-varid'>depth</span> <span class='hs-varid'>nextIter</span> <span class='hs-varid'>cache</span> <span class='hs-keyword'>of</span>
<a name="line-419"></a> <span class='hs-layout'>(</span><span class='hs-conid'>True</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-conid'>Just</span> <span class='hs-varid'>nextIter</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache</span><span class='hs-layout'>)</span>
<a name="line-420"></a> <span class='hs-layout'>(</span><span class='hs-conid'>False</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-conid'>Nothing</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache</span><span class='hs-layout'>)</span>
<a name="line-421"></a>
<a name="line-422"></a><a name="iterNthChild"></a><span class='hs-comment'>-- | Move down to the child of the given iterator.</span>
<a name="line-423"></a><span class='hs-comment'>--</span>
<a name="line-424"></a><span class='hs-definition'>iterNthChild</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Depth</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Int</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreeIter</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Cache</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span>
<a name="line-425"></a> <span class='hs-layout'>(</span><span class='hs-conid'>Maybe</span> <span class='hs-conid'>TreeIter</span><span class='hs-layout'>,</span> <span class='hs-conid'>Cache</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span>
<a name="line-426"></a><span class='hs-definition'>iterNthChild</span> <span class='hs-varid'>depth</span> <span class='hs-varid'>childIdx_</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>cache</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>let</span>
<a name="line-427"></a> <span class='hs-layout'>(</span><span class='hs-varid'>pos</span><span class='hs-layout'>,</span><span class='hs-varid'>leaf</span><span class='hs-layout'>,</span><span class='hs-varid'>child</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>getTreeIterLeaf</span> <span class='hs-varid'>depth</span> <span class='hs-varid'>iter</span>
<a name="line-428"></a> <span class='hs-varid'>childIdx</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>fromIntegral</span> <span class='hs-varid'>childIdx_</span><span class='hs-varop'>+</span><span class='hs-num'>1</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Word</span>
<a name="line-429"></a> <span class='hs-varid'>nextIter</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>setBitSlice</span> <span class='hs-varid'>iter</span> <span class='hs-layout'>(</span><span class='hs-varid'>pos</span><span class='hs-varop'>+</span><span class='hs-varid'>leaf</span><span class='hs-layout'>)</span> <span class='hs-varid'>child</span> <span class='hs-varid'>childIdx</span>
<a name="line-430"></a> <span class='hs-keyword'>in</span>
<a name="line-431"></a> <span class='hs-keyword'>if</span> <span class='hs-varid'>childIdx</span><span class='hs-varop'>>=</span><span class='hs-varid'>bit</span> <span class='hs-varid'>child</span> <span class='hs-keyword'>then</span> <span class='hs-layout'>(</span><span class='hs-conid'>Nothing</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache</span><span class='hs-layout'>)</span> <span class='hs-keyword'>else</span>
<a name="line-432"></a> <span class='hs-keyword'>case</span> <span class='hs-varid'>checkSuccess</span> <span class='hs-varid'>depth</span> <span class='hs-varid'>nextIter</span> <span class='hs-varid'>cache</span> <span class='hs-keyword'>of</span>
<a name="line-433"></a> <span class='hs-layout'>(</span><span class='hs-conid'>True</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-conid'>Just</span> <span class='hs-varid'>nextIter</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache</span><span class='hs-layout'>)</span>
<a name="line-434"></a> <span class='hs-layout'>(</span><span class='hs-conid'>False</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-conid'>Nothing</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache</span><span class='hs-layout'>)</span>
<a name="line-435"></a>
<a name="line-436"></a><a name="iterNChildren"></a><span class='hs-comment'>-- | Descend to the first child.</span>
<a name="line-437"></a><span class='hs-comment'>--</span>
<a name="line-438"></a><span class='hs-definition'>iterNChildren</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Depth</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreeIter</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Cache</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-conid'>Int</span><span class='hs-layout'>,</span> <span class='hs-conid'>Cache</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span>
<a name="line-439"></a><span class='hs-definition'>iterNChildren</span> <span class='hs-varid'>depth</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>cache</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>case</span> <span class='hs-varid'>checkSuccess</span> <span class='hs-varid'>depth</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>cache</span> <span class='hs-keyword'>of</span>
<a name="line-440"></a> <span class='hs-layout'>(</span><span class='hs-conid'>True</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-layout'>(</span><span class='hs-keyword'>_</span><span class='hs-layout'>,</span><span class='hs-conid'>Node</span> <span class='hs-layout'>{</span> <span class='hs-varid'>subForest</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>forest</span><span class='hs-layout'>}</span><span class='hs-conop'>:</span><span class='hs-keyword'>_</span><span class='hs-layout'>)</span><span class='hs-conop'>:</span><span class='hs-keyword'>_</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-varid'>length</span> <span class='hs-varid'>forest</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache</span><span class='hs-layout'>)</span>
<a name="line-441"></a> <span class='hs-layout'>(</span><span class='hs-keyword'>_</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-num'>0</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache</span><span class='hs-layout'>)</span>
<a name="line-442"></a>
<a name="line-443"></a>
<a name="line-444"></a><a name="iterParent"></a><span class='hs-comment'>-- | Ascend to parent.</span>
<a name="line-445"></a><span class='hs-comment'>--</span>
<a name="line-446"></a><span class='hs-definition'>iterParent</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Depth</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreeIter</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Maybe</span> <span class='hs-conid'>TreeIter</span>
<a name="line-447"></a><span class='hs-definition'>iterParent</span> <span class='hs-varid'>depth</span> <span class='hs-varid'>iter</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>let</span>
<a name="line-448"></a> <span class='hs-layout'>(</span><span class='hs-varid'>pos</span><span class='hs-layout'>,</span><span class='hs-varid'>leaf</span><span class='hs-layout'>,</span><span class='hs-varid'>child</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>getTreeIterLeaf</span> <span class='hs-varid'>depth</span> <span class='hs-varid'>iter</span>
<a name="line-449"></a> <span class='hs-keyword'>in</span> <span class='hs-keyword'>if</span> <span class='hs-varid'>pos</span><span class='hs-varop'>==</span><span class='hs-num'>0</span> <span class='hs-keyword'>then</span> <span class='hs-conid'>Nothing</span> <span class='hs-keyword'>else</span>
<a name="line-450"></a> <span class='hs-keyword'>if</span> <span class='hs-varid'>getBitSlice</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>leaf</span><span class='hs-varop'>==</span><span class='hs-num'>0</span> <span class='hs-keyword'>then</span> <span class='hs-conid'>Nothing</span> <span class='hs-keyword'>else</span>
<a name="line-451"></a> <span class='hs-conid'>Just</span> <span class='hs-layout'>(</span><span class='hs-varid'>setBitSlice</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>leaf</span> <span class='hs-num'>0</span><span class='hs-layout'>)</span>
<a name="line-452"></a>
<a name="line-453"></a><a name="treeStoreInsertForest"></a><span class='hs-comment'>-- | Insert nodes into the store.</span>
<a name="line-454"></a><span class='hs-comment'>--</span>
<a name="line-455"></a><span class='hs-comment'>-- * The given list of nodes is inserted into given parent at @pos@.</span>
<a name="line-456"></a><span class='hs-comment'>-- If the parent existed, the function returns @Just path@ where @path@</span>
<a name="line-457"></a><span class='hs-comment'>-- is the position of the newly inserted elements. If @pos@ is negative</span>
<a name="line-458"></a><span class='hs-comment'>-- or greater or equal to the number of children of the node at @path@,</span>
<a name="line-459"></a><span class='hs-comment'>-- the new nodes are appended to the list.</span>
<a name="line-460"></a><span class='hs-comment'>--</span>
<a name="line-461"></a><span class='hs-definition'>treeStoreInsertForest</span> <span class='hs-keyglyph'>::</span>
<a name="line-462"></a> <span class='hs-conid'>TreeStore</span> <span class='hs-varid'>a</span> <span class='hs-comment'>-- ^ the store</span>
<a name="line-463"></a> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreePath</span> <span class='hs-comment'>-- ^ @path@ - the position of the parent</span>
<a name="line-464"></a> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Int</span> <span class='hs-comment'>-- ^ @pos@ - the index of the new tree</span>
<a name="line-465"></a> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Forest</span> <span class='hs-varid'>a</span> <span class='hs-comment'>-- ^ the list of trees to be inserted</span>
<a name="line-466"></a> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>IO</span> <span class='hs-conid'>()</span>
<a name="line-467"></a><span class='hs-definition'>treeStoreInsertForest</span> <span class='hs-layout'>(</span><span class='hs-conid'>TreeStore</span> <span class='hs-varid'>model</span><span class='hs-layout'>)</span> <span class='hs-varid'>path</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>nodes</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>do</span>
<a name="line-468"></a> <span class='hs-varid'>customStoreInvalidateIters</span> <span class='hs-varid'>model</span>
<a name="line-469"></a> <span class='hs-layout'>(</span><span class='hs-varid'>idx</span><span class='hs-layout'>,</span> <span class='hs-varid'>toggle</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'><-</span> <span class='hs-varid'>atomicModifyIORef</span> <span class='hs-layout'>(</span><span class='hs-varid'>customStoreGetPrivate</span> <span class='hs-varid'>model</span><span class='hs-layout'>)</span> <span class='hs-varop'>$</span>
<a name="line-470"></a> <span class='hs-keyglyph'>\</span><span class='hs-varid'>store</span><span class='hs-keyglyph'>@</span><span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>d</span><span class='hs-layout'>,</span> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>cache</span> <span class='hs-layout'>}</span> <span class='hs-keyglyph'>-></span>
<a name="line-471"></a> <span class='hs-keyword'>case</span> <span class='hs-varid'>insertIntoForest</span> <span class='hs-layout'>(</span><span class='hs-varid'>cacheToStore</span> <span class='hs-varid'>cache</span><span class='hs-layout'>)</span> <span class='hs-varid'>nodes</span> <span class='hs-varid'>path</span> <span class='hs-varid'>pos</span> <span class='hs-keyword'>of</span>
<a name="line-472"></a> <span class='hs-conid'>Nothing</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>error</span> <span class='hs-layout'>(</span><span class='hs-str'>"treeStoreInsertForest: path does not exist "</span> <span class='hs-varop'>++</span> <span class='hs-varid'>show</span> <span class='hs-varid'>path</span><span class='hs-layout'>)</span>
<a name="line-473"></a> <span class='hs-conid'>Just</span> <span class='hs-layout'>(</span><span class='hs-varid'>newForest</span><span class='hs-layout'>,</span> <span class='hs-varid'>idx</span><span class='hs-layout'>,</span> <span class='hs-varid'>toggle</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span>
<a name="line-474"></a> <span class='hs-keyword'>let</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>calcForestDepth</span> <span class='hs-varid'>newForest</span>
<a name="line-475"></a> <span class='hs-keyword'>in</span> <span class='hs-layout'>(</span><span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>depth</span><span class='hs-layout'>,</span>
<a name="line-476"></a> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>storeToCache</span> <span class='hs-varid'>newForest</span> <span class='hs-layout'>}</span><span class='hs-layout'>,</span>
<a name="line-477"></a> <span class='hs-layout'>(</span><span class='hs-varid'>idx</span><span class='hs-layout'>,</span> <span class='hs-varid'>toggle</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span>
<a name="line-478"></a> <span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>depth</span> <span class='hs-layout'>}</span> <span class='hs-keyglyph'><-</span> <span class='hs-varid'>readIORef</span> <span class='hs-layout'>(</span><span class='hs-varid'>customStoreGetPrivate</span> <span class='hs-varid'>model</span><span class='hs-layout'>)</span>
<a name="line-479"></a> <span class='hs-keyword'>let</span> <span class='hs-varid'>rpath</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>reverse</span> <span class='hs-varid'>path</span>
<a name="line-480"></a> <span class='hs-varid'>stamp</span> <span class='hs-keyglyph'><-</span> <span class='hs-varid'>customStoreGetStamp</span> <span class='hs-varid'>model</span>
<a name="line-481"></a> <span class='hs-varid'>sequence_</span> <span class='hs-keyglyph'>[</span> <span class='hs-keyword'>let</span> <span class='hs-varid'>p'</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>reverse</span> <span class='hs-varid'>p</span>
<a name="line-482"></a> <span class='hs-conid'>Just</span> <span class='hs-varid'>iter</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>fromPath</span> <span class='hs-varid'>depth</span> <span class='hs-varid'>p'</span>
<a name="line-483"></a> <span class='hs-keyword'>in</span> <span class='hs-varid'>treeModelRowInserted</span> <span class='hs-varid'>model</span> <span class='hs-varid'>p'</span> <span class='hs-layout'>(</span><span class='hs-varid'>treeIterSetStamp</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>stamp</span><span class='hs-layout'>)</span>
<a name="line-484"></a> <span class='hs-keyglyph'>|</span> <span class='hs-layout'>(</span><span class='hs-varid'>i</span><span class='hs-layout'>,</span> <span class='hs-varid'>node</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'><-</span> <span class='hs-varid'>zip</span> <span class='hs-keyglyph'>[</span><span class='hs-varid'>idx</span><span class='hs-keyglyph'>..</span><span class='hs-keyglyph'>]</span> <span class='hs-varid'>nodes</span>
<a name="line-485"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>p</span> <span class='hs-keyglyph'><-</span> <span class='hs-varid'>paths</span> <span class='hs-layout'>(</span><span class='hs-varid'>i</span> <span class='hs-conop'>:</span> <span class='hs-varid'>rpath</span><span class='hs-layout'>)</span> <span class='hs-varid'>node</span> <span class='hs-keyglyph'>]</span>
<a name="line-486"></a> <span class='hs-keyword'>let</span> <span class='hs-conid'>Just</span> <span class='hs-varid'>iter</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>fromPath</span> <span class='hs-varid'>depth</span> <span class='hs-varid'>path</span>
<a name="line-487"></a> <span class='hs-varid'>when</span> <span class='hs-varid'>toggle</span> <span class='hs-varop'>$</span> <span class='hs-varid'>treeModelRowHasChildToggled</span> <span class='hs-varid'>model</span> <span class='hs-varid'>path</span>
<a name="line-488"></a> <span class='hs-layout'>(</span><span class='hs-varid'>treeIterSetStamp</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>stamp</span><span class='hs-layout'>)</span>
<a name="line-489"></a>
<a name="line-490"></a> <span class='hs-keyword'>where</span> <span class='hs-varid'>paths</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>TreePath</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Tree</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-keyglyph'>[</span><span class='hs-conid'>TreePath</span><span class='hs-keyglyph'>]</span>
<a name="line-491"></a> <span class='hs-varid'>paths</span> <span class='hs-varid'>path</span> <span class='hs-conid'>Node</span> <span class='hs-layout'>{</span> <span class='hs-varid'>subForest</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>ts</span> <span class='hs-layout'>}</span> <span class='hs-keyglyph'>=</span>
<a name="line-492"></a> <span class='hs-varid'>path</span> <span class='hs-conop'>:</span> <span class='hs-varid'>concat</span> <span class='hs-keyglyph'>[</span> <span class='hs-varid'>paths</span> <span class='hs-layout'>(</span><span class='hs-varid'>n</span><span class='hs-conop'>:</span><span class='hs-varid'>path</span><span class='hs-layout'>)</span> <span class='hs-varid'>t</span> <span class='hs-keyglyph'>|</span> <span class='hs-layout'>(</span><span class='hs-varid'>n</span><span class='hs-layout'>,</span> <span class='hs-varid'>t</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'><-</span> <span class='hs-varid'>zip</span> <span class='hs-keyglyph'>[</span><span class='hs-num'>0</span><span class='hs-keyglyph'>..</span><span class='hs-keyglyph'>]</span> <span class='hs-varid'>ts</span> <span class='hs-keyglyph'>]</span>
<a name="line-493"></a>
<a name="line-494"></a><a name="treeStoreInsertTree"></a><span class='hs-comment'>-- | Insert a node into the store.</span>
<a name="line-495"></a><span class='hs-comment'>--</span>
<a name="line-496"></a><span class='hs-definition'>treeStoreInsertTree</span> <span class='hs-keyglyph'>::</span>
<a name="line-497"></a> <span class='hs-conid'>TreeStore</span> <span class='hs-varid'>a</span> <span class='hs-comment'>-- ^ the store</span>
<a name="line-498"></a> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreePath</span> <span class='hs-comment'>-- ^ @path@ - the position of the parent</span>
<a name="line-499"></a> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Int</span> <span class='hs-comment'>-- ^ @pos@ - the index of the new tree</span>
<a name="line-500"></a> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Tree</span> <span class='hs-varid'>a</span> <span class='hs-comment'>-- ^ the value to be inserted</span>
<a name="line-501"></a> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>IO</span> <span class='hs-conid'>()</span>
<a name="line-502"></a><span class='hs-definition'>treeStoreInsertTree</span> <span class='hs-varid'>store</span> <span class='hs-varid'>path</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>node</span> <span class='hs-keyglyph'>=</span>
<a name="line-503"></a> <span class='hs-varid'>treeStoreInsertForest</span> <span class='hs-varid'>store</span> <span class='hs-varid'>path</span> <span class='hs-varid'>pos</span> <span class='hs-keyglyph'>[</span><span class='hs-varid'>node</span><span class='hs-keyglyph'>]</span>
<a name="line-504"></a>
<a name="line-505"></a><a name="treeStoreInsert"></a><span class='hs-comment'>-- | Insert a single node into the store.</span>
<a name="line-506"></a><span class='hs-comment'>--</span>
<a name="line-507"></a><span class='hs-comment'>-- * This function inserts a single node without children into the tree.</span>
<a name="line-508"></a><span class='hs-comment'>-- Its arguments are similar to those of 'treeStoreInsert'.</span>
<a name="line-509"></a><span class='hs-comment'>--</span>
<a name="line-510"></a><span class='hs-definition'>treeStoreInsert</span> <span class='hs-keyglyph'>::</span>
<a name="line-511"></a> <span class='hs-conid'>TreeStore</span> <span class='hs-varid'>a</span> <span class='hs-comment'>-- ^ the store</span>
<a name="line-512"></a> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreePath</span> <span class='hs-comment'>-- ^ @path@ - the position of the parent</span>
<a name="line-513"></a> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Int</span> <span class='hs-comment'>-- ^ @pos@ - the index of the new tree</span>
<a name="line-514"></a> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>a</span> <span class='hs-comment'>-- ^ the value to be inserted</span>
<a name="line-515"></a> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>IO</span> <span class='hs-conid'>()</span>
<a name="line-516"></a><span class='hs-definition'>treeStoreInsert</span> <span class='hs-varid'>store</span> <span class='hs-varid'>path</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>node</span> <span class='hs-keyglyph'>=</span>
<a name="line-517"></a> <span class='hs-varid'>treeStoreInsertForest</span> <span class='hs-varid'>store</span> <span class='hs-varid'>path</span> <span class='hs-varid'>pos</span> <span class='hs-keyglyph'>[</span><span class='hs-conid'>Node</span> <span class='hs-varid'>node</span> <span class='hs-conid'>[]</span><span class='hs-keyglyph'>]</span>
<a name="line-518"></a>
<a name="line-519"></a><a name="insertIntoForest"></a><span class='hs-comment'>-- | Insert nodes into a forest.</span>
<a name="line-520"></a><span class='hs-comment'>--</span>
<a name="line-521"></a><span class='hs-comment'>-- * If the parent was found, returns the new tree, the child number</span>
<a name="line-522"></a><span class='hs-comment'>-- and a flag denoting if these new nodes were the first children</span>
<a name="line-523"></a><span class='hs-comment'>-- of the parent.</span>
<a name="line-524"></a><span class='hs-comment'>--</span>
<a name="line-525"></a><span class='hs-definition'>insertIntoForest</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Forest</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Forest</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreePath</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Int</span> <span class='hs-keyglyph'>-></span>
<a name="line-526"></a> <span class='hs-conid'>Maybe</span> <span class='hs-layout'>(</span><span class='hs-conid'>Forest</span> <span class='hs-varid'>a</span><span class='hs-layout'>,</span> <span class='hs-conid'>Int</span><span class='hs-layout'>,</span> <span class='hs-conid'>Bool</span><span class='hs-layout'>)</span>
<a name="line-527"></a><span class='hs-definition'>insertIntoForest</span> <span class='hs-varid'>forest</span> <span class='hs-varid'>nodes</span> <span class='hs-conid'>[]</span> <span class='hs-varid'>pos</span>
<a name="line-528"></a> <span class='hs-keyglyph'>|</span> <span class='hs-varid'>pos</span><span class='hs-varop'><</span><span class='hs-num'>0</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Just</span> <span class='hs-layout'>(</span><span class='hs-varid'>forest</span><span class='hs-varop'>++</span><span class='hs-varid'>nodes</span><span class='hs-layout'>,</span> <span class='hs-varid'>length</span> <span class='hs-varid'>forest</span><span class='hs-layout'>,</span> <span class='hs-varid'>null</span> <span class='hs-varid'>forest</span><span class='hs-layout'>)</span>
<a name="line-529"></a> <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Just</span> <span class='hs-layout'>(</span><span class='hs-varid'>prev</span><span class='hs-varop'>++</span><span class='hs-varid'>nodes</span><span class='hs-varop'>++</span><span class='hs-varid'>next</span><span class='hs-layout'>,</span> <span class='hs-varid'>length</span> <span class='hs-varid'>prev</span><span class='hs-layout'>,</span> <span class='hs-varid'>null</span> <span class='hs-varid'>forest</span><span class='hs-layout'>)</span>
<a name="line-530"></a> <span class='hs-keyword'>where</span> <span class='hs-layout'>(</span><span class='hs-varid'>prev</span><span class='hs-layout'>,</span> <span class='hs-varid'>next</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>splitAt</span> <span class='hs-varid'>pos</span> <span class='hs-varid'>forest</span>
<a name="line-531"></a><span class='hs-definition'>insertIntoForest</span> <span class='hs-varid'>forest</span> <span class='hs-varid'>nodes</span> <span class='hs-layout'>(</span><span class='hs-varid'>p</span><span class='hs-conop'>:</span><span class='hs-varid'>ps</span><span class='hs-layout'>)</span> <span class='hs-varid'>pos</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>case</span> <span class='hs-varid'>splitAt</span> <span class='hs-varid'>p</span> <span class='hs-varid'>forest</span> <span class='hs-keyword'>of</span>
<a name="line-532"></a> <span class='hs-layout'>(</span><span class='hs-varid'>prev</span><span class='hs-layout'>,</span> <span class='hs-conid'>[]</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Nothing</span>
<a name="line-533"></a> <span class='hs-layout'>(</span><span class='hs-varid'>prev</span><span class='hs-layout'>,</span> <span class='hs-conid'>Node</span> <span class='hs-layout'>{</span> <span class='hs-varid'>rootLabel</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>val</span><span class='hs-layout'>,</span>
<a name="line-534"></a> <span class='hs-varid'>subForest</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>for</span><span class='hs-layout'>}</span><span class='hs-conop'>:</span><span class='hs-varid'>next</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span>
<a name="line-535"></a> <span class='hs-keyword'>case</span> <span class='hs-varid'>insertIntoForest</span> <span class='hs-varid'>for</span> <span class='hs-varid'>nodes</span> <span class='hs-varid'>ps</span> <span class='hs-varid'>pos</span> <span class='hs-keyword'>of</span>
<a name="line-536"></a> <span class='hs-conid'>Nothing</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Nothing</span>
<a name="line-537"></a> <span class='hs-conid'>Just</span> <span class='hs-layout'>(</span><span class='hs-varid'>for</span><span class='hs-layout'>,</span> <span class='hs-varid'>pos</span><span class='hs-layout'>,</span> <span class='hs-varid'>toggle</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Just</span> <span class='hs-layout'>(</span><span class='hs-varid'>prev</span><span class='hs-varop'>++</span><span class='hs-conid'>Node</span> <span class='hs-layout'>{</span> <span class='hs-varid'>rootLabel</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>val</span><span class='hs-layout'>,</span>
<a name="line-538"></a> <span class='hs-varid'>subForest</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>for</span> <span class='hs-layout'>}</span><span class='hs-conop'>:</span><span class='hs-varid'>next</span><span class='hs-layout'>,</span>
<a name="line-539"></a> <span class='hs-varid'>pos</span><span class='hs-layout'>,</span> <span class='hs-varid'>toggle</span><span class='hs-layout'>)</span>
<a name="line-540"></a>
<a name="line-541"></a><a name="treeStoreRemove"></a><span class='hs-comment'>-- | Remove a node from the store.</span>
<a name="line-542"></a><span class='hs-comment'>--</span>
<a name="line-543"></a><span class='hs-comment'>-- * The node denoted by the path is removed, along with all its children.</span>
<a name="line-544"></a><span class='hs-comment'>-- The function returns @True@ if the given node was found.</span>
<a name="line-545"></a><span class='hs-comment'>--</span>
<a name="line-546"></a><span class='hs-definition'>treeStoreRemove</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>TreeStore</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreePath</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>IO</span> <span class='hs-conid'>Bool</span>
<a name="line-547"></a> <span class='hs-comment'>--TODO: eliminate this special case without segfaulting!</span>
<a name="line-548"></a><span class='hs-definition'>treeStoreRemove</span> <span class='hs-layout'>(</span><span class='hs-conid'>TreeStore</span> <span class='hs-varid'>model</span><span class='hs-layout'>)</span> <span class='hs-conid'>[]</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>return</span> <span class='hs-conid'>False</span>
<a name="line-549"></a><span class='hs-definition'>treeStoreRemove</span> <span class='hs-layout'>(</span><span class='hs-conid'>TreeStore</span> <span class='hs-varid'>model</span><span class='hs-layout'>)</span> <span class='hs-varid'>path</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>do</span>
<a name="line-550"></a> <span class='hs-varid'>customStoreInvalidateIters</span> <span class='hs-varid'>model</span>
<a name="line-551"></a> <span class='hs-layout'>(</span><span class='hs-varid'>found</span><span class='hs-layout'>,</span> <span class='hs-varid'>toggle</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'><-</span> <span class='hs-varid'>atomicModifyIORef</span> <span class='hs-layout'>(</span><span class='hs-varid'>customStoreGetPrivate</span> <span class='hs-varid'>model</span><span class='hs-layout'>)</span> <span class='hs-varop'>$</span>
<a name="line-552"></a> <span class='hs-keyglyph'>\</span><span class='hs-varid'>store</span><span class='hs-keyglyph'>@</span><span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>d</span><span class='hs-layout'>,</span> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>cache</span> <span class='hs-layout'>}</span> <span class='hs-keyglyph'>-></span>
<a name="line-553"></a> <span class='hs-keyword'>if</span> <span class='hs-varid'>null</span> <span class='hs-varid'>cache</span> <span class='hs-keyword'>then</span> <span class='hs-layout'>(</span><span class='hs-varid'>store</span><span class='hs-layout'>,</span> <span class='hs-layout'>(</span><span class='hs-conid'>False</span><span class='hs-layout'>,</span> <span class='hs-conid'>False</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span> <span class='hs-keyword'>else</span>
<a name="line-554"></a> <span class='hs-keyword'>case</span> <span class='hs-varid'>deleteFromForest</span> <span class='hs-layout'>(</span><span class='hs-varid'>cacheToStore</span> <span class='hs-varid'>cache</span><span class='hs-layout'>)</span> <span class='hs-varid'>path</span> <span class='hs-keyword'>of</span>
<a name="line-555"></a> <span class='hs-conid'>Nothing</span> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-varid'>store</span><span class='hs-layout'>,</span> <span class='hs-layout'>(</span><span class='hs-conid'>False</span><span class='hs-layout'>,</span> <span class='hs-conid'>False</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span>
<a name="line-556"></a> <span class='hs-conid'>Just</span> <span class='hs-layout'>(</span><span class='hs-varid'>newForest</span><span class='hs-layout'>,</span> <span class='hs-varid'>toggle</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span>
<a name="line-557"></a> <span class='hs-layout'>(</span><span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>d</span><span class='hs-layout'>,</span> <span class='hs-comment'>-- this might be a space leak</span>
<a name="line-558"></a> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>storeToCache</span> <span class='hs-varid'>newForest</span> <span class='hs-layout'>}</span><span class='hs-layout'>,</span> <span class='hs-layout'>(</span><span class='hs-conid'>True</span><span class='hs-layout'>,</span> <span class='hs-varid'>toggle</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span>
<a name="line-559"></a> <span class='hs-varid'>when</span> <span class='hs-varid'>found</span> <span class='hs-varop'>$</span> <span class='hs-keyword'>do</span>
<a name="line-560"></a> <span class='hs-varid'>when</span> <span class='hs-layout'>(</span><span class='hs-varid'>toggle</span> <span class='hs-varop'>&&</span> <span class='hs-varid'>not</span> <span class='hs-layout'>(</span><span class='hs-varid'>null</span> <span class='hs-varid'>path</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span> <span class='hs-varop'>$</span> <span class='hs-keyword'>do</span>
<a name="line-561"></a> <span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>depth</span> <span class='hs-layout'>}</span> <span class='hs-keyglyph'><-</span> <span class='hs-varid'>readIORef</span> <span class='hs-layout'>(</span><span class='hs-varid'>customStoreGetPrivate</span> <span class='hs-varid'>model</span><span class='hs-layout'>)</span>
<a name="line-562"></a> <span class='hs-keyword'>let</span> <span class='hs-varid'>parent</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>init</span> <span class='hs-varid'>path</span>
<a name="line-563"></a> <span class='hs-conid'>Just</span> <span class='hs-varid'>iter</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>fromPath</span> <span class='hs-varid'>depth</span> <span class='hs-varid'>parent</span>
<a name="line-564"></a> <span class='hs-varid'>treeModelRowHasChildToggled</span> <span class='hs-varid'>model</span> <span class='hs-varid'>parent</span> <span class='hs-varid'>iter</span>
<a name="line-565"></a> <span class='hs-varid'>treeModelRowDeleted</span> <span class='hs-varid'>model</span> <span class='hs-varid'>path</span>
<a name="line-566"></a> <span class='hs-varid'>return</span> <span class='hs-varid'>found</span>
<a name="line-567"></a>
<a name="line-568"></a><a name="treeStoreClear"></a><span class='hs-definition'>treeStoreClear</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>TreeStore</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>IO</span> <span class='hs-conid'>()</span>
<a name="line-569"></a><span class='hs-definition'>treeStoreClear</span> <span class='hs-layout'>(</span><span class='hs-conid'>TreeStore</span> <span class='hs-varid'>model</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>do</span>
<a name="line-570"></a> <span class='hs-varid'>customStoreInvalidateIters</span> <span class='hs-varid'>model</span>
<a name="line-571"></a> <span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>cache</span> <span class='hs-layout'>}</span> <span class='hs-keyglyph'><-</span> <span class='hs-varid'>readIORef</span> <span class='hs-layout'>(</span><span class='hs-varid'>customStoreGetPrivate</span> <span class='hs-varid'>model</span><span class='hs-layout'>)</span>
<a name="line-572"></a> <span class='hs-keyword'>let</span> <span class='hs-varid'>forest</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>cacheToStore</span> <span class='hs-varid'>cache</span>
<a name="line-573"></a> <span class='hs-varid'>writeIORef</span> <span class='hs-layout'>(</span><span class='hs-varid'>customStoreGetPrivate</span> <span class='hs-varid'>model</span><span class='hs-layout'>)</span> <span class='hs-conid'>Store</span> <span class='hs-layout'>{</span>
<a name="line-574"></a> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>calcForestDepth</span> <span class='hs-conid'>[]</span><span class='hs-layout'>,</span>
<a name="line-575"></a> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>storeToCache</span> <span class='hs-conid'>[]</span>
<a name="line-576"></a> <span class='hs-layout'>}</span>
<a name="line-577"></a> <span class='hs-keyword'>let</span> <span class='hs-varid'>loop</span> <span class='hs-layout'>(</span><span class='hs-comment'>-</span><span class='hs-num'>1</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>return</span> <span class='hs-conid'>()</span>
<a name="line-578"></a> <span class='hs-varid'>loop</span> <span class='hs-varid'>n</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>treeModelRowDeleted</span> <span class='hs-varid'>model</span> <span class='hs-keyglyph'>[</span><span class='hs-varid'>n</span><span class='hs-keyglyph'>]</span> <span class='hs-varop'>>></span> <span class='hs-varid'>loop</span> <span class='hs-layout'>(</span><span class='hs-varid'>n</span><span class='hs-comment'>-</span><span class='hs-num'>1</span><span class='hs-layout'>)</span>
<a name="line-579"></a> <span class='hs-varid'>loop</span> <span class='hs-layout'>(</span><span class='hs-varid'>length</span> <span class='hs-varid'>forest</span> <span class='hs-comment'>-</span> <span class='hs-num'>1</span><span class='hs-layout'>)</span>
<a name="line-580"></a>
<a name="line-581"></a><a name="deleteFromForest"></a><span class='hs-comment'>-- | Remove a node from a rose tree.</span>
<a name="line-582"></a><span class='hs-comment'>--</span>
<a name="line-583"></a><span class='hs-comment'>-- * Returns the new tree if the node was found. The returned flag is</span>
<a name="line-584"></a><span class='hs-comment'>-- @True@ if deleting the node left the parent without any children.</span>
<a name="line-585"></a><span class='hs-comment'>--</span>
<a name="line-586"></a><span class='hs-definition'>deleteFromForest</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Forest</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreePath</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Maybe</span> <span class='hs-layout'>(</span><span class='hs-conid'>Forest</span> <span class='hs-varid'>a</span><span class='hs-layout'>,</span> <span class='hs-conid'>Bool</span><span class='hs-layout'>)</span>
<a name="line-587"></a><span class='hs-definition'>deleteFromForest</span> <span class='hs-varid'>forest</span> <span class='hs-conid'>[]</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Just</span> <span class='hs-layout'>(</span><span class='hs-conid'>[]</span><span class='hs-layout'>,</span> <span class='hs-conid'>False</span><span class='hs-layout'>)</span>
<a name="line-588"></a><span class='hs-definition'>deleteFromForest</span> <span class='hs-varid'>forest</span> <span class='hs-layout'>(</span><span class='hs-varid'>p</span><span class='hs-conop'>:</span><span class='hs-varid'>ps</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span>
<a name="line-589"></a> <span class='hs-keyword'>case</span> <span class='hs-varid'>splitAt</span> <span class='hs-varid'>p</span> <span class='hs-varid'>forest</span> <span class='hs-keyword'>of</span>
<a name="line-590"></a> <span class='hs-layout'>(</span><span class='hs-varid'>prev</span><span class='hs-layout'>,</span> <span class='hs-varid'>kill</span><span class='hs-keyglyph'>@</span><span class='hs-conid'>Node</span> <span class='hs-layout'>{</span> <span class='hs-varid'>rootLabel</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>val</span><span class='hs-layout'>,</span>
<a name="line-591"></a> <span class='hs-varid'>subForest</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>for</span><span class='hs-layout'>}</span><span class='hs-conop'>:</span><span class='hs-varid'>next</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span>
<a name="line-592"></a> <span class='hs-keyword'>if</span> <span class='hs-varid'>null</span> <span class='hs-varid'>ps</span> <span class='hs-keyword'>then</span> <span class='hs-conid'>Just</span> <span class='hs-layout'>(</span><span class='hs-varid'>prev</span><span class='hs-varop'>++</span><span class='hs-varid'>next</span><span class='hs-layout'>,</span> <span class='hs-varid'>null</span> <span class='hs-varid'>prev</span> <span class='hs-varop'>&&</span> <span class='hs-varid'>null</span> <span class='hs-varid'>next</span><span class='hs-layout'>)</span> <span class='hs-keyword'>else</span>
<a name="line-593"></a> <span class='hs-keyword'>case</span> <span class='hs-varid'>deleteFromForest</span> <span class='hs-varid'>for</span> <span class='hs-varid'>ps</span> <span class='hs-keyword'>of</span>
<a name="line-594"></a> <span class='hs-conid'>Nothing</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Nothing</span>
<a name="line-595"></a> <span class='hs-conid'>Just</span> <span class='hs-layout'>(</span><span class='hs-varid'>for</span><span class='hs-layout'>,</span><span class='hs-varid'>toggle</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Just</span> <span class='hs-layout'>(</span><span class='hs-varid'>prev</span><span class='hs-varop'>++</span><span class='hs-conid'>Node</span> <span class='hs-layout'>{</span><span class='hs-varid'>rootLabel</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>val</span><span class='hs-layout'>,</span>
<a name="line-596"></a> <span class='hs-varid'>subForest</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>for</span> <span class='hs-layout'>}</span><span class='hs-conop'>:</span><span class='hs-varid'>next</span><span class='hs-layout'>,</span> <span class='hs-varid'>toggle</span><span class='hs-layout'>)</span>
<a name="line-597"></a> <span class='hs-layout'>(</span><span class='hs-varid'>prev</span><span class='hs-layout'>,</span> <span class='hs-conid'>[]</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Nothing</span>
<a name="line-598"></a>
<a name="line-599"></a>
<a name="line-600"></a><a name="treeStoreSetValue"></a><span class='hs-comment'>-- | Set a node in the store.</span>
<a name="line-601"></a><span class='hs-comment'>--</span>
<a name="line-602"></a><span class='hs-definition'>treeStoreSetValue</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>TreeStore</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreePath</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>IO</span> <span class='hs-conid'>()</span>
<a name="line-603"></a><span class='hs-definition'>treeStoreSetValue</span> <span class='hs-varid'>store</span> <span class='hs-varid'>path</span> <span class='hs-varid'>value</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>treeStoreChangeM</span> <span class='hs-varid'>store</span> <span class='hs-varid'>path</span> <span class='hs-layout'>(</span><span class='hs-keyglyph'>\</span><span class='hs-keyword'>_</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>return</span> <span class='hs-varid'>value</span><span class='hs-layout'>)</span>
<a name="line-604"></a> <span class='hs-varop'>>></span> <span class='hs-varid'>return</span> <span class='hs-conid'>()</span>
<a name="line-605"></a>
<a name="line-606"></a>
<a name="line-607"></a><a name="treeStoreChange"></a><span class='hs-comment'>-- | Change a node in the store.</span>
<a name="line-608"></a><span class='hs-comment'>--</span>
<a name="line-609"></a><span class='hs-comment'>-- * Returns @True@ if the node was found. For a monadic version, see</span>
<a name="line-610"></a><span class='hs-comment'>-- 'treeStoreChangeM'.</span>
<a name="line-611"></a><span class='hs-comment'>--</span>
<a name="line-612"></a><span class='hs-definition'>treeStoreChange</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>TreeStore</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreePath</span> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>IO</span> <span class='hs-conid'>Bool</span>
<a name="line-613"></a><span class='hs-definition'>treeStoreChange</span> <span class='hs-varid'>store</span> <span class='hs-varid'>path</span> <span class='hs-varid'>func</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>treeStoreChangeM</span> <span class='hs-varid'>store</span> <span class='hs-varid'>path</span> <span class='hs-layout'>(</span><span class='hs-varid'>return</span> <span class='hs-varop'>.</span> <span class='hs-varid'>func</span><span class='hs-layout'>)</span>
<a name="line-614"></a>
<a name="line-615"></a>
<a name="line-616"></a><a name="treeStoreChangeM"></a><span class='hs-comment'>-- | Change a node in the store.</span>
<a name="line-617"></a><span class='hs-comment'>--</span>
<a name="line-618"></a><span class='hs-comment'>-- * Returns @True@ if the node was found. For a purely functional version, see</span>
<a name="line-619"></a><span class='hs-comment'>-- 'treeStoreChange'.</span>
<a name="line-620"></a><span class='hs-comment'>--</span>
<a name="line-621"></a><span class='hs-definition'>treeStoreChangeM</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>TreeStore</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreePath</span> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>IO</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>IO</span> <span class='hs-conid'>Bool</span>
<a name="line-622"></a><span class='hs-definition'>treeStoreChangeM</span> <span class='hs-layout'>(</span><span class='hs-conid'>TreeStore</span> <span class='hs-varid'>model</span><span class='hs-layout'>)</span> <span class='hs-varid'>path</span> <span class='hs-varid'>act</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>do</span>
<a name="line-623"></a> <span class='hs-varid'>customStoreInvalidateIters</span> <span class='hs-varid'>model</span>
<a name="line-624"></a> <span class='hs-varid'>store</span><span class='hs-keyglyph'>@</span><span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>d</span><span class='hs-layout'>,</span> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>cache</span> <span class='hs-layout'>}</span> <span class='hs-keyglyph'><-</span>
<a name="line-625"></a> <span class='hs-varid'>readIORef</span> <span class='hs-layout'>(</span><span class='hs-varid'>customStoreGetPrivate</span> <span class='hs-varid'>model</span><span class='hs-layout'>)</span>
<a name="line-626"></a> <span class='hs-layout'>(</span><span class='hs-varid'>store'</span><span class='hs-keyglyph'>@</span><span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>d</span><span class='hs-layout'>,</span> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>cache</span> <span class='hs-layout'>}</span><span class='hs-layout'>,</span> <span class='hs-varid'>found</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'><-</span> <span class='hs-keyword'>do</span>
<a name="line-627"></a> <span class='hs-varid'>mRes</span> <span class='hs-keyglyph'><-</span> <span class='hs-varid'>changeForest</span> <span class='hs-layout'>(</span><span class='hs-varid'>cacheToStore</span> <span class='hs-varid'>cache</span><span class='hs-layout'>)</span> <span class='hs-varid'>act</span> <span class='hs-varid'>path</span>
<a name="line-628"></a> <span class='hs-varid'>return</span> <span class='hs-varop'>$</span> <span class='hs-keyword'>case</span> <span class='hs-varid'>mRes</span> <span class='hs-keyword'>of</span>
<a name="line-629"></a> <span class='hs-conid'>Nothing</span> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-varid'>store</span><span class='hs-layout'>,</span> <span class='hs-conid'>False</span><span class='hs-layout'>)</span>
<a name="line-630"></a> <span class='hs-conid'>Just</span> <span class='hs-varid'>newForest</span> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>d</span><span class='hs-layout'>,</span>
<a name="line-631"></a> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>storeToCache</span> <span class='hs-varid'>newForest</span> <span class='hs-layout'>}</span><span class='hs-layout'>,</span> <span class='hs-conid'>True</span><span class='hs-layout'>)</span>
<a name="line-632"></a> <span class='hs-varid'>writeIORef</span> <span class='hs-layout'>(</span><span class='hs-varid'>customStoreGetPrivate</span> <span class='hs-varid'>model</span><span class='hs-layout'>)</span> <span class='hs-varid'>store'</span>
<a name="line-633"></a> <span class='hs-keyword'>let</span> <span class='hs-conid'>Just</span> <span class='hs-varid'>iter</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>fromPath</span> <span class='hs-varid'>d</span> <span class='hs-varid'>path</span>
<a name="line-634"></a> <span class='hs-varid'>stamp</span> <span class='hs-keyglyph'><-</span> <span class='hs-varid'>customStoreGetStamp</span> <span class='hs-varid'>model</span>
<a name="line-635"></a> <span class='hs-varid'>when</span> <span class='hs-varid'>found</span> <span class='hs-varop'>$</span> <span class='hs-varid'>treeModelRowChanged</span> <span class='hs-varid'>model</span> <span class='hs-varid'>path</span> <span class='hs-layout'>(</span><span class='hs-varid'>treeIterSetStamp</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>stamp</span><span class='hs-layout'>)</span>
<a name="line-636"></a> <span class='hs-varid'>return</span> <span class='hs-varid'>found</span>
<a name="line-637"></a>
<a name="line-638"></a><a name="changeForest"></a><span class='hs-comment'>-- | Change a node in the forest.</span>
<a name="line-639"></a><span class='hs-comment'>--</span>
<a name="line-640"></a><span class='hs-comment'>-- * Returns @True@ if the given node was found.</span>
<a name="line-641"></a><span class='hs-comment'>--</span>
<a name="line-642"></a><span class='hs-definition'>changeForest</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Forest</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>IO</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreePath</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>IO</span> <span class='hs-layout'>(</span><span class='hs-conid'>Maybe</span> <span class='hs-layout'>(</span><span class='hs-conid'>Forest</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span>
<a name="line-643"></a><span class='hs-definition'>changeForest</span> <span class='hs-varid'>forest</span> <span class='hs-varid'>act</span> <span class='hs-conid'>[]</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>return</span> <span class='hs-conid'>Nothing</span>
<a name="line-644"></a><span class='hs-definition'>changeForest</span> <span class='hs-varid'>forest</span> <span class='hs-varid'>act</span> <span class='hs-layout'>(</span><span class='hs-varid'>p</span><span class='hs-conop'>:</span><span class='hs-varid'>ps</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>case</span> <span class='hs-varid'>splitAt</span> <span class='hs-varid'>p</span> <span class='hs-varid'>forest</span> <span class='hs-keyword'>of</span>
<a name="line-645"></a> <span class='hs-layout'>(</span><span class='hs-varid'>prev</span><span class='hs-layout'>,</span> <span class='hs-conid'>[]</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>return</span> <span class='hs-conid'>Nothing</span>
<a name="line-646"></a> <span class='hs-layout'>(</span><span class='hs-varid'>prev</span><span class='hs-layout'>,</span> <span class='hs-conid'>Node</span> <span class='hs-layout'>{</span> <span class='hs-varid'>rootLabel</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>val</span><span class='hs-layout'>,</span>
<a name="line-647"></a> <span class='hs-varid'>subForest</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>for</span><span class='hs-layout'>}</span><span class='hs-conop'>:</span><span class='hs-varid'>next</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span>
<a name="line-648"></a> <span class='hs-keyword'>if</span> <span class='hs-varid'>null</span> <span class='hs-varid'>ps</span> <span class='hs-keyword'>then</span> <span class='hs-keyword'>do</span>
<a name="line-649"></a> <span class='hs-varid'>val'</span> <span class='hs-keyglyph'><-</span> <span class='hs-varid'>act</span> <span class='hs-varid'>val</span>
<a name="line-650"></a> <span class='hs-varid'>return</span> <span class='hs-layout'>(</span><span class='hs-conid'>Just</span> <span class='hs-layout'>(</span><span class='hs-varid'>prev</span><span class='hs-varop'>++</span><span class='hs-conid'>Node</span> <span class='hs-layout'>{</span> <span class='hs-varid'>rootLabel</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>val'</span><span class='hs-layout'>,</span>
<a name="line-651"></a> <span class='hs-varid'>subForest</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>for</span> <span class='hs-layout'>}</span><span class='hs-conop'>:</span><span class='hs-varid'>next</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span>
<a name="line-652"></a> <span class='hs-keyword'>else</span> <span class='hs-keyword'>do</span>
<a name="line-653"></a> <span class='hs-varid'>mFor</span> <span class='hs-keyglyph'><-</span> <span class='hs-varid'>changeForest</span> <span class='hs-varid'>for</span> <span class='hs-varid'>act</span> <span class='hs-varid'>ps</span>
<a name="line-654"></a> <span class='hs-keyword'>case</span> <span class='hs-varid'>mFor</span> <span class='hs-keyword'>of</span>
<a name="line-655"></a> <span class='hs-conid'>Nothing</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>return</span> <span class='hs-conid'>Nothing</span>
<a name="line-656"></a> <span class='hs-conid'>Just</span> <span class='hs-varid'>for</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>return</span> <span class='hs-varop'>$</span> <span class='hs-conid'>Just</span> <span class='hs-layout'>(</span><span class='hs-varid'>prev</span><span class='hs-varop'>++</span><span class='hs-conid'>Node</span> <span class='hs-layout'>{</span> <span class='hs-varid'>rootLabel</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>val</span><span class='hs-layout'>,</span>
<a name="line-657"></a> <span class='hs-varid'>subForest</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>for</span> <span class='hs-layout'>}</span><span class='hs-conop'>:</span><span class='hs-varid'>next</span><span class='hs-layout'>)</span>
<a name="line-658"></a>
<a name="line-659"></a><a name="treeStoreGetValue"></a><span class='hs-comment'>-- | Extract one node from the current model. Fails if the given</span>
<a name="line-660"></a><span class='hs-comment'>-- 'TreePath' refers to a non-existent node.</span>
<a name="line-661"></a><span class='hs-comment'>--</span>
<a name="line-662"></a><span class='hs-definition'>treeStoreGetValue</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>TreeStore</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreePath</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>IO</span> <span class='hs-varid'>a</span>
<a name="line-663"></a><span class='hs-definition'>treeStoreGetValue</span> <span class='hs-varid'>model</span> <span class='hs-varid'>path</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>fmap</span> <span class='hs-varid'>rootLabel</span> <span class='hs-layout'>(</span><span class='hs-varid'>treeStoreGetTree</span> <span class='hs-varid'>model</span> <span class='hs-varid'>path</span><span class='hs-layout'>)</span>
<a name="line-664"></a>
<a name="line-665"></a><a name="treeStoreGetTree"></a><span class='hs-comment'>-- | Extract a subtree from the current model. Fails if the given</span>
<a name="line-666"></a><span class='hs-comment'>-- 'TreePath' refers to a non-existent node.</span>
<a name="line-667"></a><span class='hs-comment'>--</span>
<a name="line-668"></a><span class='hs-definition'>treeStoreGetTree</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>TreeStore</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreePath</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>IO</span> <span class='hs-layout'>(</span><span class='hs-conid'>Tree</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span>
<a name="line-669"></a><span class='hs-definition'>treeStoreGetTree</span> <span class='hs-layout'>(</span><span class='hs-conid'>TreeStore</span> <span class='hs-varid'>model</span><span class='hs-layout'>)</span> <span class='hs-varid'>path</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>do</span>
<a name="line-670"></a> <span class='hs-varid'>store</span><span class='hs-keyglyph'>@</span><span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>d</span><span class='hs-layout'>,</span> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>cache</span> <span class='hs-layout'>}</span> <span class='hs-keyglyph'><-</span>
<a name="line-671"></a> <span class='hs-varid'>readIORef</span> <span class='hs-layout'>(</span><span class='hs-varid'>customStoreGetPrivate</span> <span class='hs-varid'>model</span><span class='hs-layout'>)</span>
<a name="line-672"></a> <span class='hs-keyword'>case</span> <span class='hs-varid'>fromPath</span> <span class='hs-varid'>d</span> <span class='hs-varid'>path</span> <span class='hs-keyword'>of</span>
<a name="line-673"></a> <span class='hs-layout'>(</span><span class='hs-conid'>Just</span> <span class='hs-varid'>iter</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-keyword'>do</span>
<a name="line-674"></a> <span class='hs-keyword'>let</span> <span class='hs-layout'>(</span><span class='hs-varid'>res</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache'</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>checkSuccess</span> <span class='hs-varid'>d</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>cache</span>
<a name="line-675"></a> <span class='hs-varid'>writeIORef</span> <span class='hs-layout'>(</span><span class='hs-varid'>customStoreGetPrivate</span> <span class='hs-varid'>model</span><span class='hs-layout'>)</span> <span class='hs-varid'>store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>cache'</span> <span class='hs-layout'>}</span>
<a name="line-676"></a> <span class='hs-keyword'>case</span> <span class='hs-varid'>cache'</span> <span class='hs-keyword'>of</span>
<a name="line-677"></a> <span class='hs-layout'>(</span><span class='hs-layout'>(</span><span class='hs-keyword'>_</span><span class='hs-layout'>,</span><span class='hs-varid'>node</span><span class='hs-conop'>:</span><span class='hs-keyword'>_</span><span class='hs-layout'>)</span><span class='hs-conop'>:</span><span class='hs-keyword'>_</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>|</span> <span class='hs-varid'>res</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>return</span> <span class='hs-varid'>node</span>
<a name="line-678"></a> <span class='hs-keyword'>_</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>fail</span> <span class='hs-layout'>(</span><span class='hs-str'>"treeStoreGetTree: path does not exist "</span> <span class='hs-varop'>++</span> <span class='hs-varid'>show</span> <span class='hs-varid'>path</span><span class='hs-layout'>)</span>
<a name="line-679"></a> <span class='hs-keyword'>_</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>fail</span> <span class='hs-layout'>(</span><span class='hs-str'>"treeStoreGetTree: path does not exist "</span> <span class='hs-varop'>++</span> <span class='hs-varid'>show</span> <span class='hs-varid'>path</span><span class='hs-layout'>)</span>
<a name="line-680"></a>
<a name="line-681"></a><a name="treeStoreLookup"></a><span class='hs-comment'>-- | Extract a subtree from the current model. Like 'treeStoreGetTree'</span>
<a name="line-682"></a><span class='hs-comment'>-- but returns @Nothing@ if the path refers to a non-existant node.</span>
<a name="line-683"></a><span class='hs-comment'>--</span>
<a name="line-684"></a><span class='hs-definition'>treeStoreLookup</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>TreeStore</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>TreePath</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>IO</span> <span class='hs-layout'>(</span><span class='hs-conid'>Maybe</span> <span class='hs-layout'>(</span><span class='hs-conid'>Tree</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span>
<a name="line-685"></a><span class='hs-definition'>treeStoreLookup</span> <span class='hs-layout'>(</span><span class='hs-conid'>TreeStore</span> <span class='hs-varid'>model</span><span class='hs-layout'>)</span> <span class='hs-varid'>path</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>do</span>
<a name="line-686"></a> <span class='hs-varid'>store</span><span class='hs-keyglyph'>@</span><span class='hs-conid'>Store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>depth</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>d</span><span class='hs-layout'>,</span> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>cache</span> <span class='hs-layout'>}</span> <span class='hs-keyglyph'><-</span>
<a name="line-687"></a> <span class='hs-varid'>readIORef</span> <span class='hs-layout'>(</span><span class='hs-varid'>customStoreGetPrivate</span> <span class='hs-varid'>model</span><span class='hs-layout'>)</span>
<a name="line-688"></a> <span class='hs-keyword'>case</span> <span class='hs-varid'>fromPath</span> <span class='hs-varid'>d</span> <span class='hs-varid'>path</span> <span class='hs-keyword'>of</span>
<a name="line-689"></a> <span class='hs-layout'>(</span><span class='hs-conid'>Just</span> <span class='hs-varid'>iter</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-keyword'>do</span>
<a name="line-690"></a> <span class='hs-keyword'>let</span> <span class='hs-layout'>(</span><span class='hs-varid'>res</span><span class='hs-layout'>,</span> <span class='hs-varid'>cache'</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>checkSuccess</span> <span class='hs-varid'>d</span> <span class='hs-varid'>iter</span> <span class='hs-varid'>cache</span>
<a name="line-691"></a> <span class='hs-varid'>writeIORef</span> <span class='hs-layout'>(</span><span class='hs-varid'>customStoreGetPrivate</span> <span class='hs-varid'>model</span><span class='hs-layout'>)</span> <span class='hs-varid'>store</span> <span class='hs-layout'>{</span> <span class='hs-varid'>content</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>cache'</span> <span class='hs-layout'>}</span>
<a name="line-692"></a> <span class='hs-keyword'>case</span> <span class='hs-varid'>cache'</span> <span class='hs-keyword'>of</span>
<a name="line-693"></a> <span class='hs-layout'>(</span><span class='hs-layout'>(</span><span class='hs-keyword'>_</span><span class='hs-layout'>,</span><span class='hs-varid'>node</span><span class='hs-conop'>:</span><span class='hs-keyword'>_</span><span class='hs-layout'>)</span><span class='hs-conop'>:</span><span class='hs-keyword'>_</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>|</span> <span class='hs-varid'>res</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>return</span> <span class='hs-layout'>(</span><span class='hs-conid'>Just</span> <span class='hs-varid'>node</span><span class='hs-layout'>)</span>
<a name="line-694"></a> <span class='hs-keyword'>_</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>return</span> <span class='hs-conid'>Nothing</span>
<a name="line-695"></a> <span class='hs-keyword'>_</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>return</span> <span class='hs-conid'>Nothing</span>
</pre></body>
</html>
distrib
>
Fedora
>
14
>
x86_64
>
media
>
updates
>
by-pkgid
>
677c1b5134368504c2e447757584d19e
>
files
>
1094
