graph TD
subgraph function tryCatchExample
subgraph function f
froml9c4tol9c18("const ff = 45;")
froml24c4tol24c13>"return 1;"]
style froml24c4tol24c13 fill:#99FF99
subgraph function d
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
PREFIX : <https://id.parliament.uk/schema/> | |
PREFIX id: <https://id.parliament.uk/> | |
SELECT ?flag | |
WHERE { | |
{ | |
SELECT (count(*) as ?flag) | |
WHERE { | |
?x a :House. | |
FILTER EXISTS { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
drop table if exists change_events; | |
drop type if exists change_types; | |
drop table if exists kingdom_ranks; | |
drop table if exists external_identifiers; | |
drop table if exists external_identifier_authorities; | |
drop table if exists authority_owners; | |
drop table if exists house_seat_incumbencies; | |
drop table if exists peerage_holdings; | |
drop table if exists house_seats; | |
drop table if exists law_lord_incumbencies; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# this code gets all routes and processes in whatever order they emerge from the database (randomly) | |
# in order to ensure routes are parsed correctly, we need to ensure that all inbound routes to a step are parsed before we parse the outbound route | |
# this means we need to start at the start step, acknowledging that some procedure maps have more than one start step | |
# in order to do this we need to ... | |
# hard code an array of start steps | |
# start step for PNSI: u7VOBBH0 | |
procedure.pnsi.start_steps = [u7VOBBH0] | |
# start steps for draft negative: wShvPQbP, j4iPxsxb |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
rdf_read_turtle('https://raw.githubusercontent.com/ukparliament/ontologies/master/procedure/procedure-ontology.ttl', Triples, []). |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var url = document.URL ; | |
const myUrl = new URL(url); | |
if (window.location.origin == "https://legislation.glitch.me") | |
{window.location.href = "https://www.legislation.gov.uk" + myUrl.pathname} | |
else if (window.location.origin == "https://www.legislation.gov.uk") |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<a href="javascript:(function()%7Bvar%20url%20%3D%20document.URL%20%3B%0A%0Aconst%20myUrl%20%3D%20new%20URL(url)%3B%0A%0A%20if%20(window.location.origin%20%3D%3D%20%22https%3A%2F%2Flegislation.glitch.me%22)%0A%0A%7Bwindow.location.href%20%3D%20%22https%3A%2F%2Fwww.legislation.gov.uk%22%20%2B%20myUrl.pathname%7D%0A%0Aelse%20if%20(window.location.origin%20%3D%3D%20%22https%3A%2F%2Fwww.legislation.gov.uk%22)%0A%0A%7Bwindow.location.href%20%3D%20%22https%3A%2F%2Flegislation.glitch.me%22%20%2B%20myUrl.pathname%7D%0A%0Aelse%20%7Balert(%22oops%22)%7D%3B%7D)()%3B">LegToggle</a> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
javascript:(function()%7Bvar%20url%20%3D%20document.URL%20%3B%0A%0Aconst%20myUrl%20%3D%20new%20URL(url)%3B%0A%0A%20if%20(window.location.origin%20%3D%3D%20%22https%3A%2F%2Flegislation.glitch.me%22)%0A%0A%7Bwindow.location.href%20%3D%20%22https%3A%2F%2Fwww.legislation.gov.uk%22%20%2B%20myUrl.pathname%7D%0A%0Aelse%20if%20(window.location.origin%20%3D%3D%20%22https%3A%2F%2Fwww.legislation.gov.uk%22)%0A%0A%7Bwindow.location.href%20%3D%20%22https%3A%2F%2Flegislation.glitch.me%22%20%2B%20myUrl.pathname%7D%0A%0Aelse%20%7Balert(%22oops%22)%7D%3B%7D)()%3B |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
PREFIX rdfs: <http://www.w3.org/2000/01/rdf-schema#> | |
PREFIX : <https://id.parliament.uk/schema/> | |
select ?SI ?SIname where { | |
?SI a :StatutoryInstrumentPaper . | |
?SI rdfs:label ?SIname ; | |
:statutoryInstrumentPaperYear "2018"^^xsd:gYear ; | |
NewerOlder