Add GitHub Action to publish package and remove unstable features

.github/workflows/publish.yml

@@ -0,0 +1,20 @@
+name: Publish package
+
+on:
+  release:
+    types: [ published ]
+
+env:
+  CARGO_REGISTRY_TOKEN: ${{ secrets.CARGO_REGISTRY_TOKEN }}
+
+jobs:
+  cargo_publish:
+    name: Publish to crates.io
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v3
+        with:
+          submodules: recursive
+
+      - name: Publish to crates.io
+        run: cargo publish

.github/workflows/rust.yml

@@ -30,13 +30,6 @@ jobs:
           restore-keys: |
             ${{ runner.os }}-cargo-registry-
 
-      - name: Install Rust toolchain
-        uses: actions-rs/toolchain@v1
-        with:
-          profile: minimal
-          toolchain: nightly
-          override: true
-
       - name: Build
         run: cargo build
 

Cargo.toml

@@ -19,6 +19,7 @@ anyhow = "1.0"
 #aperture-lens = { git = "https://github.com/Aperture-Finance/Aperture-Lens", branch = "main" }
 ethers = { version = "2.0", features = ["default"] }
 num-bigint = "0.4.4"
+num-integer = "0.1.45"
 num-traits = "0.2.17"
 once_cell = "1.19.0"
 ruint = "1.11.1"

src/lib.rs

@@ -1,5 +1,3 @@
-#![feature(int_roundings)]
-#![feature(is_sorted)]
 //! # uniswap-v3-sdk
 //!
 //! A Rust SDK for building applications on top of Uniswap V3.

src/utils/nearest_usable_tick.rs

@@ -1,4 +1,5 @@
 use super::tick_math::{MAX_TICK, MIN_TICK};
+use num_integer::Integer;
 
 /// Returns the closest tick that is nearest a given tick and usable for the given tick spacing
 ///
@@ -9,11 +10,11 @@ use super::tick_math::{MAX_TICK, MIN_TICK};
 ///
 /// returns: i32
 ///
-pub const fn nearest_usable_tick(tick: i32, tick_spacing: i32) -> i32 {
+pub fn nearest_usable_tick(tick: i32, tick_spacing: i32) -> i32 {
     assert!(tick_spacing > 0, "TICK_SPACING");
-    assert!(tick >= MIN_TICK && tick <= MAX_TICK, "TICK_BOUND");
-    let rounded = tick.div_floor(tick_spacing) * tick_spacing;
-    let rounded = rounded + (tick - rounded + tick_spacing / 2) / tick_spacing * tick_spacing;
+    assert!((MIN_TICK..=MAX_TICK).contains(&tick), "TICK_BOUND");
+    let (quotient, remainder) = tick.div_mod_floor(&tick_spacing);
+    let rounded = (quotient + (remainder + tick_spacing / 2) / tick_spacing) * tick_spacing;
     if rounded < MIN_TICK {
         rounded + tick_spacing
     } else if rounded > MAX_TICK {

src/utils/tick_list.rs

@@ -1,4 +1,5 @@
 use crate::entities::TickTrait;
+use num_integer::Integer;
 
 /// Utility methods for interacting with sorted lists of self
 pub trait TickList<T: TickTrait> {
@@ -37,7 +38,11 @@ impl<T: TickTrait> TickList<T> for [T] {
             self.iter().all(|x| x.index() % tick_spacing == 0),
             "TICK_SPACING"
         );
-        assert!(self.is_sorted(), "SORTED");
+        for i in 1..self.len() {
+            if self[i] < self[i - 1] {
+                panic!("SORTED");
+            }
+        }
         assert_eq!(
             self.iter().fold(0, |acc, x| acc + x.liquidity_net()),
             0,
@@ -107,7 +112,7 @@ impl<T: TickTrait> TickList<T> for [T] {
         lte: bool,
         tick_spacing: i32,
     ) -> (i32, bool) {
-        let compressed = tick.div_floor(tick_spacing);
+        let (compressed, _) = tick.div_mod_floor(&tick_spacing);
         if lte {
             let word_pos = compressed >> 8;
             let minimum = (word_pos << 8) * tick_spacing;