ArtemGr

#If WinActive("Druidstone")

q::
  MouseGetPos, mouseStartX, mouseStartY
  if WinExist("Cheat Happens Trainer") {
    WinActivate
    WinMove, 600, 111
    MouseMove, 210, 180, 5
    MouseClick, Left
    MouseMove, 900, 320, 5

ArtemGr

// https://stackoverflow.com/questions/33424185/why-are-incorrect-type-assignments-allowed-in-dart

void main() {
  Map<String, dynamic> map = {
    'str': 'test',
    'integer': 5,
    'decimal': 1.5,
    'list': [1,2,3]
  };

ArtemGr

// https://stackoverflow.com/questions/33424185/why-are-incorrect-type-assignments-allowed-in-dart

void main() {
  String str     = "test";
  int integer    = 5;
  double decimal = 1.5;
  List list      = [1,2,3];

  String s = decimal;   print(s);  // 1.5
  int i    = str;       print(i);  // test

ArtemGr

We need a second device to enforce the time limits

Password security relies to a large degree on the time limits imposed upon password verification.

That is, if I can verify three passwords per minute then guessing an alphanumeric password of eight characters might take approximately Math.pow (36, 8) / 2 / (86400 / 20) / 365 = 2236 years, but if I can verify three million passwords per second then guessing the same password might take Math.pow (36, 8) / 2 / (86400 * 3000000) = 5 days.

If we limit a PIN to be verified no more than three times per ten minutes

ArtemGr

[package]
name = "hex"
version = "0.1.0"

[dependencies]
fomat-macros = "*"

ArtemGr

// [build] cd .. && cargo bench

#![feature(asm, test)]

extern crate inlinable_string;
extern crate ordermap;
extern crate seahash;
extern crate test;

use inlinable_string::{InlinableString, StringExt};

ArtemGr

use openssl::sign::Verifier;
use openssl::rsa::Rsa;
use openssl::pkey::PKey;
use openssl::hash::MessageDigest;
use serde_json::{self as json, Value as Json};

pub fn firebase_id_token (headers: BTreeMap<&str, &str>, mut stream: &mut BufStream<TcpStream>) -> Result<(), String> {
  #[derive(Deserialize, Debug)]
  struct Post {firebase_id_token: String}

ArtemGr

// [build] rustc -O cmake.rs
// cf. https://youtrack.jetbrains.com/issue/CPP-188#comment=27-899992

use std::env::args;
use std::fs::OpenOptions;
use std::io::Write;
use std::path::Path;
use std::process::Command;

fn main() {

ArtemGr

    // Asynchronous PostgreSQL INSERT.

    glim::NsecTimer timer;
    std::unique_ptr<PGconn, void(*)(PGconn*)> pg (PQconnectStart (pcs.c_str()), PQfinish);
    if (pg.get() == nullptr || PQstatus (pg.get()) == CONNECTION_BAD) GTHROW ("!PQconnectStart");
    int sock = PQsocket (pg.get());

    auto evBase = EvServ::instance()->evbase();
    event_callback_fn cbcoroInvokeFromCallback = [](evutil_socket_t, short, void* cbcoro) {((CBCoro*) cbcoro)->invokeFromCallback();};
    std::unique_ptr<struct event, void(*)(struct event*)> evRead (event_new (evBase.get(), sock, EV_READ, cbcoroInvokeFromCallback, cbcoro), event_free);

ArtemGr

/// Implements the /(?x) (.*?) (remainder)/ pattern:
/// looks for remainder first, then returns a tuple with the prefix and the remainder.
/// Discussion: https://www.reddit.com/r/rust/comments/4yokxd/crash_course_into_nom_kind_of_question/
macro_rules! take_until_parse_s (
  ($i: expr, $submac: ident! ($($args:tt)*)) => ({
    let input = $i as &str;
    let mut ret = IResult::Error (nom::Err::Position (nom::ErrorKind::Custom (0), input));
    for (pos, _) in $i.char_indices() {
      match $submac! (&input[pos..], $($args)*) {
        IResult::Done (i,o)    => {ret = IResult::Done (i, (&input[0..pos], o)); break},  // Found the remainder!