From 2d4e47a3bf8f3d3a9d982a506d800c78fd2fcaf3 Mon Sep 17 00:00:00 2001
From: gf777 <giulio.formenti@gmail.com>
Date: Thu, 4 Jul 2024 16:00:26 -0400
Subject: [PATCH] deque cannot be const

---
 include/kreeq.h  | 2 +-
 src/variants.cpp | 4 ++--
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/include/kreeq.h b/include/kreeq.h
index e2a19a5..f4b425e 100644
--- a/include/kreeq.h
+++ b/include/kreeq.h
@@ -229,7 +229,7 @@ class DBG : public Kmap<DBG, UserInputKreeq, uint64_t, DBGkmer, DBGkmer32> { //
     
     bool DBGtoVariants(InSegment *inSegment);
     
-    std::pair<bool,std::deque<DBGpath>> searchVariants(std::pair<const uint64_t,DBGkmer32> source, std::array<uint16_t, 2> mapRange, const std::deque<const uint64_t> &targetsQueue, const phmap::parallel_flat_hash_map<uint64_t,bool> &targetsMap, ParallelMap32* localGraphCache);
+    std::pair<bool,std::deque<DBGpath>> searchVariants(std::pair<const uint64_t,DBGkmer32> source, std::array<uint16_t, 2> mapRange, const std::deque<uint64_t> &targetsQueue, const phmap::parallel_flat_hash_map<uint64_t,bool> &targetsMap, ParallelMap32* localGraphCache);
     
     bool variantsToGFA(InSegment *inSegment, Log &threadLog);
     
diff --git a/src/variants.cpp b/src/variants.cpp
index 7f261ed..7693a07 100644
--- a/src/variants.cpp
+++ b/src/variants.cpp
@@ -72,7 +72,7 @@ bool DBG::DBGtoVariants(InSegment *inSegment) {
     while(explored < kcount) {
 
         mapRange = {0,0};
-        std::deque<const uint64_t> targetsQueue;
+        std::deque<uint64_t> targetsQueue;
         phmap::parallel_flat_hash_map<uint64_t,bool> targetsMap;
 
         while (mapRange[1] < mapCount) {
@@ -176,7 +176,7 @@ bool DBG::DBGtoVariants(InSegment *inSegment) {
     return true;
 }
 
-std::pair<bool,std::deque<DBGpath>> DBG::searchVariants(std::pair<const uint64_t,DBGkmer32> source, std::array<uint16_t, 2> mapRange, const std::deque<const uint64_t> &targetsQueue, const phmap::parallel_flat_hash_map<uint64_t,bool> &targetsMap, ParallelMap32* localGraphCache) { // dijkstra variant search
+std::pair<bool,std::deque<DBGpath>> DBG::searchVariants(std::pair<const uint64_t,DBGkmer32> source, std::array<uint16_t, 2> mapRange, const std::deque<uint64_t> &targetsQueue, const phmap::parallel_flat_hash_map<uint64_t,bool> &targetsMap, ParallelMap32* localGraphCache) { // dijkstra variant search
     
     bool explored = false; // true if we reached a node in the original graph
     std::vector<uint64_t> destinations;