This file contains hidden or 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
| Questionnaires list filtering | |
| Empty | |
| type APP-> With input | |
| With input | |
| cancel -> Empty |
This file contains hidden or 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
| Questionnaires list filtering | |
| Empty | |
| type APP-> With input | |
| With input | |
| cancel -> Empty |
This file contains hidden or 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
| Questionnaires list filtering | |
| Empty | |
| type APP-> With input | |
| With input | |
| cancel -> Empty |
This file contains hidden or 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
| """ | |
| Starting with this issue: https://github.com/InseeFr/Pogues/issues/504, we wanted a | |
| better management of the measure unit list used in Pogues / Eno. | |
| This script produces the XSLT fragment in Eno that handles this part of | |
| the Pogues XML to DDI transformation. | |
| The source is: https://github.com/romaintailhurat/DDI-Access-Services/blob/master/src/main/resources/measure-units.json | |
| We go from: |
This file contains hidden or 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
| /* | |
| Stack, array implementation | |
| http://www.cs.usfca.edu/~galles/visualization/StackArray.html | |
| */ | |
| class Stack { | |
| constructor() { | |
| this._stack = []; | |
| this._index = -1; | |
| } |
This file contains hidden or 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
| /* | |
| Queue, array implementation | |
| http://www.cs.usfca.edu/~galles/visualization/QueueArray.html | |
| */ | |
| const init = Symbol("init"); | |
| class Queue { | |
| constructor() { | |
| this._queue = []; |
This file contains hidden or 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
| french_phone_regexp <- "^((\\+)33|0)[1-9](\\d{2}){4}$" | |
| is_valid_phone_number <- function (phone_number) { | |
| # This function takes a phone number and returns TRUE if it is a valid french phone number. | |
| # A number is valid weither it starts with +33 or 0 | |
| # Based on this particular regular expression : https://www.regexpal.com/95062 | |
| return(grepl(french_phone_regexp, phone_number)) | |
| } |
This file contains hidden or 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
| const vows = 'aeiouy'.split(''); | |
| const cons = 'bcdfghjklmnpqrstvwxz'.split(''); | |
| function rand(min, max) { | |
| return Math.floor(Math.random() * (max - min +1)) + min; | |
| } | |
| function randomLetter(group) { | |
| return group[rand(0, group.length - 1)]; | |
| } |