├── .gitignore ├── COPYING ├── README.md ├── api.py ├── openrailwaymap_api ├── __init__.py ├── abstract_api.py ├── facility_api.py └── milestone_api.py ├── prepare_facilities.sql ├── prepare_milestones.sql ├── tests ├── testcases.yml └── tests.py ├── update_facilities.sql └── update_milestones.sql /.gitignore: -------------------------------------------------------------------------------- 1 | .*.swp 2 | __pycache__/ 3 | *.pyc 4 | -------------------------------------------------------------------------------- /COPYING: -------------------------------------------------------------------------------- 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 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | **This is experimental code. It is not ready for production yet.** 2 | 3 | # OpenRailwayMap API 4 | 5 | This is a reimplementation of the OpenRailwayMap API in Python with performance as main development goal. 6 | Its public REST API is not exactly the same as the old PHP implementation but it should do the job good enough 7 | it serves to the website www.openrailwaymap.org. 8 | 9 | ## Features 10 | 11 | * Facility search 12 | * Search facilities (stations, halts, tram stops, yards, sidings, crossovers) including disused, abandoned, 13 | razed and proposed ones and those under construction by name or reference. 14 | * Fulltext search using PostgreSQL's full text search. 15 | * Fast (< 100 ms per request) 16 | * Mileage search: Search the combination of line number and mileage. 17 | 18 | ## Delevopment goals 19 | 20 | The code of this application should be easy to read and it should be fast. We avoid unnecessary overhead 21 | and aim to make as much use as possible of indexes in the database. 22 | 23 | ## API 24 | 25 | ### Facilities 26 | 27 | URL: `/facility?` 28 | 29 | The facility endpoint returns detail of a facility (station, junction, yard, …) by its name, UIC reference or reference. 30 | 31 | The request must contain exactly one of the following parameters because they are mutually exclusive: 32 | 33 | * `q=`: search term (will be looked up in all `name=*` tags, `railway:ref=*` and `uic_ref=*`). 34 | * `name=`: search term (name search only) 35 | * `ref=`: serach by official facility reference number/code only 36 | * `uic_ref=`: search by UIC reference number of a station (uses OSM tag `uic_ref=*`) 37 | 38 | Optional parameter: 39 | 40 | * `limit=`: maximum number of results, optional, defaults to 20, must not exceed 200 41 | 42 | It takes the first keyword of (name,uicref,ref) and the optional the operator to search for the data. 43 | 44 | The API returns JSON formatted data with following fields: 45 | 46 | * `latitude`: latitude 47 | * `longitude`: longitude 48 | * `osm_id`: OSM node ID 49 | * `rank`: an importance rank calculated by taking the public transport route relations into account using this station/halt 50 | * All OSM tags present on this object. The following tags are very often in use. See the OSM wiki and Taginfo for a more comprehensive list of possible tags. 51 | * `name`: name 52 | * `uic_name`: UIC station name 53 | * `railway:ref`: reference assigned by the operator of the infrastructure 54 | * `railway`: type of the facility following [Tagging rules](https://wiki.openstreetmap.org/wiki/OpenRailwayMap/Tagging#Operating_Sites)), e.g. `station`, `halt`, `junction`, `yard`. 55 | * `operator`: operator of the infrastructure 56 | 57 | Example: 58 | 59 | Request: `GET https://api.openrailwaymap.org/v2/facility?name=Karlsruhe&limit=1` 60 | 61 | Response: 62 | 63 | ```json 64 | [ 65 | { 66 | "osm_id": 2574283615, 67 | "name": "Karlsruhe Hauptbahnhof", 68 | "railway": "station", 69 | "ref": null, 70 | "iata": "KJR", 71 | "uic_ref": "8000191", 72 | "website": "https://www.bahnhof.de/bahnhof-de/bahnhof/Karlsruhe-Hbf-1019530", 73 | "operator": "DB Station&Service AG", 74 | "wikidata": "Q688541", 75 | "iata:note": "AIRail Flughafen", 76 | "max_level": "1", 77 | "min_level": "-1", 78 | "platforms": "7", 79 | "ref:IFOPT": "de:08212:90", 80 | "wikipedia": "de:Karlsruhe Hauptbahnhof", 81 | "short_name": "Karlsruhe Hbf", 82 | "wheelchair": "yes", 83 | "railway:ref": "RK", 84 | "ref:station": "3107", 85 | "internet_access": "wlan", 86 | "public_transport": "station", 87 | "internet_access:fee": "no", 88 | "internet_access:ssid": "Telekom", 89 | "internet_access:operator": "Deutsche Telekom AG", 90 | "railway:station_category": "1", 91 | "internet_access:fee:description": "30min kostenlos", 92 | "latitude": 8.4020518, 93 | "longitude": 48.9936163996939, 94 | "rank": 176 95 | } 96 | ] 97 | ``` 98 | 99 | ### Milestones 100 | 101 | The milestone endpoint returns the position of milestones or other items such as signals or level crossings with a mapped position on a line. 102 | 103 | The API will return the features within a maximum distance of 10 km (hardcoded). The presence of an `operator=*` tag on the tracks is honoured, it will be used to 104 | distinguish reference numbers used by different infrastructure operators and/or in different countries. 105 | 106 | Mileage is read from the OSM tags `railway:position=*` and `railway:position:exact=*` with precedence of the exact mileage. The tracks must be tagged with a reference number (OSM tag `ref=*`). 107 | 108 | The tracks must not tagged with `service=*` (this condition does not apply to tracks with `usage=industrial/military/test`). 109 | 110 | Negative mileage is supported but gaps in mileage or duplicated positions (if railway lines are reroute) are not supported. For example, you cannot query for `16.8+200` or things like that. 111 | 112 | URL: `/milestone?` 113 | 114 | Mandatory parameters: 115 | 116 | * `ref=`: reference number of the railway route the mileage refers to (in this case, route meas lines as infrastructure, not the services using the tracks), mandatory 117 | * `position=`: position (can be negative), mandatory 118 | 119 | Optional parameter: 120 | 121 | * `limit=`: maximum number of results, optional, defaults to 2, must not exceed 200 122 | 123 | The API returns JSON formatted data with following fields: 124 | 125 | * `osm_id`: OSM node ID 126 | * `latitude`: latitude 127 | * `longitude`: longitude 128 | * `position`: Mileage of the feature 129 | * `railway`: type of the facility following [Tagging rules](https://wiki.openstreetmap.org/wiki/OpenRailwayMap/Tagging#Operating_Sites)), e.g. `milestone`, `level_crossing`, `signal`. 130 | * `ref`: Reference number of the railway line the feature is located on. 131 | * `operator`: operator of the infrastructure 132 | 133 | Example: 134 | 135 | Request: `GET https://api.openrailwaymap.org/v2/milestone?ref=4201&position=18.4` 136 | 137 | Response: 138 | 139 | ```json 140 | [ 141 | { 142 | "osm_id": 3479484133, 143 | "railway": "milestone", 144 | "position": 18.405, 145 | "latitude": 8.7064769, 146 | "longitude": 49.0315238996845, 147 | "ref": "4201", 148 | "operator": "Albtal-Verkehrs-Gesellschaft mbH" 149 | }, 150 | { 151 | "osm_id": 3479484134, 152 | "railway": "milestone", 153 | "position": 18.2, 154 | "latitude": 8.7045853, 155 | "longitude": 49.0327703996842, 156 | "ref": "4201", 157 | "operator": "Albtal-Verkehrs-Gesellschaft mbH" 158 | } 159 | ] 160 | ``` 161 | 162 | ### Network length 163 | 164 | The previous (v1) version of the API provided a `/networklength` entpoint. It returned the length of the railway networks of the infrastructure operators. 165 | Calls to the endpoint cause long database queries. The endpoint was not used in the frontend. Therefore, this endpoint is not available in version 2. 166 | 167 | ## Setup 168 | 169 | ### Dependencies and Deployment 170 | 171 | This API runs as a Python WSGI application. You need a WSGI server and a web server. For development 172 | purposes, you can just run `python3 api.py serve`. 173 | 174 | Dependencies: 175 | 176 | * Python 3 177 | * [Werkzeug](https://werkzeug.palletsprojects.com/) 178 | * [Psycopg2](https://www.psycopg.org/docs/) 179 | 180 | ### Installation 181 | 182 | Install the dependencies listed above: 183 | 184 | ```shell 185 | apt install python3-werkzeug python3-psycopg2 186 | ``` 187 | 188 | If you want to deploy it on a server (not just run in development mode locally): 189 | 190 | ```shell 191 | apt install apache2 libapache2-mod-wsgi-py3 192 | ``` 193 | 194 | Import OpenStreetMap data as described in the map style setup guide. You have to follow the following sections only: 195 | 196 | * Dependencies (Kosmtik, Nik4 and PyYAML are not required) 197 | * Database Setup 198 | * Load OSM Data into the Database 199 | 200 | Create database views: 201 | 202 | ```shell 203 | sudo -u osmimport psql -d gis -f prepare_facilities.sql 204 | sudo -u osmimport psql -d gis -f prepare_milestone.sql 205 | 206 | Create a database user for the user running the API (either the user running Apache – often called www-data or httpd – or your user account in dev mode) and grant read permissions to this user: 207 | 208 | ```shell 209 | createuser $USERNAME 210 | sudo -u postgres psql -d gis -c "GRANT SELECT ON TABLES IN SCHEMA PUBLIC TO $USERNAME;" 211 | ``` 212 | 213 | ### Database updates 214 | 215 | If you apply OSM diff updates to the database, do not forget to run the `update_*.sql` scripts afterwards to refresh the materialized views: 216 | 217 | ```shell 218 | sudo -u osmimport psql -d gis -f update_facilities.sql 219 | sudo -u osmimport psql -d gis -f update_milestone.sql 220 | ``` 221 | 222 | ## License 223 | 224 | This project is licensed under the terms of GPLv2 or newer. You can find a copy of version 3 of the license in the [COPYING](COPYING) file. 225 | -------------------------------------------------------------------------------- /api.py: -------------------------------------------------------------------------------- 1 | #! /usr/bin/env python3 2 | # SPDX-License-Identifier: GPL-2.0-or-later 3 | 4 | import psycopg2 5 | import psycopg2.extras 6 | import json 7 | import sys 8 | from werkzeug.exceptions import HTTPException, NotFound, InternalServerError 9 | from werkzeug.routing import Map, Rule 10 | from werkzeug.wrappers import Request, Response 11 | from openrailwaymap_api.facility_api import FacilityAPI 12 | from openrailwaymap_api.milestone_api import MilestoneAPI 13 | 14 | def connect_db(): 15 | conn = psycopg2.connect('dbname=gis') 16 | psycopg2.extras.register_hstore(conn) 17 | return conn 18 | 19 | class OpenRailwayMapAPI: 20 | 21 | db_conn = connect_db() 22 | 23 | def __init__(self): 24 | self.url_map = Map([ 25 | Rule('/facility', endpoint=FacilityAPI, methods=('GET',)), 26 | Rule('/milestone', endpoint=MilestoneAPI, methods=('GET',)), 27 | ]) 28 | 29 | def ensure_db_connection_alive(self): 30 | if self.db_conn.closed != 0: 31 | self.db_conn = connect_db() 32 | 33 | def dispatch_request(self, environ, start_response): 34 | request = Request(environ) 35 | urls = self.url_map.bind_to_environ(environ) 36 | response = None 37 | try: 38 | endpoint, args = urls.match() 39 | self.ensure_db_connection_alive() 40 | response = endpoint(self.db_conn)(request.args) 41 | except HTTPException as e: 42 | return e 43 | except Exception as e: 44 | return InternalServerError() 45 | finally: 46 | if not response: 47 | self.db_conn.close() 48 | self.db_conn = connect_db() 49 | return response 50 | 51 | def wsgi_app(self, environ, start_response): 52 | request = Request(environ) 53 | response = self.dispatch_request(request) 54 | return response(environ, start_response) 55 | 56 | 57 | def application(environ, start_response): 58 | openrailwaymap_api = OpenRailwayMapAPI() 59 | response = openrailwaymap_api.dispatch_request(environ, start_response) 60 | return response(environ, start_response) 61 | 62 | 63 | if __name__ == '__main__': 64 | openrailwaymap_api = OpenRailwayMapAPI() 65 | if len(sys.argv) == 2 and sys.argv[1] == 'serve': 66 | from werkzeug.serving import run_simple 67 | run_simple('127.0.0.1', 5000, application, use_debugger=True, use_reloader=True) 68 | else: 69 | sys.stderr.write('ERROR: Missing argument \'serve\'. Cannot start in standalone development mode this way.\n') 70 | exit(1) 71 | -------------------------------------------------------------------------------- /openrailwaymap_api/__init__.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/OpenRailwayMap/OpenRailwayMap-api/6f8177de48a385b1f1a721f64aa6f6bed1fca59d/openrailwaymap_api/__init__.py -------------------------------------------------------------------------------- /openrailwaymap_api/abstract_api.py: -------------------------------------------------------------------------------- 1 | import json 2 | from werkzeug.wrappers import Response 3 | 4 | 5 | class AbstractAPI: 6 | '''Methods used by multiple parts of the OpenRailwayMap API''' 7 | 8 | MAX_LIMIT = 200 9 | 10 | def build_response(self): 11 | return Response(json.dumps(self.data), status=self.status_code, mimetype='application/json', headers=[('Access-Control-Allow-Origin', '*')]) 12 | 13 | def build_result_item_dict(self, description, row): 14 | item = {} 15 | for i in range(len(row)): 16 | if description[i].name == 'tags' and row[i]: 17 | for k, v in row[i].items(): 18 | item[k] = v 19 | else: 20 | item[description[i].name] = row[i] 21 | return item 22 | -------------------------------------------------------------------------------- /openrailwaymap_api/facility_api.py: -------------------------------------------------------------------------------- 1 | # SPDX-License-Identifier: GPL-2.0-or-later 2 | from openrailwaymap_api.abstract_api import AbstractAPI 3 | 4 | class FacilityAPI(AbstractAPI): 5 | def __init__(self, db_conn): 6 | self.db_conn = db_conn 7 | self.search_args = ['q', 'name', 'ref', 'uic_ref'] 8 | self.data = [] 9 | self.status_code = 200 10 | self.limit = 20 11 | 12 | def eliminate_duplicates(self, data): 13 | data.sort(key=lambda k: k['osm_id']) 14 | i = 1 15 | while i < len(data): 16 | if data[i]['osm_id'] == data[i-1]['osm_id']: 17 | data.pop(i) 18 | i += 1 19 | if len(data) > self.limit: 20 | return data[:self.limit] 21 | return data 22 | 23 | def __call__(self, args): 24 | data = [] 25 | # Validate search arguments 26 | search_args_count = 0 27 | for search_arg in self.search_args: 28 | if search_arg in args and args[search_arg]: 29 | search_args_count += 1 30 | if search_args_count > 1: 31 | self.data = {'type': 'multiple_query_args', 'error': 'More than one argument with a search term provided.', 'detail': 'Provide only one of the following arguments: {}'.format(', '.join(self.search_args))} 32 | self.status_code = 400 33 | return self.build_response() 34 | elif search_args_count == 0: 35 | self.data = {'type': 'no_query_arg', 'error': 'No argument with a search term provided.', 'detail': 'Provide one of the following arguments: {}'.format(', '.join(self.search_args))} 36 | self.status_code = 400 37 | return self.build_response() 38 | if 'limit' in args: 39 | try: 40 | self.limit = int(args['limit']) 41 | except ValueError: 42 | self.data = {'type': 'limit_not_integer', 'error': 'Invalid paramter value provided for parameter "limit".', 'detail': 'The provided limit cannot be parsed as an integer value.'} 43 | self.status_code = 400 44 | return self.build_response() 45 | if self.limit > self.MAX_LIMIT: 46 | self.data = {'type': 'limit_too_high', 'error': 'Invalid paramter value provided for parameter "limit".', 'detail': 'Limit is too high. Please set up your own instance to query everything.'} 47 | self.status_code = 400 48 | return self.build_response() 49 | if args.get('name'): 50 | self.data = self.search_by_name(args['name']) 51 | if args.get('ref'): 52 | self.data = self.search_by_ref(args['ref']) 53 | if args.get('uic_ref'): 54 | self.data = self.search_by_uic_ref(args['uic_ref']) 55 | if args.get('q'): 56 | self.data = self.eliminate_duplicates(self.search_by_name(args['q']) + self.search_by_ref(args['q']) + self.search_by_uic_ref(args['q'])) 57 | return self.build_response() 58 | 59 | def query_has_no_wildcards(self, q): 60 | if '%' in q or '_' in q: 61 | return False 62 | return True 63 | 64 | def search_by_name(self, q): 65 | if not self.query_has_no_wildcards(q): 66 | self.status_code = 400 67 | return {'type': 'wildcard_in_query', 'error': 'Wildcard in query.', 'detail': 'Query contains any of the wildcard characters: %_'} 68 | with self.db_conn.cursor() as cursor: 69 | data = [] 70 | # We do not sort the result although we use DISTINCT ON because osm_id is sufficient to sort out duplicates. 71 | sql_query = """SELECT 72 | {fields}, latitude, longitude, rank 73 | FROM ( 74 | SELECT DISTINCT ON (osm_id) 75 | {fields}, latitude, longitude, rank 76 | FROM ( 77 | SELECT 78 | {fields}, ST_X(ST_Transform(geom, 4326)) AS latitude, ST_Y(ST_Transform(geom, 4326)) AS longitude, openrailwaymap_name_rank(phraseto_tsquery('simple', unaccent(openrailwaymap_hyphen_to_space(%s))), terms, route_count, railway, station) AS rank 79 | FROM openrailwaymap_facilities_for_search 80 | WHERE terms @@ phraseto_tsquery('simple', unaccent(openrailwaymap_hyphen_to_space(%s))) 81 | ) AS a 82 | ) AS b 83 | ORDER BY rank DESC NULLS LAST 84 | LIMIT %s;""".format(fields=self.sql_select_fieldlist()) 85 | cursor.execute(sql_query, (q, q, self.limit)) 86 | results = cursor.fetchall() 87 | for r in results: 88 | data.append(self.build_result_item_dict(cursor.description, r)) 89 | return data 90 | 91 | def _search_by_ref(self, search_key, ref): 92 | with self.db_conn.cursor() as cursor: 93 | data = [] 94 | # We do not sort the result although we use DISTINCT ON because osm_id is sufficient to sort out duplicates. 95 | sql_query = """SELECT DISTINCT ON (osm_id) 96 | {}, ST_X(ST_Transform(geom, 4326)) AS latitude, ST_Y(ST_Transform(geom, 4326)) AS longitude 97 | FROM openrailwaymap_ref 98 | WHERE {} = %s 99 | LIMIT %s;""".format(self.sql_select_fieldlist(), search_key) 100 | cursor.execute(sql_query, (ref, self.limit)) 101 | results = cursor.fetchall() 102 | for r in results: 103 | data.append(self.build_result_item_dict(cursor.description, r)) 104 | return data 105 | 106 | def search_by_ref(self, ref): 107 | return self._search_by_ref("railway_ref", ref) 108 | 109 | def search_by_uic_ref(self, ref): 110 | return self._search_by_ref("uic_ref", ref) 111 | 112 | def sql_select_fieldlist(self): 113 | return "osm_id, name, railway, ref, tags" 114 | -------------------------------------------------------------------------------- /openrailwaymap_api/milestone_api.py: -------------------------------------------------------------------------------- 1 | # SPDX-License-Identifier: GPL-2.0-or-later 2 | from openrailwaymap_api.abstract_api import AbstractAPI 3 | 4 | class MilestoneAPI(AbstractAPI): 5 | def __init__(self, db_conn): 6 | self.db_conn = db_conn 7 | self.route_ref = None 8 | self.position = None 9 | self.data = [] 10 | self.status_code = 200 11 | self.limit = 2 12 | 13 | def __call__(self, args): 14 | data = [] 15 | # Validate search arguments 16 | ref = args.get('ref') 17 | position = args.get('position') 18 | if ref is None or position is None: 19 | self.data = {'type': 'no_query_arg', 'error': 'One or multiple mandatory parameters are missing.', 'detail': 'You have to provide both "ref" and "position".'} 20 | self.status_code = 400 21 | return self.build_response() 22 | self.route_ref = args.get('ref') 23 | try: 24 | self.position = float(args.get('position')) 25 | except ValueError: 26 | self.data = {'type': 'position_not_float', 'error': 'Invalid value provided for parameter "position".', 'detail': 'The provided position cannot be parsed as a float.'} 27 | self.status_code = 400 28 | return self.build_response() 29 | if 'limit' in args: 30 | try: 31 | self.limit = int(args['limit']) 32 | except ValueError: 33 | self.data = {'type': 'limit_not_integer', 'error': 'Invalid paramter value provided for parameter "limit".', 'detail': 'The provided limit cannot be parsed as an integer value.'} 34 | self.status_code = 400 35 | return self.build_response() 36 | if self.limit > self.MAX_LIMIT: 37 | self.data = {'type': 'limit_too_high', 'error': 'Invalid paramter value provided for parameter "limit".', 'detail': 'Limit is too high. Please set up your own instance to query everything.'} 38 | self.status_code = 400 39 | return self.build_response() 40 | self.data = self.get_milestones() 41 | return self.build_response() 42 | 43 | def get_milestones(self): 44 | with self.db_conn.cursor() as cursor: 45 | data = [] 46 | # We do not sort the result although we use DISTINCT ON because osm_id is sufficient to sort out duplicates. 47 | sql_query = """SELECT 48 | osm_id, 49 | railway, 50 | position, 51 | ST_X(geom) AS latitude, 52 | ST_Y(geom) As longitude, 53 | route_ref AS ref, 54 | operator 55 | FROM ( 56 | SELECT 57 | osm_id, 58 | railway, 59 | position, 60 | geom, 61 | route_ref, 62 | operator, 63 | -- We use rank(), not row_number() to get the closest and all second closest in cases like this: 64 | -- A B x C 65 | -- where A is as far from the searched location x than C. 66 | rank() OVER (PARTITION BY operator ORDER BY error) AS grouped_rank 67 | FROM ( 68 | SELECT 69 | -- Sort out duplicates which origin from tracks being splitted at milestones 70 | DISTINCT ON (osm_id) 71 | osm_id[1] AS osm_id, 72 | railway[1] AS railway, 73 | position, 74 | geom[1] AS geom, 75 | route_ref, 76 | operator, 77 | error 78 | FROM ( 79 | SELECT 80 | array_agg(osm_id) AS osm_id, 81 | array_agg(railway) AS railway, 82 | position AS position, 83 | array_agg(geom) AS geom, 84 | unnest(ST_ClusterWithin(geom, 25)) AS geom_collection, 85 | route_ref, 86 | operator, 87 | error 88 | FROM ( 89 | SELECT 90 | m.osm_id, 91 | m.railway, 92 | m.position, 93 | ST_Transform(m.geom, 4326) AS geom, 94 | t.ref AS route_ref, 95 | t.tags->'operator' AS operator, 96 | ABS(%s - m.position) AS error 97 | FROM openrailwaymap_milestones AS m 98 | JOIN openrailwaymap_tracks_with_ref AS t 99 | ON t.geom && m.geom AND ST_Intersects(t.geom, m.geom) AND t.ref = %s 100 | WHERE m.position BETWEEN (%s - 10.0)::FLOAT AND (%s + 10.0)::FLOAT 101 | -- sort by distance from searched location, then osm_id for stable sorting 102 | ORDER BY error ASC, m.osm_id 103 | ) AS milestones 104 | GROUP BY position, error, route_ref, operator 105 | ) AS unique_milestones 106 | ) AS top_of_array 107 | ) AS ranked 108 | WHERE grouped_rank <= %s 109 | LIMIT %s;""" 110 | cursor.execute(sql_query, (self.position, self.route_ref, self.position, self.position, self.limit, self.limit)) 111 | results = cursor.fetchall() 112 | for r in results: 113 | data.append(self.build_result_item_dict(cursor.description, r)) 114 | return data 115 | -------------------------------------------------------------------------------- /prepare_facilities.sql: -------------------------------------------------------------------------------- 1 | -- SPDX-License-Identifier: GPL-2.0-or-later 2 | CREATE EXTENSION IF NOT EXISTS unaccent; 3 | 4 | CREATE OR REPLACE FUNCTION openrailwaymap_hyphen_to_space(str TEXT) RETURNS TEXT AS $$ 5 | BEGIN 6 | RETURN regexp_replace(str, '(\w)-(\w)', '\1 \2', 'g'); 7 | END; 8 | $$ LANGUAGE plpgsql IMMUTABLE; 9 | 10 | CREATE MATERIALIZED VIEW IF NOT EXISTS openrailwaymap_ref AS 11 | SELECT DISTINCT ON (osm_id) 12 | osm_id, 13 | name, 14 | tags, 15 | railway, 16 | tags->'station' as station, 17 | ref, 18 | tags->'railway:ref' as railway_ref, 19 | tags->'uic_ref' as uic_ref, 20 | way AS geom 21 | FROM planet_osm_point 22 | WHERE 23 | (tags ? 'railway:ref' OR tags ? 'uic_ref') 24 | AND ( 25 | railway IN ('station', 'halt', 'tram_stop', 'service_station', 'yard', 'junction', 'spur_junction', 'crossover', 'site', 'tram_stop') 26 | OR tags->'disused:railway' IN ('station', 'halt', 'tram_stop', 'service_station', 'yard', 'junction', 'spur_junction', 'crossover', 'site', 'tram_stop') 27 | OR tags->'abandoned:railway' IN ('station', 'halt', 'tram_stop', 'service_station', 'yard', 'junction', 'spur_junction', 'crossover', 'site', 'tram_stop') 28 | OR tags->'proposed:railway' IN ('station', 'halt', 'tram_stop', 'service_station', 'yard', 'junction', 'spur_junction', 'crossover', 'site', 'tram_stop') 29 | OR tags->'razed:railway' IN ('station', 'halt', 'tram_stop', 'service_station', 'yard', 'junction', 'spur_junction', 'crossover', 'site', 'tram_stop') 30 | ); 31 | 32 | -- Create unique index in order to be able to update the materialized view concurrently 33 | CREATE UNIQUE INDEX IF NOT EXISTS openrailwaymap_ref_osm_id 34 | ON openrailwaymap_ref 35 | USING BTREE(osm_id); 36 | 37 | CREATE INDEX IF NOT EXISTS openrailwaymap_ref_railway_ref_idx 38 | ON openrailwaymap_ref 39 | USING BTREE(railway_ref); 40 | 41 | CREATE INDEX IF NOT EXISTS openrailwaymap_ref_uic_ref_idx 42 | ON openrailwaymap_ref 43 | USING BTREE(uic_ref); 44 | 45 | CREATE MATERIALIZED VIEW IF NOT EXISTS openrailwaymap_facilities_for_search AS 46 | SELECT 47 | osm_id, 48 | to_tsvector('simple', unaccent(openrailwaymap_hyphen_to_space(value))) AS terms, 49 | name, 50 | key AS name_key, 51 | value AS name_value, 52 | tags, 53 | railway, 54 | station, 55 | ref, 56 | route_count, 57 | geom 58 | FROM ( 59 | SELECT DISTINCT ON (osm_id, key, value, tags, name, railway, station, ref, route_count, geom) 60 | osm_id, 61 | (each(updated_tags)).key AS key, 62 | (each(updated_tags)).value AS value, 63 | tags, 64 | name, 65 | railway, 66 | station, 67 | ref, 68 | route_count, 69 | geom 70 | FROM ( 71 | SELECT 72 | osm_id, 73 | CASE 74 | WHEN name IS NOT NULL THEN tags || hstore('name', name) 75 | ELSE tags 76 | END AS updated_tags, 77 | name, 78 | tags, 79 | railway, 80 | tags->'station' AS station, 81 | tags->'ref' AS ref, 82 | route_count, 83 | way AS geom 84 | FROM stations_with_route_counts 85 | WHERE 86 | railway IN ('station', 'halt', 'tram_stop', 'service_station', 'yard', 'junction', 'spur_junction', 'crossover', 'site', 'tram_stop') 87 | OR tags->'disused:railway' IN ('station', 'halt', 'tram_stop', 'service_station', 'yard', 'junction', 'spur_junction', 'crossover', 'site', 'tram_stop') 88 | OR tags->'abandoned:railway' IN ('station', 'halt', 'tram_stop', 'service_station', 'yard', 'junction', 'spur_junction', 'crossover', 'site', 'tram_stop') 89 | OR tags->'proposed:railway' IN ('station', 'halt', 'tram_stop', 'service_station', 'yard', 'junction', 'spur_junction', 'crossover', 'site', 'tram_stop') 90 | OR tags->'razed:railway' IN ('station', 'halt', 'tram_stop', 'service_station', 'yard', 'junction', 'spur_junction', 'crossover', 'site', 'tram_stop') 91 | ) AS organised 92 | ) AS duplicated 93 | WHERE 94 | key = 'name' 95 | OR key = 'alt_name' 96 | OR key = 'short_name' 97 | OR key = 'long_name' 98 | OR key = 'official_name' 99 | OR key = 'old_name' 100 | OR key LIKE 'name:%' 101 | OR key LIKE 'alt_name:%' 102 | OR key LIKE 'short_name:%' 103 | OR key LIKE 'long_name:%' 104 | OR key LIKE 'official_name:%' 105 | OR key LIKE 'old_name:%'; 106 | 107 | -- Create unique index in order to be able to update the materialized view concurrently 108 | CREATE UNIQUE INDEX IF NOT EXISTS openrailwaymap_facilities_for_search_unique_idx 109 | ON openrailwaymap_facilities_for_search 110 | USING btree(osm_id, name_key); 111 | 112 | CREATE INDEX IF NOT EXISTS openrailwaymap_facilities_name_index ON openrailwaymap_facilities_for_search USING gin(terms); 113 | 114 | CREATE OR REPLACE FUNCTION openrailwaymap_name_rank(tsquery_str tsquery, tsvec_col tsvector, route_count INTEGER, railway TEXT, station TEXT) RETURNS INTEGER AS $$ 115 | DECLARE 116 | factor FLOAT; 117 | BEGIN 118 | IF railway = 'tram_stop' OR station IN ('light_rail', 'monorail', 'subway') THEN 119 | factor := 0.5; 120 | ELSIF railway = 'halt' THEN 121 | factor := 0.8; 122 | END IF; 123 | IF tsvec_col @@ tsquery_str THEN 124 | factor := 2.0; 125 | END IF; 126 | RETURN (factor * COALESCE(route_count, 0))::INTEGER; 127 | END; 128 | $$ LANGUAGE plpgsql IMMUTABLE; 129 | -------------------------------------------------------------------------------- /prepare_milestones.sql: -------------------------------------------------------------------------------- 1 | -- SPDX-License-Identifier: GPL-2.0-or-later 2 | -- Prepare the database for querying milestones 3 | 4 | CREATE OR REPLACE FUNCTION railway_api_valid_float(value TEXT) RETURNS FLOAT AS $$ 5 | BEGIN 6 | IF value ~ '^-?[0-9]+(\.[0-9]+)$' THEN 7 | RETURN value::FLOAT; 8 | END IF; 9 | RETURN NULL; 10 | END; 11 | $$ LANGUAGE plpgsql; 12 | 13 | CREATE MATERIALIZED VIEW IF NOT EXISTS openrailwaymap_milestones AS 14 | SELECT DISTINCT ON (osm_id) osm_id, position, precision, railway, name, ref, tags, geom 15 | FROM ( 16 | SELECT osm_id, position, precision, railway, name, ref, tags, geom 17 | FROM ( 18 | SELECT 19 | osm_id, 20 | railway_api_valid_float(unnest(string_to_array(tags->'railway:position', ';'))) AS position, 21 | 1::SMALLINT AS precision, 22 | railway, 23 | name, 24 | ref, 25 | tags, 26 | way AS geom 27 | FROM planet_osm_point 28 | WHERE 29 | ( 30 | railway IS NOT NULL 31 | OR tags?'disused:railway' 32 | OR tags?'abandoned:railway' 33 | OR tags?'construction:railway' 34 | OR tags?'proposed:railway' 35 | OR tags?'razed:railway' 36 | ) AND tags?'railway:position' 37 | UNION ALL 38 | SELECT 39 | osm_id, 40 | railway_api_valid_float(unnest(string_to_array(tags->'railway:position:exact', ';'))) AS position, 41 | 3::SMALLINT AS precision, 42 | railway, 43 | name, 44 | ref, 45 | tags, 46 | way AS geom 47 | FROM planet_osm_point 48 | WHERE 49 | ( 50 | railway IS NOT NULL 51 | OR tags?'disused:railway' 52 | OR tags?'abandoned:railway' 53 | OR tags?'construction:railway' 54 | OR tags?'proposed:railway' 55 | OR tags?'razed:railway' 56 | ) AND tags?'railway:position:exact' 57 | ) AS features_with_position 58 | WHERE position IS NOT NULL 59 | ORDER BY osm_id ASC, precision DESC 60 | ) AS duplicates_merged; 61 | 62 | -- Create unique index in order to be able to refresh the materialized view concurrently. 63 | CREATE UNIQUE INDEX IF NOT EXISTS openrailwaymap_milestones_unique_idx 64 | ON openrailwaymap_milestones 65 | USING btree(osm_id, precision); 66 | 67 | CREATE INDEX IF NOT EXISTS openrailwaymap_milestones_geom_idx 68 | ON openrailwaymap_milestones 69 | USING gist(geom); 70 | 71 | CREATE INDEX IF NOT EXISTS openrailwaymap_milestones_position_idx 72 | ON openrailwaymap_milestones 73 | USING gist(geom); 74 | 75 | CREATE OR REPLACE VIEW openrailwaymap_tracks_with_ref AS 76 | SELECT 77 | osm_id, 78 | railway, 79 | name, 80 | ref, 81 | tags, 82 | way AS geom 83 | FROM planet_osm_line 84 | WHERE 85 | railway IN ('rail', 'narrow_gauge', 'subway', 'light_rail', 'tram', 'construction', 'proposed', 'disused', 'abandoned', 'razed') 86 | AND (NOT (tags?'service') OR tags->'usage' IN ('industrial', 'military', 'test')) 87 | AND ref IS NOT NULL 88 | AND osm_id > 0; 89 | 90 | CREATE INDEX IF NOT EXISTS planet_osm_line_ref_geom_idx 91 | ON planet_osm_line 92 | USING gist(way) 93 | WHERE 94 | railway IN ('rail', 'narrow_gauge', 'subway', 'light_rail', 'tram', 'construction', 'proposed', 'disused', 'abandoned', 'razed') 95 | AND (NOT tags?'service' OR tags->'usage' IN ('industrial', 'military', 'test')) 96 | AND ref IS NOT NULL 97 | AND osm_id > 0; 98 | 99 | CREATE INDEX IF NOT EXISTS planet_osm_line_ref_idx 100 | ON planet_osm_line 101 | USING btree(ref) 102 | WHERE 103 | railway IN ('rail', 'narrow_gauge', 'subway', 'light_rail', 'tram', 'construction', 'proposed', 'disused', 'abandoned', 'razed') 104 | AND (NOT tags?'service' OR tags->'usage' IN ('industrial', 'military', 'test')) 105 | AND ref IS NOT NULL 106 | AND osm_id > 0; 107 | -------------------------------------------------------------------------------- /tests/testcases.yml: -------------------------------------------------------------------------------- 1 | - name: Berlin 2 | request: 3 | path: "/facility" 4 | params: 5 | name: "Berlin" 6 | response: 7 | entries: 8 | - name: "Hauptbahnhof" 9 | - name: "Yorckstraße" 10 | - name: "Berlin-Spandau" 11 | - name: "Berlin Südkreuz" 12 | - name: "Ostbahnhof" 13 | - name: "Berlin Ostbahnhof" 14 | - name: "Friedrichstraße" 15 | - name: "Berlin Gesundbrunnen" 16 | - name: "Berlin Hauptbahnhof" 17 | - name: "Hirschgarten" 18 | - name: "Hermannstraße" 19 | - name: "Westkreuz" 20 | - name: "Warschauer Straße" 21 | - name: "Nordbahnhof" 22 | - name: "Ostkreuz" 23 | - name: "Bornholmer Straße" 24 | - name: "Berlin Potsdamer Platz" 25 | - name: "Baumschulenweg" 26 | - name: "Priesterweg" 27 | - name: "Gesundbrunnen" 28 | - name: result limit 5 29 | request: 30 | path: "/facility" 31 | params: 32 | name: "Berlin" 33 | limit: 5 34 | response: 35 | count: 5 36 | - name: result limit 25 37 | request: 38 | path: "/facility" 39 | params: 40 | name: "Berlin" 41 | limit: 25 42 | response: 43 | count: 25 44 | - name: "hyphen" 45 | request: 46 | path: "/facility" 47 | params: 48 | name: "Karlsruhe-Hagsfeld" 49 | response: 50 | match: regexp_full 51 | count: 1 52 | entries: 53 | - name: "Karlsruhe[- ]Hagsfeld" 54 | - name: "space" 55 | request: 56 | path: "/facility" 57 | params: 58 | name: "Karlsruhe Hagsfeld" 59 | response: 60 | match: regexp_full 61 | count: 1 62 | entries: 63 | - name: "Karlsruhe[- ]Hagsfeld" 64 | - name: Karlsruhe 65 | request: 66 | path: "/facility" 67 | params: 68 | name: Karlsruhe 69 | response: 70 | match: regexp_full 71 | entries: 72 | - name: "Karlsruhe (Hauptbahnhof|Hbf)" 73 | - name: "Karlsruhe-Durlach" 74 | - name: "Karlsruhe-Durlach" 75 | - name: "Malsch( \\(K(reis)? Karslruhe\\))?" 76 | - name: "Söllingen \\(b(ei)? Karlsruhe\\)" 77 | - name: "Söllingen \\(b(ei)? Karlsruhe\\)" 78 | - name: "Kunstakademie / Hochschule Karlsruhe" 79 | - name: "Karlsruhe[- ]West" 80 | - name: "Karlsruhe[- ]Knielingen" 81 | - name: "Karlsruhe[- ]Mühlburg" 82 | - name: "Karlsruhe[- ]Hafen" 83 | - name: "Karlsruhe[- ]Brunnenstück" 84 | - name: "Forchheim \\(b(ei)? Karlsruhe\\)" 85 | - name: "Söllingen \\(b(ei)? Karlsruhe\\) Abzw" 86 | - name: "Karlsruhe Gbf" 87 | - name: "Karlsruhe[- ]Rheinbrücke" 88 | - name: "Karlsruhe[- ]Dammerstock" 89 | - name: "Karlsruhe[- ]Hagsfeld" 90 | - name: "'Württ' should not return results" 91 | request: 92 | path: "/facility" 93 | params: 94 | name: Württ 95 | limit: 1 96 | response: 97 | count: 1 98 | - name: "'Württemberg' should not return results" 99 | request: 100 | path: "/facility" 101 | params: 102 | name: Württemberg 103 | limit: 1 104 | response: 105 | count: 1 106 | - name: "'Walheim' should return one result" 107 | request: 108 | path: "/facility" 109 | params: 110 | name: Walheim 111 | response: 112 | match: str_equals 113 | entries: 114 | - name: "Walheim (Württemberg)" 115 | - name: "2160 km 9.4" 116 | request: 117 | path: "/milestone" 118 | params: 119 | ref: 2160 120 | position: 9.4 121 | limit: 1 122 | response: 123 | match: str_equals 124 | entries: 125 | - route_ref: "2160" 126 | position: 9.4 127 | -------------------------------------------------------------------------------- /tests/tests.py: -------------------------------------------------------------------------------- 1 | import argparse 2 | import re 3 | import requests 4 | import sys 5 | from termcolor import colored 6 | import traceback 7 | import yaml 8 | 9 | 10 | class TestCase(): 11 | 12 | def __init__(self, **kwargs): 13 | self.name = kwargs["name"] 14 | self.request = kwargs["request"] 15 | self.response = kwargs["response"] 16 | 17 | def run(self, api): 18 | url = "{}{}".format(api, self.request["path"]) 19 | r = requests.get(url, params=self.request.get("params")) 20 | self.test_equals("status code", r.status_code, self.response.get("status", 200)) 21 | response_data = r.json() 22 | # Test result count 23 | expected_count = self.response.get("count") 24 | if expected_count is not None: 25 | self.test_equals("result count", len(response_data), expected_count) 26 | # Test result names 27 | expected_results = self.response.get("entries") 28 | if expected_results is not None: 29 | self.test_equals("result_count", len(expected_results), len(response_data)) 30 | match_type = self.response.get("match", "str_equals") 31 | for i in range(0, len(expected_results)): 32 | expected = expected_results[i] 33 | got = response_data[i] 34 | if type(expected) is not dict: 35 | self.fail("Expected result must be a dict, not {}: {}".format(type(expected), expected)) 36 | for key, expected_value in expected.items(): 37 | if match_type == "str_equals": 38 | self.test_str_equals("result['{}']['{}']".format(i + 1, key), expected_value, response_data[i][key]) 39 | elif match_type == "regexp_full": 40 | self.test_regexp_full("result['{}']['{}']".format(i + 1, key), expected_value, response_data[i][key]) 41 | else: 42 | self.fail("Unsupported comparison {}".format(match_type)) 43 | self.passed() 44 | 45 | def test_is_type(self, obj, expected_type): 46 | if type(obj) is not expected_type: 47 | self.fail(" {} but {} was expected.".format(status)) 48 | 49 | def test_regexp_full(self, what, regexp, got): 50 | """Compare provided string with a regular expression. The expression must match the full string. 51 | """ 52 | if not re.fullmatch(regexp, got): 53 | print("pattern: {} string: {}".format(regexp, got)) 54 | self.fail("{}: {} does not match regular expression '{}'".format(what, got, regexp)) 55 | 56 | def test_equals(self, what, expected, got): 57 | if got != expected: 58 | self.fail("{}: {} but {} was expected.".format(what, got, expected)) 59 | 60 | def test_str_equals(self, what, expected, got): 61 | if str(got) != str(expected): 62 | self.fail("{}: {} but {} was expected.".format(what, got, expected)) 63 | 64 | def print_traceback(self, color): 65 | for line in traceback.format_stack(): 66 | print(colored(line.strip(), color)) 67 | 68 | def fail(self, message): 69 | text = "ERROR: Test '{}' failed.\n{}".format(self.name, message) 70 | print(colored(text, 'red')) 71 | self.print_traceback('red') 72 | sys.exit(1) 73 | 74 | def passed(self): 75 | text = "PASSED: {}".format(self.name) 76 | print(colored(text, 'green')) 77 | 78 | 79 | parser = argparse.ArgumentParser(description="Run test queries against OpenRailwayMap API and compare results.") 80 | parser.add_argument("-a", "--api", type=str, help="API endpoint", default="http://127.0.0.1:5000") 81 | parser.add_argument("-t", "--tests", type=argparse.FileType("r"), help="Test definitions (YAML)") 82 | args = parser.parse_args() 83 | 84 | cases = yaml.safe_load(args.tests) 85 | cases = [TestCase(**e) for e in cases] 86 | for case in cases: 87 | case.run(args.api) 88 | -------------------------------------------------------------------------------- /update_facilities.sql: -------------------------------------------------------------------------------- 1 | -- SPDX-License-Identifier: GPL-2.0-or-later 2 | -- Flush data updates to the materialized views. 3 | 4 | REFRESH MATERIALIZED VIEW CONCURRENTLY openrailwaymap_ref; 5 | REFRESH MATERIALIZED VIEW CONCURRENTLY openrailwaymap_facilities_for_search; 6 | -------------------------------------------------------------------------------- /update_milestones.sql: -------------------------------------------------------------------------------- 1 | -- SPDX-License-Identifier: GPL-2.0-or-later 2 | -- Flush data updates to the materialized view. 3 | 4 | REFRESH MATERIALIZED VIEW CONCURRENTLY openrailwaymap_milestones; 5 | --------------------------------------------------------------------------------