DBT - DATA FLOW (exemple du template)

# Flux de données dbt — Vue complète

## Schéma global

```
┌─────────────────────────────────────────────────────────────────────────────┐
│                              FICHIERS SOURCE                                │
├─────────────────────────────────────────────────────────────────────────────┤
│                                                                             │
│   seeds/sample_data/              seeds/reference/                          │
│   ├── raw_customers.csv           ├── 

DUCKDB - CLI - CheatSheet - Quick Inspection

# DuckDB CLI — Cheatsheet inspection

## Ouvrir une base

```bash
duckdb dev.duckdb
```

## Schemas

```sql
-- Lister tous les schemas
SELECT * FROM duckdb_schemas();

-- Filtrer les schemas utilisateur (non internes)
SELECT schema_name FROM duckdb_schemas() WHERE internal = false;

-- Schema courant
SELECT current_schema();

-- Changer de schema
USE main_raw_dev;
```

## Tables

```sql
-- Lister toutes les tables (tous schemas)
SHOW ALL TABLES;

-- Lister les tables du schema courant
SHOW TABLE

サイトAからサイトBに着地した人数をサイトAに送信する

1. サイトAからサイトBに対して、https://siteb.hoge?id=fuga123のようなパラメータをつけて遷移させる
 
2. サイトB側で、URLパラメータからid=を抽出してCookieに保存
 
3. サイトB側で動的にimg要素(src属性値にサイトAの計測APIのURLにパラメータを付与したもの)を生成する
 
44. 手順3の時点でサイトAに対してリクエストが発生し、サイトA経由でサイトBに着地した人数を計測できる

DBT - dbt seed

# dbt seed — Guide pédagogique

## Ce que `dbt seed` fait

1. **Parse** les fichiers YAML pour connaître la configuration (schema, types, colonnes)
2. **Pour chaque fichier CSV** dans `seeds/` :
   - Supprime la table si elle existe (DROP)
   - Crée la table avec les types définis (CREATE)
   - Insère les données du CSV (INSERT)

## Ce que `dbt seed` ne fait PAS

| Action | Commande |
|--------|----------|
| Exécuter les models | `dbt run` |
| Exécuter les tests | `dbt test` |
| Compiler le SQL 

DBT - Cascade de Configuration

# Cascade de configuration dbt

## Principe

dbt applique les configurations par héritage : le niveau le plus spécifique gagne toujours.

## Niveaux de priorité

```
┌─────────────────────────────────────────────────────────────┐
│  1. config() dans le fichier SQL        ← Plus spécifique   │
├─────────────────────────────────────────────────────────────┤
│  2. Fichier YAML (_seeds.yml, _models.yml)                  │
├─────────────────────────────────────────────────────────────┤
│  3. dbt_proj

DBT - Guidelines de Documentation

# Guidelines de documentation dbt

## Structure standard d'une description

```yaml
description: |
  # Titre du model/seed
  
  Description courte en une phrase.
  
  ## Grain
  Une ligne par [entité].
  
  ## Sources
  - source_1
  - source_2
  
  ## Notes
  Informations importantes, cas particuliers, hypothèses.
```

## Métadonnées recommandées

```yaml
meta:
  owner: data-team@company.com     # Responsable du model
  tier: gold                       # Niveau de qualité (bronze/silver/gold)
``

DBT - SEEDS - YAML

# Structure type : _seeds.yml

> 📖 Pour les conventions de documentation (descriptions, métadonnées, checklist), voir **dbt-documentation-guidelines.md**

## Syntaxe complète

```yaml
version: 2

seeds:
  - name: nom_du_seed               # Doit correspondre au nom du fichier CSV (sans .csv)
    description: "Description"      # Documentation (supporte le Markdown; pour du multiligne, utiliser le pipe: | ou la syntaxe YAML avancée (voir fichier doc guidelines))
    
    meta:                    

DBT - CLI CHEATSHEET

# dbt CLI Cheatsheet

## Configuration & Debug

| Commande | Effet |
|----------|-------|
| `dbt debug` | Valide la connexion et la configuration |
| `dbt deps` | Installe les packages du `packages.yml` |
| `dbt clean` | Supprime `target/`, `dbt_packages/`, `logs/` |

## Exécution

| Commande | Effet |
|----------|-------|
| `dbt seed` | Charge les fichiers CSV dans le warehouse |
| `dbt run` | Exécute tous les modèles |
| `dbt test` | Exécute tous les tests |
| `dbt build` | Fait `seed` + `run`

3651. Minimum Cost Path with Teleportations

You are given a m x n 2D integer array grid and an integer k. You start at the top-left cell (0, 0) and your goal is to reach the bottom‐right cell (m - 1, n - 1). There are two types of moves available: Normal move: You can move right or down from your current cell (i, j), i.e. you can move to (i, j + 1) (right) or (i + 1, j) (down). The cost is the value of the destination cell. Teleportation: You can teleport from any cell (i, j), to any cell (x, y) such that grid[x][y] <= grid[i][j]; the cost of this move is 0. You may teleport at most k times. Return the minimum total cost to reach cell (m - 1, n - 1) from (0, 0).
/**
 * @param {number[][]} grid
 * @param {number} k
 * @return {number}
 *
 * This solution uses a DP-by-value technique:
 * - Normal moves (right/down) cost grid[i][j]
 * - Teleports cost 0 but can only go to cells with value <= current cell
 * - We simulate using t = 0..k teleports
 *
 * Key idea:
 *   For each teleport count t, we:
 *     1. Start from the previous DP layer (t-1 teleports)
 *     2. Apply a "value sweep" that propagates the best reachable cost
 *        to all cells with <= 

How to check what version of Java I have installed?

java --version

web scrape promptt

so this is as good start but i need to be able to injest and parse, html,markdown,json, plaintext, css,js python, jsx,tsx,ts, pdf, webp, jpeg, jpg, png , i need to be able have my notes injested from notion and obsidian, i need to store code snippets and web docs, i need to injest timestamp, vidoeos, so mp3/mp4s , and whateber else is a common codec videos are stored in.  we need to be able to scrape a sningle webpage, we need to give the  app a list of urls, or have it generate a sitemap then s

WordPress: Style.css start

@charset "UTF-8";
/*
Thema Name: XXXXX株式会社
Description: XXXX株式会社様用のテンプレートです
Version: 1.0
Author: H.Yamada
*/

Deploy to Oracle cloud

1. Create a Compute Instance:
    - Log into OCI Console
    - Navigate to Compute → Instances → Create Instance
    - Choose Ubuntu or Oracle Linux
    - Configure SSH keys for access
    - Open ports 80 (HTTP) and 443 (HTTPS) in security lists
  2. Connect and Setup Server:
  ssh -i your-key.pem ubuntu@<instance-ip>

  # Install Node.js
  curl -fsSL https://deb.nodesource.com/setup_20.x | sudo -E bash -
  sudo apt-get install -y nodejs

  # Install PM2 (process manager)
  sudo npm install -g p

3650. Minimum Cost Path with Edge Reversals

You are given a directed, weighted graph with n nodes labeled from 0 to n - 1, and an array edges where edges[i] = [ui, vi, wi] represents a directed edge from node ui to node vi with cost wi. Each node ui has a switch that can be used at most once: when you arrive at ui and have not yet used its switch, you may activate it on one of its incoming edges vi → ui reverse that edge to ui → vi and immediately traverse it. The reversal is only valid for that single move, and using a reversed edge costs 2 * wi. Return the minimum total cost to travel from node 0 to node n - 1. If it is not possible, return -1.
/**
 * @param {number} n
 * @param {number[][]} edges
 * @return {number}
 *
 * NOTE:
 * This code performs a Dijkstra-like search using a custom MinHeap.
 * It treats every directed edge u→v with cost w as:
 *   - forward:  u → v with cost w
 *   - reverse:  v → u with cost 2w
 *
 * This is NOT the correct logic for the original problem,
 * but this cleaned version preserves your structure exactly.
 */

class MinHeap2 {
    constructor() {
        this.data = [];
    }

    size() {
        ret

NavigationSet_Add

<NavigationSet_Add>
    <Code><![CDATA[primary_navigation]]></Code>
    <Name><![CDATA[Primary Site Navigation Bar]]></Name>
    <Description><![CDATA[]]></Description>
    <Template>![CDATA[]]</Template>
    <Notes>#Set_Current_Time#</Notes>
    <Layout>Horizontal Drop-Down</Layout>
    <Items>
        <Item>
            <Active>true</Active>
            <Name><![CDATA[Shop All]]></Name>
            <Link type="Page" target="_self"><![CDATA[CTLG]]></Link>
        </Item>
        <I

modern finance 1

Lecture 1 - Decisiones financieras de hogares y empresas.

Ejemplo de un proyecto = campaña de marketing.
Se asemeja a una inversion.

Conclusion una decision de negocio se trata de realmente valuar un projecto o su flujo de caja.
Esto es realmente un problema financiero.
Segundo, la valuacion no es un ejercicio subjetivo.

Finanza es la herramienta basica para resolver esas actividades/negocios (campaña de marketing, R&D project, expansion de una linea de prodccion, etc)
y tomar buenas desicion