✔ Network bem-server_backend Created 0.1s
✔ Container pgsql Created 0.1s
✔ Container bem-server Created 0.0s
✔ Container nginx-bem-server Created 0.1s
Attaching to bem-server, nginx-bem-server, pgsql
pgsql | The files belonging to this database system will be owned by user "postgres".
pgsql | This user must also own the server process.
pgsql |
pgsql | The database cluster will be initialized with locale "en_US.utf8".
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
exports.shorthands = undefined; | |
exports.up = (pgm) => { | |
pgm.createTable("session", { | |
sid: { type: "varchar", notNull: true, primaryKey: true }, | |
sess: { type: "json", notNull: true }, | |
expire: { type: "timestamp(6)", notNull: true }, | |
}); | |
pgm.createIndex("session", "expire", { name: "IDX_session_expire" }); |
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
vim.o.tabstop = 4 | |
vim.o.softtabstop = 4 | |
vim.o.shiftwidth = 4 | |
vim.opt.number = true | |
-- [[ Install `lazy.nvim` plugin manager ]] | |
-- See `:help lazy.nvim.txt` or https://github.com/folke/lazy.nvim for more info | |
local lazypath = vim.fn.stdpath 'data' .. '/lazy/lazy.nvim' | |
if not (vim.uv or vim.loop).fs_stat(lazypath) then |
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
import * as readline from 'node:readline/promises'; | |
import { stdin as input, stdout as output } from 'node:process'; | |
/* valid tokens: | |
numbers (consisting of digits), | |
words (consisting of alnum chars), | |
comment (ignore) | |
*/ | |
const Transition = class { | |
#nextState; |
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
#include <assert.h> | |
#include <stdio.h> | |
#include <stdlib.h> | |
#include <string.h> | |
struct Exp_T { | |
const char *str; | |
int index; | |
int length; | |
int token; |
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
// Calcular fatorial iterativo | |
pr init | |
int fat = 1, n = 1, z | |
getint n | |
if (n <= 1) | |
fat = 1 | |
else | |
fat = n | |
z = n |
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
<html> | |
<body> | |
<h1>Try poking!</h1> | |
<button>POKE</button> | |
<p>Pokes: 0</p> | |
<a href="#">Download poke count</a> | |
<script src="./script.js"></script> | |
</body> | |
</html> |
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
const pattern = new RegExp([ | |
'\\d{3}', // Area code | |
'\\s*', // Optional whitespace | |
'-?', // Optional dash | |
'\\d{4}' // Main number | |
].join(''), 'g'); | |
const match = '123 4567'.match(pattern); | |
console.log(match[0]); // "123 4567" |
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
/* Automato finito: w possui um numero par de a e b */ | |
digraph { | |
zero; | |
one; | |
two; | |
node [shape="doublecircle"]; | |
three; | |
/* estado inicial */ |
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
#!/bin/bash | |
test_words() { | |
local pattern=$1 | |
shift | |
local words=("$@") | |
for word in "${words[@]}" | |
do | |
if ! echo "$word" | grep -E "$pattern" > /dev/null ; then |
NewerOlder