On Apr 12, 2010, at 2:19 PM, William Siegrist wrote:
On Apr 12, 2010, at 1:59 PM, Benjamin wrote:
- Server side there is a trac plugin we can use and sounded like there wasn't
I'm not sure what the last half of the above was supposed to say, but yes,
there is git support for Trac.
On Apr 12, 2010, at 6:28 PM, Alexey Proskuryakov wrote:
One thing that wasn't mentioned at the meeting is that git doesn't seem to
have the same monotonously increasing revision numbers as svn does. It will
be a problem to replace REGRESSION(r12345) with
13.04.2010, в 00:10, Benjamin Meyer написал(а):
One thing that wasn't mentioned at the meeting is that git doesn't seem to
have the same monotonously increasing revision numbers as svn does. It will
be a problem to replace REGRESSION(r12345) with
On Tue, Apr 13, 2010 at 8:14 AM, Alexey Proskuryakov a...@webkit.org wrote:
13.04.2010, в 00:10, Benjamin Meyer написал(а):
One thing that wasn't mentioned at the meeting is that git doesn't seem
to have the same monotonously increasing revision numbers as svn does. It
will be a problem to
COMMIT~1 or COMMIT^ both are one commit prior to COMMIT.
COMMIT~2 or COMMIT^^ are both 2 commits prior.
On Tue, Apr 13, 2010 at 8:35 AM, Geoffrey Garen gga...@apple.com wrote:
If Mark would add tags for the nightlies one could type git tag --
contains=COMMIT to figure out which tags include the
12.04.2010, в 13:59, Benjamin написал(а):
* Ran overtime on this meeting
One thing that wasn't mentioned at the meeting is that git doesn't seem to have
the same monotonously increasing revision numbers as svn does. It will be a
problem to replace REGRESSION(r12345) with
Only the first 5-7 characters are needed to identify a single commit (enough of
the hash prefix to be unique). So REGRESSION(96c3b0) vs REGRESSION(r12345).
On Apr 12, 2010, at 6:28 PM, Alexey Proskuryakov wrote:
One thing that wasn't mentioned at the meeting is that git doesn't seem to
have
It's not immediately clear how to sort a list of commit hashes into a
sequential list, e.g., if using a list of nightly builds for a binary
regression search.
Perhaps there is a git command that sorts them for you given an existing
repository?
Dave
On Mon, April 12, 2010 at 8:15:40 PM,
(sent from the wrong email, sorry)
git-bisect can be used for a binary regression search.
Daniel
On Mon, Apr 12, 2010 at 9:05 PM, Daniel Cheng dch...@google.com wrote:
git-bisect can be used for a binary regression search.
Daniel
On Mon, Apr 12, 2010 at 8:45 PM, David Kilzer
I can't tell from documentation if git-bisect requires rebuilding each
revision. This is something we don't currently have to do, given that there are
nightlies to test with.
But my question was somewhat different (Dave Kilzer told me about git bisect
earlier today). How can I tell if a given
Proskuryakov
a...@webkit.org; WebKit Development webkit-dev@lists.webkit.org
Sent: Mon, April 12, 2010 9:07:13 PM
Subject: Re: [webkit-dev] Git meeting notes
git-bisect can be used for a binary regression search.
Daniel
On Mon, Apr 12, 2010 at 9:05 PM, Daniel Cheng dch...@google.com wrote:
git
On Apr 12, 2010, at 8:15 PM, Timothy Hatcher wrote:
Only the first 5-7 characters are needed to identify a single commit
(enough of the hash prefix to be unique). So REGRESSION(96c3b0) vs
REGRESSION(r12345).
How long will 7 characters last before you hit the birthday paradox?
Regards,
On Tuesday 13 April 2010 06:32:24 Alexey Proskuryakov wrote:
I can't tell from documentation if git-bisect requires rebuilding each
revision. This is something we don't currently have to do, given that
there are nightlies to test with.
But my question was somewhat different (Dave Kilzer told
13 matches
Mail list logo
