openhub.net
Black Duck Software, Inc.
Open Hub
Follow @
OH
Sign In
Join Now
Projects
People
Organizations
Tools
Blog
BDSA
Projects
People
Projects
Organizations
N
numexpr
Settings
|
Report Duplicate
3
I Use This!
×
Login Required
Log in to Open Hub
Remember Me
Moderate Activity
Commits
: Listings
Analyzed
1 day
ago. based on code collected
1 day
ago.
Sep 26, 2025 — Sep 26, 2026
Showing page 33 of 38
Search / Filter on:
Commit Message
Contributor
Files Modified
Lines Added
Lines Removed
Code Location
Date
use a more extreme test for the compilation time (varying expr) benchmark
Gaetan de Menten
More...
about 15 years ago
- sped up (initial) compilation of very large expressions (optimizeTempoariesAllocation was ~ O(n^2)) - removed some useless code (registers don't need to be numbered twice)
Gaetan de Menten
More...
about 15 years ago
slightly optimize compilation phase with more compact code
Gaetan de Menten
More...
about 15 years ago
remove all references to copy_args. They are not used anymore.
Gaetan de Menten
More...
about 15 years ago
added a bit more info in "input names exception"
Gaetan de Menten
More...
about 15 years ago
made getContext not modify the original dict, it's too easy to introduce a bug by using kwargs afterwards
Gaetan de Menten
More...
about 15 years ago
a few cosmetic changes
Gaetan de Menten
More...
about 15 years ago
use a tad faster __hash__ method
Gaetan de Menten
More...
about 15 years ago
made get_return_sig more readable
Gaetan de Menten
More...
about 15 years ago
fixed ones_like opcode (its signature has two arguments, even if the input argument is not really used). Note that we can't (easily) make ones_like take zero argument during the expression evaluation phase ( by replacing it by OpNode('ones_like', kind=a.astKind) because in that case the variable might not appear at all in the signature of the expression and thus, no type information for it would be available and a double would be used in all cases.
Gaetan de Menten
More...
about 15 years ago
- a few cosmectic changes - added a few FIXME
Gaetan de Menten
More...
about 15 years ago
- fixed the test suite: most of the TestExpressions tests were not run !!! in fact, the first test was run over and over again, making it look like all tests were executed and were successful. Moral of the story: do *not* define a closure within a for loop. - added a few tests for pow - cosmetic changes
Gaetan de Menten
More...
about 15 years ago
update tags
convert-repo
More...
about 15 years ago
Remove warning about unused 'ptr', add .hgignore file
Mark Wiebe
More...
about 15 years ago
Merge the newiter branch into default
Mark Wiebe
More...
about 15 years ago
fix compilation on (recent?) mingw by not including "missing_posix_functions.inc"
gdementen
More...
about 15 years ago
Update to work with NumPy 1.6 beta branch
mwwiebe
More...
over 15 years ago
Undoing changes in r280.
Francesc Alted
More...
over 15 years ago
Undoing changes.
Francesc Alted
More...
over 15 years ago
Removed unneeded sb1, sb2 and sb3 registers.
Francesc Alted
More...
over 15 years ago
Update to work with NumPy trunk, remove original looping method
mwwiebe
More...
over 15 years ago
Removed and re-added benchmark.
Francesc Alted
More...
over 15 years ago
Syncing with r279 in 1.4 branch..
Francesc Alted
More...
over 15 years ago
Updated release notes for 1.4.2.
Francesc Alted
More...
over 15 years ago
Merged in r257:274 from 1.4 branch (releasing 1.4.2).
Francesc Alted
More...
over 15 years ago
Added a warning about the dependency of the new iter code.
Francesc Alted
More...
over 15 years ago
Removed some overflow warnings in reduction operations.
Francesc Alted
More...
over 15 years ago
Added Mark Wiebe as author. Version bumped to 2.0.dev
Francesc Alted
More...
over 15 years ago
Initial import of changes in https://github.com/m-paradox/numexpr
Francesc Alted
More...
over 15 years ago
New branch for merging Mark Wiebe patches for new NumPy iterator.
Francesc Alted
More...
over 15 years ago
←
1
2
…
29
30
31
32
33
34
35
36
37
38
→
This site uses cookies to give you the best possible experience. By using the site, you consent to our use of cookies. For more information, please see our
Privacy Policy
Agree