+ return if afe.length is 0
+ if afe[0].type is TYPE_MARKER or afe[0] in open_els
+ return
+ # Rewind
+ i = 0
+ loop
+ if i is afe.length - 1
+ break
+ i += 1
+ if afe[i].type is TYPE_MARKER or afe[i] in open_els
+ i -= 1 # Advance
+ break
+ # Create
+ loop
+ el = afe[i].shallow_clone()
+ tree_insert_element el
+ afe[i] = el
+ break if i is 0
+ i -= 1
+
+ # http://www.w3.org/TR/html5/syntax.html#adoption-agency-algorithm
+ # adoption agency algorithm
+ # overview here:
+ # http://www.w3.org/TR/html5/syntax.html#misnested-tags:-b-i-/b-/i
+ # http://www.w3.org/TR/html5/syntax.html#misnested-tags:-b-p-/b-/p
+ # http://www.w3.org/TR/html5/syntax.html#unclosed-formatting-elements
+ adoption_agency = (subject) ->
+ if open_els[0].name is subject
+ el = open_els[0]
+ open_els.shift()
+ # remove it from the list of active formatting elements (if found)
+ for t, i in afe
+ if t is el
+ afe.splice i, 1
+ break
+ return
+ outer = 0
+ loop
+ if outer >= 8
+ return
+ outer += 1
+ # 5. Let formatting element be the last element in the list of
+ # active formatting elements that: is between the end of the list
+ # and the last scope marker in the list, if any, or the start of
+ # the list otherwise, and has the tag name subject.
+ fe = null
+ for t, fe_of_afe in afe
+ if t.type is TYPE_MARKER
+ break
+ if t.name is subject
+ fe = t
+ break
+ # If there is no such element, then abort these steps and instead
+ # act as described in the "any other end tag" entry above.
+ if fe is null
+ in_body_any_other_end_tag subject
+ return
+ # 6. If formatting element is not in the stack of open elements,
+ # then this is a parse error; remove the element from the list, and
+ # abort these steps.
+ in_open_els = false
+ for t, fe_of_open_els in open_els
+ if t is fe
+ in_open_els = true
+ break
+ unless in_open_els
+ parse_error()
+ # "remove it from the list" must mean afe, since it's not in open_els
+ afe.splice fe_of_afe, 1
+ return
+ # 7. If formatting element is in the stack of open elements, but
+ # the element is not in scope, then this is a parse error; abort
+ # these steps.
+ unless el_is_in_scope fe
+ parse_error()
+ return
+ # 8. If formatting element is not the current node, this is a parse
+ # error. (But do not abort these steps.)
+ unless open_els[0] is fe
+ parse_error()
+ # continue
+ # 9. Let furthest block be the topmost node in the stack of open
+ # elements that is lower in the stack than formatting element, and
+ # is an element in the special category. There might not be one.
+ fb = null
+ fb_of_open_els = null
+ for t, i in open_els
+ if t is fe
+ break
+ if el_is_special t
+ fb = t
+ fb_of_open_els = i
+ # and continue, to see if there's one that's more "topmost"
+ # 10. If there is no furthest block, then the UA must first pop all
+ # the nodes from the bottom of the stack of open elements, from the
+ # current node up to and including formatting element, then remove
+ # formatting element from the list of active formatting elements,
+ # and finally abort these steps.
+ if fb is null
+ loop
+ t = open_els.shift()
+ if t is fe
+ afe.splice fe_of_afe, 1
+ return
+ # 11. Let common ancestor be the element immediately above
+ # formatting element in the stack of open elements.
+ ca = open_els[fe_of_open_els + 1] # common ancestor
+
+ node_above = open_els[fb_of_open_els + 1] # next node if node isn't in open_els anymore
+ # 12. Let a bookmark note the position of formatting element in the list of active formatting elements relative to the elements on either side of it in the list.
+ bookmark = new_aaa_bookmark()
+ for t, i in afe
+ if t is fe
+ afe.splice i, 0, bookmark
+ break
+ node = last_node = fb
+ inner = 0
+ loop
+ inner += 1
+ # 3. Let node be the element immediately above node in the
+ # stack of open elements, or if node is no longer in the stack
+ # of open elements (e.g. because it got removed by this
+ # algorithm), the element that was immediately above node in
+ # the stack of open elements before node was removed.
+ node_next = null
+ for t, i in open_els
+ if t is node
+ node_next = open_els[i + 1]
+ break
+ node = node_next ? node_above
+ debug_log "inner loop #{inner}"
+ debug_log "open_els: #{serialize_els open_els, true, true}"
+ debug_log "tree: #{serialize_els tree.children, false, true}"
+ debug_log "afe: #{serialize_els afe, true, true}"
+ debug_log "ca: #{ca.name}##{ca.id} children: #{serialize_els ca.children, true, true}"
+ debug_log "fe: #{fe.name}##{fe.id} children: #{serialize_els fe.children, true, true}"
+ debug_log "fb: #{fb.name}##{fb.id} children: #{serialize_els fb.children, true, true}"
+ debug_log "node: #{node.serialize true, true}"
+ # TODO make sure node_above gets re-set if/when node is removed from open_els
+
+ # 4. If node is formatting element, then go to the next step in
+ # the overall algorithm.
+ if node is fe
+ break
+ debug_log "the meat"
+ # 5. If inner loop counter is greater than three and node is in
+ # the list of active formatting elements, then remove node from
+ # the list of active formatting elements.
+ node_in_afe = false
+ for t, i in afe
+ if t is node
+ if inner > 3
+ afe.splice i, 1
+ debug_log "max out inner"
+ else
+ node_in_afe = true
+ debug_log "in afe"
+ break
+ # 6. If node is not in the list of active formatting elements,
+ # then remove node from the stack of open elements and then go
+ # back to the step labeled inner loop.
+ unless node_in_afe
+ debug_log "not in afe"
+ for t, i in open_els
+ if t is node
+ node_above = open_els[i + 1]
+ open_els.splice i, 1
+ break
+ continue
+ debug_log "the bones"
+ # 7. create an element for the token for which the element node
+ # was created, in the HTML namespace, with common ancestor as
+ # the intended parent; replace the entry for node in the list
+ # of active formatting elements with an entry for the new
+ # element, replace the entry for node in the stack of open
+ # elements with an entry for the new element, and let node be
+ # the new element.
+ new_node = node.shallow_clone()
+ for t, i in afe
+ if t is node
+ afe[i] = new_node
+ debug_log "replaced in afe"
+ break
+ for t, i in open_els
+ if t is node
+ node_above = open_els[i + 1]
+ open_els[i] = new_node
+ debug_log "replaced in open_els"
+ break
+ node = new_node
+ # 8. If last node is furthest block, then move the
+ # aforementioned bookmark to be immediately after the new node
+ # in the list of active formatting elements.
+ if last_node is fb
+ for t, i in afe
+ if t is bookmark
+ afe.splice i, 1
+ debug_log "removed bookmark"
+ break
+ for t, i in afe
+ if t is node
+ # "after" means lower
+ afe.splice i, 0, bookmark # "after as <-
+ debug_log "placed bookmark after node"
+ debug_log "node: #{node.id} afe: #{serialize_els afe, true, true}"
+ break
+ # 9. Insert last node into node, first removing it from its
+ # previous parent node if any.
+ if last_node.parent?
+ debug_log "last_node has parent"
+ for c, i in last_node.parent.children
+ if c is last_node
+ debug_log "removing last_node from parent"
+ last_node.parent.children.splice i, 1
+ break
+ node.children.push last_node
+ last_node.parent = node
+ # 10. Let last node be node.
+ last_node = node
+ debug_log "at last"
+ # 11. Return to the step labeled inner loop.
+ # 14. Insert whatever last node ended up being in the previous step
+ # at the appropriate place for inserting a node, but using common
+ # ancestor as the override target.
+
+ # JASON: In the case where fe is immediately followed by fb:
+ # * inner loop exits out early (node==fe)
+ # * last_node is fb
+ # * last_node is still in the tree (not a duplicate)
+ if last_node.parent?
+ debug_log "FEFIRST? last_node has parent"
+ for c, i in last_node.parent.children
+ if c is last_node
+ debug_log "removing last_node from parent"
+ last_node.parent.children.splice i, 1
+ break
+
+ debug_log "after aaa inner loop"
+ debug_log "ca: #{ca.name}##{ca.id} children: #{serialize_els ca.children, true, true}"
+ debug_log "fe: #{fe.name}##{fe.id} children: #{serialize_els fe.children, true, true}"
+ debug_log "fb: #{fb.name}##{fb.id} children: #{serialize_els fb.children, true, true}"
+ debug_log "last_node: #{last_node.name}##{last_node.id} children: #{serialize_els last_node.children, true, true}"
+ debug_log "tree: #{serialize_els tree.children, false, true}"
+
+ debug_log "insert"
+
+
+ # can't use standard insert token thing, because it's already in
+ # open_els and must stay at it's current position in open_els
+ dest = adjusted_insertion_location ca
+ dest[0].children.splice dest[1], 0, last_node
+ last_node.parent = dest[0]
+
+
+ debug_log "ca: #{ca.name}##{ca.id} children: #{serialize_els ca.children, true, true}"
+ debug_log "fe: #{fe.name}##{fe.id} children: #{serialize_els fe.children, true, true}"
+ debug_log "fb: #{fb.name}##{fb.id} children: #{serialize_els fb.children, true, true}"
+ debug_log "last_node: #{last_node.name}##{last_node.id} children: #{serialize_els last_node.children, true, true}"
+ debug_log "tree: #{serialize_els tree.children, false, true}"
+
+ # 15. Create an element for the token for which formatting element
+ # was created, in the HTML namespace, with furthest block as the
+ # intended parent.
+ new_element = fe.shallow_clone() # FIXME intended parent thing
+ # 16. Take all of the child nodes of furthest block and append them
+ # to the element created in the last step.
+ while fb.children.length
+ t = fb.children.shift()
+ t.parent = new_element
+ new_element.children.push t
+ # 17. Append that new element to furthest block.
+ new_element.parent = fb
+ fb.children.push new_element
+ # 18. Remove formatting element from the list of active formatting
+ # elements, and insert the new element into the list of active
+ # formatting elements at the position of the aforementioned
+ # bookmark.
+ for t, i in afe
+ if t is fe
+ afe.splice i, 1
+ break
+ for t, i in afe
+ if t is bookmark
+ afe[i] = new_element
+ break
+ # 19. Remove formatting element from the stack of open elements,
+ # and insert the new element into the stack of open elements
+ # immediately below the position of furthest block in that stack.
+ for t, i in open_els
+ if t is fe
+ open_els.splice i, 1
+ break
+ for t, i in open_els
+ if t is fb
+ open_els.splice i, 0, new_element
+ break
+ # 20. Jump back to the step labeled outer loop.
+ debug_log "done wrapping fb's children. new_element: #{new_element.name}##{new_element.id}"
+ debug_log "tree: #{serialize_els tree.children, false, true}"
+ debug_log "open_els: #{serialize_els open_els, true, true}"
+ debug_log "afe: #{serialize_els afe, true, true}"
+ debug_log "AAA DONE"