disouzam

using System.Collections;
using System.Collections.Generic;
using UnityEngine;

// Note that the Halton bases must consist of coprime integers.

// Learn more about the Halton sequence: https://en.wikipedia.org/wiki/Halton_sequence
// Learn more about low discrepancy sequences: https://en.wikipedia.org/wiki/Low-discrepancy_sequence
// Learn more about coprime numbers: https://en.wikipedia.org/wiki/Coprime_integers

disouzam

"""
The most atomic way to train and run inference for a GPT in pure, dependency-free Python.
This file is the complete algorithm.
Everything else is just efficiency.

@karpathy
"""

import os       # os.path.exists
import math     # math.log, math.exp

disouzam

library(microdatasus)
library(tidyverse)


estados<- c("AC","AL","AM", "AP", "BA","CE","DF","ES","GO","MA","MT","MS","MG","PA","PB", "PR","PE","PI","RJ","RS","RN","RO","RR","SC","SP","SE","TO")


download.file("ftp://ftp.datasus.gov.br/dissemin/publicos/SIHSUS/200801_/Doc/IT_SIHSUS_1603.pdf", destfile = "documentacao.pdf", mode= "wb", method = "libcurl" )

disouzam

custom_scripts/
.vscode/
pyproject.toml
poetry.lock
*.equi
*.cst

disouzam

#!/usr/bin/env python3
# uv run lemire.py --token <your_github_token> --user <github_username>
#
# To generate a GitHub Personal Access Token:
# 1. Go to https://github.com/settings/tokens
# 2. Click "Generate new token (classic)"
# 3. Give it a name, e.g., "GitHub Search Script"
# 4. Select scopes: For public repositories, select "public_repo". For private, select "repo".
# 5. Click "Generate token"
# 6. Copy the token and use it as --token argument.

disouzam

Table of Contents

• set -e, -u, -x, -o pipefail
• set -e
• set -x
• set -u
• set -o pipefail
• Setting IFS
• Original Reference

set -e, -u, -x, -o pipefail

disouzam

The Comprehensive Guide to pre-commit

Table of Contents

1. Introduction: What is pre-commit?
2. Why Use pre-commit?
3. How pre-commit Works
4. Installing and Setting Up pre-commit
5. Configuring .pre-commit-config.yaml
6. Built-in and Community Hooks

disouzam

from collections import defaultdict
from graphlib import TopologicalSorter
from heapq import heappush, heappop, heapify


def topo_lex(pairs):
    deps = defaultdict(set)  # node -> set(dependencies)
    for a, b in pairs:
        deps.setdefault(a, set())
        deps[b].add(a)

disouzam

# Os dados estão presentes no repositório big query da base dos dados

SELECT id_municipio,
       count(*) as quantidade_nivel_superior,
       ( select count(*)
           from `basedosdados.br_me_rais.microdados_vinculos` vinc_sub
          where vinc_sub.id_municipio = vinc.id_municipio and
                ano = 2023 and
                vinculo_ativo_3112 ="1" and
                natureza_juridica = "1244") as total_servidores_municipio, #1244= município 

disouzam

1. Act with Prudence by Seb Rose
2. Apply Functional Programming Principles by Edward Garson
3. Ask "What Would the User Do?" (You Are not the User) by [Giles Colborne](https://web.archive.org/web/20180504115556/http://programmer.97things.oreilly.com/wiki/index.php/Giles_Colborne "Giles