From 33613a85afc4b1481367fbe92a17ee59c240250b Mon Sep 17 00:00:00 2001
From: Sven Eisenhauer <sven@sven-eisenhauer.net>
Date: Fri, 10 Nov 2023 15:11:48 +0100
Subject: add new repo

---
 Bachelor/Prog1/examples/ch08/Fig08_10_12/Date1.cpp | 137 +++++++++++++++++++++
 1 file changed, 137 insertions(+)
 create mode 100644 Bachelor/Prog1/examples/ch08/Fig08_10_12/Date1.cpp

(limited to 'Bachelor/Prog1/examples/ch08/Fig08_10_12/Date1.cpp')

diff --git a/Bachelor/Prog1/examples/ch08/Fig08_10_12/Date1.cpp b/Bachelor/Prog1/examples/ch08/Fig08_10_12/Date1.cpp
new file mode 100644
index 0000000..0c96a95
--- /dev/null
+++ b/Bachelor/Prog1/examples/ch08/Fig08_10_12/Date1.cpp
@@ -0,0 +1,137 @@
+// Fig. 8.11: date1.cpp
+// Date class member function definitions.
+#include <iostream>
+#include "date1.h"
+
+// initialize static member at file scope; 
+// one class-wide copy
+const int Date::days[] = 
+   { 0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
+
+// Date constructor
+Date::Date( int m, int d, int y ) 
+{ 
+   setDate( m, d, y ); 
+
+} // end Date constructor
+
+// set month, day and year
+void Date::setDate( int mm, int dd, int yy )
+{
+   month = ( mm >= 1 && mm <= 12 ) ? mm : 1;
+   year = ( yy >= 1900 && yy <= 2100 ) ? yy : 1900;
+
+   // test for a leap year
+   if ( month == 2 && leapYear( year ) )
+      day = ( dd >= 1 && dd <= 29 ) ? dd : 1;
+   else
+      day = ( dd >= 1 && dd <= days[ month ] ) ? dd : 1;
+
+} // end function setDate
+
+// overloaded preincrement operator 
+Date &Date::operator++()
+{
+   helpIncrement();
+
+   return *this;  // reference return to create an lvalue
+
+} // end function operator++
+
+// overloaded postincrement operator; note that the dummy 
+// integer parameter does not have a parameter name
+Date Date::operator++( int )
+{
+   Date temp = *this;
+   helpIncrement();  // hold current state of object
+
+   // return unincremented, saved, temporary object
+   return temp;   // value return; not a reference return
+
+} // end function operator++
+
+// add specified number of days to date
+const Date &Date::operator+=( int additionalDays )
+{
+   for ( int i = 0; i < additionalDays; i++ )
+      helpIncrement();
+
+   return *this;    // enables cascading
+
+} // end function operator+=
+
+// if the year is a leap year, return true; 
+// otherwise, return false
+bool Date::leapYear( int testYear ) const
+{
+   if ( testYear % 400 == 0 || 
+      ( testYear % 100 != 0 && testYear % 4 == 0 ) )
+      return true;   // a leap year
+   else
+      return false;  // not a leap year
+
+} // end function leapYear
+
+// determine whether the day is the last day of the month
+bool Date::endOfMonth( int testDay ) const
+{
+   if ( month == 2 && leapYear( year ) )
+      return testDay == 29; // last day of Feb. in leap year
+   else
+      return testDay == days[ month ];
+
+} // end function endOfMonth
+
+// function to help increment the date
+void Date::helpIncrement()
+{
+   // day is not end of month
+   if ( !endOfMonth( day ) )
+      ++day;
+
+   else 
+      
+      // day is end of month and month < 12
+      if ( month < 12 ) {
+         ++month;
+         day = 1;
+      }
+
+      // last day of year
+      else {
+         ++year;
+         month = 1;
+         day = 1;
+      }
+
+} // end function helpIncrement
+
+// overloaded output operator
+ostream &operator<<( ostream &output, const Date &d )
+{
+   static char *monthName[ 13 ] = { "", "January",
+      "February", "March", "April", "May", "June",
+      "July", "August", "September", "October",
+      "November", "December" };
+
+   output << monthName[ d.month ] << ' '
+          << d.day << ", " << d.year;
+
+   return output;   // enables cascading
+
+} // end function operator<<
+
+/**************************************************************************
+ * (C) Copyright 1992-2003 by Deitel & Associates, Inc. and Prentice      *
+ * Hall. All Rights Reserved.                                             *
+ *                                                                        *
+ * DISCLAIMER: The authors and publisher of this book have used their     *
+ * best efforts in preparing the book. These efforts include the          *
+ * development, research, and testing of the theories and programs        *
+ * to determine their effectiveness. The authors and publisher make       *
+ * no warranty of any kind, expressed or implied, with regard to these    *
+ * programs or to the documentation contained in these books. The authors *
+ * and publisher shall not be liable in any event for incidental or       *
+ * consequential damages in connection with, or arising out of, the       *
+ * furnishing, performance, or use of these programs.                     *
+ *************************************************************************/
\ No newline at end of file
-- 
cgit v1.2.3