News for hackers. Stuff that matters.
Re:How to Print Integers Really Fast by blt on Sunday December 24, 2017 @01:03AM (#15998228)
This is a common case? Besides educational exercises, why? I would have guessed most printed integers are random ID numbers, prices, database foreign keys, etc.
Re:How to Print Integers Really Fast by MaulingMonkey on Sunday December 24, 2017 @01:21AM (#15998289)
> This is a common case? Besides educational exercises, why?

Sequential IDs permeate everything. Array indicies. Memory offsets. Line numbers, track numbers, page numbers, check numbers... the dates of your daily logs, your calendars... heck, enumeration attacks can be as simple as "what happens when I increment this number by exactly 1 when making this GET request?"

Re:How to Print Integers Really Fast by jzwinck on Sunday December 24, 2017 @01:14AM (#15998264)
Line numbers in less(1) or GitHub. Row numbers in Excel, Pandas, R, etc.

The most common way to label rows is with sequential numbers.

Re:How to Print Integers Really Fast by eesmith on Sunday December 24, 2017 @03:07AM (#15998558)
FWIW, in a file with 1,000,000 lines, the best-of-3 time for "less filename > /dev/null" is:

  2.508u 0.152s 0:02.66 99.6%	0+0k 0+0io 0pf+0w
and the best-of-3 time for "less -N filename > /dev/null" is:

  2.568u 0.159s 0:02.73 99.2%	0+0k 0+0io 0pf+0w
That is, it doesn't seem like printing sequential is the limiting factor in performance.

This is with "less 458", "Copyright (C) 1984-2012". I downloaded and compiled stock 487 and the best-of-3 times went up to 0:02.94 for both cases.

Checking the source code, it does not appear to use knowledge of the previous output index in order to save time. The relevant code is:

        static int
  iprint_linenum(num)
        LINENUM num;
  {
        char buf[INT_STRLEN_BOUND(num)];

        linenumtoa(num, buf);
        putstr(buf);
        return ((int) strlen(buf));
  }
where

  #define TYPE_TO_A_FUNC(funcname, type) \
  void funcname(num, buf) \
          type num; \
          char *buf; \
  { \
          int neg = (num < 0); \
          char tbuf[INT_STRLEN_BOUND(num)+2]; \
          register char *s = tbuf + sizeof(tbuf); \
          if (neg) num = -num; \
          *--s = '\0'; \
          do { \
                  *--s = (num % 10) + '0'; \
          } while ((num /= 10) != 0); \
          if (neg) *--s = '-'; \
          strcpy(buf, s); \
  }
  
  TYPE_TO_A_FUNC(linenumtoa, LINENUM)
Re:How to Print Integers Really Fast by blt on Sunday December 24, 2017 @01:32PM (#16000625)
hmm, maybe someone can get a pull request for implementing this optimization :)
Re:How to Print Integers Really Fast by eesmith on Sunday December 24, 2017 @08:28PM (#16002189)
While I know you meant that comment in jest, it suggests that I wasn't clear enough.

My implicit argument is that there's there's no reason to believe that line counting adds anything more than trivial overhead to the less output, so there's no reason to even consider this optimization, much less getting to the point to make a pull request.

Re:How to Print Integers Really Fast by eternauta3k on Sunday December 24, 2017 @06:24AM (#15999078)
This is so common that there are dedicated ICs to count in base 10.