/[dtapublic]/to_be_filed/webprojs/fboprime/sw/phplib/datefunc.inc
ViewVC logotype

Annotation of /to_be_filed/webprojs/fboprime/sw/phplib/datefunc.inc

Parent Directory Parent Directory | Revision Log Revision Log


Revision 31 - (hide annotations) (download)
Sat Oct 8 18:44:20 2016 UTC (7 years, 7 months ago) by dashley
File size: 67796 byte(s)
Initial commit.
1 dashley 31 <?php
2     //$Header: /home/dashley/cvsrep/e3ft_gpl01/e3ft_gpl01/webprojs/fboprime/sw/phplib/datefunc.inc,v 1.10 2006/08/01 23:14:06 dashley Exp $
3     //********************************************************************************
4     //Copyright (C)2006 David T. Ashley
5     //********************************************************************************
6     //This program or source file is free software; you can redistribute it and/or
7     //modify it under the terms of the GNU General Public License as published by
8     //the Free Software Foundation; either version 2 of the License, or (at your
9     //option) any later version.
10     //
11     //This program or source file is distributed in the hope that it will
12     //be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
13     //MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14     //GNU General Public License for more details.
15     //
16     //You may have received a copy of the GNU General Public License
17     //along with this program; if not, write to the Free Software
18     //Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
19     //********************************************************************************
20     //Dave Ashley, 04/06
21     //-------------------------------------------------------------------------------------------------
22     //Copyright 2006 David T. Ashley
23     //-------------------------------------------------------------------------------------------------
24     //This source code and any program in which it is compiled/used is provided under the GNU GENERAL
25     //PUBLIC LICENSE, Version 3, full license text below.
26     //-------------------------------------------------------------------------------------------------
27     // GNU GENERAL PUBLIC LICENSE
28     // Version 3, 29 June 2007
29     //
30     // Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
31     // Everyone is permitted to copy and distribute verbatim copies
32     // of this license document, but changing it is not allowed.
33     //
34     // Preamble
35     //
36     // The GNU General Public License is a free, copyleft license for
37     //software and other kinds of works.
38     //
39     // The licenses for most software and other practical works are designed
40     //to take away your freedom to share and change the works. By contrast,
41     //the GNU General Public License is intended to guarantee your freedom to
42     //share and change all versions of a program--to make sure it remains free
43     //software for all its users. We, the Free Software Foundation, use the
44     //GNU General Public License for most of our software; it applies also to
45     //any other work released this way by its authors. You can apply it to
46     //your programs, too.
47     //
48     // When we speak of free software, we are referring to freedom, not
49     //price. Our General Public Licenses are designed to make sure that you
50     //have the freedom to distribute copies of free software (and charge for
51     //them if you wish), that you receive source code or can get it if you
52     //want it, that you can change the software or use pieces of it in new
53     //free programs, and that you know you can do these things.
54     //
55     // To protect your rights, we need to prevent others from denying you
56     //these rights or asking you to surrender the rights. Therefore, you have
57     //certain responsibilities if you distribute copies of the software, or if
58     //you modify it: responsibilities to respect the freedom of others.
59     //
60     // For example, if you distribute copies of such a program, whether
61     //gratis or for a fee, you must pass on to the recipients the same
62     //freedoms that you received. You must make sure that they, too, receive
63     //or can get the source code. And you must show them these terms so they
64     //know their rights.
65     //
66     // Developers that use the GNU GPL protect your rights with two steps:
67     //(1) assert copyright on the software, and (2) offer you this License
68     //giving you legal permission to copy, distribute and/or modify it.
69     //
70     // For the developers' and authors' protection, the GPL clearly explains
71     //that there is no warranty for this free software. For both users' and
72     //authors' sake, the GPL requires that modified versions be marked as
73     //changed, so that their problems will not be attributed erroneously to
74     //authors of previous versions.
75     //
76     // Some devices are designed to deny users access to install or run
77     //modified versions of the software inside them, although the manufacturer
78     //can do so. This is fundamentally incompatible with the aim of
79     //protecting users' freedom to change the software. The systematic
80     //pattern of such abuse occurs in the area of products for individuals to
81     //use, which is precisely where it is most unacceptable. Therefore, we
82     //have designed this version of the GPL to prohibit the practice for those
83     //products. If such problems arise substantially in other domains, we
84     //stand ready to extend this provision to those domains in future versions
85     //of the GPL, as needed to protect the freedom of users.
86     //
87     // Finally, every program is threatened constantly by software patents.
88     //States should not allow patents to restrict development and use of
89     //software on general-purpose computers, but in those that do, we wish to
90     //avoid the special danger that patents applied to a free program could
91     //make it effectively proprietary. To prevent this, the GPL assures that
92     //patents cannot be used to render the program non-free.
93     //
94     // The precise terms and conditions for copying, distribution and
95     //modification follow.
96     //
97     // TERMS AND CONDITIONS
98     //
99     // 0. Definitions.
100     //
101     // "This License" refers to version 3 of the GNU General Public License.
102     //
103     // "Copyright" also means copyright-like laws that apply to other kinds of
104     //works, such as semiconductor masks.
105     //
106     // "The Program" refers to any copyrightable work licensed under this
107     //License. Each licensee is addressed as "you". "Licensees" and
108     //"recipients" may be individuals or organizations.
109     //
110     // To "modify" a work means to copy from or adapt all or part of the work
111     //in a fashion requiring copyright permission, other than the making of an
112     //exact copy. The resulting work is called a "modified version" of the
113     //earlier work or a work "based on" the earlier work.
114     //
115     // A "covered work" means either the unmodified Program or a work based
116     //on the Program.
117     //
118     // To "propagate" a work means to do anything with it that, without
119     //permission, would make you directly or secondarily liable for
120     //infringement under applicable copyright law, except executing it on a
121     //computer or modifying a private copy. Propagation includes copying,
122     //distribution (with or without modification), making available to the
123     //public, and in some countries other activities as well.
124     //
125     // To "convey" a work means any kind of propagation that enables other
126     //parties to make or receive copies. Mere interaction with a user through
127     //a computer network, with no transfer of a copy, is not conveying.
128     //
129     // An interactive user interface displays "Appropriate Legal Notices"
130     //to the extent that it includes a convenient and prominently visible
131     //feature that (1) displays an appropriate copyright notice, and (2)
132     //tells the user that there is no warranty for the work (except to the
133     //extent that warranties are provided), that licensees may convey the
134     //work under this License, and how to view a copy of this License. If
135     //the interface presents a list of user commands or options, such as a
136     //menu, a prominent item in the list meets this criterion.
137     //
138     // 1. Source Code.
139     //
140     // The "source code" for a work means the preferred form of the work
141     //for making modifications to it. "Object code" means any non-source
142     //form of a work.
143     //
144     // A "Standard Interface" means an interface that either is an official
145     //standard defined by a recognized standards body, or, in the case of
146     //interfaces specified for a particular programming language, one that
147     //is widely used among developers working in that language.
148     //
149     // The "System Libraries" of an executable work include anything, other
150     //than the work as a whole, that (a) is included in the normal form of
151     //packaging a Major Component, but which is not part of that Major
152     //Component, and (b) serves only to enable use of the work with that
153     //Major Component, or to implement a Standard Interface for which an
154     //implementation is available to the public in source code form. A
155     //"Major Component", in this context, means a major essential component
156     //(kernel, window system, and so on) of the specific operating system
157     //(if any) on which the executable work runs, or a compiler used to
158     //produce the work, or an object code interpreter used to run it.
159     //
160     // The "Corresponding Source" for a work in object code form means all
161     //the source code needed to generate, install, and (for an executable
162     //work) run the object code and to modify the work, including scripts to
163     //control those activities. However, it does not include the work's
164     //System Libraries, or general-purpose tools or generally available free
165     //programs which are used unmodified in performing those activities but
166     //which are not part of the work. For example, Corresponding Source
167     //includes interface definition files associated with source files for
168     //the work, and the source code for shared libraries and dynamically
169     //linked subprograms that the work is specifically designed to require,
170     //such as by intimate data communication or control flow between those
171     //subprograms and other parts of the work.
172     //
173     // The Corresponding Source need not include anything that users
174     //can regenerate automatically from other parts of the Corresponding
175     //Source.
176     //
177     // The Corresponding Source for a work in source code form is that
178     //same work.
179     //
180     // 2. Basic Permissions.
181     //
182     // All rights granted under this License are granted for the term of
183     //copyright on the Program, and are irrevocable provided the stated
184     //conditions are met. This License explicitly affirms your unlimited
185     //permission to run the unmodified Program. The output from running a
186     //covered work is covered by this License only if the output, given its
187     //content, constitutes a covered work. This License acknowledges your
188     //rights of fair use or other equivalent, as provided by copyright law.
189     //
190     // You may make, run and propagate covered works that you do not
191     //convey, without conditions so long as your license otherwise remains
192     //in force. You may convey covered works to others for the sole purpose
193     //of having them make modifications exclusively for you, or provide you
194     //with facilities for running those works, provided that you comply with
195     //the terms of this License in conveying all material for which you do
196     //not control copyright. Those thus making or running the covered works
197     //for you must do so exclusively on your behalf, under your direction
198     //and control, on terms that prohibit them from making any copies of
199     //your copyrighted material outside their relationship with you.
200     //
201     // Conveying under any other circumstances is permitted solely under
202     //the conditions stated below. Sublicensing is not allowed; section 10
203     //makes it unnecessary.
204     //
205     // 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
206     //
207     // No covered work shall be deemed part of an effective technological
208     //measure under any applicable law fulfilling obligations under article
209     //11 of the WIPO copyright treaty adopted on 20 December 1996, or
210     //similar laws prohibiting or restricting circumvention of such
211     //measures.
212     //
213     // When you convey a covered work, you waive any legal power to forbid
214     //circumvention of technological measures to the extent such circumvention
215     //is effected by exercising rights under this License with respect to
216     //the covered work, and you disclaim any intention to limit operation or
217     //modification of the work as a means of enforcing, against the work's
218     //users, your or third parties' legal rights to forbid circumvention of
219     //technological measures.
220     //
221     // 4. Conveying Verbatim Copies.
222     //
223     // You may convey verbatim copies of the Program's source code as you
224     //receive it, in any medium, provided that you conspicuously and
225     //appropriately publish on each copy an appropriate copyright notice;
226     //keep intact all notices stating that this License and any
227     //non-permissive terms added in accord with section 7 apply to the code;
228     //keep intact all notices of the absence of any warranty; and give all
229     //recipients a copy of this License along with the Program.
230     //
231     // You may charge any price or no price for each copy that you convey,
232     //and you may offer support or warranty protection for a fee.
233     //
234     // 5. Conveying Modified Source Versions.
235     //
236     // You may convey a work based on the Program, or the modifications to
237     //produce it from the Program, in the form of source code under the
238     //terms of section 4, provided that you also meet all of these conditions:
239     //
240     // a) The work must carry prominent notices stating that you modified
241     // it, and giving a relevant date.
242     //
243     // b) The work must carry prominent notices stating that it is
244     // released under this License and any conditions added under section
245     // 7. This requirement modifies the requirement in section 4 to
246     // "keep intact all notices".
247     //
248     // c) You must license the entire work, as a whole, under this
249     // License to anyone who comes into possession of a copy. This
250     // License will therefore apply, along with any applicable section 7
251     // additional terms, to the whole of the work, and all its parts,
252     // regardless of how they are packaged. This License gives no
253     // permission to license the work in any other way, but it does not
254     // invalidate such permission if you have separately received it.
255     //
256     // d) If the work has interactive user interfaces, each must display
257     // Appropriate Legal Notices; however, if the Program has interactive
258     // interfaces that do not display Appropriate Legal Notices, your
259     // work need not make them do so.
260     //
261     // A compilation of a covered work with other separate and independent
262     //works, which are not by their nature extensions of the covered work,
263     //and which are not combined with it such as to form a larger program,
264     //in or on a volume of a storage or distribution medium, is called an
265     //"aggregate" if the compilation and its resulting copyright are not
266     //used to limit the access or legal rights of the compilation's users
267     //beyond what the individual works permit. Inclusion of a covered work
268     //in an aggregate does not cause this License to apply to the other
269     //parts of the aggregate.
270     //
271     // 6. Conveying Non-Source Forms.
272     //
273     // You may convey a covered work in object code form under the terms
274     //of sections 4 and 5, provided that you also convey the
275     //machine-readable Corresponding Source under the terms of this License,
276     //in one of these ways:
277     //
278     // a) Convey the object code in, or embodied in, a physical product
279     // (including a physical distribution medium), accompanied by the
280     // Corresponding Source fixed on a durable physical medium
281     // customarily used for software interchange.
282     //
283     // b) Convey the object code in, or embodied in, a physical product
284     // (including a physical distribution medium), accompanied by a
285     // written offer, valid for at least three years and valid for as
286     // long as you offer spare parts or customer support for that product
287     // model, to give anyone who possesses the object code either (1) a
288     // copy of the Corresponding Source for all the software in the
289     // product that is covered by this License, on a durable physical
290     // medium customarily used for software interchange, for a price no
291     // more than your reasonable cost of physically performing this
292     // conveying of source, or (2) access to copy the
293     // Corresponding Source from a network server at no charge.
294     //
295     // c) Convey individual copies of the object code with a copy of the
296     // written offer to provide the Corresponding Source. This
297     // alternative is allowed only occasionally and noncommercially, and
298     // only if you received the object code with such an offer, in accord
299     // with subsection 6b.
300     //
301     // d) Convey the object code by offering access from a designated
302     // place (gratis or for a charge), and offer equivalent access to the
303     // Corresponding Source in the same way through the same place at no
304     // further charge. You need not require recipients to copy the
305     // Corresponding Source along with the object code. If the place to
306     // copy the object code is a network server, the Corresponding Source
307     // may be on a different server (operated by you or a third party)
308     // that supports equivalent copying facilities, provided you maintain
309     // clear directions next to the object code saying where to find the
310     // Corresponding Source. Regardless of what server hosts the
311     // Corresponding Source, you remain obligated to ensure that it is
312     // available for as long as needed to satisfy these requirements.
313     //
314     // e) Convey the object code using peer-to-peer transmission, provided
315     // you inform other peers where the object code and Corresponding
316     // Source of the work are being offered to the general public at no
317     // charge under subsection 6d.
318     //
319     // A separable portion of the object code, whose source code is excluded
320     //from the Corresponding Source as a System Library, need not be
321     //included in conveying the object code work.
322     //
323     // A "User Product" is either (1) a "consumer product", which means any
324     //tangible personal property which is normally used for personal, family,
325     //or household purposes, or (2) anything designed or sold for incorporation
326     //into a dwelling. In determining whether a product is a consumer product,
327     //doubtful cases shall be resolved in favor of coverage. For a particular
328     //product received by a particular user, "normally used" refers to a
329     //typical or common use of that class of product, regardless of the status
330     //of the particular user or of the way in which the particular user
331     //actually uses, or expects or is expected to use, the product. A product
332     //is a consumer product regardless of whether the product has substantial
333     //commercial, industrial or non-consumer uses, unless such uses represent
334     //the only significant mode of use of the product.
335     //
336     // "Installation Information" for a User Product means any methods,
337     //procedures, authorization keys, or other information required to install
338     //and execute modified versions of a covered work in that User Product from
339     //a modified version of its Corresponding Source. The information must
340     //suffice to ensure that the continued functioning of the modified object
341     //code is in no case prevented or interfered with solely because
342     //modification has been made.
343     //
344     // If you convey an object code work under this section in, or with, or
345     //specifically for use in, a User Product, and the conveying occurs as
346     //part of a transaction in which the right of possession and use of the
347     //User Product is transferred to the recipient in perpetuity or for a
348     //fixed term (regardless of how the transaction is characterized), the
349     //Corresponding Source conveyed under this section must be accompanied
350     //by the Installation Information. But this requirement does not apply
351     //if neither you nor any third party retains the ability to install
352     //modified object code on the User Product (for example, the work has
353     //been installed in ROM).
354     //
355     // The requirement to provide Installation Information does not include a
356     //requirement to continue to provide support service, warranty, or updates
357     //for a work that has been modified or installed by the recipient, or for
358     //the User Product in which it has been modified or installed. Access to a
359     //network may be denied when the modification itself materially and
360     //adversely affects the operation of the network or violates the rules and
361     //protocols for communication across the network.
362     //
363     // Corresponding Source conveyed, and Installation Information provided,
364     //in accord with this section must be in a format that is publicly
365     //documented (and with an implementation available to the public in
366     //source code form), and must require no special password or key for
367     //unpacking, reading or copying.
368     //
369     // 7. Additional Terms.
370     //
371     // "Additional permissions" are terms that supplement the terms of this
372     //License by making exceptions from one or more of its conditions.
373     //Additional permissions that are applicable to the entire Program shall
374     //be treated as though they were included in this License, to the extent
375     //that they are valid under applicable law. If additional permissions
376     //apply only to part of the Program, that part may be used separately
377     //under those permissions, but the entire Program remains governed by
378     //this License without regard to the additional permissions.
379     //
380     // When you convey a copy of a covered work, you may at your option
381     //remove any additional permissions from that copy, or from any part of
382     //it. (Additional permissions may be written to require their own
383     //removal in certain cases when you modify the work.) You may place
384     //additional permissions on material, added by you to a covered work,
385     //for which you have or can give appropriate copyright permission.
386     //
387     // Notwithstanding any other provision of this License, for material you
388     //add to a covered work, you may (if authorized by the copyright holders of
389     //that material) supplement the terms of this License with terms:
390     //
391     // a) Disclaiming warranty or limiting liability differently from the
392     // terms of sections 15 and 16 of this License; or
393     //
394     // b) Requiring preservation of specified reasonable legal notices or
395     // author attributions in that material or in the Appropriate Legal
396     // Notices displayed by works containing it; or
397     //
398     // c) Prohibiting misrepresentation of the origin of that material, or
399     // requiring that modified versions of such material be marked in
400     // reasonable ways as different from the original version; or
401     //
402     // d) Limiting the use for publicity purposes of names of licensors or
403     // authors of the material; or
404     //
405     // e) Declining to grant rights under trademark law for use of some
406     // trade names, trademarks, or service marks; or
407     //
408     // f) Requiring indemnification of licensors and authors of that
409     // material by anyone who conveys the material (or modified versions of
410     // it) with contractual assumptions of liability to the recipient, for
411     // any liability that these contractual assumptions directly impose on
412     // those licensors and authors.
413     //
414     // All other non-permissive additional terms are considered "further
415     //restrictions" within the meaning of section 10. If the Program as you
416     //received it, or any part of it, contains a notice stating that it is
417     //governed by this License along with a term that is a further
418     //restriction, you may remove that term. If a license document contains
419     //a further restriction but permits relicensing or conveying under this
420     //License, you may add to a covered work material governed by the terms
421     //of that license document, provided that the further restriction does
422     //not survive such relicensing or conveying.
423     //
424     // If you add terms to a covered work in accord with this section, you
425     //must place, in the relevant source files, a statement of the
426     //additional terms that apply to those files, or a notice indicating
427     //where to find the applicable terms.
428     //
429     // Additional terms, permissive or non-permissive, may be stated in the
430     //form of a separately written license, or stated as exceptions;
431     //the above requirements apply either way.
432     //
433     // 8. Termination.
434     //
435     // You may not propagate or modify a covered work except as expressly
436     //provided under this License. Any attempt otherwise to propagate or
437     //modify it is void, and will automatically terminate your rights under
438     //this License (including any patent licenses granted under the third
439     //paragraph of section 11).
440     //
441     // However, if you cease all violation of this License, then your
442     //license from a particular copyright holder is reinstated (a)
443     //provisionally, unless and until the copyright holder explicitly and
444     //finally terminates your license, and (b) permanently, if the copyright
445     //holder fails to notify you of the violation by some reasonable means
446     //prior to 60 days after the cessation.
447     //
448     // Moreover, your license from a particular copyright holder is
449     //reinstated permanently if the copyright holder notifies you of the
450     //violation by some reasonable means, this is the first time you have
451     //received notice of violation of this License (for any work) from that
452     //copyright holder, and you cure the violation prior to 30 days after
453     //your receipt of the notice.
454     //
455     // Termination of your rights under this section does not terminate the
456     //licenses of parties who have received copies or rights from you under
457     //this License. If your rights have been terminated and not permanently
458     //reinstated, you do not qualify to receive new licenses for the same
459     //material under section 10.
460     //
461     // 9. Acceptance Not Required for Having Copies.
462     //
463     // You are not required to accept this License in order to receive or
464     //run a copy of the Program. Ancillary propagation of a covered work
465     //occurring solely as a consequence of using peer-to-peer transmission
466     //to receive a copy likewise does not require acceptance. However,
467     //nothing other than this License grants you permission to propagate or
468     //modify any covered work. These actions infringe copyright if you do
469     //not accept this License. Therefore, by modifying or propagating a
470     //covered work, you indicate your acceptance of this License to do so.
471     //
472     // 10. Automatic Licensing of Downstream Recipients.
473     //
474     // Each time you convey a covered work, the recipient automatically
475     //receives a license from the original licensors, to run, modify and
476     //propagate that work, subject to this License. You are not responsible
477     //for enforcing compliance by third parties with this License.
478     //
479     // An "entity transaction" is a transaction transferring control of an
480     //organization, or substantially all assets of one, or subdividing an
481     //organization, or merging organizations. If propagation of a covered
482     //work results from an entity transaction, each party to that
483     //transaction who receives a copy of the work also receives whatever
484     //licenses to the work the party's predecessor in interest had or could
485     //give under the previous paragraph, plus a right to possession of the
486     //Corresponding Source of the work from the predecessor in interest, if
487     //the predecessor has it or can get it with reasonable efforts.
488     //
489     // You may not impose any further restrictions on the exercise of the
490     //rights granted or affirmed under this License. For example, you may
491     //not impose a license fee, royalty, or other charge for exercise of
492     //rights granted under this License, and you may not initiate litigation
493     //(including a cross-claim or counterclaim in a lawsuit) alleging that
494     //any patent claim is infringed by making, using, selling, offering for
495     //sale, or importing the Program or any portion of it.
496     //
497     // 11. Patents.
498     //
499     // A "contributor" is a copyright holder who authorizes use under this
500     //License of the Program or a work on which the Program is based. The
501     //work thus licensed is called the contributor's "contributor version".
502     //
503     // A contributor's "essential patent claims" are all patent claims
504     //owned or controlled by the contributor, whether already acquired or
505     //hereafter acquired, that would be infringed by some manner, permitted
506     //by this License, of making, using, or selling its contributor version,
507     //but do not include claims that would be infringed only as a
508     //consequence of further modification of the contributor version. For
509     //purposes of this definition, "control" includes the right to grant
510     //patent sublicenses in a manner consistent with the requirements of
511     //this License.
512     //
513     // Each contributor grants you a non-exclusive, worldwide, royalty-free
514     //patent license under the contributor's essential patent claims, to
515     //make, use, sell, offer for sale, import and otherwise run, modify and
516     //propagate the contents of its contributor version.
517     //
518     // In the following three paragraphs, a "patent license" is any express
519     //agreement or commitment, however denominated, not to enforce a patent
520     //(such as an express permission to practice a patent or covenant not to
521     //sue for patent infringement). To "grant" such a patent license to a
522     //party means to make such an agreement or commitment not to enforce a
523     //patent against the party.
524     //
525     // If you convey a covered work, knowingly relying on a patent license,
526     //and the Corresponding Source of the work is not available for anyone
527     //to copy, free of charge and under the terms of this License, through a
528     //publicly available network server or other readily accessible means,
529     //then you must either (1) cause the Corresponding Source to be so
530     //available, or (2) arrange to deprive yourself of the benefit of the
531     //patent license for this particular work, or (3) arrange, in a manner
532     //consistent with the requirements of this License, to extend the patent
533     //license to downstream recipients. "Knowingly relying" means you have
534     //actual knowledge that, but for the patent license, your conveying the
535     //covered work in a country, or your recipient's use of the covered work
536     //in a country, would infringe one or more identifiable patents in that
537     //country that you have reason to believe are valid.
538     //
539     // If, pursuant to or in connection with a single transaction or
540     //arrangement, you convey, or propagate by procuring conveyance of, a
541     //covered work, and grant a patent license to some of the parties
542     //receiving the covered work authorizing them to use, propagate, modify
543     //or convey a specific copy of the covered work, then the patent license
544     //you grant is automatically extended to all recipients of the covered
545     //work and works based on it.
546     //
547     // A patent license is "discriminatory" if it does not include within
548     //the scope of its coverage, prohibits the exercise of, or is
549     //conditioned on the non-exercise of one or more of the rights that are
550     //specifically granted under this License. You may not convey a covered
551     //work if you are a party to an arrangement with a third party that is
552     //in the business of distributing software, under which you make payment
553     //to the third party based on the extent of your activity of conveying
554     //the work, and under which the third party grants, to any of the
555     //parties who would receive the covered work from you, a discriminatory
556     //patent license (a) in connection with copies of the covered work
557     //conveyed by you (or copies made from those copies), or (b) primarily
558     //for and in connection with specific products or compilations that
559     //contain the covered work, unless you entered into that arrangement,
560     //or that patent license was granted, prior to 28 March 2007.
561     //
562     // Nothing in this License shall be construed as excluding or limiting
563     //any implied license or other defenses to infringement that may
564     //otherwise be available to you under applicable patent law.
565     //
566     // 12. No Surrender of Others' Freedom.
567     //
568     // If conditions are imposed on you (whether by court order, agreement or
569     //otherwise) that contradict the conditions of this License, they do not
570     //excuse you from the conditions of this License. If you cannot convey a
571     //covered work so as to satisfy simultaneously your obligations under this
572     //License and any other pertinent obligations, then as a consequence you may
573     //not convey it at all. For example, if you agree to terms that obligate you
574     //to collect a royalty for further conveying from those to whom you convey
575     //the Program, the only way you could satisfy both those terms and this
576     //License would be to refrain entirely from conveying the Program.
577     //
578     // 13. Use with the GNU Affero General Public License.
579     //
580     // Notwithstanding any other provision of this License, you have
581     //permission to link or combine any covered work with a work licensed
582     //under version 3 of the GNU Affero General Public License into a single
583     //combined work, and to convey the resulting work. The terms of this
584     //License will continue to apply to the part which is the covered work,
585     //but the special requirements of the GNU Affero General Public License,
586     //section 13, concerning interaction through a network will apply to the
587     //combination as such.
588     //
589     // 14. Revised Versions of this License.
590     //
591     // The Free Software Foundation may publish revised and/or new versions of
592     //the GNU General Public License from time to time. Such new versions will
593     //be similar in spirit to the present version, but may differ in detail to
594     //address new problems or concerns.
595     //
596     // Each version is given a distinguishing version number. If the
597     //Program specifies that a certain numbered version of the GNU General
598     //Public License "or any later version" applies to it, you have the
599     //option of following the terms and conditions either of that numbered
600     //version or of any later version published by the Free Software
601     //Foundation. If the Program does not specify a version number of the
602     //GNU General Public License, you may choose any version ever published
603     //by the Free Software Foundation.
604     //
605     // If the Program specifies that a proxy can decide which future
606     //versions of the GNU General Public License can be used, that proxy's
607     //public statement of acceptance of a version permanently authorizes you
608     //to choose that version for the Program.
609     //
610     // Later license versions may give you additional or different
611     //permissions. However, no additional obligations are imposed on any
612     //author or copyright holder as a result of your choosing to follow a
613     //later version.
614     //
615     // 15. Disclaimer of Warranty.
616     //
617     // THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
618     //APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
619     //HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
620     //OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
621     //THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
622     //PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
623     //IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
624     //ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
625     //
626     // 16. Limitation of Liability.
627     //
628     // IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
629     //WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
630     //THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
631     //GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
632     //USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
633     //DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
634     //PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
635     //EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
636     //SUCH DAMAGES.
637     //
638     // 17. Interpretation of Sections 15 and 16.
639     //
640     // If the disclaimer of warranty and limitation of liability provided
641     //above cannot be given local legal effect according to their terms,
642     //reviewing courts shall apply local law that most closely approximates
643     //an absolute waiver of all civil liability in connection with the
644     //Program, unless a warranty or assumption of liability accompanies a
645     //copy of the Program in return for a fee.
646     //
647     // END OF TERMS AND CONDITIONS
648     //
649     // How to Apply These Terms to Your New Programs
650     //
651     // If you develop a new program, and you want it to be of the greatest
652     //possible use to the public, the best way to achieve this is to make it
653     //free software which everyone can redistribute and change under these terms.
654     //
655     // To do so, attach the following notices to the program. It is safest
656     //to attach them to the start of each source file to most effectively
657     //state the exclusion of warranty; and each file should have at least
658     //the "copyright" line and a pointer to where the full notice is found.
659     //
660     // <one line to give the program's name and a brief idea of what it does.>
661     // Copyright (C) <year> <name of author>
662     //
663     // This program is free software: you can redistribute it and/or modify
664     // it under the terms of the GNU General Public License as published by
665     // the Free Software Foundation, either version 3 of the License, or
666     // (at your option) any later version.
667     //
668     // This program is distributed in the hope that it will be useful,
669     // but WITHOUT ANY WARRANTY; without even the implied warranty of
670     // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
671     // GNU General Public License for more details.
672     //
673     // You should have received a copy of the GNU General Public License
674     // along with this program. If not, see <http://www.gnu.org/licenses/>.
675     //
676     //Also add information on how to contact you by electronic and paper mail.
677     //
678     // If the program does terminal interaction, make it output a short
679     //notice like this when it starts in an interactive mode:
680     //
681     // <program> Copyright (C) <year> <name of author>
682     // This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
683     // This is free software, and you are welcome to redistribute it
684     // under certain conditions; type `show c' for details.
685     //
686     //The hypothetical commands `show w' and `show c' should show the appropriate
687     //parts of the General Public License. Of course, your program's commands
688     //might be different; for a GUI interface, you would use an "about box".
689     //
690     // You should also get your employer (if you work as a programmer) or school,
691     //if any, to sign a "copyright disclaimer" for the program, if necessary.
692     //For more information on this, and how to apply and follow the GNU GPL, see
693     //<http://www.gnu.org/licenses/>.
694     //
695     // The GNU General Public License does not permit incorporating your program
696     //into proprietary programs. If your program is a subroutine library, you
697     //may consider it more useful to permit linking proprietary applications with
698     //the library. If this is what you want to do, use the GNU Lesser General
699     //Public License instead of this License. But first, please read
700     //<http://www.gnu.org/philosophy/why-not-lgpl.html>.
701     //-------------------------------------------------------------------------------------------------
702     //
703     //This source file contains date and time calculation and
704     //manipulation functions.
705     //
706     require_once("config.inc"); //Scheduling configuration.
707     require_once("confighard.inc"); //Necessary for date minimums and maximums.
708     //
709     //================================================================================
710     //================================================================================
711     //==== R A W C A L C U L A T I O N ==========================================
712     //================================================================================
713     //================================================================================
714     //Returns the number of days in the year.
715     //
716     //Unit-tested 20060408.
717     //
718     function DATEFUNC_year_days($year)
719     {
720     //May need to be changed if confighard.inc is modified for a longer calendar
721     //range.
722     $mod_4 = $year % 4;
723     $mod_100 = $year % 100;
724     $mod_400 = $year % 400;
725    
726     if ($mod_4 != 0)
727     {
728     //We can't have a leap year unless it is divisible by 4.
729     return(365);
730     }
731     else if (($mod_100 == 0) && ($mod_400 != 0))
732     {
733     //Divisible by 100 and not divible by 400. Not a leap year.
734     return(365);
735     }
736     else
737     {
738     //Divisible by 4 and not meeting the exception case: leap year.
739     return(366);
740     }
741     }
742     //
743     //
744     //--------------------------------------------------------------------------------
745     //Returns the number of days in all years preceding but not including the
746     //start year. This is used for modulo arithmetic to determine day of week
747     //and so on. An array is much faster (I think and hope) than an iterative method
748     //involving summing the years.
749     //
750     //Note: this function has not yet been unit-tested (after it was changed from
751     //a lookup table). This is still todo.
752     //
753     function DATEFUNC_year_predecessor_sum($year_in)
754     {
755     //Customized for lower limit of 1700, upper limit if 2300.
756     //
757     if (($year_in >= CONFIGHARD_DATEFUNC_MINYEAR) && ($year_in < CONFIGHARD_DATEFUNC_MAXYEAR))
758     {
759     //In year $year_in, the number of prior years where the year was divisible
760     //by 4 is given by the expression below.
761     if ($year_in == CONFIGHARD_DATEFUNC_MINYEAR)
762     {
763     $years_prior_div_4 = 0;
764     }
765     else
766     {
767     $years_prior_div_4 = (int)(($year_in - 1 - CONFIGHARD_DATEFUNC_MINYEAR) / 4);
768     //Verified in the PHP docs that cast to int from float behaves with classic
769     //div behavior (rounding down), so will be OK.
770     }
771    
772     //Correct for the fact that 1800, 1900, 2100, and 2200 are not leap years, but 2000 is.
773     if (($year_in > 1800) && ($year_in <= 1900))
774     {
775     //1800 was not a leap year, so we need to deduct 1 from the total leap years encountered.
776     $years_prior_div_4 -= 1;
777     }
778     else if (($year_in > 1900) && ($year_in <= 2100))
779     {
780     //1800 was not a leap year, and 1900 was not a leap year (but 2000 was),
781     //so we need to deduct 2 from the total leap years encountered.
782     $years_prior_div_4 -= 2;
783     }
784     else if (($year_in > 2100) && ($year_in <= 2200))
785     {
786     //1800, 1900, and 2100 were not leap years (but 2000 was),
787     //so we need to deduct 3 from the total leap years encountered.
788     $years_prior_div_4 -= 3;
789     }
790     else /* if (($year_in > 2200) && ($year_in <= 2300)) */
791     {
792     //1800, 1900, 2100, and 2200 were not leap years (but 2000 was),
793     //so we need to deduct 4 from the total leap years encountered.
794     $years_prior_div_4 -= 4;
795     }
796    
797     //The total number of days in years prior is going to be 365 times the number
798     //of years prior, except we need to add a day for each leap year prior.
799     if ($year_in == CONFIGHARD_DATEFUNC_MINYEAR)
800     {
801     return(0);
802     }
803     else
804     {
805     return((int)(($year_in - CONFIGHARD_DATEFUNC_MINYEAR) * 365 + $years_prior_div_4));
806     }
807     }
808     else
809     {
810     //Not a year we can calculate about. Don't want to error-trap at such a
811     //low level. Just return zero.
812     return(0);
813     }
814     }
815     //
816     //
817     //--------------------------------------------------------------------------------
818     //Calculates the number of days in a given month of a given year. Years are
819     //2000 ... (i.e. full-sized integer), and months are referenced in the traditional
820     //way, 1..12.
821     //
822     //Unit-tested 20060408.
823     //
824     function DATEFUNC_year_month_days($year, $month)
825     {
826     switch ($month)
827     {
828     default:
829     case 1:
830     return(31);
831     break;
832     case 2:
833     if (DATEFUNC_year_days($year) == 365)
834     {
835     return(28);
836     }
837     else
838     {
839     return(29);
840     }
841     break;
842     case 3:
843     return(31);
844     break;
845     case 4:
846     return(30);
847     break;
848     case 5:
849     return(31);
850     break;
851     case 6:
852     return(30);
853     break;
854     case 7:
855     return(31);
856     break;
857     case 8:
858     return(31);
859     break;
860     case 9:
861     return(30);
862     break;
863     case 10:
864     return(31);
865     break;
866     case 11:
867     return(30);
868     break;
869     case 12:
870     return(31);
871     break;
872     }
873     }
874     //
875     //
876     //--------------------------------------------------------------------------------
877     //Calcualtes the Julian offset of a date within a certain year. The offset
878     //of January 1 of any year is 0. Year, month, and day are 2000 ..., 1 ..., and
879     //1 ..., respectively.
880     //
881     //Unit-tested 20060408.
882     //
883     function DATEFUNC_year_julian_offset($year, $month, $day)
884     {
885     switch ($month)
886     {
887     default:
888     case 1:
889     return($day - 1);
890     break;
891     case 2:
892     return(31 + $day - 1);
893     case 3:
894     if (DATEFUNC_year_days($year) == 365)
895     {
896     return(59 + $day - 1);
897     }
898     else
899     {
900     return(59 + $day);
901     }
902     break;
903     case 4:
904     if (DATEFUNC_year_days($year) == 365)
905     {
906     return(90 + $day - 1);
907     }
908     else
909     {
910     return(90 + $day);
911     }
912     break;
913     case 5:
914     if (DATEFUNC_year_days($year) == 365)
915     {
916     return(120 + $day - 1);
917     }
918     else
919     {
920     return(120 + $day);
921     }
922     break;
923     case 6:
924     if (DATEFUNC_year_days($year) == 365)
925     {
926     return(151 + $day - 1);
927     }
928     else
929     {
930     return(151 + $day);
931     }
932     break;
933     case 7:
934     if (DATEFUNC_year_days($year) == 365)
935     {
936     return(181 + $day - 1);
937     }
938     else
939     {
940     return(181 + $day);
941     }
942     break;
943     case 8:
944     if (DATEFUNC_year_days($year) == 365)
945     {
946     return(212 + $day - 1);
947     }
948     else
949     {
950     return(212 + $day);
951     }
952     break;
953     case 9:
954     if (DATEFUNC_year_days($year) == 365)
955     {
956     return(243 + $day - 1);
957     }
958     else
959     {
960     return(243 + $day);
961     }
962     break;
963     case 10:
964     if (DATEFUNC_year_days($year) == 365)
965     {
966     return(273 + $day - 1);
967     }
968     else
969     {
970     return(273 + $day);
971     }
972     break;
973     case 11:
974     if (DATEFUNC_year_days($year) == 365)
975     {
976     return(304 + $day - 1);
977     }
978     else
979     {
980     return(304 + $day);
981     }
982     break;
983     case 12:
984     if (DATEFUNC_year_days($year) == 365)
985     {
986     return(334 + $day - 1);
987     }
988     else
989     {
990     return(334 + $day);
991     }
992     break;
993     }
994     }
995     //
996     //
997     //--------------------------------------------------------------------------------
998     //Given year, month, and day (2000 ..., 1 ..., 1 ...), returns an integer
999     //representing the day of the week.
1000     // 0 : Sunday
1001     // 1 : Monday
1002     // 2 : Tuesday
1003     // 3 : Wednesday
1004     // 4 : Thursday
1005     // 5 : Friday
1006     // 6 : Saturday
1007     //
1008     //Unit-tested 20060408.
1009     //
1010     function DATEFUNC_intdayofweek_intdate($year, $month, $day)
1011     {
1012     $int_differential = CONFIGHARD_DATEFUNC_EPOCH_DOW
1013     + DATEFUNC_year_predecessor_sum($year)
1014     + DATEFUNC_year_julian_offset($year, $month, $day);
1015     return($int_differential % 7);
1016     }
1017     //--------------------------------------------------------------------------------
1018     //Compares two dates, expressed as integers. Both must be properly formatted
1019     //(i.e. valid years, months, and days). Returns:
1020     // -1 if a < b.
1021     // 0 if a == b.
1022     // 1 if a > b.
1023     //
1024     function DATEFUNC_cmp($ya, $ma, $da, $yb, $mb, $db)
1025     {
1026     if ($ya < $yb)
1027     {
1028     return(-1);
1029     }
1030     else if ($ya > $yb)
1031     {
1032     return(1);
1033     }
1034     else
1035     {
1036     if ($ma < $mb)
1037     {
1038     return(-1);
1039     }
1040     else if ($ma > $mb)
1041     {
1042     return(1);
1043     }
1044     else
1045     {
1046     if ($da < $db)
1047     {
1048     return(-1);
1049     }
1050     else if ($da > $db)
1051     {
1052     return(1);
1053     }
1054     else
1055     {
1056     return(0);
1057     }
1058     }
1059     }
1060     }
1061     //
1062     //
1063     //--------------------------------------------------------------------------------
1064     //Given a year, a month, and a month offset, moves the passed date backward
1065     //(in the case of negative month offset) or forward (in the case of positive
1066     //month offset) and calculates a new year and month. The calculated returned
1067     //value will not go outside the range set in CONFIGHARD.INC for the
1068     //scheduling range.
1069     //
1070     //A result flag is set to:
1071     // -1 : If the result had to be clipped because it went outside the calendar
1072     // functionality window.
1073     // 0 : If the result did not have to be clipped.
1074     // 1 : If the result had to be clipped because it went outside the calendar
1075     // functionality window.
1076     //
1077     //The values passed in must be valid.
1078     //
1079     //The ordinal month approach is used because integer math tends to be
1080     //very fast.
1081     //
1082     function DATEFUNC_offset_month($year_in, $month_in, $month_offset_in, &$year_out, &$month_out, &$result_out)
1083     {
1084     //Default value of result.
1085     $result_out = 0;
1086    
1087     //Create ordinal month representations of the min and max allowable months. Using this
1088     //scheme, the 0'th month would be January of 0 A.D.
1089     $min_ordinal_month = CONFIGHARD_DATEFUNC_MINYEAR * 12;
1090     $max_ordinal_month = CONFIGHARD_DATEFUNC_MAXYEAR * 12 - 1;
1091    
1092     //Create ordinal month representation of the input year, month.
1093     $in_ordinal_month = $year_in * 12 + $month_in - 1;
1094    
1095     //Create the ordinal month reprsentation of the input + offset.
1096     $calcd_ordinal_month = $in_ordinal_month + $month_offset_in;
1097    
1098     //Clip the result to be within the scheduling range of the FBO-prime software.
1099     if ($calcd_ordinal_month < $min_ordinal_month)
1100     {
1101     $calcd_ordinal_month = $min_ordinal_month;
1102     $result_out = -1;
1103     }
1104     else if ($calcd_ordinal_month > $max_ordinal_month)
1105     {
1106     $calcd_ordinal_month = $max_ordinal_month;
1107     $result_out = 1;
1108     }
1109    
1110     //Convert back to calendar year and month format.
1111     $year_out = (int) ($calcd_ordinal_month / 12);
1112     $month_out = ($calcd_ordinal_month % 12) + 1;
1113     }
1114     //
1115     //
1116     //--------------------------------------------------------------------------------
1117     //Calculates the date one week ago. The date passed in must be within the
1118     //calendaring range and the date one week before must be also within
1119     //calendaring range.
1120     //
1121     function DATEFUNC_one_week_ago($year_in, $month_in, $day_in, &$year_out, &$month_out, &$day_out)
1122     {
1123     if (($day_in - 7) > 0)
1124     {
1125     //Simplest case. Different date within the same month.
1126     $year_out = $year_in;
1127     $month_out = $month_in;
1128     $day_out = $day_in - 7;
1129     }
1130     else
1131     {
1132     //Have to roll the month backwards.
1133     if ($month_in > 1)
1134     {
1135     //Have to roll day and month backwards, but not the year.
1136     $year_out = $year_in;
1137     $month_out = $month_in - 1;
1138     $day_out = $day_in - 7 + DATEFUNC_year_month_days($year_in, $month_in - 1);
1139     }
1140     else
1141     {
1142     //Have to roll back the day, month, and year.
1143     $year_out = $year_in - 1;
1144     $month_out = 12;
1145     $day_out = $day_in - 7 + DATEFUNC_year_month_days($year_in - 1, 12);
1146     }
1147     }
1148     }
1149     //
1150     //--------------------------------------------------------------------------------
1151     //Calculates the date one week in the future. The date passed in must be within the
1152     //calendaring range and the date one week in the future must be also within
1153     //calendaring range.
1154     //
1155     function DATEFUNC_one_week_future($year_in, $month_in, $day_in, &$year_out, &$month_out, &$day_out)
1156     {
1157     $days_in_month = DATEFUNC_year_month_days($year_in, $month_in);
1158    
1159     if (($day_in + 7) <= $days_in_month)
1160     {
1161     //Simplest case. Different date within the same month.
1162     $year_out = $year_in;
1163     $month_out = $month_in;
1164     $day_out = $day_in + 7;
1165     }
1166     else
1167     {
1168     //Have to roll the month forward.
1169     if ($month_in < 12)
1170     {
1171     //Have to roll day and month forward, but not the year.
1172     $year_out = $year_in;
1173     $month_out = $month_in + 1;
1174     $day_out = $day_in + 7 - $days_in_month;
1175     }
1176     else
1177     {
1178     //Have to roll forward the day, month, and year.
1179     $year_out = $year_in + 1;
1180     $month_out = 1;
1181     $day_out = $day_in + 7 - $days_in_month;
1182     }
1183     }
1184     }
1185     //
1186     //--------------------------------------------------------------------------------
1187     //Calculates the date one day ago. The date passed in must be within the
1188     //calendaring range and the date one day before must be also within
1189     //calendaring range.
1190     //
1191     function DATEFUNC_one_day_ago($year_in, $month_in, $day_in, &$year_out, &$month_out, &$day_out)
1192     {
1193     if ($day_in > 1)
1194     {
1195     //Simplest case. Different date within the same month.
1196     $year_out = $year_in;
1197     $month_out = $month_in;
1198     $day_out = $day_in - 1;
1199     }
1200     else
1201     {
1202     //Have to roll the month backwards.
1203     if ($month_in > 1)
1204     {
1205     //Have to roll day and month backwards, but not the year.
1206     $year_out = $year_in;
1207     $month_out = $month_in - 1;
1208     $day_out = DATEFUNC_year_month_days($year_in, $month_in - 1);
1209     }
1210     else
1211     {
1212     //Have to roll back the day, month, and year.
1213     $year_out = $year_in - 1;
1214     $month_out = 12;
1215     $day_out = DATEFUNC_year_month_days($year_in - 1, 12);
1216     }
1217     }
1218     }
1219     //
1220     //--------------------------------------------------------------------------------
1221     //Calculates the date one day in the future. The date passed in must be within the
1222     //calendaring range and the date one day in the future must be also within
1223     //calendaring range.
1224     //
1225     function DATEFUNC_one_day_future($year_in, $month_in, $day_in, &$year_out, &$month_out, &$day_out)
1226     {
1227     $days_in_month = DATEFUNC_year_month_days($year_in, $month_in);
1228    
1229     if ($day_in < $days_in_month)
1230     {
1231     //Simplest case. Different date within the same month.
1232     $year_out = $year_in;
1233     $month_out = $month_in;
1234     $day_out = $day_in + 1;
1235     }
1236     else
1237     {
1238     //Have to roll the month forwards.
1239     if ($month_in < 12)
1240     {
1241     //Have to roll day and month forward, but not the year.
1242     $year_out = $year_in;
1243     $month_out = $month_in + 1;
1244     $day_out = 1;
1245     }
1246     else
1247     {
1248     //Have to roll forward the day, month, and year.
1249     $year_out = $year_in + 1;
1250     $month_out = 1;
1251     $day_out = 1;
1252     }
1253     }
1254     }
1255     //
1256     //--------------------------------------------------------------------------------
1257     //Given a year and a month, indicates whether it is within the window of
1258     //what should be viewable for scheduling.
1259     //
1260     //The criteria for displaying the month are:
1261     // a)The month is not outside the calendaring functionality window.
1262     // b)The month is not outside the parameters set by the
1263     // configuration constants CONFIG_SCHED_SCHEDACC_PREV_MO or
1264     // CONFIG_SCHED_SCHEDACC_FUTU_MO, which specify how many months
1265     // previous and future may be viewed.
1266     //
1267     //Returns:
1268     // -1 : If the year/month is too early to be
1269     // schedulable.
1270     // 0 : If the year/month should be schedulable.
1271     // 1 : If the year/month is too late to be schedulable.
1272     //
1273     function DATEFUNC_is_not_displayable($year_in, $month_in)
1274     {
1275     global $GLOBAL_stime_year;
1276     global $GLOBAL_stime_month;
1277    
1278     //If the year is out of bounds, it is a no-go.
1279     if ($year_in < CONFIGHARD_DATEFUNC_MINYEAR)
1280     return(-1);
1281     else if ($year_in >= CONFIGHARD_DATEFUNC_MAXYEAR)
1282     return(1);
1283    
1284     //If the month is out of bounds, it is a no-go.
1285     if (($month_in < 1) || ($month_in > 12))
1286     return(1); //Arbitrary, as long as it isn't 0.
1287    
1288     //For reference, find the year/month that is CONFIG_SCHED_SCHEDACC_PREV_MO
1289     //behind the passed year/month. If this is clipped, no harm done.
1290     DATEFUNC_offset_month($GLOBAL_stime_year,
1291     $GLOBAL_stime_month,
1292     -CONFIG_SCHED_SCHEDACC_PREV_MO,
1293     $year_lower_limit,
1294     $month_lower_limit,
1295     $result_flag);
1296    
1297     //For reference, find the year/month that is CONFIG_SCHED_SCHEDACC_FUTU_MO
1298     //ahead of the passed year/month. If this is clipped, no harm done.
1299     DATEFUNC_offset_month($GLOBAL_stime_year,
1300     $GLOBAL_stime_month,
1301     CONFIG_SCHED_SCHEDACC_FUTU_MO,
1302     $year_upper_limit,
1303     $month_upper_limit,
1304     $result_flag);
1305    
1306     //echo " year upper limit : " . $year_upper_limit . " month_upper_limit : " . $month_upper_limit . " ";
1307    
1308     //If the passed year/month are below the lower limit, this means it isn't
1309     //displayable.
1310     if (DATEFUNC_cmp($year_in, $month_in, 1, $year_lower_limit, $month_lower_limit, 1) == -1)
1311     return(-1);
1312    
1313     //If the passed year/month are above the upper limit, this means it isn't
1314     //displayable.
1315     if (DATEFUNC_cmp($year_in, $month_in, 1, $year_upper_limit, $month_upper_limit, 1) == 1)
1316     return(1);
1317    
1318     //If we're here, it is displayable.
1319     return(0);
1320     }
1321     //
1322     //================================================================================
1323     //================================================================================
1324     //==== S T R I N G M A P P I N G ============================================
1325     //================================================================================
1326     //================================================================================
1327     //
1328     //Returns the string associated with an ordinal month number 1-12.
1329     //
1330     function DATEFUNC_string_month_long($month_no)
1331     {
1332     $lookup = array("January",
1333     "February",
1334     "March",
1335     "April",
1336     "May",
1337     "June",
1338     "July",
1339     "August",
1340     "September",
1341     "October",
1342     "November",
1343     "December");
1344    
1345     if (($month_no < 1) || ($month_no > 12))
1346     {
1347     return("INVALID");
1348     }
1349     else
1350     {
1351     return($lookup[$month_no - 1]);
1352     }
1353     }
1354     //
1355     //--------------------------------------------------------------------------------
1356     //Returns the string associated with a day of the week 0-6.
1357     //
1358     function DATEFUNC_string_dow_long($dow_no)
1359     {
1360     $lookup = array("Sunday",
1361     "Monday",
1362     "Tuesday",
1363     "Wednesday",
1364     "Thursday",
1365     "Friday",
1366     "Saturday");
1367    
1368     if (($dow_no < 0) || ($dow_no > 6))
1369     {
1370     return("INVALID");
1371     }
1372     else
1373     {
1374     return($lookup[$dow_no]);
1375     }
1376     }
1377     //--------------------------------------------------------------------------------
1378     //Returns a string representing the standard date, i.e. "January 19, 2009" or
1379     //whatever.
1380     //
1381     function DATEFUNC_stdlongdate($year, $month, $day)
1382     {
1383     return(DATEFUNC_string_month_long($month) . " " . $day . ", " . $year);
1384     }
1385     //
1386     //--------------------------------------------------------------------------------
1387     //Returns a string representing the standard date with day of the week,
1388     //i.e. "Friday, January 19, 2009" or whatever.
1389     //
1390     function DATEFUNC_stdlongdate_w_dow($year, $month, $day)
1391     {
1392     $dow = DATEFUNC_intdayofweek_intdate($year, $month, $day);
1393     return( DATEFUNC_string_dow_long($dow)
1394     . ", "
1395     . DATEFUNC_string_month_long($month)
1396     . " "
1397     . $day
1398     . ", "
1399     . $year);
1400     }
1401     //
1402     //--------------------------------------------------------------------------------
1403     //Returns a string representing the standard time. In non-military format,
1404     //this will be something like 5:04 p.m. In military time, something like
1405     //17:04.
1406     //
1407     function DATEFUNC_stdtimenosec($hour, $minute)
1408     {
1409     if (CONFIG_TIME_FORMAT_24HR)
1410     {
1411     //24-hour format.
1412     return(sprintf("%02d", $hour) . ":" . sprintf("%02d", $minute));
1413     }
1414     else
1415     {
1416     //12-hour format.
1417     if ($hour == 0)
1418     {
1419     return(sprintf("%d", 12) . ":" . sprintf("%02d", $minute) . " a.m.");
1420     }
1421     else if ($hour < 12)
1422     {
1423     return(sprintf("%d", $hour) . ":" . sprintf("%02d", $minute) . " a.m.");
1424     }
1425     else if ($hour == 12)
1426     {
1427     return(sprintf("%d", $hour) . ":" . sprintf("%02d", $minute) . " p.m.");
1428     }
1429     else
1430     {
1431     return(sprintf("%d", $hour - 12) . ":" . sprintf("%02d", $minute) . " p.m.");
1432     }
1433     }
1434     }
1435     //
1436     //--------------------------------------------------------------------------------
1437     //Calculate and return an array of Boolean results to determine whether it is OK
1438     //to view/schedule the indicated date/time. Each Boolean result is TRUE if it is
1439     //OK to view/schedule or FALSE if not.
1440     //
1441     // a)[0] A month ago.
1442     // b)[1] A week ago.
1443     // c)[2] A day ago.
1444     // d)[3] One panel back.
1445     // e)[4] One panel forward.
1446     // f)[5] One day forward.
1447     // g)[6] One week forward.
1448     // h)[7] One month forward.
1449     //
1450     function DATEFUNC_viewschedtime_differential_array($dispyear, $dispmonth, $dispday,
1451     $disphour, $dispminute)
1452     {
1453     global $CONFIG_SCHED_DAY_PANELS;
1454    
1455     //Default to all FALSE so we don't forget anything.
1456     //
1457     $rv = array(FALSE, FALSE, FALSE, FALSE, FALSE, FALSE, FALSE, FALSE);
1458    
1459     //NOW
1460     //---
1461     //For reference, determine if the base display date passed in is
1462     //displayable/schedulable.
1463     //
1464     if (DATEFUNC_is_not_displayable($dispyear, $dispmonth) == 0)
1465     $base_date_is_ok = TRUE;
1466     else
1467     $base_date_is_ok = FALSE;
1468    
1469     //A MONTH AGO
1470     //-----------
1471     //First, try to back off one month to get to the previous month. If we fail on this
1472     //(because we're at the lower limit of what the calendar functionality can handle),
1473     //then we definitely can't display the previous month.
1474     //
1475     DATEFUNC_offset_month($dispyear, $dispmonth, -1, $prev_month_year, $prev_month_month, $prev_month_result_code);
1476    
1477     if ($prev_month_result_code == 0)
1478     {
1479     //We are not up against the limit of the calendaring functionality.
1480     //Evaluate the previous month.
1481     //
1482     if (DATEFUNC_is_not_displayable($prev_month_year, $prev_month_month) == 0)
1483     {
1484     $rv[0] = TRUE; //Seems OK.
1485     }
1486     else
1487     {
1488     $rv[0] = FALSE; //Is outside the viewable range.
1489     }
1490     }
1491     else
1492     {
1493     //We couldn't back off because we were at the limit.
1494     $rv[0] = FALSE;
1495     }
1496    
1497     //A WEEK AGO
1498     //-----------
1499     //The logic for a week ago is that if the day of the month is seven or less, the previous
1500     //month is relevant, else the current month is relevant.
1501     if ($dispday <= 7)
1502     $rv[1] = $rv[0];
1503     else
1504     $rv[1] = $base_date_is_ok;
1505    
1506     //A DAY AGO
1507     //-----------
1508     //The logic for a day ago is that if the day of the month is 1, the previous
1509     //month is relevant, else the current month is relevant.
1510     if ($dispday == 1)
1511     $rv[2] = $rv[0];
1512     else
1513     $rv[2] = $base_date_is_ok;
1514    
1515     //ONE PANEL BACK
1516     //--------------
1517     //Get the currently appropriate panel.
1518     $panel = TOD_best_panel($disphour, $dispminute, $CONFIG_SCHED_DAY_PANELS);
1519     //
1520     //If the current panel is not 0, backing off the panel won't change the date,
1521     //and so the passed date's status is the right thing to look at.
1522     //
1523     //If the current panel is 0, backing off will move the date to the previous
1524     //day, and we use that status.
1525     if ($panel != 0)
1526     {
1527     $rv[3] = $base_date_is_ok;
1528     }
1529     else
1530     {
1531     $rv[3] = $rv[2];
1532     }
1533    
1534     //A MONTH IN THE FUTURE
1535     //---------------------
1536     //First, try to go forward one month to get to the next month. If we fail on this
1537     //(because we're at the upper limit of what the calendar functionality can handle),
1538     //then we definitely can't display the next month.
1539     //
1540     DATEFUNC_offset_month($dispyear, $dispmonth, 1, $next_month_year, $next_month_month, $next_month_result_code);
1541    
1542     if ($next_month_result_code == 0)
1543     {
1544     //We are not up against the limit of the calendaring functionality.
1545     //Evaluate the next month.
1546     //
1547     if (DATEFUNC_is_not_displayable($next_month_year, $next_month_month) == 0)
1548     {
1549     $rv[7] = TRUE; //Seems OK.
1550     }
1551     else
1552     {
1553     $rv[7] = FALSE; //Is outside the viewable range.
1554     }
1555     }
1556     else
1557     {
1558     //We couldn't go forward because we were at the limit.
1559     $rv[7] = FALSE;
1560     }
1561    
1562     //A WEEK IN THE FUTURE
1563     //--------------------
1564     //The logic for a week in the future is that if going forward 7 days will put us
1565     //into the next month, then the validity of that applies, otherwise the
1566     //validity for the current month applies.
1567     $days_in_base_month = DATEFUNC_year_month_days($dispyear, $dispmonth);
1568    
1569     if (($dispday + 7) > $days_in_base_month)
1570     {
1571     //Get value from next month.
1572     $rv[6] = $rv[7];
1573     }
1574     else
1575     {
1576     //Get value from this month.
1577     $rv[6] = $base_date_is_ok;
1578     }
1579    
1580     //A DAY IN THE FUTURE
1581     //-------------------
1582     //The logic for a day in the future is that if the current day is the last day of
1583     //the month, then next month's value applies, otherwise this month's
1584     //value applies.
1585     if ($dispday >= $days_in_base_month)
1586     $rv[5] = $rv[7]; //Next month's value.
1587     else
1588     $rv[5] = $base_date_is_ok; //This month's value.
1589    
1590     //ONE PANEL IN THE FUTURE
1591     //-----------------------
1592     //If the current panel is not the last one, going to the next panel won't change
1593     //the date, and so the passed date's status is the right thing to look at.
1594     //
1595     //If the current panel is the last one, going forward will move the date to the
1596     //next day, and we use that status.
1597     $npanels = (int)(count($CONFIG_SCHED_DAY_PANELS) / 2);
1598     if ($panel >= ($npanels - 1)) //Last penel test.
1599     {
1600     $rv[4] = $rv[5];
1601     }
1602     else
1603     {
1604     $rv[4] = $base_date_is_ok;
1605     }
1606    
1607     //Return the return value.
1608     return($rv);
1609     }
1610     //
1611     //--------------------------------------------------------------------------------
1612     //End of $RCSfile: datefunc.inc,v $.
1613     //--------------------------------------------------------------------------------
1614     ?>

dashley@gmail.com
ViewVC Help
Powered by ViewVC 1.1.25