Skip to content
Snippets Groups Projects
  1. May 27, 2022
    • Gustavo Niemeyer's avatar
      The Billion Dollar Mistake · f6f7691b
      Gustavo Niemeyer authored
      To be fair, it only happens here because this is a C-style API that was
      converted to Go but keeping its general shape. The proper fix, to be
      done eventually, is to replace all these boolean error flags by proper
      error types.
      
      Fixes #665
      v3.0.1
      f6f7691b
  2. May 21, 2022
  3. May 12, 2022
    • Gustavo Niemeyer's avatar
      Fix decoding of merge tags. · 539c8e75
      Gustavo Niemeyer authored
      This addresses a number of related issues on how merge tags
      were handled, most notably the case of nested mappings being
      merged instead of the outermost value being used as-is.
      
      Closes: #818 #826
      539c8e75
  4. Jan 07, 2021
  5. Jan 06, 2021
  6. Jan 05, 2021
  7. Dec 12, 2020
  8. Jun 15, 2020
  9. Jun 05, 2020
    • Gustavo Niemeyer's avatar
      Fix handling of line comments in bare keys · a5ece683
      Gustavo Niemeyer authored
      This change allows the following document to correctly roundtrip:
      
        foo:
          # Head comment of following map
          - # Head comment of bar
            bar: # Line comment of bar
              baz # Line comment of baz
      
      The logic for indentation was also tuned so it's again more regular.
      a5ece683
  10. Jun 03, 2020
  11. Jun 02, 2020
  12. Jun 01, 2020
  13. May 06, 2020
  14. May 04, 2020
  15. Mar 13, 2020
  16. Jan 21, 2020
    • Gustavo Niemeyer's avatar
      Port CJ's simple_keys optimization to v3 (#555) · a6ecf24a
      Gustavo Niemeyer authored
      Message from original commit (53403b58):
      
      This change introduces an index to lookup token numbers referenced by simple_keys in O(1),
      thus significantly reducing the performance impact of certain abusively constructed snippets.
      
      When we build up the simple_keys stack, we count on the (formerly named) staleness check to
      catch errors where a simple key is required but would be > 1024 chars or span lines. The previous
      simplification that searches the stack from the top can go 1024 keys deep before finding a "stale"
      key and stopping. I added a test that shows that this consumes ~3s per 1MB of document size.
      a6ecf24a
  17. Nov 20, 2019
  18. Nov 19, 2019
  19. Nov 07, 2019
  20. Nov 06, 2019
  21. Nov 05, 2019
  22. Oct 26, 2019
  23. Oct 10, 2019
Loading