diff options
| author | Kohei Yoshida <kyoshida@novell.com> | 2011-02-14 21:35:20 -0500 |
|---|---|---|
| committer | Kohei Yoshida <kyoshida@novell.com> | 2011-02-14 21:35:20 -0500 |
| commit | 07782a0872b9bc07c7d7dbd54d22917b9d3deba3 (patch) | |
| tree | ce69906f62ef6c671b8f4d4546cf52af586d3893 /sc/inc/segmenttree.hxx | |
| parent | 2545177d36446bc7e84749d1cc5fe77b9308be3e (diff) | |
With positional insert, there is no need to do back insertion.
My benchmark shows that positional insertion is slightly faster
than back insertion. Let's remove back insertion calls to keep
the API cleaner.
Diffstat (limited to 'sc/inc/segmenttree.hxx')
| -rw-r--r-- | sc/inc/segmenttree.hxx | 2 |
1 files changed, 0 insertions, 2 deletions
diff --git a/sc/inc/segmenttree.hxx b/sc/inc/segmenttree.hxx index e20c531b685a..c224f1ffda4e 100644 --- a/sc/inc/segmenttree.hxx +++ b/sc/inc/segmenttree.hxx @@ -112,7 +112,6 @@ public: void insertSegment(SCCOL nCol, SCCOL nSize, bool bSkipStartBoundary); void enableTreeSearch(bool bEnable); - void setInsertFromBack(bool bInsertFromBack); private: ::std::auto_ptr<ScFlatBoolSegmentsImpl> mpImpl; @@ -162,7 +161,6 @@ public: SCROW findLastNotOf(sal_uInt16 nValue) const; void enableTreeSearch(bool bEnable); - void setInsertFromBack(bool bInsertFromBack); private: ::std::auto_ptr<ScFlatUInt16SegmentsImpl> mpImpl; |