https://github.com/JuliaLang/julia
Revision dd889966c349d9879665f3cbd16ff901c258816a authored by tan on 09 January 2015, 11:10:32 UTC, committed by Viral B. Shah on 15 January 2015, 04:00:39 UTC
Given:
- S = sparse matrix
- I = rows being fetched
- n = average row count in S

Do:
- binary search on I if length(I) much larger than n
- binary search on S.rowval if n much larger than length(I)
- linear search walk through I and S.rowval otherwise

Currently the threshold values are determined heuristically
based on the tests done.

(cherry picked from commit aafb4a0fc3fdb1bad5fcd8e1a343816b5a27bc5a)

Conflicts:
	test/sparse.jl
1 parent 99c00d5
History
Tip revision: dd889966c349d9879665f3cbd16ff901c258816a authored by tan on 09 January 2015, 11:10:32 UTC
binary search in sparse getindex with sorted rows
Tip revision: dd88996
File Mode Size
base
contrib
deps
doc
etc
examples
src
test
ui
.gitignore -rw-r--r-- 138 bytes
.gitmodules -rw-r--r-- 475 bytes
.mailmap -rw-r--r-- 6.7 KB
.travis.yml -rw-r--r-- 2.7 KB
CONTRIBUTING.md -rw-r--r-- 9.2 KB
DISTRIBUTING.md -rw-r--r-- 6.5 KB
LICENSE.md -rw-r--r-- 3.9 KB
Make.inc -rw-r--r-- 21.2 KB
Makefile -rw-r--r-- 18.2 KB
NEWS.md -rw-r--r-- 39.3 KB
README.md -rw-r--r-- 21.2 KB
README.windows.md -rw-r--r-- 16.7 KB
VERSION -rw-r--r-- 10 bytes
Windows.inc -rw-r--r-- 1.5 KB
appveyor.yml -rw-r--r-- 1.3 KB

README.md

back to top