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 { | |
CreateTableCommand, | |
CreateTableCommandInput, | |
DeleteTableCommand, | |
DeleteTableInput, | |
DescribeTableCommand, | |
DescribeTableInput, | |
ScanCommand, | |
ScanCommandInput, | |
} from '@aws-sdk/client-dynamodb'; |
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
/* Websocket crate */ | |
use ws::{ | |
listen, CloseCode, Error, Handler, Handshake, Message, Request, Response, Result, Sender, | |
}; | |
/* Diesel S10 (*badunts*) */ | |
/* or vin k */ | |
use diesel::*; | |
/* For JSON parsing and reparsing */ |
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
# Tarefa 7.1 ================================================================= | |
# Crie função recursiva e não-recursiva que recebem como parâmetro a base B e um número | |
# N na base B e retornam o número correspondente na base 10. Para representar os números | |
# usar apenas digitos. | |
def sete_ponto_um_recursiva(base, valor, n=0, acumulador=0): | |
if str(valor)[:-1] == '': | |
return print(acumulador + (valor * (base ** n))) | |
else: | |
position = int(repr(valor)[-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
# Tarefa 7.1 ================================================================= | |
# Crie função recursiva e não-recursiva que recebem como parâmetro a base B e um número | |
# N na base B e retornam o número correspondente na base 10. Para representar os números | |
# usar apenas digitos. | |
def sete_ponto_um_recursiva(base, valor, n=0, acumulador=0): | |
if str(valor)[:-1] == '': | |
return print(acumulador + (valor * (base ** n))) | |
else: | |
position = int(repr(valor)[-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
var linkedinhoAutoInviter = class { | |
constructor(maxInvites, actionDelay, pageDelay, ScrollDelay) { | |
this.pageButtons = []; | |
this.alreadyInvited = 0; | |
this.maxInvites = maxInvites; | |
this.actionDelay = actionDelay; | |
this.pageDelay = pageDelay; |
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
Linkedin = { | |
config: { | |
scrollDelay: 500, | |
actionDelay: 500, | |
nextPageDelay: 2000, | |
// set to -1 for no limit | |
maxRequests: -1, | |
totalRequestsSent: 0, | |
}, | |
init: function (data, config) { |
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
Linkedin = { | |
config: { | |
scrollDelay: 500, | |
actionDelay: 500, | |
nextPageDelay: 2000, | |
// set to -1 for no limit | |
maxRequests: 100, | |
totalRequestsSent: 0, | |
}, | |
init: function (data, config) { |
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
match stxt { | |
stxt.contains("ana") => { | |
//dosomething | |
}, | |
stxt.contains("woobs") => {} | |
} |
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
/* To be able to return Templates */ | |
use rocket_contrib::templates::Template; | |
use std::collections::HashMap; | |
/* Diesel query builder */ | |
use diesel::prelude::*; | |
/* Database macros */ | |
use crate::schema::*; |
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 macros and others */ | |
use crate::schema::*; | |
/* For beeing able to serialize */ | |
use serde::Serialize; | |
#[derive(Debug, Queryable, Serialize)] | |
pub struct Hero { | |
pub id: i32, | |
pub fantasy_name: String, |
NewerOlder