/* * Returns the index of val in the given array, or -1 if val is not in the aray. */ function index_of(val, array) { for (var i = 0; i < array.length; ++i) { if (array[i] == val) return i; } return -1; } /* * Inserts a node before node. */ function insert_anker(node) { // insert anker var anker = document.createElement('a'); var id = node.firstChild.data; anker.id = id; node.parentNode.insertBefore(anker, node); } /* * Creates an
  • node.textvalue
    • node out of the given node. */ function create_link_to_anker(node) { // insert link to the anker var li_node = document.createElement('li'); var a_node = document.createElement('a'); var id = node.firstChild.data; a_node.href= "#" + String(id); a_node.appendChild(document.createTextNode(id)); li_node.appendChild(a_node); return li_node; } function build_content_links(rootId, maxlevel) { var root = document.getElementById(rootId); var headers = new Array(maxlevel); for (var i = 0; i < headers.length; ++i) headers[i] = "h" + String(i+1); var currentLevel = 0; var root_node = document.createElement('div'); var insert_point = document.createElement('ul'); root_node.appendChild(insert_point); for (var i = 0; i < root.childNodes.length; ++i) { n = root.childNodes[i]; var idx = index_of(n.nodeName.toLowerCase(), headers); if (idx != -1) { insert_anker(n); ++i; // for the anker we just inserted var li_node = create_link_to_anker(n); if (idx < currentLevel) { // go up in the tree to find the right