Reverts silly grammar changes.
Espreon please stop changing the code to your favourite flavour of English, again it cost me a lot of time to find a bug caused by your changes. (Reverts 2012-11-23T02:12:26Z!Majora700@gmail.com.)
This commit is contained in:
parent
0f12eee9c6
commit
d6e7d12972
10 changed files with 15 additions and 15 deletions
|
@ -352,9 +352,9 @@ struct tidiv<T, 8>
|
|||
};
|
||||
|
||||
/**
|
||||
* An optimized version of the division operator.
|
||||
* An optimised version of the division operator.
|
||||
*
|
||||
* This version is optimized to maintain the highest numeric stability when
|
||||
* This version is optimised to maintain the highest numeric stability when
|
||||
* dividing.
|
||||
*
|
||||
* As documented at operator/():
|
||||
|
@ -402,7 +402,7 @@ struct tidiv<T, 8>
|
|||
* * divide.
|
||||
* * shift the result up by the required number of bits.
|
||||
*
|
||||
* The code has some other optimizations as well. On a 2-complement system
|
||||
* The code has some other optimisations as well. On a 2-complement system
|
||||
* there are additional tests required for negative and positive values, to
|
||||
* remove these branches, the code uses a temporary value which contains the
|
||||
* positive value.
|
||||
|
|
|
@ -35,7 +35,7 @@ struct tpoint;
|
|||
* Base class for the placement helper.
|
||||
*
|
||||
* The normal operation for the usage of the class is:
|
||||
* * Call @ref initialize().
|
||||
* * Call @ref initialise().
|
||||
* * For every visible child item call @ref add_item() with the wanted size of
|
||||
* the widget.
|
||||
* Once this is done the required size for all children can be retrieved with
|
||||
|
@ -95,7 +95,7 @@ public:
|
|||
* reset, items are placed, removed or changed visibility causing the old
|
||||
* placement to be invalid.
|
||||
*/
|
||||
virtual void initialize() = 0;
|
||||
virtual void initialise() = 0;
|
||||
|
||||
/**
|
||||
* Adds a item to be placed.
|
||||
|
|
|
@ -36,7 +36,7 @@ tplacer_horizontal_list::tplacer_horizontal_list(const unsigned maximum_rows)
|
|||
assert(maximum_rows_ > 0);
|
||||
}
|
||||
|
||||
void tplacer_horizontal_list::initialize()
|
||||
void tplacer_horizontal_list::initialise()
|
||||
{
|
||||
std::fill(rows_.begin(), rows_.end(), 0);
|
||||
columns_.clear();
|
||||
|
|
|
@ -47,7 +47,7 @@ public:
|
|||
|
||||
/***** ***** Inherited operations. ***** *****/
|
||||
|
||||
virtual void initialize();
|
||||
virtual void initialise();
|
||||
|
||||
virtual void add_item(const tpoint& size);
|
||||
|
||||
|
|
|
@ -36,7 +36,7 @@ tplacer_vertical_list::tplacer_vertical_list(const unsigned maximum_columns)
|
|||
assert(maximum_columns_ > 0);
|
||||
}
|
||||
|
||||
void tplacer_vertical_list::initialize()
|
||||
void tplacer_vertical_list::initialise()
|
||||
{
|
||||
rows_.clear();
|
||||
rows_.push_back(std::make_pair(0, 0));
|
||||
|
|
|
@ -46,7 +46,7 @@ public:
|
|||
|
||||
/***** ***** Inherited operations. ***** *****/
|
||||
|
||||
virtual void initialize();
|
||||
virtual void initialise();
|
||||
|
||||
virtual void add_item(const tpoint& size);
|
||||
|
||||
|
|
|
@ -349,7 +349,7 @@ void tpane::place_or_set_origin_children()
|
|||
void tpane::prepare_placement() const
|
||||
{
|
||||
assert(placer_.get());
|
||||
placer_->initialize();
|
||||
placer_->initialise();
|
||||
|
||||
FOREACH(const AUTO& item, items_) {
|
||||
if(item.grid->get_visible() == twidget::INVISIBLE) {
|
||||
|
|
|
@ -1577,7 +1577,7 @@ surface blend_surface(
|
|||
|
||||
#ifdef PANDORA
|
||||
/*
|
||||
* Use an optimized version of the generic algorithm. The optimized
|
||||
* Use an optimised version of the generic algorithm. The optimised
|
||||
* version processes 8 pixels a time. If the number of pixels is not an
|
||||
* exact multiple of 8 it falls back to the generic algorithm to handle
|
||||
* the last pixels.
|
||||
|
|
|
@ -790,9 +790,9 @@ static std::string number_to_string_(t_terrain terrain, const int start_position
|
|||
}
|
||||
|
||||
/*
|
||||
* The initialization of tcode is done to make gcc-4.7 happy. Otherwise it
|
||||
* some uninitialized fields might be used. Its analysis are wrong, but
|
||||
* initialize to keep it happy.
|
||||
* The initialisation of tcode is done to make gcc-4.7 happy. Otherwise it
|
||||
* some uninitialised fields might be used. Its analysis are wrong, but
|
||||
* initialise to keep it happy.
|
||||
*/
|
||||
unsigned char tcode[9] = {0};
|
||||
// Insert the terrain tcode
|
||||
|
|
|
@ -35,7 +35,7 @@ struct ttracer
|
|||
*
|
||||
* When the constructor gets a valid @ref ttracer pointer it prints the
|
||||
* tracing statistics in its destructor. This allows the structure to be
|
||||
* initialized at the beginning of a scope and print the statistics once
|
||||
* initialised at the beginning of a scope and print the statistics once
|
||||
* the scope is left. (This makes it easier to write the tracing macros.)
|
||||
*/
|
||||
struct tprint
|
||||
|
|
Loading…
Add table
Reference in a new issue