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
{ | |
"vars": { | |
"@gray-base": "#291F00", | |
"@gray-darker": "lighten(@gray-base, 13.5%)", | |
"@gray-dark": "lighten(@gray-base, 20%)", | |
"@gray": "lighten(@gray-base, 33.5%)", | |
"@gray-light": "lighten(@gray-base, 46.7%)", | |
"@gray-lighter": "lighten(@gray-base, 93.5%)", | |
"@brand-primary": "darken(#B89300, 6.5%)", | |
"@brand-success": "#00CC00", |
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
// ==UserScript== | |
// @description Display as discarded InfoJobs.net' offers that user is not interested anymore. | |
// @description Add a button of "Discard" next to the button of "Inscribe". | |
// @include https://www.infojobs.net/* | |
// @name Discarded Infojobs' Offers | |
// @name:es-MX Ofertas de InfoJobs Descartadas | |
// @downloadURL https://gist.github.com/Silverium/c443b8fb77a7f51b3c71 | |
// @updateURL https://gist.github.com/Silverium/c443b8fb77a7f51b3c71 | |
// @namespace github.com/Silverium | |
// @author Soldeplata Saketos Candela |
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
// ==UserScript== | |
// @description Extend the list of job applications from 30 to 50 and 100. | |
// @include https://www.infojobs.net/candidate/applications/* | |
// @name Extend Infojobs' Applications List | |
// @name:es-MX Ampliar la lista de candidaturas de InfoJobs | |
// @downloadURL https://gist.github.com/Silverium/c058ce671ee0fb6825fb | |
// @updateURL https://gist.github.com/Silverium/c058ce671ee0fb6825fb | |
// @namespace github.com/Silverium | |
// @author Soldeplata Saketos Candela | |
// @version 1 |
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
if (!Array.prototype.hasOwnProperty('concatAll')) { | |
Object.defineProperty(Array.prototype, 'concatAll', { | |
value: function () { | |
let results = []; | |
for (const subArray of this) { | |
results = results.concat(subArray); | |
} | |
return results; | |
}, | |
writable: true, |
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
function sumProperDivisors(num) { | |
return [...Array(Math.floor(num / 2))].reduce((acc,v, ind) => (num % (ind + 1)) === 0 ? (acc + ind + 1) : acc, 0) | |
} | |
function areAmicableNumbers(num1, num2) { | |
return sumProperDivisors(num1) === num2 && sumProperDivisors(num2) === num1 | |
} | |
function amicableNumbersInRange(start,end){ | |
let nums = [...Array(Number.parseInt((end - start) / 2))].map((v,i)=>start+i); | |
return [...nums.reduce((acc, v, i) => { | |
const possibleAmical = sumProperDivisors(v); |