[geany/geany-plugins] 621a87: scope: reorder scptreestore html tables more logically
Dimitar Zhekov
git-noreply at xxxxx
Sun Apr 19 16:32:31 UTC 2015
Branch: refs/heads/master
Author: Dimitar Zhekov <dimitar.zhekov at gmail.com>
Committer: Dimitar Zhekov <dimitar.zhekov at gmail.com>
Date: Sun, 19 Apr 2015 16:32:31 UTC
Commit: 621a87142e2f44b52e6688ff4235df1a6dad0a8d
https://github.com/geany/geany-plugins/commit/621a87142e2f44b52e6688ff4235df1a6dad0a8d
Log Message:
-----------
scope: reorder scptreestore html tables more logically
Modified Paths:
--------------
scope/src/store/fullspeed.html
scope/src/store/scptreestore.html
Modified: scope/src/store/fullspeed.html
380 lines changed, 190 insertions(+), 190 deletions(-)
===================================================================
@@ -21,246 +21,246 @@
<h3>Full speed test</h3>
<table>
-<tr><th>Unsorted store</th><th>Row count</th><th>GtkTreeStore</th>
-<th>ScpTreeStore</th><th>Times</th></tr>
+<tr><th>Unsorted store</th><th>Row count</th><th>Times</th><th>GtkTreeStore</th>
+<th>ScpTreeStore</th></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>top-level insert </td><td>25</td><td>0.000</td><td>0.000</td><td></td></tr>
-<tr><td>top-level set </td><td>25</td><td>0.000</td><td>0.000</td><td></td></tr>
-<tr><td>top-level remove </td><td>25</td><td>0.000</td><td>0.000</td><td></td></tr>
-<tr><td>top-level insert with values </td><td>25</td><td>0.000</td><td>0.000</td><td></td></tr>
-<tr><td>top-level linear search double</td><td>25</td><td>0.000</td><td>0.000</td><td>25</td></tr>
-<tr><td>top-level linear search string</td><td>25</td><td>0.003</td><td>0.001</td><td>25</td></tr>
-<tr><td>top-level model foreach </td><td>25</td><td>0.000</td><td>0.000</td><td>25</td></tr>
-<tr><td>top-level store traverse </td><td>25</td><td>n/a </td><td>0.000</td><td>25</td></tr>
-
-<tr><td>sublevel 1 insert </td><td>25</td><td>0.000</td><td>0.000</td><td></td></tr>
-<tr><td>sublevel 1 set </td><td>25</td><td>0.000</td><td>0.000</td><td></td></tr>
-<tr><td>sublevel 1 remove </td><td>25</td><td>0.000</td><td>0.000</td><td></td></tr>
-<tr><td>sublevel 1 insert_with values </td><td>25</td><td>0.000</td><td>0.000</td><td></td></tr>
-<tr><td>both levels model foreach </td><td>25</td><td>0.000</td><td>0.000</td><td>25</td></tr>
-<tr><td>both levels store traverse </td><td>25</td><td>n/a </td><td>0.000</td><td>25</td></tr>
-<tr><td>both levels quick sort double </td><td>25</td><td>0.000</td><td>0.000</td><td></td></tr>
-<tr><td>both levels quick sort string </td><td>25</td><td>0.001</td><td>0.001</td><td></td></tr>
+<tr><td>top-level insert </td><td>25</td><td> </td><td>0.000</td><td>0.000</td></tr>
+<tr><td>top-level set </td><td>25</td><td> </td><td>0.000</td><td>0.000</td></tr>
+<tr><td>top-level remove </td><td>25</td><td> </td><td>0.000</td><td>0.000</td></tr>
+<tr><td>top-level insert with values </td><td>25</td><td> </td><td>0.000</td><td>0.000</td></tr>
+<tr><td>top-level linear search double</td><td>25</td><td>25</td><td>0.000</td><td>0.000</td></tr>
+<tr><td>top-level linear search string</td><td>25</td><td>25</td><td>0.003</td><td>0.001</td></tr>
+<tr><td>top-level model foreach </td><td>25</td><td>25</td><td>0.000</td><td>0.000</td></tr>
+<tr><td>top-level store traverse </td><td>25</td><td>25</td><td>n/a </td><td>0.000</td></tr>
+
+<tr><td>sublevel 1 insert </td><td>25</td><td> </td><td>0.000</td><td>0.000</td></tr>
+<tr><td>sublevel 1 set </td><td>25</td><td> </td><td>0.000</td><td>0.000</td></tr>
+<tr><td>sublevel 1 remove </td><td>25</td><td> </td><td>0.000</td><td>0.000</td></tr>
+<tr><td>sublevel 1 insert_with values </td><td>25</td><td> </td><td>0.000</td><td>0.000</td></tr>
+<tr><td>both levels model foreach </td><td>25</td><td>25</td><td>0.000</td><td>0.000</td></tr>
+<tr><td>both levels store traverse </td><td>25</td><td>25</td><td>n/a </td><td>0.000</td></tr>
+<tr><td>both levels quick sort double </td><td>25</td><td> </td><td>0.000</td><td>0.000</td></tr>
+<tr><td>both levels quick sort string </td><td>25</td><td> </td><td>0.001</td><td>0.001</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>top-level insert </td><td>100</td><td>0.000</td><td>0.000</td><td></td></tr>
-<tr><td>top-level set </td><td>100</td><td>0.001</td><td>0.000</td><td></td></tr>
-<tr><td>top-level remove </td><td>100</td><td>0.000</td><td>0.000</td><td></td></tr>
-<tr><td>top-level insert with values </td><td>100</td><td>0.001</td><td>0.000</td><td></td></tr>
-<tr><td>top-level linear search double</td><td>100</td><td>0.005</td><td>0.000</td><td>100</td></tr>
-<tr><td>top-level linear search string</td><td>100</td><td>0.029</td><td>0.016</td><td>100</td></tr>
-<tr><td>top-level model foreach </td><td>100</td><td>0.003</td><td>0.000</td><td>100</td></tr>
-<tr><td>top-level store traverse </td><td>100</td><td>n/a </td><td>0.000</td><td>100</td></tr>
-
-<tr><td>sublevel 1 insert </td><td>100</td><td>0.000</td><td>0.000</td><td></td></tr>
-<tr><td>sublevel 1 set </td><td>100</td><td>0.001</td><td>0.000</td><td></td></tr>
-<tr><td>sublevel 1 remove </td><td>100</td><td>0.000</td><td>0.000</td><td></td></tr>
-<tr><td>sublevel 1 insert with values </td><td>100</td><td>0.001</td><td>0.000</td><td></td></tr>
-<tr><td>both levels model foreach </td><td>100</td><td>0.006</td><td>0.000</td><td>100</td></tr>
-<tr><td>both levels store traverse </td><td>100</td><td>n/a </td><td>0.000</td><td>100</td></tr>
-<tr><td>both levels quick sort double </td><td>100</td><td>0.001</td><td>0.000</td><td></td></tr>
-<tr><td>both levels quick sort string </td><td>100</td><td>0.006</td><td>0.004</td><td></td></tr>
+<tr><td>top-level insert </td><td>100</td><td> </td><td>0.000</td><td>0.000</td></tr>
+<tr><td>top-level set </td><td>100</td><td> </td><td>0.001</td><td>0.000</td></tr>
+<tr><td>top-level remove </td><td>100</td><td> </td><td>0.000</td><td>0.000</td></tr>
+<tr><td>top-level insert with values </td><td>100</td><td> </td><td>0.001</td><td>0.000</td></tr>
+<tr><td>top-level linear search double</td><td>100</td><td>100</td><td>0.005</td><td>0.000</td></tr>
+<tr><td>top-level linear search string</td><td>100</td><td>100</td><td>0.029</td><td>0.016</td></tr>
+<tr><td>top-level model foreach </td><td>100</td><td>100</td><td>0.003</td><td>0.000</td></tr>
+<tr><td>top-level store traverse </td><td>100</td><td>100</td><td>n/a </td><td>0.000</td></tr>
+
+<tr><td>sublevel 1 insert </td><td>100</td><td> </td><td>0.000</td><td>0.000</td></tr>
+<tr><td>sublevel 1 set </td><td>100</td><td> </td><td>0.001</td><td>0.000</td></tr>
+<tr><td>sublevel 1 remove </td><td>100</td><td> </td><td>0.000</td><td>0.000</td></tr>
+<tr><td>sublevel 1 insert with values </td><td>100</td><td> </td><td>0.001</td><td>0.000</td></tr>
+<tr><td>both levels model foreach </td><td>100</td><td>100</td><td>0.006</td><td>0.000</td></tr>
+<tr><td>both levels store traverse </td><td>100</td><td>100</td><td>n/a </td><td>0.000</td></tr>
+<tr><td>both levels quick sort double </td><td>100</td><td> </td><td>0.001</td><td>0.000</td></tr>
+<tr><td>both levels quick sort string </td><td>100</td><td> </td><td>0.006</td><td>0.004</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>top-level insert </td><td>250</td><td>0.001</td><td>0.001</td><td></td></tr>
-<tr><td>top-level set </td><td>250</td><td>0.001</td><td>0.001</td><td></td></tr>
-<tr><td>top-level remove </td><td>250</td><td>0.001</td><td>0.001</td><td></td></tr>
-<tr><td>top-level insert with values </td><td>250</td><td>0.001</td><td>0.001</td><td></td></tr>
-<tr><td>top-level linear search double</td><td>250</td><td>0.035</td><td>0.001</td><td>250</td></tr>
-<tr><td>top-level linear search string</td><td>250</td><td>0.220</td><td>0.102</td><td>250</td></tr>
-<tr><td>top-level model foreach </td><td>250</td><td>0.019</td><td>0.001</td><td>250</td></tr>
-<tr><td>top-level store traverse </td><td>250</td><td>n/a </td><td>0.001</td><td>250</td></tr>
-
-<tr><td>sublevel 1 insert </td><td>250</td><td>0.001</td><td>0.001</td><td></td></tr>
-<tr><td>sublevel 1 set </td><td>250</td><td>0.002</td><td>0.001</td><td></td></tr>
-<tr><td>sublevel 1 remove </td><td>250</td><td>0.001</td><td>0.001</td><td></td></tr>
-<tr><td>sublevel 1 insert with values </td><td>250</td><td>0.002</td><td>0.001</td><td></td></tr>
-<tr><td>both levels model foreach </td><td>250</td><td>0.037</td><td>0.003</td><td>250</td></tr>
-<tr><td>both levels store traverse </td><td>250</td><td>n/a </td><td>0.002</td><td>250</td></tr>
-<tr><td>both levels quick sort double </td><td>250</td><td>0.003</td><td>0.001</td><td></td></tr>
-<tr><td>both levels quick sort string </td><td>250</td><td>0.018</td><td>0.014</td><td></td></tr>
+<tr><td>top-level insert </td><td>250</td><td> </td><td>0.001</td><td>0.001</td></tr>
+<tr><td>top-level set </td><td>250</td><td> </td><td>0.001</td><td>0.001</td></tr>
+<tr><td>top-level remove </td><td>250</td><td> </td><td>0.001</td><td>0.001</td></tr>
+<tr><td>top-level insert with values </td><td>250</td><td> </td><td>0.001</td><td>0.001</td></tr>
+<tr><td>top-level linear search double</td><td>250</td><td>250</td><td>0.035</td><td>0.001</td></tr>
+<tr><td>top-level linear search string</td><td>250</td><td>250</td><td>0.220</td><td>0.102</td></tr>
+<tr><td>top-level model foreach </td><td>250</td><td>250</td><td>0.019</td><td>0.001</td></tr>
+<tr><td>top-level store traverse </td><td>250</td><td>250</td><td>n/a </td><td>0.001</td></tr>
+
+<tr><td>sublevel 1 insert </td><td>250</td><td> </td><td>0.001</td><td>0.001</td></tr>
+<tr><td>sublevel 1 set </td><td>250</td><td> </td><td>0.002</td><td>0.001</td></tr>
+<tr><td>sublevel 1 remove </td><td>250</td><td> </td><td>0.001</td><td>0.001</td></tr>
+<tr><td>sublevel 1 insert with values </td><td>250</td><td> </td><td>0.002</td><td>0.001</td></tr>
+<tr><td>both levels model foreach </td><td>250</td><td>250</td><td>0.037</td><td>0.003</td></tr>
+<tr><td>both levels store traverse </td><td>250</td><td>250</td><td>n/a </td><td>0.002</td></tr>
+<tr><td>both levels quick sort double </td><td>250</td><td> </td><td>0.003</td><td>0.001</td></tr>
+<tr><td>both levels quick sort string </td><td>250</td><td> </td><td>0.018</td><td>0.014</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>top-level insert </td><td>500</td><td>0.002</td><td>0.001</td><td></td></tr>
-<tr><td>top-level set </td><td>500</td><td>0.003</td><td>0.002</td><td></td></tr>
-<tr><td>top-level remove </td><td>500</td><td>0.002</td><td>0.001</td><td></td></tr>
-<tr><td>top-level insert with values </td><td>500</td><td>0.003</td><td>0.002</td><td></td></tr>
-<tr><td>top-level linear search double</td><td>500</td><td>0.124</td><td>0.005</td><td>500</td></tr>
-<tr><td>top-level linear search string</td><td>500</td><td>0.863</td><td>0.432</td><td>500</td></tr>
-<tr><td>top-level model foreach </td><td>500</td><td>0.077</td><td>0.005</td><td>500</td></tr>
-<tr><td>top-level store traverse </td><td>500</td><td>n/a </td><td>0.003</td><td>500</td></tr>
-
-<tr><td>sublevel 1 insert </td><td>500</td><td>0.002</td><td>0.002</td><td></td></tr>
-<tr><td>sublevel 1 set </td><td>500</td><td>0.003</td><td>0.002</td><td></td></tr>
-<tr><td>sublevel 1 remove </td><td>500</td><td>0.002</td><td>0.001</td><td></td></tr>
-<tr><td>sublevel 1 insert with values </td><td>500</td><td>0.003</td><td>0.002</td><td></td></tr>
-<tr><td>both levels model foreach </td><td>500</td><td>0.135</td><td>0.010</td><td>500</td></tr>
-<tr><td>both levels store traverse </td><td>500</td><td>n/a </td><td>0.007</td><td>500</td></tr>
-<tr><td>both levels quick sort double </td><td>500</td><td>0.006</td><td>0.001</td><td></td></tr>
-<tr><td>both levels quick sort string </td><td>500</td><td>0.043</td><td>0.033</td><td></td></tr>
+<tr><td>top-level insert </td><td>500</td><td> </td><td>0.002</td><td>0.001</td></tr>
+<tr><td>top-level set </td><td>500</td><td> </td><td>0.003</td><td>0.002</td></tr>
+<tr><td>top-level remove </td><td>500</td><td> </td><td>0.002</td><td>0.001</td></tr>
+<tr><td>top-level insert with values </td><td>500</td><td> </td><td>0.003</td><td>0.002</td></tr>
+<tr><td>top-level linear search double</td><td>500</td><td>500</td><td>0.124</td><td>0.005</td></tr>
+<tr><td>top-level linear search string</td><td>500</td><td>500</td><td>0.863</td><td>0.432</td></tr>
+<tr><td>top-level model foreach </td><td>500</td><td>500</td><td>0.077</td><td>0.005</td></tr>
+<tr><td>top-level store traverse </td><td>500</td><td>500</td><td>n/a </td><td>0.003</td></tr>
+
+<tr><td>sublevel 1 insert </td><td>500</td><td> </td><td>0.002</td><td>0.002</td></tr>
+<tr><td>sublevel 1 set </td><td>500</td><td> </td><td>0.003</td><td>0.002</td></tr>
+<tr><td>sublevel 1 remove </td><td>500</td><td> </td><td>0.002</td><td>0.001</td></tr>
+<tr><td>sublevel 1 insert with values </td><td>500</td><td> </td><td>0.003</td><td>0.002</td></tr>
+<tr><td>both levels model foreach </td><td>500</td><td>500</td><td>0.135</td><td>0.010</td></tr>
+<tr><td>both levels store traverse </td><td>500</td><td>500</td><td>n/a </td><td>0.007</td></tr>
+<tr><td>both levels quick sort double </td><td>500</td><td> </td><td>0.006</td><td>0.001</td></tr>
+<tr><td>both levels quick sort string </td><td>500</td><td> </td><td>0.043</td><td>0.033</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>top-level insert </td><td>1000</td><td>0.004</td><td>0.003</td><td></td></tr>
-<tr><td>top-level set </td><td>1000</td><td>0.006</td><td>0.003</td><td></td></tr>
-<tr><td>top-level remove </td><td>1000</td><td>0.004</td><td>0.002</td><td></td></tr>
-<tr><td>top-level insert with values </td><td>1000</td><td>0.007</td><td>0.004</td><td></td></tr>
-<tr><td>top-level linear search double</td><td>1000</td><td>0.181</td><td>0.007</td><td>350</td></tr>
-<tr><td>top-level linear search string</td><td>1000</td><td>1.220</td><td>0.582</td><td>350</td></tr>
-<tr><td>top-level model foreach </td><td>1000</td><td>0.104</td><td>0.007</td><td>350</td></tr>
-<tr><td>top-level store traverse </td><td>1000</td><td>n/a </td><td>0.005</td><td>350</td></tr>
-
-<tr><td>sublevel 1 insert </td><td>1000</td><td>0.005</td><td>0.004</td><td></td></tr>
-<tr><td>sublevel 1 set </td><td>1000</td><td>0.008</td><td>0.004</td><td></td></tr>
-<tr><td>sublevel 1 remove </td><td>1000</td><td>0.006</td><td>0.003</td><td></td></tr>
-<tr><td>sublevel 1 insert with values </td><td>1000</td><td>0.008</td><td>0.005</td><td></td></tr>
-<tr><td>both levels model foreach </td><td>1000</td><td>0.208</td><td>0.015</td><td>350</td></tr>
-<tr><td>both levels store traverse </td><td>1000</td><td>n/a </td><td>0.011</td><td>350</td></tr>
-<tr><td>both levels quick sort double </td><td>1000</td><td>0.015</td><td>0.003</td><td></td></tr>
-<tr><td>both levels quick sort string </td><td>1000</td><td>0.096</td><td>0.074</td><td></td></tr>
+<tr><td>top-level insert </td><td>1000</td><td> </td><td>0.004</td><td>0.003</td></tr>
+<tr><td>top-level set </td><td>1000</td><td> </td><td>0.006</td><td>0.003</td></tr>
+<tr><td>top-level remove </td><td>1000</td><td> </td><td>0.004</td><td>0.002</td></tr>
+<tr><td>top-level insert with values </td><td>1000</td><td> </td><td>0.007</td><td>0.004</td></tr>
+<tr><td>top-level linear search double</td><td>1000</td><td>350</td><td>0.181</td><td>0.007</td></tr>
+<tr><td>top-level linear search string</td><td>1000</td><td>350</td><td>1.220</td><td>0.582</td></tr>
+<tr><td>top-level model foreach </td><td>1000</td><td>350</td><td>0.104</td><td>0.007</td></tr>
+<tr><td>top-level store traverse </td><td>1000</td><td>350</td><td>n/a </td><td>0.005</td></tr>
+
+<tr><td>sublevel 1 insert </td><td>1000</td><td> </td><td>0.005</td><td>0.004</td></tr>
+<tr><td>sublevel 1 set </td><td>1000</td><td> </td><td>0.008</td><td>0.004</td></tr>
+<tr><td>sublevel 1 remove </td><td>1000</td><td> </td><td>0.006</td><td>0.003</td></tr>
+<tr><td>sublevel 1 insert with values </td><td>1000</td><td> </td><td>0.008</td><td>0.005</td></tr>
+<tr><td>both levels model foreach </td><td>1000</td><td>350</td><td>0.208</td><td>0.015</td></tr>
+<tr><td>both levels store traverse </td><td>1000</td><td>350</td><td>n/a </td><td>0.011</td></tr>
+<tr><td>both levels quick sort double </td><td>1000</td><td> </td><td>0.015</td><td>0.003</td></tr>
+<tr><td>both levels quick sort string </td><td>1000</td><td> </td><td>0.096</td><td>0.074</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>top-level insert </td><td>2500</td><td>0.015</td><td>0.007</td><td></td></tr>
-<tr><td>top-level set </td><td>2500</td><td>0.025</td><td>0.008</td><td></td></tr>
-<tr><td>top-level remove </td><td>2500</td><td>0.017</td><td>0.007</td><td></td></tr>
-<tr><td>top-level insert with values </td><td>2500</td><td>0.025</td><td>0.011</td><td></td></tr>
-<tr><td>top-level linear search double</td><td>2500</td><td>1.031</td><td>0.041</td><td>770</td></tr>
-<tr><td>top-level linear search string</td><td>2500</td><td>6.807</td><td>3.186</td><td>770</td></tr>
-<tr><td>top-level model foreach </td><td>2500</td><td>0.574</td><td>0.042</td><td>770</td></tr>
-<tr><td>top-level store traverse </td><td>2500</td><td>n/a </td><td>0.029</td><td>770</td></tr>
-
-<tr><td>sublevel 1 insert </td><td>2500</td><td>0.033</td><td>0.013</td><td></td></tr>
-<tr><td>sublevel 1 set </td><td>2500</td><td>0.048</td><td>0.013</td><td></td></tr>
-<tr><td>sublevel 1 remove </td><td>2500</td><td>0.038</td><td>0.012</td><td></td></tr>
-<tr><td>sublevel 1 insert with values </td><td>2500</td><td>0.045</td><td>0.017</td><td></td></tr>
-<tr><td>both levels model foreach </td><td>2500</td><td>1.153</td><td>0.084</td><td>770</td></tr>
-<tr><td>both levels store traverse </td><td>2500</td><td>n/a </td><td>0.060</td><td>770</td></tr>
-<tr><td>both levels quick sort double </td><td>2500</td><td>0.043</td><td>0.009</td><td></td></tr>
-<tr><td>both levels quick sort string </td><td>2500</td><td>0.282</td><td>0.220</td><td></td></tr>
+<tr><td>top-level insert </td><td>2500</td><td> </td><td>0.015</td><td>0.007</td></tr>
+<tr><td>top-level set </td><td>2500</td><td> </td><td>0.025</td><td>0.008</td></tr>
+<tr><td>top-level remove </td><td>2500</td><td> </td><td>0.017</td><td>0.007</td></tr>
+<tr><td>top-level insert with values </td><td>2500</td><td> </td><td>0.025</td><td>0.011</td></tr>
+<tr><td>top-level linear search double</td><td>2500</td><td>770</td><td>1.031</td><td>0.041</td></tr>
+<tr><td>top-level linear search string</td><td>2500</td><td>770</td><td>6.807</td><td>3.186</td></tr>
+<tr><td>top-level model foreach </td><td>2500</td><td>770</td><td>0.574</td><td>0.042</td></tr>
+<tr><td>top-level store traverse </td><td>2500</td><td>770</td><td>n/a </td><td>0.029</td></tr>
+
+<tr><td>sublevel 1 insert </td><td>2500</td><td> </td><td>0.033</td><td>0.013</td></tr>
+<tr><td>sublevel 1 set </td><td>2500</td><td> </td><td>0.048</td><td>0.013</td></tr>
+<tr><td>sublevel 1 remove </td><td>2500</td><td> </td><td>0.038</td><td>0.012</td></tr>
+<tr><td>sublevel 1 insert with values </td><td>2500</td><td> </td><td>0.045</td><td>0.017</td></tr>
+<tr><td>both levels model foreach </td><td>2500</td><td>770</td><td>1.153</td><td>0.084</td></tr>
+<tr><td>both levels store traverse </td><td>2500</td><td>770</td><td>n/a </td><td>0.060</td></tr>
+<tr><td>both levels quick sort double </td><td>2500</td><td> </td><td>0.043</td><td>0.009</td></tr>
+<tr><td>both levels quick sort string </td><td>2500</td><td> </td><td>0.282</td><td>0.220</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>top-level insert </td><td>5000</td><td>0.082 </td><td>0.017 </td><td></td></tr>
-<tr><td>top-level set </td><td>5000</td><td>0.106 </td><td>0.016 </td><td></td></tr>
-<tr><td>top-level remove </td><td>5000</td><td>0.088 </td><td>0.015 </td><td></td></tr>
-<tr><td>top-level insert with values </td><td>5000</td><td>0.102 </td><td>0.023 </td><td></td></tr>
-<tr><td>top-level linear search double</td><td>5000</td><td>3.825 </td><td>0.164 </td><td>1390</td></tr>
-<tr><td>top-level linear search string</td><td>5000</td><td>24.678</td><td>11.848</td><td>1390</td></tr>
-<tr><td>top-level model foreach </td><td>5000</td><td>2.089 </td><td>0.161 </td><td>1390</td></tr>
-<tr><td>top-level store traverse </td><td>5000</td><td>n/a </td><td>0.117 </td><td>1390</td></tr>
-
-<tr><td>sublevel 1 insert </td><td>5000</td><td>0.165</td><td>0.038</td><td></td></tr>
-<tr><td>sublevel 1 set </td><td>5000</td><td>0.200</td><td>0.036</td><td></td></tr>
-<tr><td>sublevel 1 remove </td><td>5000</td><td>0.182</td><td>0.035</td><td></td></tr>
-<tr><td>sublevel 1 insert with values </td><td>5000</td><td>0.196</td><td>0.044</td><td></td></tr>
-<tr><td>both levels model foreach </td><td>5000</td><td>4.174</td><td>0.369</td><td>1390</td></tr>
-<tr><td>both levels store traverse </td><td>5000</td><td>n/a </td><td>0.279</td><td>1390</td></tr>
-<tr><td>both levels quick sort double </td><td>5000</td><td>0.096</td><td>0.020</td><td></td></tr>
-<tr><td>both levels quick sort string </td><td>5000</td><td>0.630</td><td>0.490</td><td></td></tr>
+<tr><td>top-level insert </td><td>5000</td><td> </td><td>0.082 </td><td>0.017 </td></tr>
+<tr><td>top-level set </td><td>5000</td><td> </td><td>0.106 </td><td>0.016 </td></tr>
+<tr><td>top-level remove </td><td>5000</td><td> </td><td>0.088 </td><td>0.015 </td></tr>
+<tr><td>top-level insert with values </td><td>5000</td><td> </td><td>0.102 </td><td>0.023 </td></tr>
+<tr><td>top-level linear search double</td><td>5000</td><td>1390</td><td>3.825 </td><td>0.164 </td></tr>
+<tr><td>top-level linear search string</td><td>5000</td><td>1390</td><td>24.678</td><td>11.848</td></tr>
+<tr><td>top-level model foreach </td><td>5000</td><td>1390</td><td>2.089 </td><td>0.161 </td></tr>
+<tr><td>top-level store traverse </td><td>5000</td><td>1390</td><td>n/a </td><td>0.117 </td></tr>
+
+<tr><td>sublevel 1 insert </td><td>5000</td><td> </td><td>0.165</td><td>0.038</td></tr>
+<tr><td>sublevel 1 set </td><td>5000</td><td> </td><td>0.200</td><td>0.036</td></tr>
+<tr><td>sublevel 1 remove </td><td>5000</td><td> </td><td>0.182</td><td>0.035</td></tr>
+<tr><td>sublevel 1 insert with values </td><td>5000</td><td> </td><td>0.196</td><td>0.044</td></tr>
+<tr><td>both levels model foreach </td><td>5000</td><td>1390</td><td>4.174</td><td>0.369</td></tr>
+<tr><td>both levels store traverse </td><td>5000</td><td>1390</td><td>n/a </td><td>0.279</td></tr>
+<tr><td>both levels quick sort double </td><td>5000</td><td> </td><td>0.096</td><td>0.020</td></tr>
+<tr><td>both levels quick sort string </td><td>5000</td><td> </td><td>0.630</td><td>0.490</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>top-level insert </td><td>10000</td><td>0.408 </td><td>0.042 </td><td></td></tr>
-<tr><td>top-level set </td><td>10000</td><td>0.461 </td><td>0.032 </td><td></td></tr>
-<tr><td>top-level remove </td><td>10000</td><td>0.428 </td><td>0.039 </td><td></td></tr>
-<tr><td>top-level insert with values </td><td>10000</td><td>0.455 </td><td>0.056 </td><td></td></tr>
-<tr><td>top-level linear search double</td><td>10000</td><td>16.096</td><td>0.623 </td><td>2510</td></tr>
-<tr><td>top-level linear search string</td><td>10000</td><td>95.668</td><td>43.351</td><td>2510</td></tr>
-<tr><td>top-level model foreach </td><td>10000</td><td>7.549 </td><td>0.668 </td><td>2510</td></tr>
-<tr><td>top-level store traverse </td><td>10000</td><td>n/a </td><td>0.509 </td><td>2510</td></tr>
-
-<tr><td>sublevel 1 insert </td><td>10000</td><td>0.824 </td><td>0.124</td><td></td></tr>
-<tr><td>sublevel 1 set </td><td>10000</td><td>1.159 </td><td>0.110</td><td></td></tr>
-<tr><td>sublevel 1 remove </td><td>10000</td><td>0.971 </td><td>0.120</td><td></td></tr>
-<tr><td>sublevel 1 insert with values </td><td>10000</td><td>1.039 </td><td>0.140</td><td></td></tr>
-<tr><td>both levels model foreach </td><td>10000</td><td>16.602</td><td>3.218</td><td>2510</td></tr>
-<tr><td>both levels store traverse </td><td>10000</td><td>n/a </td><td>2.224</td><td>2510</td></tr>
-<tr><td>both levels quick sort double </td><td>10000</td><td>0.218 </td><td>0.046</td><td></td></tr>
-<tr><td>both levels quick sort string </td><td>10000</td><td>1.383 </td><td>1.083</td><td></td></tr>
+<tr><td>top-level insert </td><td>10000</td><td> </td><td>0.408 </td><td>0.042 </td></tr>
+<tr><td>top-level set </td><td>10000</td><td> </td><td>0.461 </td><td>0.032 </td></tr>
+<tr><td>top-level remove </td><td>10000</td><td> </td><td>0.428 </td><td>0.039 </td></tr>
+<tr><td>top-level insert with values </td><td>10000</td><td> </td><td>0.455 </td><td>0.056 </td></tr>
+<tr><td>top-level linear search double</td><td>10000</td><td>2510</td><td>16.096</td><td>0.623 </td></tr>
+<tr><td>top-level linear search string</td><td>10000</td><td>2510</td><td>95.668</td><td>43.351</td></tr>
+<tr><td>top-level model foreach </td><td>10000</td><td>2510</td><td>7.549 </td><td>0.668 </td></tr>
+<tr><td>top-level store traverse </td><td>10000</td><td>2510</td><td>n/a </td><td>0.509 </td></tr>
+
+<tr><td>sublevel 1 insert </td><td>10000</td><td> </td><td>0.824 </td><td>0.124</td></tr>
+<tr><td>sublevel 1 set </td><td>10000</td><td> </td><td>1.159 </td><td>0.110</td></tr>
+<tr><td>sublevel 1 remove </td><td>10000</td><td> </td><td>0.971 </td><td>0.120</td></tr>
+<tr><td>sublevel 1 insert with values </td><td>10000</td><td> </td><td>1.039 </td><td>0.140</td></tr>
+<tr><td>both levels model foreach </td><td>10000</td><td>2510</td><td>16.602</td><td>3.218</td></tr>
+<tr><td>both levels store traverse </td><td>10000</td><td>2510</td><td>n/a </td><td>2.224</td></tr>
+<tr><td>both levels quick sort double </td><td>10000</td><td> </td><td>0.218 </td><td>0.046</td></tr>
+<tr><td>both levels quick sort string </td><td>10000</td><td> </td><td>1.383 </td><td>1.083</td></tr>
<tr><td colspan="5" class="empty"> </td></tr>
-<tr><th>Store sorted by double</th><th>Row count</th><th>GtkTreeStore</th>
-<th>ScpTreeStore</th><th>Times</th></tr>
+<tr><th>Store sorted by double</th><th>Row count</th><th>Times</th><th>GtkTreeStore</th>
+<th>ScpTreeStore</th></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>pre/apppend + set </td><td>25</td><td>0.000</td><td>0.000</td><td></td></tr>
-<tr><td>pre/append with values</td><td>25</td><td>0.000</td><td>0.000</td><td></td></tr>
-<tr><td>binary search </td><td>25</td><td>n/a </td><td>0.000</td><td>25</td></tr>
+<tr><td>pre/apppend + set </td><td>25</td><td> </td><td>0.000</td><td>0.000</td></tr>
+<tr><td>pre/append with values</td><td>25</td><td> </td><td>0.000</td><td>0.000</td></tr>
+<tr><td>binary search </td><td>25</td><td>25</td><td>n/a </td><td>0.000</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>pre/apppend + set </td><td>100</td><td>0.003</td><td>0.001</td><td></td></tr>
-<tr><td>pre/append with values</td><td>100</td><td>0.002</td><td>0.001</td><td></td></tr>
-<tr><td>binary search </td><td>100</td><td>n/a </td><td>0.000</td><td>100</td></tr>
+<tr><td>pre/apppend + set </td><td>100</td><td> </td><td>0.003</td><td>0.001</td></tr>
+<tr><td>pre/append with values</td><td>100</td><td> </td><td>0.002</td><td>0.001</td></tr>
+<tr><td>binary search </td><td>100</td><td>100</td><td>n/a </td><td>0.000</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>pre/apppend + set </td><td>250</td><td>0.015</td><td>0.003</td><td></td></tr>
-<tr><td>pre/append with values</td><td>250</td><td>0.014</td><td>0.001</td><td></td></tr>
-<tr><td>binary search </td><td>250</td><td>n/a </td><td>0.000</td><td>250</td></tr>
+<tr><td>pre/apppend + set </td><td>250</td><td> </td><td>0.015</td><td>0.003</td></tr>
+<tr><td>pre/append with values</td><td>250</td><td> </td><td>0.014</td><td>0.001</td></tr>
+<tr><td>binary search </td><td>250</td><td>250</td><td>n/a </td><td>0.000</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>pre/apppend + set </td><td>500</td><td>0.056</td><td>0.006</td><td></td></tr>
-<tr><td>pre/append with values</td><td>500</td><td>0.050</td><td>0.003</td><td></td></tr>
-<tr><td>binary search </td><td>500</td><td>n/a </td><td>0.000</td><td>500</td></tr>
+<tr><td>pre/apppend + set </td><td>500</td><td> </td><td>0.056</td><td>0.006</td></tr>
+<tr><td>pre/append with values</td><td>500</td><td> </td><td>0.050</td><td>0.003</td></tr>
+<tr><td>binary search </td><td>500</td><td>500</td><td>n/a </td><td>0.000</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>pre/apppend + set </td><td>1000</td><td>0.214</td><td>0.013</td><td></td></tr>
-<tr><td>pre/append with values</td><td>1000</td><td>0.206</td><td>0.006</td><td></td></tr>
-<tr><td>binary search </td><td>1000</td><td>n/a </td><td>0.000</td><td>1000</td></tr>
+<tr><td>pre/apppend + set </td><td>1000</td><td> </td><td>0.214</td><td>0.013</td></tr>
+<tr><td>pre/append with values</td><td>1000</td><td> </td><td>0.206</td><td>0.006</td></tr>
+<tr><td>binary search </td><td>1000</td><td>1000</td><td>n/a </td><td>0.000</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>pre/apppend + set </td><td>2500</td><td>1.321</td><td>0.041</td><td></td></tr>
-<tr><td>pre/append with values</td><td>2500</td><td>1.285</td><td>0.016</td><td></td></tr>
-<tr><td>binary search </td><td>2500</td><td>n/a </td><td>0.001</td><td>2500</td></tr>
+<tr><td>pre/apppend + set </td><td>2500</td><td> </td><td>1.321</td><td>0.041</td></tr>
+<tr><td>pre/append with values</td><td>2500</td><td> </td><td>1.285</td><td>0.016</td></tr>
+<tr><td>binary search </td><td>2500</td><td>2500</td><td>n/a </td><td>0.001</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>pre/apppend + set </td><td>5000</td><td>5.869</td><td>0.104</td><td></td></tr>
-<tr><td>pre/append with values</td><td>5000</td><td>5.791</td><td>0.037</td><td></td></tr>
-<tr><td>binary search </td><td>5000</td><td>n/a </td><td>0.003</td><td>5000</td></tr>
+<tr><td>pre/apppend + set </td><td>5000</td><td> </td><td>5.869</td><td>0.104</td></tr>
+<tr><td>pre/append with values</td><td>5000</td><td> </td><td>5.791</td><td>0.037</td></tr>
+<tr><td>binary search </td><td>5000</td><td>5000</td><td>n/a </td><td>0.003</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>pre/apppend + set </td><td>10000</td><td>27.921</td><td>0.317</td><td></td></tr>
-<tr><td>pre/append with values</td><td>10000</td><td>27.199</td><td>0.093</td><td></td></tr>
-<tr><td>binary search </td><td>10000</td><td>n/a </td><td>0.006</td><td>10000</td></tr>
+<tr><td>pre/apppend + set </td><td>10000</td><td> </td><td>27.921</td><td>0.317</td></tr>
+<tr><td>pre/append with values</td><td>10000</td><td> </td><td>27.199</td><td>0.093</td></tr>
+<tr><td>binary search </td><td>10000</td><td>10000</td><td>n/a </td><td>0.006</td></tr>
<tr><td colspan="5" class="empty"> </td></tr>
-<tr><th>Store sorted by string</th><th>Row count</th><th>GtkTreeStore</th>
-<th>ScpTreeStore</th><th>Times</th></tr>
+<tr><th>Store sorted by string</th><th>Row count</th><th>Times</th><th>GtkTreeStore</th>
+<th>ScpTreeStore</th></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>pre/apppend + set </td><td>25</td><td>0.001</td><td>0.001</td><td></td></tr>
-<tr><td>pre/append with values</td><td>25</td><td>0.001</td><td>0.000</td><td></td></tr>
-<tr><td>binary search </td><td>25</td><td>n/a </td><td>0.000</td><td>25</td></tr>
+<tr><td>pre/apppend + set </td><td>25</td><td> </td><td>0.001</td><td>0.001</td></tr>
+<tr><td>pre/append with values</td><td>25</td><td> </td><td>0.001</td><td>0.000</td></tr>
+<tr><td>binary search </td><td>25</td><td>25</td><td>n/a </td><td>0.000</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>pre/apppend + set </td><td>100</td><td>0.015</td><td>0.004</td><td></td></tr>
-<tr><td>pre/append with values</td><td>100</td><td>0.016</td><td>0.003</td><td></td></tr>
-<tr><td>binary search </td><td>100</td><td>n/a </td><td>0.002</td><td>100</td></tr>
+<tr><td>pre/apppend + set </td><td>100</td><td> </td><td>0.015</td><td>0.004</td></tr>
+<tr><td>pre/append with values</td><td>100</td><td> </td><td>0.016</td><td>0.003</td></tr>
+<tr><td>binary search </td><td>100</td><td>100</td><td>n/a </td><td>0.002</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>pre/apppend + set </td><td>250</td><td>0.088</td><td>0.012</td><td></td></tr>
-<tr><td>pre/append with values</td><td>250</td><td>0.084</td><td>0.008</td><td></td></tr>
-<tr><td>binary search </td><td>250</td><td>n/a </td><td>0.005</td><td>250</td></tr>
+<tr><td>pre/apppend + set </td><td>250</td><td> </td><td>0.088</td><td>0.012</td></tr>
+<tr><td>pre/append with values</td><td>250</td><td> </td><td>0.084</td><td>0.008</td></tr>
+<tr><td>binary search </td><td>250</td><td>250</td><td>n/a </td><td>0.005</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>pre/apppend + set </td><td>500</td><td>0.347</td><td>0.028</td><td></td></tr>
-<tr><td>pre/append with values</td><td>500</td><td>0.351</td><td>0.020</td><td></td></tr>
-<tr><td>binary search </td><td>500</td><td>n/a </td><td>0.012</td><td>500</td></tr>
+<tr><td>pre/apppend + set </td><td>500</td><td> </td><td>0.347</td><td>0.028</td></tr>
+<tr><td>pre/append with values</td><td>500</td><td> </td><td>0.351</td><td>0.020</td></tr>
+<tr><td>binary search </td><td>500</td><td>500</td><td>n/a </td><td>0.012</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>pre/apppend + set </td><td>1000</td><td>1.414</td><td>0.066</td><td></td></tr>
-<tr><td>pre/append with values</td><td>1000</td><td>1.316</td><td>0.044</td><td></td></tr>
-<tr><td>binary search </td><td>1000</td><td>n/a </td><td>0.026</td><td>1000</td></tr>
+<tr><td>pre/apppend + set </td><td>1000</td><td> </td><td>1.414</td><td>0.066</td></tr>
+<tr><td>pre/append with values</td><td>1000</td><td> </td><td>1.316</td><td>0.044</td></tr>
+<tr><td>binary search </td><td>1000</td><td>1000</td><td>n/a </td><td>0.026</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>pre/apppend + set </td><td>2500</td><td>8.740</td><td>0.193</td><td></td></tr>
-<tr><td>pre/append with values</td><td>2500</td><td>8.913</td><td>0.130</td><td></td></tr>
-<tr><td>binary search </td><td>2500</td><td>n/a </td><td>0.076</td><td>2500</td></tr>
+<tr><td>pre/apppend + set </td><td>2500</td><td> </td><td>8.740</td><td>0.193</td></tr>
+<tr><td>pre/append with values</td><td>2500</td><td> </td><td>8.913</td><td>0.130</td></tr>
+<tr><td>binary search </td><td>2500</td><td>2500</td><td>n/a </td><td>0.076</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>pre/apppend + set </td><td>5000</td><td>36.233</td><td>0.433</td><td></td></tr>
-<tr><td>pre/append with values</td><td>5000</td><td>36.131</td><td>0.294</td><td></td></tr>
-<tr><td>binary search </td><td>5000</td><td>n/a </td><td>0.176</td><td>5000</td></tr>
+<tr><td>pre/apppend + set </td><td>5000</td><td> </td><td>36.233</td><td>0.433</td></tr>
+<tr><td>pre/append with values</td><td>5000</td><td> </td><td>36.131</td><td>0.294</td></tr>
+<tr><td>binary search </td><td>5000</td><td>5000</td><td>n/a </td><td>0.176</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>pre/apppend + set </td><td>10000</td><td>147.808</td><td>1.046</td><td></td></tr>
-<tr><td>pre/append with values</td><td>10000</td><td>146.973</td><td>0.648</td><td></td></tr>
-<tr><td>binary search </td><td>10000</td><td>n/a </td><td>0.373</td><td>10000</td></tr>
+<tr><td>pre/apppend + set </td><td>10000</td><td> </td><td>147.808</td><td>1.046</td></tr>
+<tr><td>pre/append with values</td><td>10000</td><td> </td><td>146.973</td><td>0.648</td></tr>
+<tr><td>binary search </td><td>10000</td><td>10000</td><td>n/a </td><td>0.373</td></tr>
</table>
Modified: scope/src/store/scptreestore.html
42 lines changed, 21 insertions(+), 21 deletions(-)
===================================================================
@@ -43,7 +43,7 @@
<p>ScpTreeStore implements GtkTreeModel, GtkTreeDragSource, GtkTreeDragDest, GtkTreeSortable
and GtkBuildable. The functions that implement these interfaces are public, so you can invoke
-them directly, without type-casting the store an interface (except for the GtkBuildable
+them directly, without type-casting the store to an interface (except for the GtkBuildable
functions, which are never invoked directly).</p>
<hr>
@@ -463,36 +463,36 @@
with utf-8 collation makes them even slower.</p>
<table>
-<tr><th>Store sorted by double</th><th>Row count</th><th>GtkTreeStore</th>
-<th>ScpTreeStore</th><th>Times</th></tr>
+<tr><th>Store sorted by double</th><th>Row count</th><th>Times</th><th>GtkTreeStore</th>
+<th>ScpTreeStore</th></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>pre/apppend + set </td><td>250</td><td>0.015</td><td>0.003</td><td></td></tr>
-<tr><td>pre/append with values</td><td>250</td><td>0.014</td><td>0.001</td><td></td></tr>
-<tr><td>binary search </td><td>250</td><td>n/a </td><td>0.000</td><td>250</td></tr>
-<tr><td>unsorted linear search</td><td>250</td><td>0.035</td><td>0.001</td><td>250</td></tr>
+<tr><td>pre/apppend + set </td><td>250</td><td> </td><td>0.015</td><td>0.003</td></tr>
+<tr><td>pre/append with values</td><td>250</td><td> </td><td>0.014</td><td>0.001</td></tr>
+<tr><td>binary search </td><td>250</td><td>250</td><td>n/a </td><td>0.000</td></tr>
+<tr><td>unsorted linear search</td><td>250</td><td>250</td><td>0.035</td><td>0.001</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>pre/apppend + set </td><td>2500</td><td>1.321</td><td>0.041</td><td></td></tr>
-<tr><td>pre/append with values</td><td>2500</td><td>1.285</td><td>0.016</td><td></td></tr>
-<tr><td>binary search </td><td>2500</td><td>n/a </td><td>0.001</td><td>2500</td></tr>
-<tr><td>unsorted linear search</td><td>2500</td><td>1.031</td><td>0.041</td><td>770</td></tr>
+<tr><td>pre/apppend + set </td><td>2500</td><td> </td><td>1.321</td><td>0.041</td></tr>
+<tr><td>pre/append with values</td><td>2500</td><td> </td><td>1.285</td><td>0.016</td></tr>
+<tr><td>binary search </td><td>2500</td><td>2500</td><td>n/a </td><td>0.001</td></tr>
+<tr><td>unsorted linear search</td><td>2500</td><td>770 </td><td>1.031</td><td>0.041</td></tr>
<tr><td colspan="5" class="empty"> </td></tr>
-<tr><th>Store sorted by string</th><th>Row count</th><th>GtkTreeStore</th>
-<th>ScpTreeStore</th><th>Times</th></tr>
+<tr><th>Store sorted by string</th><th>Row count</th><th>Times</th><th>GtkTreeStore</th>
+<th>ScpTreeStore</th></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>pre/apppend + set </td><td>250</td><td>0.088</td><td>0.012</td><td></td></tr>
-<tr><td>pre/append with values</td><td>250</td><td>0.084</td><td>0.008</td><td></td></tr>
-<tr><td>binary search </td><td>250</td><td>n/a </td><td>0.005</td><td>250</td></tr>
-<tr><td>unsorted linear search</td><td>250</td><td>0.220</td><td>0.102</td><td>250</td></tr>
+<tr><td>pre/apppend + set </td><td>250</td><td> </td><td>0.088</td><td>0.012</td></tr>
+<tr><td>pre/append with values</td><td>250</td><td> </td><td>0.084</td><td>0.008</td></tr>
+<tr><td>binary search </td><td>250</td><td>250</td><td>n/a </td><td>0.005</td></tr>
+<tr><td>unsorted linear search</td><td>250</td><td>250</td><td>0.220</td><td>0.102</td></tr>
<tr><td> </td><td></td><td></td><td></td><td></td></tr>
-<tr><td>pre/apppend + set </td><td>2500</td><td>8.740</td><td>0.193</td><td></td></tr>
-<tr><td>pre/append with values</td><td>2500</td><td>8.913</td><td>0.130</td><td></td></tr>
-<tr><td>binary search </td><td>2500</td><td>n/a </td><td>0.076</td><td>2500</td></tr>
-<tr><td>unsorted linear search</td><td>2500</td><td>6.807</td><td>3.186</td><td>770</td></tr>
+<tr><td>pre/apppend + set </td><td>2500</td><td> </td><td>8.740</td><td>0.193</td></tr>
+<tr><td>pre/append with values</td><td>2500</td><td> </td><td>8.913</td><td>0.130</td></tr>
+<tr><td>binary search </td><td>2500</td><td>2500</td><td>n/a </td><td>0.076</td></tr>
+<tr><td>unsorted linear search</td><td>2500</td><td>770 </td><td>6.807</td><td>3.186</td></tr>
</table>
--------------
This E-Mail was brought to you by github_commit_mail.py (Source: https://github.com/geany/infrastructure).
More information about the Plugins-Commits
mailing list