[libdata-treedumper-perl] 05/08: Add the fix-more-spelling patch to correct more errors.
Peter Pentchev
roam at ringlet.net
Wed Nov 30 13:15:28 UTC 2016
This is an automated email from the git hooks/post-receive script.
roam-guest pushed a commit to branch master
in repository libdata-treedumper-perl.
commit 1f157cdbdaa6f203465d3d928b8685fd725fd948
Author: Peter Pentchev <roam at ringlet.net>
Date: Wed Nov 30 14:14:35 2016 +0200
Add the fix-more-spelling patch to correct more errors.
---
debian/changelog | 1 +
debian/patches/fix-more-spelling.patch | 550 +++++++++++++++++++++++++++++++++
debian/patches/series | 1 +
3 files changed, 552 insertions(+)
diff --git a/debian/changelog b/debian/changelog
index 9fdc866..5405380 100644
--- a/debian/changelog
+++ b/debian/changelog
@@ -35,6 +35,7 @@ libdata-treedumper-perl (0.40-2) UNRELEASED; urgency=low
* Build-depend on libclass-isa-perl.
* Declare compliance with Policy 3.9.8.
* Bump the debhelper compatibility level to 9 with no changes.
+ * Add the fix-more-spelling patch to correct more errors.
-- Peter Pentchev <roam at ringlet.net> Wed, 30 Nov 2016 12:34:35 +0200
diff --git a/debian/patches/fix-more-spelling.patch b/debian/patches/fix-more-spelling.patch
new file mode 100644
index 0000000..e016602
--- /dev/null
+++ b/debian/patches/fix-more-spelling.patch
@@ -0,0 +1,550 @@
+Description: Correct some typographical and grammatical errors.
+Forwarded: no
+Author: Peter Pentchev <roam at ringlet.net>
+Last-Update: 2016-11-30
+
+
+--- a/Changes
++++ b/Changes
+@@ -9,7 +9,7 @@
+ Author: nadim khemir <nadim at naquadim.(none)>
+ Date: Sat Nov 1 12:59:36 2008 +0100
+
+- FIXED: onject overloading "" are displayed. Tested with Perl::Critic object
++ FIXED: object overloading "" are displayed. Tested with Perl::Critic object
+ 0.34
+ FIXED: check if $^0 is defined before using it to avoid warning
+
+@@ -44,7 +44,7 @@
+
+ 0.26
+ FIXED: is_terminal unproperly set for empty objects (found by Ari Jolma)
+- ADDED: display of object underlying type and it's emptiness state
++ ADDED: display of object underlying type and its emptiness state
+ FIXED: made "NO_ELEMENTS, NUMBER_OF_ELEMENTS, TIE available to renderers
+
+ 0.25
+@@ -56,13 +56,13 @@
+ ADDED: display tie for scalar and handle
+
+ 0.23 Thu Jun 30 0:30:00 2005
+- ADDED: tie, bless and hierachy is showed for the pass reference with title
++ ADDED: tie, bless and hierarchy is shown for the pass reference with title
+ ADDED: Handle tied scalars and handles
+ ADDED: show if tie is to a hash or an array ...
+
+ 0.22 Tue Jun 28 0:00:00 2005
+ FIXED: missing DISPLAY_PATH in package setup
+- FIXED: minor documentation formating error
++ FIXED: minor documentation formatting error
+ ADDED: DISPLAY_INHERITANCE, DISPLAY_TIE, DISPLAY_AUTOLOAD
+
+ 0.21 Sun 26 Jun 20:00:00 2005
+@@ -104,7 +104,7 @@
+ 0.14 Sat Jun 26 19:30:00 2004
+ CHANGED: the documentation slightly
+ ADDED: DISPLAY_OBJECT_TYPE
+- CHANGED: TreeDumper is not exported anymore to eliminate recuring tests of setup variables.
++ CHANGED: TreeDumper is not exported anymore to eliminate recurring tests of setup variables.
+ CHANGED: refactored the dumper code
+ CHANGED: Separated OO interface
+ FIXED: perl address properly displayed for scalars
+@@ -152,7 +152,7 @@
+ ADDED: filtering example
+
+ 0.07 Fri Oct 3 23:30:00 2003
+- FIXED: proper adressing
++ FIXED: proper addressing
+ CHANGED: variable names to match Data:Dumper
+ ADDED: documentation
+
+--- a/Todo
++++ b/Todo
+@@ -1,4 +1,4 @@
+-[12:03] <kent\n> nadim: $("ul").click(function(){ $(this).find("li").show() }); # theres a start
++[12:03] <kent\n> nadim: $("ul").click(function(){ $(this).find("li").show() }); # there's a start
+
+ options to show addresses and links only when references exist
+ needs two passes
+@@ -31,11 +31,11 @@
+
+ Check is Data::Visitor can be used as a base iterator
+
+-separate glyph generation from data dumping (to be reuse in D::TD::Diff
++separate glyph generation from data dumping (to be reused in D::TD::Diff)
+
+ have sub modules handle the different types eg: D::TD::Type::Array; ..
+- Load them dynamically or at start if explicitely named
+- let's user define his own module
++ Load them dynamically or at start if explicitly named
++ lets user define his own module
+ Refactor DTD and use the type filters way of handling all types including HASHES, ARRAYS, ...
+
+ warp output after generation
+@@ -44,9 +44,9 @@
+
+ it should be possible to scope filter
+ a filter for a type sets more filters for the data below the type;
+- when the typed object is finished diplaying, revert to normal filters
++ when the typed object is finished displaying, revert to normal filters
+
+-iterator don't get to the leaves, document it
++iterator doesn't get to the leaves, document it
+
+ Add more visual examples for the options
+
+@@ -57,7 +57,7 @@
+ -> &main::__ANON__[debug_test.pl:52] in debug_test.pl:49-52
+ => uses Dumpvalue and debuger data!
+
+- this is because it can extract the data from DB::, maybe possible throug B::
++ this is because it can extract the data from DB::, maybe possible through B::
+
+ Also look at Self module
+
+@@ -70,16 +70,16 @@
+ Add option name verification so we stop passing the wrong names!
+ => optional
+ => dump a list of the available names
+- => soundex the closes
++ => soundex the closest
+ => take the closest and display only a warning?
+
+ ------------------------------
+ # below are done -
+ ------------------------------
+
+-#Reduce the amount of times a variable is accessed
++#Reduce the number of times a variable is accessed
+
+-#GetElement is called twice per element this could be optiimized away
++#GetElement is called twice per element this could be optimized away
+
+ #Display when sub levels are not displayed anymore because of MAX_LEVEL
+ => use DISPLAY_NUMBER_OF_ELEMENTS_OVER_MAX_DEPTH
+@@ -93,19 +93,19 @@
+ #wrap error
+ test with: [nadim at nadim config]$ pbs -p parent.pl parent -save_config xyz -display_depend_start -cw2 'bold yellow' -no_silent_override
+ test with try_it.pl
+- => dump was extra incdented at caller
++ => dump was extra indented at caller
+
+ !Add the possibility to prune self not only children
+ why?
+ objects should be able to remove themselves only their parents should be able to do that
+
+ this is difficult as the name of self (including glyphs) is already
+- displayed when this is renderer. Eveni if self was to render its
+- own name, self prvious sibling name renderend would be wrong if
++ displayed when this is rendered. Even if self was to render its
++ own name, self previous sibling name renderend would be wrong if
+ self decided it was not to be displayed. This means that glyph rendering
+ has to wait till all nodes are rendered.
+
+- What do we do when a node removed itself and a we encounter a reference to the node?
++ What do we do when a node removed itself and we encounter a reference to the node?
+
+ # Add DISPLAY_NUMBER_OF_ELEMENTS
+
+@@ -113,7 +113,7 @@
+
+ #make it possible to register a dumper per type
+
+-#Accept non reference input
++#Accept non-reference input
+
+ # display caller location
+
+@@ -126,7 +126,7 @@
+
+ #DISPLAY_PATH
+
+-#show if a node has more sublevel but those will not be displayed because of MAX_DEPTH
++#show if a node has more sublevels but those will not be displayed because of MAX_DEPTH
+ => with option
+
+
+@@ -141,9 +141,9 @@
+ #(no elements)
+
+ #option for what \r \n are replaced with
+-# should give the possibility to replace any non printing character
++# should give the possibility to replace any non-printing character
+
+-#make it visible when a node has sub levels but MAX_DEPTH stops its display
++#make it visible when a node has sublevels but MAX_DEPTH stops its display
+
+ Handle data that contains "\n" and make the output look bad.
+
+@@ -159,7 +159,7 @@
+
+ #DISPLAY_OBJECT_TYPE
+
+-#Dodcument the iterator/search capability added by no output
++#Document the iterator/search capability added by no output
+
+ #NO output
+
+@@ -176,7 +176,7 @@
+ coloring the tree
+ example of coloring an array index
+
+-#typo: missing ':' in documentation (fixed but not released
++#typo: missing ':' in documentation (fixed but not released)
+
+ #dump of multiple structures
+
+@@ -186,7 +186,7 @@
+
+ #fix and release without the spurious \n in the title when using the DumpTreeFunction
+
+-#Root adress option
++#Root address option
+
+ #no address option
+
+--- a/filters.pl
++++ b/filters.pl
+@@ -63,8 +63,8 @@
+ # type filter
+ #-------------------------------------------------------------------------------
+
+-# this is a constricted example but it serves its pupose
+-# all_entries_filter returns a an empty array for all the tree elements
++# this is a constricted example but it serves its purpose
++# all_entries_filter returns an empty array for all the tree elements
+ # except the top element (the tree itself) or we wouldn't get any output
+ # We set the type filters for type 'SuperObject'. the filter overrides the global filter
+ # as it has higher priority
+@@ -98,9 +98,9 @@
+ {
+ my $tree = shift ;
+
+- # while writting I got bitten as I thought all 'superObject's where hashes and I could
++ # while writing I got bitten as I thought all 'superObject's where hashes and I could
+ # run keys %$tree on the object but the example data has a tied array which is also blessed
+- # in 'SuperObjec'. So I had to add: if("$tree" =~ /=HASH/ )
++ # in 'SuperObject'. So I had to add: if("$tree" =~ /=HASH/ )
+
+ if("$tree" =~ /=HASH/ )
+ {
+--- a/usage.pl
++++ b/usage.pl
+@@ -39,7 +39,7 @@
+
+ }
+ }
+- , ARRAY => [qw(elment_1 element_2 element_3)]
++ , ARRAY => [qw(element_1 element_2 element_3)]
+ ) ;
+
+ my $s = \%tree ;
+@@ -98,6 +98,6 @@
+ print "15 first lines of the DHTML dump:\n" ;
+ print ((split(/(\n)/, $dump))[0 .. 29]) ;
+
+-# un existant rendering
+-DumpTree($s, 'unexistant!', RENDERER => 'UNEXISTANT') ;
++# nonexistent rendering
++DumpTree($s, 'nonexistent!', RENDERER => 'NONEXISTENT') ;
+
+--- a/TreeDumper.pm
++++ b/TreeDumper.pm
+@@ -282,7 +282,7 @@
+
+ if($@)
+ {
+- # shoud we warn ???
++ # should we warn ???
+ delete $setup->{DISPLAY_PERL_SIZE} ;
+ }
+ }
+@@ -458,7 +458,7 @@
+
+ ($tree_type eq 'ARRAY' || obj($tree, 'ARRAY')) and do
+ {
+- #~ # debug while writting Diff module
++ #~ # debug while writing Diff module
+ #~ unless(defined $nodes_to_display->[$node_index])
+ #~ {
+ #~ use Data::Dumper ;
+@@ -1642,7 +1642,7 @@
+
+ }
+ }
+- , ARRAY => [qw(elment_1 element_2 element_3)]
++ , ARRAY => [qw(element_1 element_2 element_3)]
+ } ;
+
+
+@@ -1712,7 +1712,7 @@
+
+ ex: c123 [C4 -> C3]
+ ^ ^
+- | | address of the data refered to
++ | | address of the data referred to
+ |
+ | current element address
+
+@@ -1725,7 +1725,7 @@
+
+ B<R>: Reference,
+ B<RS>: Scalar reference.
+-B<Ox>: Object, where x is the object undelying type
++B<Ox>: Object, where x is the object underlying type
+
+ =head2 Empty Hash or Array
+
+@@ -1755,12 +1755,12 @@
+
+ This package variable is very useful when you use B<Data::TreeDumper> and don't know where you called
+ B<PrintTree> or B<DumpTree>, ie when debugging. It displays the filename and line of call on STDOUT.
+-It can't also be set as an override, DISPLAY_CALLER_LOCATION => 1.
++It can also be set as an override, DISPLAY_CALLER_LOCATION => 1.
+
+ =head2 NO_PACKAGE_SETUP
+
+ Sometimes, the package setup you have is not what you want to use. resetting the variable,
+-making a call and setting the variables back is borring. You can set B<NO_PACKAGE_SETUP> to
++making a call and setting the variables back is boring. You can set B<NO_PACKAGE_SETUP> to
+ 1 and I<DumpTree> will ignore the package setup for the call.
+
+ print Data::TreeDumper::DumpTree($s, "Using package data") ;
+@@ -1781,7 +1781,7 @@
+
+ =head2 DISPLAY_PATH
+
+-Add the path of the element to the its address.
++Add the path of the element to its address.
+
+ DISPLAY_PATH => 1
+
+@@ -1810,8 +1810,8 @@
+
+ =head2 DISPLAY_TIE
+
+-if DISPLAY_TIE is set, B<Data::TreeDumper> will display which packae the variable is tied to. This works for
+-hashes and arrays as well as for object which are based on hashes and arrays.
++if DISPLAY_TIE is set, B<Data::TreeDumper> will display which package the variable is tied to. This works for
++hashes and arrays as well as for objects which are based on hashes and arrays.
+
+ |- tied_hash (tied to 'TiedHash') [H57]
+ | `- x = 1 [S58]
+@@ -1849,8 +1849,8 @@
+
+ =head2 REPLACEMENT_LIST
+
+-Scalars may contain non printable characters that you rather not see in a dump. One of the
+-most common is "\r" embedded in text string from dos files. B<Data::TreeDumper>, by default, replaces "\n" by
++Scalars may contain non-printable characters that you would rather not see in a dump. One of the
++most common is "\r" embedded in a text string from MS-DOS files. B<Data::TreeDumper>, by default, replaces "\n" by
+ '[\n]' and "\r" by '[\r]'. You can set REPLACEMENT_LIST to an array ref containing elements which
+ are themselves array references. The first element is the character(s) to match and the second is
+ the replacement.
+@@ -1861,7 +1861,7 @@
+
+ =head2 QUOTE_HASH_KEYS
+
+-B<QUOTE_HASH_KEYS> and its package variable B<$Data::TreeDumper::Quotehashkeys> can be set if you wish to single quote
++B<QUOTE_HASH_KEYS> and its package variable B<$Data::TreeDumper::Quotehashkeys> can be set if you wish to single-quote
+ the hash keys. Hash keys are not quoted by default.
+
+ DumpTree(\$s, 'some data:', QUOTE_HASH_KEYS => 1) ;
+@@ -1876,7 +1876,7 @@
+
+ =head2 QUOTE_VALUES
+
+-B<QUOTE_VALUES> and its package variable B<$Data::TreeDumper::Quotevalues> can be set if you wish to single quote
++B<QUOTE_VALUES> and its package variable B<$Data::TreeDumper::Quotevalues> can be set if you wish to single-quote
+ the scalar values.
+
+ DumpTree(\$s, 'Cells:', QUOTE_VALUES=> 1) ;
+@@ -1894,7 +1894,7 @@
+
+ =head2 Filters
+
+-Data::TreeDumper can sort the tree nodes with a user defined subroutine. By default, hash keys are sorted.
++Data::TreeDumper can sort the tree nodes with a user-defined subroutine. By default, hash keys are sorted.
+
+ FILTER => \&ReverseSort
+ FILTER_ARGUMENT => ['your', 'arguments']
+@@ -1905,25 +1905,25 @@
+
+ =item 1 - a reference to the node which is going to be displayed
+
+-=item 2 - the nodes depth (this allows you to selectively display elements at a certain depth)
++=item 2 - the node's depth (this allows you to selectively display elements at a certain depth)
+
+ =item 3 - the path to the reference from the start of the dump.
+
+ =item 4 - an array reference containing the keys to be displayed (see L<Filter chaining>)
+
+-=item 5 - the dumpers setup
++=item 5 - the dumper's setup
+
+ =item 5 - the filter arguments (see below)
+
+ =back
+
+-The filter returns the node's type, an eventual new structure (see below) and a list of 'keys' to display. The keys are hash keys or array indexes.
++The filter returns the node's type, possibly a new structure (see below), and a list of 'keys' to display. The keys are hash keys or array indexes.
+
+ In Perl:
+
+ ($tree_type, $replacement_tree, @nodes_to_display) = $your_filter->($tree, $level, $path, $nodes_to_display, $setup) ;
+
+-Filter are not as complicated as they sound and they are very powerful,
++Filters are not as complicated as they sound and they are very powerful,
+ especially when using the path argument. The path idea was given to me by
+ another module writer but I forgot whom. If this writer will contact me, I
+ will give him the proper credit.
+@@ -1934,7 +1934,7 @@
+ =head3 FILTER_ARGUMENT
+
+ it is possible to pass arguments to your filter, passing a reference allows you to modify
+-the arguments when the filter is run (that happends for each node).
++the arguments when the filter is run (that happens for each node).
+
+ sub SomeSub
+ {
+@@ -1977,7 +1977,7 @@
+
+ The label for a hash keys or an array index can be altered. This can be used to add visual information to the tree dump. Instead
+ of returning the key name, return an array reference containing the key name and the label you want to display.
+-You only need to return such a reference for the entries you want to change, thus a mix of scalars and array ref is acceptable.
++You only need to return such a reference for the entries you want to change, thus a mix of scalars and array refs is acceptable.
+
+ sub StarOnA
+ {
+@@ -2008,12 +2008,12 @@
+ print DumpTree($s, "Entries matching /^a/i have '*' prepended", FILTER => \&StarOnA) ;
+
+ If you use an ANSI terminal, you can also change the color of the label.
+-This can greatly improve visual search time.
++This can greatly improve the visual search time.
+ See the I<label coloring> example in I<colors.pl>.
+
+ =head3 Structure replacement
+
+-It is possible to replace the whole data structure in a filter. This comes handy when you want to display a I<"worked">
++It is possible to replace the whole data structure in a filter. This comes in handy when you want to display a I<"worked">
+ version of the structure. You can even change the type of the data structure, for example changing an array to a hash.
+
+ sub ReplaceArray
+@@ -2198,9 +2198,9 @@
+
+ DumpTree($s, 'Chained filters', FILTER => CreateChainingFilter(\&AddStar, \&RemoveA)) ;
+
+-=head2 level Filters
++=head2 Level Filters
+
+-It is possible to define one filter for a specific level. If a filter for a specific level exists it is used
++It is possible to define one filter per specific level. If a filter for a specific level exists it is used
+ instead of the global filter.
+
+ LEVEL_FILTERS => {1 => \&FilterForLevelOne, 5 => \&FilterForLevelFive ... } ;
+@@ -2227,11 +2227,11 @@
+
+ You can iterate through your data structures and display data yourself,
+ manipulate the data structure, or do a search. While iterating through the
+-data structure, you can prune arbitrary branches to speedup processing.
++data structure, you can prune arbitrary branches to speed processing up.
+
+ # this example counts the nodes in a tree (hash based)
+ # a node is counted if it has a '__NAME' key
+- # any field that starts with '__' is considered rivate and we prune so we don't recurse in it
++ # any field that starts with '__' is considered private and we prune so we don't recurse in it
+ # anything that is not a hash (the part of the tree that interests us in this case) is pruned
+
+ my $number_of_nodes_in_the_dependency_tree = 0 ;
+@@ -2287,7 +2287,7 @@
+
+ =head2 ASCII vs ANSI
+
+-You can direct Data:TreeDumper to output ANSI codes instead of ASCII characters. The display
++You can direct Data::TreeDumper to output ANSI codes instead of ASCII characters. The display
+ will be much nicer but takes slightly longer (not significant for small data structures).
+
+ USE_ASCII => 0 # will use ANSI codes instead
+@@ -2301,7 +2301,7 @@
+ =head2 Maximum depth of the dump
+
+ Controls the depth beyond which which we don't recurse into a structure. Default is -1, which
+-means there is no maximum depth. This is useful to limit the amount of data displayed.
++means there is no maximum depth. This is useful for limiting the amount of data displayed.
+
+ MAX_DEPTH => 1
+
+@@ -2314,7 +2314,7 @@
+
+ =head2 Indentation
+
+-Every line of the tree dump will be appended with the value of I<INDENTATION>.
++The value of I<INDENTATION> will be prepended to every line of the tree dump.
+
+ INDENTATION => ' ' ;
+
+@@ -2340,7 +2340,7 @@
+
+ =head1 Level numbering and tagging
+
+-Data:TreeDumper can prepend the level of the current line to the tree glyphs. This can be very useful when
++Data::TreeDumper can prepend the level of the current line to the tree glyphs. This can be very useful when
+ searching in tree dump either visually or with a pager.
+
+ NUMBER_LEVELS => 2
+@@ -2405,7 +2405,7 @@
+ =head1 Wrapping
+
+ B<Data::TreeDumper> uses the Text::Wrap module to wrap your data to fit your display. Entries can be
+-wrapped multiple times so they snuggly fit your screen.
++wrapped multiple times so they snugly fit your screen.
+
+ | | |- 1 [S21] = 1
+ | | `- 2 [S22] = 2
+@@ -2518,15 +2518,15 @@
+
+ =item * {RENDERER}{END} is called after the last node has been processed.
+
+-=item * {RENDERER}{ ... }Arguments to the renderer can be stores within the {RENDERER} hash.
++=item * {RENDERER}{ ... } Arguments to the renderer can be stored within the {RENDERER} hash.
+
+ =back
+
+ =head2 Renderer modules
+
+ Renderers should be defined in modules under B<Data::TreeDumper::Renderer> and should define a function
+-called I<GetRenderer>. I<GetRenderer> can be passed whatever arguments the developer whishes. It is
+-acceptable for the modules to also export a specifc sub.
++called I<GetRenderer>. I<GetRenderer> can be passed whatever arguments the developer wishes. It is
++acceptable for the modules to also export a specific sub.
+
+ print DumpTree($s, 'Tree', Data::TreeDumper::Renderer::DHTML::GetRenderer()) ;
+ or
+@@ -2539,12 +2539,12 @@
+ print DumpTree($s, 'Tree', RENDERER => 'DHTML') ;
+
+ If B<{RENDERER}{NAME}> is set to a scalar, B<Data::TreeDumper> will load the specified module if it exists. I<GetRenderer>
+-will be called without arguments. Arguments to the renderer can aither be passed to the GetRenderer sub or as elements in the {RENDERER} hash.
++will be called without arguments. Arguments to the renderer can either be passed to the GetRenderer sub or as elements in the {RENDERER} hash.
+
+ print DumpTree($s, 'Tree', RENDERER => {NAME => 'DHTML', STYLE => \$style) ;
+
+
+-=head1 Zero width console
++=head1 Zero-width console
+
+ When no console exists, while redirecting to a file for example, Data::TreeDumper uses the variable
+ B<VIRTUAL_WIDTH> instead. Default is 120.
+@@ -2693,9 +2693,9 @@
+
+ I<usage.pl> shows you how you can use B<Data::TreeDumper>.
+
+-I<filters.pl> shows you how you how to do advance filtering.
++I<filters.pl> shows you how to do advance filtering.
+
+-I<colors.pl> shows you how you how to colorize a dump.
++I<colors.pl> shows you how to colorize a dump.
+
+ I<try_it.pl> is meant as a scratch pad for you to try B<Data::TreeDumper>.
+
diff --git a/debian/patches/series b/debian/patches/series
index bdae881..09ffec4 100644
--- a/debian/patches/series
+++ b/debian/patches/series
@@ -1,3 +1,4 @@
fix-pod.patch
fix-pod-spelling.patch
+fix-more-spelling.patch
install-module.patch
--
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libdata-treedumper-perl.git
More information about the Pkg-perl-cvs-commits
mailing list