thiscodeWorks - Saving, organizing & sharing the best of code online

const renameKeys = (keysMap, obj) =>
  Object.keys(obj).reduce(
    (acc, key) => ({
      ...acc,
      ...{ [keysMap[key] || key]: obj[key] }
    }),
    {}
  );
EXAMPLES
const obj = { name: 'Bobo', job: 'Front-End Master', shoeSize: 100 };
renameKeys({ name: 'firstName', job: 'passion' }, obj); // { firstName: 'Bobo', passion: 'Front-End Master', shoeSize: 100 }

#css

Text Rotation in CSS

@Bubbly

 .rotate {

  transform: rotate(-90deg);


  /* Legacy vendor prefixes that you probably don

#python #python #lists #dictionary

Convert two lists into a dictionary

@TrickyMind

keys, values)) # {'a': 2, 'c': 4, 'b': 3}
 
 
#make a function: def is the keyword for the function:
def to_dictionary(keys, values):
 
 
#return is the keyword that tells program that function has to return value   
return dict(zip(keys, values))
 
  
 
# keys and values are the lists:
 
keys = ["a", "b", "c"]   
 
values = [2, 3, 4]

#java #java #2dchar array

How do you check a row in a 2D char array for a specific element and then count how many of that element are in the row? (Java)

@Gameron

private boolean oneQueenPerRow() {
    int foundQueens;
    for (int i = 0; i < board.length; i++) {
        foundQueens = 0;//each loop is a checked row
        for (int j = 0; j < board.length; j++) {
            if (board[i][j] == QUEEN)
                foundQueens++;
        }
        if (foundQueens > 1) return false;
    }
    return true;
}

#python ##python #strings #comments

Create simple string along with variables

@amn2jb

#assign a value to a variable:
types_of_people = 10 
# make a string using variable name:
X = f “there are {types_of_people} types of people.”

Output:
There are 10 types of people

#javascript #nodejs #handlebars #express

Pagination Helper for Handlebars - Node.js Express

@billion_bill

https://gist.github.com/trantorLiu/5924389

#html #javascript #jsfunctions #dom #dommanipulation

How to change any attribute of a HTML element

@_right_away_

<html>	
   
   <input id="contact" name="address">
 
 <script>

    document.getElementById("contact").attribute = "phone";
	
    //ALTERNATIVE METHOD TO CHANGE
    document.getElementById("contact").setAttribute('name', 'phone');	

  </script>

</html>

#css #layout

Centering Things with CSS Auto Margin

@_fools_dev_one_

.box-one {
	width: 100px;
	margin: 0 auto;
}

.box-two {
	width: 100px;
	margin-left: auto;
    margin-right: auto;
}

Wordpress footer code for automatically updating year for copyright text

@lbrand

Copyright <script>document.write(new Date().getFullYear())</script>  All rights reserved -

#html #basics #htmltags #seo

HTML Heading Tags <h1> to <h6>

@toast-ghost

<h1>This is heading 1</h1>
<h2>This is heading 2</h2>
<h3>This is heading 3</h3>
<h4>This is heading 4</h4>
<h5>This is heading 5</h5>
<h6>This is heading 6</h6>

#css #webdev #text

How to "truncate" long strings with an ellipsis (...) for text that overflows its container

@billion_bill

.truncate {
  width: 250px;
  white-space: nowrap;
  overflow: hidden;
  text-overflow: ellipsis;
}

#wix #howto

How to expand and collapse elements inside repeaters in Wix

@mishka

$w.onReady(function () {
	$w('#collapsedelement').collapse();
    $w('#closebtn').hide();
});

export function openbtn_click(event) {
	let $item = $w.at(event.context);

	if ($item("#collapsedelement").collapsed) {
		$item("#collapsedelement").expand();
		$item('#openbtn').hide();
		$item('#closebtn').show();

	} else {
		$item("#collapsedelement").collapse();
		$item('#openbtn').show();
		$item('#closebtn').hide();
	}
}

export function closebtn_click(event) {
	let $item = $w.at(event.context);

	if ($item("#collapsedelement").collapsed) {
		$item("#collapsedelement").expand();
		$item('#openbtn').hide();
		$item('#closebtn').show();

	} else {
		$item("#collapsedelement").collapse();
		$item('#openbtn').show();
		$item('#closebtn').hide();
	}
}

#java #logic #algorithms #interesting #arrays

Flood Fill Algorithm: Like the bucket tool in Paint app but for multi-dimensional arrays

@logicloss01

import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Queue;

class Pair {
    int x, y;

    public Pair(int x, int y) {
        this.x = x;
        this.y = y;
    }
}

class FloodFill
{
    // Below arrays details all 8 possible movements
    private static final int[] row = { -1, -1, -1, 0, 0, 1, 1, 1 };
    private static final int[] col = { -1, 0, 1, -1, 1, -1, 0, 1 };

    // check if it is possible to go to pixel (x, y) from
    // current pixel. The function returns false if the pixel
    // has different color or it is not a valid pixel
    public static boolean isSafe(char[][] M, int m, int n,
                                int x, int y, char target)
    {
        return x >= 0 && x < m && y >= 0 && y < n
                && M[x][y] == target;
    }

    // Flood fill using BFS
    public static void floodfill(char[][] M, int x, int y, char replacement)
    {
        int m = M.length;
        int n = M[0].length;

        // create a queue and enqueue starting pixel
        Queue<Pair> q = new ArrayDeque<>();
        q.add(new Pair(x, y));

        // get target color
        char target = M[x][y];

        // run till queue is not empty
        while (!q.isEmpty())
        {
            // pop front node from queue and process it
            Pair node = q.poll();

            // (x, y) represents current pixel
            x = node.x;
            y = node.y;

            // replace current pixel color with that of replacement
            M[x][y] = replacement;

            // process all 8 adjacent pixels of current pixel and
            // enqueue each valid pixel
            for (int k = 0; k < row.length; k++)
            {
                // if adjacent pixel at position (x + row[k], y + col[k]) is
                // a valid pixel and have same color as that of current pixel
                if (isSafe(M, m, n, x + row[k], y + col[k], target))
                {
                    // enqueue adjacent pixel
                    q.add(new Pair(x + row[k], y + col[k]));
                }
            }
        }
    }

    public static void main(String[] args)
    {
        // matrix showing portion of the screen having different colors
        char[][] M = {
            "YYYGGGGGGG".toCharArray(),
            "YYYYYYGXXX".toCharArray(),
            "GGGGGGGXXX".toCharArray(),
            "WWWWWGGGGX".toCharArray(),
            "WRRRRRGXXX".toCharArray(),
            "WWWRRGGXXX".toCharArray(),
            "WBWRRRRRRX".toCharArray(),
            "WBBBBRRXXX".toCharArray(),
            "WBBXBBBBXX".toCharArray(),
            "WBBXXXXXXX".toCharArray()
        };

        // start node
        int x = 3, y = 9;   // target color = "X"

        // replacement color
        char replacement = 'C';

        // replace target color with replacement color
        floodfill(M, x, y, replacement);

        // print the colors after replacement
        for (int i = 0; i < M.length; i++) {
            System.out.println(Arrays.toString(M[i]));
        }
    }
}

#python #interesting #arrays #sorting #interviewquestions

Sorting an array without changing position of negative numbers

@divisionjava

# Python3 implementation of the approach 

# Function to sort the array such that 
# negative values do not get affected 
def sortArray(a, n): 

	# Store all non-negative values 
	ans=[] 
	for i in range(n): 
		if (a[i] >= 0): 
			ans.append(a[i]) 

	# Sort non-negative values 
	ans = sorted(ans) 

	j = 0
	for i in range(n): 

		# If current element is non-negative then 
		# update it such that all the 
		# non-negative values are sorted 
		if (a[i] >= 0): 
			a[i] = ans[j] 
			j += 1

	# Print the sorted array 
	for i in range(n): 
		print(a[i],end = " ") 


# Driver code 

arr = [2, -6, -3, 8, 4, 1] 

n = len(arr) 

sortArray(arr, n)

#commandline #git #github #howto

Cloning a Github Repository with git

@frogblog

$ git clone https://github.com/YOUR-USERNAME/YOUR-REPOSITORY

#javascript

How to Get Current Year in Javascript

@mishka

var d = new Date();
var n = d.getFullYear();

#java

How to efficiently iterate over each entry in a Java Map

Map<String, String> map = ...
for (Map.Entry<String, String> entry : map.entrySet()) {
    System.out.println(entry.getKey() + "/" + entry.getValue());
}

#javascript

Live Search Bar on Website

@mishka

(function(){
    //
    var $posts = $('#posts li');
    var $search = $('#search');
    var cache = [];

    $posts.each(function(){
        cache.push({
            element: this,
            title: this.title.trim().toLowerCase(),
        });
    });

    function filter(){
        var query = this.value;
        console.log("query is "+query);
        cache.forEach(function(post){
            var index = 0;

            if (query) {
                index = post.title.indexOf(query);

            }
            var results = document.getElementsByClassName('search-results');
            results.innerHTML = "<li>"+cache.title+"</li>";
            post.element.style.display = index === -1 ? 'none' : '';
        });
    }

   if ('oninput' in $search[0]){
        $search.on('input', filter);
    } else {
        $search.on('keyup', filter);
    }

}());

#java

Print Nested Array in Java

String[][] deepArray = new String[][] {{"John", "Mary"}, {"Alice", "Bob"}};
System.out.println(Arrays.toString(deepArray));
//output: [[Ljava.lang.String;@106d69c, [Ljava.lang.String;@52e922]
System.out.println(Arrays.deepToString(deepArray));

#english

Migrate SharePoint Site to another Site

@petergrew

https://www.shoviv.com/blog/how-to-migrate-sharepoint-site-to-another-site/

Automate Exporting all Components in an Excel Project | Experts Exchange

@acassell

Option Explicit
                      'Remember to add a reference to Microsoft Visual Basic for Applications Extensibility 
                      'Exports all VBA project components containing code to a folder in the same directory as this spreadsheet.
                      Public Sub ExportAllComponents()
                          Dim VBComp As VBIDE.VBComponent
                          Dim destDir As String, fName As String, ext As String 
                          'Create the directory where code will be created.
                          'Alternatively, you could change this so that the user is prompted
                          If ActiveWorkbook.Path = "" Then
                              MsgBox "You must first save this workbook somewhere so that it has a path.", , "Error"
                              Exit Sub
                          End If
                          destDir = ActiveWorkbook.Path & "\" & ActiveWorkbook.Name & " Modules"
                          If Dir(destDir, vbDirectory) = vbNullString Then MkDir destDir
                          
                          'Export all non-blank components to the directory
                          For Each VBComp In ActiveWorkbook.VBProject.VBComponents
                              If VBComp.CodeModule.CountOfLines > 0 Then
                                  'Determine the standard extention of the exported file.
                                  'These can be anything, but for re-importing, should be the following:
                                  Select Case VBComp.Type
                                      Case vbext_ct_ClassModule: ext = ".cls"
                                      Case vbext_ct_Document: ext = ".cls"
                                      Case vbext_ct_StdModule: ext = ".bas"
                                      Case vbext_ct_MSForm: ext = ".frm"
                                      Case Else: ext = vbNullString
                                  End Select
                                  If ext <> vbNullString Then
                                      fName = destDir & "\" & VBComp.Name & ext
                                      'Overwrite the existing file
                                      'Alternatively, you can prompt the user before killing the file.
                                      If Dir(fName, vbNormal) <> vbNullString Then Kill (fName)
                                      VBComp.Export (fName)
                                  End If
                              End If
                          Next VBComp
                      End Sub

String contains

@Subha

class ContainsExample{
public static void main(String args[]){
String name="what do you know about me";
System.out.println(name.contains("do you know"));
System.out.println(name.contains("about"));
System.out.println(name.contains("hello"));
}}

#asset #tokenization

How much does it cost to tokenize an asset?

@Ameliasebastian


The cost of tokenizing an asset can vary widely depending on several factors, including the type of asset, the complexity of the tokenization process, and the asset tokenization company you choose to work with. Generally, fees can range from $10,000 to over $100,000. 

Basic costs include legal fees for compliance and regulations, smart contract development, and integration with blockchain platforms. For instance, tokenizing real estate might require extensive legal reviews and property evaluations, increasing costs. Additionally, ongoing costs for maintaining and managing the tokens, such as custody and reporting, should be considered.

Selecting an experienced asset tokenization company can ensure a smoother process, but it may come at a premium. Businesses looking to tokenize assets should prepare for initial setup costs and ongoing maintenance expenses to ensure successful and compliant asset tokenization.

(6) Facebook

@milliontrillion

To Do This	Use Command
Enter or exit fullscreen
ff
Previous photo
jj
Next photo
kk
Like photo
ll

Advanced toggling with 3rd param of force

@davidmchale

// toogle class that takes in the element, the class we want to toggle and force
//force can be set to or false to set the class to show always
const toggleClass = (element, className, force) => {
        element.classList.toggle(className, force);
    };


// were using this function to hide and show on an element that is clicked only
// this is why current target is passed into the function,
// the second param we are also passing force, but setting to true so 
const toggleSpan = (currentTarget, force = true) => {
        const compareBlock = currentTarget.closest(".compare-block");
        const currentSpan = compareBlock.querySelector("span");
        toggleClass(currentSpan, "show", force);
        if (currentSpan.className.indexOf("show") > -1) {
            currentSpan.setAttribute("aria-hidden", "false");
        } else {
            currentSpan.setAttribute("aria-hidden", "true");
        }
    };


compareBtns.forEach((button) => toggleSpan(button, false));

Creating Dynamic filtering using JSON

@davidmchale

import data from "./data.json"; // this is the json data

// the json data looks like this

{
  "locations": {

    "brisbaneCityLibrary": {
      "name": "Brisbane City Library",
      "lat": -27.4710107,
      "lng": 153.0234489,
      "website": "https://www.brisbane.qld.gov.au/facilities-recreation/cultural/brisbane-city-library",
      "tel": "+61 7 3403 8888",
      "email": "library@brisbane.qld.gov.au",
      "category": "Library"
    },
    "goldCoastCommunityCentre": {
      "name": "GoldCoast Community Centre",
      "lat": -28.016667,
      "lng": 153.399994,
      "website": "https://www.goldcoast.qld.gov.au/community/community-centres",
      "tel": "+61 7 5667 5973",
      "email": "community@goldcoast.qld.gov.au",
      "category": "Training"
    },
  }

(function () {
  "use strict";

  // Variables
  const dummyData = data.locations; // this pulling the locations from the json data
  const checkboxesWrapper = document.querySelector(".checkers");
  const list = document.querySelector(".filtered-list");
  let filteredItems = [];
  let selectedCategories = [];

  // Get specific data needed from the API and return a new array of data
  function getListData(data) {
    if (!data) return [];
    return Object.entries(data).map(([index, item]) => ({
      name: item.name,
      category: item.category,
      web: item.website,
    }));
  }

  // Generate HTML for each item
  function itemHTML({ name, category, web }) {
    return `
      <li>
        <h3>${name}</h3>
        <p>Category: ${category}</p>
        <p>Website: <a href="${web}" target="_blank" rel="noopener noreferrer">${web}</a></p>
      </li>`;
  }

  // Generate HTML for checkboxes
  function checkboxHTML(category) {
    return `
      <label>
        <input type="checkbox" class="filter-checkbox" name="checkbox" role="checkbox" value="${category}"/>
        ${category}
      </label>`;
  }

  // Display checkboxes in the DOM
  function displayCheckBoxes(array) {
    const data = getListData(array);
    console.log(data);
    const allCategories = data.map((item) => item.category).filter(Boolean);
    const categories = [...new Set(allCategories)]; // Remove duplicates and ret

    const checkBoxHTML = categories.map(checkboxHTML).join("");
    checkboxesWrapper.innerHTML = checkBoxHTML; // Replace content
  }

  // Display items in the DOM
  function displayitems() {
    const itemData = getListData(
      filteredItems.length > 0 ? filteredItems : dummyData
    );

    const listHTML = itemData.map(itemHTML).join("");
    list.innerHTML = listHTML; // Replace content
  }

  // Check if a value exists in an array
  function isValueInArray(array, valueToCheck) {
    return array.some((item) => item === valueToCheck);
  }

  // Handle checkbox changes
  function onHandleCheck(box) {
    if (!box) return;

    box.addEventListener("change", function (e) {
      const { currentTarget } = e;
      const catValue = currentTarget.value.toLowerCase(); // Get the category value from the checkbox clicked
      const isChecked = currentTarget.checked; // Get true or false if the checkbox is clicked or not

      const isExisting = isValueInArray(selectedCategories, catValue);

      console.log({ catValue, isChecked, isExisting });

      // Add to array if checked and not already existing
      if (isChecked && !isExisting) {
        selectedCategories.push(catValue);
      }

      // Remove if unchecked and category exists
      if (!isChecked && isExisting) {
        selectedCategories = selectedCategories.filter(
          (cat) => cat !== catValue
        );
      }

      console.log({ selectedCategories });

      // Filter items based on selected categories
      filteredItems = Object.values(dummyData).filter((item) =>
        selectedCategories.includes(item.category.toLowerCase())
      );

      // Update the displayed items
      displayitems();
    });
  }

  // Initialize the application
  function init() {
    // Initially populate checkboxes based on all categories from dummyData
    displayCheckBoxes(dummyData);
    // Initially populate the list of items based on dummyData
    displayitems();

    const domCheckBoxes = document.querySelectorAll(".filter-checkbox");
    if (!domCheckBoxes) return;
    domCheckBoxes.forEach(onHandleCheck);
  }

  init();
})();

##python #coding #python

How to Encrypt and Decrypt Data in SQLite with Python's Fernet

@freepythoncode

from cryptography.fernet import Fernet
import sqlite3

# Generate key to use it
#print(Fernet.generate_key())

key = b'rMqQ4gNSsvkubQnn9CmW25PTFDwNlQPUp7YN4qDVSts='
cipher_suite = Fernet(key)

db_name = 'mydb.db'

conn = sqlite3.connect(db_name)
cursor = conn.cursor()

# create a table
cursor.execute('create table if not exists items (name STRING, price INTEGER)')

def add_item(name, price):
    name = cipher_suite.encrypt(name.encode())
    price = cipher_suite.encrypt(str(price).encode())

    cursor.execute('insert into items (name, price) values (?, ?)', (name, price))

    conn.commit()

add_item('test', 50)

def get_items():
    results = cursor.execute('select * from items').fetchall()
    for item in results:
        name = cipher_suite.decrypt(item[0]).decode()
        price = cipher_suite.decrypt(item[1]).decode()
        print(name, price)

get_items()

#flow #salesforce #slds

Query all Content Document Link

@dannygelf

SELECT Id, ContentDocumentId, LinkedEntityId, ShareType, Visibility 
FROM ContentDocumentLink 
WHERE ContentDocumentId IN (SELECT Id FROM ContentDocument)

max fps

@enojiro7

{
  "FFlagAXAccessoryAdjustment": "True",
  "FFlagAddArialToLegacyContent": "False",
  "FFlagAccessoryAdjustmentEnabled3": "True",
  "FIntDebugForceMSAASamples": "1",
  "DFFlagESGamePerfMonitorEnabled": "False",
  "FFlagEnableV3MenuABTest3": "False",
  "FFlagLuaAppsEnableParentalControlsTab": "False",
  "FFlagVoiceBetaBadge": "false",
  "FFlagDebugDisableTelemetryV2Event": "True",
  "FFlagDebugDisableTelemetryV2Counter": "True",
  "DFFlagDebugPerfMode": "True",
  "FIntMeshContentProviderForceCacheSize": "268435456",
  "FIntFRMMinGrassDistance": "0",
  "FIntTerrainOTAMaxTextureSize": "1024",
  "FFlagDebugDisableTelemetryEphemeralStat": "True",
  "FFlagRenderPerformanceTelemetry": "False",
  "FFlagEnableNewFontNameMappingABTest2": "False",
  "FIntRenderShadowIntensity": "0",
  "FFlagAXAccessoryAdjustmentIXPEnabledForAll": "True",
  "FIntRenderGrassDetailStrands": "0",
  "FFlagTopBarUseNewBadge": "false",
  "FIntFullscreenTitleBarTriggerDelayMillis": "3600000",
  "FFlagAdServiceEnabled": "False",
  "FIntStartupInfluxHundredthsPercentage": "0",
  "FFlagEnableInGameMenuControls": "True",
  "FFlagEnableReportAbuseMenuRoactABTest2": "False",
  "FIntUITextureMaxRenderTextureSize": "1024",
  "FFlagEnableInGameMenuChromeABTest3": "False",
  "FFlagEnableVisBugChecks27": "True",
  "FFlagNullCheckCloudsRendering": "True",
  "FFlagDebugSkyGray": "True",
  "FFlagDebugDisableTelemetryEphemeralCounter": "True",
  "DFIntAvatarFaceChatHeadRollLimitDegrees": "360",
  "FIntRenderLocalLightUpdatesMin": "1",
  "FFlagPreloadTextureItemsOption4": "True",
  "FIntRenderLocalLightUpdatesMax": "1",
  "DFIntUserIdPlayerNameLifetimeSeconds": "86400",
  "FFlagFixGraphicsQuality": "True",
  "DFFlagUseVisBugChecks": "True",
  "FStringVoiceBetaBadgeLearnMoreLink": "null",
  "FIntHSRClusterSymmetryDistancePercent": "10000",
  "FFlagEnableReportAbuseMenuRoact2": "false",
  "FFlagDebugDisableOTAMaterialTexture": "true",
  "FFlagGraphicsGLEnableSuperHQShadersExclusion": "False",
  "FFlagEnableMenuControlsABTest": "False",
  "FFlagLuaAppUseUIBloxColorPalettes1": "true",
  "FFlagDisableFeedbackSoothsayerCheck": "False",
  "FFlagEnableQuickGameLaunch": "False",
  "FIntDefaultMeshCacheSizeMB": "256",
  "FIntFRMMaxGrassDistance": "0",
  "FFlagAddGothamToLegacyContent": "False",
  "FFlagPreloadMinimalFonts": "True",
  "DFIntTimestepArbiterThresholdCFLThou": "300",
  "FFlagUserHideCharacterParticlesInFirstPerson": "True",
  "FFlagAXAccessoryAdjustmentIXPEnabled": "True",
  "FFlagControlBetaBadgeWithGuac": "false",
  "FFlagEnableInGameMenuModernization": "True",
  "FFlagEnableMenuModernizationABTest2": "False",
  "FFlagDebugDisableTelemetryEventIngest": "True",
  "FIntReportDeviceInfoRollout": "0",
  "FFlagTaskSchedulerLimitTargetFpsTo2402": "False",
  "FIntCameraMaxZoomDistance": "99999",
  "FIntRobloxGuiBlurIntensity": "0",
  "DFIntAssetPreloading": "9999999",
  "FFlagLuaAppEnableFoundationColors": "True",
  "FFlagGraphicsSettingsOnlyShowValidModes": "True",
  "FFlagUIBloxUseNewThemeColorPalettes": "true",
  "FFlagPreloadAllFonts": "True",
  "FFlagEnableMenuModernizationABTest": "False",
  "FFlagLuaAppChartsPageRenameIXP": "False",
  "FFlagEnableBetterHapticsResultHandling": "True",
  "FFlagRenderGpuTextureCompressor": "True",
  "FFlagEnableNewInviteMenuIXP2": "False",
  "FFlagDebugDisableTelemetryV2Stat": "True",
  "FFlagEnableReportAbuseMenuLayerOnV3": "false",
  "FFlagGraphicsGLEnableHQShadersExclusion": "False",
  "FFlagDebugGraphicsPreferD3D11": "True",
  "FFlagRenderCheckThreading": "True",
  "FFlagEnableBetaBadgeLearnMore": "false",
  "FFlagDebugDisableTelemetryPoint": "True",
  "DFIntNumAssetsMaxToPreload": "9999999",
  "FFlagEnableInGameMenuChromeABTest2": "False",
  "FFlagAXAvatarFetchResultCamelCase": "True",
  "FIntTerrainArraySliceSize": "0",
  "FFlagEnableInGameMenuChrome": "False",
  "FFlagDisablePostFx": "True",
  "FFlagBetaBadgeLearnMoreLinkFormview": "false",
  "FFlagEnableFavoriteButtonForUgc": "true",
  "FFlagEnableAudioOutputDevice": "false",
  "DFFlagDisableDPIScale": "True",
  "FFlagUIBloxDevUseNewFontNameMapping": "False",
  "FFlagEnableCommandAutocomplete": "False",
  "FFlagRenderFixFog": "True",
  "FIntEnableVisBugChecksHundredthPercent27": "100",
  "FFlagUpdateHealthBar": "True",
  "FIntGameGridFlexFeedItemTileNumPerFeed": "0",
  "FIntGrassMovementReducedMotionFactor": "0",
  "FFlagLuaAppGenreUnderConstruction": "False",
  "FFlagChatTranslationEnableSystemMessage": "False",
  "FFlagToastNotificationsProtocolEnabled2": "False",
  "DFIntDebugFRMQualityLevelOverride": "1"
}

End of Year Events - 2024

@FOHWellington

{
	"blocks": [
		{
			"type": "header",
			"text": {
				"type": "plain_text",
				"text": "✨ :magic_wand::xero-unicorn: End of Year Celebration – A Sprinkle of Magic! :xero-unicorn: :magic_wand:✨",
				"emoji": true
			}
		},
		{
			"type": "section",
			"text": {
				"type": "mrkdwn",
				"text": "*Hi Melbourne!* \nGet ready to wrap up the year with a sprinkle of magic and a lot of fun at our End of Year Event! Here’s everything you need to know:"
			}
		},
		{
			"type": "divider"
		},
		{
			"type": "section",
			"fields": [
				{
					"type": "mrkdwn",
					"text": "*📅 When:*\nThursday 28th November"
				},
				{
					"type": "mrkdwn",
					"text": "*📍 Where:*\n<https://www.google.com/maps/place/The+Timber+Yard/@-37.8331021,144.918894,17z/data=!3m1!4b1!4m6!3m5!1s0x6ad667735e56fcab:0x966480f06c58c00c!8m2!3d-37.8331021!4d144.9214743!16s/g/11gyy7sy4c?entry=ttu&g_ep=EgoyMDI0MDkxOC4xIKXMDSoASAFQAw==/|*The Timber Yard*> \n351 Plummer Street, Port Melbourne"
				},
				{
					"type": "mrkdwn",
					"text": "*⏰ Time:*\n4 PM - 10 PM"
				}
			]
		},
		{
			"type": "section",
			"text": {
				"type": "mrkdwn",
				"text": "*:magic_wand::xero-unicorn: Theme:*\n_A Sprinkle of Magic_ – Our theme is inspired by the Xero Unicorn, embracing creativity, inclusivity, and diversity. Expect unique decor, magical moments, and a fun-filled atmosphere!"
			}
		},
		{
			"type": "section",
			"text": {
				"type": "mrkdwn",
				"text": "*:dress: Dress Code:*\nSmart casual – Show your personality, but no Xero tees or lanyards, please!\nIf you're feeling inspired by the theme, why not add a little 'Sprinkle of Magic' to your outfit? Think glitter, sparkles, or anything that shows off your creative side! (Totally optional, of course! ✨)"
			}
		},
		{
			"type": "section",
			"text": {
				"type": "mrkdwn",
				"text": "*🚍 Transport Info:*\n*Public Transport:* Via bus routes 234 & 235 - 5 min walk from bus stop\n*Parking:* 200+ unmetered and untimed spaces on Plummer & Smith Street\n*Xero Chartered Bus:* 3:15 PM departure from the Melbourne office - opt-in via your email invite."
			}
		},
		{
			"type": "section",
			"text": {
				"type": "mrkdwn",
				"text": "*🎤 :hamburger: Entertainment & Food:*\nPrepare to be dazzled by live music, enchanting magic shows, cozy chill-out zones, delicious bites, refreshing drinks, and plenty of surprises! ✨🎶"
			}
		},
		{
			"type": "section",
			"text": {
				"type": "mrkdwn",
				"text": "*🎟 RSVP Now:*\nPlease click <https://xero-wx.jomablue.com/reg/store/eoy_mel|*here*> to RSVP!\nMake sure you RSVP by [insert RSVP deadline]!"
			}
		},
		{
			"type": "divider"
		},
		{
			"type": "section",
			"text": {
				"type": "mrkdwn",
				"text": ":question::question:Got questions? See the <https://docs.google.com/document/d/1iygJFHgLBRSdAffNsg3PudZCA45w6Wit7xsFxNc_wKM/edit|FAQs> doc or post in the Slack channel.\nWe can’t wait to celebrate with you! :partying_face: :xero-love:"
			}
		}
	]
}

dijkstra new ver 1

@LizzyTheCatto

#include <bits/stdc++.h>
using namespace std;

void D(int N, vector<pair<int, int>> adj[], int source) {
    vector<int> dist(N, 1000000); // Khởi tạo khoảng cách đến tất cả các đỉnh là vô cùng
    dist[source] = 0; // Khoảng cách từ đỉnh nguồn đến chính nó là 0
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq; // Hàng đợi ưu tiên
    pq.push({0, source});

    while (!pq.empty()) { // Trong khi hàng đợi không rỗng
        int u = pq.top().second; // Lấy đỉnh có khoảng cách nhỏ nhất
        int d = pq.top().first;   // Khoảng cách từ nguồn đến đỉnh u
        pq.pop();

        // Duyệt các đỉnh kề của đỉnh u
        for (int i = 0; i < adj[u].size(); i++) {
            int v = adj[u][i].first;     // Đỉnh kề
            int weight = adj[u][i].second; // Trọng số của cạnh

            // Nếu tìm được đường đi ngắn hơn đến đỉnh v
            if (dist[v] > dist[u] + weight) {
                dist[v] = dist[u] + weight;
                pq.push({dist[v], v}); // Đẩy khoảng cách mới vào hàng đợi
            }
        }
    }

    // In ra kết quả khoảng cách từ đỉnh nguồn đến tất cả các đỉnh khác
    for (int i = 0; i < N; i++) {
        cout << "Khoảng cách từ " << source << " đến " << i << " là " << dist[i] << endl;
    }
}

int main() {
    int N, M; // Số đỉnh, số cạnh
    cin >> N >> M;
    
    vector<pair<int, int>> adj[N]; // Mảng vector để lưu đồ thị
    for (int i = 0; i < M; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        adj[a].push_back({b, c}); // Đồ thị có hướng
        adj[b].push_back({a, c}); // Nếu đồ thị là vô hướng
    }

    int source;
    cin >> source;
    D(N, adj, source);

    return 0;
}

#python

choppystick/py-sudoku-solver: Python implementation of a Sudoku solver using Linear Programming (LP). The solver can handle Sudoku puzzles of varying difficulties and can find multiple solutions if they exist.

@Swietoslawa

git clone https://github.com/choppystick/py-sudoku-solver.git
cd sudoku-solver-lp

Webcam server is currently not running

@amccall23

camera_usb_options="-r 640x480 -f 10 -y"

##python #coding #python #programming #pydantic #uuid

how to make default uuid or id for pydantic model

@freepythoncode

from pydantic import BaseModel, Field
from uuid import UUID, uuid4

class item(BaseModel):
    name : str
    price : float
    item_id : UUID = Field(default_factory = uuid4)


items = []

for i in range(3):
    items.append(item(name = 'test', price = 20))


print(items)

Exnori • Wallets

@RJ45

https://exnori.com/wallets

#c++ #dsa #recursion #sorting #string #ratinamazeproblem

rat in a maze problem

@vishnu_jha

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

bool isSafe(int x, int y, int n, vector<vector<int>> visited,
            vector<vector<int>> &m) {
  if ((x >= 0 && x < n) && (y >= 0 && y < n) && visited[x][y] == 0 &&
      m[x][y] == 1) {
    return true;
  } else {
    return false;
  }
}

void solve(vector<vector<int>> &m, int n, vector<string> &ans, int x, int y,
           string path, vector<vector<int>> visited) {
  // you have reached x,y here

  // base case
  if (x == n - 1 && y == n - 1) {
    ans.push_back(path);
    return;
  }
  visited[x][y] = 1;

  // 4 choices D,L,R,U
  // down

  int newx = x + 1;
  int newy = y;
  if (isSafe(newx, newy, n, visited, m)) {
    path.push_back('D');
    solve(m, n, ans, newx, newy, path, visited);
    path.pop_back();
  }

  // left

  newx = x;
  newy = y - 1;
  if (isSafe(newx, newy, n, visited, m)) {
    path.push_back('L');
    solve(m, n, ans, newx, newy, path, visited);
    path.pop_back();
  }

  // right

  newx = x;
  newy = y + 1;
  if (isSafe(newx, newy, n, visited, m)) {
    path.push_back('R');
    solve(m, n, ans, newx, newy, path, visited);
    path.pop_back();
  }

  // up

  newx = x - 1;
  newy = y;
  if (isSafe(newx, newy, n, visited, m)) {
    path.push_back('U');
    solve(m, n, ans, newx, newy, path, visited);
    path.pop_back();
  }

  visited[x][y] = 0;
}

vector<string> findPath(vector<vector<int>> &m, int n) {
  vector<string> ans;
  if (m[0][0] == 0) {
    return ans;
  }
  int srcx = 0;
  int srcy = 0;

  vector<vector<int>> visited = m;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      visited[i][j] = 0;
    }
  }

  string path = "";
  solve(m, n, ans, srcx, srcy, path, visited);
  sort(ans.begin(), ans.end());
  return ans;
}

int main() {
  int n = 4;
  vector<vector<int>> m = {
      {1, 0, 0, 0}, {1, 1, 0, 1}, {1, 1, 0, 0}, {0, 1, 1, 1}};
  vector<string> ans = findPath(m, n);
  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i] << " ";
  }
  cout << endl;
  return 0;
}

#c++ #dsa #recursion #sorting #array #arraysorting #bubblesorting

bubble sorting of the array using recursion.

@vishnu_jha

void sortArray (int *arr, int n) {
  if (n==0||n==1)
    return;
  for (int i=0; i<n-1; i++) {
    if (arr[i]>arr[i+1]) {
      swap(arr[i],arr[i+1]);
    }
  }
  sortArray(arr,n-1);
}

#c++ #dsa #bubblesorting #sorting

Bubble sorting of array

@vishnu_jha

void sortArray(int arr[], int n) {
  for (int i = 1; i < n; i++) {
    for (int j = 0; j < (n - i); j++) {
      if (arr[j] > arr[j + 1]) {
        swap(arr[j], arr[j + 1]);
      }
    }
  }
}

AI integration

@Ahan

sequenceDiagram
    participant User as SFM_UI
    participant SFM_MS as SFM Microservice (SFM_MS)
    participant AI_Scenario_Manager as AI Scenario Manager
    participant Workflow_Client as Workflow Client
    participant Job_Management_Service as Job Management Service
    participant ETL_Process as ETL Process
    participant AiEmissionResult as sap.sfm.AiEmissionResult
    participant EmissionBySupplier as sap.smf.EmissionBySupplier

    User->>SFM_MS: Select Commodity/Supplier (Trigger AI Scenario)
    SFM_MS->>AI_Scenario_Manager: Activate AI Scenario (Subscription Request)
    AI_Scenario_Manager-->>SFM_MS: Confirm Activation (Create AIScenarioTenant)
    SFM_MS->>AI_Scenario_Manager: Trigger CO2 Data Enrichment
    AI_Scenario_Manager->>Workflow_Client: Submit Workflow
    Workflow_Client->>Job_Management_Service: Execute PySpark Jobs
    Job_Management_Service-->>Workflow_Client: Scenario Complete
    Workflow_Client-->>AI_Scenario_Manager: Scenario Complete
    AI_Scenario_Manager-->>SFM_MS: Return Enriched CO2 Data
    SFM_MS->>AiEmissionResult: Store Results (RAW Zone)
    ETL_Process->>AiEmissionResult: Extract Data (Source)
    ETL_Process->>EmissionBySupplier: Update Fact Table (Fill Missing Values)

ang

@Rahemalimomin

  loginObj: Login;

  constructor(private http: HttpClient) {
    this.loginObj = new Login();
  }
onLogin() {
    this.http.post<any>('http://192.168.1.146/maheshwarisathi.com/login/check_login', this.loginObj
  ).subscribe(      reply => {
        console.log(reply);
      },
      err => {
        console.log('error', err);
      }  
    );
  }
}

export class Login{
  username: string;
  password: string;
  user_agent:string;

  constructor() {
    this.username = '';
    this.password = '';
    this.user_agent = 'NI-AAPP';
  }
}

#javascript #sorting

sorting in reverse

@davidmchale

 const people = [
      'Bernhard, Sandra', 'Bethea, Erin', 'Becker, Carl', 'Bentsen, Lloyd', 'Beckett, Samuel', 'Blake, William', 'Berger, Ric', 'Beddoes, Mick', 'Beethoven, Ludwig',
      'Belloc, Hilaire', 'Begin, Menachem', 'Bellow, Saul', 'Benchley, Robert', 'Blair, Robert', 'Benenson, Peter', 'Benjamin, Walter', 'Berlin, Irving',
      'Benn, Tony', 'Benson, Leana', 'Bent, Silas', 'Berle, Milton', 'Berry, Halle', 'Biko, Steve', 'Beck, Glenn', 'Bergman, Ingmar', 'Black, Elk', 'Berio, Luciano',
      'Berne, Eric', 'Berra, Yogi', 'Berry, Wendell', 'Bevan, Aneurin', 'Ben-Gurion, David', 'Bevel, Ken', 'Biden, Joseph', 'Bennington, Chester', 'Bierce, Ambrose',
      'Billings, Josh', 'Birrell, Augustine', 'Blair, Tony', 'Beecher, Henry', 'Biondo, Frank'
    ];




 let sortedPeople = [];

   for(person of people){
   const name = person.split(',').reverse().join(' ').trim();
   sortedPeople.push(name)
   }

   console.log(sortedPeople)

#python #alchemy

Python

@nisarg

from sqlalchemy import create_engine
engine = create_engine("sqlite+pysqlite:///:memory:", echo=True)

connection = engine.connect()
print("Connected to the database successfully")
connection.close()

3. Write a program to a. Input item code, item name and item price b. Calculate the Total Price c. Print the detailed report of inventory

@HTPrince

#include<stdio.h>
int main(){
    
    int item1Code;
    printf("Enter item 01 code:");
    scanf("%d",&item1Code);
    
    int item1Name;
    printf("Enter item 01 name:");
    scanf("%s",&item1Name);

    int item1Price;
    printf("Enter item 01 price:");
    scanf("%d",&item1Price);
    
    int item2Code;
    printf("\nEnter item 02 code:");
    scanf("%d",&item2Code);
    
    int item2Name;
    printf("Enter item 02 name:");
    scanf("%s",&item2Name);

    int item2Price;
    printf("Enter item 02 price:");
    scanf("%d",&item2Price);
    
    int item3Code;
    printf("\nEnter item 03 code:");
    scanf("%d",&item3Code);
    
    int item3Name;
    printf("Enter item 03 name:");
    scanf("%s",&item3Name);

    int item3Price;
    printf("Enter item 03 price:");
    scanf("%d",&item3Price);
    
    int totalValue = (item1Price+item2Price+item3Price);
    printf("\nTotal price = %d\n",totalValue);
    
    
    printf("Inventory list:\n");
    printf("01.%d\n",item1Code);
    printf("02.%d\n",item2Code);
    printf("03.%d\n",item3Code);
    
    
    
    return 0;
}

02. Write a program to a. Input index number b. Input marks c. Calculate mean/average of the marks entered d. Calculate grade of the marks entered e. Print the marks with grade f. Print the detailed report of marks which includes marks with grade and mean mark

@chanuth

#include <stdio.h>

int main (){
    
    int index;
    int mark1;
    int mark2;
    
    printf("Enter index number :");
    scanf("%d",&index);
    
    printf("Enter mark1 :");
    scanf("%d",&mark1);
    
    printf("Enter mark2 :");
    scanf("%d",&mark2);
    
    int avg = (mark1+mark2)/2;
    printf("Average of marks :%d\n",avg);
    
    if(avg>=35){
        printf("Grade = c");
    }else{
        printf("fail");
    }

    return 0;
}

2. Write a program to a. Input index number b. Input marks c. Calculate mean/average of the marks entered d. Calculate grade of the marks entered e. Print the marks with grade f. Print the detailed report of marks which includes marks with grade and mean mark

@HTPrince

#include<stdio.h>

int main(){
    
    int index;
    int mark1;
    int mark2;
    
    printf("Enter index number:");
    scanf("%d",&index);
    
    printf("Enter mark1:");
    scanf("%d",&mark1);
    
    printf("Enter mark2:");
    scanf("%d",&mark2);
    
    int avg = (mark1+mark2)/2;
    printf("Average of marks:%d\n",avg);
    
    if(avg>=35){
        printf("Grade : C-");
    }else{
        printf("\nYou are fail idiot.!");
    }

    
    
    
    
    return 0;
}

Write a program to a. Input first number b. Input second number c. Calculate the sum Sum = first number + second number d. Display the sum

@HTPrince

// Online C compiler to run C program online
#include<stdio.h>
int main(){
     int a;
     int b;
     
     
     printf("Enter number for a:");
     scanf("%d",&a);
     
     printf("Enter number for b:");
     scanf("%d",&b);
     
     int value = a+b;
     printf("The value is: %d\n",value);
    
    
    
    return 0;
}

Password Hashing Project

@aniket_chavan

def start():
    print()
    print('********************************')
    print("Student Name  - Aniket")
    print("Title         - Micro Project")
    print("Project Name  - Password Hashing")
    print("Language      - Python")
    print('********************************')
    print()

class Hash:
    def __init__(self, secret_key):
        self.secret_key = secret_key
       
    def hash(self, password):
        hashed_password = ""
        for char in password:
            hashed_password += chr(ord(char) + self.secret_key)
        return hashed_password

    def decrypt(self, hashed_password):
        decrypted_password = ""
        for char in hashed_password:
            decrypted_password += chr(ord(char) - self.secret_key)
        return decrypted_password

start()

while True:
    obj = Hash(1)
    print("----------------------------------")
    password = input("Enter Your Password : ")
    print("----------------------------------")
    print("Your entered Password : ", password)
    print("----------------------------------")
    
    hashed_password = obj.hash(password)
    print("Your Hashed password:", hashed_password)
    print("----------------------------------")
    
    decrypted_password = obj.decrypt(hashed_password)
    print("Your Decrypted password:", decrypted_password)
    print("----------------------------------")
    
    ans = input("Do You want to Continue (Y/N) :")
    if ans.lower() != 'y':
        print('.....Thank You.....')
        break

15 Best Termux Tools for Ethical Hacking in 2024

@Saveallkids

git clone https://github.com/Rajkumrdusad/Tool-X.git

#php #wordpress

Wordpress Related Post

@suira

if ( is_single() ) {
  $current_post_id = get_queried_object_id();
  $current_category_id = get_the_category( $current_post_id )[0]->cat_ID;

  $args = array(
    'category' => $current_category_id,
    'post__not_in' => array( $current_post_id ),
    'posts_per_page' => 3,
  );

  $related_posts = new WP_Query( $args );

  if ( $related_posts->have_posts() ) {
    echo '<h2>Related Posts:</h2>';
    while ( $related_posts->have_posts() ) {
      $related_posts->the_post();
      echo '<a href="' . get_the_permalink() . '">' . get_the_title() . '</a><br>';
    }
    wp_reset_postdata();
  }
}

Extract entities

@shreekrishna

{
  "kind": "EntityRecognition",
  "parameters": {
    "modelVersion": "latest"
  },
  "analysisInput": {
    "documents": [
      {
        "id": "1",
        "language": "en",
        "text": "Joe went to London on Saturday"
      }
    ]
  }
}


{
    "kind": "EntityRecognitionResults",
     "results": {
          "documents":[
              {
                  "entities":[
                  {
                    "text":"Joe",
                    "category":"Person",
                    "offset":0,
                    "length":3,
                    "confidenceScore":0.62
                  },
                  {
                    "text":"London",
                    "category":"Location",
                    "subcategory":"GPE",
                    "offset":12,
                    "length":6,
                    "confidenceScore":0.88
                  },
                  {
                    "text":"Saturday",
                    "category":"DateTime",
                    "subcategory":"Date",
                    "offset":22,
                    "length":8,
                    "confidenceScore":0.8
                  }
                ],
                "id":"1",
                "warnings":[]
              }
          ],
          "errors":[],
          "modelVersion":"2021-01-15"
    }
}

renameKeys in javascript

Text Rotation in CSS

Convert two lists into a dictionary

How do you check a row in a 2D char array for a specific element and then count how many of that element are in the row? (Java)

Create simple string along with variables

Pagination Helper for Handlebars - Node.js Express

How to change any attribute of a HTML element

Centering Things with CSS Auto Margin

Wordpress footer code for automatically updating year for copyright text

HTML Heading Tags <h1> to <h6>

How to "truncate" long strings with an ellipsis (...) for text that overflows its container

How to expand and collapse elements inside repeaters in Wix

Flood Fill Algorithm: Like the bucket tool in Paint app but for multi-dimensional arrays

Sorting an array without changing position of negative numbers

Cloning a Github Repository with git

How to Get Current Year in Javascript

How to efficiently iterate over each entry in a Java Map

Live Search Bar on Website

Print Nested Array in Java

Migrate SharePoint Site to another Site

Automate Exporting all Components in an Excel Project | Experts Exchange

String contains

How much does it cost to tokenize an asset?

(6) Facebook

Advanced toggling with 3rd param of force

Creating Dynamic filtering using JSON

How to Encrypt and Decrypt Data in SQLite with Python's Fernet

Query all Content Document Link

max fps

End of Year Events - 2024

dijkstra new ver 1

choppystick/py-sudoku-solver: Python implementation of a Sudoku solver using Linear Programming (LP). The solver can handle Sudoku puzzles of varying difficulties and can find multiple solutions if they exist.

Webcam server is currently not running

how to make default uuid or id for pydantic model

Exnori • Wallets

rat in a maze problem

bubble sorting of the array using recursion.

Bubble sorting of array

AI integration

ang

sorting in reverse

Python

3. Write a program to a. Input item code, item name and item price b. Calculate the Total Price c. Print the detailed report of inventory

02. Write a program to a. Input index number b. Input marks c. Calculate mean/average of the marks entered d. Calculate grade of the marks entered e. Print the marks with grade f. Print the detailed report of marks which includes marks with grade and mean mark

2. Write a program to a. Input index number b. Input marks c. Calculate mean/average of the marks entered d. Calculate grade of the marks entered e. Print the marks with grade f. Print the detailed report of marks which includes marks with grade and mean mark

Write a program to a. Input first number b. Input second number c. Calculate the sum Sum = first number + second number d. Display the sum

Password Hashing Project

15 Best Termux Tools for Ethical Hacking in 2024

Wordpress Related Post

Extract entities

Save snippets that work with our extensions