Misc. typos
Found via `codespell -q 3`
This commit is contained in:
parent
c1e462f61d
commit
7f9b54a31a
@ -82,7 +82,7 @@ struct ListTagAppend : detail::ListRoot
|
||||
};
|
||||
|
||||
/// Append \c Type to \c ListTag only if \c ListTag does not already contain \c Type.
|
||||
/// No checks are performed to see if \c ListTag itself has only unqiue elements.
|
||||
/// No checks are performed to see if \c ListTag itself has only unique elements.
|
||||
template <typename ListTag, typename Type>
|
||||
struct ListTagAppendUnique : detail::ListRoot
|
||||
{
|
||||
|
@ -223,7 +223,7 @@ BoundingIntervalHierarchy::CalculateSplitScatterIndices(const IdArrayHandle& cel
|
||||
// if point is to the left,
|
||||
// index = total number in previous segments + total number of false flags in this segment + total number of trues in previous segment
|
||||
// else
|
||||
// index = total number in previous segments + number of falses preceeding it in the segment.
|
||||
// index = total number in previous segments + number of falses preceding it in the segment.
|
||||
IdArrayHandle scatterIndices;
|
||||
vtkm::worklet::DispatcherMapField<vtkm::worklet::spatialstructure::SplitIndicesCalculator>()
|
||||
.Invoke(leqFlags,
|
||||
@ -251,7 +251,7 @@ public:
|
||||
VTKM_CONT bool operator()(DeviceAdapter)
|
||||
{
|
||||
VTKM_IS_DEVICE_ADAPTER_TAG(DeviceAdapter);
|
||||
// Accomodate into a Functor, so that this could be used with TryExecute
|
||||
// Accommodate into a Functor, so that this could be used with TryExecute
|
||||
using Algorithms = typename vtkm::cont::DeviceAdapterAlgorithm<DeviceAdapter>;
|
||||
|
||||
vtkm::cont::DynamicCellSet cellSet = Self->GetCellSet();
|
||||
@ -412,7 +412,7 @@ public:
|
||||
//PRINT_TIMER("4.2", s42);
|
||||
|
||||
//START_TIMER(s43);
|
||||
// Make a new nodes with enough nodes for the currnt level, copying over the old one
|
||||
// Make a new nodes with enough nodes for the current level, copying over the old one
|
||||
vtkm::Id nodesSize = Self->Nodes.GetNumberOfValues() + numSegments;
|
||||
vtkm::cont::ArrayHandle<BoundingIntervalHierarchyNode> newTree;
|
||||
newTree.Allocate(nodesSize);
|
||||
|
@ -28,7 +28,7 @@ namespace
|
||||
{
|
||||
// The goal of this unit test is not to verify the correctness
|
||||
// of the various algorithms. Since Algorithm is a header, we
|
||||
// need to ensure we instatiate each algorithm in a source
|
||||
// need to ensure we instantiate each algorithm in a source
|
||||
// file to verify compilation.
|
||||
//
|
||||
static constexpr vtkm::Id ARRAY_SIZE = 10;
|
||||
|
@ -32,7 +32,7 @@ namespace filter
|
||||
/// it would generate a N-Dims histogram from input fields. The result is stored
|
||||
/// in a field named as "Frequency". This filed contains all the frequencies of
|
||||
/// the N-Dims histogram in sparse representation. That being said, the result
|
||||
/// field does not store 0 frequency bins. Meanwhile all input fileds now
|
||||
/// field does not store 0 frequency bins. Meanwhile all input fields now
|
||||
/// would have the same length and store bin ids instead.
|
||||
/// E.g. (FieldA[i], FieldB[i], FieldC[i], Frequency[i]) is a bin in the histogram.
|
||||
/// The first three numbers are binIDs for FieldA, FieldB and FieldC. Frequency[i] stores
|
||||
|
@ -472,7 +472,7 @@ public:
|
||||
|
||||
/// \brief Move the camera toward or away from the focal point.
|
||||
///
|
||||
/// Specifically, this divides the camera's distnace from the focal point
|
||||
/// Specifically, this divides the camera's distance from the focal point
|
||||
/// (LookAt) by the given value. Use a value greater than one to dolly in
|
||||
/// toward the focal point, and use a value less than one to dolly-out away
|
||||
/// from the focal point.
|
||||
|
@ -144,7 +144,7 @@ public:
|
||||
else
|
||||
outValue = static_cast<O>(0);
|
||||
}
|
||||
}; //class doube mask
|
||||
}; //class double mask
|
||||
|
||||
struct MaxValue
|
||||
{
|
||||
|
Loading…
Reference in New Issue
Block a user