Ports Search

This package provides a set of modules that form an interactive input buffer written in plain perl with minimal dependencies. It features almost all key-bindings described in the posix spec for the sh(1) utility with some extensions like multi-line editing; this includes a vi-command mode with a save-buffer (for copy-pasting) and an undo-stack.

This is a subclass of Term::VT102 that will grow the virtual screen to accomodate arbitrary width and height of text. The behavior is more similar to the buffer of a scrolling terminal emulator than to a real terminal, making it useful for output displays in scrolling media.

Test::Exception::LessClever is an alternative to Test::Exception that is much simpler. This alternative does not use fancy stack tricks to hide itself. The idea here is to keep it simple. This also solves the Test::Exception bug where some dies will be hidden when a DESTROY method calls eval. If a DESTROY method masks $@ a warning will be generated as well.

Test::Expect is a module for automated driving and testing of terminal-based programs. It is handy for testing interactive programs which have a prompt, and is based on the same concepts as the Tcl Expect tool. As in Expect::Simple, the Expect object is made available for tweaking. Test::Expect is intended for use in a test script.

Test::utf8 is a collection of tests useful for dealing with utf8 strings in Perl. It has two types of tests: The validity tests check if a string is valid and not corrupt, whereas the characteristics tests will check that string has a given set of characteristics.

This module implements a trie data structure. The term "trie" comes from the word retrieval, but is generally pronounced like "try". A trie is a tree structure (or directed acyclic graph), the nodes of which represent letters in a word. For example, the final lookup for the word 'bob' would look something like $ref->{'b'}{'o'}{'b'}{'00'} (the 00 being an end marker). Only nodes which would represent words in the trie exist, making the structure slightly smaller than a hash of the same data set. The advantages of the trie over other data storage methods is that lookup times are O(1) WRT the size of the index. For sparse data sets, it is probably not as efficient as performing a binary search on a sorted list, and for small files, it has a lot of overhead. The main advantage (at least from my perspective) is that it provides a relatively cheap method for finding a list of words in a large, dense data set which begin with a certain string.

A Time::Clock object is a twenty-four hour clock with nanosecond precision and wrap-around. It is a clock only; it has absolutely no concept of dates. Vagaries of date/time such as leap seconds and daylight savings time are unsupported.

This module can parse various types of input (formatted and containing hierarchal information) into a tree structure. It can also deparse these same tree structures back into a string. It accepts various types of input, such as strings, filenames, and array references. The tree structure used is a hierarchy of Tree::Simple objects.

This module in an fully object-oriented implementation of a simple n- ary tree. It is built upon the concept of parent-child relationships, so therefore every Tree::Simple object has both a parent and a set of children (who themselves may have children, and so on). Every Tree::Simple object also has siblings, as they are just the children of their immediate parent.

BOSSA is a flash programming utility for Atmel's SAM family of flash-based ARM microcontrollers designed as a replacement for Atmel's SAM-BA software. This version is a fork of the original project with some Arduino-specific patches applied that are unlikely to be accepted upstream.