Commit 22f5c120 authored by Josh Soref's avatar Josh Soref
Browse files

spelling: fulfill

parent 16b29932
......@@ -82,7 +82,7 @@ public:
///
/// @todo This method requires performance improvement! It currently
/// iterates over all existing subnets (possibly a couple of times)
/// to find the one which fulfils the search criteria. The subnet storage
/// to find the one which fulfills the search criteria. The subnet storage
/// is implemented as a simple STL vector which precludes fast searches
/// using specific keys. Hence, full scan is required. To improve the
/// search performance a different container type is required, e.g.
......@@ -105,7 +105,7 @@ public:
/// @c selectSubnet(SubnetSelector).
///
/// @todo This method requires performance improvement! It currently
/// iterates over all existing subnets to find the one which fulfils
/// iterates over all existing subnets to find the one which fulfills
/// the search criteria. The subnet storage is implemented as a simple
/// STL vector which precludes fast searches using specific keys.
/// Hence, full scan is required. To improve the search performance a
......@@ -130,7 +130,7 @@ public:
/// @c selectSubnet(SubnetSelector).
///
/// @todo This method requires performance improvement! It currently
/// iterates over all existing subnets to find the one which fulfils
/// iterates over all existing subnets to find the one which fulfills
/// the search criteria. The subnet storage is implemented as a simple
/// STL vector which precludes fast searches using specific keys.
/// Hence, full scan is required. To improve the search performance a
......
......@@ -74,7 +74,7 @@ public:
///
/// @todo This method requires performance improvement! It currently
/// iterates over all existing subnets (possibly a couple of times)
/// to find the one which fulfils the search criteria. The subnet storage
/// to find the one which fulfills the search criteria. The subnet storage
/// is implemented as a simple STL vector which precludes fast searches
/// using specific keys. Hence, full scan is required. To improve the
/// search performance a different container type is required, e.g.
......@@ -107,7 +107,7 @@ public:
///
/// @todo This method requires performance improvement! It currently
/// iterates over all existing subnets (possibly a couple of times)
/// to find the one which fulfils the search criteria. The subnet storage
/// to find the one which fulfills the search criteria. The subnet storage
/// is implemented as a simple STL vector which precludes fast searches
/// using specific keys. Hence, full scan is required. To improve the
/// search performance a different container type is required, e.g.
......@@ -156,7 +156,7 @@ private:
/// name, the subnet is returned.
///
/// @todo This method requires performance improvement! It currently
/// iterates over all existing subnets to find the one which fulfils
/// iterates over all existing subnets to find the one which fulfills
/// the search criteria. The subnet storage is implemented as a
/// simple STL vector which precludes fast searches using specific
/// keys. Hence, full scan is required. To improve the search
......@@ -180,7 +180,7 @@ private:
/// subnet is returned.
///
/// @todo This method requires performance improvement! It currently
/// iterates over all existing subnets to find the one which fulfils
/// iterates over all existing subnets to find the one which fulfills
/// the search criteria. The subnet storage is implemented as a
/// simple STL vector which precludes fast searches using specific
/// keys. Hence, full scan is required. To improve the search
......
......@@ -82,7 +82,7 @@ one that occurred before it etc.
All configuration classes are derived from the abstract base class
\ref isc::data::CfgToElement and define the toElement virtual method
which returns a \ref isc::data::ConstElementPtr which must be
parsed into the same object, i.e. fullfil this property:
parsed into the same object, i.e. fulfill this property:
@code
for all valid C: parse(parse(C)->toElement()) == parse(C)
@endcode
......
......@@ -132,7 +132,7 @@ std::string callout_argument_name("lease4");
/// to mark leases with even indexes as expired and then test whether
/// leases with even indexes have been successfully reclaimed.
///
/// The "lease algorithm" verifies if the given lease fulfils the
/// The "lease algorithm" verifies if the given lease fulfills the
/// specific conditions after reclamation. These are the examples of
/// the lease algorithms:
/// - leaseExists - lease still exists in the database,
......@@ -144,7 +144,7 @@ std::string callout_argument_name("lease4");
/// - dnsUpdateNotGeneratedForLease - DNS updates not generated for lease
///
/// The combination of index algorithm and lease algorithm allows for
/// verifying that the whole sets of leases in the lease database fulfil
/// verifying that the whole sets of leases in the lease database fulfill
/// certain conditions. For example, it is possible to verify that
/// after lease reclamation leases with even indexes have state set to
/// "expired-reclaimed".
......@@ -359,7 +359,7 @@ public:
LeasePtrType lease = getLease(i);
// index_algorithm(i) checks if the lease should be checked.
// If so, check if the lease_algorithm indicates that the
// lease fulfils a given condition, e.g. is present in the
// lease fulfills a given condition, e.g. is present in the
// database. If not, return false.
if (index_algorithm(i) && !lease_algorithm(lease)) {
return (false);
......
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