Commit 6e09b4df authored by luz paz's avatar luz paz Committed by Boudewijn Rempt

libs/image typos

Found via `codespell -q 3  -I ../krita-whitelist.txt --skip="./3rdparty,*.xpm"`
Signed-off-by: Boudewijn Rempt's avatarBoudewijn Rempt <boud@valdyas.org>
parent 745ae55c
......@@ -34,7 +34,7 @@ public:
/**
* @brief forceUpdateTimedNode forrces the node to regenerate its project. The update might
* be asynchronous, so you chould call image->waitForDone() after that.
* be asynchronous, so you should call image->waitForDone() after that.
*/
virtual void forceUpdateTimedNode() = 0;
};
......
......@@ -163,7 +163,7 @@ struct KisOptimizedByteArray::Private : public QSharedData
MemoryAllocator *allocator;
// stored allocator shared pointer is used only for keeping
// the lifetime of the allocator until the deatch of the last
// the lifetime of the allocator until the detach of the last
// allocated chunk
MemoryAllocatorSP storedAllocator;
......
......@@ -284,7 +284,7 @@ public:
}
ALWAYS_INLINE quint8 calculateOpacity(quint8* pixelPtr) {
// TODO: either theshold should always be null, or there should be a special
// TODO: either threshold should always be null, or there should be a special
// case for *pixelPtr == 0, which is different from all the other groups,
// whatever the threshold is
......
......@@ -292,7 +292,7 @@ void KisAsyncMerger::startMerge(KisBaseRectsWalker &walker, bool notifyClones) {
warnImage << " Start node:" << walker.startNode() << "Requested rect:" << walker.requestedRect();
warnImage << " An inconsistency in the walkers occurred!";
warnImage << " Please report a bug describing how you got this message.";
// reset projection to avoid artefacts in next merges and allow people to work further
// reset projection to avoid artifacts in next merges and allow people to work further
resetProjection();
}
}
......
......@@ -76,7 +76,7 @@ KisBaseNode::KisBaseNode()
/**
* Be cautious! These two calls are vital to warm-up KoProperties.
* We use it and its QMap in a threaded environment. This is not
* officially suported by Qt, but our environment guarantees, that
* officially supported by Qt, but our environment guarantees, that
* there will be the only writer and several readers. Whilst the
* value of the QMap is boolean and there are no implicit-sharing
* calls provocated, it is safe to work with it in such an
......
......@@ -274,7 +274,7 @@ public:
/**
* Merge the specified properties with the properties of this
* layer. Whereever these properties overlap, the value of the
* layer. Wherever these properties overlap, the value of the
* node properties is changed. No properties on the node are
* deleted. If there are new properties in this list, they will be
* added on the node.
......
......@@ -43,7 +43,7 @@ class KisConfigWidget;
/**
* Base class for classes that process areas of pixels.
* Processors can either read in pixels and write out pixels
* or just write out pixels, using a certain set of configuation
* or just write out pixels, using a certain set of configuration
* pixels.
*
* in-out processing is typically filtering: @see KisFilter.
......
......@@ -124,7 +124,7 @@ qreal KisFastMath::atan2(qreal y, qreal x)
}
// we are in quadrant 3
y = -y;
// flip y so we can use it as a positve
// flip y so we can use it as a positive
// now figure out which side of the 45 degree line
if (x > y) {
return(-M_PI + calcAngle(x, y));
......
......@@ -27,7 +27,7 @@
#include "kritaimage_export.h"
/**
* This namespace countains fast but inaccurate version of mathematical function.
* This namespace contains fast but inaccurate version of mathematical function.
*/
namespace KisFastMath {
......
......@@ -76,7 +76,7 @@ QRect KisFilterMask::decorateRect(KisPaintDeviceSP &src,
Q_ASSERT(nodeProgressProxy());
Q_ASSERT_X(src != dst, "KisFilterMask::decorateRect",
"src must be != dst, because we cant create transactions "
"src must be != dst, because we can't create transactions "
"during merge, as it breaks reentrancy");
if (!filterConfig) {
......
......@@ -44,7 +44,7 @@ qint32 KisHermiteFilterStrategy::intValueAt(qint32 t) const
if (t < 256) {
t = (2 * t - 3 * 256) * t * t + (256 << 16);
//go from .24 fixed point to .8 fixedpoint (hack only works with positve numbers, which it is)
//go from .24 fixed point to .8 fixedpoint (hack only works with positive numbers, which it is)
t = (t + 0x8000) >> 16;
// go from .8 fixed point to 8bitscale. ie t = (t*255)/256;
......@@ -62,7 +62,7 @@ qint32 KisBicubicFilterStrategy::intValueAt(qint32 t) const
if (t < 256) {
t = (3 * t - 5 * 256) * t * t / 2 + (256 << 16);
//go from .24 fixed point to .8 fixedpoint (hack only works with positve numbers, which it is)
//go from .24 fixed point to .8 fixedpoint (hack only works with positive numbers, which it is)
t = (t + 0x8000) >> 16;
// go from .8 fixed point to 8bitscale. ie t = (t*255)/256;
......@@ -74,7 +74,7 @@ qint32 KisBicubicFilterStrategy::intValueAt(qint32 t) const
/* f(t) = -0.5|t|^3 + 2.5|t|^2 + 4|t| - 2, -2 <= t <= 2 */
t = ((-t + 5 * 256) * t / 2 - 4 * 256 * 256) * t + (2 * 256 << 16);
//go from .24 fixed point to .8 fixedpoint (hack only works with positve numbers, which it is)
//go from .24 fixed point to .8 fixedpoint (hack only works with positive numbers, which it is)
t = (t + 0x8000) >> 16;
// go from .8 fixed point to 8bitscale. ie t = (t*255)/256;
......
......@@ -191,7 +191,7 @@ public:
QList<KoID> listKeys() const;
/**
* This function return a string formated in HTML that contains the descriptions of all objects
* This function return a string formatted in HTML that contains the descriptions of all objects
* (with a non empty description) stored in the registry.
*/
QString formattedDescriptions() const;
......
......@@ -94,13 +94,13 @@ public:
bool initialize(quint8 defaultValue = 0);
/**
* Changed the size of the internal buffer to accomodate the exact number of bytes
* Changed the size of the internal buffer to accommodate the exact number of bytes
* needed to store area bounds(). The allocated data is *not* initialized!
*/
void reallocateBufferWithoutInitialization();
/**
* If the size of the internal buffer is smller than the one needed to accomodate
* If the size of the internal buffer is smaller than the one needed to accommodate
* bounds(), resize the buffer. Otherwise, do nothing. The allocated data is neither
* copying or initialized!
*/
......
......@@ -562,7 +562,7 @@ KisGradientShapeStrategy* createPolygonShapeStrategy(const QPainterPath &path, c
}
/**
* TODO: make this call happen asyncronously when the user does nothing
* TODO: make this call happen asynchronously when the user does nothing
*/
void KisGradientPainter::precalculateShape()
{
......
......@@ -1442,7 +1442,7 @@ void KisImage::addSpontaneousJob(KisSpontaneousJob *spontaneousJob)
void KisImage::setProjectionUpdatesFilter(KisProjectionUpdatesFilterSP filter)
{
// udpate filters are *not* recursive!
// update filters are *not* recursive!
KIS_ASSERT_RECOVER_NOOP(!filter || !m_d->projectionUpdatesFilter);
m_d->projectionUpdatesFilter = filter;
......
......@@ -269,7 +269,7 @@ public:
* undo stack using the adapter. This adapter is used for a backward
* compatibility for old commands created before strokes. It blocks
* all the porcessing at the scheduler, waits until it's finished
* adn executes commands exclusively.
* and executes commands exclusively.
*/
KisUndoAdapter* undoAdapter() const;
......
......@@ -360,7 +360,7 @@ void KisImageAnimationInterface::notifyNodeChanged(const KisNode *node,
}
// we compress the updated rect (atm, noone uses it anyway)
// we compress the updated rect (atm, no one uses it anyway)
QRect unitedRect;
Q_FOREACH (const QRect &rc, rects) {
unitedRect |= rc;
......
......@@ -86,7 +86,7 @@ public Q_SLOTS:
public:
/**
* Start a backgroud thread that will recalculate some extra frame.
* Start a background thread that will recalculate some extra frame.
* The result will be reported using two types of signals:
*
* 1) KisImage::sigImageUpdated() will be emitted for every chunk
......
......@@ -236,7 +236,7 @@ QString KisImageConfig::swapDir(bool requestDefault)
// tell us otherwise.
// the other option here would be to use a "garbled name" temp file (i.e. no name
// KRITA_SWAP_FILE_XXXXXX) in an obsure /var/folders place, which is not
// KRITA_SWAP_FILE_XXXXXX) in an obscure /var/folders place, which is not
// nice to the user. having a clearly named swap file in the home folder is
// much nicer to Krita's users.
......
......@@ -186,7 +186,7 @@ public:
* Decendands override this to create specific merged types when possible.
* The KisLayer one creates a KisPaintLayerSP via a bitBlt, and can work on all layer types.
*
* Decendants that perform there own version do NOT call KisLayer::createMergedLayer
* Descendants that perform their own version do NOT call KisLayer::createMergedLayer
*/
virtual KisLayerSP createMergedLayerTemplate(KisLayerSP prevLayer);
virtual void fillMergedLayerTemplate(KisLayerSP dstLayer, KisLayerSP prevLayer);
......
......@@ -29,8 +29,8 @@
#include "kis_image.h"
/**
* Storage class for layer compositions. Layer compositions allow to have several state for visible layers
* e.g. used in storyboarding with one background and differnt foregrounds
* Storage class for layer compositions. Layer compositions allow to have several states for visible layers
* e.g. used in storyboarding with one background and different foregrounds
*/
class KRITAIMAGE_EXPORT KisLayerComposition
{
......
......@@ -348,7 +348,7 @@ namespace KisLayerUtils {
CreateMergedLayer(MergeDownInfoSP info) : m_info(info) {}
void populateChildCommands() override {
// actual merging done by KisLayer::createMergedLayer (or specialized decendant)
// actual merging done by KisLayer::createMergedLayer (or specialized descendant)
m_info->dstNode = m_info->currLayer->createMergedLayerTemplate(m_info->prevLayer);
if (m_info->frames.size() > 0) {
......@@ -426,7 +426,7 @@ namespace KisLayerUtils {
MergeLayers(MergeDownInfoSP info) : m_info(info) {}
void populateChildCommands() override {
// actual merging done by KisLayer::createMergedLayer (or specialized decendant)
// actual merging done by KisLayer::createMergedLayer (or specialized descendant)
m_info->currLayer->fillMergedLayerTemplate(m_info->dstLayer(), m_info->prevLayer);
}
......
......@@ -46,7 +46,7 @@ typedef KisSafeReadList<KisNodeSP> KisSafeReadNodeList;
#include "kis_keyframe_channel.h"
/**
*The link between KisProjection ans KisImageUpdater
*The link between KisProjection and KisImageUpdater
*uses queued signals with an argument of KisNodeSP type,
*so we should register it beforehand
*/
......
......@@ -222,7 +222,7 @@ public:
QRect exactBoundsAmortized() const;
/**
* Retuns exact rectangle of the paint device that contains
* Returns exact rectangle of the paint device that contains
* non-default pixels. For paint devices with fully transparent
* default pixel is equivalent to exactBounds().
*
......@@ -618,7 +618,7 @@ public:
* 2) Fill it with the desired color or data
*
* 3) Create a KisPainter and set all the properties of the
* trasaction: selection, compositeOp, opacity and etc.
* transaction: selection, compositeOp, opacity and etc.
*
* 4) Paint a newly created paint device over the destination
* device.
......
......@@ -43,7 +43,7 @@ class KRITAIMAGE_EXPORT KisPaintLayer : public KisLayer, public KisIndirectPaint
public:
/**
* Construct a paint layer with the given parameters. The default bounds of the paintdevice are overwriten.
* Construct a paint layer with the given parameters. The default bounds of the paintdevice are overwritten.
* @param image this layer belongs to, or null, if it shouldn't belong to any image
* @param name of the layer
* @param opacity in the range between OPACITY_TRANSPARENT_U8 and OPACITY_OPAQUE_U8
......
......@@ -1830,7 +1830,7 @@ void KisPainter::drawWuLine(const QPointF & start, const QPointF & end)
yd = (y2 - y1);
}
grad = yd / xd;
// nearest X,Y interger coordinates
// nearest X,Y integer coordinates
xend = x1;
yend = y1 + grad * (xend - x1);
......@@ -1932,7 +1932,7 @@ void KisPainter::drawWuLine(const QPointF & start, const QPointF & end)
grad = xd / yd;
// nearest X,Y interger coordinates
// nearest X,Y integer coordinates
yend = y1;
xend = x1 + grad * (yend - y1);
......
......@@ -46,7 +46,7 @@ public:
*/
quint64 randomAt(qint64 x, qint64 y);
/**
* @return the constant random value correspoding to a given pixel, the value is between 0
* @return the constant random value corresponding to a given pixel, the value is between 0
* and 1.0
*/
double doubleRandomAt(qint64 x, qint64 y);
......
......@@ -47,7 +47,7 @@ public:
* treadsafe and non-threadsafe. The methods from the first group
* can be called concurrently with each other. The ones form
* the other group can't be called concurrently (even with the
* firends from the first group) and must have an exclusive
* friends from the first group) and must have an exclusive
* access to the list.
*/
......
......@@ -139,7 +139,7 @@ protected:
*
* Requirements:
* * must be called *only* from within the context of the strokes
* worker thread during exectution one of its jobs
* worker thread during execution of one of its jobs
*
* Guarantees:
* * the added job is guaranteed to be executed in some time after
......
......@@ -153,7 +153,7 @@ KisSuspendProjectionUpdatesStrokeStrategy::KisSuspendProjectionUpdatesStrokeStra
/**
* Here we add a dumb INIT job so that KisStrokesQueue would know that the
* stroke has already started or not. When the queue reaches the resume
* stroke ans starts its execution, no Lod0 can execute anymore. So all the
* stroke and starts its execution, no Lod0 can execute anymore. So all the
* new Lod0 strokes should go to the end of the queue and wrapped into
* their own Suspend/Resume pair.
*/
......
......@@ -229,7 +229,7 @@ QRect KisTransformMask::decorateRect(KisPaintDeviceSP &src,
PositionToFilthy maskPos) const
{
Q_ASSERT_X(src != dst, "KisTransformMask::decorateRect",
"src must be != dst, because we cant create transactions "
"src must be != dst, because we can't create transactions "
"during merge, as it breaks reentrancy");
KIS_ASSERT_RECOVER(m_d->params) { return rc; }
......
......@@ -100,7 +100,7 @@ public:
m_exclusiveJobLock->unlock();
// try to exit the loop. Please note, that noone can flip the state from
// try to exit the loop. Please note, that no one can flip the state from
// WAITING to EMPTY except ourselves!
Type expectedValue = Type::WAITING;
if (m_atomicType.compare_exchange_strong(expectedValue, Type::EMPTY)) {
......
......@@ -60,7 +60,7 @@ public:
/**
* @brief run the filling process using the passes height map, strokes, and write
* the result coloring into the destination device
* @param cleanUpAmount shows how agressively we should try to clean up the filnal
* @param cleanUpAmount shows how aggressively we should try to clean up the final
* coloring. Should be in range [0.0...1.0]
*/
......
......@@ -186,7 +186,7 @@ class bk_max_flow {
set_edge_to_parent(current_node, from_source);
put(m_dist_map, current_node, 1);
put(m_time_map, current_node, 1);
// add stuff to flow and update residuals. we dont need to
// add stuff to flow and update residuals. we don't need to
// update reverse_edges, as incoming/outgoing edges to/from
// source/sink don't count for max-flow
put(m_res_cap_map, from_source, get(m_res_cap_map, from_source) - cap_to_sink);
......@@ -198,7 +198,7 @@ class bk_max_flow {
set_edge_to_parent(current_node, to_sink);
put(m_dist_map, current_node, 1);
put(m_time_map, current_node, 1);
// add stuff to flow and update residuals. we dont need to update
// add stuff to flow and update residuals. we don't need to update
// reverse_edges, as incoming/outgoing edges to/from source/sink
// don't count for max-flow
put(m_res_cap_map, to_sink, get(m_res_cap_map, to_sink) - cap_from_source);
......@@ -256,7 +256,7 @@ class bk_max_flow {
if(get(m_res_cap_map, out_edge) > 0){ //check if we have capacity left on this edge
vertex_descriptor other_node = target(out_edge, m_g);
if(get_tree(other_node) == tColorTraits::gray()){ //it's a free node
set_tree(other_node, tColorTraits::black()); //aquire other node to our search tree
set_tree(other_node, tColorTraits::black()); //acquire other node to our search tree
set_edge_to_parent(other_node, out_edge); //set us as parent
put(m_dist_map, other_node, get(m_dist_map, current_node) + 1); //and update the distance-heuristic
put(m_time_map, other_node, get(m_time_map, current_node));
......@@ -290,7 +290,7 @@ class bk_max_flow {
if(get(m_res_cap_map, in_edge) > 0){ //check if there is capacity left
vertex_descriptor other_node = source(in_edge, m_g);
if(get_tree(other_node) == tColorTraits::gray()){ //it's a free node
set_tree(other_node, tColorTraits::white()); //aquire that node to our search tree
set_tree(other_node, tColorTraits::white()); //acquire that node to our search tree
set_edge_to_parent(other_node, in_edge); //set us as parent
add_active_node(other_node); //activate that node
put(m_dist_map, other_node, get(m_dist_map, current_node) + 1); //set its distance
......
......@@ -40,7 +40,7 @@ struct PathElement {
struct Q_DECL_HIDDEN KisNodeQueryPath::Private {
QList<PathElement> elements;
bool relative;
/// This function will remove uneeded call to parent, for instance, "1/../3/../5" => "5"
/// This function will remove unneeded call to parent, for instance, "1/../3/../5" => "5"
void simplifyPath() {
// No elements then return
if (elements.isEmpty()) return;
......
......@@ -101,7 +101,7 @@ void KisAsyncMergerTest::testMerger()
walker.collectRects(paintLayer2, testRect4);
merger.startMerge(walker);
// Old style merging: has artefacts at x=100 and x=500
// Old style merging: has artifacts at x=100 and x=500
// And should be turned on inside KisLayer
/* paintLayer2->setDirty(testRect1);
QTest::qSleep(3000);
......
......@@ -160,7 +160,7 @@ void KisCloneLayerTest::testRemoveSourceLayer()
KisNodeSP group1 = groupLayer1(image);
/**
* We are checking that noone keeps a pointer to the
* We are checking that no one keeps a pointer to the
* source layer after it is deleted. Uncomment the first
* line to see how perfectly it crashed if removing the
* source directly through the node facade
......
......@@ -1236,7 +1236,7 @@ void testWrappedLineIteratorReadMoreThanBounds(QString testName)
}
}
// test rect doesn't fit the wrap rect in both dimentions
// test rect doesn't fit the wrap rect in both dimensions
const QRect &rect(bounds.adjusted(-6,-6,8,8));
KisRandomAccessorSP dstIt = dst->createRandomAccessorNG(rect.x(), rect.y());
IteratorSP it = createIterator<IteratorSP>(dev, rect);
......
......@@ -156,7 +156,7 @@ private:
QMutex m_COWMutex;
/**
* This lock is used to ensure noone will read the tile data
* This lock is used to ensure no one will read the tile data
* before it has been loaded from to the memory.
*/
mutable QMutex m_swapBarrierLock;
......
......@@ -24,7 +24,7 @@
* KisTileDataStoreClockIterator
* - are general iterators for the contents of KisTileDataStore.
* The store starts holding a lock when returns one of such
* iterators, so noone will be able to change the list while
* iterators, so no one will be able to change the list while
* you are iterating.
*
* But be careful! You can't change the list while iterating either,
......
......@@ -90,7 +90,7 @@ KisTiledDataManager::~KisTiledDataManager()
* dynamically allocated We need to destroy them in that very order. The
* reason is that when hash table destroying all her child tiles they all
* cry about it to The Memento Manager using a pointer. So The Memento
* Manager sould be alive during that destruction. We could use shared
* Manager should be alive during that destruction. We could use shared
* pointers instead, but they create too much overhead.
*/
delete m_hashTable;
......
......@@ -30,7 +30,7 @@ KisMemoryWindow::KisMemoryWindow(const QString &swapDir, quint64 writeWindowSize
m_valid = true;
// swapDir will never be empty, as KisImageConfig::swapDir() always provides
// us with a (platform specific) default directory, even if none is explicity
// us with a (platform specific) default directory, even if none is explicitly
// configured by the user; also we do not want any logic that determines the
// default swap dir here.
Q_ASSERT(!swapDir.isEmpty());
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment