book['bid']) ? 0 : $node->book['bid']; } $ontop = TRUE; if ($node->book['plid'] > 0) { $ontop = FALSE; } if ($delta == 0 ) { $books = book_get_books(); $query= " select * from {content_type_book} order by field_intro_weight_value "; $result = db_query($query); while ($order = db_fetch_array($result)) { $book2[] = $books[$order['nid']]; } $books = $book2; reset($books); $cur_bid = current($books); if ( $cur_bid['bid'] !== $current_bid ) { while ($cur_bid['bid'] !== $current_bid && $cur_bid['bid']) { next($books); $cur_bid = current($books); } $prev = prev($books); if (is_array($prev)) next($books); $next = next($books); # on prend la premiere page du book pas l intro $bid = db_result(db_query('select bid from {book} where nid=%d',$prev['nid'])); $link = db_result(db_query('select link_path from {menu_links} where depth=2 and menu_name=\'%s\' order by weight ASC LIMIT 1','book-toc-'.$bid)); $link=drupal_get_path_alias($link); if (is_array($prev)) $link_prev = l('', $link, array("html"=> TRUE)); # if (is_array($prev)) $link_next = l('', 'node/'.$prev['nid'], array("html"=> TRUE)); $bid = db_result(db_query('select bid from {book} where nid=%d',$next['nid'])); $link = db_result(db_query('select link_path from {menu_links} where depth=2 and menu_name=\'%s\' order by weight ASC LIMIT 1','book-toc-'.$bid)); $link=drupal_get_path_alias($link); if (is_array($next)) $link_next = l('', $link, array("html"=> TRUE)); # if (is_array($next)) $link_next = l('', 'node/'.$next['nid'], array("html"=> TRUE)); $block['content'] = $link_prev.' projekt '.$link_next; } else { $next = next($books); $bid = db_result(db_query('select bid from {book} where nid=%d',$next['nid'])); $link = db_result(db_query('select link_path from {menu_links} where depth=2 and menu_name=\'%s\' order by weight ASC LIMIT 1','book-toc-'.$bid)); $link=drupal_get_path_alias($link); if (is_array($next)) $link_next = l('', $link, array("html"=> TRUE)); # if (is_array($next)) $link_next = l('', 'node/'.$next['nid'], array("html"=> TRUE)); $block['content'] = $link_prev.' projekt '.$link_next; } } elseif ($delta == 1 ) { $nodebook = node_load($node->book['bid']); $flat = (book_get_flat_menu($nodebook->book)); reset($flat); $cur_link = current($flat); if ( $cur_link['link_path'] !== 'node/'.$node->nid ) { while ($cur_link['link_path'] !== 'node/'.$node->nid && $cur_link['link_path']) { next($flat); $cur_link = current($flat); } $prev = prev($flat); if (is_array($prev)) next($flat); $next = next($flat); #var_dump($prev); # $link = db_result(db_query('select link_path from {menu_links} where depth=2 and menu_name=\'%s\' order by weight ASC LIMIT 1',$prev["menu_name"])); # $link=drupal_get_path_alias($link); if (is_array($prev)) $link_prev = l('', $prev['link_path'], array("html"=> TRUE)); #if (is_array($prev)) $link_prev = l('', $link, array("html"=> TRUE)); # $link = db_result(db_query('select link_path from {menu_links} where depth=2 and menu_name=\'%s\' order by weight ASC LIMIT 1',$next["menu_name"])); # $link=drupal_get_path_alias($link); # if (is_array($next)) $link_next = l('', $link, array("html"=> TRUE)); if (is_array($next)) $link_next = l('', $next['link_path'], array("html"=> TRUE)); } else { $next = next($flat); $link = db_result(db_query('select link_path from {menu_links} where depth=2 and menu_name=\'%s\' order by weight ASC LIMIT 1',$next["menu_name"])); $link=drupal_get_path_alias($link); if (is_array($next)) $link_next = l('', $link, array("html"=> TRUE)); #if (is_array($next)) $link_next = l('', $next['link_path'], array("html"=> TRUE)); } // next($flat); // dsm($flat); // dsm($node); $block['content'] = book_children($nodebook->book). ''; } return $block; case 'configure': $options = array( 'all pages' => t('Show block on all pages'), 'book pages' => t('Show block only on book pages'), ); $form['book_block_mode'] = array( '#type' => 'radios', '#title' => t('Book navigation block display'), '#options' => $options, '#default_value' => variable_get('book_block_mode', 'all pages'), '#description' => t("If Show block on all pages is selected, the block will contain the automatically generated menus for all of the site's books. If Show block only on book pages is selected, the block will contain only the one menu corresponding to the current page's book. In this case, if the current page is not in a book, no block will be displayed. The Page specific visibility settings or other visibility settings can be used in addition to selectively display this block."), ); return $form; case 'save': variable_set('book_block_mode', $edit['book_block_mode']); break; } } ?> | Kombinat
Jezerska promenada, Bled
natečaj  

.

avtorji :
.
.
.
.
.
.
vizualizacije
naročnik
.
leto natečaja:   

.

Blaž Kandus, u.d.i.a
Alenka Korenjak, u.d.i.a
Ana Grk, u.d.i.a
Rok Hočevar, m.i.a
Urška Kranjc, u.d.i.k.a.
Gaja Trbižan, u.d.i.k.a.
Matija Jemec
Rok Hočevar, m.i.a
Občina Bled in
Zbornica za arhitekturo in prostor Slovenije (ZAPS)
2016

.

Natečaj za ureditev Jezerske promenade na Bledu je bil razpisan z namenom urejanja osrednjih sprehajalnih površin v enem najpomembnejših slovenskih turističnih krajev - med hotelom Toplice in Prešernovim spomenikom.

S predlagano natečajno rešitvijo smo izpostavili letoviški značaj kraja. Poudarili smo poglede, stik z jezerom in zeleni, parkovni kontekst promenade.

Osrednji prostor nove ureditve je razgledišče v izteku Ljubljanske ulice. Predstavlja jasno urbanistično potezo, ki združuje arhitekturo in krajino, obiskovalcu pa nudi prepoznavno doživetje ob prvem stiku s podobo Bleda. Pot do jezera vodi obiskovalca tako, da se med vsaki prehodom ozre proti eni izmed znamenitosti Bleda. Presečišče razgledišča in promenade se uredi kot trg, ki se odpira proti jezeru. Novo stopnišče proti vodi se nežno zaje v zeleno brežino.

Obstoječa linija promenade se napne v smeri proti severu in se s tem približa organski strukturi poti v parkovnih površinah. Napeta linija vpostavlja novo hierarhijo v prostoru, v kateri je promenada osrednja os, na katero se navezujejo druge poti oz. dostopi, pot pa se v obeh smereh nadaljuje okoli jezera. Teren se zvezno navezuje na okoliške parkovne površine.