Cacher is the code snippet organizer for pro developers

Whirlispring Broom = For Balanced early game flight/travel
Back Slot Curios

reliquified_ars_nouveau:whirling_broom

Eats 66 Mana from Ars Nouveau (Try to buff to 25)

/**
 * Calculates the maximum number of distinct elements that can be formed
 * by modifying each number within a range of ±k.
 *
 * @param {number[]} nums - Array of integers.
 * @param {number} k - Maximum allowed change per element.
 * @return {number} - Maximum number of distinct elements achievable.
 */
var maxDistinctElements = function(nums, k) {
    // Sort the array to group duplicates and process in ascending order
    nums.sort((a, b) => a - b);

    let prevValue = -Infinity; // Trac

<div class="grid">
  <p class="_item">Item 1</p>
  <p class="_item">Item 2</p>
  <p class="_item">Item 3</p>
  <p class="_item">Item 4</p>
  <p class="_item">Item 5</p>
  <p class="_item">Item 6</p>
  <p class="_item">Item 7</p>
  <p class="_item">Item 8</p>
  <p class="_item">Item 9</p>
  <p class="_item">Item 10</p>
</div>

casting:molten_experience
justdirethings:xp_fluid_source
pneumaticcraft:memory_essence

ctov:village_plains_fortified
ctov:village_plains
ctov:village_beach

/**
 * Calculates the maximum number of partitions after performing operations
 * that allow up to `k` distinct characters per partition.
 *
 * @param {string} s - Input string consisting of lowercase letters.
 * @param {number} k - Maximum number of distinct characters allowed per partition.
 * @return {number} - Maximum number of partitions achievable.
 */
var maxPartitionsAfterOperations = function(s, k) {
    const n = s.length;

    // L[i] stores [leftPartitions, leftMask, leftCount] for p

-Xms12G
-Xmx12G
-XX:+UnlockExperimentalVMOptions
-XX:+UseG1GC
-XX:+ParallelRefProcEnabled
-XX:MaxGCPauseMillis=50
-XX:+DisableExplicitGC
-XX:+AlwaysPreTouch
-XX:G1NewSizePercent=30
-XX:G1MaxNewSizePercent=40
-XX:G1HeapRegionSize=16M
-XX:G1ReservePercent=20
-XX:InitiatingHeapOccupancyPercent=15
-XX:G1MixedGCCountTarget=4
-XX:G1MixedGCLiveThresholdPercent=90
-XX:G1RSetUpdatingPauseTimePercent=5
-XX:SurvivorRatio=8
-XX:MaxTenuringThreshold=15
-XX:SoftRefLRUPolicyMSPerMB=10000
-XX

{% comment %}
  Helper: retrieves all values for a given query key from the current URL.

  Usage:
  {% render 'get-parameter-from-url', key: 'filter.p.m.attributes.apparel_size' %}
{% endcomment %}

{%- liquid
  # Capture page URL from header
  capture content_for_query_string
    echo content_for_header
  endcapture

  # Extract path after shop domain
  assign page_url = content_for_query_string | split: '"pageurl":"' | last | split: '"' | first | split: '.myshopify.com' | last | replace: '\/'

// backend/b2bCheckoutTest.web.js
import { Permissions, webMethod } from 'wix-web-module';
import wixStores from 'wix-stores-backend';
import { contacts } from 'wix-crm-backend';
import wixFetch from 'wix-fetch';
import { getSecret } from 'wix-secrets-backend';

/* ---------------------------------- Helpers ---------------------------------- */

function pseudoUuid() {
  return 'xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx'.replace(/[xy]/g, c => {
    const r = (Math.random() * 16) | 0; // es

select
	[Superseded].Title [Superseded Title]
	, [Superseded].CI_ID [Superseded CI_ID]
	, [Superseded].CI_UniqueID [Superseded CI_UniqueID]
	, [Superseded].ArticleID [Superseded ArticleID]
	, [Superseded].InfoURL [Superseded InfoURL]

	, [Superseding].Title [Superseding Title]
	, [Superseding].CI_ID [Superseding CI_ID]
	, [Superseding].CI_UniqueID [Superseding CI_UniqueID]
	, [Superseding].ArticleID [Superseding ArticleID]
	, [Superseding].InfoURL [Superseding InfoURL]

	, [PSCmd] =

import { session } from 'wix-storage-frontend';
import { currentMember } from 'wix-members-frontend';
import wixLocation from 'wix-location';
import { computeDiscount } from 'backend/utils/discount';
import { shippingNet } from 'backend/utils/shipping';
import {
  createDealerOrderFromProfile,
  fetchMemberDefaultAddress
} from 'backend/b2bCheckout.web';

const CART_KEY = 'b2bCart';
const LAST_ORDER_KEY = 'b2bLastOrder';

function getCart() {
  try {
    return JSON.parse(session.

ALGORITHM DijkstraNFLStadiums(stadiums, distances, startStadium, endStadium)
INPUT:
    - stadiums: list of all stadium names
    - distances: matrix of distances between stadiums
    - startStadium: starting stadium name
    - endStadium: destination stadium name
OUTPUT:
    - shortest path as list of stadium names
    - total distance in miles

BEGIN
    // Initialize data structures
    distanceMap = empty map
    previousStadium = empty map
    unvisitedStadiums = set of all stadiums
    vis

This script conditionally loads an external JavaScript file only when certain UI elements (header/footer) are missing, helping avoid duplicate or conflicting scripts on pages that already include them.

```// Creates and injects a script tag into the page
const initialize = () => {
  const script = document.createElement("script");
  script.id = "footer-header-script";           // Unique ID to prevent duplicate injection
  script.type = "text/javascript";
  script.src = "https://www.example.com

function ConvertFrom-ByteArray {
    [CmdletBinding()]
    param (
        [Alias('appid')]
        [Parameter(Mandatory = $true, Position = 0, ValueFromPipeline = $true, ValueFromPipelineByPropertyName = $true)]
        [byte[]]
        $byteArray
    )
    
    begin {}

    process {
        try {
            [System.Text.Encoding]::UTF8.GetString($byteArray)
        }
        catch {
            throw $_
        }
    }

    end {}
}

/**
 * @param {number[]} nums
 * @param {number} value
 * @return {number}
 */
var findSmallestInteger = function(nums, value) {
    // Step 1: Create a frequency map to count how many times each remainder appears
    const freq = new Map();

    for (let num of nums) {
        // Normalize the remainder to always be non-negative
        let mod = ((num % value) + value) % value;

        // Count how many times each remainder appears
        freq.set(mod, (freq.get(mod) || 0) + 1);
    }

    /

PLUGINS

• https://www.kadencewp.com/kadence-blocks/
• https://www.kadencewp.com/kadence-blocks/