void flush(std::ostream& os) override
{
- // This class is not a serializer: this doens't make sense
+ // This class is not a serializer: this doesn't make sense
ceph_abort();
}
int get_len() const override
{
- // This class is not a serializer: this doens't make sense
+ // This class is not a serializer: this doesn't make sense
ceph_abort();
return 0;
}
void write_raw_data(const char *data) override
{
- // This class is not a serializer: this doens't make sense
+ // This class is not a serializer: this doesn't make sense
ceph_abort();
}
* Indicates if we are participating in the quorum.
*
* @remarks By default, we are created as participating. We may stop
- * participating if the Monitor explicitely calls
+ * participating if the Monitor explicitly calls
* Elector::stop_participating though. If that happens, it will
* have to call Elector::start_participating for us to resume
* participating in the quorum.
*
* When the election expires, we will check if we were the ones who won, and
* if so we will declare victory. If that is not the case, then we assume
- * that the one we defered to didn't declare victory quickly enough (in fact,
+ * that the one we deferred to didn't declare victory quickly enough (in fact,
* as far as we know, we may even be dead); so, just propose ourselves as the
* Leader.
*/
/**
* keep track of sum deltas, per-pool, taking into account any previous
* deltas existing in @p per_pool_sum_deltas. The utime_t as second member
- * of the pair is the timestamp refering to the last update (i.e., the first
+ * of the pair is the timestamp referring to the last update (i.e., the first
* member of the pair) for a given pool.
*/
mempool::pgmap::unordered_map<uint64_t, pair<pool_stat_t,utime_t> > per_pool_sum_delta;
// i am one state machine.
/**
- * This libary is based on the Paxos algorithm, but varies in a few key ways:
+ * This library is based on the Paxos algorithm, but varies in a few key ways:
* 1- Only a single new value is generated at a time, simplifying the recovery logic.
* 2- Nodes track "committed" values, and share them generously (and trustingly)
* 3- A 'leasing' mechanism is built-in, allowing nodes to determine when it is
* @note We force every service to implement this function, since we strongly
* desire the encoding of full versions.
* @note Services that do not trim their state, will be bound to only create
- * one full version. Full version stashing is determined/controled by
+ * one full version. Full version stashing is determined/controlled by
* trimming: we stash a version each time a trim is bound to erase the
* latest full version.
*