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
| SELECT DISTINCT A.ID, A.title, A.file_path, B.Count | |
| FROM tracks A | |
| inner JOIN ( | |
| SELECT COUNT(*) as Count, B.title | |
| FROM tracks B | |
| GROUP BY B.title | |
| ) AS B ON A.title = B.title | |
| WHERE B.Count > 1 | |
| ORDER by A.title; |
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
| return { | |
| filename: _filename, | |
| find: function(id) { | |
| js_database.forEach(function(entry) { | |
| if(id === entry.id) { | |
| return this.assetFromFile(entry.filename); | |
| } | |
| }); | |
| return null; | |
| }, |
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
| buildStar(x, y, radius) { | |
| let pentagon = this.buildPolygonRegular(x, y, radius, 5); | |
| let p0 = lineIntersection(pentagon[0], pentagon[2], pentagon[1], pentagon[4]); | |
| let p1 = lineIntersection(pentagon[0], pentagon[2], pentagon[1], pentagon[3]); | |
| let p2 = lineIntersection(pentagon[2], pentagon[4], pentagon[3], pentagon[1]); | |
| let p3 = lineIntersection(pentagon[2], pentagon[4], pentagon[3], pentagon[0]); | |
| let p4 = lineIntersection(pentagon[0], pentagon[3], pentagon[1], pentagon[4]); | |
| let output = []; |
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
| let resultado = [3,5,9,40,42,47]; | |
| let validarNumerosMegaSena = (resultado, nodes) => { | |
| for(let c of nodes) { | |
| let n = Number.parseInt(c.textContent); | |
| if(resultado.indexOf(n) >= 0) { c.style.backgroundColor = 'yellow' } | |
| } | |
| } | |
| let nodes = document.querySelectorAll('#tabelaApostas tbody tr celula-prognostico span.margemVolante'); | |
| validarNumerosMegaSena(resultado, nodes); |
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
| #include <stdio.h> | |
| #include <stdlib.h> | |
| #define GB 1024 * 1024 * 1024 | |
| int main() { | |
| printf("hello world!\n"); | |
| printf("%d\n", GB); |
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
| function calcularDigitoVerificador(numero) { | |
| const mod11 = (value) => `${value}` | |
| .split('') | |
| .map(elem => Number.parseInt(elem)) | |
| .reduce((sum, elem, index) => sum + elem * (index + 1)) % 11; | |
| let dv1 = mod11(numero.substring(0, 9)); | |
| dv1 = dv1 >= 10 ? 0 : dv1; | |
| let dv2 = mod11(`${numero.substring(1, 9)}${dv1}`) | |
| dv2 = dv2 >= 10 ? 0 : dv2; |
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
| # ~/.bashrc: executed by bash(1) for non-login shells. | |
| # see /usr/share/doc/bash/examples/startup-files (in the package bash-doc) | |
| # for examples | |
| export PATH=$PATH:/home/paulocanedo/apps/jdk-8u201-linux-x64/jdk1.8.0_201/bin | |
| export PATH=$PATH:/home/paulocanedo/apps/gradle-5.1.1-bin/gradle-5.1.1/bin | |
| export JAVA_HOME=/home/paulocanedo/apps/jdk-8u201-linux-x64/jdk1.8.0_201 | |
| export ANDROID_HOME=/home/paulocanedo/Android/Sdk |
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
| using Point = std::array<float, 2>; | |
| int main() | |
| { | |
| Point a = {1.1f, 2.1f}; | |
| Point b = {1.5f, 2.5f}; | |
| Point c = {5.5f, 3.5f}; | |
| Point d = {4.5f, 1.5f}; | |
| std::vector<Point> polygon; |
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
| #include "app.hpp" | |
| #include "include/mapbox/earcut.hpp" | |
| #define BEZIER_STEP 0.01f | |
| void framebuffer_size_callback(GLFWwindow* window, int width, int height); | |
| void processInput(GLFWwindow *window); | |
| // settings | |
| const unsigned int SCR_WIDTH = 800; |
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
| #include "app.hpp" | |
| #include "include/mapbox/earcut.hpp" | |
| #include "include/delfrrr/delaunator.hpp" | |
| #include "engine/text/Glyph.hpp" | |
| GLenum glCheckError_(const char *file, int line) | |
| { | |
| GLenum errorCode; | |
| while ((errorCode = glGetError()) != GL_NO_ERROR) | |
| { |
OlderNewer