Cacher is the code snippet organizer for pro developers

# パーミッションの読み方

## 基本構造

パーミッションは3桁の数字で表現
各桁は所有者、グループ、その他のユーザーの権限を示す

### 例: 755の場合

1桁目(7): 所有者の権限
2桁目(5): グループの権限
3桁目(5): その他のユーザーの権限


## 数字の意味
各桁は以下の数値の合計:

4 = 読み取り (read, r)
2 = 書き込み (write, w)
1 = 実行 (execute, x)
0 = 権限なし (-)

### 計算例:
7 = 4+2+1 = rwx (すべて可能)
6 = 4+2   = rw- (読み書き可能)
5 = 4+1   = r-x (読み実行可能)
4 = 4     = r-- (読み取りのみ)
0 = 0     = --- (権限なし)


## よく使うパーミッション
644 (rw-r--r--)
  所有者: 読み書き
  グループ: 読み取り
  その他: 読み取り
  → 一般的なファイル、設定ファイル、ドキュメント

755 (rwxr-xr-x)
  所有者: 読み書き実行
  グループ: 

<p id="counter-text">カウント: 0</span>
<button type="button" aria-labelledby="counter-text" id="count-button">クリックするとカウントが読み上げられるが、このテキストは無視される</button>

https://whois.jprs.jp/

// new Set(): 重複のない値の集合を作成する（Setオブジェクト）
// - 同じ値は一度だけ格納される
// - インデックスは存在しない
const mySet = new Set();

// Set.add(): セットに値を追加する
mySet.add("apple");
mySet.add("banana");
mySet.add("apple"); // 重複のため実際には追加されない

console.log("mySet:", mySet);

// Set.has(): セットに指定した値が存在するかを確認する
// 戻り値: boolean (true/false)
console.log('mySet.has("apple"):', mySet.has("apple")); // true
console.log('mySet.has("banana"):', mySet.has("banana")); // true
console.log('mySet.has("orange"):', mySet.has("orange")); // false

.elementor-nav-menu--layout-vertical .elementor-nav-menu .sub-menu {
    position: static !important;  
    display: none;                   
    padding-left: 0px;   
    margin: 0px !important;
    animation: menuSlide 0.25s ease;
    overflow: hidden;
}

/* --- Parent list items --- */
.elementor-nav-menu--layout-vertical .elementor-nav-menu li {
    position: static !important;
}

/* --- Open state (SmartMenus adds .sm-open) --- */
.elementor-nav-menu--layout-vertical .element

<form id="purchaseForm">
  <div>
    <label>商品A: <input type="number" name="productA" min="0" value="0" /></label>
  </div>
  <div>
    <label>商品B: <input type="number" name="productB" min="0" value="0" /></label>
  </div>
  <div>
    <label>商品C: <input type="number" name="productC" min="0" value="0" /></label>
  </div>
  <div>
    <label>商品D: <input type="number" name="productD" min="0" value="0" /></label>
  </div>
  <div>
    <label>商品E: <input type="number" name="productE" min="0" value="0" 

/**
 * @param {number} low
 * @param {number} high
 * @return {number}
 */
var countOdds = function(low, high) {
    // Step 1: Think about what we want:
    // We need to count how many odd numbers exist between low and high (inclusive).

    // Step 2: Use math instead of looping:
    // Formula: floor((high + 1) / 2) - floor(low / 2)
    // Why? Because:
    // - floor(x / 2) gives the count of even numbers up to x.
    // - floor((x + 1) / 2) gives the count of odd numbers up to x.
    // Su

import os
import sys
import subprocess
import random
import time
import getpass
import json

# Paketprüfung
required_packages = ["googlemaps", "tqdm"]
for package in required_packages:
    try:
        __import__(package)
    except ImportError:
        subprocess.check_call([sys.executable, "-m", "pip", "install", package])

import googlemaps
from tqdm import tqdm

# Funktion: Benutzername erkennen und Pfad anpassen
def get_key_path(file_name):
    possible_users = ["Bernha

# SYNOLOGY TIPS & TRICKS #

#### P4V:
Install P4V on synology NAS: [Link to Repo](https://github.com/FrozenStormInteractive/Perforce-Synology)

#### ENABLE SHR ( Synology Hybrid Raid )
-> Check the other snippet ( synology tag )

from PyQt5.QtWidgets import QMainWindow, QApplication
from PyQt5.QtGui import QIcon

class NameYourWindow(QMainWindow):
    def __init__(self):
        super().__init__()
        
        self.setWindowTitle("Window Title")
        
        self.show()
        
if __name__ == '__main__':
    app = QApplication([])

	app.setApplicationName("Your App Name")
	app.setOrganizationName("Your Organization Name")
	app.setApplicationVersion("0.1.0")
	
	controller = NameYourWindow()
	
	app.exec()

/**
 * Count the number of ways to partition nums into contiguous segments
 * such that in each segment, max - min <= k.
 * 
 * @param {number[]} nums - Input array of integers
 * @param {number} k - Maximum allowed difference between max and min in a segment
 * @return {number} - Number of valid partitions modulo 1e9+7
 */
var countPartitions = function (nums, k) {
    const MOD = 1e9 + 7;
    const n = nums.length;

    // dp[i] = number of ways to partition the first i elements (nums[0..i-1])

/**
 * Count the number of ways to partition nums into contiguous segments
 * such that in each segment, max - min <= k.
 * 
 * @param {number[]} nums - Input array of integers
 * @param {number} k - Maximum allowed difference between max and min in a segment
 * @return {number} - Number of valid partitions modulo 1e9+7
 */
var countPartitions = function (nums, k) {
    const MOD = 1e9 + 7;
    const n = nums.length;

    // dp[i] = number of ways to partition the first i elements (nums[0..i-1])

# ------------------------------------------------------------
# Automatischer Paketimport & -Installation
# ------------------------------------------------------------
import sys
import subprocess
import importlib
import importlib.util

def ensure_package(pkg_name, import_name=None):
    """
    Stellt sicher, dass ein Paket installiert und importierbar ist.
    Falls nicht installiert, wird es automatisch via pip installiert.
    """
    name_to_check = import_name or pkg_name
 

              Lazarus Group (North Korea)


Selling 100% Good Cvv CC Fullz Dumps ATM Track 1/2 + Pin SMTP /WU/Transfer CashApp Venmo Apple Pay PayPal Zelle Skrill Bank logins-----

U.P.D.A.T.E CVV 2025 Sell CVV Good info And High Balance

(Cvv CC Fullz Credit Cards Dumps ATM Track 1/2 + Pin SMTP /WU/Transfer)

Buy Valid Cvv CC Dumps Track 1/2 CC SSN DOB Track-1/2-FULLZ-Transfer/Western union

[Please contact me]
--------------------------------------------
- telegram : @JeansonTooL

- telegram

https://www.sitepoint.com/javascript-design-patterns-observer-pattern/

/**
 * @param {number[]} nums
 * @return {number}
 */
var countPartitions = function(nums) {
    // Step 1: Compute the total sum of the array.
    // We'll use this to quickly calculate the right subarray sum at each partition.
    let totalSum = 0;
    for (let num of nums) {
        totalSum += num;
    }

    // Step 2: Initialize variables
    let leftSum = 0;        // running sum of the left subarray
    let count = 0;          // number of valid partitions

    // Step 3: Iterate through