ssghost

import pandas as pd
from dateutil import parser
import plotly.express as px

df1 = pd.read_csv("./monthly_job_applications_2025-04-15T08_01_46.84848Z.csv")
df2 = pd.read_csv("./monthly_job_posts_2025-04-15T08_01_39.691275Z.csv")

df1.rename(columns={"Created At": "Month"}, inplace = True)
df2.rename(columns={"Published At": "Month"}, inplace = True)

ssghost

on run {input, parameters}
	
	do shell script "nohup /usr/local/bin/llama-server -m '/Volumes/TOSHIBA EXT/GGUF/gemma-3-4b-it-q4_0.gguf' --port 11234 >/dev/null 2>&1 &"
	
	return input
end run

ssghost

philschmid

from typing import Dict, Union
from huggingface_hub import get_safetensors_metadata
import argparse
import sys

# Example: 
# python get_gpu_memory.py Qwen/Qwen2.5-7B-Instruct

# Dictionary mapping dtype strings to their byte sizes
bytes_per_dtype: Dict[str, float] = {

ssghost

use mlua::{IntoLua, Lua, Value};

fn main() -> Result<(), Box<dyn std::error::Error>> {
	let lua = Lua::new();
	let utils = lua.create_table()?;

	let double_fn = lua.create_function(|lua: &Lua, arg_0: i64| {
		let res = arg_0 * 2;
		res.into_lua(lua)
	})?;

ssghost

import asyncio
import base64
import json
import os
import pyaudio
from websockets.asyncio.client import connect


class SimpleGeminiVoice:
    def __init__(self):

ssghost

ssghost

// SPDX-License-Identifier: MIT
// Compatible with OpenZeppelin Contracts ^5.0.0
pragma solidity ^0.8.22;

import "@openzeppelin/contracts/token/ERC721/ERC721.sol";
import "@openzeppelin/contracts/token/ERC721/extensions/ERC721Enumerable.sol";
import "@openzeppelin/contracts/token/ERC721/extensions/ERC721URIStorage.sol";
import "@openzeppelin/contracts/access/Ownable.sol";
import {VRFConsumerBaseV2Plus} from "@chainlink/contracts/src/v0.8/vrf/dev/VRFConsumerBaseV2Plus.sol";
import {VRFV2PlusClient} from "@chainlink/contracts/src/v0.8/vrf/dev/libraries/VRFV2PlusClient.sol";

VictorTaelin

THE PROBLEM

🌲 Invert a binary tree! 🌲

Except with 3 catches:

1. It must invert the keys ("bit-reversal permutation")
2. It must be a dependency-free, pure recursive function
3. It must have type Bit -> Tree -> Tree (i.e., a direct recursion with max 1 bit state)

ssghost