Login or Register to Ask a Question and Join Our Community


Software Releases - RSS News

Strings edit 2.1 (Default branch)

Login to Discuss or Reply to this Discussion in Our Community

 
Thread Tools Search this Thread
Special Forums News, Links, Events and Announcements Software Releases - RSS News Strings edit 2.1 (Default branch)
# 1  
Old 03-30-2008
Strings edit 2.1 (Default branch)
This library provides I/O facilities for integer, floating-point, Roman numbers, and strings. Both input and output subroutines support string pointers for consequent stream processing. The output can be aligned in a fixed size field with padding. Numeric input can be checked against expected values range to be either saturated or to raise an exception. For floating-point output either relative or absolute output precision can be specified. UTF-8 encoded strings are supported. License: GNAT Modified GPL (GMGPL) Changes:
This version enhances UTF-8 support. Several packages were added. Strings_Edit.UTF8.Blocks declares the ranges (blocks) of code points as defined by the standard. Strings_Edit.UTF8.Categorization provides categorization of Unicode code points, such as uppercase letter, punctuation, etc. Strings_Edit.UTF8.Maps defines sets and maps of Unicode code points in a way similar to the standard library package Ada.Strings.Maps. Strings_Edit.UTF8.Maps.Constants provides some commonly used sets and maps.Image

More...
Login or Register to Ask a Question

Previous Thread | Next Thread

1 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

script to edit strings based on patterns

Hello All, Here is the file which I want to edit. The script should look for DB2 and if found then delete all lines related to DB2 connection string. Is there way this can be done using script ? DB1 = (DESCRIPTION = (SDU = 32768 (enable = broken) (ADDRESS = (PROTOCOL =... (2 Replies)
Discussion started by: deepakc_in
2 Replies
Login or Register to Ask a Question

LEARN ABOUT DEBIAN

text::levenshtein

Levenshtein(3pm)					User Contributed Perl Documentation					  Levenshtein(3pm)

NAME

       Text::Levenshtein - An implementation of the Levenshtein edit distance

SYNOPSIS

	use Text::Levenshtein qw(distance);

	print distance("foo","four");
	# prints "2"

	print fastdistance("foo","four");
	# prints "2" faster

	my @words=("four","foo","bar");
	my @distances=distance("foo",@words);

	print "@distances";
	# prints "2 0 3"

DESCRIPTION

       This module implements the Levenshtein edit distance.  The Levenshtein edit distance is a measure of the degree of proximity between two
       strings.  This distance is the number of substitutions, deletions or insertions ("edits") needed to transform one string into the other one
       (and vice versa).  When two strings have distance 0, they are the same.	A good point to start is: <http://www.merriampark.com/ld.htm>

       "fastdistance" can be called with two scalars and is faster in most cases.

       See also Text::LevenshteinXS on CPAN if you do not require a perl-only implementation.  It is extremely faster in nearly all cases.

       See also Text::WagnerFischer on CPAN for a configurable edit distance, i.e. for configurable costs (weights) for the edits.

AUTHOR

       Copyright 2002 Dree Mistrut <dree@friul.it>

       This package is free software and is provided "as is" without express or implied warranty.  You can redistribute it and/or modify it under
       the same terms as Perl itself.

perl v5.10.0							    2009-01-19							  Levenshtein(3pm)