spelling: fulfill

diff --git a/src/lib/dhcpsrv/cfg_subnets4.h b/src/lib/dhcpsrv/cfg_subnets4.h
index a065ddc7a562ee4b8b47e48010917c17d931be68..c2b72429e03c6991cbfa5afbebf751c9b51dfef2 100644 (file)
--- a/src/lib/dhcpsrv/cfg_subnets4.h
+++ b/src/lib/dhcpsrv/cfg_subnets4.h
@@ -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

diff --git a/src/lib/dhcpsrv/cfg_subnets6.h b/src/lib/dhcpsrv/cfg_subnets6.h
index a027dd7d311183525196d252e756f8c7db76bbc4..18e1ca866f66d86adc329a6e13b27deab188f3ab 100644 (file)
--- a/src/lib/dhcpsrv/cfg_subnets6.h
+++ b/src/lib/dhcpsrv/cfg_subnets6.h
@@ -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

diff --git a/src/lib/dhcpsrv/libdhcpsrv.dox b/src/lib/dhcpsrv/libdhcpsrv.dox
index 28b86481f67a22c26f2e0951c3771af45fa319a2..a8dc6cca707eb5aba8eae8ccbe9ff5e3a1858d69 100644 (file)
--- a/src/lib/dhcpsrv/libdhcpsrv.dox
+++ b/src/lib/dhcpsrv/libdhcpsrv.dox
@@ -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

diff --git a/src/lib/dhcpsrv/tests/alloc_engine_expiration_unittest.cc b/src/lib/dhcpsrv/tests/alloc_engine_expiration_unittest.cc
index 770df153ee64fc758e4047104228e846c1f3c731..f955ecd25d2d22cd7577231931f06fca9cb46a46 100644 (file)
--- a/src/lib/dhcpsrv/tests/alloc_engine_expiration_unittest.cc
+++ b/src/lib/dhcpsrv/tests/alloc_engine_expiration_unittest.cc
@@ -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);