W dniu 04.10.2016 o 22:58, Stefan Beller pisze: > On Tue, Oct 4, 2016 at 1:55 PM, Jeff King <peff@xxxxxxxx> wrote: >> On Tue, Oct 04, 2016 at 01:52:19PM -0700, Jacob Keller wrote: >> >>>>>>>> +# Note: These tests depend on the hard-coded value of 5 as "too deep". We start >>>>>>>> +# the depth at 0 and count links, not repositories, so in a chain like: >>>>>>>> +# >>>>>>>> +# A -> B -> C -> D -> E -> F -> G -> H >>>>>>>> +# 0 1 2 3 4 5 6 >>>>>>>> +# > > Input from a self-claimed design expert for ASCII art. ;) > What about this? > > # A -0-> B -1-> C -2-> ... I would prefer the following: # A --> B --> C --> D --> E --> F --> G --> H # 0 1 2 3 4 5 6 that is, the number below the middle of the arrow (which could have been even longer) # A ---> B ---> C ---> D ---> E ---> F ---> G ---> H # 0 1 2 3 4 5 6 Let's paint this bikeshed _plaid_ ;-)))) -- Jakub Narębski