lecture-5

src/components/article-comment/index.js

@@ -8,9 +8,6 @@ const ArticleComments = ({ comments, replyTo, setReplyTo, handleAddComment, exis
   const cn = bem('ArticleComments');
   const maxDepth = 3;
   const replyFormRef = useRef(null);
-  useEffect(() => {
-    console.log(comments)
-  }, [comments]);
   useEffect(() => {
     if (replyFormRef.current) {
       replyFormRef.current.scrollIntoView({ behavior: 'smooth' });

src/containers/article-comments/index.js

@@ -38,9 +38,6 @@ function ArticleCommentsContainer() {
   }, [dispatch, params.id, storeSelect.token]);
 
   const organizedComments = listToTree(select.comments);
-  useEffect(() => {
-    console.log(organizedComments)
-  }, [organizedComments]);
   return (
     <ArticleComments
       comments={organizedComments}

src/store-redux/comments/actions.js

@@ -21,7 +21,6 @@ export const fetchComments = (articleId) => async (dispatch) => {
 export const addCommentSuccess = (comment) => ({ type: 'comments/addCommentSuccess', payload: comment });
 
 export const addComment = ({ text, parent, article, token }) => async (dispatch) => {
-  console.log('Token in addComment:', token);
   try {
     const response = await services.api.request({
       url: '/comments',

src/utils/list-to-tree/index.js

@@ -1,43 +1,32 @@
 export default function listToTree(list, key = '_id', maxDepth = 6) {
   let trees = {};
   let roots = {};
-  let depths = {}; // Track the depth of each node
+  let depths = {};
 
   for (const item of list) {
-    // Initialize depth for the current item
     if (!depths[item[key]]) {
       depths[item[key]] = 0;
     }
 
-    // Add item to the node index and create children property
+
     if (!trees[item[key]]) {
       trees[item[key]] = item;
       trees[item[key]].children = [];
-      // Initially consider it as a root
       roots[item[key]] = trees[item[key]];
     } else {
       trees[item[key]] = Object.assign(trees[item[key]], item);
     }
 
-    // If the item has a parent, add it to the parent's children
     if (item.parent?.[key]) {
-      // Check if the parent exists in the original list
       const parentExists = list.some(parentItem => parentItem[key] === item.parent[key]);
 
       if (parentExists) {
-        // If the parent is not in the index, create its node (if not created earlier)
         if (!trees[item.parent[key]]) {
           trees[item.parent[key]] = { children: [] };
         }
-
-        // Check the depth of the parent
         if (depths[item.parent[key]] < maxDepth - 1) {
-          // Add the current item as a child to the parent
           trees[item.parent[key]].children.push(trees[item[key]]);
-          // Set the depth of the current item
           depths[item[key]] = depths[item.parent[key]] + 1;
-
-          // Remove the current item from roots as it is now a child
           if (roots[item[key]]) {
             delete roots[item[key]];
           }