Skip to main content
SimilarExport ZIP
100%

Merge a list of annotations into selected nodes of a tree, with error recovery and reporting

✓ Published0🌍 Public
FFranklin Chen
Last edited Apr 26, 2015
Created on Apr 26, 2015

The example demonstrates a Haskell prototype for merging a list of labels into selected nodes of a tree structure, with explicit error recovery when labels run out. It shows how the `merge` function, built on `Control.Monad.State` and `traverse`, pairs each `Right` leaf with an annotation, returning leftover labels if too many are supplied. When labels are insufficient, missing ones are marked with `Nothing`, and `contentsMissingLabels` collects those unlabeled values for reporting. The code uses the `Content` and `Annotated` data types with `Functor`, `Foldable`, and `Traversable` instances, and verifies behavior via HSpec tests.

AI-generated description

Similar vizzes

Loading thumbnail…

Gist 0e59d1c2d63aaea35573

This example demonstrates benchmark-driven optimization of recursion schemes in Haskell, using the Criterion library’s `defaultMain`, `bgroup`, and `bench` functions to measure performance. The code defines catamorphisms (`ffold`), anamorphisms (`funfold`), hylomorphisms, and build functions (`fbuild`, `funbuild`), then applies them to natural numbers, lists, and trees. It highlights how `INLINE` pragmas and `RULES` for fusion (e.g., `ffold/fbuild`) improve execution speed, as shown in benchmarks like `lengthL`, `mapL`, and `depthT` over sample data structures.

FFranklin Chen
50% match
Loading thumbnail…

Collapsible Tree Example

This example shows a static tree diagram with a root node branching into two levels of child nodes, using text labels and circular markers connected by curved links. The visualization renders in SVG via D3.js version 3.5, using the `d3.layout.tree` for hierarchical positioning and `d3.svg.diagonal` for link paths. The code defines a fixed dataset inline and normalizes node depth for horizontal spacing, though it lacks the interactive collapse-and-expand behavior of the original Bostock example it derives from.

Dd3noob
48% match
Loading thumbnail…

draft readme for automerge repo

This example visualizes the architecture of a proposed Automerge repository API through a plain-text code listing. It shows the core data flow and plugin interfaces for storage, networking, and middleware, using TypeScript and Automerge’s CRDT library. The rendering relies on the raw code blocks themselves, highlighting API method signatures like `AutomergeRepo.createRepo`, `wrappedDoc.addListener`, and `storage.appendChange`. The visualization maps the conceptual layers of the API, from public document operations to internal plugin contracts, without any graphical charts.

HHerbCaudill
47% match
Loading thumbnail…

Merging States

This example demonstrates merging multiple US state polygons into a single shape while removing interior borders, using `topojson.merge` on a filtered set of state geometries. A static map renders all states in gray with white boundary strokes via `d3.geo.path` and an AlbersUSA projection, while selected states appear filled in orange with a black outline. It uses D3 v3 and TopoJSON v1, loading geographic data from a local `us.json` file, and highlights the merged path by filtering geometries against a predefined set of state IDs.

Mmbostock
47% match
Loading thumbnail…

Fork of Annotation Label Sandbox

This example demonstrates how to add a single annotation label with an arrow connector to an SVG canvas using the d3-annotation library. The code creates a text title and subtitle, then defines an annotation object with custom note text, title, wrapping width, and alignment, along with a connector ending in an arrow. The annotation is rendered via `d3.annotation()` and `d3.annotationLabel`, with the SVG display styled using CSS, including the Lato font and a white background. The underlying data is hardcoded in JavaScript as an array of annotation objects.

SSreeram Veerapaneni
47% match
Loading thumbnail…

Network Annotation with Collision Detection

This example shows a network graph of characters from Les Miserables, where labels for nodes are positioned using a custom force simulation with bounding-box collision detection. The `d3-annotation` library is used to place text labels for non-trivial characters, while a second force simulation applies `bboxCollide` to push labels apart so they don't overlap. The network is rendered as an SVG with nodes and links, and the labels are filtered to include only major characters, then automatically repositioned around the graph.

663anp3ca
47% match
Loading thumbnail…

Network Annotation with Collision Detection

This example shows a network graph of characters from Les Miserables, where labels for nodes are positioned using a custom force simulation with bounding-box collision detection. The `d3-annotation` library is used to place text labels for non-trivial characters, while a second force simulation applies `bboxCollide` to push labels apart so they don't overlap. The network is rendered as an SVG with nodes and links, and the labels are filtered to include only major characters, then automatically repositioned around the graph.

663anp3ca
47% match
Loading thumbnail…

Tree traversal in Ruby, a response to http://michaelfeathers.typepad.com/michael_feathers_blog/2013/02/sub-tree-selection-with-flattenselect.html

This example demonstrates a preorder tree-traversal algorithm in Ruby, using the `TreeEnumerable` class and the `Enumerable` mixin to flatten a nested abstract syntax tree (AST) into a list of matching subtrees. The `sexp_select` method filters nodes by their symbol type, such as `:@ivar`, returning only those subtrees. The code relies on Ruby’s `find_all` from `Enumerable` and a custom `tree_traverse` that yields each array node recursively. The example includes a MiniTest unit test (`TestTreeSelect`) that asserts the filtered result from a hardcoded parse-tree structure, showing how the selection works on real S-expression data.

FFranklin Chen
47% match