chore: Spelling comments

.github/free-disk-space.sh

@@ -22,7 +22,7 @@
 # Free: 17 GB
 # This script frees up 28 GB of disk space by deleting unneeded packages and 
 # large directories.
-# The Flink end to end tests download and generate more than 17 GB of files,
+# The following end to end tests download and generate more than 17 GB of files,
 # causing unpredictable behavior and build failures.
 #
 echo "=============================================================================="

.github/workflows/build-graphscope-images-linux.yml

@@ -95,7 +95,7 @@ jobs:
         sudo docker push ${{ env.REGISTRY }}/graphscope/learning:${tag}
 
         # dataset image
-        # Note! dataset image are built mannually just use the latest one.
+        # Note! dataset image are built manually just use the latest one.
         sudo docker pull ${{ env.REGISTRY }}/graphscope/dataset:latest
         sudo docker tag ${{ env.REGISTRY }}/graphscope/dataset:latest ${{ env.REGISTRY }}/graphscope/dataset:${tag}
         sudo docker push ${{ env.REGISTRY }}/graphscope/dataset:${tag}
@@ -134,7 +134,7 @@ jobs:
         sudo docker push ${{ env.REGISTRY }}/graphscope/learning:${tag}
 
         # dataset image
-        # Note! dataset image are built mannually just use the latest one.
+        # Note! dataset image are built manually just use the latest one.
         sudo docker pull ${{ env.REGISTRY }}/graphscope/dataset:latest
         sudo docker tag ${{ env.REGISTRY }}/graphscope/dataset:latest ${{ env.REGISTRY }}/graphscope/dataset:${tag}
         sudo docker push ${{ env.REGISTRY }}/graphscope/dataset:${tag}

.github/workflows/build-graphscope-wheels-linux.yml

@@ -57,7 +57,7 @@ jobs:
         tar -zcf client.tar.gz python/dist/wheelhouse/*.whl
         tar -zcf graphscope.tar.gz coordinator/dist/
 
-        # move wheels into one floder to upload to PyPI
+        # move wheels into one folder to upload to PyPI
         mkdir ${GITHUB_WORKSPACE}/upload_pypi
         mv ${GITHUB_WORKSPACE}/python/dist/wheelhouse/*.whl ${GITHUB_WORKSPACE}/upload_pypi/
         mv ${GITHUB_WORKSPACE}/coordinator/dist/wheelhouse/*.whl ${GITHUB_WORKSPACE}/upload_pypi/
@@ -139,7 +139,7 @@ jobs:
         tar -zcf client.tar.gz python/dist/wheelhouse/*.whl
         tar -zcf graphscope.tar.gz coordinator/dist/
 
-        # move wheels into one floder to upload to PyPI
+        # move wheels into one folder to upload to PyPI
         mkdir ${GITHUB_WORKSPACE}/upload_pypi
         mv ${GITHUB_WORKSPACE}/python/dist/wheelhouse/*.whl ${GITHUB_WORKSPACE}/upload_pypi/
         mv ${GITHUB_WORKSPACE}/coordinator/dist/wheelhouse/*.whl ${GITHUB_WORKSPACE}/upload_pypi/

.github/workflows/build-graphscope-wheels-macos.yml

@@ -245,7 +245,7 @@ jobs:
       env:
         PYTHON: ${{ matrix.python-version }}
       run: |
-        # move wheels into one floder to upload to PyPI
+        # move wheels into one folder to upload to PyPI
         mkdir ${GITHUB_WORKSPACE}/upload_pypi
 
         cd ${GITHUB_WORKSPACE}/artifacts

.github/workflows/docs.yml

@@ -158,7 +158,7 @@ jobs:
         sudo apt update
         sudo apt install -y doxygen graphviz
 
-        # generate a taged version
+        # generate a tagged version
         cd ${GITHUB_WORKSPACE}
         make graphscope-docs
 

.github/workflows/pegasus.yml

@@ -56,7 +56,7 @@ jobs:
 #    - name: Detect the tmate session
 #      run: |
 #        if grep -v "grep" .github/workflows/pegasus.yml | grep "action-tmate"; then
-#          echo 'WARNING!!!the self-hosted machine can not run tmate session, please debug it manually'
+#          echo 'WARNING!!!the self-hosted machine cannot run tmate session, please debug it manually'
 #          exit 1
 #        fi
 #

Makefile

@@ -47,7 +47,7 @@ PIP_ARGS 			= --timeout=1000 --no-cache-dir
 ## Common
 .PHONY: all graphscope install clean
 
-# coordinator relys on client, which relys on learning
+# coordinator relies on client, which relies on learning
 all: coordinator analytical interactive
 graphscope: all
 

analytical_engine/CMakeLists.txt

@@ -352,7 +352,7 @@ if (${LIBUNWIND_FOUND})
     target_link_libraries(grape_engine PRIVATE ${LIBUNWIND_LIBRARIES})
 endif ()
 
-# An executable to work around for graphx pregel.
+# An executable workaround for graphx pregel.
 if (ENABLE_JAVA_SDK)
     add_executable(graphx_runner core/java/graphx_runner.cc core/java/javasdk.cc)
     target_include_directories(graphx_runner PRIVATE core utils apps)
@@ -502,7 +502,7 @@ if(ENABLE_JAVA_SDK)
     set(GAE_JAVA_RUNTIME_JAR "${GAE_JAVA_RUNTIME_DIR}/target/grape-runtime-${GRAPHSCOPE_ANALYTICAL_JAR_VERSION}-shaded.jar")
     set(GAE_JAVA_GRAPHX_JAR "${GAE_JAVA_DIR}/grape-graphx/target/grape-graphx-${GRAPHSCOPE_ANALYTICAL_JAR_VERSION}-shaded.jar")
     set(GAE_JAVA_GIRAPH_JAR "${GAE_JAVA_DIR}/grape-giraph/target/grape-giraph-${GRAPHSCOPE_ANALYTICAL_JAR_VERSION}-shaded.jar")
-    # condiationally set grape-jni's name according to platform
+    # conditionally set grape-jni's name according to platform
     if (APPLE)
         set(GAE_JAVA_JNI_LIB "${GAE_JAVA_DIR}/grape-runtime/target/native/libgrape-jni.dylib")
     else ()

analytical_engine/apps/apsp/all_pairs_shortest_path_length.h

@@ -64,7 +64,7 @@ class AllPairsShortestPathLength
                 // unweighted graph, use bfs.
                 this->bfs(frag, v, ctx);
               } else {
-                // weighted graph, use dijstra.
+                // weighted graph, use dijkstra.
                 this->dijkstraLength(frag, v, ctx);
               }
             });

analytical_engine/apps/assortativity/attribute_assortativity.h

@@ -167,7 +167,7 @@ class AttributeAssortativity
 
   /**
    * @brief merge attribute mixing map of all workers in worker 0 and the result
-   * is saved in the contxt of worker 0.
+   * is saved in the context of worker 0.
    *
    * @param ctx
    * @param messages

analytical_engine/apps/assortativity/degree_assortativity_coefficient.h

@@ -145,7 +145,7 @@ class DegreeAssortativity
    * @brief get the degree of vertex
    *
    * @param frag
-   * @param veretx
+   * @param vertex
    * @param type IN or OUT
    * @param ctx
    */

analytical_engine/apps/assortativity/utils.h

@@ -80,7 +80,7 @@ double ProcessMatrix(std::vector<std::vector<T>>& degree_mixing_matrix,
 }
 
 /**
- * @brief deterimine if type T can convert to type U in compile-time.
+ * @brief determine if type T can convert to type U in compile-time.
  *
  * @tparam T
  * @tparam U

analytical_engine/apps/centrality/betweenness/betweenness_centrality_generic.h

@@ -69,7 +69,7 @@ class BetweennessCentralityGeneric
                 // unweighted graph, use bfs.
                 this->bfs(frag, v, ctx);
               } else {
-                // weighted graph, use dijstra.
+                // weighted graph, use dijkstra.
                 this->dijkstra(frag, v, ctx);
               }
             });

analytical_engine/apps/java_pie/java_pie_property_parallel_app.h

@@ -33,7 +33,7 @@ limitations under the License.
 namespace gs {
 
 /**
- * @brief This is a driver app for Java property prallel app. The driven java
+ * @brief This is a driver app for Java property parallel app. The driven java
  * app should be inherited from ParallelPropertyAppBase.
  *
  * @tparam FRAG_T Should be vineyard::ArrowFragment<...>

analytical_engine/apps/pregel/aggregators_test.h

@@ -146,7 +146,7 @@ class AggregatorsTest
         assert(rlt.size() == 81308);
       }
 
-      // terminate itera
+      // terminate iterator
       v.vote_to_halt();
     }
   }

analytical_engine/apps/pregel/louvain/louvain.h

@@ -135,7 +135,7 @@ class PregelLouvain
       v.vote_to_halt();
       return;
     }
-    // at the start of each full pass check to see wether progress is still
+    // at the start of each full pass check to see whether progress is still
     // being made, if not halt
     if (current_minor_step == phase_one_minor_step_1 && current_iteration > 0 &&
         current_iteration % 2 == 0) {

analytical_engine/apps/pregel/louvain/louvain_vertex.h

@@ -29,7 +29,7 @@ limitations under the License.
 namespace gs {
 
 /**
- * @brief LouvainVertex is a specific PregelVertex for louvain alorithm.
+ * @brief LouvainVertex is a specific PregelVertex for louvain algorithm.
  * LouvainVertex provides communication-related method to send messages to
  * certain fragment and also access to context of louvain.
  * @tparam FRAG_T

analytical_engine/cmake/FindRdkafka.cmake

@@ -1,4 +1,4 @@
-# This file is used to find librdkafka library in CMake script, modifeid from the
+# This file is used to find librdkafka library in CMake script, modified from the
 # code from
 #
 #   https://github.com/BVLC/caffe/blob/master/cmake/Modules/FindGlog.cmake

analytical_engine/core/context/java_context_base.h

@@ -140,7 +140,7 @@ class JavaContextBase : public grape::ContextBase {
  protected:
   virtual const char* evalDescriptor() = 0;
 
-  // Set frag_group_id to zero inidicate not available.
+  // Set frag_group_id to zero indicates not available.
   void init(jlong messages_addr, const char* java_message_manager_name,
             const std::string& params, const std::string& lib_path,
             int local_num = 1) {
@@ -209,7 +209,7 @@ class JavaContextBase : public grape::ContextBase {
       {
         jobject json_object = createArgsObject(env, args_str);
         // 3.1 If we find a setClassLoaderMethod, then we invoke.(NOt
-        // neccessary) this is specially for giraph adaptors
+        // necessary) this is specially for giraph adaptors
         setContextClassLoader(env, context_class);
 
         // 4. Invoke java method
@@ -279,7 +279,7 @@ class JavaContextBase : public grape::ContextBase {
     return std::string(user_class_path);
   }
   // user library name should be absolute
-  // serial path is used in graphx, to specify the path to serializaed class
+  // serial path is used in graphx, to specify the path to serialized class
   // objects of vd,ed.etc.
   std::string parseParamsAndSetupJVMEnv(const std::string& params,
                                         const std::string lib_path,
@@ -342,7 +342,7 @@ class JavaContextBase : public grape::ContextBase {
     // vineyard_id(frag_group_id)
     // pt.put("vineyard_id", frag_group_id);
 
-    // JVM runtime opt should consists of java.libaray.path and
+    // JVM runtime opt should consists of java.libarray.path and
     // java.class.path maybe this should be set by the backend not user.
     std::string grape_jvm_opt = generate_jvm_opts();
     if (!grape_jvm_opt.empty()) {

analytical_engine/core/fragment/arrow_flattened_fragment.h

@@ -242,7 +242,7 @@ struct NbrDefault {
 };
 
 /**
- * @brief Union of all iteratable adjencent lists of a vertex. The union
+ * @brief Union of all iteratable adjacent lists of a vertex. The union
  * list contains all neighbors in format of NbrDefault, which contains the other
  * Node and the data on the Edge. The lists must be non-empty to construct the
  * UnionAdjList.
@@ -313,7 +313,7 @@ class UnionAdjList {
 
     pointer_type operator->() noexcept { return &curr_nbr_; }
 
-    // The only the interator's `operator++()` is exposed to the external
+    // Only the iterator's `operator++()` is exposed to the external
     // programs so we only need to check the validity here, and nothing
     // to do with the `operator++()` of NbrDefault.
     inline void move_to_next_valid_nbr() {
@@ -387,7 +387,7 @@ class UnionAdjList {
 
     pointer_type operator->() noexcept { return curr_nbr_; }
 
-    // The only the interator's `operator++()` is exposed to the external
+    // The only the iterator's `operator++()` is exposed to the external
     // programs so we only need to check the validity here, and nothing
     // to do with the `operator++()` of NbrDefault.
     inline void move_to_next_valid_nbr() {

analytical_engine/core/fragment/arrow_projected_fragment.h

@@ -1237,7 +1237,7 @@ class ArrowProjectedFragment
 
   inline size_t GetOutEdgeNum() const { return oenum_; }
 
-  /* Get outging edges num from this frag*/
+  /* Get outgoing edges num from this frag*/
   inline size_t GetOutgoingEdgeNum() const {
     return static_cast<size_t>(oe_offsets_end_->Value(ivnum_ - 1) -
                                oe_offsets_begin_->Value(0));
@@ -1315,8 +1315,8 @@ class ArrowProjectedFragment
     return vm_ptr_->GetGid(internal_oid_t(oid), gid);
   }
 
-  // For Java use, can not use Oid2Gid(const oid_t & oid, vid_t & gid) since
-  // Java can not pass vid_t by reference.
+  // For Java use, cannot use Oid2Gid(const oid_t & oid, vid_t & gid) since
+  // Java cannot pass vid_t by reference.
   inline vid_t Oid2Gid(const oid_t& oid) const {
     vid_t gid;
     if (vm_ptr_->GetGid(internal_oid_t(oid), gid)) {

analytical_engine/core/java/java_messages.h

@@ -26,7 +26,7 @@
 namespace gs {
 
 /**
- * @brief Since Java can not pass Double, Long as reference, we need a wrapper
+ * @brief Since Java cannot pass Double, Long as reference, we need a wrapper
  * for primitives.
  */
 template <typename T>

analytical_engine/core/server/graphscope_service.cc

@@ -121,7 +121,7 @@ ::grpc::Status GraphScopeService::RunStep(
 
     if (!success) {
       op_result->set_error_msg(error_msgs);
-      // break dag exection flow
+      // break dag execution flow
       stream->Write(response_head);
       return Status(StatusCode::INTERNAL, error_msgs);
     }

analytical_engine/java/grape-giraph/src/main/java/com/alibaba/graphscope/app/GiraphComputationAdaptor.java

@@ -170,7 +170,7 @@ public void PEval(
         userComputation.incStep();
         workerContext.setCurStep(1);
 
-        // We can not judge whether to proceed by messages sent and check halted array.
+        // We cannot judge whether to proceed by messages sent and check halted array.
         logger.info(
                 "Any msg received: {} all halted {}",
                 giraphMessageManager.anyMessageReceived(),

analytical_engine/java/grape-giraph/src/main/java/com/alibaba/graphscope/graph/GiraphEdgeManager.java

@@ -70,7 +70,7 @@ public interface GiraphEdgeManager<OID_T extends WritableComparable, EDATA_T ext
      * call. Thus, keeping a reference to an edge value almost always leads to undesired behavior.
      *
      * @param targetVertexId Target vertex id
-     * @return EDATA_Tdge value (or null if missing)
+     * @return EDATA_T edge value (or null if missing)
      */
     EDATA_T getEdgeValue(long lid, OID_T targetVertexId);
 
@@ -79,7 +79,7 @@ public interface GiraphEdgeManager<OID_T extends WritableComparable, EDATA_T ext
      * with strict graphs.
      *
      * @param targetVertexId Target vertex id
-     * @param edgeValue      EDATA_Tdge value
+     * @param edgeValue      EDATA_T edge value
      */
     void setEdgeValue(OID_T targetVertexId, EDATA_T edgeValue);
 

analytical_engine/java/grape-giraph/src/main/java/com/alibaba/graphscope/graph/comm/requests/NettyMessageDecoder.java

@@ -31,7 +31,7 @@ public class NettyMessageDecoder extends ByteToMessageDecoder {
     private static Logger logger = LoggerFactory.getLogger(NettyMessageDecoder.class);
 
     /**
-     * Decode the from one {@link ByteBuf} to an other. This method will be called till either the
+     * Decode the from one {@link ByteBuf} to another. This method will be called till either the
      * input {@link ByteBuf} has nothing to read when return from this method or till nothing was
      * read from the input {@link ByteBuf}.
      *

analytical_engine/java/grape-giraph/src/main/java/com/alibaba/graphscope/graph/impl/DefaultImmutableEdgeManager.java

@@ -36,7 +36,7 @@
 import java.util.Iterator;
 
 /**
- * Defeault edge manager, which extract all edata and oids from grape before accessing them in
+ * Default edge manager, which extract all edata and oids from grape before accessing them in
  * queries.
  *
  * @param <GRAPE_OID_T>

analytical_engine/java/grape-giraph/src/main/java/com/alibaba/graphscope/parallel/cache/impl/BatchWritableMessageCache.java

@@ -67,7 +67,7 @@ public BatchWritableMessageCache(
         cache = new Gid2Data[fragNum];
         for (int i = 0; i < fragNum; ++i) {
             if (i == fragId) {
-                // Message to self can be resiable.
+                // Message to self can be resizable.
                 cache[i] = Gid2Data.newResizable(cacheSize);
             } else {
                 cache[i] = Gid2Data.newFixed(cacheSize);

analytical_engine/java/grape-giraph/src/main/java/com/alibaba/graphscope/parallel/mm/GiraphMessageManager.java

@@ -46,7 +46,7 @@ public interface GiraphMessageManager<
      * Check any message available on this vertex.
      *
      * @param lid local id
-     * @return true if recevied messages.
+     * @return true if received messages.
      */
     boolean messageAvailable(long lid);
 

analytical_engine/java/grape-giraph/src/main/java/com/alibaba/graphscope/parallel/mm/impl/AbstractMessageManager.java

@@ -132,7 +132,7 @@ public Iterable<IN_MSG_T> getMessages(long lid) {
      * Check any message available on this vertex.
      *
      * @param lid local id
-     * @return true if recevied messages.
+     * @return true if received messages.
      */
     @Override
     public boolean messageAvailable(long lid) {

analytical_engine/java/grape-giraph/src/main/java/com/alibaba/graphscope/parallel/netty/NettyClient.java

@@ -264,7 +264,7 @@ private void waitAllConnections() {
                         try {
                             TimeUnit.SECONDS.sleep(1);
                             failedCnt += 1;
-                            // When encounter failure, we update the futreu;
+                            // When encounter failure, we update the future;
                             ChannelFuture newFuture = bootstrap.connect(connection.address);
                             connection.updateFuture(newFuture);
                         } catch (InterruptedException e) {

analytical_engine/java/grape-giraph/src/main/java/com/alibaba/graphscope/utils/Gid2Data.java

@@ -36,7 +36,7 @@ static Gid2Data newFixed(int capacity) {
     /**
      * Number of bytes need for serialization.
      *
-     * @return number of butes
+     * @return number of bytes
      */
     int serializedSize();
 }

analytical_engine/java/grape-giraph/src/main/java/com/alibaba/graphscope/utils/Gid2DataFixed.java

@@ -70,7 +70,7 @@ public int size() {
     /**
      * Number of bytes need for serialization.
      *
-     * @return number of butes
+     * @return number of bytes
      */
     @Override
     public int serializedSize() {

analytical_engine/java/grape-giraph/src/main/java/com/alibaba/graphscope/utils/Gid2DataResizable.java

@@ -64,7 +64,7 @@ public int size() {
     /**
      * Number of bytes need for serialization.
      *
-     * @return number of butes
+     * @return number of bytes
      */
     @Override
     public int serializedSize() {