Tag: Branch: Tree: 587a05e3eb

0.2

0.3

0.4

0.5

0.5.0

0.5.0rc2

0.6

0.6.0

0.6.1

0.6.2

0.7

0.7.0

0.7.1

0.7.2

0.8

0.8.0

1.0

1.0.0

1.0.1

1.1

1.1.0

master

multiarch

v0.1.0

v0.2.0

v0.2.1

v0.2.2

v0.3.0

v0.4.0

v0.5.0

v0.5.0rc1

v0.5.0rc2

v0.6.0

v0.6.1

v0.6.2

v0.7.0

v0.7.1

v0.7.2

v0.8.0

v1.0.0

v1.0.1

v1.1.0

v1.2.0

v1.3.0

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from '587a05e3eb'

${ noResults }

Commit Graph

2 Commits (587a05e3eb764a1b8ca683d342c4c8236a8ef683)

Author	SHA1	Message	Date
Peter Johnson	ce4a5fe02a	Switch from using ternary tree to Hash Array Mapped Trie (HAMT), which has ... *much* less overhead. XXX: current implementation of HAMT is *not* portable due to pointer alignment restrictions (it uses the LSB of a pointer to store a flag). Need to write a portable (if not so space-efficient) equivalent. svn path=/trunk/yasm/; revision=363	23 years ago
Peter Johnson	8178f883a5	Modify so that almost everything passes LCLint with the options in lclint.sh. ... This is actually worthwhile; I found and fixed a few bugs/edge cases while doing this. For more information on LCLint, see <http://lclint.cs.virginia.edu/>. svn path=/trunk/yasm/; revision=335	23 years ago