Add inSorted to LibSort

src/utils/LibSort.sol

@@ -249,6 +249,21 @@ library LibSort {
         (found, index) = _searchSorted(_toUints(a), uint256(uint160(needle)), 0);
     }
 
+    /// @dev Returns whether `a` contains `needle`.
+    function inSorted(uint256[] memory a, uint256 needle) internal pure returns (bool found) {
+        (found,) = searchSorted(a, needle);
+    }
+
+    /// @dev Returns whether `a` contains `needle`.
+    function inSorted(int256[] memory a, int256 needle) internal pure returns (bool found) {
+        (found,) = searchSorted(a, needle);
+    }
+
+    /// @dev Returns whether `a` contains `needle`.
+    function inSorted(address[] memory a, address needle) internal pure returns (bool found) {
+        (found,) = searchSorted(a, needle);
+    }
+
     /// @dev Reverses the array in-place.
     function reverse(uint256[] memory a) internal pure {
         /// @solidity memory-safe-assembly

test/LibSort.t.sol

@@ -440,6 +440,9 @@ contract LibSortTest is SoladyTest {
             uint256 randomIndex = _random() % a.length;
             uint256 value = a[randomIndex];
             (bool found, uint256 index) = LibSort.searchSorted(a, value);
+            if (_randomChance(16)) {
+                assertEq(LibSort.inSorted(a, value), found);
+            }
             assertTrue(found);
             assertEq(a[index], value);
         }