main.pwn General summary of this script
Section
Subsection tagged some param [] some other param this is shizzle func no comment absolutely nothing freeform seealso text with strong The month number, a value between 1 and 12. The year in 4 digits. Returns the number of days in a month (the month is an integer in the range 1 .. 12). One needs to pass in the year as well, because the function takes leap years into account. aoo

func, and now a word after two line breaks: word. this one will end with a <p/>

this is the line after that <p/>, and this one will end with a <br/>
line after brrr

this line is completely wrapped in p tag

example using paramref: and a code block: blah blah secondline [1]: also support for superscript[1] somethingggg alsofd code it hj such remark

wew freeform text with strong second freeform text The year in 4 digits.

Returns whether a year is a leap year. A year is a leap year:
  • if it is divisable by 4,
  • but not if it is divisable by 100,
  • but it is it is divisable by 400.
The main program: asks the user to input a date and prints on what day of the week that date falls. [] [] {Float,Fixed,_} & Will hold the day number upon return. & Will hold the month number upon return. & Will hold the year number upon return. Reads a date and stores it in three separate fields. tata true if the date is valid, false otherwise; if the function returns false, the values of , and cannot be relied upon. The day in the month, a value between 1 and 31. The month: a value between 1 and 12. The year in four digits. The core function of Zeller’s congruence algorithm. The function works for the Gregorian calender. The day of the week, where 0 is Saturday and 6 is Friday. The day fdfdfdfis Saturday and 6 is Friday. This function does not check the validity of the date; when the date in the parameters is invalid, the returned "day of the week" will hold an incorrect value.

This equation fails in many programming languages, notably most implementations of C, C++ and Pascal, because these languages have a loosely defined "remainder" operator. Pawn, on the other hand, provides the true modulus operator, as defined in mathematical theory and as was intended by Zeller. For Zeller’s congruence algorithm, the months January and February are the 13th and 14th month of the preceding year. The idea is that the "difficult month" February (which has either 28 or 29 days) is moved to the end of the year.