Cacher is the code snippet organizer for pro developers

<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

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

# Your rule content
When creating code in JavaScript use functional programing best practices esp when creating new code, so it should look like this: you are given a task, you then create a scratchpad.md and use that for you thought process and computations, use it to work through the tasks in a logical manor in order unless you have a good reason to do so . after you code for a task is complete, test said code, if it passes , go to next task and repseat if not loop around and refactor , test a

from qgis.core import QgsGeometry, QgsPoint, QgsProject

layer = QgsProject.instance().mapLayersByName('test')[0]

layer.startEditing()

for f in layer.getFeatures():
    geom = f.geometry()

    # sécurité : seulement LineString
    if geom.isMultipart():
        continue

    pts = geom.constGet().points()
    dist = 0.0
    new_pts = []

    for i, p in enumerate(pts):
        if i > 0:
            dist += pts[i-1].distance(p)
        new_pts.append(QgsPoint(p.x(), p.y(), 

/**
 * @param {number[]} arr
 * @return {number[][]}
 */
var minimumAbsDifference = function(arr) {
    // Step 1: Sort the array so that minimum absolute difference
    // must occur between adjacent elements.
    arr.sort((a, b) => a - b);

    let minDiff = Infinity;     // Track the smallest difference found
    const result = [];          // Store all pairs that match minDiff

    // Step 2: First pass - find the minimum adjacent difference
    for (let i = 0; i < arr.length - 1; i++) {
   

	// maps.Equal(map1, map2) bool
	myMap2 := map[string]string{
		"name":    "Alice",
		"country": "Wonderland",
	}
	fmt.Println("Second map:", myMap2)

	myMap3 := map[string]string{
		"name":    "Alice",
		"country": "Wonderland",
	}

	if maps.Equal(myMap2, myMap3) {
		fmt.Println("Maps are equal")
	} else {
		fmt.Println("Maps are not equal")
	}

// syntax: mapLiteral := map[keyType]valueType{ key1: value1, key2: value2, }
	myMap2 := map[string]string{
		"name":    "Alice",
		"country": "Wonderland",
	}
	fmt.Println("Second map:", myMap2)

	myMap := make(map[string]int)
	myMap["key1"] = 15
	myMap["key2"] = 100
	myMap["key3"] = 7
	myMap["key4"] = 23

	value, exists := myMap["key1"]
	fmt.Println("Value for key1:", value, "Exists:", exists) //Value for key1: 15 Exists: true
	valueOfKey10, existsKey10 := myMap["key10"]
	fmt.Println("Value for key10:", valueOfKey10, "Exists:", existsKey10) // Value for key10: 0 Exists: false

	myMap := make(map[string]int)
	myMap["key1"] = 15
	myMap["key2"] = 100
	myMap["key3"] = 7
	myMap["key4"] = 23
	// clear syntax: clear(mapVariable)
	clear(myMap)
	fmt.Println("Map after clearing:", myMap)

	// delete syntax: delete(mapVariable, key)
	myMap := make(map[string]int)
	myMap["key1"] = 9
	delete(myMap, "key1")

/**
 * @param {number[]} nums
 * @param {number} k
 * @return {number}
 */
var minimumDifference = function(nums, k) {
    // If k is 1, picking a single student always gives difference = 0
    if (k === 1) return 0;

    // Sort scores so close values sit next to each other
    nums.sort((a, b) => a - b);

    // We'll track the smallest range found
    let minDiff = Infinity;

    // Slide a window of size k across the sorted array
    // Window goes from index i to i + k - 1
    for (let i = 

# Joomla
RewriteCond %{REQUEST_URI} ^/media/yootheme
# WordPress
RewriteCond %{REQUEST_URI} ^/wp-content/uploads/yootheme
RewriteCond %{REQUEST_FILENAME} !-f
RewriteCond %{REQUEST_FILENAME} !-d
RewriteRule ^.*$ /index.php [L,NC]

/**
 * @param {number[]} nums
 * @return {number}
 */
var minPairSum = function(nums) {
    // Step 1: Sort the array so we can pair smallest with largest
    nums.sort((a, b) => a - b);

    let left = 0;                   // pointer to smallest element
    let right = nums.length - 1;    // pointer largest element
    let maxPairSum = 0;             // track the maximum pair sum we create

    // Step 2: Pair elements from both end moving inward
    while (left < right) {
        const pairSum

Review the current changes staged to be commit by running `git diff HEAD` and then write an appropriate git message for these changes and be sure to adhere to the guidlines in `CONTRIBUTING.md`.

<div class="container">
  <div class="ornament-container">
    <svg
      class="ornament-svg"
      preserveAspectRatio="none"
      width="1440"
      height="80"
      viewBox="0 0 1440 80"
      fill="none"
      xmlns="http://www.w3.org/2000/svg"
    >
      <path class="ornament-path" fill="#E60019" />
    </svg>
  </div>
</div>

<div class="gradient-border">
  Lorem ipsum dolor sit amet, consectetur adipiscing elit. Donec id ultrices arcu.
</div>