X-Git-Url: http://git.ieval.ro/?a=blobdiff_plain;f=lib%2FHTML%2FElement%2FLibrary.pm;fp=lib%2FHTML%2FElement%2FLibrary.pm;h=2ebc43e8ce4b4ea88e7b2386d36a9adb6da915e9;hb=e0dfa7be65c0072eff275132235091d71b40c4d7;hp=6f905aab1af969bea2e66b791ba41cf47f3b5512;hpb=8ba4187aa8550d8a3f90d30076be0daa90827912;p=html-element-library.git diff --git a/lib/HTML/Element/Library.pm b/lib/HTML/Element/Library.pm index 6f905aa..2ebc43e 100644 --- a/lib/HTML/Element/Library.pm +++ b/lib/HTML/Element/Library.pm @@ -883,7 +883,7 @@ we have a hashref whose keys are the same: my %data = (people_id => 888, phone => '444-4444', password => 'dont-you-dare-render'); Then a single API call allows us to populate the HTML while excluding -those ones we dont: +those ones we don't: $tree->hashmap(smap => \%data, ['password']); @@ -1735,7 +1735,7 @@ L. A loltree is an arrayref consisting of arrayrefs which is used by C<< new_from__lol >> in L to produce HTML trees. The CPAN distro L creates such XML trees by parsing XML -files, analagous to L. The purpose of the functions in +files, analogous to L. The purpose of the functions in this section is to allow you manipulate a loltree programmatically. These could not be methods because if you bless a loltree, then