]> iEval git - html-element-library.git/blob - lib/HTML/Element/Library.pm
Tidy code
[html-element-library.git] / lib / HTML / Element / Library.pm
1 package HTML::Element::Library;
2 use strict;
3 use warnings;
4
5 our $VERSION = '5.120100';
6 our $DEBUG = 0;
7
8 use Array::Group ':all';
9 use Carp 'confess';
10 use Data::Dumper;
11 use Data::Rmap 'rmap_array';
12 use HTML::Element;
13 use HTML::FillInForm;
14 use List::MoreUtils ':all';
15 use List::Rotation::Cycle;
16 use List::Util 'first';
17 use Params::Validate ':all';
18 use Scalar::Listify;
19
20 # https://rt.cpan.org/Ticket/Display.html?id=44105
21 sub HTML::Element::fillinform {
22 my ($tree, $hashref, $return_tree, $guts) = @_;
23 (ref $hashref) eq 'HASH' or confess 'hashref not supplied as argument' ;
24
25 my $html = $tree->as_HTML;
26 my $new_html = HTML::FillInForm->fill(\$html, $hashref);
27
28 if ($return_tree) {
29 my $tree = HTML::TreeBuilder->new_from_content($new_html);
30 $tree = $guts ? $tree->guts : $tree ;
31 } else {
32 $new_html;
33 }
34 }
35
36 sub HTML::Element::siblings {
37 my $element = shift;
38 my $p = $element->parent;
39 return () unless $p;
40 $p->content_list;
41 }
42
43 sub HTML::Element::defmap {
44 my($tree, $attr, $hashref, $debug) = @_;
45
46 while (my ($k, $v) = (each %$hashref)) {
47 warn "defmap looks for ($attr => $k)" if $debug;
48 my $found = $tree->look_down($attr => $k);
49 if ($found) {
50 warn "($attr => $k) was found.. replacing with '$v'" if $debug;
51 $found->replace_content( $v );
52 }
53 }
54 }
55
56 sub HTML::Element::_only_empty_content {
57 my ($self) = @_;
58 my @c = $self->content_list;
59 my $length = scalar @c;
60
61 scalar @c == 1 and not length $c[0];
62 }
63
64 sub HTML::Element::prune {
65 my ($self) = @_;
66
67 for my $c ($self->content_list) {
68 next unless ref $c;
69 $c->prune;
70 }
71
72 # post-order:
73 $self->delete if ($self->is_empty or $self->_only_empty_content);
74 $self;
75 }
76
77 sub HTML::Element::newchild {
78 my ($lol, $parent_label, @newchild) = @_;
79 rmap_array {
80 if ($_->[0] eq $parent_label) {
81 $_ = [ $parent_label => @newchild ];
82 Data::Rmap::cut($_);
83 } else {
84 $_;
85 }
86 } $lol;
87 }
88
89 sub HTML::Element::crunch {
90 my $container = shift;
91
92 my %p = validate(@_, {
93 look_down => { type => ARRAYREF },
94 leave => { default => 1 },
95 });
96
97 my @look_down = @{$p{look_down}} ;
98 my @elem = $container->look_down(@look_down) ;
99
100 my $left;
101
102 for my $elem (@elem) {
103 $elem->detach if $left++ >= $p{leave};
104 }
105 }
106
107 sub HTML::Element::hash_map {
108 my $container = shift;
109
110 my %p = validate(@_, {
111 hash => { type => HASHREF },
112 to_attr => 1,
113 excluding => { type => ARRAYREF , default => [] },
114 debug => { default => 0 },
115 });
116
117 warn 'The container tag is ', $container->tag if $p{debug} ;
118 warn 'hash' . Dumper($p{hash}) if $p{debug} ;
119 #warn 'at_under' . Dumper(\@_) if $p{debug} ;
120
121 my @same_as = $container->look_down( $p{to_attr} => qr/.+/ ) ;
122
123 warn 'Found ' . scalar(@same_as) . ' nodes' if $p{debug} ;
124
125 for my $same_as (@same_as) {
126 my $attr_val = $same_as->attr($p{to_attr}) ;
127 if (first { $attr_val eq $_ } @{$p{excluding}}) {
128 warn "excluding $attr_val" if $p{debug} ;
129 next;
130 }
131 warn "processing $attr_val" if $p{debug} ;
132 $same_as->replace_content($p{hash}->{$attr_val});
133 }
134 }
135
136 sub HTML::Element::hashmap {
137 my ($container, $attr_name, $hashref, $excluding, $debug) = @_;
138
139 $excluding ||= [] ;
140
141 $container->hash_map(hash => $hashref,
142 to_attr => $attr_name,
143 excluding => $excluding,
144 debug => $debug);
145 }
146
147
148 sub HTML::Element::passover {
149 my ($tree, @to_preserve) = @_;
150
151 warn "ARGS: my ($tree, @to_preserve)" if $DEBUG;
152 warn $tree->as_HTML(undef, ' ') if $DEBUG;
153
154 my $exodus = $tree->look_down(id => $to_preserve[0]);
155
156 warn "E: $exodus" if $DEBUG;
157
158 my @s = HTML::Element::siblings($exodus);
159
160 for my $s (@s) {
161 next unless ref $s;
162 $s->delete unless first { $s->attr('id') eq $_ } @to_preserve;
163 }
164
165 return $exodus; # Goodbye Egypt! http://en.wikipedia.org/wiki/Passover
166 }
167
168 sub HTML::Element::sibdex {
169 my $element = shift;
170 firstidx { $_ eq $element } $element->siblings
171 }
172
173 sub HTML::Element::addr { goto &HTML::Element::sibdex }
174
175 sub HTML::Element::replace_content {
176 my $elem = shift;
177 $elem->delete_content;
178 $elem->push_content(@_);
179 }
180
181 sub HTML::Element::wrap_content {
182 my($self, $wrap) = @_;
183 my $content = $self->content;
184 if (ref $content) {
185 $wrap->push_content(@$content);
186 @$content = ($wrap);
187 }
188 else {
189 $self->push_content($wrap);
190 }
191 $wrap;
192 }
193
194 sub HTML::Element::Library::super_literal {
195 my($text) = @_;
196 HTML::Element->new('~literal', text => $text);
197 }
198
199 sub HTML::Element::position {
200 # Report coordinates by chasing addr's up the
201 # HTML::ElementSuper tree. We know we've reached
202 # the top when a) there is no parent, or b) the
203 # parent is some HTML::Element unable to report
204 # it's position.
205 my $p = shift;
206 my @pos;
207 while ($p) {
208 my $a = $p->addr;
209 unshift(@pos, $a) if defined $a;
210 $p = $p->parent;
211 }
212 @pos;
213 }
214
215 sub HTML::Element::content_handler {
216 my ($tree, %content_hash) = @_;
217
218 for my $k (keys %content_hash) {
219 $tree->set_child_content(id => $k, $content_hash{$k});
220 }
221 }
222
223 sub HTML::Element::assign { goto &HTML::Element::content_handler }
224
225 sub make_counter {
226 my $i = 1;
227 sub {
228 shift() . ':' . $i++
229 }
230 }
231
232 sub HTML::Element::iter {
233 my ($tree, $p, @data) = @_;
234
235 # warn 'P: ' , $p->attr('id') ;
236 # warn 'H: ' , $p->as_HTML;
237
238 # my $id_incr = make_counter;
239 my @item = map {
240 my $new_item = clone $p;
241 $new_item->replace_content($_);
242 $new_item;
243 } @data;
244
245 $p->replace_with(@item);
246 }
247
248 sub HTML::Element::iter2 {
249 my $tree = shift;
250
251 #warn "INPUT TO TABLE2: ", Dumper \@_;
252
253 my %p = validate(
254 @_, {
255 wrapper_ld => { default => ['_tag' => 'dl'] },
256 wrapper_data => 1,
257 wrapper_proc => { default => undef },
258 item_ld => {
259 default => sub {
260 my $tree = shift;
261 [
262 $tree->look_down('_tag' => 'dt'),
263 $tree->look_down('_tag' => 'dd')
264 ];
265 }},
266 item_data => {
267 default => sub {
268 my ($wrapper_data) = @_;
269 shift(@{$wrapper_data}) ;
270 }},
271 item_proc => {
272 default => sub {
273 my ($item_elems, $item_data, $row_count) = @_;
274 $item_elems->[$_]->replace_content($item_data->[$_]) for (0,1) ;
275 $item_elems;
276 }},
277 splice => {
278 default => sub {
279 my ($container, @item_elems) = @_;
280 $container->splice_content(0, 2, @item_elems);
281 }
282 },
283 debug => {default => 0}
284 }
285 );
286
287 warn "wrapper_data: " . Dumper $p{wrapper_data} if $p{debug} ;
288
289 my $container = ref_or_ld($tree, $p{wrapper_ld});
290 warn "container: " . $container if $p{debug} ;
291 warn "wrapper_(preproc): " . $container->as_HTML if $p{debug} ;
292 $p{wrapper_proc}->($container) if defined $p{wrapper_proc} ;
293 warn "wrapper_(postproc): " . $container->as_HTML if $p{debug} ;
294
295 my $_item_elems = $p{item_ld}->($container);
296
297 my $row_count;
298 my @item_elem;
299 while(1){
300 my $item_data = $p{item_data}->($p{wrapper_data});
301 last unless defined $item_data;
302
303 warn Dumper("item_data", $item_data);
304
305 my $item_elems = [ map { $_->clone } @{$_item_elems} ] ;
306
307 if ($p{debug}) {
308 for (@{$item_elems}) {
309 warn "ITEM_ELEMS ", $_->as_HTML;
310 }
311 }
312
313 my $new_item_elems = $p{item_proc}->($item_elems, $item_data, ++$row_count);
314
315 if ($p{debug}) {
316 for (@{$new_item_elems}) {
317 warn "NEWITEM_ELEMS ", $_->as_HTML;
318 }
319 }
320
321 push @item_elem, @{$new_item_elems} ;
322 }
323
324 warn "pushing " . @item_elem . " elems " if $p{debug} ;
325
326 $p{splice}->($container, @item_elem);
327 }
328
329 sub HTML::Element::dual_iter {
330 my ($parent, $data) = @_;
331
332 my ($prototype_a, $prototype_b) = $parent->content_list;
333
334 # my $id_incr = make_counter;
335
336 my $i;
337
338 @$data %2 == 0 or confess 'dataset does not contain an even number of members';
339
340 my @iterable_data = ngroup 2 => @$data;
341
342 my @item = map {
343 my ($new_a, $new_b) = map { clone $_ } ($prototype_a, $prototype_b) ;
344 $new_a->splice_content(0,1, $_->[0]);
345 $new_b->splice_content(0,1, $_->[1]);
346 #$_->attr('id', $id_incr->($_->attr('id'))) for ($new_a, $new_b) ;
347 ($new_a, $new_b)
348 } @iterable_data;
349
350 $parent->splice_content(0, 2, @item);
351 }
352
353 sub HTML::Element::set_child_content {
354 my $tree = shift;
355 my $content = pop;
356 my @look_down = @_;
357
358 my $content_tag = $tree->look_down(@look_down);
359
360 unless ($content_tag) {
361 warn "criteria [@look_down] not found";
362 return;
363 }
364
365 $content_tag->replace_content($content);
366 }
367
368 sub HTML::Element::highlander {
369 my ($tree, $local_root_id, $aref, @arg) = @_;
370
371 ref $aref eq 'ARRAY' or confess "must supply array reference";
372
373 my @aref = @$aref;
374 @aref % 2 == 0 or confess "supplied array ref must have an even number of entries";
375
376 warn __PACKAGE__ if $DEBUG;
377
378 my $survivor;
379 while (my ($id, $test) = splice @aref, 0, 2) {
380 warn $id if $DEBUG;
381 if ($test->(@arg)) {
382 $survivor = $id;
383 last;
384 }
385 }
386
387 my @id_survivor = (id => $survivor);
388 my $survivor_node = $tree->look_down(@id_survivor);
389 # warn $survivor;
390 # warn $local_root_id;
391 # warn $node;
392
393 warn "survivor: $survivor" if $DEBUG;
394 warn "tree: " . $tree->as_HTML if $DEBUG;
395
396 $survivor_node or die "search for @id_survivor failed in tree($tree): " . $tree->as_HTML;
397
398 my $survivor_node_parent = $survivor_node->parent;
399 $survivor_node = $survivor_node->clone;
400 $survivor_node_parent->replace_content($survivor_node);
401
402 warn "new tree: " . $tree->as_HTML if $DEBUG;
403
404 $survivor_node;
405 }
406
407 sub HTML::Element::highlander2 {
408 my $tree = shift;
409
410 my %p = validate(@_, {
411 cond => { type => ARRAYREF },
412 cond_arg => {
413 type => ARRAYREF,
414 default => []
415 },
416 debug => { default => 0 }
417 });
418
419 my @cond = @{$p{cond}};
420 @cond % 2 == 0 or confess "supplied array ref must have an even number of entries";
421
422 warn __PACKAGE__ if $p{debug};
423
424 my @cond_arg = @{$p{cond_arg}};
425
426 my $survivor; my $then;
427 while (my ($id, $if_then) = splice @cond, 0, 2) {
428 warn $id if $p{debug};
429 my ($if, $_then);
430
431 if (ref $if_then eq 'ARRAY') {
432 ($if, $_then) = @$if_then;
433 } else {
434 ($if, $_then) = ($if_then, sub {});
435 }
436
437 if ($if->(@cond_arg)) {
438 $survivor = $id;
439 $then = $_then;
440 last;
441 }
442 }
443
444 my @ld = (ref $survivor eq 'ARRAY') ? @$survivor : (id => $survivor);
445
446 warn "survivor: ", $survivor if $p{debug};
447 warn "survivor_ld: ", Dumper \@ld if $p{debug};
448
449 my $survivor_node = $tree->look_down(@ld);
450
451 $survivor_node or confess "search for @ld failed in tree($tree): " . $tree->as_HTML;
452
453 my $survivor_node_parent = $survivor_node->parent;
454 $survivor_node = $survivor_node->clone;
455 $survivor_node_parent->replace_content($survivor_node);
456
457 # **************** NEW FUNCTIONALITY *******************
458 # apply transforms on survivor node
459
460 warn "SURV::pre_trans " . $survivor_node->as_HTML if $p{debug};
461 $then->($survivor_node, @cond_arg);
462 warn "SURV::post_trans " . $survivor_node->as_HTML if $p{debug};
463 # **************** NEW FUNCTIONALITY *******************
464
465 $survivor_node;
466 }
467
468 sub overwrite_action {
469 my ($mute_node, %X) = @_;
470
471 $mute_node->attr($X{local_attr}{name} => $X{local_attr}{value}{new});
472 }
473
474 sub HTML::Element::overwrite_attr {
475 my $tree = shift;
476
477 $tree->mute_elem(@_, \&overwrite_action);
478 }
479
480 sub HTML::Element::mute_elem {
481 my ($tree, $mute_attr, $closures, $post_hook) = @_;
482
483 warn "my mute_node = $tree->look_down($mute_attr => qr/.*/) ;";
484 my @mute_node = $tree->look_down($mute_attr => qr/.*/) ;
485
486 for my $mute_node (@mute_node) {
487 my ($local_attr,$mute_key) = split /\s+/, $mute_node->attr($mute_attr);
488 my $local_attr_value_current = $mute_node->attr($local_attr);
489 my $local_attr_value_new = $closures->{$mute_key}->($tree, $mute_node, $local_attr_value_current);
490 $post_hook->(
491 $mute_node,
492 tree => $tree,
493 local_attr => {
494 name => $local_attr,
495 value => {
496 current => $local_attr_value_current,
497 new => $local_attr_value_new
498 }
499 }
500 ) if ($post_hook) ;
501 }
502 }
503
504
505
506 sub HTML::Element::table {
507 my ($s, %table) = @_;
508 my $table = {};
509
510 # Get the table element
511 $table->{table_node} = $s->look_down(id => $table{gi_table});
512 $table->{table_node} or confess "table tag not found via (id => $table{gi_table}";
513
514 # Get the prototype tr element(s)
515 my @table_gi_tr = listify $table{gi_tr} ;
516 my @iter_node = map {
517 my $tr = $table->{table_node}->look_down(id => $_);
518 $tr or confess "tr with id => $_ not found";
519 $tr;
520 } @table_gi_tr;
521
522 warn "found " . @iter_node . " iter nodes " if $DEBUG;
523 my $iter_node = List::Rotation::Cycle->new(@iter_node);
524
525 # warn $iter_node;
526 warn Dumper ($iter_node, \@iter_node) if $DEBUG;
527
528 # $table->{content} = $table{content};
529 # $table->{parent} = $table->{table_node}->parent;
530
531 # $table->{table_node}->detach;
532 # $_->detach for @iter_node;
533
534 my @table_rows;
535
536 while (1) {
537 my $row = $table{tr_data}->($table, $table{table_data});
538 last unless defined $row;
539
540 # get a sample table row and clone it.
541 my $I = $iter_node->next;
542 warn "I: $I" if $DEBUG;
543 my $new_iter_node = $I->clone;
544
545 $table{td_data}->($new_iter_node, $row);
546 push @table_rows, $new_iter_node;
547 }
548
549 if (@table_rows) {
550 my $replace_with_elem = $s->look_down(id => shift @table_gi_tr) ;
551 $s->look_down(id => $_)->detach for @table_gi_tr;
552 $replace_with_elem->replace_with(@table_rows);
553 }
554 }
555
556 sub ref_or_ld {
557 my ($tree, $slot) = @_;
558
559 if (ref($slot) eq 'CODE') {
560 $slot->($tree);
561 } else {
562 $tree->look_down(@$slot);
563 }
564 }
565
566 sub HTML::Element::table2 {
567 my $tree = shift;
568
569 my %p = validate(
570 @_, {
571 table_ld => { default => ['_tag' => 'table'] },
572 table_data => 1,
573 table_proc => { default => undef },
574 tr_ld => { default => ['_tag' => 'tr'] },
575 tr_data => {
576 default => sub {
577 my ($self, $data) = @_;
578 shift(@{$data}) ;
579 }},
580 tr_base_id => { default => undef },
581 tr_proc => { default => sub {} },
582 td_proc => 1,
583 debug => {default => 0}
584 }
585 );
586
587 warn "INPUT TO TABLE2: ", Dumper \@_ if $p{debug};
588 warn "table_data: " . Dumper $p{table_data} if $p{debug} ;
589
590 my $table = {};
591
592 # Get the table element
593 $table->{table_node} = ref_or_ld( $tree, $p{table_ld} ) ;
594 $table->{table_node} or confess "table tag not found via " . Dumper($p{table_ld}) ;
595
596 warn "table: " . $table->{table_node}->as_HTML if $p{debug};
597
598 # Get the prototype tr element(s)
599 my @proto_tr = ref_or_ld( $table->{table_node}, $p{tr_ld} ) ;
600
601 warn "found " . @proto_tr . " iter nodes " if $p{debug};
602
603 return unless @proto_tr;
604
605 if ($p{debug}) {
606 warn $_->as_HTML for @proto_tr;
607 }
608 my $proto_tr = List::Rotation::Cycle->new(@proto_tr);
609
610 my $tr_parent = $proto_tr[0]->parent;
611 warn "parent element of trs: " . $tr_parent->as_HTML if $p{debug};
612
613 my $row_count;
614
615 my @table_rows;
616
617 while(1) {
618 my $row = $p{tr_data}->($table, $p{table_data}, $row_count);
619 warn "data row: " . Dumper $row if $p{debug};
620 last unless defined $row;
621
622 # wont work: my $new_iter_node = $table->{iter_node}->clone;
623 my $new_tr_node = $proto_tr->next->clone;
624 warn "new_tr_node: $new_tr_node" if $p{debug};
625
626 $p{tr_proc}->($tree, $new_tr_node, $row, $p{tr_base_id}, ++$row_count) if defined $p{tr_proc};
627
628 warn "data row redux: " . Dumper $row if $p{debug};
629
630 $p{td_proc}->($new_tr_node, $row);
631 push @table_rows, $new_tr_node;
632 }
633
634 $_->detach for @proto_tr;
635
636 $tr_parent->push_content(@table_rows) if (@table_rows) ;
637 }
638
639 sub HTML::Element::unroll_select {
640 my ($s, %select) = @_;
641
642 my $select = {};
643 warn "Select Hash: " . Dumper(\%select) if $select{debug};
644
645 my $select_node = $s->look_down(id => $select{select_label});
646 warn "Select Node: " . $select_node if $select{debug};
647
648 unless ($select{append}) {
649 for my $option ($select_node->look_down('_tag' => 'option')) {
650 $option->delete;
651 }
652 }
653
654 my $option = HTML::Element->new('option');
655 warn "Option Node: " . $option if $select{debug};
656
657 $option->detach;
658
659 while (my $row = $select{data_iter}->($select{data})) {
660 warn "Data Row:" . Dumper($row) if $select{debug};
661 my $o = $option->clone;
662 $o->attr('value', $select{option_value}->($row));
663 $o->attr('SELECTED', 1) if (exists $select{option_selected} and $select{option_selected}->($row));
664
665 $o->replace_content($select{option_content}->($row));
666 $select_node->push_content($o);
667 warn $o->as_HTML if $select{debug};
668 }
669 }
670
671 sub HTML::Element::set_sibling_content {
672 my ($elt, $content) = @_;
673
674 $elt->parent->splice_content($elt->pindex + 1, 1, $content);
675 }
676
677 sub HTML::TreeBuilder::parse_string {
678 my ($package, $string) = @_;
679
680 my $h = HTML::TreeBuilder->new;
681 HTML::TreeBuilder->parse($string);
682 }
683
684 1;
685 __END__
This page took 0.1035 seconds and 4 git commands to generate.