Kevin Bracey writes:
> On 06/05/2013 23:45, Junio C Hamano wrote:
>> Kevin Bracey writes:
>>
>>> +struct treesame_state {
>>> + unsigned int nparents;
>>> + unsigned char treesame[FLEX_ARRAY];
>>> +};
>> I have been wondering if we want to do one-bit (not one-byte) per
>> parent but no biggi
On 06/05/2013 23:45, Junio C Hamano wrote:
Kevin Bracey writes:
+struct treesame_state {
+ unsigned int nparents;
+ unsigned char treesame[FLEX_ARRAY];
+};
I have been wondering if we want to do one-bit (not one-byte) per
parent but no biggie ;-)
I did start down that path, beca
Kevin Bracey writes:
> diff --git a/revision.c b/revision.c
> index a67b615..c88ded8 100644
> --- a/revision.c
> +++ b/revision.c
> @@ -429,10 +429,100 @@ static int rev_same_tree_as_empty(struct rev_info
> *revs, struct commit *commit)
> return retval >= 0 && (tree_difference == REV_TREE_
History simplification previously always treated merges as TREESAME
if they were TREESAME to any parent.
While this was consistent with the default behaviour, this could be
extremely unhelpful when searching detailed history, and could not be
overridden. For example, if a merge had ignored a chang
4 matches
Mail list logo