{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":86868560,"defaultBranch":"dev","name":"TileDB","ownerLogin":"TileDB-Inc","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2017-03-31T23:44:23.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/26827816?v=4","public":true,"private":false,"isOrgOwned":true},"refInfo":{"name":"","listCacheKey":"v0:1714650366.0","currentOid":""},"activityList":{"items":[{"before":null,"after":"26ec27ad0ab5792d6e373d89c6e5e03f73a87b37","ref":"refs/heads/backport-4924-to-release-2.23","pushedAt":"2024-05-02T11:46:06.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"teo-tsirpanis","name":"Theodore Tsirpanis","path":"/teo-tsirpanis","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12659251?s=80&v=4"},"commit":{"message":"Fix wrong fallback cell order for Hilbert. (#4924)\n\nThis fixes the fallback cell order for the Hilbert order on writes. When\r\nthe domain is too large and that cells cannot be differentiated by the\r\nHilbert number because we don't have enough bits per dimensions, we\r\nshould fallback to row major cell ordering. A missing condition made us\r\nfallback to column order ordering.\r\n\r\n[sc-44758]\r\n\r\n---\r\nTYPE: BUG\r\nDESC: Fix wrong fallback cell order for Hilbert.","shortMessageHtmlLink":"Fix wrong fallback cell order for Hilbert. (<a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"2271978386\" data-permission-text=\"Title is private\" data-url=\"https://github.com/TileDB-Inc/TileDB/issues/4924\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/TileDB-Inc/TileDB/pull/4924/hovercard\" href=\"https://github.com/TileDB-Inc/TileDB/pull/4924\">#4924</a>)"}},{"before":null,"after":"de2217ab51089ebd3d54773303f1a7f504a27501","ref":"refs/heads/lr/fix-nightlies-ext-sort-2/sc-46464","pushedAt":"2024-05-02T08:27:21.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"},"commit":{"message":"Fix nightlies after external sort merges.\n\n[sc-46464]\n\nTYPE: NO_HISTORY\nDESC: Fix nightlies after external sort merges.","shortMessageHtmlLink":"Fix nightlies after external sort merges."}},{"before":null,"after":"c18ec58cac920a71fd10a30adade44344beabdeb","ref":"refs/heads/lr/hdfs-to/sc-46559","pushedAt":"2024-05-02T08:19:56.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"},"commit":{"message":"Increase HDFS timeout.\n\nIncrease HDFS timeout to fix nightly build.\n\n[sc-44172]\n\n---\nTYPE: NO_HISTORY\nDESC: Increase HDFS timeout.","shortMessageHtmlLink":"Increase HDFS timeout."}},{"before":null,"after":"6c8e24297d3dd7ee7dbd5e062b05f00be9213c80","ref":"refs/heads/al/proxy-sort-permutation/sc-44172","pushedAt":"2024-05-02T08:07:39.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"},"commit":{"message":"Implement proxy sort permutation for external sort.\n\nThis PR implements proxy sorting for `permutation_view`.  The goal is to be able to efficiently sort a `zip_view` containing a number of ranges.\n\nWith the PR, we can sort a zipped `permutation_view` as follows:\n```c++\n  auto z = zip(u, v, w, x);\n  auto p = permutation_view(z);\n  sort(p);\n```\nresulting in `z` being sorted along `u` (then `v`, etc).\n\nBecause the iterator for `permutation_view` only returns a value, with no information about the index, we can't sort a `permutation_view` directly with, e.g., `std::sort`.  To enable sorting, we instead provide sorting member functions to the `permutation_view` and have free functions that are overloaded on `permutation_view`  invoke the member functions.\n\nThe functions added include\n* proxy sort member functions in `permutation_view` with `_no_init`, `stable_`, and comparison function variants.\n* proxy sort free functions overloaded on `permutation_view` with variants as above\n* Overloads of `std::sort` and `std::stable_sort`.  These invoke the `no_init` member function, the assumption being that we just want to stack permutations on top of each other.\n\nSince the `proxy_sort` functions mutate the indexes in the `permutation_view`, the interfaces to the existing `proxy_sort` function were updated to take a forwarding reference.\n\nA few notes:\n* Sorting a `permutation_view` will mutate the underlying permutation index range.  Right now, the permutation view is just a view over two containers (the one to be permuted and the permutation itself).  Sorting the `permutation_view` will change the ordering of the container passed in to the constructor.\n* When sorting a `permutation_view` with a tuple value type, the sorting will be done with the built-in tuple comparator.  We may want to add variants that let us specify which members to sort on (using indexes passed in as variadic template parameters). However, using a specialized comparator is probably good enough.\n\n---\nTYPE: IMPROVEMENT\nDESC: Implement proxy sort permutation for external sort.","shortMessageHtmlLink":"Implement proxy sort permutation for external sort."}},{"before":"5678ae9f019aa91ee189d3d897bee49dda1148d9","after":"ec5e54520751b0ad98ca819d170eb81fdb58bfa5","ref":"refs/heads/al/iter-swap/sc-43640","pushedAt":"2024-05-02T07:57:20.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"},"commit":{"message":"Write iter_swap for zip_view for external sort.\n\nThis PR stacks on #4930.  The actual code for implementing the PR is fairly small, but with extensive unit tests.\n\nThe PR contains `swap` function for `zip_view` in order to be able to use `std::sort` on a `zip_view`.  The difficulty is that dereferencing a `zip_view` iterator returns a proxy, specifically a tuple of references.  In order to enable `swap` to be found for this via ADL, we write\n```c++\ntemplate <class... Ts>\n  requires(std::is_swappable<Ts>::value && ...)\nvoid swap(std::tuple<Ts...>&& x, std::tuple<Ts...>&& y) {\n  using std::get;\n  using std::swap;\n  [&]<std::size_t... i>(std::index_sequence<i...>) {\n    (swap(get<i>(x), get<i>(y)), ...);\n  }(std::make_index_sequence<sizeof...(Ts)>());\n}\n```\nand then put it into the `std` namespace:\n```c++\nnamespace std {\nusing ::swap;\n}\n```\n\nThe provided unit tests exercise `swap`, `iter_swap`, and `sort`, including on `zip_view`s containing `alt_var_length_view`s.\n\n(NOTE:  I didn't specifically write an `item_swap` as `std::iter_swap` falls back to `swap`.)\n\nThe PR also changes `alt_var_length_view` and `zip_view` to derive from `std::ranges::view_interface` rather than `std::ranges::view_base` in order to automagically get `operator[]` for the view.\n\nNOTES:\n1. Not all implementations of `std::sort` use `std::swap` for all problem sizes, but will use insertion sort instead for small sizes.\n2. For insertion sort to work properly with a tuple of references, i.e., a proxy, it is important to get all of the details of `value_type` and `reference` correct.  There was a bug that took a while to track down of `value_type` not being defined in the `zip_iterator`.  The `iterator_facade` will create the wrong default thing.\n\n---\nTYPE: IMPROVEMENT\nDESC: Write iter_swap for zip_view for external sort.","shortMessageHtmlLink":"Write iter_swap for zip_view for external sort."}},{"before":"af175e808f77b5b6c3db19b44e628cb5a7e80718","after":"d861e95970846254671b384856f4ee06b031696a","ref":"refs/heads/dev","pushedAt":"2024-05-02T07:56:13.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"},"commit":{"message":"Implement zip_view for external sort. (#4930)\n\nThis PR implements a `zip_view` for zipping together a set of ranges. It\r\nis intended to implement the `std::ranges::zip_view` as defined for\r\nC++23. From\r\n https://en.cppreference.com/w/cpp/ranges/zip_view:\r\n1. A zip_view is a range adaptor that takes one or more views, and\r\nproduces a view whose ith element is a tuple-like value consisting of\r\nthe ith elements of all views. The size of produced view is the minimum\r\nof sizes of all adapted views.\r\n2. `zip()` is a customization point object that constructs a `zip_view`\r\n\r\nCurrently, the `zip_view` only supports zipping together ranges that are\r\n`random_access_range`s. In addition, the `size()` and `end()` functions\r\nare only provided if all of the ranges are `sized_range`s\r\n\r\nThe iterator from a `zip_view` is essentially a tuple of pointers to the\r\nbeginning of each of the zipped ranges, plus an index that keeps track\r\nof the iterator's location in the zipped ranges. The size of a\r\n`zip_view` is the size of the smallest range. The end iterator of a zip\r\nview is the begin iterator plus the size of the zip_view.\r\n\r\nUnit tests have similar coverage to the tests for the var length views.\r\nTests also include zipping a var length view and iterating through with\r\n`std::for_each` and `for`.\r\n\r\n[sc-43639]\r\n\r\n---\r\nTYPE: IMPROVEMENT\r\nDESC: Implement zip_view for external sort.","shortMessageHtmlLink":"Implement zip_view for external sort. (<a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"2273778940\" data-permission-text=\"Title is private\" data-url=\"https://github.com/TileDB-Inc/TileDB/issues/4930\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/TileDB-Inc/TileDB/pull/4930/hovercard\" href=\"https://github.com/TileDB-Inc/TileDB/pull/4930\">#4930</a>)"}},{"before":"9b03531bd1afba0db3eb3251ee956c087b29b7be","after":null,"ref":"refs/heads/al/zip-view/sc43639","pushedAt":"2024-05-02T07:56:13.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"}},{"before":"493dba0adf2a37a13ef6d82b6f9b26222dbe901a","after":"5678ae9f019aa91ee189d3d897bee49dda1148d9","ref":"refs/heads/al/iter-swap/sc-43640","pushedAt":"2024-05-02T07:39:00.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"},"commit":{"message":"Write iter_swap for zip_view for external sort.\n\nThis PR stacks on #4930.  The actual code for implementing the PR is fairly small, but with extensive unit tests.\n\nThe PR contains `swap` function for `zip_view` in order to be able to use `std::sort` on a `zip_view`.  The difficulty is that dereferencing a `zip_view` iterator returns a proxy, specifically a tuple of references.  In order to enable `swap` to be found for this via ADL, we write\n```c++\ntemplate <class... Ts>\n  requires(std::is_swappable<Ts>::value && ...)\nvoid swap(std::tuple<Ts...>&& x, std::tuple<Ts...>&& y) {\n  using std::get;\n  using std::swap;\n  [&]<std::size_t... i>(std::index_sequence<i...>) {\n    (swap(get<i>(x), get<i>(y)), ...);\n  }(std::make_index_sequence<sizeof...(Ts)>());\n}\n```\nand then put it into the `std` namespace:\n```c++\nnamespace std {\nusing ::swap;\n}\n```\n\nThe provided unit tests exercise `swap`, `iter_swap`, and `sort`, including on `zip_view`s containing `alt_var_length_view`s.\n\n(NOTE:  I didn't specifically write an `item_swap` as `std::iter_swap` falls back to `swap`.)\n\nThe PR also changes `alt_var_length_view` and `zip_view` to derive from `std::ranges::view_interface` rather than `std::ranges::view_base` in order to automagically get `operator[]` for the view.\n\nNOTES:\n1. Not all implementations of `std::sort` use `std::swap` for all problem sizes, but will use insertion sort instead for small sizes.\n2. For insertion sort to work properly with a tuple of references, i.e., a proxy, it is important to get all of the details of `value_type` and `reference` correct.  There was a bug that took a while to track down of `value_type` not being defined in the `zip_iterator`.  The `iterator_facade` will create the wrong default thing.\n\n---\nTYPE: IMPROVEMENT\nDESC: Write iter_swap for zip_view for external sort.","shortMessageHtmlLink":"Write iter_swap for zip_view for external sort."}},{"before":null,"after":"493dba0adf2a37a13ef6d82b6f9b26222dbe901a","ref":"refs/heads/al/iter-swap/sc-43640","pushedAt":"2024-05-02T07:34:19.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"},"commit":{"message":"Write iter_swap for zip_view for external sort.\n\nThis PR stacks on #4930.  The actual code for implementing the PR is fairly small, but with extensive unit tests.\n\nThe PR contains `swap` function for `zip_view` in order to be able to use `std::sort` on a `zip_view`.  The difficulty is that dereferencing a `zip_view` iterator returns a proxy, specifically a tuple of references.  In order to enable `swap` to be found for this via ADL, we write\n```c++\ntemplate <class... Ts>\n  requires(std::is_swappable<Ts>::value && ...)\nvoid swap(std::tuple<Ts...>&& x, std::tuple<Ts...>&& y) {\n  using std::get;\n  using std::swap;\n  [&]<std::size_t... i>(std::index_sequence<i...>) {\n    (swap(get<i>(x), get<i>(y)), ...);\n  }(std::make_index_sequence<sizeof...(Ts)>());\n}\n```\nand then put it into the `std` namespace:\n```c++\nnamespace std {\nusing ::swap;\n}\n```\n\nThe provided unit tests exercise `swap`, `iter_swap`, and `sort`, including on `zip_view`s containing `alt_var_length_view`s.\n\n(NOTE:  I didn't specifically write an `item_swap` as `std::iter_swap` falls back to `swap`.)\n\nThe PR also changes `alt_var_length_view` and `zip_view` to derive from `std::ranges::view_interface` rather than `std::ranges::view_base` in order to automagically get `operator[]` for the view.\n\nNOTES:\n1. Not all implementations of `std::sort` use `std::swap` for all problem sizes, but will use insertion sort instead for small sizes.\n2. For insertion sort to work properly with a tuple of references, i.e., a proxy, it is important to get all of the details of `value_type` and `reference` correct.  There was a bug that took a while to track down of `value_type` not being defined in the `zip_iterator`.  The `iterator_facade` will create the wrong default thing.\n\n---\nTYPE: IMPROVEMENT\nDESC: Write iter_swap for zip_view for external sort.","shortMessageHtmlLink":"Write iter_swap for zip_view for external sort."}},{"before":"2d50d985cf595f1ac49287129082df1a24d0f44c","after":"af175e808f77b5b6c3db19b44e628cb5a7e80718","ref":"refs/heads/dev","pushedAt":"2024-05-02T07:31:28.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"},"commit":{"message":"Fix the documentation for the `array_schema` object library (#4935)\n\nThis change removes any confusion that in its present state the\r\n`array_schema` object library is not properly specified as a\r\nfreestanding library capable of resolving all its symbols without\r\nadditional external dependencies.\r\n\r\n[sc-46557]\r\n\r\n---\r\nTYPE: NO_HISTORY\r\nDESC: Fix the documentation for the `array_schema` object library","shortMessageHtmlLink":"Fix the documentation for the <code>array_schema</code> object library (<a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"2274235070\" data-permission-text=\"Title is private\" data-url=\"https://github.com/TileDB-Inc/TileDB/issues/4935\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/TileDB-Inc/TileDB/pull/4935/hovercard\" href=\"https://github.com/TileDB-Inc/TileDB/pull/4935\">#4935</a>)"}},{"before":"81e9d6792f779eb902c09aa4c051c3e14b49aebf","after":null,"ref":"refs/heads/eh/fix-documentation-array-schema-OL","pushedAt":"2024-05-02T07:31:28.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"}},{"before":"b30588f7efe6cb36ee46f23eeefe374e0d6f0c1b","after":null,"ref":"refs/heads/teo/experimental-apis","pushedAt":"2024-05-02T07:12:56.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"}},{"before":"9671bad645fdeaaa483182340be14ed506fa60d2","after":"2d50d985cf595f1ac49287129082df1a24d0f44c","ref":"refs/heads/dev","pushedAt":"2024-05-02T07:12:55.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"},"commit":{"message":"Move several APIs out of experimental. (#4919)\n\n[SC-46300](https://app.shortcut.com/tiledb-inc/story/46300)\r\n[SC-46301](https://app.shortcut.com/tiledb-inc/story/46301)\r\n\r\nThis PR moves the following C APIs (and their C++ equivalents) to\r\nstable:\r\n\r\n* `tiledb_group_*`\r\n* `tiledb_array_delete`\r\n* `tiledb_array_delete_array`\r\n* `tiledb_array_upgrade_version`\r\n\r\nThe changes are simply moving code around.\r\n\r\n---\r\nTYPE: C_API\r\nDESC: Experimental APIs related to groups, deleting arrays and upgrading\r\nthe format version of arrays were moved to stable. You can use them\r\nwithout including `<tiledb_experimental.h>`.\r\n\r\n---\r\nTYPE: CPP_API\r\nDESC: The experimental `Group` class was moved to stable. You can use it\r\nwithout including `<tiledb_experimental>`.","shortMessageHtmlLink":"Move several APIs out of experimental. (<a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"2269562159\" data-permission-text=\"Title is private\" data-url=\"https://github.com/TileDB-Inc/TileDB/issues/4919\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/TileDB-Inc/TileDB/pull/4919/hovercard\" href=\"https://github.com/TileDB-Inc/TileDB/pull/4919\">#4919</a>)"}},{"before":"107d496840bcfba5dd1a25c8c3893e36de1e651c","after":"9b03531bd1afba0db3eb3251ee956c087b29b7be","ref":"refs/heads/al/zip-view/sc43639","pushedAt":"2024-05-02T07:05:53.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"},"commit":{"message":"Implement zip_view for external sort.\n\nThis PR implements a `zip_view` for zipping together a set of ranges.\nIt is intended to implement the `std::ranges::zip_view` as defined for C++23.  From\n https://en.cppreference.com/w/cpp/ranges/zip_view:\n 1.  A zip_view is a range adaptor that takes one or more views, and produces\n a view whose ith element is a tuple-like value consisting of the ith elements\n of all views. The size of produced view is the minimum of sizes of all\n adapted views.\n  2. `zip()` is a customization point object that constructs a\n `zip_view`\n\nCurrently, the `zip_view` only supports zipping together ranges that are `random_access_range`s.  In addition, the `size()` and `end()` functions are only provided if all of the ranges are `sized_range`s\n\nThe iterator from a `zip_view` is essentially a tuple of pointers to the beginning of each of the zipped ranges, plus an index that keeps track of the iterator's location in the zipped ranges.  The size of a `zip_view` is the size of the smallest range.  The end iterator of a zip view is the begin iterator plus the size of the zip_view.\n\nUnit tests have similar coverage to the tests for the var length views.  Tests also include zipping a var length view and iterating through with `std::for_each` and `for`.\n\n---\nTYPE: IMPROVEMENT\nDESC: Implement zip_view for external sort.","shortMessageHtmlLink":"Implement zip_view for external sort."}},{"before":"a4602138559f1972299eb21be96073d134010568","after":"090915e75f5f35fcd903f520087cb8412dd3fbbc","ref":"refs/heads/lr/hist-2.23.0-rc0","pushedAt":"2024-05-02T07:04:08.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"},"commit":{"message":"Update history for 2.23.0-rc0.\n\n---\nTYPE: NO_HISTORY\nDESC: Update history for 2.23.0-rc0.","shortMessageHtmlLink":"Update history for 2.23.0-rc0."}},{"before":"76191be82cd9a50e0abcab1b7241de0e0cefaedc","after":"a4602138559f1972299eb21be96073d134010568","ref":"refs/heads/lr/hist-2.23.0-rc0","pushedAt":"2024-05-02T07:00:28.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"},"commit":{"message":"Update history for 2.23.0-rc0.\n\n---\nTYPE: NO_HISTORY\nDESC: Update history for 2.23.0-rc0.","shortMessageHtmlLink":"Update history for 2.23.0-rc0."}},{"before":"f14d643848d0d8cdd15a6ec79e12943a51250a14","after":null,"ref":"refs/heads/rd/sm_array_migrations-non_empty_domain_from_name","pushedAt":"2024-05-02T05:51:53.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"}},{"before":"c3b45ab9624f34ee99e5a54f8dd46e24d738ba4f","after":"9671bad645fdeaaa483182340be14ed506fa60d2","ref":"refs/heads/dev","pushedAt":"2024-05-02T05:51:53.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"},"commit":{"message":"Migrate Array APIs out of StorageManager: non_empty_domain_*_from_name. (#4910)\n\nMigrate `Array` APIs out of `StorageManager`:\r\n`non_empty_domain_*_from_name`.\r\n\r\nThis includes 3 separate APIs:\r\n* `non_empty_domain_from_name`\r\n* `non_empty_domain_var_size_from_name`\r\n* `non_empty_domain_var_from_name`\r\n\r\n---\r\n[sc-44990]\r\n[sc-44992]\r\n[sc-44994]\r\n\r\n---\r\nTYPE: IMPROVEMENT\r\nDESC: Migrate Array APIs out of StorageManager:\r\nnon_empty_domain_*_from_name.","shortMessageHtmlLink":"Migrate Array APIs out of StorageManager: non_empty_domain_*_from_nam…"}},{"before":"15acb168266ed2bfdf3ec360a2c82490b26b2523","after":null,"ref":"refs/heads/rbin/broken_unit_build","pushedAt":"2024-05-01T21:59:29.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"}},{"before":"bc57250f1b64d6481fc722d53cd3dd5c0e5bd8bd","after":"c3b45ab9624f34ee99e5a54f8dd46e24d738ba4f","ref":"refs/heads/dev","pushedAt":"2024-05-01T21:59:28.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"},"commit":{"message":"Fix broken unit build on macos. (#4932)\n\nThis fixes\r\n```\r\nunit_iterator_facade.cc:625:22: error: missing 'typename' prior to dependent type name 'std::iterator_tra\r\nits<iterator>::value_type'                                                                                                                                    \r\n  using value_type = std::iterator_traits<iterator>::value_type; \r\n ```\r\nwhich I got building units on my macos.\r\n\r\n[sc-46539]\r\n\r\n---\r\nTYPE: NO_HISTORY\r\nDESC: Fix broken unit build on macos.","shortMessageHtmlLink":"Fix broken unit build on macos. (<a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"2273824815\" data-permission-text=\"Title is private\" data-url=\"https://github.com/TileDB-Inc/TileDB/issues/4932\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/TileDB-Inc/TileDB/pull/4932/hovercard\" href=\"https://github.com/TileDB-Inc/TileDB/pull/4932\">#4932</a>)"}},{"before":"4ddfad513f38464ddb2af28df8e5df302cf1baf7","after":null,"ref":"refs/heads/de/sc-46532/add_algorithms_header","pushedAt":"2024-05-01T21:36:08.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"}},{"before":"60bd1d08d61d267b8cf0caa0a8e1c57679451f8e","after":"bc57250f1b64d6481fc722d53cd3dd5c0e5bd8bd","ref":"refs/heads/dev","pushedAt":"2024-05-01T21:36:07.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"},"commit":{"message":"Add missing include required by std::copy_n use. (#4931)\n\nUse of `std::copy_n`, added in #4915, requires adding the `algorithms`\r\nheader under `g++` compilation\r\n\r\n[sc-46538]\r\n\r\n---\r\nTYPE: NO_HISTORY\r\nDESC: Add `algorithms` header for `std::copy_n`","shortMessageHtmlLink":"Add missing include required by std::copy_n use. (<a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"2273817822\" data-permission-text=\"Title is private\" data-url=\"https://github.com/TileDB-Inc/TileDB/issues/4931\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/TileDB-Inc/TileDB/pull/4931/hovercard\" href=\"https://github.com/TileDB-Inc/TileDB/pull/4931\">#4931</a>)"}},{"before":null,"after":"81e9d6792f779eb902c09aa4c051c3e14b49aebf","ref":"refs/heads/eh/fix-documentation-array-schema-OL","pushedAt":"2024-05-01T21:33:04.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"eric-hughes-tiledb","name":null,"path":"/eric-hughes-tiledb","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/82400964?s=80&v=4"},"commit":{"message":"Fix the documentation for the `array_schema` object library\n\nThis change removes any confusion that in its present state the `array_schema` object library is not properly specified as a freestanding library capable of resolving all its symbols without additional external dependencies.","shortMessageHtmlLink":"Fix the documentation for the <code>array_schema</code> object library"}},{"before":"5db589a060acf54fdb65755d40d020533c34fa75","after":"373ca5b26095c878a4711785e04809cb944805df","ref":"refs/heads/rd/sm-array-migrations-delete_fragments","pushedAt":"2024-05-01T20:47:06.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"bekadavis9","name":"Beka Davis","path":"/bekadavis9","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/31743465?s=80&v=4"},"commit":{"message":"Migrate delete_array and delete_fragments from StorageManager to Array.","shortMessageHtmlLink":"Migrate delete_array and delete_fragments from StorageManager to Array."}},{"before":"18a38e207748caf7d2910c6b1664403381da74f0","after":"f14d643848d0d8cdd15a6ec79e12943a51250a14","ref":"refs/heads/rd/sm_array_migrations-non_empty_domain_from_name","pushedAt":"2024-05-01T20:07:21.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"bekadavis9","name":"Beka Davis","path":"/bekadavis9","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/31743465?s=80&v=4"},"commit":{"message":"Rebase & address comments.","shortMessageHtmlLink":"Rebase &amp; address comments."}},{"before":"3a88d3cb2b97922cb1f942e5514df8802e50af3f","after":"60bd1d08d61d267b8cf0caa0a8e1c57679451f8e","ref":"refs/heads/dev","pushedAt":"2024-05-01T18:57:01.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"},"commit":{"message":"Migrate Array APIs out of StorageManager: non_empty_domain_*_from_index. (#4909)\n\nMigrate `Array` APIs out of `StorageManager`:\r\n`non_empty_domain_*_from_index`.\r\n\r\nThis includes 3 separate APIs:\r\n* `non_empty_domain_from_index`\r\n* `non_empty_domain_var_size_from_index`\r\n* `non_empty_domain_var_from_index`\r\n\r\n---\r\n[sc-44989]\r\n[sc-44991]\r\n[sc-44993]\r\n\r\n---\r\nTYPE: NO_HISTORY\r\nDESC: Migrate Array APIs out of StorageManager:\r\nnon_empty_domain_*_from_index.","shortMessageHtmlLink":"Migrate Array APIs out of StorageManager: non_empty_domain_*_from_ind…"}},{"before":"670462bd3fceb2273fbc60f6fdabb8b9412af006","after":null,"ref":"refs/heads/rd/sm_array_migrations-non_empty_domain_from_index","pushedAt":"2024-05-01T18:57:01.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"}},{"before":null,"after":"76191be82cd9a50e0abcab1b7241de0e0cefaedc","ref":"refs/heads/lr/hist-2.23.0-rc0","pushedAt":"2024-05-01T18:08:09.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"},"commit":{"message":"Update history for 2.23.0-rc0.\n\n---\nTYPE: NO_HISTORY\nDESC: Update history for 2.23.0-rc0.","shortMessageHtmlLink":"Update history for 2.23.0-rc0."}},{"before":"b513bb387331248b4f8c66b94676ca201b66c263","after":"a95c2a3c3cc75a6d0ed562569cbbfac653d71ceb","ref":"refs/heads/gh-pages","pushedAt":"2024-05-01T18:05:32.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Built site for gh-pages","shortMessageHtmlLink":"Built site for gh-pages"}},{"before":"fb28835c5f9fb9b3eb5e8cf21cc4cf2046c8ef01","after":null,"ref":"refs/heads/al/additional-constructors/ch44576","pushedAt":"2024-05-01T18:00:34.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"KiterLuc","name":null,"path":"/KiterLuc","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67824247?s=80&v=4"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEP7v3egA","startCursor":null,"endCursor":null}},"title":"Activity · TileDB-Inc/TileDB"}