object-introspection/test/integration/sorted_vector_set.toml

includes = ["folly/sorted_vector_types.h"]
definitions = '''
    using folly::sorted_vector_set;
'''

[cases]
  [cases.no_ints]
    param_types = ["const sorted_vector_set<int>&"]
    setup = "return {};"
    expect_json = '''[{
      "staticSize":24,
      "dynamicSize":0,
      "length":0,
      "capacity":0,
      "elementStaticSize":4,
      "members":[{
        "staticSize": 24,
        "dynamicSize": 0,
        "length": 0,
        "capacity": 0,
        "elementStaticSize": 4
    }]}]'''
    expect_json_v2 = '''[{
      "staticSize": 24,
      "exclusiveSize": 24,
      "size": 24,
      "length": 0,
      "capacity": 0
    }]'''

  [cases.some_ints]
    param_types = ["const sorted_vector_set<int>&"]
    setup = '''
      sorted_vector_set<int> is;
      is.insert(1);
      is.insert(3);
      is.insert(2);
      is.insert(3);
      return is;
    '''
    expect_json = '''[{
      "staticSize": 24,
      "dynamicSize": 16,
      "exclusiveSize": 0,
      "length":3,
      "capacity":4,
      "elementStaticSize":4,
      "members": [{
        "staticSize": 24,
        "dynamicSize": 16,
        "exclusiveSize": 40,
        "length": 3,
        "capacity": 4,
        "elementStaticSize": 4
    }]}]
    '''
    expect_json_v2 = '''[{
      "staticSize": 24,
      "exclusiveSize": 28,
      "size": 40,
      "length": 3,
      "capacity": 4
    }]'''
sorted_vec_set: finish changing to a container adapter 2023-02-23 23:32:37 +00:00			`includes = ["folly/sorted_vector_types.h"]`
			`definitions = '''`
			`using folly::sorted_vector_set;`
			`'''`

			`[cases]`
			`[cases.no_ints]`
			`param_types = ["const sorted_vector_set<int>&"]`
			`setup = "return {};"`
			`expect_json = '''[{`
			`"staticSize":24,`
			`"dynamicSize":0,`
			`"length":0,`
			`"capacity":0,`
			`"elementStaticSize":4,`
			`"members":[{`
			`"staticSize": 24,`
			`"dynamicSize": 0,`
			`"length": 0,`
			`"capacity": 0,`
			`"elementStaticSize": 4`
			`}]}]'''`
Implement Container V2 for folly::sorted_vector_set 2023-09-28 02:51:47 +01:00			`expect_json_v2 = '''[{`
			`"staticSize": 24,`
			`"exclusiveSize": 24,`
tbv2: calculate total memory footprint Add the option to calculate total size (inclusive size) by wrapping the existing iterator. This change provides a new iterator, `SizedIterator`, which wraps an existing iterator and adds a new field `size` to the output element. This is achieved with a two pass algorithm on the existing iterator: 1. Gather metadata for each element. This includes the total size up until that element and the range of elements that should be included in the size. 2. Return the result from the underlying iterator with the additional field. This algorithm is `O(N)` time on the number of elements in the iterator and `O(N)` time, storing 16 bytes per element. This isn't super expensive but is a lot more than the current algorithm which requires close to constant space. Because of this I've implemented it as a wrapper on the iterator rather than on by default, though it is now on in every one of our integration test cases. Test plan: - Added to the integration tests for full coverage. 2024-01-03 17:30:31 +00:00			`"size": 24,`
Implement Container V2 for folly::sorted_vector_set 2023-09-28 02:51:47 +01:00			`"length": 0,`
			`"capacity": 0`
			`}]'''`
sorted_vec_set: finish changing to a container adapter 2023-02-23 23:32:37 +00:00
			`[cases.some_ints]`
			`param_types = ["const sorted_vector_set<int>&"]`
			`setup = '''`
			`sorted_vector_set<int> is;`
			`is.insert(1);`
			`is.insert(3);`
			`is.insert(2);`
			`is.insert(3);`
			`return is;`
			`'''`
			`expect_json = '''[{`
			`"staticSize": 24,`
			`"dynamicSize": 16,`
Add tests for exclusive size 2023-03-03 20:09:51 +00:00			`"exclusiveSize": 0,`
sorted_vec_set: finish changing to a container adapter 2023-02-23 23:32:37 +00:00			`"length":3,`
			`"capacity":4,`
			`"elementStaticSize":4,`
			`"members": [{`
			`"staticSize": 24,`
			`"dynamicSize": 16,`
Add tests for exclusive size 2023-03-03 20:09:51 +00:00			`"exclusiveSize": 40,`
sorted_vec_set: finish changing to a container adapter 2023-02-23 23:32:37 +00:00			`"length": 3,`
			`"capacity": 4,`
			`"elementStaticSize": 4`
			`}]}]`
			`'''`
Implement Container V2 for folly::sorted_vector_set 2023-09-28 02:51:47 +01:00			`expect_json_v2 = '''[{`
			`"staticSize": 24,`
			`"exclusiveSize": 28,`
tbv2: calculate total memory footprint Add the option to calculate total size (inclusive size) by wrapping the existing iterator. This change provides a new iterator, `SizedIterator`, which wraps an existing iterator and adds a new field `size` to the output element. This is achieved with a two pass algorithm on the existing iterator: 1. Gather metadata for each element. This includes the total size up until that element and the range of elements that should be included in the size. 2. Return the result from the underlying iterator with the additional field. This algorithm is `O(N)` time on the number of elements in the iterator and `O(N)` time, storing 16 bytes per element. This isn't super expensive but is a lot more than the current algorithm which requires close to constant space. Because of this I've implemented it as a wrapper on the iterator rather than on by default, though it is now on in every one of our integration test cases. Test plan: - Added to the integration tests for full coverage. 2024-01-03 17:30:31 +00:00			`"size": 40,`
Implement Container V2 for folly::sorted_vector_set 2023-09-28 02:51:47 +01:00			`"length": 3,`
			`"capacity": 4`
			`}]'''`