Bump versions (#128)

* bump versions

* now format

* coping over changes which fixed cppcheck

* fix

* trying this

* another fix

* fix clang tidy

* remove bitset actually

* remove

Author: lrvideckis

.github/workflows/programming_team_code_ci.yml

@@ -39,7 +39,7 @@ jobs:
         sudo apt install -y wget software-properties-common
         wget -O - https://apt.llvm.org/llvm.sh | sudo bash
     - name: Install dependencies
-      run: sudo apt update && sudo apt install -y clang-format-18 cppcheck
+      run: sudo apt update && sudo apt install -y clang-format-19 cppcheck
     - name: checks format then lints
       run: make --directory=tests/ check_format_lint
 
@@ -53,7 +53,7 @@ jobs:
         sudo apt install -y wget software-properties-common
         wget -O - https://apt.llvm.org/llvm.sh | sudo bash
     - name: Install dependencies
-      run: sudo apt update && sudo apt install -y clang-tidy-18
+      run: sudo apt update && sudo apt install -y clang-tidy-19
     - name: clang-tidy
       run: make --directory=tests/ clangtidy
 
@@ -68,8 +68,10 @@ jobs:
     runs-on: ubuntu-latest
     steps:
     - uses: actions/checkout@v2
+    - name: Set up LLVM repository
+      run: wget -qO- https://apt.llvm.org/llvm.sh | sudo bash -s -- 19
     - name: Install dependencies
-      run: wget -qO- https://apt.llvm.org/llvm.sh | sudo bash -s -- 18
+      run: sudo apt update && sudo apt install -y clang-19
     - name: Compile all tests
       run: make --directory=tests/ compile_clang
 
@@ -88,10 +90,11 @@ jobs:
       run: |
         sudo apt update
         sudo apt install texlive texlive-latex-extra rename nodejs npm
-        wget -qO- https://apt.llvm.org/llvm.sh | sudo bash -s -- 18
+        wget -qO- https://apt.llvm.org/llvm.sh | sudo bash -s -- 19
+        sudo apt update && sudo apt install -y clang-19
     - name: build ptc
       run: make --directory=tests/ ptc
-    - uses: actions/upload-artifact@v3
+    - uses: actions/upload-artifact@v4
       with:
         name: ptc
         path: tests/ptc.pdf
@@ -102,7 +105,7 @@ jobs:
     if: github.ref == 'refs/heads/dev' && github.event_name == 'push'
     steps:
     - uses: actions/checkout@v2
-    - uses: actions/download-artifact@v3
+    - uses: actions/download-artifact@v4
       with:
         name: ptc
         path: tests/ptc.pdf
@@ -126,7 +129,7 @@ jobs:
         sudo apt install -y wget software-properties-common
         wget -O - https://apt.llvm.org/llvm.sh | sudo bash
     - name: Install dependencies
-      run: sudo apt update && sudo apt install -y clang-format-18
+      run: sudo apt update && sudo apt install -y clang-format-19
     - name: Combine includes and force push to main branch
       run: |
         git config --local user.name github-actions

library/contest/dynamic_bitset.hpp

@@ -34,7 +34,7 @@ template<class DS, class... ARGS> struct pq_updates {
     vector<upd> extra;
     int idx = sz(upd_st) - 1, lowest_pri = INT_MAX;
     for (auto it = rbegin(mp);
-         2 * sz(extra) < sz(upd_st) - idx; it++) {
+      2 * sz(extra) < sz(upd_st) - idx; it++) {
       auto [pri, idx_sk] = *it;
       extra.push_back(upd_st[idx_sk]);
       idx = min(idx, idx_sk), lowest_pri = pri;

library/data_structures/uncommon/priority_queue_of_updates.hpp

@@ -5,4 +5,4 @@
 //! @time O(n choose k)
 //! @space O(1)
 for (int mask = (1 << k) - 1; mask < (1 << n);
-     mask = next_subset(mask))
+  mask = next_subset(mask))

library/loops/chooses.hpp

@@ -5,4 +5,4 @@
 //!   of every mask of size n
 //! @space O(1)
 for (int submask = mask; submask;
-     submask = (submask - 1) & mask)
+  submask = (submask - 1) & mask)

library/loops/submasks.hpp

@@ -6,4 +6,4 @@
 //!   of every mask of size n
 //! @space O(1)
 for (int supermask = mask; supermask < (1 << n);
-     supermask = (supermask + 1) | mask)
+  supermask = (supermask + 1) | mask)

library/loops/supermasks.hpp

@@ -12,7 +12,7 @@ vector<ll> partitions(int n) {
   rep(i, 1, n) {
     ll sum = 0;
     for (int j = 1, pent = 1, sign = 1; pent <= i;
-         j++, pent += 3 * j - 2, sign = -sign) {
+      j++, pent += 3 * j - 2, sign = -sign) {
       if (pent + j <= i)
         sum += dp[i - pent - j] * sign + mod;
       sum += dp[i - pent] * sign + mod;

library/math/partitions.hpp

@@ -4,4 +4,4 @@
 vi mobius(100'005);
 mobius[1] = 1;
 rep(i, 1, sz(mobius)) for (int j = i + i; j < sz(mobius);
-                           j += i) mobius[j] -= mobius[i];
+  j += i) mobius[j] -= mobius[i];

library/math/prime_sieve/mobius.hpp

@@ -24,7 +24,6 @@
 vi cart_binary_tree(const vi& l) {
   vi p(l);
   rep(i, 0, sz(p)) for (int j = i - 1; j != l[i];
-                        j = l[j]) if (l[j] == l[i]) p[j] =
-    i;
+    j = l[j]) if (l[j] == l[i]) p[j] = i;
   return p;
 }

library/monotonic_stack/cartesian_binary_tree.hpp

@@ -7,10 +7,9 @@
 //!   a[le[i]] < a[i]
 //! @time O(n)
 //! @space O(n)
-vi mono_st(const auto& a, auto cmp) {
+vi mono_st(const auto& a, const auto& cmp) {
   vi l(sz(a));
-  rep(i, 0, sz(a)) for (
-    l[i] = i - 1; l[i] >= 0 && !cmp(a[l[i]], a[i]);) l[i] =
-    l[l[i]];
+  rep(i, 0, sz(a)) for (l[i] = i - 1;
+    l[i] >= 0 && !cmp(a[l[i]], a[i]);) l[i] = l[l[i]];
   return l;
 }