51ff3226 |
1 | {* header *}{include file="1549864.tpl"} |
2 | |
3 | {if $user_id eq false} |
4 | <center>{* loginbox *}{include file="1549885.tpl"}</center><br><br> |
5 | {/if} |
6 | |
7 | <table width='100%'><tr> |
8 | |
9 | <!--left column--> |
10 | <td valign='top' align='center' width='23%'> |
11 | {* node_settings *} |
12 | {include file="1549925.tpl"} |
13 | |
14 | {* get_poll_box *} |
15 | {include file="1549834.tpl"} |
16 | <br> |
17 | {*get_bookmark_statistics_box*} |
18 | {include file="1549386.tpl"} |
19 | </td> |
20 | <!--end of left column--> |
21 | |
22 | <!--main central column--> |
23 | <td width=666 valign='top'> |
24 | <div class='bordered' style='width:666px; white-space:pre;'> |
25 | {$node.node_content|escape:"html"|wordwrap:100} |
26 | </div><br /><br /> |
27 | {*showing form for adding child node*} |
28 | <form enctype="multipart/form-data" action='/id/{$node.node_id}/{if $action neq false}{$action}{/if}'method='post' name='formular'> |
29 | {if $permissions.w eq true}{*addnode*}{include file="1548927.tpl"}{/if} |
30 | |
31 | {math equation="x/8" x=$node.vector_depth assign="crd"} |
32 | {if $template_event eq 'preview'} |
33 | <table width=666> |
34 | <tr> |
35 | <td valign='top' rowspan='2' ><img hspace='5' src='{get_image_link id=$user_id}'></td> |
36 | <td width='100%' valign='top'> |
37 | <table width='100%'> |
38 | <tr class='header'><td align='center'>PREVIEW</td></tr> |
39 | <tr><td>{$post_vars.node_content|preview}</td></tr> |
40 | </table> |
41 | </table> |
42 | {* end of preview *} |
43 | {elseif $template_event eq 'filter_by'} |
44 | {get_threaded_children listing_amount=23232322323 offset=$offset types=$children_types search_type=$post_vars.search_type search=$post_vars.node_content} |
45 | {elseif $node.node_user_subchild_count eq true} |
46 | {get_threaded_children offset=0 link='yes' listing_amount=23232323232 time=$node.last_visit time=$node.last_visit orderby=$listing_order } |
47 | <!--<center><span class='most_important'>pozor doslo k zmene funkcnosti systemu, NEW prispevky (vsetky) sa zobrazuju od najstarsieho k najnovsiemu zhora dolu</span></center>--> |
48 | {else} |
49 | {get_threaded_children link='yes' listing_amount=$listing_amount offset=$offset ordearby=$listing_order} |
50 | {/if} |
51 | |
52 | <ul style='margin:0;' id='th_root'> |
53 | {section name=child loop=$get_threaded_children}{if $get_threaded_children[child].template_id neq 1549834} |
54 | {*position in tree*} |
55 | {math equation="(x/8)-y" x=$get_threaded_children[child].depth y=$crd assign="hierarch"} |
56 | {math equation="(x/8)-y" x=$get_threaded_children[child.index_prev].depth y=$crd assign="prev_depth"} |
57 | {math equation="(x/8)-y" x=$get_threaded_children[child.index_next].depth y=$crd assign="next_depth"} |
58 | {*depth in hierarchy*} |
59 | {if $smarty.section.child.last}{math equation="x-1" x=$hierarch assign="h_depth"}{else}{math equation="x-y" x=$hierarch y=$next_depth assign="h_depth"}{/if} |
60 | {*root_id decka*} |
61 | {str_split string=$get_threaded_children[child].node_vector name=hroot length=8} |
62 | {eval var=$str_split.hroot.$crd assign="h_root"} |
63 | {str_split string=$get_threaded_children[child.index_prev].node_vector name=proot length=8} |
64 | {eval var=$str_split.proot.$crd assign="p_root"} |
65 | {str_split string=$get_threaded_children[child.index_next].node_vector name=nroot length=8} |
66 | {eval var=$str_split.nroot.$crd assign="n_root"} |
67 | {*depth in hierarchy*} |
68 | {math equation="(x-y)-1" x=$hierarch y=$prev_depth assign="p_depth"} |
69 | {math equation="x-1" x=$hierarch assign="ph_depth"} |
70 | {math equation="x-y" x=$next_depth y=$hierarch assign="c_depth"} |
71 | {if $smarty.section.child.last} |
72 | {math equation="x-1" x=$hierarch assign="h_depth"} |
73 | {elseif $h_root neq $n_root && $get_threaded_children[child].node_status neq 'linked'} |
74 | {math equation="x-1" x=$hierarch assign="h_depth"} |
75 | {elseif $h_root neq $n_root && $get_threaded_children[child.index_next].node_status neq 'linked'} |
76 | {math equation="x-1" x=$hierarch assign="h_depth"} |
77 | {else} |
78 | {math equation="x-y" x=$hierarch y=$next_depth assign="h_depth"} |
79 | {/if} |
80 | {math equation="x+1" x=$crd assign="starter"} |
81 | {eval var=$get_threaded_children[child].node_creator assign="h_creator"} |
82 | |
83 | {*child content*} |
84 | {capture name=child_container} |
85 | {*IGNORE USER CONDITION*}{if $ignore[$h_creator] neq true} |
86 | {* put.Ty hack *}{if $get_threaded_children[child].synapse_creator neq ''} |
87 | <img src='{get_image_link id=$get_threaded_children[child].synapse_creator}' width='50' alt='SYNAPSE CREATOR' style='float:left;' /> |
88 | {else} |
89 | <img src='{get_image_link id=$get_threaded_children[child].node_creator}' width='50' alt='{$get_threaded_children[child].login}' onclick="km();sm('{$get_threaded_children[child].login}','{$get_threaded_children[child].node_creator}','{$node.node_id}')" style='float:left;' /> |
90 | {/if}{*end of put.Ty hack *} |
91 | <div class='bordered' style='margin-left: 55px; overflow:visible padding:2px; width:100%; position:relative;'> |
92 | <div class='th_header'> |
93 | {if $get_threaded_children[child].node_name eq ''} |
94 | <a href='/id/{$get_threaded_children[child].node_id}'>enter node {$get_threaded_children[child].node_id}</a> |
95 | {else} |
96 | <a href='/id/{$get_threaded_children[child].node_id}'>{$get_threaded_children[child].node_name}</a> |
97 | {/if} |
98 | {if $child.node_creator eq $user_id} |
99 | | <a href='/id/{$get_threaded_children[child].node_id}/1961033'>conf</a> |
100 | {/if} |
101 | <input type='checkbox' value='{$get_threaded_children[child].node_id}' name='node_chosen[]' /> |
102 | [<a href='/id/{$get_threaded_children[child].node_creator}'>{$get_threaded_children[child].login}</a>] |
103 | {$get_threaded_children[child].node_created|date_format:"%d.%m.%Y. - %H:%M:%S"} |
104 | {if $get_threaded_children[child].node_updated} |
105 | (modif: {$get_threaded_children[child].node_updated|date_format:"%d.%m.%Y. - %H:%M:%S"}) |
106 | {/if} |
107 | {if $get_threaded_children[child].k > 0} |
108 | [<span class='most_important'>{$get_threaded_children[child].k}K</span>] |
109 | {/if} |
110 | {if $get_threaded_children[child].node_created > $node.last_visit} |
111 | <span class='most_important'> NEW</span> |
112 | {/if} |
113 | {if $get_threaded_children[child].node_status eq 'linked'} |
114 | <span class='most_important'> HARDLINK</span> |
115 | {/if} |
116 | {if $get_threaded_children[child].node_updated > $node.last_visit} |
117 | <span class='most_important'> !!CONTENT CHANGED!!</span> |
118 | {/if} |
119 | </div> |
120 | <div class='th_content' style='margin-top: 5px; position:relative;'> |
121 | <span style='white-space:pre;'>{$get_threaded_children[child].node_content|stripslashes|escape:"html"|wordwrap:100}</span> |
122 | </div> |
123 | </div> |
124 | {/if}{*IGNORE USER CONDITION end*} |
125 | {/capture} |
126 | {*end of child content*} |
127 | |
128 | {*stromcek prestri sa*} |
129 | {if $smarty.section.child.first && $sterter < $hierarch} |
130 | {section name=sta loop=$ph_depth} |
131 | <li class='empty_thread' ><ul> |
132 | {/section} |
133 | {/if} |
134 | {if $get_threaded_children[child].node_parent neq $node.node_id && $get_threaded_children[child].node_status neq 'linked' && $get_threaded_children[child].node_parent neq $get_threaded_children[child.index_prev].node_id && $prev_depth < $hierarch} |
135 | {section name=sta loop=$p_depth} |
136 | <li class='empty_thread'><ul> |
137 | {/section} |
138 | {elseif $get_threaded_children[child].node_parent neq $node.node_id && $get_threaded_children[child.index_prev].node_status neq 'linked' && $get_threaded_children[child].node_parent neq $get_threaded_children[child.index_prev].node_id && $prev_depth < $hierarch} |
139 | {section name=sta loop=$p_depth} |
140 | <li class='empty_thread'><ul> |
141 | {/section} |
142 | {elseif $h_root neq $p_root && $get_threaded_children[child].node_parent neq $node.node_id && $get_threaded_children[child].node_status neq 'linked'} |
143 | {section name=sta loop=$ph_depth} |
144 | <li class='empty_thread'><ul> |
145 | {/section} |
146 | {elseif $h_root neq $p_root && $get_threaded_children[child].node_parent neq $node.node_id && $get_threaded_children[child.index_prev].node_status neq 'linked'} |
147 | {section name=sta loop=$hp_depth} |
148 | <li class='empty_thread'><ul> |
149 | {/section} |
150 | {/if} |
151 | <li class='sub{$get_threaded_children[child].node_creator}' style='list-style-type:none;'> |
152 | <a href='/id/{$get_threaded_children[child].node_parent}' class='vector'>{$get_threaded_children[child].node_vector}</a> |
153 | <div class='th_cnt'> |
154 | {$smarty.capture.child_container} |
155 | </div> |
156 | {if $next_depth > $hierarch && $h_root neq $p_root && $get_threaded_children[child].node_parent neq $node.node_id} |
157 | {section name=con loop=$c_depth} |
158 | <ul> |
159 | <li class='empty_thread'> |
160 | {/section} |
161 | |
162 | {elseif $next_depth > $hierarch && $h_root eq $n_root && $get_threaded_children[child.index_next].node_status neq 'linked'} |
163 | <ul>{elseif $next_depth > $hierarch && $get_threaded_children[child.index_next].node_status eq 'linked'}<ul>{else} |
164 | </li> |
165 | {/if}{if $next_depth < $hierarch || $h_root neq $n_root || $smarty.section.child.last} |
166 | {section name=fin loop=$h_depth} |
167 | </ul> |
168 | </li> |
169 | {/section}{/if} |
170 | {/if}{/section} |
171 | </ul> |
172 | |
173 | <table align='center'><tr> |
174 | <td><input type='hidden' name='get_children_offset' value='{$offset}'></td> |
175 | <td><input type='submit' name='get_children_move' value='<'></td> |
176 | <td><input type='submit' name='get_children_move' value='<<'></td> |
177 | <td><input name='get_children_move' type='submit' value='>>'></td> |
178 | <td><input type='submit' name='get_children_move' value='>'></td> |
179 | </tr></table> |
180 | </form> |