778 |
779 |
780 |
781 |
782 |
783 |
784 |
785 |
786 |
787 |
788 |
789 | this.scheduleClassInfo.get(0).get(7)
790 | JAVA
791 | EXPRESSION
792 |
793 |
794 | this.scheduledInfo.get(0).get(1).get(0).get(0)
795 | JAVA
796 | EXPRESSION
797 |
798 |
799 | this.fetchTeacherByKemuAndLesson(grade, classNo, subject.getSubjectInfo().getSubjectName())
800 | JAVA
801 | EXPRESSION
802 |
803 |
804 |
805 |
806 |
807 |
808 |
809 |
810 |
811 |
812 |
813 |
814 |
815 |
816 |
817 |
818 |
819 |
820 |
821 |
822 |
823 |
824 |
825 |
826 |
827 |
828 |
829 |
830 |
831 |
832 |
833 |
834 |
835 |
836 |
837 |
838 |
839 |
840 |
841 |
842 |
843 |
844 |
845 |
846 |
847 |
848 |
849 |
850 |
851 |
852 |
853 |
854 |
855 |
856 |
857 |
858 |
859 |
860 |
861 |
862 |
863 |
864 |
865 |
866 |
867 |
868 |
869 |
870 |
871 |
872 |
873 |
874 |
875 |
876 |
877 |
878 |
879 |
880 |
881 |
882 |
883 |
884 |
885 |
886 |
887 |
888 |
889 |
890 |
891 |
892 |
893 |
894 |
895 |
896 |
897 |
898 |
899 |
900 |
901 |
902 |
903 |
904 |
905 |
906 |
907 |
908 |
--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
1 | GNU GENERAL PUBLIC LICENSE
2 | Version 3, 29 June 2007
3 |
4 | Copyright (C) 2007 Free Software Foundation, Inc.
5 | Everyone is permitted to copy and distribute verbatim copies
6 | of this license document, but changing it is not allowed.
7 |
8 | Preamble
9 |
10 | The GNU General Public License is a free, copyleft license for
11 | software and other kinds of works.
12 |
13 | The licenses for most software and other practical works are designed
14 | to take away your freedom to share and change the works. By contrast,
15 | the GNU General Public License is intended to guarantee your freedom to
16 | share and change all versions of a program--to make sure it remains free
17 | software for all its users. We, the Free Software Foundation, use the
18 | GNU General Public License for most of our software; it applies also to
19 | any other work released this way by its authors. You can apply it to
20 | your programs, too.
21 |
22 | When we speak of free software, we are referring to freedom, not
23 | price. Our General Public Licenses are designed to make sure that you
24 | have the freedom to distribute copies of free software (and charge for
25 | them if you wish), that you receive source code or can get it if you
26 | want it, that you can change the software or use pieces of it in new
27 | free programs, and that you know you can do these things.
28 |
29 | To protect your rights, we need to prevent others from denying you
30 | these rights or asking you to surrender the rights. Therefore, you have
31 | certain responsibilities if you distribute copies of the software, or if
32 | you modify it: responsibilities to respect the freedom of others.
33 |
34 | For example, if you distribute copies of such a program, whether
35 | gratis or for a fee, you must pass on to the recipients the same
36 | freedoms that you received. You must make sure that they, too, receive
37 | or can get the source code. And you must show them these terms so they
38 | know their rights.
39 |
40 | Developers that use the GNU GPL protect your rights with two steps:
41 | (1) assert copyright on the software, and (2) offer you this License
42 | giving you legal permission to copy, distribute and/or modify it.
43 |
44 | For the developers' and authors' protection, the GPL clearly explains
45 | that there is no warranty for this free software. For both users' and
46 | authors' sake, the GPL requires that modified versions be marked as
47 | changed, so that their problems will not be attributed erroneously to
48 | authors of previous versions.
49 |
50 | Some devices are designed to deny users access to install or run
51 | modified versions of the software inside them, although the manufacturer
52 | can do so. This is fundamentally incompatible with the aim of
53 | protecting users' freedom to change the software. The systematic
54 | pattern of such abuse occurs in the area of products for individuals to
55 | use, which is precisely where it is most unacceptable. Therefore, we
56 | have designed this version of the GPL to prohibit the practice for those
57 | products. If such problems arise substantially in other domains, we
58 | stand ready to extend this provision to those domains in future versions
59 | of the GPL, as needed to protect the freedom of users.
60 |
61 | Finally, every program is threatened constantly by software patents.
62 | States should not allow patents to restrict development and use of
63 | software on general-purpose computers, but in those that do, we wish to
64 | avoid the special danger that patents applied to a free program could
65 | make it effectively proprietary. To prevent this, the GPL assures that
66 | patents cannot be used to render the program non-free.
67 |
68 | The precise terms and conditions for copying, distribution and
69 | modification follow.
70 |
71 | TERMS AND CONDITIONS
72 |
73 | 0. Definitions.
74 |
75 | "This License" refers to version 3 of the GNU General Public License.
76 |
77 | "Copyright" also means copyright-like laws that apply to other kinds of
78 | works, such as semiconductor masks.
79 |
80 | "The Program" refers to any copyrightable work licensed under this
81 | License. Each licensee is addressed as "you". "Licensees" and
82 | "recipients" may be individuals or organizations.
83 |
84 | To "modify" a work means to copy from or adapt all or part of the work
85 | in a fashion requiring copyright permission, other than the making of an
86 | exact copy. The resulting work is called a "modified version" of the
87 | earlier work or a work "based on" the earlier work.
88 |
89 | A "covered work" means either the unmodified Program or a work based
90 | on the Program.
91 |
92 | To "propagate" a work means to do anything with it that, without
93 | permission, would make you directly or secondarily liable for
94 | infringement under applicable copyright law, except executing it on a
95 | computer or modifying a private copy. Propagation includes copying,
96 | distribution (with or without modification), making available to the
97 | public, and in some countries other activities as well.
98 |
99 | To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies. Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 |
103 | An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License. If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 |
112 | 1. Source Code.
113 |
114 | The "source code" for a work means the preferred form of the work
115 | for making modifications to it. "Object code" means any non-source
116 | form of a work.
117 |
118 | A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 |
123 | The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form. A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 |
134 | The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities. However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work. For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 |
147 | The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 |
151 | The Corresponding Source for a work in source code form is that
152 | same work.
153 |
154 | 2. Basic Permissions.
155 |
156 | All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met. This License explicitly affirms your unlimited
159 | permission to run the unmodified Program. The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work. This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 |
164 | You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force. You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright. Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 |
175 | Conveying under any other circumstances is permitted solely under
176 | the conditions stated below. Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 |
179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 |
181 | No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 |
187 | When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 |
195 | 4. Conveying Verbatim Copies.
196 |
197 | You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 |
205 | You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 |
208 | 5. Conveying Modified Source Versions.
209 |
210 | You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 |
214 | a) The work must carry prominent notices stating that you modified
215 | it, and giving a relevant date.
216 |
217 | b) The work must carry prominent notices stating that it is
218 | released under this License and any conditions added under section
219 | 7. This requirement modifies the requirement in section 4 to
220 | "keep intact all notices".
221 |
222 | c) You must license the entire work, as a whole, under this
223 | License to anyone who comes into possession of a copy. This
224 | License will therefore apply, along with any applicable section 7
225 | additional terms, to the whole of the work, and all its parts,
226 | regardless of how they are packaged. This License gives no
227 | permission to license the work in any other way, but it does not
228 | invalidate such permission if you have separately received it.
229 |
230 | d) If the work has interactive user interfaces, each must display
231 | Appropriate Legal Notices; however, if the Program has interactive
232 | interfaces that do not display Appropriate Legal Notices, your
233 | work need not make them do so.
234 |
235 | A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit. Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 |
245 | 6. Conveying Non-Source Forms.
246 |
247 | You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 |
252 | a) Convey the object code in, or embodied in, a physical product
253 | (including a physical distribution medium), accompanied by the
254 | Corresponding Source fixed on a durable physical medium
255 | customarily used for software interchange.
256 |
257 | b) Convey the object code in, or embodied in, a physical product
258 | (including a physical distribution medium), accompanied by a
259 | written offer, valid for at least three years and valid for as
260 | long as you offer spare parts or customer support for that product
261 | model, to give anyone who possesses the object code either (1) a
262 | copy of the Corresponding Source for all the software in the
263 | product that is covered by this License, on a durable physical
264 | medium customarily used for software interchange, for a price no
265 | more than your reasonable cost of physically performing this
266 | conveying of source, or (2) access to copy the
267 | Corresponding Source from a network server at no charge.
268 |
269 | c) Convey individual copies of the object code with a copy of the
270 | written offer to provide the Corresponding Source. This
271 | alternative is allowed only occasionally and noncommercially, and
272 | only if you received the object code with such an offer, in accord
273 | with subsection 6b.
274 |
275 | d) Convey the object code by offering access from a designated
276 | place (gratis or for a charge), and offer equivalent access to the
277 | Corresponding Source in the same way through the same place at no
278 | further charge. You need not require recipients to copy the
279 | Corresponding Source along with the object code. If the place to
280 | copy the object code is a network server, the Corresponding Source
281 | may be on a different server (operated by you or a third party)
282 | that supports equivalent copying facilities, provided you maintain
283 | clear directions next to the object code saying where to find the
284 | Corresponding Source. Regardless of what server hosts the
285 | Corresponding Source, you remain obligated to ensure that it is
286 | available for as long as needed to satisfy these requirements.
287 |
288 | e) Convey the object code using peer-to-peer transmission, provided
289 | you inform other peers where the object code and Corresponding
290 | Source of the work are being offered to the general public at no
291 | charge under subsection 6d.
292 |
293 | A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 |
297 | A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling. In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage. For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product. A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 |
310 | "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source. The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 |
318 | If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information. But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 |
329 | The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed. Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 |
337 | Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 |
343 | 7. Additional Terms.
344 |
345 | "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law. If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 |
354 | When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it. (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.) You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 |
361 | Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 |
365 | a) Disclaiming warranty or limiting liability differently from the
366 | terms of sections 15 and 16 of this License; or
367 |
368 | b) Requiring preservation of specified reasonable legal notices or
369 | author attributions in that material or in the Appropriate Legal
370 | Notices displayed by works containing it; or
371 |
372 | c) Prohibiting misrepresentation of the origin of that material, or
373 | requiring that modified versions of such material be marked in
374 | reasonable ways as different from the original version; or
375 |
376 | d) Limiting the use for publicity purposes of names of licensors or
377 | authors of the material; or
378 |
379 | e) Declining to grant rights under trademark law for use of some
380 | trade names, trademarks, or service marks; or
381 |
382 | f) Requiring indemnification of licensors and authors of that
383 | material by anyone who conveys the material (or modified versions of
384 | it) with contractual assumptions of liability to the recipient, for
385 | any liability that these contractual assumptions directly impose on
386 | those licensors and authors.
387 |
388 | All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10. If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term. If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 |
398 | If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 |
403 | Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 |
407 | 8. Termination.
408 |
409 | You may not propagate or modify a covered work except as expressly
410 | provided under this License. Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 |
415 | However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 |
422 | Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 |
429 | Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License. If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 |
435 | 9. Acceptance Not Required for Having Copies.
436 |
437 | You are not required to accept this License in order to receive or
438 | run a copy of the Program. Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance. However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work. These actions infringe copyright if you do
443 | not accept this License. Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 |
446 | 10. Automatic Licensing of Downstream Recipients.
447 |
448 | Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License. You are not responsible
451 | for enforcing compliance by third parties with this License.
452 |
453 | An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations. If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 |
463 | You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License. For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 |
471 | 11. Patents.
472 |
473 | A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based. The
475 | work thus licensed is called the contributor's "contributor version".
476 |
477 | A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version. For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 |
487 | Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 |
492 | In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement). To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 |
499 | If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients. "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 |
513 | If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 |
521 | A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License. You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 |
536 | Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 |
540 | 12. No Surrender of Others' Freedom.
541 |
542 | If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License. If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all. For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 |
552 | 13. Use with the GNU Affero General Public License.
553 |
554 | Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work. The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 |
563 | 14. Revised Versions of this License.
564 |
565 | The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time. Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 |
570 | Each version is given a distinguishing version number. If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation. If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 |
579 | If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 |
584 | Later license versions may give you additional or different
585 | permissions. However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 |
589 | 15. Disclaimer of Warranty.
590 |
591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 |
600 | 16. Limitation of Liability.
601 |
602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 |
612 | 17. Interpretation of Sections 15 and 16.
613 |
614 | If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 |
621 | END OF TERMS AND CONDITIONS
622 |
623 | How to Apply These Terms to Your New Programs
624 |
625 | If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 |
629 | To do so, attach the following notices to the program. It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 |
634 |
635 | Copyright (C)
636 |
637 | This program is free software: you can redistribute it and/or modify
638 | it under the terms of the GNU General Public License as published by
639 | the Free Software Foundation, either version 3 of the License, or
640 | (at your option) any later version.
641 |
642 | This program is distributed in the hope that it will be useful,
643 | but WITHOUT ANY WARRANTY; without even the implied warranty of
644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
645 | GNU General Public License for more details.
646 |
647 | You should have received a copy of the GNU General Public License
648 | along with this program. If not, see .
649 |
650 | Also add information on how to contact you by electronic and paper mail.
651 |
652 | If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 |
655 | Copyright (C)
656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 | This is free software, and you are welcome to redistribute it
658 | under certain conditions; type `show c' for details.
659 |
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License. Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 |
664 | You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | .
668 |
669 | The GNU General Public License does not permit incorporating your program
670 | into proprietary programs. If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library. If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License. But first, please read
674 | .
--------------------------------------------------------------------------------
/build.gradle:
--------------------------------------------------------------------------------
1 | buildscript {
2 | ext {
3 | springBootVersion = '2.0.5.RELEASE'
4 | }
5 | repositories {
6 | mavenCentral()
7 | }
8 | dependencies {
9 | classpath("org.springframework.boot:spring-boot-gradle-plugin:${springBootVersion}")
10 | }
11 | }
12 |
13 | apply plugin: 'java'
14 | apply plugin: 'eclipse'
15 | apply plugin: 'org.springframework.boot'
16 | apply plugin: 'io.spring.dependency-management'
17 |
18 | group = 'org.aorise'
19 | version = '0.0.1-SNAPSHOT'
20 | sourceCompatibility = 1.8
21 |
22 | repositories {
23 | mavenCentral()
24 | }
25 |
26 |
27 | dependencies {
28 | compile('org.springframework.boot:spring-boot-starter')
29 | compileOnly('org.projectlombok:lombok')
30 | testCompile('org.springframework.boot:spring-boot-starter-test')
31 | }
32 |
--------------------------------------------------------------------------------
/gradle/wrapper/gradle-wrapper.properties:
--------------------------------------------------------------------------------
1 | #Tue Feb 06 12:27:20 CET 2018
2 | distributionBase=GRADLE_USER_HOME
3 | distributionPath=wrapper/dists
4 | zipStoreBase=GRADLE_USER_HOME
5 | zipStorePath=wrapper/dists
6 | distributionUrl=https\://services.gradle.org/distributions/gradle-4.8.1-bin.zip
7 |
--------------------------------------------------------------------------------
/gradlew:
--------------------------------------------------------------------------------
1 | #!/usr/bin/env sh
2 |
3 | ##############################################################################
4 | ##
5 | ## Gradle start up script for UN*X
6 | ##
7 | ##############################################################################
8 |
9 | # Attempt to set APP_HOME
10 | # Resolve links: $0 may be a link
11 | PRG="$0"
12 | # Need this for relative symlinks.
13 | while [ -h "$PRG" ] ; do
14 | ls=`ls -ld "$PRG"`
15 | link=`expr "$ls" : '.*-> \(.*\)$'`
16 | if expr "$link" : '/.*' > /dev/null; then
17 | PRG="$link"
18 | else
19 | PRG=`dirname "$PRG"`"/$link"
20 | fi
21 | done
22 | SAVED="`pwd`"
23 | cd "`dirname \"$PRG\"`/" >/dev/null
24 | APP_HOME="`pwd -P`"
25 | cd "$SAVED" >/dev/null
26 |
27 | APP_NAME="Gradle"
28 | APP_BASE_NAME=`basename "$0"`
29 |
30 | # Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script.
31 | DEFAULT_JVM_OPTS=""
32 |
33 | # Use the maximum available, or set MAX_FD != -1 to use that value.
34 | MAX_FD="maximum"
35 |
36 | warn ( ) {
37 | echo "$*"
38 | }
39 |
40 | die ( ) {
41 | echo
42 | echo "$*"
43 | echo
44 | exit 1
45 | }
46 |
47 | # OS specific support (must be 'true' or 'false').
48 | cygwin=false
49 | msys=false
50 | darwin=false
51 | nonstop=false
52 | case "`uname`" in
53 | CYGWIN* )
54 | cygwin=true
55 | ;;
56 | Darwin* )
57 | darwin=true
58 | ;;
59 | MINGW* )
60 | msys=true
61 | ;;
62 | NONSTOP* )
63 | nonstop=true
64 | ;;
65 | esac
66 |
67 | CLASSPATH=$APP_HOME/gradle/wrapper/gradle-wrapper.jar
68 |
69 | # Determine the Java command to use to start the JVM.
70 | if [ -n "$JAVA_HOME" ] ; then
71 | if [ -x "$JAVA_HOME/jre/sh/java" ] ; then
72 | # IBM's JDK on AIX uses strange locations for the executables
73 | JAVACMD="$JAVA_HOME/jre/sh/java"
74 | else
75 | JAVACMD="$JAVA_HOME/bin/java"
76 | fi
77 | if [ ! -x "$JAVACMD" ] ; then
78 | die "ERROR: JAVA_HOME is set to an invalid directory: $JAVA_HOME
79 |
80 | Please set the JAVA_HOME variable in your environment to match the
81 | location of your Java installation."
82 | fi
83 | else
84 | JAVACMD="java"
85 | which java >/dev/null 2>&1 || die "ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH.
86 |
87 | Please set the JAVA_HOME variable in your environment to match the
88 | location of your Java installation."
89 | fi
90 |
91 | # Increase the maximum file descriptors if we can.
92 | if [ "$cygwin" = "false" -a "$darwin" = "false" -a "$nonstop" = "false" ] ; then
93 | MAX_FD_LIMIT=`ulimit -H -n`
94 | if [ $? -eq 0 ] ; then
95 | if [ "$MAX_FD" = "maximum" -o "$MAX_FD" = "max" ] ; then
96 | MAX_FD="$MAX_FD_LIMIT"
97 | fi
98 | ulimit -n $MAX_FD
99 | if [ $? -ne 0 ] ; then
100 | warn "Could not set maximum file descriptor limit: $MAX_FD"
101 | fi
102 | else
103 | warn "Could not query maximum file descriptor limit: $MAX_FD_LIMIT"
104 | fi
105 | fi
106 |
107 | # For Darwin, add options to specify how the application appears in the dock
108 | if $darwin; then
109 | GRADLE_OPTS="$GRADLE_OPTS \"-Xdock:name=$APP_NAME\" \"-Xdock:icon=$APP_HOME/media/gradle.icns\""
110 | fi
111 |
112 | # For Cygwin, switch paths to Windows format before running java
113 | if $cygwin ; then
114 | APP_HOME=`cygpath --path --mixed "$APP_HOME"`
115 | CLASSPATH=`cygpath --path --mixed "$CLASSPATH"`
116 | JAVACMD=`cygpath --unix "$JAVACMD"`
117 |
118 | # We build the pattern for arguments to be converted via cygpath
119 | ROOTDIRSRAW=`find -L / -maxdepth 1 -mindepth 1 -type d 2>/dev/null`
120 | SEP=""
121 | for dir in $ROOTDIRSRAW ; do
122 | ROOTDIRS="$ROOTDIRS$SEP$dir"
123 | SEP="|"
124 | done
125 | OURCYGPATTERN="(^($ROOTDIRS))"
126 | # Add a user-defined pattern to the cygpath arguments
127 | if [ "$GRADLE_CYGPATTERN" != "" ] ; then
128 | OURCYGPATTERN="$OURCYGPATTERN|($GRADLE_CYGPATTERN)"
129 | fi
130 | # Now convert the arguments - kludge to limit ourselves to /bin/sh
131 | i=0
132 | for arg in "$@" ; do
133 | CHECK=`echo "$arg"|egrep -c "$OURCYGPATTERN" -`
134 | CHECK2=`echo "$arg"|egrep -c "^-"` ### Determine if an option
135 |
136 | if [ $CHECK -ne 0 ] && [ $CHECK2 -eq 0 ] ; then ### Added a condition
137 | eval `echo args$i`=`cygpath --path --ignore --mixed "$arg"`
138 | else
139 | eval `echo args$i`="\"$arg\""
140 | fi
141 | i=$((i+1))
142 | done
143 | case $i in
144 | (0) set -- ;;
145 | (1) set -- "$args0" ;;
146 | (2) set -- "$args0" "$args1" ;;
147 | (3) set -- "$args0" "$args1" "$args2" ;;
148 | (4) set -- "$args0" "$args1" "$args2" "$args3" ;;
149 | (5) set -- "$args0" "$args1" "$args2" "$args3" "$args4" ;;
150 | (6) set -- "$args0" "$args1" "$args2" "$args3" "$args4" "$args5" ;;
151 | (7) set -- "$args0" "$args1" "$args2" "$args3" "$args4" "$args5" "$args6" ;;
152 | (8) set -- "$args0" "$args1" "$args2" "$args3" "$args4" "$args5" "$args6" "$args7" ;;
153 | (9) set -- "$args0" "$args1" "$args2" "$args3" "$args4" "$args5" "$args6" "$args7" "$args8" ;;
154 | esac
155 | fi
156 |
157 | # Escape application args
158 | save ( ) {
159 | for i do printf %s\\n "$i" | sed "s/'/'\\\\''/g;1s/^/'/;\$s/\$/' \\\\/" ; done
160 | echo " "
161 | }
162 | APP_ARGS=$(save "$@")
163 |
164 | # Collect all arguments for the java command, following the shell quoting and substitution rules
165 | eval set -- $DEFAULT_JVM_OPTS $JAVA_OPTS $GRADLE_OPTS "\"-Dorg.gradle.appname=$APP_BASE_NAME\"" -classpath "\"$CLASSPATH\"" org.gradle.wrapper.GradleWrapperMain "$APP_ARGS"
166 |
167 | # by default we should be in the correct project dir, but when run from Finder on Mac, the cwd is wrong
168 | if [ "$(uname)" = "Darwin" ] && [ "$HOME" = "$PWD" ]; then
169 | cd "$(dirname "$0")"
170 | fi
171 |
172 | exec "$JAVACMD" "$@"
173 |
--------------------------------------------------------------------------------
/gradlew.bat:
--------------------------------------------------------------------------------
1 | @if "%DEBUG%" == "" @echo off
2 | @rem ##########################################################################
3 | @rem
4 | @rem Gradle startup script for Windows
5 | @rem
6 | @rem ##########################################################################
7 |
8 | @rem Set local scope for the variables with windows NT shell
9 | if "%OS%"=="Windows_NT" setlocal
10 |
11 | set DIRNAME=%~dp0
12 | if "%DIRNAME%" == "" set DIRNAME=.
13 | set APP_BASE_NAME=%~n0
14 | set APP_HOME=%DIRNAME%
15 |
16 | @rem Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script.
17 | set DEFAULT_JVM_OPTS=
18 |
19 | @rem Find java.exe
20 | if defined JAVA_HOME goto findJavaFromJavaHome
21 |
22 | set JAVA_EXE=java.exe
23 | %JAVA_EXE% -version >NUL 2>&1
24 | if "%ERRORLEVEL%" == "0" goto init
25 |
26 | echo.
27 | echo ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH.
28 | echo.
29 | echo Please set the JAVA_HOME variable in your environment to match the
30 | echo location of your Java installation.
31 |
32 | goto fail
33 |
34 | :findJavaFromJavaHome
35 | set JAVA_HOME=%JAVA_HOME:"=%
36 | set JAVA_EXE=%JAVA_HOME%/bin/java.exe
37 |
38 | if exist "%JAVA_EXE%" goto init
39 |
40 | echo.
41 | echo ERROR: JAVA_HOME is set to an invalid directory: %JAVA_HOME%
42 | echo.
43 | echo Please set the JAVA_HOME variable in your environment to match the
44 | echo location of your Java installation.
45 |
46 | goto fail
47 |
48 | :init
49 | @rem Get command-line arguments, handling Windows variants
50 |
51 | if not "%OS%" == "Windows_NT" goto win9xME_args
52 |
53 | :win9xME_args
54 | @rem Slurp the command line arguments.
55 | set CMD_LINE_ARGS=
56 | set _SKIP=2
57 |
58 | :win9xME_args_slurp
59 | if "x%~1" == "x" goto execute
60 |
61 | set CMD_LINE_ARGS=%*
62 |
63 | :execute
64 | @rem Setup the command line
65 |
66 | set CLASSPATH=%APP_HOME%\gradle\wrapper\gradle-wrapper.jar
67 |
68 | @rem Execute Gradle
69 | "%JAVA_EXE%" %DEFAULT_JVM_OPTS% %JAVA_OPTS% %GRADLE_OPTS% "-Dorg.gradle.appname=%APP_BASE_NAME%" -classpath "%CLASSPATH%" org.gradle.wrapper.GradleWrapperMain %CMD_LINE_ARGS%
70 |
71 | :end
72 | @rem End local scope for the variables with windows NT shell
73 | if "%ERRORLEVEL%"=="0" goto mainEnd
74 |
75 | :fail
76 | rem Set variable GRADLE_EXIT_CONSOLE if you need the _script_ return code instead of
77 | rem the _cmd.exe /c_ return code!
78 | if not "" == "%GRADLE_EXIT_CONSOLE%" exit 1
79 | exit /b 1
80 |
81 | :mainEnd
82 | if "%OS%"=="Windows_NT" endlocal
83 |
84 | :omega
85 |
--------------------------------------------------------------------------------
/lessonschedule.iml:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
11 |
12 |
13 |
--------------------------------------------------------------------------------
/out/production/resources/application.properties:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/xaioyao/lessonschedule/2aa1cfff918cc416114f114ef78d83772bf02812/out/production/resources/application.properties
--------------------------------------------------------------------------------
/settings.gradle:
--------------------------------------------------------------------------------
1 | rootProject.name = 'lessonschedule'
2 |
--------------------------------------------------------------------------------
/src/main/java/org/aorise/lessonschedule/classSchedule/ClassScheduling.java:
--------------------------------------------------------------------------------
1 | package org.aorise.lessonschedule.classSchedule;
2 |
3 | import lombok.Data;
4 | import org.aorise.lessonschedule.classSchedule.Model.*;
5 | import org.aorise.lessonschedule.classSchedule.Service.ISubjectChoose;
6 | import org.aorise.lessonschedule.classSchedule.Service.IWeightCalc;
7 |
8 | import java.util.*;
9 |
10 | /**
11 | * Created by xiaoyao on 2018/9/17.
12 | */
13 | @Data
14 | public class ClassScheduling {
15 | private Map gradeInfoMap;//基础信息 //输入信息
16 | private List udfFixedSubjectList; //外部初始化
17 | private Map>>> scheduleInfos;//课表信息,年级:班级:周天:课节:课程 //最终输出
18 | private Map>> teacherSchedule;//老师课程安排 //中间数据
19 | private Map>> scheduleClassInfo;//班级课程信息
20 | private Map>>>> scheduledInfo;//已经排课位置信息 //中间数据
21 | private Map scheduledLesson;//已经安排的位置
22 | private Map> classFreeSpace;//班级剩余课节数
23 | private List teacherList;//老师列表
24 | private Integer gradeCount = 0;//多少个年级
25 | private Integer classCount = 0;//多少个班级
26 | private Integer maxDayPerWeek = 0;//做大周天数
27 | private Integer maxLessonPerDay = 0;//最大节数
28 | private Integer maxWeight = 0;
29 | private List onlyOneChoice;
30 |
31 | public ISubjectChoose iSubjectChoose;//科目自定义规则筛选
32 | public IWeightCalc iWeightCalc;//科目权重外部因素计算
33 |
34 | public boolean makeLessonTable() {
35 | //检查gradeInfo
36 | if (!this.checkInputGradeInfo(this.gradeInfoMap)) {
37 | return false;
38 | }
39 | if (!this.processNullPos(this.gradeInfoMap)) {
40 | return false;
41 | }
42 | //c初始化老师课程安排信息
43 | if (!initTeacherList(this.gradeInfoMap)) {
44 | return false;
45 | }
46 | //初始化老师任课信息
47 | if (!this.initTeacherLesson()) {
48 | return false;
49 | }
50 | //初始化课表信息
51 | if (!this.initLessonTableInfo(this.gradeInfoMap)) {
52 | return false;
53 | }
54 | //初始化中间排课过程信息
55 | if (!this.initScheduldInfo(this.gradeInfoMap)) {
56 | return false;
57 | }
58 |
59 | this.scheduledLesson = new HashMap();
60 | this.onlyOneChoice = new ArrayList();
61 | //优先安排外部设定唯一的科目
62 | this.firstSetUdfOnlyOneSubject(this.udfFixedSubjectList);
63 |
64 | this.firstSetOnlyChoice();
65 | //遍历所有课节
66 | for (Map.Entry item : this.gradeInfoMap.entrySet()) {
67 | for (Map.Entry itemItem : item.getValue().getClassInfos().entrySet()) {
68 | for (Integer weekDay = 0; weekDay < item.getValue().getDayPerWeek(); weekDay++) {
69 | for (Integer lessonNo = 0; lessonNo < item.getValue().getLessonPerDay(); lessonNo++) {
70 | //排课
71 | /*
72 | 1、如果已经安排则跳过
73 | 2、筛选可排科目
74 | 3、处理科目权重
75 | 4、安排课程
76 | 5、预处理后续课程信息
77 | */
78 | if (this.scheduledLesson.get(this.generateKey(item.getKey(), itemItem.getKey(), weekDay, lessonNo)) != null) {
79 | continue;//已经排课
80 | }
81 | List lessonValidSubjects = this.fetchValidSubject(item.getKey(), itemItem.getKey(), weekDay, lessonNo);
82 | if (iSubjectChoose != null) {
83 | List udfSubjects = iSubjectChoose.unSelectSubject(item.getKey(), itemItem.getKey(), weekDay, lessonNo);
84 | //合并两个科目列表
85 | this.mergeValidSubject(lessonValidSubjects, udfSubjects);
86 | }
87 | if (lessonValidSubjects.size() == 0) {
88 | continue;
89 | }
90 |
91 | this.addScheduldPosition(item.getKey(), itemItem.getKey(), weekDay, lessonNo);
92 | this.classFreeSpace.get(item.getKey()).put(itemItem.getKey(), this.classFreeSpace.get(item.getKey()).get(itemItem.getKey()).intValue() - 1);
93 | //处理权重
94 | this.calcWeights(item.getKey(), itemItem.getKey(), weekDay, lessonNo, lessonValidSubjects);
95 | //选择一门课
96 | SchedulingProcessInfo selSubject = this.chooseOneSubject(lessonValidSubjects);
97 | String subjectTeacher = this.fetchTeacherByKemuAndLesson(item.getKey(), itemItem.getKey(), selSubject.getScheduleClassInfo().getSubjectInfo().getSubjectName());
98 | //设置课程
99 | this.setScheduleTable(item.getKey(), itemItem.getKey(), weekDay, lessonNo, selSubject);
100 | //设置预排课信息
101 | this.setPreScheduleInfo(item.getKey(), itemItem.getKey(), weekDay, lessonNo, subjectTeacher, selSubject);
102 | //如果存在某个位置只有一门课可以安排,则直接安排
103 | //this.firstSetOnlyChoice();
104 | }
105 | }
106 | //班级课程安排完成后,如果有未排课区域,则做自动调课,保证在没有极端冲突的情况下,把课排满
107 | this.autoMicroChangeLesson(item.getKey(), itemItem.getKey());
108 | }
109 | }
110 | return true;
111 | }
112 |
113 | //安排外部设置只有一门可选科目的位置
114 | private void firstSetUdfOnlyOneSubject(List positionInfos) {
115 | if (positionInfos == null) {
116 | return;
117 | }
118 | for (SchedulePositionInfo info : positionInfos) {
119 | //设置对应位置的科目
120 | for (SchedulingProcessInfo item : this.scheduledInfo.get(info.getGrade()).get(info.getClassNo())
121 | .get(info.getWeekDay()).get(info.getSeqNo())) {
122 | if (!info.getSubjectInfo().equals(item.getScheduleClassInfo().getSubjectInfo())) {
123 | item.setCannotSelReason(4);//外部设置
124 | item.setCanSelect(false);
125 | }
126 | }
127 | if (this.scheduledLesson.get(this.generateKey(info.getGrade(), info.getClassNo(), info.getWeekDay(), info.getSeqNo())) == null) {
128 | this.setOnlyOneSubjectChoice(info.getGrade(), info.getClassNo(), info.getWeekDay(), info.getSeqNo());
129 | }
130 | }
131 | }
132 |
133 | //未安排完的科目
134 | private List fetchMicroChangeSubjectCanSelect(Integer grade, Integer classNo, Integer weekDay, Integer lessonNo) {
135 | List result = new ArrayList();
136 | for (SchedulingProcessInfo item : this.scheduledInfo.get(grade).get(classNo).get(weekDay).get(lessonNo)) {
137 | if (item.getScheduleClassInfo().getUnUsedCount() > 0) {
138 | result.add(item);
139 | }
140 | }
141 | return result;
142 | }
143 |
144 | private boolean isSubjectInScheduleProcessList(SubjectInfo info, List infos) {
145 | for (SchedulingProcessInfo item : infos) {
146 | if (item.getScheduleClassInfo().getSubjectInfo().equals(info)) {
147 | return true;
148 | }
149 | }
150 | return false;
151 | }
152 |
153 | private boolean isInfoInScheduleProcessList(SchedulingProcessInfo info, List infos) {
154 | for (SchedulingProcessInfo item : infos) {
155 | if (item.equals(info)) {
156 | return true;
157 | }
158 | }
159 | return false;
160 | }
161 |
162 | //此位置可以安排的科目
163 | //考虑一个老师不给两个半上课则exceptReason=false 不考虑则exceptReason=true
164 | private List fetchMicroChangeSubjectValids(Integer grade, Integer classNo, Integer weekDay, Integer lessonNo, boolean exceptReason) {
165 | List result = new ArrayList();
166 | for (SchedulingProcessInfo item : this.scheduledInfo.get(grade).get(classNo).get(weekDay).get(lessonNo)) {
167 | if (item.getScheduleClassInfo().getSubjectInfo().getSubjectCode() == "wk") {
168 | continue;
169 | }
170 | Integer reason = item.getCannotSelReason();
171 | if (reason != 1 || exceptReason) {
172 | int cntDayLesson = 0;
173 | for (Integer idx = 0; idx < this.gradeInfoMap.get(grade).getLessonPerDay(); idx++) {
174 | if (idx == lessonNo) {
175 | continue;
176 | }
177 | if (this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(idx).getSubjectInfo() == null) {
178 | continue;
179 | }
180 | if (this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(idx).getSubjectInfo().equals(item.getScheduleClassInfo().getSubjectInfo())) {
181 | cntDayLesson++;
182 | }
183 | }
184 | if (cntDayLesson >= item.getScheduleClassInfo().getTotalCount() / 1.0 / this.gradeInfoMap.get(grade).getDayPerWeek()) {
185 | continue;
186 | }
187 | result.add(item);
188 | }
189 | }
190 | return result;
191 | }
192 |
193 |
194 | //调换同一班级两个位置的课程
195 | private boolean changeLesson(Integer grade, Integer classNo, Integer SourceWeekDay, Integer SourceLessonNo, Integer DestWeekDay, Integer DestLessonNo,
196 | SchedulePositionInfo source, SchedulePositionInfo dest) {
197 | if (source.getSubjectInfo().equals(dest.getSubjectInfo())) {
198 | return false;
199 | }
200 | //获取源位置可以安排的科目列表
201 | List sourceCanSelectSubjects = this.fetchMicroChangeSubjectValids(grade, classNo, SourceWeekDay, SourceLessonNo, false);
202 | //获取目标位置可以安排的科目列表
203 | List destCanSelectSubjects = this.fetchMicroChangeSubjectValids(grade, classNo, DestWeekDay, DestLessonNo, false);
204 | if (SourceWeekDay == DestWeekDay) {
205 | for (SchedulingProcessInfo item : this.scheduledInfo.get(grade).get(classNo).get(SourceWeekDay).get(SourceLessonNo)) {
206 | if (item.getScheduleClassInfo().getSubjectInfo().equals(dest.getSubjectInfo())) {
207 | sourceCanSelectSubjects.add(item);
208 | break;
209 | }
210 | }
211 | }
212 | if (sourceCanSelectSubjects.size() <= 0 || destCanSelectSubjects.size() <= 0) {
213 | return false;
214 | }
215 | boolean canChangeDestPos = false;
216 | boolean canChangeSourcePos = false;
217 | for (SchedulingProcessInfo subjectS : sourceCanSelectSubjects) {//判断目标位置科目是否可以放在源位置
218 | if (subjectS.getScheduleClassInfo().getSubjectInfo().equals(dest.getSubjectInfo())) {
219 | canChangeSourcePos = true;
220 | break;
221 | }
222 | }
223 | //canChangeSubjects包含item,已经排好的位置可以安排没有安排满的课程
224 | for (SchedulingProcessInfo subjectD : destCanSelectSubjects) {
225 | if (subjectD.getScheduleClassInfo().getSubjectInfo().equals(source.getSubjectInfo())) {
226 | canChangeDestPos = true;
227 | break;
228 | }
229 | }
230 | if (!canChangeDestPos || !canChangeSourcePos) {
231 | return false;
232 | }
233 | return true;
234 | }
235 |
236 | //自动微调
237 | private void autoMicroChangeLesson(Integer grade, Integer classNo) {
238 | boolean canChangeDestPos = false;
239 | boolean canChangeSourcePos = false;
240 | for (Integer weekDay = 0; weekDay < this.gradeInfoMap.get(grade).getDayPerWeek(); weekDay++) {
241 | for (Integer lessonNo = 0; lessonNo < this.gradeInfoMap.get(grade).getLessonPerDay(); lessonNo++) {
242 | if (this.scheduledLesson.get(this.generateKey(grade, classNo, weekDay, lessonNo)) != null) {
243 | continue;
244 | }
245 | //获取可以安排的科目列表
246 | List unFixedSubjects = this.fetchMicroChangeSubjectCanSelect(grade, classNo, weekDay, lessonNo);
247 |
248 | //遍历科目
249 | boolean canBreak = false;
250 | for (SchedulingProcessInfo subjectC : unFixedSubjects) {
251 | //遍历预备调换位置(调换下午的课程)
252 | for (Integer weekDay1 = 0; weekDay1 < this.gradeInfoMap.get(grade).getDayPerWeek(); weekDay1++) {//遍历待替换的位置
253 | //for (Integer lessonNo1 = this.gradeInfoMap.get(grade).getLessonAtAM(); lessonNo1 < this.gradeInfoMap.get(grade).getLessonPerDay(); lessonNo1++) {
254 | for (Integer lessonNo1 = 1; lessonNo1 < this.gradeInfoMap.get(grade).getLessonPerDay(); lessonNo1++) {
255 | boolean isUdfFixedPos = false;
256 | for (SchedulePositionInfo sp : this.udfFixedSubjectList) {
257 | if (sp.getGrade() == grade && sp.getClassNo() == classNo && sp.getWeekDay() == weekDay1 && sp.getSeqNo() == lessonNo1) {
258 | isUdfFixedPos = true;
259 | break;
260 | }
261 | }
262 | if (isUdfFixedPos) {
263 | continue;
264 | }
265 | SchedulePositionInfo source = new SchedulePositionInfo(grade, classNo, weekDay, lessonNo, subjectC.getScheduleClassInfo().getSubjectInfo(),
266 | this.fetchTeacherByKemuAndLesson(grade, classNo, subjectC.getScheduleClassInfo().getSubjectInfo().getSubjectName()));
267 | if (this.changeLesson(grade, classNo, weekDay, lessonNo, weekDay1, lessonNo1,
268 | source,
269 | this.scheduleInfos.get(grade).get(classNo).get(weekDay1).get(lessonNo1))) {
270 |
271 | this.setScheduleTable(grade, classNo, weekDay, lessonNo, this.scheduleInfos.get(grade).get(classNo).get(weekDay1).get(lessonNo1));
272 | this.setScheduleTable(grade, classNo, weekDay1, lessonNo1, source);
273 |
274 | this.reduceSelfCanUseCount(grade, classNo, weekDay, lessonNo,
275 | this.fetchTeacherByKemuAndLesson(grade, classNo, subjectC.getScheduleClassInfo().getSubjectInfo().getSubjectName())
276 | , subjectC);
277 |
278 | canBreak = true;
279 | break;
280 | }
281 | }
282 | if (canBreak) {
283 | break;
284 | }
285 | }
286 | }
287 | }
288 | }
289 | }
290 |
291 | //优先安排只有一门可排的情况
292 | private void firstSetOnlyChoice() {
293 | /*
294 | 1、遍历只有一个可选的位置列表
295 | 2、设置课程
296 | */
297 | if (this.onlyOneChoice.size() <= 0) {
298 | return;
299 | }
300 | //for (SchedulePositionInfo item : this.onlyOneChoice) {
301 | SchedulePositionInfo item = this.onlyOneChoice.get(0);
302 | this.addScheduldPosition(item.getGrade(), item.getClassNo(), item.getWeekDay(), item.getSeqNo());
303 | SchedulingProcessInfo subject = null;
304 |
305 | String subjectTeacher = this.fetchTeacherByKemuAndLesson(item.getGrade(), item.getClassNo(), item.getSubjectInfo().getSubjectName());
306 | //设置课程
307 | for (SchedulingProcessInfo info : this.scheduledInfo.get(item.getGrade()).get(item.getClassNo()).get(item.getWeekDay())
308 | .get(item.getSeqNo())) {
309 | if (info.getScheduleClassInfo().getSubjectInfo().equals(item.getSubjectInfo())) {
310 | subject = info;
311 | this.setScheduleTable(item.getGrade(), item.getClassNo(), item.getWeekDay(), item.getSeqNo(), info);
312 | break;
313 | }
314 | }
315 | //设置预排课信息
316 | this.onlyOneChoice.remove(item);
317 | this.setPreScheduleInfo(item.getGrade(), item.getClassNo(), item.getWeekDay(), item.getSeqNo(), subjectTeacher, subject);
318 | this.firstSetOnlyChoice();
319 | }
320 |
321 | //设置预排课过程信息
322 | private void setPreScheduleInfo(Integer grade, Integer classNo, Integer weekDay, Integer lesssonNo, String teacher, SchedulingProcessInfo schedulingProcessInfo) {
323 | /*
324 | 1、减少可排课程的课节数
325 | 2、安排老师课程
326 | 3、处理其他位置可排课程信息
327 | 4、计算每个科目剩余可排课节数
328 | 5、增加已排位置记录
329 | */
330 | for (Map.Entry>>> item : this.scheduleInfos.entrySet()) {
331 | for (Map.Entry>> itemItem : item.getValue().entrySet()) {
332 | //1、减少其他班级本位置同老师科目的freeSpace
333 | if ((item.getKey() > grade) || (item.getKey() == grade && itemItem.getKey() > classNo)) {
334 | this.reduceFreeSpaceCount(item.getKey(), itemItem.getKey(), weekDay, lesssonNo, teacher, schedulingProcessInfo);
335 | }
336 | //记录不能排课的原因(同老师其他位置上课,导致不能在本节安排)
337 | }
338 | }
339 |
340 | //减少本班剩余课节的freeSpace
341 | this.reduceSelfFreeSpaceCount(grade, classNo, weekDay, lesssonNo, teacher, schedulingProcessInfo);
342 | //减少可排课节数
343 | this.reduceSelfCanUseCount(grade, classNo, weekDay, lesssonNo, teacher, schedulingProcessInfo);
344 | //处理老师课表
345 | this.recordTeacherSchedule(grade, classNo, weekDay, lesssonNo, teacher, schedulingProcessInfo);
346 | //处理各个位置科目可以选择情况
347 | this.processScheduleSubjectInfo(grade, classNo, weekDay, lesssonNo, teacher);
348 | }
349 |
350 | //处理单个位置可选科目情况
351 | private void processScheduleSubjectInfo(Integer grade, Integer classNo, Integer weekDay, Integer lesssonNo, String teacher) {
352 | for (Map.Entry>>> item : this.scheduleInfos.entrySet()) {
353 | for (Map.Entry>> itemItem : item.getValue().entrySet()) {
354 | for (Map.Entry> itemItemItem : itemItem.getValue().entrySet()) {
355 | for (Map.Entry itemItemItemItem : itemItemItem.getValue().entrySet()) {
356 | //处理本节课以外的所有位置
357 | if (item.getKey() == grade && itemItem.getKey() == classNo &&
358 | itemItemItem.getKey() == weekDay && itemItemItemItem.getKey() == lesssonNo) {
359 | continue;
360 | }
361 | //检查科目列表
362 | for (SchedulingProcessInfo info : this.scheduledInfo.get(item.getKey()).get(itemItem.getKey())
363 | .get(itemItemItem.getKey()).get(itemItemItemItem.getKey())) {
364 | //如果本门课此位置不可排 则设置为1.如果可已经拍完,则设置为2
365 | if (info.getScheduleClassInfo().getCannotSetPosMap().get(this.generateKey(
366 | item.getKey(), itemItem.getKey(), itemItemItem.getKey(), itemItemItemItem.getKey()
367 | )) != null) {
368 | info.setCannotSelReason(1);
369 | info.setCanSelect(false);
370 | }
371 |
372 | //如果此科目的老师和已经安排的科目一直,则设置position
373 | if (weekDay == itemItemItem.getKey() && lesssonNo == itemItemItemItem.getKey()) {
374 | if (teacher.equals(this.fetchTeacherByKemuAndLesson(item.getKey(), itemItem.getKey(), info.getScheduleClassInfo().getSubjectInfo().getSubjectName()))) {
375 | info.setPositionInfo(new SchedulePositionInfo(grade, classNo, weekDay, lesssonNo, info.getScheduleClassInfo().getSubjectInfo(), teacher));
376 | }
377 | }
378 |
379 | if (info.getCannotSelReason() == 0) {
380 | if (info.getScheduleClassInfo().getUnUsedCount() == 0) {
381 | info.setCannotSelReason(2);
382 | info.setCanSelect(false);
383 | }
384 | if (info.getScheduleClassInfo().getFreeSpace() <= 0) {//无可排位置
385 | info.setCannotSelReason(3);
386 | info.setCanSelect(false);
387 | }
388 | }
389 | }
390 | //如果此位置只有一门课可以选择
391 | if (this.scheduledLesson.get(this.generateKey(item.getKey(), itemItem.getKey(), itemItemItem.getKey(), itemItemItemItem.getKey())) == null) {
392 | this.setOnlyOneSubjectChoice(item.getKey(), itemItem.getKey(), itemItemItem.getKey(), itemItemItemItem.getKey());
393 | }
394 | }
395 | }
396 | }
397 | }
398 | }
399 |
400 | //减少科目可安排课节数
401 | private void reduceSelfCanUseCount(Integer grade, Integer classNo, Integer weekDay, Integer lesssonNo, String teacher, SchedulingProcessInfo schedulingProcessInfo) {
402 | for (ScheduleClassInfo subject : this.scheduleClassInfo.get(grade).get(classNo)) {
403 | //同老师,则减少可排位置数
404 | if (subject.getSubjectInfo().equals(schedulingProcessInfo.getScheduleClassInfo().getSubjectInfo())) {
405 | subject.setUnUsedCount(subject.getUnUsedCount() - 1);
406 | }
407 | }
408 | }
409 |
410 | //减少本班可排区间数
411 | private void reduceSelfFreeSpaceCount(Integer grade, Integer classNo, Integer weekDay, Integer lesssonNo, String teacher, SchedulingProcessInfo schedulingProcessInfo) {
412 | for (ScheduleClassInfo subject : this.scheduleClassInfo.get(grade).get(classNo)) {
413 | //同老师,则减少可排位置数
414 | if (subject.getCannotSetPosMap().get(this.generateKey(grade, classNo, weekDay, lesssonNo)) == null) {
415 | subject.setFreeSpace(subject.getFreeSpace() - 1);
416 | }
417 | }
418 | }
419 |
420 |
421 | //减少其他班可排区间数
422 | private void reduceFreeSpaceCount(Integer grade, Integer classNo, Integer weekDay, Integer lesssonNo, String teacher, SchedulingProcessInfo schedulingProcessInfo) {
423 | for (ScheduleClassInfo subject : this.scheduleClassInfo.get(grade).get(classNo)) {
424 | //同老师,则减少可排位置数
425 | if (teacher.equals(this.fetchTeacherByKemuAndLesson(grade, classNo, subject.getSubjectInfo().getSubjectName()))) {
426 | subject.setFreeSpace(subject.getFreeSpace() - 1);
427 | subject.getCannotSetPosMap().put(this.generateKey(grade, classNo, weekDay, lesssonNo),
428 | new SchedulePositionInfo(grade, classNo, weekDay, lesssonNo, null, null));
429 | }
430 | }
431 | }
432 |
433 | //设置只有一门可选的位置
434 | private void setOnlyOneSubjectChoice(Integer grade, Integer classNo, Integer weekDay, Integer lesssonNo) {
435 | Integer subjectCount = 0;
436 | SubjectInfo choice = null;
437 | for (SchedulingProcessInfo subject : this.scheduledInfo.get(grade).get(classNo).get(weekDay).get(lesssonNo)) {
438 | if (subject.getCannotSelReason() == 0) {
439 | choice = subject.getScheduleClassInfo().getSubjectInfo();
440 | subjectCount++;
441 | }
442 | }
443 | if (subjectCount > 1) {
444 | return;
445 | }
446 | for (SchedulePositionInfo item : this.onlyOneChoice) {
447 | if (item.getGrade().equals(grade) && item.getClassNo().equals(classNo) && item.getWeekDay().equals(weekDay) && item.getSeqNo().equals(lesssonNo)) {
448 | //无课可选,则从中移除
449 | if (subjectCount == 0) {
450 | this.onlyOneChoice.remove(item);
451 | }
452 | return;
453 | }
454 | }
455 | if (subjectCount == 1) {
456 | //检查是否已经在列表
457 | this.onlyOneChoice.add(new SchedulePositionInfo(grade, classNo, weekDay, lesssonNo, choice,
458 | this.fetchTeacherByKemuAndLesson(grade, classNo, choice.getSubjectName())));
459 | }
460 | }
461 |
462 | //老师课表
463 | private void recordTeacherSchedule(Integer grade, Integer classNo, Integer weekDay, Integer lesssonNo, String teacher, SchedulingProcessInfo schedulingProcessInfo) {
464 | this.teacherSchedule.get(teacher).get(weekDay).get(lesssonNo).setGrade(grade);
465 | this.teacherSchedule.get(teacher).get(weekDay).get(lesssonNo).setClassNo(classNo);
466 | this.teacherSchedule.get(teacher).get(weekDay).get(lesssonNo).setWeekDay(weekDay);
467 | this.teacherSchedule.get(teacher).get(weekDay).get(lesssonNo).setSeqNo(lesssonNo);
468 | this.teacherSchedule.get(teacher).get(weekDay).get(lesssonNo).setSubjectInfo(schedulingProcessInfo.getScheduleClassInfo().getSubjectInfo());
469 | }
470 |
471 | private void addScheduldPosition(Integer grade, Integer classNo, Integer weekDay, Integer lesssonNo) {
472 | this.scheduledLesson.put(this.generateKey(grade, classNo, weekDay, lesssonNo), 1);
473 | }
474 |
475 | //设置课程
476 | private void setScheduleTable(Integer grade, Integer classNo, Integer weekDay, Integer lesssonNo, SchedulingProcessInfo schedulingProcessInfo) {
477 | this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(lesssonNo).setGrade(grade);
478 | this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(lesssonNo).setClassNo(classNo);
479 | this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(lesssonNo).setWeekDay(weekDay);
480 | this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(lesssonNo).setSeqNo(lesssonNo);
481 | this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(lesssonNo).setSubjectInfo(schedulingProcessInfo.getScheduleClassInfo().getSubjectInfo());
482 | this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(lesssonNo).setTeacher(this.fetchTeacherByKemuAndLesson(grade, classNo,
483 | schedulingProcessInfo.getScheduleClassInfo().getSubjectInfo().getSubjectName()));
484 | }
485 |
486 | //设置课程 override
487 | private void setScheduleTable(Integer grade, Integer classNo, Integer weekDay, Integer lesssonNo, SchedulePositionInfo schedulePositionInfo) {
488 | this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(lesssonNo).setGrade(grade);
489 | this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(lesssonNo).setClassNo(classNo);
490 | this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(lesssonNo).setWeekDay(weekDay);
491 | this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(lesssonNo).setSeqNo(lesssonNo);
492 | this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(lesssonNo).setSubjectInfo(schedulePositionInfo.getSubjectInfo());
493 | this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(lesssonNo).setTeacher(schedulePositionInfo.getTeacher());
494 | }
495 |
496 | //根据权重选择一门课
497 | private SchedulingProcessInfo chooseOneSubject(List schedulingProcessInfos) {
498 | /*
499 | 1、选择最大的权重
500 | 2、获取最大的权重列表
501 | 3、从其中选择一门课
502 | */
503 | List canChooseSubjects = new ArrayList();
504 | for (SchedulingProcessInfo item : schedulingProcessInfos) {
505 | if (item.getWeights().equals(this.maxWeight)) {
506 | canChooseSubjects.add(item);
507 | }
508 | }
509 | return canChooseSubjects.get(this.fetchRandomInt(canChooseSubjects.size()));
510 | }
511 |
512 | //获取随机数
513 | private Integer fetchRandomInt(Integer maxValue) {
514 | Random r = new Random();
515 | return r.nextInt(maxValue);
516 | }
517 |
518 | //计算所有科目的权重
519 | private void calcWeights(Integer grade, Integer classNo, Integer weekDay, Integer lesssonNo, List schedulingProcessInfos) {
520 | this.maxWeight = 0;
521 | for (SchedulingProcessInfo item : schedulingProcessInfos) {
522 | Integer wPlus = this.calcWeight(grade, classNo, weekDay, lesssonNo, schedulingProcessInfos.size(), item);
523 | item.setWeights(item.getWeights() + wPlus);
524 | if (item.getWeights() > this.maxWeight) {
525 | this.maxWeight = item.getWeights();
526 | }
527 | }
528 | }
529 |
530 | //计算每个科目的权重
531 | private Integer calcWeight(Integer grade, Integer classNo, Integer weekDay, Integer lesssonNo, Integer subjectCount, SchedulingProcessInfo schedulingProcessInfo) {
532 | Integer result = 0;
533 | /*
534 | * 1、计算上下午主副课权重,课程位置、科目、上下午
535 | * 2、计算连堂权重 尚未安排的科目数、当前天数、已经安排的科目数
536 | * 3、计算平均分配规则权重 平均天课节 未安排的平均天课节
537 | * 4、计算可排位置比重权重 可排位置数量、阶梯权重
538 | * 5、计算从未安排过的科目权重 科目已经安排的数量
539 | * 6、计算老师平均安排权重 当天老师课节数、平均课节数
540 | * 7、计算自定义规则权重
541 | * */
542 | //第一节主课权重统一
543 | if (lesssonNo < 3) {
544 | if (schedulingProcessInfo.getScheduleClassInfo().getSubjectInfo().getAttributes() == 1) {
545 | result = WeightDefines.SUBJECT_FIRST_LESSON_WEIGHT_BASE;
546 | result+=this.mainSubjectAvgFirstLessson(grade, classNo, weekDay, lesssonNo, schedulingProcessInfo);
547 | }
548 | }else{
549 | result += this.amPmWeight(grade, lesssonNo, schedulingProcessInfo);//上下午权重
550 | result += this.avgWeekDayWeight(grade, classNo, weekDay, lesssonNo, schedulingProcessInfo);
551 | result += this.spacePlaceWeight(grade, classNo, weekDay, lesssonNo, subjectCount, schedulingProcessInfo);
552 | result += this.unFixedSubjectWeight(schedulingProcessInfo);
553 | result += this.nullSubjectWeight(grade, classNo, weekDay, lesssonNo, schedulingProcessInfo);
554 | }
555 | result += this.notSameSubjectWeight(grade, classNo, weekDay, lesssonNo, schedulingProcessInfo);
556 | result += this.lessonContinueWeight(grade, classNo, weekDay, lesssonNo, schedulingProcessInfo);
557 | if (result < 0 || result > 1000) result = 0;
558 | if (iWeightCalc != null) {
559 | Integer udfWeight = iWeightCalc.weightCalc(grade, classNo, weekDay, lesssonNo, schedulingProcessInfo.getScheduleClassInfo().getSubjectInfo().getSubjectName());
560 | result += udfWeight;
561 | }
562 | return result;
563 | }
564 |
565 | private Integer mainSubjectAvgFirstLessson(Integer grade, Integer classNo, Integer weekDay, Integer lesssonNo, SchedulingProcessInfo schedulingProcessInfo) {
566 | Integer result = 0;
567 | Integer firstLessonCount = 0;
568 | for (Integer w = 0; w < weekDay; w++) {
569 | if (this.scheduleInfos.get(grade).get(classNo).get(w).get(lesssonNo).getSubjectInfo().equals(schedulingProcessInfo.getScheduleClassInfo().getSubjectInfo())) {
570 | firstLessonCount++;
571 | }
572 | }
573 | result -= firstLessonCount * WeightDefines.SUBJECT_FIRST_LESSON_WEIGHT_MICRO;
574 | return result;
575 |
576 | }
577 |
578 | private Integer nullSubjectWeight(Integer grade, Integer classNo, Integer weekDay, Integer lesssonNo, SchedulingProcessInfo schedulingProcessInfo) {
579 | Integer result = 0;
580 | if (schedulingProcessInfo.getScheduleClassInfo().getSubjectInfo().getSubjectCode().equals("wk")) {
581 | if (lesssonNo == this.gradeInfoMap.get(grade).getNullPosition() - 1) {
582 | result += WeightDefines.SUBJECT_NULL_POSITION;
583 | } else {
584 | result -= WeightDefines.SUBJECT_NULL_OTHER;
585 | }
586 | }
587 | return result;
588 | }
589 |
590 | //同一天不安排同样的课
591 | private Integer notSameSubjectWeight(Integer grade, Integer classNo, Integer weekDay, Integer lesssonNo, SchedulingProcessInfo schedulingProcessInfo) {
592 | Integer result = 0;
593 | if (weekDay == 0) {
594 | return result;
595 | }
596 | if (this.scheduleInfos.get(grade).get(classNo).get(weekDay - 1).get(lesssonNo).getSubjectInfo() == null) {
597 | return 0;
598 | }
599 | if (lesssonNo == 0 || lesssonNo == this.gradeInfoMap.get(grade).getLessonAtAM()) {
600 | if (this.scheduleInfos.get(grade).get(classNo).get(weekDay - 1).get(lesssonNo).getSubjectInfo().equals(schedulingProcessInfo.getScheduleClassInfo().getSubjectInfo())) {
601 | result -= WeightDefines.SUBJECT_SEQNO_DIFF;
602 | }
603 | }
604 | return result;
605 | }
606 |
607 | //从未安排过的科目优先
608 | private Integer unFixedSubjectWeight(SchedulingProcessInfo schedulingProcessInfo) {
609 | Integer result = 0;
610 | if (schedulingProcessInfo.getScheduleClassInfo().getUnUsedCount() == schedulingProcessInfo.getScheduleClassInfo().getTotalCount()) {
611 | result += WeightDefines.SUBJECT_FIRST_FIXED;
612 | }
613 | return result;
614 | }
615 |
616 | //可排位置权重
617 | private Integer spacePlaceWeight(Integer grade, Integer classNo, Integer weekDay, Integer lesssonNo, Integer subjectCount, SchedulingProcessInfo schedulingProcessInfo) {
618 | Integer result = 0;
619 | Integer unFixedPlaceCount = this.classFreeSpace.get(grade).get(classNo).intValue();
620 | if (unFixedPlaceCount <= 0) {
621 | return result;
622 | }
623 | double freeSpaceRate = schedulingProcessInfo.getScheduleClassInfo().getFreeSpace() / unFixedPlaceCount;
624 | if (freeSpaceRate <= 0.8) {
625 | result += WeightDefines.SUBJECT_FREE_SPACE;
626 | }
627 | //剩余课程数大于平均课节数
628 | if (schedulingProcessInfo.getScheduleClassInfo().getUnUsedCount() > unFixedPlaceCount / 1.0 / this.gradeInfoMap.get(grade).getSubjectInfos().size()) {
629 | result += WeightDefines.SUBJECT_FREE_SPACE;
630 | }
631 | if (schedulingProcessInfo.getScheduleClassInfo().getUnUsedCount() > this.gradeInfoMap.get(grade).getDayPerWeek() - weekDay) {
632 | result += WeightDefines.SUBJECT_FREE_SPACE * 2;
633 | }
634 | return result;
635 | }
636 |
637 | //平均课节权重
638 | private Integer avgWeekDayWeight(Integer grade, Integer classNo, Integer weekDay, Integer lesssonNo, SchedulingProcessInfo schedulingProcessInfo) {
639 | //最后一天 此权重已经无意义
640 | if (weekDay + 1 == this.gradeInfoMap.get(grade).getDayPerWeek()) {
641 | return 0;
642 | }
643 | //无课科目
644 | if (schedulingProcessInfo.getScheduleClassInfo().getSubjectInfo() == null) {
645 | return 0;
646 | }
647 | Integer result = 0;
648 | //查看当天是否已经安排
649 | Integer cntDayLesson = 0;
650 | Integer cntFreeSpaceInDay = 0;
651 | for (Integer l = 0; l < this.gradeInfoMap.get(grade).getLessonPerDay(); l++) {
652 | if (this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(l).getSubjectInfo() == null) {
653 | // for (SchedulingProcessInfo info : this.scheduledInfo.get(grade).get(classNo).get(weekDay).get(l)) {
654 | // if (info.getScheduleClassInfo().getSubjectInfo().equals(schedulingProcessInfo.getScheduleClassInfo().getSubjectInfo())) {
655 | // if (info.getCannotSelReason() == 0) {
656 | // cntFreeSpaceInDay++;
657 | // }
658 | // }
659 | // }
660 | continue;
661 | }
662 | if (this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(l).getSubjectInfo().equals(schedulingProcessInfo.getScheduleClassInfo().getSubjectInfo())) {
663 | cntDayLesson++;
664 | }
665 | }
666 | double avgFixed = schedulingProcessInfo.getScheduleClassInfo().getTotalCount() / 1.0 / this.gradeInfoMap.get(grade).getDayPerWeek();
667 | //double avgUnFixed = (schedulingProcessInfo.getScheduleClassInfo().getUnUsedCount() - cntDayLesson) / 1.0 / (this.gradeInfoMap.get(grade).getDayPerWeek() - weekDay);
668 |
669 | //今天已安排节数和平均节数对比
670 | if (cntDayLesson < avgFixed) {
671 | result += WeightDefines.SUBJECT_PER_DAY;
672 | } else {
673 | result -= WeightDefines.SUBJECT_PER_DAY;
674 | }
675 | //todo
676 | //如果剩余的天数已经不够安排,即剩余课节除以剩余天数大于等于平均课节向上取整
677 |
678 | //if (cntFreeSpaceInDay <= 2)
679 | {
680 | if (schedulingProcessInfo.getScheduleClassInfo().getUnUsedCount() / 1.0 / (this.gradeInfoMap.get(grade).getDayPerWeek() - weekDay - 1) > Math.ceil(avgFixed)) {
681 | result += WeightDefines.SUBJECT_PER_DAY;
682 | }
683 | }
684 | return result;
685 | }
686 |
687 | private Integer lessonContinueWeight(Integer grade, Integer classNo, Integer weekDay, Integer lesssonNo, SchedulingProcessInfo schedulingProcessInfo) {
688 | /*
689 | 1、检查未安排的平均课节数
690 | 2、如果大于等于1,且上一节这一门课,则增加权重
691 | */
692 | Integer result = 0;
693 | if (lesssonNo == 0) {
694 | return result;
695 | }
696 | //计算当天本科目已排课节数,如果一排课节数大于等于平均课节数则不处理连堂规则
697 |
698 |
699 | double avgFixed = schedulingProcessInfo.getScheduleClassInfo().getTotalCount() / 1.0 / this.gradeInfoMap.get(grade).getDayPerWeek();
700 | if (avgFixed <= 1) {
701 | return result;
702 | }
703 | Integer cntDayLesson = 0;
704 | for (Integer l = 0; l < lesssonNo; l++) {
705 | if (this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(l).getSubjectInfo() == null) {
706 | return 0;
707 | }
708 | if (this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(l).getSubjectInfo().equals(schedulingProcessInfo.getScheduleClassInfo().getSubjectInfo())) {
709 | cntDayLesson++;
710 | }
711 | }
712 | if (cntDayLesson >= avgFixed) {
713 | return result;
714 | }
715 | double avgUnFix = schedulingProcessInfo.getScheduleClassInfo().getUnUsedCount() / 1.0 / (this.gradeInfoMap.get(grade).getDayPerWeek() - weekDay);
716 | if (avgUnFix >= 1) {
717 | //看上一节是否是这门课
718 | if (this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(lesssonNo - 1).getSubjectInfo().equals(schedulingProcessInfo.getScheduleClassInfo().getSubjectInfo())) {
719 | result += WeightDefines.SUBJECT_CONTINUE;
720 | }
721 | }
722 | return result;
723 | }
724 |
725 | //计算上下午主副课权重
726 | private Integer amPmWeight(Integer grade, Integer lesssonNo, SchedulingProcessInfo schedulingProcessInfo) {
727 | Integer result = 0;
728 | switch (schedulingProcessInfo.getScheduleClassInfo().getSubjectInfo().getAttributes()) {
729 | case 1:
730 | if (lesssonNo < this.gradeInfoMap.get(grade).getLessonAtAM()) {
731 | result += WeightDefines.SUBJECT_ATTRIBUTES;
732 | }
733 | break;
734 | case 2:
735 | case 3:
736 | if (lesssonNo >= this.gradeInfoMap.get(grade).getLessonAtAM()) {
737 | result += WeightDefines.SUBJECT_ATTRIBUTES;
738 | }
739 | break;
740 | }
741 | return result;
742 | }
743 |
744 | //获取可选科目列表
745 | private List fetchValidSubject(Integer grade, Integer classNo, Integer weekDay, Integer lesssonNo) {
746 | List result = new ArrayList();
747 | for (SchedulingProcessInfo si : this.scheduledInfo.get(grade).get(classNo).get(weekDay).get(lesssonNo)) {
748 | //检查老师是否在其他班任课
749 | if (si.getCannotSelReason() == 0) {
750 | //检查当天次节课已经上了的次数,如果次数大于平均数 则不拍此科目
751 | Integer cntDayLesson = 0;
752 | for (Integer idx = 0; idx < lesssonNo; idx++) {
753 | if (this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(idx).getSubjectInfo() != null) {
754 | if (this.scheduleInfos.get(grade).get(classNo).get(weekDay).get(idx).getSubjectInfo().equals(si.getScheduleClassInfo().getSubjectInfo())) {
755 | cntDayLesson++;
756 | }
757 | }
758 | }
759 |
760 | if (cntDayLesson / 1.0 >= si.getScheduleClassInfo().getTotalCount() / 1.0 / this.gradeInfoMap.get(grade).getDayPerWeek()) {
761 | continue;
762 | }
763 | result.add(si);
764 | }
765 | }
766 | return result;
767 | }
768 |
769 | private List mergeValidSubject(List s1, List s2) {
770 | for (SchedulingProcessInfo item : s1) {
771 | for (String kk : s2) {
772 | if (item.getScheduleClassInfo().getSubjectInfo().equals(kk)) {
773 | s1.remove(item);
774 | }
775 | }
776 | }
777 | return s1;
778 | }
779 |
780 | private String fetchTeacherByKemuAndLesson(Integer grade, Integer classNo, String subject) {
781 | for (Map.Entry item : this.gradeInfoMap.get(grade).getClassInfos().get(classNo).getSubjectTeachers().entrySet()) {
782 | if (item.getKey().getSubjectName().equals(subject)) {
783 | return item.getValue();
784 | }
785 | }
786 | return null;
787 | }
788 |
789 | //生成位置唯一key,为方便搜索
790 | private Integer generateKey(Integer grade, Integer classs, Integer weekDay, Integer lessonNo) {
791 | return (int) ((grade + 1) * Math.pow(10, 6) + (classs + 1) * Math.pow(10, 4) + (weekDay + 1) * Math.pow(10, 2) + lessonNo + 1);
792 | }
793 |
794 | //检查gradeInfo的信息
795 | private boolean checkInputGradeInfo(Map gradeInfo) {
796 | if (gradeInfo.size() <= 0) {
797 | return false;
798 | }
799 | for (Map.Entry item : gradeInfo.entrySet()) {
800 | this.gradeCount++;
801 | this.classCount += item.getValue().getClassCount();
802 | if (item.getValue().getDayPerWeek() > this.maxDayPerWeek) {
803 | this.maxDayPerWeek = item.getValue().getDayPerWeek();
804 | }
805 | if (item.getValue().getLessonPerDay() > this.maxLessonPerDay) {
806 | this.maxLessonPerDay = item.getValue().getLessonPerDay();
807 | }
808 | }
809 | return true;
810 | }
811 |
812 | //检查课程是否可以排满
813 | private boolean processNullPos(Map gradeInfo) {
814 | if (gradeInfo.size() <= 0) {
815 | return false;
816 | }
817 |
818 | for (Map.Entry item : gradeInfo.entrySet()) {
819 | Integer TotalCount = 0;
820 | for (SubjectInfo info : item.getValue().getSubjectInfos()) {
821 | TotalCount += info.getSubjectCount();
822 | }
823 | SubjectInfo si = new SubjectInfo("wk", "无课", 4,
824 | item.getValue().getDayPerWeek() * item.getValue().getLessonPerDay() - TotalCount);
825 | if (TotalCount < item.getValue().getDayPerWeek() * item.getValue().getLessonPerDay()) {
826 | item.getValue().getSubjectInfos().add(si);//添加科目名为无课的科目
827 | }
828 | //为无课科目添加老师,无课科目所有老师不同,规则为 “wk01010101”
829 | for (Map.Entry entry : item.getValue().getClassInfos().entrySet()) {
830 | entry.getValue().getSubjectTeachers().put(si, si.getSubjectCode() + item.getKey().toString() + entry.getKey());
831 | }
832 | }
833 | return true;
834 | }
835 |
836 | //获取老师列表
837 | private boolean initTeacherList(Map gradeInfo) {
838 | this.teacherList = new ArrayList();
839 | for (Map.Entry item : gradeInfo.entrySet()) {
840 | if (item.getValue().getClassInfos().size() <= 0) {
841 | return false;
842 | }
843 | for (Map.Entry cc : item.getValue().getClassInfos().entrySet()) {
844 | if (cc.getValue().getSubjectTeachers().size() <= 0) {
845 | return false;
846 | }
847 | for (Map.Entry ss : cc.getValue().getSubjectTeachers().entrySet()) {
848 | if (!this.teacherList.contains(ss.getValue())) {
849 | this.teacherList.add(ss.getValue());
850 | }
851 | }
852 | }
853 | }
854 | return true;
855 | }
856 |
857 | //初始化老师课程安排信息
858 | private boolean initTeacherLesson() {
859 | teacherSchedule = new HashMap>>();
860 | //先遍历老师
861 | for (String teacher : this.teacherList) {
862 | Map> item = new HashMap>();
863 | for (Integer weekDay = 0; weekDay < this.maxDayPerWeek; weekDay++) {
864 | Map itemItem = new HashMap();
865 | for (Integer lessonNo = 0; lessonNo < this.maxLessonPerDay; lessonNo++) {
866 | SchedulePositionInfo itemItemItem = new SchedulePositionInfo(0, 0, weekDay, lessonNo, null, teacher);
867 | itemItem.put(lessonNo, itemItemItem);
868 | }
869 | item.put(weekDay, itemItem);
870 | }
871 | this.teacherSchedule.put(teacher, item);
872 | }
873 | return true;
874 | }
875 |
876 |
877 | //初始化课表信息
878 | private boolean initLessonTableInfo(Map gradeInfo) {
879 | this.scheduleInfos = new HashMap>>>();
880 | this.classFreeSpace = new HashMap>();
881 | for (Map.Entry item : gradeInfo.entrySet()) {
882 | Map>> grade = new HashMap>>();
883 | Map classFS = new HashMap();
884 | for (Map.Entry itemItem : item.getValue().getClassInfos().entrySet()) {
885 | Map> classs = new HashMap>();
886 | classFS.put(itemItem.getKey(), item.getValue().getDayPerWeek() * item.getValue().getLessonPerDay());
887 | for (Integer weekDay = 0; weekDay < item.getValue().getDayPerWeek(); weekDay++) {
888 | Map weekLesson = new HashMap();
889 | for (Integer lessonNo = 0; lessonNo < item.getValue().getLessonPerDay(); lessonNo++) {
890 | SchedulePositionInfo schedulePositionInfo = new SchedulePositionInfo(item.getKey(), itemItem.getKey(), weekDay, lessonNo, null, null);
891 | weekLesson.put(lessonNo, schedulePositionInfo);
892 | }
893 | classs.put(weekDay, weekLesson);
894 | }
895 | grade.put(itemItem.getKey(), classs);
896 | }
897 | this.classFreeSpace.put(item.getKey(), classFS);
898 | this.scheduleInfos.put(item.getKey(), grade);
899 | }
900 | return true;
901 | }
902 |
903 | //初始化排课中间过程数据
904 | private boolean initScheduldInfo(Map gradeInfo) {
905 | this.scheduledInfo = new HashMap>>>>();
906 | this.scheduleClassInfo = new HashMap>>();
907 | for (Map.Entry item : gradeInfo.entrySet()) {
908 | Map>>> grade = new HashMap>>>();//课节信息
909 | Map> gradeClass = new HashMap>();//班级信息
910 | for (Map.Entry itemItem : item.getValue().getClassInfos().entrySet()) {
911 | Map>> classs = new HashMap>>();//课节信息
912 | List classInfo = new ArrayList();//班级信息
913 | Integer idx = 0;
914 | for (Map.Entry subject : itemItem.getValue().getSubjectTeachers().entrySet()) {
915 | Map positionInfoMap = new HashMap();
916 | ScheduleClassInfo classSubject = new ScheduleClassInfo(subject.getKey(), subject.getKey().getSubjectCount(), subject.getKey().getSubjectCount(),
917 | item.getValue().getDayPerWeek() * item.getValue().getLessonPerDay(), positionInfoMap);//班级科目列表
918 | classInfo.add(idx, classSubject);
919 | idx++;
920 | }
921 | gradeClass.put(itemItem.getKey(), classInfo);
922 | for (Integer weekDay = 0; weekDay < item.getValue().getDayPerWeek(); weekDay++) {
923 | Map> weekLesson = new HashMap>();
924 | for (Integer lessonNo = 0; lessonNo < item.getValue().getLessonPerDay(); lessonNo++) {
925 | List schedulingProcessInfos = new ArrayList();
926 | Integer idx1 = 0;
927 | for (Map.Entry subject : itemItem.getValue().getSubjectTeachers().entrySet()) {
928 | SchedulingProcessInfo schedulingProcessInfo = new SchedulingProcessInfo(classInfo.get(idx1), WeightDefines.WEIGHT_BASE, true, 0);
929 | schedulingProcessInfos.add(schedulingProcessInfo);
930 | idx1++;
931 | }
932 | weekLesson.put(lessonNo, schedulingProcessInfos);
933 | }
934 | classs.put(weekDay, weekLesson);
935 | }
936 | grade.put(itemItem.getKey(), classs);
937 | }
938 | this.scheduledInfo.put(item.getKey(), grade);
939 | this.scheduleClassInfo.put(item.getKey(), gradeClass);
940 | }
941 | return true;
942 | }
943 | }
944 |
--------------------------------------------------------------------------------
/src/main/java/org/aorise/lessonschedule/classSchedule/Model/ClassInfo.java:
--------------------------------------------------------------------------------
1 | package org.aorise.lessonschedule.classSchedule.Model;
2 |
3 | import lombok.Data;
4 |
5 | import java.util.Map;
6 |
7 | /**
8 | * Created by xiaoyao on 2018/9/17.
9 | */
10 | @Data
11 | public class ClassInfo {
12 | private String className;//班级名称
13 | private Map subjectTeachers;//班级任课信息
14 | }
15 |
--------------------------------------------------------------------------------
/src/main/java/org/aorise/lessonschedule/classSchedule/Model/GradeInfo.java:
--------------------------------------------------------------------------------
1 | package org.aorise.lessonschedule.classSchedule.Model;
2 |
3 | import lombok.Data;
4 | import org.omg.CORBA.INTERNAL;
5 |
6 | import java.util.List;
7 | import java.util.Map;
8 |
9 | /**
10 | * Created by xiaoyao on 2018/9/17.
11 | */
12 | @Data
13 | public class GradeInfo {
14 | private Integer grade;//年级
15 | private String gradeName;//年级描述名称
16 | private Integer classCount;//班级数
17 | private Integer dayPerWeek;//每周几天课
18 | private Integer lessonPerDay;//每天几节课
19 | private Integer lessonAtAM;//上午课节
20 | private Integer lessonAtPM;//下午课节
21 | private Integer nullPosition;//无课优先安排的课节,默认每天最后一节
22 | private List subjectInfos;//年级开设科目列表
23 | private Map classInfos;//班级信息,以及班级任课信息
24 |
25 | public GradeInfo(Integer g, String gn, Integer c, Integer d, Integer l,Integer lam,Integer lpm,Integer np) {
26 | this.grade = d;
27 | this.gradeName = gn;
28 | this.classCount = c;
29 | this.dayPerWeek = d;
30 | this.lessonPerDay = l;
31 | this.lessonAtAM=lam;
32 | this.lessonAtPM=lpm;
33 | if(np<1){
34 | this.nullPosition=l;
35 | }else{
36 | this.nullPosition=np;
37 | }
38 |
39 | }
40 | }
41 |
--------------------------------------------------------------------------------
/src/main/java/org/aorise/lessonschedule/classSchedule/Model/ScheduleClassInfo.java:
--------------------------------------------------------------------------------
1 | package org.aorise.lessonschedule.classSchedule.Model;
2 |
3 | import lombok.Data;
4 |
5 | import java.util.List;
6 | import java.util.Map;
7 |
8 | @Data
9 | public class ScheduleClassInfo {
10 | private SubjectInfo subjectInfo;//科目
11 | private Integer totalCount;//总课节数
12 | private Integer unUsedCount;//未排课节数
13 | private Integer freeSpace;//可排位置数
14 | private Map cannotSetPosMap;//本门课不能安排位置的列表
15 |
16 | public ScheduleClassInfo(SubjectInfo si,Integer tc,Integer uuc,Integer fs,Map csp){
17 | this.subjectInfo=si;
18 | this.totalCount=tc;
19 | this.unUsedCount=uuc;
20 | this.freeSpace=fs;
21 | this.cannotSetPosMap=csp;
22 | }
23 | }
24 |
--------------------------------------------------------------------------------
/src/main/java/org/aorise/lessonschedule/classSchedule/Model/ScheduleInfo.java:
--------------------------------------------------------------------------------
1 | package org.aorise.lessonschedule.classSchedule.Model;
2 |
3 | import lombok.Data;
4 |
5 | import java.util.List;
6 | import java.util.Map;
7 |
8 | /**
9 | * Created by xiaoyao on 2018/9/17.
10 | */
11 | @Data
12 | public class ScheduleInfo {
13 | private SubjectInfo subjectInfo;//安排的科目
14 | private String teacher;//任教老师
15 | private Map validSubjects;
16 | }
17 |
--------------------------------------------------------------------------------
/src/main/java/org/aorise/lessonschedule/classSchedule/Model/SchedulePositionInfo.java:
--------------------------------------------------------------------------------
1 | package org.aorise.lessonschedule.classSchedule.Model;
2 |
3 | import lombok.Data;
4 |
5 | /**
6 | * Created by xiaoyao on 2018/9/17.
7 | */
8 | @Data
9 | public class SchedulePositionInfo {
10 | private Integer grade;
11 | private Integer classNo;
12 | private Integer weekDay;
13 | private Integer seqNo;
14 | private SubjectInfo subjectInfo;//科目
15 | private String teacher;//老师
16 |
17 | public SchedulePositionInfo(Integer g, Integer cn, Integer wd, Integer sn, SubjectInfo si,String t){
18 | this.grade=g;
19 | this.classNo=cn;
20 | this.weekDay=wd;
21 | this.seqNo=sn;
22 | this.subjectInfo=si;
23 | this.teacher=t;
24 | }
25 |
26 | public SchedulePositionInfo(SchedulePositionInfo s){
27 | this.grade=s.getGrade();
28 | this.classNo=s.getClassNo();
29 | this.weekDay=s.getWeekDay();
30 | this.seqNo=s.getSeqNo();
31 | this.subjectInfo=s.getSubjectInfo();
32 | this.teacher=s.getTeacher();
33 | }
34 | }
35 |
--------------------------------------------------------------------------------
/src/main/java/org/aorise/lessonschedule/classSchedule/Model/SchedulingProcessInfo.java:
--------------------------------------------------------------------------------
1 | package org.aorise.lessonschedule.classSchedule.Model;
2 |
3 | import lombok.Data;
4 |
5 | /**
6 | * Created by xiaoyao on 2018/9/17.
7 | */
8 | @Data
9 | public class SchedulingProcessInfo {
10 | private ScheduleClassInfo scheduleClassInfo;//班级排课情况
11 | private Integer weights=100;//权重
12 | private boolean isCanSelect=true;
13 | private Integer cannotSelReason;//0:都可以选;1:因同一老师在其他班上课 2,本科目已经排完 3:没有位置可排:4:外部设置不可排
14 | private SchedulePositionInfo positionInfo;//老师冲突记录
15 |
16 | public SchedulingProcessInfo(ScheduleClassInfo s,Integer ws,boolean b,Integer csr){
17 | this.scheduleClassInfo=s;
18 | this.weights=ws;
19 | this.isCanSelect=b;
20 | this.cannotSelReason=csr;
21 | }
22 | }
23 |
--------------------------------------------------------------------------------
/src/main/java/org/aorise/lessonschedule/classSchedule/Model/SubjectInfo.java:
--------------------------------------------------------------------------------
1 | package org.aorise.lessonschedule.classSchedule.Model;
2 |
3 | import lombok.Data;
4 |
5 | /**
6 | * Created by xiaoyao on 2018/9/17.
7 | */
8 | @Data
9 | public class SubjectInfo {
10 | private String subjectCode;//课程代号
11 | private String subjectName;//课程名称
12 | private Integer attributes;//主副科
13 | private Integer subjectCount;//课程节数
14 |
15 | public SubjectInfo(String sc,String sn,Integer a,Integer s){
16 | this.subjectCode=sc;
17 | this.subjectName=sn;
18 | this.attributes=a;
19 | this.subjectCount=s;
20 | }
21 | }
22 |
--------------------------------------------------------------------------------
/src/main/java/org/aorise/lessonschedule/classSchedule/Model/WeightDefines.java:
--------------------------------------------------------------------------------
1 | package org.aorise.lessonschedule.classSchedule.Model;
2 |
3 | import java.util.LinkedHashMap;
4 | import java.util.Map;
5 |
6 | /**
7 | * Created by xiaoyao on 2018/9/17.
8 | */
9 | public class WeightDefines {
10 | public static Integer WEIGHT_BASE = 100;//基础权重
11 | public static Integer SUBJECT_ATTRIBUTES = 5;//主副科权重
12 | public static Integer SUBJECT_FIRST_LESSON_WEIGHT_BASE=15;//第一节课主课优先级更高
13 | public static Integer SUBJECT_FIRST_LESSON_WEIGHT_MICRO=1;//第一节课主课优先级更高,第一节主课平均安排
14 | public static Integer SUBJECT_FREE_SPACE = 1;//可排课节数阶梯权重
15 | public static Integer SUBJECT_SEQNO_DIFF = 3;//同日上下午第一节课程尽量不同,
16 | public static Integer SUBJECT_CONTINUE = 30;//连堂绝对优先
17 | public static Integer SUBJECT_PER_DAY = 3;//平均天课节阶梯权重
18 | public static Integer SUBJECT_FIRST_FIXED = 2;//从未安排过的科目优先
19 |
20 | public static Integer SUBJECT_NULL_POSITION = 80;//无课位置优先安排权重
21 | public static Integer SUBJECT_NULL_OTHER = 100;//其他位置不安排权重
22 |
23 | }
24 |
--------------------------------------------------------------------------------
/src/main/java/org/aorise/lessonschedule/classSchedule/Service/ISubjectChoose.java:
--------------------------------------------------------------------------------
1 | package org.aorise.lessonschedule.classSchedule.Service;
2 |
3 | import java.util.List;
4 |
5 | public interface ISubjectChoose {
6 | public List unSelectSubject(Integer grade,Integer classNo,Integer weekDay,Integer lesssonNo);
7 | }
8 |
--------------------------------------------------------------------------------
/src/main/java/org/aorise/lessonschedule/classSchedule/Service/IWeightCalc.java:
--------------------------------------------------------------------------------
1 | package org.aorise.lessonschedule.classSchedule.Service;
2 |
3 | public interface IWeightCalc {
4 | public Integer weightCalc(Integer grade,Integer classNo,Integer weekDay,Integer lesssonNo,String subject);
5 | }
6 |
--------------------------------------------------------------------------------
/src/main/resources/application.properties:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/xaioyao/lessonschedule/2aa1cfff918cc416114f114ef78d83772bf02812/src/main/resources/application.properties
--------------------------------------------------------------------------------
/src/test/java/org/aorise/lessonschedule/LessonscheduleApplicationTests.java:
--------------------------------------------------------------------------------
1 | package org.aorise.lessonschedule;
2 |
3 | import org.junit.Test;
4 | import org.junit.runner.RunWith;
5 | import org.springframework.boot.test.context.SpringBootTest;
6 | import org.springframework.test.context.junit4.SpringRunner;
7 |
8 | @RunWith(SpringRunner.class)
9 | @SpringBootTest
10 | public class LessonscheduleApplicationTests {
11 |
12 | @Test
13 | public void contextLoads() {
14 | }
15 |
16 | }
17 |
--------------------------------------------------------------------------------