Derrick Stolee writes:
>> But I do not think we want this "clever" optimization that involves
>> 'n' in the first place.
+ while (count++ < 10) {
>>> + for (i = 0; i < n; i++)
>>> + ((unsigned int*)oid.hash)[i] = hash_base;
>>
>> Does it make sense to assume
On 9/17/2017 5:51 PM, Junio C Hamano wrote:
Derrick Stolee writes:
+int cmd_main(int ac, const char **av)
+{
+ setup_git_directory();
As far as I recall, we do not (yet) allow declaration after
statement in our codebase. Move this down to make it after all
decls.
Will fix.
+
+
Derrick Stolee writes:
> +int cmd_main(int ac, const char **av)
> +{
> + setup_git_directory();
As far as I recall, we do not (yet) allow declaration after
statement in our codebase. Move this down to make it after all
decls.
> +
> + unsigned int hash_delt = 0x13579BDF;
> + unsigne
Create helper program test-abbrev to compute the minimum length of a
disambiguating short-sha for 100,000 object ids. The ids are created
by iterating an unsigned int hash_base by a constant hash_delta and
copying hash_base five times across the sha1. Iterating by hash_delta
does not create a dupli
4 matches
Mail list logo