PJUllrich

Big-O Time Complexities for Elixir data structures

Map [1]

Operation	Time Complexity
Access	O(log n)
Search	O(log n)
Insertion	O(n) for <= 32 elements, O(log n) for > 32 elements [2]
Deletion	O(n) for <= 32 elements, O(log n) for > 32 elements

naesean

JSONAPIObject:
  description: Includes the current JSON:API version for this specification as well as optional meta information
  type: object
  required:
    - version
  properties:
    version:
      type: string
      default: '1.0'
      example: '1.0'