list: Replace Bytes with Vec<u8>

src/cmd/list.rs

@@ -2,18 +2,16 @@
 // Use of this source is governed by GNU Affero General Public License
 // that can be found in the LICENSE file.
 
-use bytes::Bytes;
-
 use crate::cmd::Command;
 use crate::cmd::parse::{ParseCommandError, Parser};
 
 #[derive(Debug, Clone)]
 pub enum ListCommand {
     Len(String),
-    PushBack(String, Vec<Bytes>),
-    PushBackExist(String, Vec<Bytes>),
-    PushFront(String, Vec<Bytes>),
-    PushFrontExist(String, Vec<Bytes>),
+    PushBack(String, Vec<Vec<u8>>),
+    PushBackExist(String, Vec<Vec<u8>>),
+    PushFront(String, Vec<Vec<u8>>),
+    PushFrontExist(String, Vec<Vec<u8>>),
     PopBack(String, Option<usize>),
     PopFront(String, Option<usize>),
 }

src/cmd/parse.rs

@@ -72,11 +72,11 @@ impl Parser {
             .ok_or(ParseCommandError::InvalidParameter)
     }
 
-    pub fn remaining(&mut self) -> Result<Vec<Bytes>, ParseCommandError> {
+    pub fn remaining(&mut self) -> Result<Vec<Vec<u8>>, ParseCommandError> {
         let mut list = Vec::new();
         while let Some(frame) = self.iter.next() {
             match frame {
-                Frame::Bulk(frame) => list.push(frame),
+                Frame::Bulk(frame) => list.push(frame.to_vec()),
                 frame => {
                     log::warn!("Protocol error, expected bulk frame, got: {frame:?}");
                     return Err(ParseCommandError::ProtocolError);

src/mem/list/push_back.rs

@@ -4,8 +4,6 @@
 
 use std::collections::hash_map::Entry;
 
-use bytes::Bytes;
-
 use crate::cmd::reply_frame::ReplyFrame;
 use crate::mem::db::{Db, MemObject};
 use crate::mem::list::ListObject;
@@ -22,13 +20,13 @@ use crate::mem::list::ListObject;
 //
 // So for instance the command `RPUSH mylist a b c` will result into a list containing
 // `a` as first element, `b` as second element and `c` as third element.
-pub fn push_back(db: &mut Db, key: String, values: Vec<Bytes>) -> ReplyFrame {
+pub fn push_back(db: &mut Db, key: String, values: Vec<Vec<u8>>) -> ReplyFrame {
     match db.entry(key) {
         Entry::Occupied(mut occupied) => match occupied.get_mut() {
             MemObject::Str(_) => ReplyFrame::wrong_type_err(),
             MemObject::List(old_list) => {
                 for value in values {
-                    old_list.push_back(value.to_vec());
+                    old_list.push_back(value);
                 }
                 ReplyFrame::Usize(old_list.len())
             }

src/mem/list/push_back_exist.rs

@@ -4,22 +4,20 @@
 
 use std::collections::hash_map::Entry;
 
-use bytes::Bytes;
-
 use crate::cmd::reply_frame::ReplyFrame;
 use crate::mem::db::{Db, MemObject};
 
 /// Inserts specified values at the tail of the list stored at key, only if key already exists
 /// and holds a list.
 ///
 /// In contrary to `RPUSH`, no operation will be performed when key does not yet exist.
-pub fn push_back_exist(db: &mut Db, key: String, values: Vec<Bytes>) -> ReplyFrame {
+pub fn push_back_exist(db: &mut Db, key: String, values: Vec<Vec<u8>>) -> ReplyFrame {
     match db.entry(key) {
         Entry::Occupied(mut occupied) => match occupied.get_mut() {
             MemObject::Str(_) => ReplyFrame::wrong_type_err(),
             MemObject::List(old_list) => {
                 for value in values {
-                    old_list.push_back(value.to_vec());
+                    old_list.push_back(value);
                 }
                 ReplyFrame::Usize(old_list.len())
             }

src/mem/list/push_front.rs

@@ -4,8 +4,6 @@
 
 use std::collections::hash_map::Entry;
 
-use bytes::Bytes;
-
 use crate::cmd::reply_frame::ReplyFrame;
 use crate::mem::db::{Db, MemObject};
 use crate::mem::list::ListObject;
@@ -21,13 +19,13 @@ use crate::mem::list::ListObject;
 // from the leftmost element to the rightmost element.
 // So for instance the command `LPUSH mylist a b c` will result into a list containing
 // `c` as first element, `b` as second element and `a` as third element.
-pub fn push_front(db: &mut Db, key: String, values: Vec<Bytes>) -> ReplyFrame {
+pub fn push_front(db: &mut Db, key: String, values: Vec<Vec<u8>>) -> ReplyFrame {
     match db.entry(key) {
         Entry::Occupied(mut occupied) => match occupied.get_mut() {
             MemObject::Str(_) => ReplyFrame::wrong_type_err(),
             MemObject::List(old_list) => {
                 for value in values {
-                    old_list.push_front(value.to_vec());
+                    old_list.push_front(value);
                 }
                 ReplyFrame::Usize(old_list.len())
             }

src/mem/list/push_front_exist.rs

@@ -4,22 +4,20 @@
 
 use std::collections::hash_map::Entry;
 
-use bytes::Bytes;
-
 use crate::cmd::reply_frame::ReplyFrame;
 use crate::mem::db::{Db, MemObject};
 
 /// Inserts specified values at the head of the list stored at key,
 /// only if key already exists and holds a list.
 ///
 /// In contrary to `LPUSH`, no operation will be performed when key does not yet exist.
-pub fn push_front_exist(db: &mut Db, key: String, values: Vec<Bytes>) -> ReplyFrame {
+pub fn push_front_exist(db: &mut Db, key: String, values: Vec<Vec<u8>>) -> ReplyFrame {
     match db.entry(key) {
         Entry::Occupied(mut occupied) => match occupied.get_mut() {
             MemObject::Str(_) => ReplyFrame::wrong_type_err(),
             MemObject::List(old_list) => {
                 for value in values {
-                    old_list.push_front(value.to_vec());
+                    old_list.push_front(value);
                 }
                 ReplyFrame::Usize(old_list.len())
             }