Snippets Collections
function product_loop()
{
	ob_start();
	$arg = array(
		'post_type' => 'product',
		'posts_per_page' => -1,
	);

	$themeslider = new WP_Query($arg);

	?>
	<div class="row productSlider">
		<?php if ($themeslider->have_posts()) : ?>
            <?php while ($themeslider->have_posts()) : ?>
                <?php $themeslider->the_post();?>
				<?php global $product; ?>
                <div class="col-md-4">
                    <div class="productWrap">
                        <div class="productImg">
                            <a href="<?php echo get_permalink( $product->get_id() ); ?>">
                                <?php the_post_thumbnail('full'); ?>
                            </a>
                        </div>
                        <div class="productContent">
                            <h4 class="text-center"><?php echo $product->get_title(); ?></h4>
                            <div class="detailWrap">
                                <div class="detailCat">
                                    <span class="list-icon fas fa-cog"></span> <?php echo $product->get_categories(); ?>
                                </div>
                                <div class="detailPrice">
                                    <?php
                                    if ($product->is_type('simple')) {
                                        echo str_replace('.00', '', $product->get_price_html());
                                    }
                                    
                                    if ($product->get_type() == 'variable') {
                                        $available_variations = $product->get_available_variations();
                                        $variation_id = $available_variations[0]['variation_id'];
                                        $variable_product = new WC_Product_Variation($variation_id);
                                        $regular_price = $variable_product->get_regular_price();
                                        $sales_price = $variable_product->get_sale_price();
                                        
                                        if (empty($sales_price)) {
                                            $sales_price = 0;
                                        }
                                        
                                        $total_price = $regular_price + $sales_price;
                                        echo '$' . number_format($total_price, 0, '', '');
                                    }
                                    ?>
                                </div>
                            </div>
                            <div class="ratingWrap">
                                <div class="ratings">
                                    <?php if($product->get_average_rating() != 0){ ?>
                                        <div class="ratingStar producRating-<?php echo round($product->get_average_rating()) ?>"></div>
                                    <?php } ?>
                                </div>
                                <div class="cartBtn">
                                    <a href="<?php echo get_permalink( $product->get_id() ); ?>">book now</a>
                                </div>
                            </div>
                        </div>
                    </div>
                </div>
            <?php endwhile; ?>
        <?php endif; ?>
    </div>

<?php
	wp_reset_postdata();
	return '' . ob_get_clean();
}
add_shortcode('product_code', 'product_loop');
class A:
    def __init__(self):
        self.a=10
    def write(self):
        print(self.a)
class B(A):
    def __init__(self):
        super().__init__()
        self.b=20
    def write(self):
        super().write()
        print(self.b)
b1=B()
b1.write()
function findShort(s){
  return s.split(" ").sort(function(a, b) {
  return a.length - b.length || a.localeCompare(b);    
})[0].length }

//ALTERNATIVE

function findShort(s){
    return Math.min(...s.split(" ").map (s => s.length));
}
function findEvenIndex(arr) {
  let index = -1;
  for (var i = 0; i < arr.length; i++) {
    let start = arr.slice(0, i+1).reduce((a, b) => a + b, 0);
    let end = arr.slice(i).reduce((a, b) => a + b, 0)
    if (start === end) {
      index = i
    }
  }
  return index;
}
#Python program to create class,object and method.
class person: #class
    name = 'raju'
    age = 20
    def display (cls): #method
        print(cls.name)
        print(cls.age)
p=person() #object
p.display() #call the method using the instance
        
function lovefunc(flower1, flower2){
  return flower1 % 2 !== flower2 % 2;
}
:root {
  --main-color: #3498db;
}
button {
  background-color: var(--main-color);
  color: white;
}
h1 {
  font-size: 24px;
  color: #FF5733;
  text-align: center;
  text-transform: uppercase;
}
css
Copy code
div
/* styles.css */

/* Change the text color of the <h1> element to red */
h1 {
    color: red;
}

/* Change the text color of the <p> element to blue */
p {
    color: blue;
}
<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Text Color Example</title>
    <!-- Link your CSS file here -->
    <link rel="stylesheet" href="styles.css">
</head>
<body>
    <h1>Welcome to My Webpage</h1>
    <p>This is a sample paragraph with text that we'll style.</p>
</body>
</html>
}


#include <iostream>

using namespace std;

int main()
{
    int N ; 
    int X[N] ; 
    cin>>N ; 
    for(int i=0 ;i<N ;i++ ) { 
        cin>>X[i] ; 
    } 
    
    for(int i=0;i<N-1 ;i++ ){ 
        int M=X[i] ; //M=3
        int ind ; 
        for(int J=i+1 ;J<N ;J++){  // 0 1 2 3 4 
                                   // 1 3 2

            if(X[J]<M){
                M=X[J] ; 
                ind=J ;           //1 
                
            } 
            
         
    }  
    int temp =X[i] ; 
    X[i]=M ; 
    X[ind]=temp ;
    } 
    for(int i=0 ;i<N ;i++){
        cout<<X[i]<<" ";
    }
    
    

    return 0;
}
docker save <image>:<tag> | pigz > <image>.tar.gz
docker save <image>:<tag> | gzip > <image>.tar.gz
docker save <image>:<tag> | zstd > <image>.tar.zst

docker load -i <image>.tar.gz
docker load -i <image>.tar.zst
/*CSS*/
.wrap{
  background-color:#ccc;
  margin:0 auto;
  width:800px;
  padding:20px;
}

p{
  color:#999;
}

img{
  float:right;
  border-radius:10px;
}
<!--Html-->
<div class="wrap">
<p><img src="https://cdn.logo.com/hotlink-ok/logo-social.png" width="200px">
Lorem ipsum dolor sit amet consectetur adipisicing elit. Quis laboriosam consectetur 
quo obcaecati a ab sequi veritatis voluptas, repudiandae dignissimos beatae nesciunt 
perspiciatis! Ipsa odio et obcaecati minus, mollitia id!
Fugiat architecto suscipit officiis placeat porro nam exercitationem sit corporis eligendi, 
laborum quaerat enim quia obcaecati magnam voluptas accusantium soluta! Itaque voluptas porro 
nihil vel quos placeat! Quos, magni impedit.
Lorem ipsum dolor sit amet consectetur adipisicing elit. Quibusdam quasi nam soluta est. 
Ullam eligendi fugiat iusto id, laudantium nesciunt quo minima repellat nam vitae! Eum sunt 
esse reprehenderit voluptatibus.
Voluptatem, hic aut nesciunt maiores odio inventore provident necessitatibus fugit nisi 
expedita amet unde labore culpa, delectus doloribus molestiae incidunt officiis, reiciendis debitis. Recusandae libero autem rem necessitatibus nostrum enim!
</p>
</div>
const formatPrice = (price) => {
  let formattedPrice = new Intl.NumberFormat('en-AU', { // comes from the Numberforamatted API JS
    style: 'currency',
    currency: 'AUD'
  }).format((price/100).toFixed(2));
  return formattedPrice;
}
#include <stdio.h>

void swap(int* a, int* b) {
    int temp = *a;
    *a = *b;
    *b = temp;
}

int partition(int arr[], int low, int high) {
    int pivot = arr[high];  // Choose the last element as the pivot
    int i = (low - 1);     // Index of the smaller element

    for (int j = low; j <= high - 1; j++) {
        // If the current element is smaller than or equal to the pivot
        if (arr[j] <= pivot) {
            i++;  // Increment the index of the smaller element
            swap(&arr[i], &arr[j]);
        }
    }
    swap(&arr[i + 1], &arr[high]);
    return (i + 1);
}

void quickSort(int arr[], int low, int high) {
    if (low < high) {
        // Partitioning index
        int pi = partition(arr, low, high);

        // Recursively sort elements before and after partition
        quickSort(arr, low, pi - 1);
        quickSort(arr, pi + 1, high);
    }
}

int main() {
    int arr[] = {12, 11, 13, 5, 6, 7};
    int size = sizeof(arr) / sizeof(arr[0]);

    printf("Original Array: ");
    for (int i = 0; i < size; i++) {
        printf("%d ", arr[i]);
    }

    quickSort(arr, 0, size - 1);

    printf("\nSorted Array: ");
    for (int i = 0; i < size; i++) {
        printf("%d ", arr[i]);
    }

    return 0;
}
def partition(arr, low, high):
    pivot = arr[high]  # Choose the last element as the pivot
    i = low - 1  # Index of the smaller element

    for j in range(low, high):
        # If the current element is smaller than or equal to the pivot
        if arr[j] <= pivot:
            i += 1  # Increment the index of the smaller element
            arr[i], arr[j] = arr[j], arr[i]

    arr[i + 1], arr[high] = arr[high], arr[i + 1]
    return i + 1

def quickSort(arr, low, high):
    if low < high:
        # Partitioning index
        pi = partition(arr, low, high)

        # Recursively sort elements before and after partition
        quickSort(arr, low, pi - 1)
        quickSort(arr, pi + 1, high)

if __name__ == "__main__":
    arr = [12, 11, 13, 5, 6, 7]

    print("Original Array:", arr)

    quickSort(arr, 0, len(arr) - 1)

    print("Sorted Array:", arr)
import React from 'react';

class MyComponent extends React.Component {
  render() {
    const isLoggedIn = true;


    return (
      <div>
        <p>{isLoggedIn? "We have a user" : "No user"}</p> 
      </div>
    );
  }
}

export default MyComponent;
condition ? expression_if_true : expression_if_false;
private void WheelsAnimation()
    {
        for (int i = 0; i < wheelCollider.Length; i++)
        {
            Vector3 pos = new Vector3(0, 0, 0);
            Quaternion quat = new Quaternion();
            wheelCollider[i].GetWorldPose(out pos, out quat);

            // Update Wheel Prefabs rotation and position
            wheelPrefabs[i].transform.rotation = quat;
            wheelPrefabs[i].transform.position = pos;
        }
    }
function arrayDiff(a, b) {
  return a.filter(x => !b.includes(x))
}
let lastLcp;
const po = new PerformanceObserver((entryList) => {
  const entries = entryList.getEntries();
  for (const entry of entries) {
    if (entry.startTime !== lastLcp) {
      console.log(
        `New LCP: ${entry.startTime}ms
Size: ${entry.size} px^2
HTML: ${entry.element ? entry.element .outerHTML.slice(0, 80): "(no element)"}`
      );
      lastLcp = entry.startTime;
    }
  }
});
po.observe({ type: "largest-contentful-paint", buffered: true });
def merge(arr, left, right):
    i = j = k = 0

    while i < len(left) and j < len(right):
        if left[i] < right[j]:
            arr[k] = left[i]
            i += 1
        else:
            arr[k] = right[j]
            j += 1
        k += 1

    while i < len(left):
        arr[k] = left[i]
        i += 1
        k += 1

    while j < len(right):
        arr[k] = right[j]
        j += 1
        k += 1

def merge_sort(arr):
    if len(arr) > 1:
        mid = len(arr) // 2
        left = arr[:mid]
        right = arr[mid:]

        merge_sort(left)
        merge_sort(right)

        merge(arr, left, right)

if __name__ == "__main__":
    input_str = input("Enter space-separated integers to sort: ")
    arr = [int(x) for x in input_str.split()]

    print("Original Array:", arr)

    merge_sort(arr)

    print("Sorted Array:", arr)
def merge(arr, left, right):
    i = j = k = 0

    while i < len(left) and j < len(right):
        if left[i] < right[j]:
            arr[k] = left[i]
            i += 1
        else:
            arr[k] = right[j]
            j += 1
        k += 1

    while i < len(left):
        arr[k] = left[i]
        i += 1
        k += 1

    while j < len(right):
        arr[k] = right[j]
        j += 1
        k += 1

def merge_sort(arr):
    if len(arr) > 1:
        mid = len(arr) // 2
        left = arr[:mid]
        right = arr[mid:]

        merge_sort(left)
        merge_sort(right)

        merge(arr, left, right)

if __name__ == "__main__":
    arr = [12, 11, 13, 5, 6, 7]    
    print("Original Array:", arr)    
    merge_sort(arr)    
    print("Sorted Array:", arr)
#include <stdio.h>

void merge(int arr[], int left[], int leftSize, int right[], int rightSize) {
    int i = 0, j = 0, k = 0;

    while (i < leftSize && j < rightSize) {
        if (left[i] < right[j]) {
            arr[k++] = left[i++];
        } else {
            arr[k++] = right[j++];
        }
    }

    while (i < leftSize) {
        arr[k++] = left[i++];
    }

    while (j < rightSize) {
        arr[k++] = right[j++];
    }
}

void mergeSort(int arr[], int size) {
    if (size > 1) {
        int mid = size / 2;
        int left[mid];
        int right[size - mid];

        for (int i = 0; i < mid; i++) {
            left[i] = arr[i];
        }
        for (int i = mid; i < size; i++) {
            right[i - mid] = arr[i];
        }

        mergeSort(left, mid);
        mergeSort(right, size - mid);
        merge(arr, left, mid, right, size - mid);
    }
}

int main() {
    int arr[] = {12, 11, 13, 5, 6, 7};
    int size = sizeof(arr) / sizeof(arr[0]);

    printf("Original Array: ");
    for (int i = 0; i < size; i++) {
        printf("%d ", arr[i]);
    }

    mergeSort(arr, size);

    printf("\nSorted Array: ");
    for (int i = 0; i < size; i++) {
        printf("%d ", arr[i]);
    }

    return 0;
}
#include <stdio.h>

void merge(int arr[], int left[], int leftSize, int right[], int rightSize) {
    int i = 0, j = 0, k = 0;

    while (i < leftSize && j < rightSize) {
        if (left[i] < right[j]) {
            arr[k++] = left[i++];
        } else {
            arr[k++] = right[j++];
        }
    }

    while (i < leftSize) {
        arr[k++] = left[i++];
    }

    while (j < rightSize) {
        arr[k++] = right[j++];
    }
}

void mergeSort(int arr[], int size) {
    if (size > 1) {
        int mid = size / 2;
        int left[mid];
        int right[size - mid];

        for (int i = 0; i < mid; i++) {
            left[i] = arr[i];
        }
        for (int i = mid; i < size; i++) {
            right[i - mid] = arr[i];
        }

        mergeSort(left, mid);
        mergeSort(right, size - mid);
        merge(arr, left, mid, right, size - mid);
    }
}

int main() {
    int size;

    printf("Enter the number of elements: ");
    scanf("%d", &size);

    int arr[size];

    printf("Enter %d integers separated by spaces: ", size);
    for (int i = 0; i < size; i++) {
        scanf("%d", &arr[i]);
    }

    printf("Original Array: ");
    for (int i = 0; i < size; i++) {
        printf("%d ", arr[i]);
    }

    mergeSort(arr, size);

    printf("\nSorted Array: ");
    for (int i = 0; i < size; i++) {
        printf("%d ", arr[i]);
    }

    return 0;
}
docker commit -c "CMD 'redis-server'" CONTAINERID
/* CENTER Three Column CSS - Starts */

.center-three-columns .flex_column {
    width: 100% !important;
    margin: 0 !important;
}
 
.center-three-columns {
    display: flex;
    flex-wrap: wrap;
    justify-content: center;
    gap: 30px;
    row-gap: 50px
}
 
@media (min-width: 768px) {
    .center-three-columns .flex_column {
        width: calc(50% - 15px) !important;
    }
}
 
 
@media (min-width: 1251px) {
    .center-three-columns .flex_column {
        width: calc(33.33% - 20px) !important;
    }
}

/* CENTER Three Column CSS - Ends */

.inner-link-col {
    background-color: #fff;
    text-align: center;
    border: 1px solid #efefef !important;
    transition: .5s;
   
}

.inner-link-col:hover {
    transform: translateY(-5px);
    background-color: #f8f8f8;
    box-shadow: 1px 2px 6px 2px #efefef;
}

.inner-link-col .team-img-container {
    margin-bottom: 20px;
}

.inner-link-box .team-member-name {
    padding: 0 20px;
    font-size: 20px !important;
    color: var(--primary)!important;
}

.inner-link-box .team-member-job-title {
    color: var(--secondary)!important;
}
# This function chooses at random which action to be performed within the range 
# of all the available actions.
def ActionChoice(available_actions_range):
    if(sum(PossibleAction)>0):
        next_action = int(ql.random.choice(PossibleAction,1))
    if(sum(PossibleAction)<=0):
        next_action = int(ql.random.choice(5,1))
    return next_action

# Sample next action to be performed
action = ActionChoice(PossibleAction)
#include <iostream>
using namespace std;

int main()
{
    int points_a[3] = {1, 2, 3};
    int points_b[3] = {4, 5, 6};
    int points_c[3] = {7, 8, 9};
    
    // Good Practice
    int points[3][3] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};
    cout << points[1][2]; // 6
    cout << points[2][0]; // 7
    cout << points[2][2]; // 9
    
    // Bad Practice
    // int points[3][3] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
    // cout << points[1][2]; // 6
    // cout << points[2][0]; // 7
    // cout << points[2][2]; // 9
    return 0;
}
#include <iostream>
using namespace std;

int main()
{
    int nums[4];
    
    nums[0] = 100; // First Element
    nums[1] = 200; // Second Element
    nums[2] = 300; // Before Last Element
    nums[3] = 400; // Last Element

    cout << "Element 1: " << nums[0] << "\n";
    cout << "Element 2: " << nums[1] << "\n";
    cout << "Element 3: " << nums[2] << "\n";
    cout << "Element 4: " << nums[3] << "\n";
    
    nums[1] = 1000; // Second Element
    
    cout << "Element 2: " << nums[1] << "\n";
    
    int anums[] = {100, 200, 300, 400, 500, 600}; // 24 bytes / 4 bytes (1 array) 
    cout << "Array Elements Count Is: " << sizeof(anums) / sizeof(anums[1])<< "\n";
    
    
    return 0;
}
<!--Html-->

<div class="box">
	<p>Hi I'm here.</p>
</div>
/*CSS*/

.papa{
    position: relative;
    background-color:#EFF1F5;
    text-align: center;
    height: 200px;
    border-radius: 10px; 
}

.child{
    position: absolute;
    top:10px;
    left: 10px;
    background-color:#002bc7;
    color: #fff;  
    padding: 50px;
    border-radius: 10px;   
}
<div class="papa">
<div class="child"><h2>Child</h2></div>
</div>
/*CSS*/
span{
    position: relative;
    top:20px;
    font-weight: bold;
    background-color:#0037FF;
    color:#fff;
}
<!--Html-->
<p>Hi I'm<span>here.</span>ya</p>
/*CSS*/

a{
  padding:10px;
  color:#4285F4;
  text-decoration:none;
  background-color:#E0F0FF;
  border-radius:8px;
}
<!--Html-->

<a href="#">btn</a>
<a href="#">btn1</a>
/* CSS */

.box{
  background:#E5E8EE;
  margin-bottom:10px;
  text-align:center;
  color:#B7B7B7;
  border-radius:12px;
}
<!--Html-->
<div class="box">
  <h2>A</h2>
</div>
<div class="box">
  <h2>B</h2>
</div>
<div class="box">
  <h2>C</h2>
</div>
print("uwu")
star

Thu Sep 28 2023 18:00:20 GMT+0000 (Coordinated Universal Time) undefined

@PowerSile5

star

Thu Sep 28 2023 16:49:06 GMT+0000 (Coordinated Universal Time)

@hamzakhan123

star

Thu Sep 28 2023 16:20:07 GMT+0000 (Coordinated Universal Time)

@bvc #undefined

star

Thu Sep 28 2023 15:42:44 GMT+0000 (Coordinated Universal Time) https://box11.betsrv.com/robots.txt

@PowerSile5 #mysql

star

Thu Sep 28 2023 14:22:24 GMT+0000 (Coordinated Universal Time) https://www.codewars.com/kata/57cebe1dc6fdc20c57000ac9/solutions/javascript

@Paloma

star

Thu Sep 28 2023 14:11:11 GMT+0000 (Coordinated Universal Time) https://stackoverflow.com/questions/71543463/equal-sides-of-an-array-in-js

@Paloma

star

Thu Sep 28 2023 13:50:42 GMT+0000 (Coordinated Universal Time) https://www.kaggle.com/code/fareselmenshawii/object-localization-tensorflow

@Amy1393

star

Thu Sep 28 2023 12:18:10 GMT+0000 (Coordinated Universal Time)

@bvc #undefined

star

Thu Sep 28 2023 10:46:58 GMT+0000 (Coordinated Universal Time) https://www.codewars.com/kata/555086d53eac039a2a000083/solutions/javascript

@Paloma

star

Thu Sep 28 2023 10:17:57 GMT+0000 (Coordinated Universal Time)

@Remi

star

Thu Sep 28 2023 10:14:23 GMT+0000 (Coordinated Universal Time)

@Remi

star

Thu Sep 28 2023 10:12:14 GMT+0000 (Coordinated Universal Time)

@Remi

star

Thu Sep 28 2023 10:10:17 GMT+0000 (Coordinated Universal Time)

@Remi

star

Thu Sep 28 2023 10:08:11 GMT+0000 (Coordinated Universal Time)

@Remi

star

Thu Sep 28 2023 07:49:29 GMT+0000 (Coordinated Universal Time) https://www.onlinegdb.com/online_c++_compiler

@70da_vic2002

star

Thu Sep 28 2023 07:16:49 GMT+0000 (Coordinated Universal Time) https://maticz.com/binance-clone-script

@jamielucas #drupal

star

Thu Sep 28 2023 07:08:18 GMT+0000 (Coordinated Universal Time) https://www.cnblogs.com/yzpopulation/p/15865936.html

@huangxinyu #commandline

star

Thu Sep 28 2023 05:35:57 GMT+0000 (Coordinated Universal Time)

@abab

star

Thu Sep 28 2023 05:29:14 GMT+0000 (Coordinated Universal Time)

@abab

star

Thu Sep 28 2023 03:55:48 GMT+0000 (Coordinated Universal Time)

@davidmchale #javascript

star

Thu Sep 28 2023 02:06:24 GMT+0000 (Coordinated Universal Time)

@prachi

star

Thu Sep 28 2023 02:05:29 GMT+0000 (Coordinated Universal Time)

@prachi

star

Wed Sep 27 2023 19:25:04 GMT+0000 (Coordinated Universal Time)

@Emmanuel

star

Wed Sep 27 2023 19:22:52 GMT+0000 (Coordinated Universal Time)

@Emmanuel

star

Wed Sep 27 2023 18:22:43 GMT+0000 (Coordinated Universal Time)

@juanesz

star

Wed Sep 27 2023 18:02:34 GMT+0000 (Coordinated Universal Time) https://dnevnik.ru/marks

@Serkirill

star

Wed Sep 27 2023 18:01:50 GMT+0000 (Coordinated Universal Time) https://dnevnik.ru/marks

@Serkirill

star

Wed Sep 27 2023 16:25:18 GMT+0000 (Coordinated Universal Time)

@Paloma

star

Wed Sep 27 2023 15:38:27 GMT+0000 (Coordinated Universal Time) https://www.debugbear.com/docs/metrics/largest-contentful-paint

@dpavone

star

Wed Sep 27 2023 14:29:33 GMT+0000 (Coordinated Universal Time)

@prachi

star

Wed Sep 27 2023 14:27:41 GMT+0000 (Coordinated Universal Time)

@prachi

star

Wed Sep 27 2023 14:11:36 GMT+0000 (Coordinated Universal Time)

@prachi

star

Wed Sep 27 2023 14:10:03 GMT+0000 (Coordinated Universal Time)

@prachi

star

Wed Sep 27 2023 12:52:20 GMT+0000 (Coordinated Universal Time) https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Math/sign

@Paloma

star

Wed Sep 27 2023 12:32:46 GMT+0000 (Coordinated Universal Time) https://www.udemy.com/course/microservices-with-node-js-and-react/learn/lecture/19223722

@jalalrafiyev

star

Wed Sep 27 2023 08:35:44 GMT+0000 (Coordinated Universal Time)

@riyadhbin

star

Wed Sep 27 2023 07:59:17 GMT+0000 (Coordinated Universal Time) https://github.com/PacktPublishing/Artificial-Intelligence-By-Example/blob/master/Chapter01/mdp02.py

@paolo #python

star

Wed Sep 27 2023 07:46:47 GMT+0000 (Coordinated Universal Time)

@akaeyad

star

Wed Sep 27 2023 07:35:31 GMT+0000 (Coordinated Universal Time)

@akaeyad

star

Wed Sep 27 2023 07:35:15 GMT+0000 (Coordinated Universal Time)

@abab

star

Wed Sep 27 2023 07:25:59 GMT+0000 (Coordinated Universal Time)

@abab

star

Wed Sep 27 2023 07:24:27 GMT+0000 (Coordinated Universal Time)

@abab

star

Wed Sep 27 2023 07:14:54 GMT+0000 (Coordinated Universal Time)

@abab

star

Wed Sep 27 2023 07:10:15 GMT+0000 (Coordinated Universal Time)

@abab

star

Wed Sep 27 2023 06:48:06 GMT+0000 (Coordinated Universal Time)

@abab

star

Wed Sep 27 2023 06:46:03 GMT+0000 (Coordinated Universal Time)

@abab

star

Wed Sep 27 2023 06:38:30 GMT+0000 (Coordinated Universal Time)

@abab

star

Wed Sep 27 2023 06:28:08 GMT+0000 (Coordinated Universal Time)

@abab

star

Wed Sep 27 2023 02:55:55 GMT+0000 (Coordinated Universal Time)

@uwu

Save snippets that work with our extensions

Available in the Chrome Web Store Get Firefox Add-on Get VS Code extension