Index: src/tests/concurrent/examples/datingService.c
===================================================================
--- src/tests/concurrent/examples/datingService.c	(revision c107f4ecc663a3ac0d0b52ca7337d2ed7db1224b)
+++ src/tests/concurrent/examples/datingService.c	(revision 13e8427b41e29d52c2ff676adeeabbb22b910b3a)
@@ -8,6 +8,6 @@
 // Created On       : Mon Oct 30 12:56:20 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Wed Mar 14 22:48:40 2018
-// Update Count     : 23
+// Last Modified On : Sun May 27 09:05:18 2018
+// Update Count     : 26
 //
 
@@ -18,8 +18,8 @@
 #include <unistd.h>										// getpid
 
-enum { NoOfPairs = 20 };
+enum { CompCodes = 20 };								// number of compatibility codes
 
 monitor DatingService {
-	condition Girls[NoOfPairs], Boys[NoOfPairs];
+	condition Girls[CompCodes], Boys[CompCodes];
 	unsigned int GirlPhoneNo, BoyPhoneNo;
 }; // DatingService
@@ -47,6 +47,6 @@
 } // DatingService boy
 
-unsigned int girlck[NoOfPairs];
-unsigned int boyck[NoOfPairs];
+unsigned int girlck[CompCodes];
+unsigned int boyck[CompCodes];
 
 thread Girl {
@@ -88,20 +88,20 @@
 int main() {
 	DatingService TheExchange;
-	Girl * girls[NoOfPairs];
-	Boy  * boys[NoOfPairs];
+	Girl * girls[CompCodes];
+	Boy  * boys[CompCodes];
 
 	srandom( /*getpid()*/ 103 );
 
-	for ( unsigned int i = 0; i < NoOfPairs; i += 1 ) {
+	for ( unsigned int i = 0; i < CompCodes; i += 1 ) {
 		girls[i] = new( &TheExchange, i, i );
-		boys[i]  = new( &TheExchange, i, NoOfPairs - ( i + 1 ) );
+		boys[i]  = new( &TheExchange, i, CompCodes - ( i + 1 ) );
 	} // for
 
-	for ( unsigned int i = 0; i < NoOfPairs; i += 1 ) {
+	for ( unsigned int i = 0; i < CompCodes; i += 1 ) {
 		delete( boys[i] );
 		delete( girls[i] );
 	} // for
 
-	for ( unsigned int i = 0; i < NoOfPairs; i += 1 ) {
+	for ( unsigned int i = 0; i < CompCodes; i += 1 ) {
 		if ( girlck[ boyck[i] ] != boyck[ girlck[i] ] ) abort();
 	} // for