On Wed, Feb 10, 2016 at 7:05 PM, Reese Johnson wrote:
> Hope I did this correct
...
> Some commands such as "get" can create an arbitrary sub-tree in the current
> -directory, and a subsequent update will recursively flesh out this sub-tree.
> +directory, and a subsequent update will recursively
Hope I did this correct
RCS file: /cvs/www/build/mirrors/anoncvs.html.head,v
retrieving revision 1.43
diff -u -p -r1.43 anoncvs.html.head
--- anoncvs.html.head 18 Oct 2015 19:25:30 - 1.43
+++ anoncvs.html.head 11 Feb 2016 02:57:28 -
@@ -288,7 +288,7 @@ information about how CVS ca
On Wed, Feb 10, 2016 at 11:04:18PM +, Edd Barrett wrote:
> Hey,
>
> I'd like top(1)'s filter feature (-g) to search process arguments. This
> would make searching for (e.g.) Python scripts by name much easier. The
> current behaviour only searches the program name, which for scripts is
> the i
Hey,
I'd like top(1)'s filter feature (-g) to search process arguments. This
would make searching for (e.g.) Python scripts by name much easier. The
current behaviour only searches the program name, which for scripts is
the interpreter binary name (e.g. python2.7). Currently the best you
could do
On Wed, 10 Feb 2016 17:56:00 +0100, Martin Natano wrote:
> What do you mean by it being used in a clever way? I see the sign bit
> being used as part of the hash itself, like all the other bits in the
> sum. That shouldn't change when using unsigned instead. Am I missing
> something?
I was trying
On Wed, Feb 10, 2016 at 09:29:26AM -0700, Todd C. Miller wrote:
> On Wed, 10 Feb 2016 08:36:42 -0700, "Todd C. Miller" wrote:
>
> > Making those values unsigned int should be sufficient but it is a
> > fairly intrusive change.
>
> Actually, this is trickier than it appears since diff uses the sig
On Wed, 10 Feb 2016 08:36:42 -0700, "Todd C. Miller" wrote:
> Making those values unsigned int should be sufficient but it is a
> fairly intrusive change.
Actually, this is trickier than it appears since diff uses the sign
bit in a clever way to save space.
- todd
On Tue, 09 Feb 2016 15:13:22 -0500, Michael McConville wrote:
> It looks like a few tools in base rely on two's complement integer
> overflow for the hashing algorithm in readhash(). Overflow can easily be
> observed using a manual check or a dynamic undefined behavior tool. This
> function is als
On Tue, Feb 09, 2016 at 03:13:22PM -0500, Michael McConville wrote:
> It looks like a few tools in base rely on two's complement integer
> overflow for the hashing algorithm in readhash(). Overflow can easily be
> observed using a manual check or a dynamic undefined behavior tool. This
> function
