spelling fixes

This commit is contained in:
klemens
2019-02-09 22:29:54 +01:00
parent f414c16c13
commit 997b7b18af
36 changed files with 50 additions and 50 deletions
+1 -1
View File
@@ -41,7 +41,7 @@ but it requires extra skills and knowledge of the target platform and
the algorithm implementation changes irrevocably -- becoming more
specific, less flexible, and harder to extend and maintain.
G-API takes this responsiblity and complexity from user and does the
G-API takes this responsibility and complexity from user and does the
majority of the work by itself, keeping the algorithm code clean from
device or optimization details. This approach has its own limitations,
though, as graph model is a _constrained_ model and not every
+1 -1
View File
@@ -1255,7 +1255,7 @@ GAPI_EXPORTS std::tuple<GMat, GMat> integral(const GMat& src, int sdepth = -1, i
/** @brief Applies a fixed-level threshold to each matrix element.
The function applies fixed-level thresholding to a single- or multiple-channel matrix.
The function is typically used to get a bi-level (binary) image out of a grayscale image ( cmp funtions could be also used for
The function is typically used to get a bi-level (binary) image out of a grayscale image ( cmp functions could be also used for
this purpose) or for removing a noise, that is, filtering out pixels with too small or too large
values. There are several depths of thresholding supported by the function. They are determined by
depth parameter.
@@ -123,7 +123,7 @@ public:
*
* This may be useful since all temporary objects (cv::GMats) and
* namespaces can be localized to scope of lambda, without
* contaminating the parent scope with probably unecessary objects
* contaminating the parent scope with probably unnecessary objects
* and information.
*
* @param gen generator function which returns a cv::GComputation,
@@ -376,7 +376,7 @@ namespace gapi {
public:
/**
* @brief Returns total number of kernels in the package
* (accross all backends included)
* (across all backends included)
*
* @return a number of kernels in the package
*/
@@ -416,7 +416,7 @@ GAPI_FLUID_KERNEL(GFluidBlur, cv::gapi::imgproc::GBlur, true)
// TODO: support sizes 3, 5, 7, 9, ...
GAPI_Assert(kernelSize.width == 3 && kernelSize.height == 3);
// TODO: suport non-trivial anchor
// TODO: support non-trivial anchor
GAPI_Assert(anchor.x == -1 && anchor.y == -1);
static const bool normalize = true;
@@ -488,7 +488,7 @@ GAPI_FLUID_KERNEL(GFluidBoxFilter, cv::gapi::imgproc::GBoxFilter, true)
// TODO: support sizes 3, 5, 7, 9, ...
GAPI_Assert(kernelSize.width == 3 && kernelSize.height == 3);
// TODO: suport non-trivial anchor
// TODO: support non-trivial anchor
GAPI_Assert(anchor.x == -1 && anchor.y == -1);
int width = src.length();
+1 -1
View File
@@ -15,7 +15,7 @@
#include "executor/gexecutor.hpp"
// NB: BTW, GCompiled is the only "public API" class which
// private part (implementaion) is hosted in the "compiler/" module.
// private part (implementation) is hosted in the "compiler/" module.
//
// This file is here just to keep ADE hidden from the top-level APIs.
//
+1 -1
View File
@@ -579,7 +579,7 @@ namespace
auto l_obj = gim.metadata(lhs_nh).get<FusedIsland>().object;
auto r_obj = gim.metadata(rhs_nh).get<FusedIsland>().object;
GAPI_LOG_INFO(NULL, r_obj->name() << " can be merged into " << l_obj->name());
// Try to do a merge. If merge was succesfull, check if the
// Try to do a merge. If merge was successful, check if the
// graph have cycles (cycles are prohibited at this point).
// If there are cycles, roll-back the merge and mark a pair of
// these Islands with a special tag - "cycle-causing".
+1 -1
View File
@@ -101,7 +101,7 @@ void cv::gimpl::passes::checkIslands(ade::passes::PassContext &ctx)
{
GModel::ConstGraph gr(ctx.graph);
// The algorithm is teh following:
// The algorithm is the following:
//
// 1. Put all Tagged nodes (both Operations and Data) into a set
// 2. Initialize Visited set as (empty)
+1 -1
View File
@@ -129,7 +129,7 @@ void cv::gimpl::passes::expandKernels(ade::passes::PassContext &ctx, const gapi:
GModel::Graph gr(ctx.graph);
// Repeat the loop while there are compound kernels.
// Restart procedure after every successfull unrolling
// Restart procedure after every successful unrolling
bool has_compound_kernel = true;
while (has_compound_kernel)
{
+4 -4
View File
@@ -67,11 +67,11 @@ TEST_F(GCompiledValidateMetaTyped, InvalidMeta)
cv::Scalar sc(33);
cv::Mat out;
// 3 channels intead 1
// 3 channels instead 1
cv::Mat in1 = cv::Mat::eye(cv::Size(64,32), CV_8UC3);
EXPECT_THROW(f(in1, sc, out), std::logic_error);
// 32f intead 8u
// 32f instead 8u
cv::Mat in2 = cv::Mat::eye(cv::Size(64,32), CV_32F);
EXPECT_THROW(f(in2, sc, out), std::logic_error);
@@ -112,11 +112,11 @@ TEST_F(GCompiledValidateMetaUntyped, InvalidMetaValues)
cv::Scalar sc(33);
cv::Mat out;
// 3 channels intead 1
// 3 channels instead 1
cv::Mat in1 = cv::Mat::eye(cv::Size(64,32), CV_8UC3);
EXPECT_THROW(f(cv::gin(in1, sc), cv::gout(out)), std::logic_error);
// 32f intead 8u
// 32f instead 8u
cv::Mat in2 = cv::Mat::eye(cv::Size(64,32), CV_32F);
EXPECT_THROW(f(cv::gin(in2, sc), cv::gout(out)), std::logic_error);
@@ -73,7 +73,7 @@ TEST(GMetaArg, Traits_Are_ButLast_Positive)
using namespace cv::detail;
static_assert(are_meta_descrs_but_last<cv::GScalarDesc, int>::value,
"List is valid (int is ommitted)");
"List is valid (int is omitted)");
static_assert(are_meta_descrs_but_last<cv::GMatDesc, cv::GScalarDesc, cv::GCompileArgs>::value,
"List is valid (GCompileArgs are omitted)");
@@ -320,7 +320,7 @@ TEST(IslandsFusion, PartionOverlapUserIsland)
// |
// (in1) --------------------------`
// Check that internal islands does't overlap user island
// Check that internal islands doesn't overlap user island
namespace J = Jupiter;
namespace S = Saturn;
@@ -124,7 +124,7 @@ TEST_F(Islands, TwoIslands)
}
// FIXME: Disabled since currently merge procedure merges two into one
// succesfully
// successfully
TEST_F(Islands, DISABLED_Two_Islands_With_Same_Name_Should_Fail)
{
// (in) -> Blur1 -> (tmp0) -> Blur2 -> (tmp1) -> Blur3 -> (tmp2) -> Blur4 -> (out)
@@ -90,7 +90,7 @@ TYPED_TEST(VectorRefT, ReadAfterWrite)
EXPECT_EQ(0u, writer.wref().size()); // Check the initial state
EXPECT_EQ(0u, reader.rref().size());
writer.wref().emplace_back(); // Check that write is successfull
writer.wref().emplace_back(); // Check that write is successful
EXPECT_EQ(1u, writer.wref().size());
EXPECT_EQ(1u, vec.size()); // Check that changes are reflected to the original container
@@ -183,7 +183,7 @@ TYPED_TEST(VectorRefU, ReadAfterWrite)
EXPECT_EQ(0u, writer.wref<T>().size()); // Check the initial state
EXPECT_EQ(0u, reader.rref<T>().size());
writer.wref<T>().emplace_back(); // Check that write is successfull
writer.wref<T>().emplace_back(); // Check that write is successful
EXPECT_EQ(1u, writer.wref<T>().size());
EXPECT_EQ(1u, vec.size()); // Check that changes are reflected to the original container