PageSourceSearch

https://sklepwaneko.pl/themes/Coffeeter/modules/cz_verticalmenu/views/js/treeManagement.js

js sklepwaneko.pl collected 2026-10-02 23:59:41 UTC 1,698 bytes, 43 lines download raw bytes

1$(document).ready(function() {
2    $('ul.tree.dhtml').hide();
3    if (!$('ul.tree.dhtml').hasClass('dynamized')) {
4        $('ul.tree.dhtml ul').prev().before("<span class='grower OPEN'> </span>");
5        $('ul.tree.dhtml ul li:last-child, ul.tree.dhtml li:last-child').addClass('last');
6        $('ul.tree.dhtml span.grower.OPEN').addClass('CLOSE').removeClass('OPEN').parent().find('ul:first').hide();
7        $('ul.tree.dhtml').show();
8        $('ul.tree.dhtml .selected').parents().each(function() {
9            if ($(this).is('ul'))
10                toggleBranch($(this).prev().prev(), true);
11        });
12        toggleBranch($('ul.tree.dhtml .selected').prev(), true);
13        $('ul.tree.dhtml span.grower').click(function() {
14            toggleBranch($(this));
15        });
16        $('ul.tree.dhtml').addClass('dynamized');
17        $('ul.tree.dhtml').removeClass('dhtml');
18        $('ul.tree.dynamized').removeClass('tree');
19    }
20});
21
22function openBranch(jQueryElement, noAnimation) {
23    jQueryElement.addClass('OPEN').removeClass('CLOSE');
24    if (noAnimation)
25        jQueryElement.parent().find('ul:first').show();
26    else
27        jQueryElement.parent().find('ul:first').slideDown();
28}
29
30function closeBranch(jQueryElement, noAnimation) {
31    jQueryElement.addClass('CLOSE').removeClass('OPEN');
32    if (noAnimation)
33        jQueryElement.parent().find('ul:first').hide();
34    else
35        jQueryElement.parent().find('ul:first').slideUp();
36}
37
38function toggleBranch(jQueryElement, noAnimation) {
39    if (jQueryElement.hasClass('OPEN'))
40        closeBranch(jQueryElement, noAnimation);
41    else
42        openBranch(jQueryElement, noAnimation);
43};;

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.