JakeHillion/object-introspection
1
0
Fork 0
mirror of https://github.com/JakeHillion/object-introspection.git synced 2024-11-09 21:24:14 +00:00
Code Issues Packages Projects Releases Wiki Activity
ed5fcfef9e
object-introspection/test/integration/fbstring.toml

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

163 lines
4.1 KiB
TOML
Raw Normal View History

Implement Container V2 for fbstring
2023-09-27 23:19:51 +01:00
includes = ["folly/FBString.h", "utility"]
add test for folly::fbstring
2023-04-05 21:56:55 +01:00
[cases]
[cases.empty]
param_types = ["folly::fbstring&"]
setup = "return {};"
expect_json = '''
[
{
"typeName": "fbstring",
"isTypedef": true,
"staticSize": 24,
"dynamicSize": 0,
"exclusiveSize": 0,
"members": [
{
"staticSize": 24,
"dynamicSize": 0,
"exclusiveSize": 24,
"length": 0,
Implement Container V2 for fbstring
2023-09-27 23:19:51 +01:00
"capacity":23,
add test for folly::fbstring
2023-04-05 21:56:55 +01:00
"elementStaticSize": 1
}
]
}
]
'''
Implement Container V2 for fbstring
2023-09-27 23:19:51 +01:00
expect_json_v2 = '''[{
"typeNames": ["folly::basic_fbstring<int8_t, std::char_traits<int8_t>, std::allocator<int8_t>, folly::fbstring_core<int8_t>>"],
"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 fbstring
2023-09-27 23:19:51 +01:00
"length": 0,
"capacity": 23
}]'''
add test for folly::fbstring
2023-04-05 21:56:55 +01:00
[cases.inline]
param_types = ["folly::fbstring&"]
setup = 'return {"012345"};'
expect_json = '''
[
{
"typeName": "fbstring",
"isTypedef": true,
"staticSize": 24,
"dynamicSize": 0,
"exclusiveSize": 0,
"members": [
{
"staticSize": 24,
"dynamicSize": 0,
"exclusiveSize": 24,
"length": 6,
"capacity": 23,
"elementStaticSize": 1
}
]
}
]
'''
Implement Container V2 for fbstring
2023-09-27 23:19:51 +01:00
expect_json_v2 = '''[{
"typeNames": ["folly::basic_fbstring<int8_t, std::char_traits<int8_t>, std::allocator<int8_t>, folly::fbstring_core<int8_t>>"],
"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 fbstring
2023-09-27 23:19:51 +01:00
"length": 6,
"capacity": 23
}]'''
add test for folly::fbstring
2023-04-05 21:56:55 +01:00
[cases.heap_allocated]
param_types = ["folly::fbstring&"]
setup = 'return {"abcdefghijklmnopqrstuvwxzy"};'
expect_json = '''
[
{
"typeName": "fbstring",
"isTypedef": true,
"staticSize": 24,
"dynamicSize": 26,
"exclusiveSize": 0,
"members": [
{
"staticSize": 24,
"dynamicSize": 26,
"exclusiveSize": 50,
"length": 26,
"capacity": 26,
"elementStaticSize": 1
}
]
}
]
'''
Implement Container V2 for fbstring
2023-09-27 23:19:51 +01:00
expect_json_v2 = '''[{
"typeNames": ["folly::basic_fbstring<int8_t, std::char_traits<int8_t>, std::allocator<int8_t>, folly::fbstring_core<int8_t>>"],
"staticSize": 24,
"exclusiveSize": 50,
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": 50,
Implement Container V2 for fbstring
2023-09-27 23:19:51 +01:00
"length": 26,
"capacity": 26
}]'''
add test for folly::fbstring
2023-04-05 21:56:55 +01:00
Implement Container V2 for fbstring
2023-09-27 23:19:51 +01:00
[cases.string_pooled_unique]
add test for folly::fbstring
2023-04-05 21:56:55 +01:00
param_types = ["folly::fbstring&"]
setup = "return folly::fbstring(1024, 'c');"
expect_json = '''
[
{
"typeName": "fbstring",
"isTypedef": true,
"staticSize": 24,
"dynamicSize": 1024,
"exclusiveSize": 0,
"members": [
{
"staticSize": 24,
"dynamicSize": 1024,
"exclusiveSize": 1048,
"length": 1024,
"capacity": 1024,
"elementStaticSize": 1
}
]
}
]
'''
Implement Container V2 for fbstring
2023-09-27 23:19:51 +01:00
expect_json_v2 = '''[{
"typeNames": ["folly::basic_fbstring<int8_t, std::char_traits<int8_t>, std::allocator<int8_t>, folly::fbstring_core<int8_t>>"],
"staticSize": 24,
"exclusiveSize": 1056,
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": 1056,
Implement Container V2 for fbstring
2023-09-27 23:19:51 +01:00
"length": 1024,
"capacity": 1024
}]'''
[cases.string_pooled_shared]
param_types = ["std::pair<folly::fbstring, folly::fbstring>&"]
setup = """
folly::fbstring s(1024, 'c');
return {{s, s}};
"""
expect_json_v2 = '''[{
"staticSize": 48,
"exclusiveSize": 0,
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": 1080,
Implement Container V2 for fbstring
2023-09-27 23:19:51 +01:00
"members": [
{
"typeNames": ["folly::basic_fbstring<int8_t, std::char_traits<int8_t>, std::allocator<int8_t>, folly::fbstring_core<int8_t>>"],
"staticSize": 24,
"exclusiveSize": 1056,
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": 1056,
Implement Container V2 for fbstring
2023-09-27 23:19:51 +01:00
"length": 1024,
"capacity": 1024
}, {
"typeNames": ["folly::basic_fbstring<int8_t, std::char_traits<int8_t>, std::allocator<int8_t>, folly::fbstring_core<int8_t>>"],
"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 fbstring
2023-09-27 23:19:51 +01:00
"length": 1024,
"capacity": 1024
}
]
}]'''
Reference in New Issue Copy Permalink