fix typo

README-CN.md

@@ -111,7 +111,7 @@ NebulaGraph内核 1.x 与 2.x 数据格式、通信协议、客户端等均双
 
 ## 加入 NebulaGraph 社区
 
-[![Discussions](https://img.shields.io/badge/GitHub_Discussion-000000?style=for-the-badge&logo=github&logoColor=white)](https://github.com/vesoft-inc/nebula/discussions) [![Discourse](https://img.shields.io/badge/中文论坛-4285F4?style=for-the-badge&logo=discourse&logoColor=white)](https://discuss.nebula-graph.com.cn/) [![Slack](https://img.shields.io/badge/Slack-9F2B68?style=for-the-badge&logo=slack&logoColor=white)](https://join.slack.com/t/nebulagraph/shared_invite/zt-7ybejuqa-NCZBroh~PCh66d9kOQj45g) [![Tecent_Meeting](https://img.shields.io/badge/腾讯会议-2D8CFF?style=for-the-badge&logo=googlemeet&logoColor=white)](https://meeting.tencent.com/dm/F8NX1aRZ8PQv) [![Google Calendar](https://img.shields.io/badge/Calander-4285F4?style=for-the-badge&logo=google&logoColor=white)](https://calendar.google.com/calendar/u/0?cid=Z29mbGttamM3ZTVlZ2hpazI2cmNlNXVnZThAZ3JvdXAuY2FsZW5kYXIuZ29vZ2xlLmNvbQ) [![Meetup](https://img.shields.io/badge/Meetup-FF0000?style=for-the-badge&logo=meetup&logoColor=white)](https://www.meetup.com/nebulagraph/events/287180186?utm_medium=referral&utm_campaign=share-btn_savedevents_share_modal&utm_source=link) [![Meeting Archive](https://img.shields.io/badge/Community_wiki-808080?style=for-the-badge&logo=readthedocs&logoColor=white)](https://github.com/vesoft-inc/nebula-community/wiki)
+[![Discussions](https://img.shields.io/badge/GitHub_Discussion-000000?style=for-the-badge&logo=github&logoColor=white)](https://github.com/vesoft-inc/nebula/discussions) [![Discourse](https://img.shields.io/badge/中文论坛-4285F4?style=for-the-badge&logo=discourse&logoColor=white)](https://discuss.nebula-graph.com.cn/) [![Slack](https://img.shields.io/badge/Slack-9F2B68?style=for-the-badge&logo=slack&logoColor=white)](https://join.slack.com/t/nebulagraph/shared_invite/zt-7ybejuqa-NCZBroh~PCh66d9kOQj45g) [![Tencent_Meeting](https://img.shields.io/badge/腾讯会议-2D8CFF?style=for-the-badge&logo=googlemeet&logoColor=white)](https://meeting.tencent.com/dm/F8NX1aRZ8PQv) [![Google Calendar](https://img.shields.io/badge/Calander-4285F4?style=for-the-badge&logo=google&logoColor=white)](https://calendar.google.com/calendar/u/0?cid=Z29mbGttamM3ZTVlZ2hpazI2cmNlNXVnZThAZ3JvdXAuY2FsZW5kYXIuZ29vZ2xlLmNvbQ) [![Meetup](https://img.shields.io/badge/Meetup-FF0000?style=for-the-badge&logo=meetup&logoColor=white)](https://www.meetup.com/nebulagraph/events/287180186?utm_medium=referral&utm_campaign=share-btn_savedevents_share_modal&utm_source=link) [![Meeting Archive](https://img.shields.io/badge/Community_wiki-808080?style=for-the-badge&logo=readthedocs&logoColor=white)](https://github.com/vesoft-inc/nebula-community/wiki)
 
 <br />
 

README.md

@@ -110,7 +110,7 @@ You can also freely deploy **NebulaGraph** as a back-end service to support your
 
 ## Community
 
-[![Discussions](https://img.shields.io/badge/GitHub_Discussion-000000?style=for-the-badge&logo=github&logoColor=white)](https://github.com/vesoft-inc/nebula/discussions) [![Slack](https://img.shields.io/badge/Slack-9F2B68?style=for-the-badge&logo=slack&logoColor=white)](https://join.slack.com/t/nebulagraph/shared_invite/zt-7ybejuqa-NCZBroh~PCh66d9kOQj45g) [![Zoom](https://img.shields.io/badge/Zoom-2D8CFF?style=for-the-badge&logo=zoom&logoColor=white)](https://us02web.zoom.us/meeting/register/tZ0rcuypqDMvGdLuIm4VprTlx96wrEf062SH) [![Google Calendar](https://img.shields.io/badge/Calander-4285F4?style=for-the-badge&logo=google&logoColor=white)](https://calendar.google.com/calendar/u/0?cid=Z29mbGttamM3ZTVlZ2hpazI2cmNlNXVnZThAZ3JvdXAuY2FsZW5kYXIuZ29vZ2xlLmNvbQ) [![Meetup](https://img.shields.io/badge/Meetup-FF0000?style=for-the-badge&logo=meetup&logoColor=white)](https://www.meetup.com/nebulagraph/events/287180186?utm_medium=referral&utm_campaign=share-btn_savedevents_share_modal&utm_source=link) [![Meeting Archive](https://img.shields.io/badge/Community_wiki-808080?style=for-the-badge&logo=readthedocs&logoColor=white)](https://github.com/vesoft-inc/nebula-community/wiki) [![Discourse](https://img.shields.io/badge/中文论坛-4285F4?style=for-the-badge&logo=discourse&logoColor=white)](https://discuss.nebula-graph.com.cn/) [![Tecent_Meeting](https://img.shields.io/badge/腾讯会议-2D8CFF?style=for-the-badge&logo=googlemeet&logoColor=white)](https://meeting.tencent.com/dm/F8NX1aRZ8PQv)
+[![Discussions](https://img.shields.io/badge/GitHub_Discussion-000000?style=for-the-badge&logo=github&logoColor=white)](https://github.com/vesoft-inc/nebula/discussions) [![Slack](https://img.shields.io/badge/Slack-9F2B68?style=for-the-badge&logo=slack&logoColor=white)](https://join.slack.com/t/nebulagraph/shared_invite/zt-7ybejuqa-NCZBroh~PCh66d9kOQj45g) [![Zoom](https://img.shields.io/badge/Zoom-2D8CFF?style=for-the-badge&logo=zoom&logoColor=white)](https://us02web.zoom.us/meeting/register/tZ0rcuypqDMvGdLuIm4VprTlx96wrEf062SH) [![Google Calendar](https://img.shields.io/badge/Calander-4285F4?style=for-the-badge&logo=google&logoColor=white)](https://calendar.google.com/calendar/u/0?cid=Z29mbGttamM3ZTVlZ2hpazI2cmNlNXVnZThAZ3JvdXAuY2FsZW5kYXIuZ29vZ2xlLmNvbQ) [![Meetup](https://img.shields.io/badge/Meetup-FF0000?style=for-the-badge&logo=meetup&logoColor=white)](https://www.meetup.com/nebulagraph/events/287180186?utm_medium=referral&utm_campaign=share-btn_savedevents_share_modal&utm_source=link) [![Meeting Archive](https://img.shields.io/badge/Community_wiki-808080?style=for-the-badge&logo=readthedocs&logoColor=white)](https://github.com/vesoft-inc/nebula-community/wiki) [![Discourse](https://img.shields.io/badge/中文论坛-4285F4?style=for-the-badge&logo=discourse&logoColor=white)](https://discuss.nebula-graph.com.cn/) [![Tencent_Meeting](https://img.shields.io/badge/腾讯会议-2D8CFF?style=for-the-badge&logo=googlemeet&logoColor=white)](https://meeting.tencent.com/dm/F8NX1aRZ8PQv)
 
 <br />
 

docs/rfcs/0000-template.md

@@ -49,7 +49,7 @@ A few examples of what this can include are:
 - For practical proposals: Does this feature exist in other database and what experience have their community had?
 - Papers: Are there any published papers or great posts that discuss this? If you have some relevant papers to refer to, this can serve as a more detailed theoretical background.
 
-The proposal won't accepted for they are in other projects, but this will show we more productive meaning.
+The proposal won't be accepted for they are in other projects, but this will show us more productive meaning.
 
 # Unresolved questions
 

src/graph/context/Symbols.cpp

@@ -39,7 +39,7 @@ Variable* SymbolTable::newVariable(const std::string& name) {
   DCHECK(vars_.find(name) == vars_.end());
   auto* variable = objPool_->makeAndAdd<Variable>(name);
   addVar(name, variable);
-  // Initialize all variable in variable map (ouput of node, inner variable etc.)
+  // Initialize all variable in variable map (output of node, inner variable etc.)
   // Some variable will be useless after optimizer, maybe we could remove it.
   ectx_->initVar(name);
   return variable;

src/graph/executor/admin/SubmitJobExecutor.cpp

@@ -114,7 +114,7 @@ nebula::DataSet SubmitJobExecutor::buildShowResultData(
     const nebula::meta::cpp2::JobDesc &jd, const std::vector<nebula::meta::cpp2::TaskDesc> &td) {
   if (jd.get_type() == meta::cpp2::JobType::DATA_BALANCE ||
       jd.get_type() == meta::cpp2::JobType::ZONE_BALANCE) {
-    // The job which executed on meta, aka balance data, is a litte different from others. In order
+    // The job which executed on meta, aka balance data, is a little different from others. In order
     // to be consistent with other jobs, the task result is set in paras in JobDesc serialized by
     // thrift. The reason that we can't use the list of TaskDesc is that the state of balance task
     // is saved in BalanceTask, which is different from TaskDesc.

src/graph/executor/algo/MultiShortestPathExecutor.cpp

@@ -30,7 +30,7 @@ folly::Future<Status> MultiShortestPathExecutor::execute() {
         return conjunctPath(true);
       })
       .thenValue([this](auto&& termination) {
-        // termination is ture, all paths has found
+        // termination is true, all paths has found
         if (termination || step_ * 2 > pathNode_->steps()) {
           return folly::makeFuture<bool>(true);
         }

src/graph/optimizer/rule/MergeGetNbrsAndProjectRule.h

@@ -18,7 +18,7 @@ namespace opt {
 //  expression of GetNeighbors Benefits:
 //   1. Delete unnecessary node
 //
-//  Tranformation:
+//  Transformation:
 //  Before:
 //
 //  +------+-------+

src/graph/planner/Planner.h

@@ -46,7 +46,7 @@ class Planner {
   virtual ~Planner() = default;
 
   // Each statement might have many planners that match different situations.
-  // Each planner should provide two funtions:
+  // Each planner should provide two functions:
   // 1. MatchFunc that matchs the proper situation
   // 2. PlannerInstantiateFunc that instantiates the planner
   static auto& plannersMap() {

src/graph/planner/match/MatchPathPlanner.cpp

@@ -272,7 +272,7 @@ Status MatchPathPlanner::leftExpandFromNode(
     traverse->setStepRange(edge.range);
     traverse->setDedup();
     // If start from end of the path pattern, the first traverse would not
-    // track the previos path, otherwise, it should.
+    // track the previous path, otherwise, it should.
     traverse->setTrackPrevPath(startIndex + 1 == nodeInfos.size() ? i != startIndex : true);
     traverse->setColNames(
         genTraverseColNames(subplan.root->colNames(),

src/graph/util/ExpressionUtils.cpp

@@ -685,7 +685,7 @@ Expression *ExpressionUtils::rewriteRelExprHelper(const Expression *expr,
 }
 
 StatusOr<Expression *> ExpressionUtils::filterTransform(const Expression *filter) {
-  // Check if any overflow happen before filter tranform
+  // Check if any overflow happen before filter transform
   auto initialConstFold = foldConstantExpr(filter);
   NG_RETURN_IF_ERROR(initialConstFold);
   auto newFilter = initialConstFold.value();

src/graph/util/FTIndexUtils.h

@@ -32,7 +32,7 @@ class FTIndexUtils final {
   static StatusOr<bool> clearTSIndex(const std::vector<nebula::plugin::HttpClient>& tsClients,
                                      const std::string& index);
 
-  // Converts TextSearchExpression into a relational expresion that could be pushed down
+  // Converts TextSearchExpression into a relational expression that could be pushed down
   static StatusOr<Expression*> rewriteTSFilter(
       ObjectPool* pool,
       bool isEdge,
@@ -41,7 +41,7 @@ class FTIndexUtils final {
       const std::vector<nebula::plugin::HttpClient>& tsClients);
 
   // Performs full-text search using elastic search adapter
-  // Search type is defiend by the expression kind
+  // Search type is defined by the expression kind
   static StatusOr<std::vector<std::string>> textSearch(
       Expression* expr,
       const std::string& index,

src/graph/util/IndexUtil.h

@@ -16,7 +16,7 @@ class IndexUtil final {
  public:
   IndexUtil() = delete;
 
-  // Checks wether the parameter in the geo s2 index is valid
+  // Checks whether the parameter in the geo s2 index is valid
   static Status validateIndexParams(const std::vector<IndexParamItem *> &params,
                                     meta::cpp2::IndexParams &indexParams);
 
@@ -25,7 +25,7 @@ class IndexUtil final {
   static StatusOr<DataSet> toDescIndex(const meta::cpp2::IndexItem &indexItem);
 
   // TODO(Aiee) no status will be returned. Change the interface
-  // Returns the infomation of the given index
+  // Returns the information of the given index
   static StatusOr<DataSet> toShowCreateIndex(bool isTagIndex,
                                              const std::string &indexName,
                                              const meta::cpp2::IndexItem &indexItem);

src/graph/util/ValidateUtil.h

@@ -20,10 +20,10 @@ class ValidateUtil final {
 
   // Checks the upper bound steps of clause is greater than its lower bound.
   // TODO(Aiee) Seems this method not only checks the clause but also set the clause into step which
-  // is in the context. Consider seprate it.
+  // is in the context. Consider separating it.
   static Status validateStep(const StepClause* clause, StepClause& step);
 
-  // Retrives edges from schema manager and validate the over clause.
+  // Retrieves edges from schema manager and validate the over clause.
   static Status validateOver(QueryContext* qctx, const OverClause* clause, Over& over);
 
   // Returns a status error if the expr contains any labelExpression.

src/graph/validator/MatchValidator.cpp

@@ -327,7 +327,7 @@ Status MatchValidator::validateFilter(const Expression *filter,
   auto typeStatus = deduceExprType(whereClauseCtx.filter);
   NG_RETURN_IF_ERROR(typeStatus);
   auto type = typeStatus.value();
-  // Allow implcit convertion from LIST to BOOL
+  // Allow implicit conversion from LIST to BOOL
   if (type != Value::Type::BOOL && type != Value::Type::NULLVALUE &&
       type != Value::Type::__EMPTY__ && type != Value::Type::LIST) {
     std::stringstream ss;

src/graph/validator/MutateValidator.cpp

@@ -47,7 +47,7 @@ Status InsertVerticesValidator::check() {
 
   auto tagItems = sentence->tagItems();
   if (!FLAGS_graph_use_vertex_key && tagItems.empty()) {
-    return Status::SemanticError("Insert vertex is forbidden, please speicify the tag");
+    return Status::SemanticError("Insert vertex is forbidden, please specify the tag");
   }
 
   schemas_.reserve(tagItems.size());

src/graph/visitor/PropertyTrackerVisitor.cpp

@@ -256,7 +256,7 @@ void PropertyTrackerVisitor::visit(AttributeExpression *expr) {
             auto &aliasName = propExpr->prop();
             propsUsed_.insertEdgeProp(aliasName, unKnowType_, propName);
           } else if (leftKind == Expression::Kind::kListComprehension) {
-            //  match (v)-[c*2]->(b) retrun properties(c[0]).start_year
+            //  match (v)-[c*2]->(b) return properties(c[0]).start_year
             //  properties([e IN $-.c WHERE is_edge($e)][0]).start_year
             auto *listExpr = static_cast<ListComprehensionExpression *>(subLeftExpr);
             auto *collectExpr = listExpr->collection();

src/graph/visitor/test/FilterTransformTest.cpp

@@ -23,7 +23,7 @@ TEST_F(FilterTransformTest, TestComplexExprRewrite) {
   ASSERT_EQ(*res.value(), *expected) << res.value()->toString() << " vs. " << expected->toString();
 }
 
-// If the expression tranformation causes an overflow, it should not be done.
+// If the expression transformation causes an overflow, it should not be done.
 TEST_F(FilterTransformTest, TestCalculationOverflow) {
   // (v.age - 1 < 9223372036854775807)  =>  unchanged
   {

src/interface/common.thrift

@@ -361,9 +361,9 @@ enum ErrorCode {
     E_WRONGCLUSTER                    = -2010,  // Wrong cluster
     E_ZONE_NOT_ENOUGH                 = -2011,  // Listener conflicts
     E_ZONE_IS_EMPTY                   = -2012,  // Host not exist
-    E_SCHEMA_NAME_EXISTS              = -2013,  // Schema name alreay exists
-    E_RELATED_INDEX_EXISTS            = -2014,  // There are stil indexes related to tag or edge, cannot drop it
-    E_RELATED_SPACE_EXISTS            = -2015,  // There are still some spaec on the host, cannot drop it
+    E_SCHEMA_NAME_EXISTS              = -2013,  // Schema name already exists
+    E_RELATED_INDEX_EXISTS            = -2014,  // There are still indexes related to tag or edge, cannot drop it
+    E_RELATED_SPACE_EXISTS            = -2015,  // There are still some space on the host, cannot drop it
 
     E_STORE_FAILURE                   = -2021,  // Failed to store data
     E_STORE_SEGMENT_ILLEGAL           = -2022,  // Illegal storage segment

src/meta/processors/admin/AdminClient.cpp

@@ -464,7 +464,7 @@ void AdminClient::getResponseFromHost(const HostAddr& host,
               auto&& result = std::move(t).value();
               if (result.get_code() != nebula::cpp2::ErrorCode::SUCCEEDED) {
                 p.setValue(
-                    Status::Error("Operattion failed in AdminClient: %s",
+                    Status::Error("Operation failed in AdminClient: %s",
                                   apache::thrift::util::enumNameSafe(result.get_code()).c_str()));
               } else {
                 p.setValue(respGen(std::move(result)));

tests/common/nebula_test_suite.py

@@ -40,7 +40,7 @@
 T_NULL_UNKNOWN_DIV_BY_ZERO.set_nVal(CommonTtypes.NullType.DIV_BY_ZERO)
 
 
-@pytest.mark.usefixtures("workarround_for_class")
+@pytest.mark.usefixtures("workaround_for_class")
 class NebulaTestSuite(object):
     @classmethod
     def set_delay(self):

tests/conftest.py

@@ -234,7 +234,7 @@ def load_student_data():
 
 # TODO(yee): Delete this when we migrate all test cases
 @pytest.fixture(scope="class")
-def workarround_for_class(
+def workaround_for_class(
     request, pytestconfig, conn_pool, session, load_nba_data, load_student_data
 ):
     if request.cls is None:

tests/tck/cluster/terminate.feature

@@ -3,7 +3,7 @@
 # This source code is licensed under Apache 2.0 License.
 Feature: Nebula service termination test
 
-  # All nebula services shold exit as expected after termination
+  # All nebula services should exit as expected after termination
   Scenario: Basic termination test
     Given a nebulacluster with 1 graphd and 1 metad and 1 storaged
     When the cluster was terminated

tests/tck/features/go/SimpleCase.feature

@@ -268,7 +268,7 @@ Feature: Simple case
       | 3  | Dedup       | 15           |                   |
       | 15 | Project     | 0            |                   |
       | 0  | Start       |              |                   |
-    # Because GetDstBySrc doesn't support limit push down, so degenrate to GetNeighbors when the query contains limit/simple clause
+    # Because GetDstBySrc doesn't support limit push down, so degenerate to GetNeighbors when the query contains limit/simple clause
     When profiling query:
       """
       GO 3 STEPS FROM "Tony Parker" OVER * YIELD DISTINCT id($$) LIMIT [100, 100, 100] | YIELD count(*)

tests/tck/features/insert/insertVertexOnly.feature

@@ -20,7 +20,7 @@ Feature: insert vertex without tag
       """
       INSERT VERTEX VALUES 1:(),2:(),3:();
       """
-    Then a SemanticError should be raised at runtime: Insert vertex is forbidden, please speicify the tag
+    Then a SemanticError should be raised at runtime: Insert vertex is forbidden, please specify the tag
     When executing query:
       """
       INSERT EDGE e() VALUES 1->2:(),2->3:();

tests/tck/features/optimizer/MergeGetNbrsDedupProjectRule.feature

@@ -1,7 +1,7 @@
 # Copyright (c) 2021 vesoft inc. All rights reserved.
 #
 # This source code is licensed under Apache 2.0 License.
-# This optimization rule is not neccessary now
+# This optimization rule is not necessary now
 @skip
 Feature: merge get neighbors, dedup and project rule
 

tests/tck/features/optimizer/PrunePropertiesRule.feature

@@ -12,7 +12,7 @@ Feature: Prune Properties rule
       MATCH p = (v:player{name: "Tony Parker"})-[e:like]->(v2)
       RETURN v2.player.age
       """
-    # Since in distributed system and scatter gather model, the order is not guarrented.
+    # Since in distributed system and scatter gather model, the order is not guaranteed.
     Then the result should be, in any order:
       | v2.player.age |
       | 42            |