utf16.odin 1.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354
  1. REPLACEMENT_CHAR :: '\uFFFD';
  2. MAX_RUNE :: '\U0010FFFF';
  3. _surr1 :: 0xd800;
  4. _surr2 :: 0xdc00;
  5. _surr3 :: 0xe000;
  6. _surr_self :: 0x10000;
  7. is_surrogate :: proc(r: rune) -> bool {
  8. return _surr1 <= r && r < _surr3;
  9. }
  10. decode_surrogate_pair :: proc(r1, r2: rune) -> rune {
  11. if _surr1 <= r1 && r1 < _surr2 && _surr2 <= r2 && r2 < _surr3 {
  12. return (r1-_surr1)<<10 | (r2 - _surr2) + _surr_self;
  13. }
  14. return REPLACEMENT_CHAR;
  15. }
  16. encode_surrogate_pair :: proc(r: rune) -> (r1, r2: rune) {
  17. if r < _surr_self || r > MAX_RUNE {
  18. return REPLACEMENT_CHAR, REPLACEMENT_CHAR;
  19. }
  20. r -= _surr_self;
  21. return _surr1 + (r>>10)&0x3ff, _surr2 + r&0x3ff;
  22. }
  23. encode :: proc(d: []u16, s: []rune) {
  24. n := len(s);
  25. for r in s do if r >= _surr_self do n += 1;
  26. max_n := min(len(d), n);
  27. n = 0;
  28. for r in s {
  29. match r {
  30. case 0.._surr1, _surr3.._surr_self:
  31. d[n] = u16(r);
  32. n += 1;
  33. case _surr_self..MAX_RUNE:
  34. r1, r2 := encode_surrogate_pair(r);
  35. d[n] = u16(r1);
  36. d[n+1] = u16(r2);
  37. n += 2;
  38. case:
  39. d[n] = u16(REPLACEMENT_CHAR);
  40. n += 1;
  41. }
  42. }
  43. }