[all-commits] [llvm/llvm-project] 630436: [lldb] Treat RangeDataVector as an augmented binar...

[Pavel Labath via All-commits]

  Branch: refs/heads/master
  Home:   https://github.com/llvm/llvm-project
  Commit: 6304368818a1e9883b694b9d8c21ef568176168d
      https://github.com/llvm/llvm-project/commit/6304368818a1e9883b694b9d8c21ef568176168d
  Author: Unnar Freyr Erlendsson <unnar at google.com>
  Date:   2020-03-03 (Tue, 03 Mar 2020)

  Changed paths:
    M lldb/include/lldb/Utility/RangeMap.h

  Log Message:
  -----------
  [lldb] Treat RangeDataVector as an augmented binary search tree

Summary:
Since RangeDataVector is assumed to always be sorted we can treat it as
an flattened BST and augment it with additional information about the
ranges belonging to each "subtree". By storing the maximum endpoint in
every subtree we can query for intervals in O(log n) time.

Reviewers: labath, teemperor

Reviewed By: labath

Subscribers: jarin, JDevlieghere, lldb-commits

Tags: #lldb

Differential Revision: https://reviews.llvm.org/D74759