[phobos] [D-Programming-Language/phobos] aba3fe: New primitive - Tiny UTF Binary Search Table

[GitHub via phobos]

  Branch: refs/heads/master
  Home:   https://github.com/D-Programming-Language/phobos
  Commit: aba3fe84a3987ade8f95bd7b76e4aa38b0f3a103
      https://github.com/D-Programming-Language/phobos/commit/aba3fe84a3987ade8f95bd7b76e4aa38b0f3a103
  Author: Dmitry Olshansky <dmitry.olsh at gmail.com>
  Date:   2015-11-07 (Sat, 07 Nov 2015)

  Changed paths:
    M std/uni.d

  Log Message:
  -----------
  New primitive - Tiny UTF Binary Search Table

This lays on the foundation of UTF word notion,
a 32-bit integer that contains UTF encoded codepoint.
Top non-zero byte is the UTF-8 starter, so it's BigEndian
when reading directly from strings.

Same applies to UTF-16 word.

Also this invents simpler API for matching that easily combines:
 - length of code point matched
 - result of match (true/false if belongs to this set)
 - bad encoding flag

in one packed 32-bit machine word - UtfLookup. This struct is
going to be reused for all of "directly on UTF" matchers in std.uni.


  Commit: 2812f9a67656dc7760f0dde21587844c2f4f0543
      https://github.com/D-Programming-Language/phobos/commit/2812f9a67656dc7760f0dde21587844c2f4f0543
  Author: Brian Schott <briancschott at gmail.com>
  Date:   2015-11-07 (Sat, 07 Nov 2015)

  Changed paths:
    M std/uni.d

  Log Message:
  -----------
  Merge pull request #3710 from DmitryOlshansky/uni-tab

New primitive - Tiny UTF Binary Search Table


Compare: https://github.com/D-Programming-Language/phobos/compare/6b0aa3c34930...2812f9a67656