summaryrefslogtreecommitdiff
path: root/examples/demos/src/main/scala/scrollmenu/ScrollSpy.scala
blob: f0b9dd45b66dbaa1fffa1d282c32a3995f59b3a1 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
package scrollmenu

import org.scalajs.dom
import org.scalajs.dom.extensions._
import scalajs.js
import scalatags.JsDom.all._

case class Tree[T](value: T, children: Vector[Tree[T]])

case class MenuNode(frag: dom.HTMLElement, id: String, start: Int, end: Int)

/**
 * High performance scrollspy to work keep the left menu bar in sync.
 * Lots of sketchy imperative code in order to maximize performance.
 */
class ScrollSpy(structure: Tree[String],
                main: dom.HTMLElement){
  lazy val domTrees = {
    var i = -1
    def recurse(t: Tree[String], depth: Int): Tree[MenuNode] = {
      val curr =
        li(
          a(
            t.value,
            display := (if (i == -1) "none" else "block"),
            href:="#"+Controller.munge(t.value),
            cls:="menu-item"
          )
        )
      val originalI = i
      i += 1
      val children = t.children.map(recurse(_, depth + 1))
      Tree(
        MenuNode(
          curr(ul(paddingLeft := "15px",children.map(_.value.frag))).render,
          Controller.munge(t.value),
          originalI,
          if (children.length > 0) children.map(_.value.end).max else originalI + 1
        ),
        children
      )
    }

    val domTrees = recurse(structure, 0)
    domTrees
  }
  def offset(el: dom.HTMLElement, parent: dom.HTMLElement): Double = {
    if (el == parent) 0
    else el.offsetTop + offset(el.offsetParent.asInstanceOf[dom.HTMLElement], parent)
  }
  lazy val headers = {
    val menuItems = {
      def rec(current: Tree[String]): Seq[String] = {
        current.value +: current.children.flatMap(rec)
      }
      rec(structure).tail
    }

    js.Array(
      menuItems.map(name => dom.document.getElementById(Controller.munge(name)))
               .map((el) => () => offset(el, main)):_*
    )
  }

  var open = false
  def toggleOpen() = {
    open = !open
    if (open){
      def rec(tree: Tree[MenuNode])(f: MenuNode => Unit): Unit = {
        f(tree.value)
        tree.children.foreach(rec(_)(f))
      }
      rec(domTrees)(setFullHeight)
    }else{
      start(force = true)
    }
  }

  def setFullHeight(mn: MenuNode) = {
    mn.frag
      .children(1)
      .asInstanceOf[dom.HTMLElement]
      .style
      .maxHeight = (mn.end - mn.start + 1) * 44 + "px"
  }
  private[this] var scrolling = false
  private[this] var scrollTop = -1
  def apply(): Unit = {
    if (!scrolling) {
      scrolling = true
      scrollTop = main.scrollTop
      dom.setTimeout({() =>
          scrolling = false
          if (scrollTop == main.scrollTop) start()
          else apply()
        },
        75
      )
    }
  }
  private[this] var previousWin: MenuNode = null
  private[this] def start(force: Boolean = false) = {

    def scroll(el: dom.Element) = {
      val rect = el.getBoundingClientRect()
      if (rect.top <= 0)
        el.scrollIntoView(true)
      else if (rect.top > dom.innerHeight)
        el.scrollIntoView(false)
    }
    val scrollTop = main.scrollTop
    def walkIndex(tree: Tree[MenuNode]): List[Tree[MenuNode]] = {
      val t @ Tree(m, children) = tree
      val win = if(m.start == -1) true
      else {
        val before = headers(m.start)() <= scrollTop
        val after = (m.end >= headers.length) || headers(m.end)() > scrollTop
        before && after
      }
      val childIndexes = children.map(walkIndex)
      val childWin = childIndexes.indexWhere(_ != null)
      if (childWin != -1) t :: childIndexes(childWin)
      else if (win) List(t)
      else null
    }

    val winPath = walkIndex(domTrees)
    val winItem = winPath.last.value
    def walkTree(indices: List[Tree[MenuNode]]): Int = indices match {
      case Nil => 0
      case (Tree(mn, children) :: rest) =>

        mn.frag.classList.remove("hide")
        mn.frag.classList.remove("selected")

        mn.frag.children(0).classList.add("pure-menu-selected")
        for {
          child <- children
          if !indices.headOption.exists(_.value.frag == child.value.frag)
        } walkHide(child)

        val size = walkTree(rest) + children.length
        mn.frag.children(1).asInstanceOf[dom.HTMLElement].style.maxHeight =
          if (!open) size * 44 + "px" else "none"
        size
    }

    def walkHide(tree: Tree[MenuNode]): Unit = {
      val frag = tree.value.frag

      frag.children(0).classList.remove("pure-menu-selected")
      frag.classList.add("hide")

      frag.children(1).asInstanceOf[dom.HTMLElement].style.maxHeight =
        if (!open) "0px" else "none"

      if (tree.value.start < winItem.start) frag.classList.add("selected")
      else frag.classList.remove("selected")
      tree.children.foreach(walkHide)
    }

    if (winItem != previousWin || force){
      scroll(winItem.frag.children(0))
      dom.history.replaceState(null, null, "#" + winItem.id)
      previousWin = winItem
//      println(winPath.map(_.value.id))
      walkTree(winPath)
    }
  }
}