ddjerqq

Discord Timestamps

Discord timestamps can be useful for specifying a date/time across multiple users time zones. They work with the Unix Timestamp format and can be posted by regular users as well as bots and applications.

The Epoch Unix Time Stamp Converter is a good way to quickly generate a timestamp. For the examples below I will be using the Time Stamp of 1543392060, which represents November 28th, 2018 at 09:01:00 hours for my local time zone (GMT+0100 Central European Standard Time).

Formatting

Style	Input	Output (12-hour clock)	Output (24-hour clock)
Default	<t:1543392060>	November 28, 2018 9:01 AM	28 November 2018 09:01

ddjerqq

CUDA helper for block and thread indexing

general rule of thumb

threadsperblock = 32
blockspergrid = (an_array.size + (threadsperblock - 1)) // threadsperblock
increment_by_one[blockspergrid, threadsperblock](an_array)

ddjerqq

#include <cstring>
#include <sstream>
#include <iomanip>

#ifndef SHA256_CUH
#define SHA256_CUH

#include <string>
#include <array>

ddjerqq

#include <chrono>
#include "../common/book.h"
#include "../common/cpu_anim.h"

#define DIM 1024

using namespace std;
using namespace std::chrono;

// 2D array of blocks and dimensions

ddjerqq

#include <chrono>
#include "../common/book.h"

#define N (1 << 16)
// element count: 65536

// max blocks -> 65535
// max threads per block -> 512

using namespace std;

ddjerqq

// check comments for where to find these headers
#include "../common/book.h"
#include "../common/cpu_bitmap.h"

#define DIM 1000
#define SCALE 0.1f
#define STEPS 300
#define JULIA_REAL (-0.8f)
#define JULIA_IMAG (0.155f)

ddjerqq

#include <iostream>

using namespace std;

// create a 'kernel'. a kernel is a function that runs on the 'device' - GPU
__global__
void saxpy(int n, float a, float* x, float* y)
{
    // get the current index in the arrays;
    int i = blockIdx.x * blockDim.x + threadIdx.x;

ddjerqq

"""Bloom Filter

A Bloom filter is a space-efficient probabilistic data structure, 
conceived by Burton Howard Bloom in 1970, that is used to test whether 
an element is a member of a set. False positive matches are possible, 
but false negatives are not – in other words, a query returns either 
"possibly in set" or "definitely not in set". Elements can be added to 
the set, but not removed (though this can be addressed with the counting 
Bloom filter variant); the more items added, the larger the probability 
of false positives.

ddjerqq

"""recursively extract links and their titles from a web address
"""
from __future__ import annotations

import re
import asyncio as aio

import aiohttp
from aiohttp import ClientTimeout

ddjerqq

"""
1. Create a web crawler/scraper that uses socket connections (No Selenium) to gather links from webpages and add
them to a process queue.

2. The queue will be processed by P number of processes (However many cores on the machine).

3. Each process will use aiohttp (Async) with max T number of threads/tasks (Variable default: 100) to scrape from
the queue and add to the queue.

4. Store the title of all scraped HTML pages along with their URLs in an SQLITE database file.