Cacher is the code snippet organizer for pro developers

 gitlab-runner exec docker --docker-privileged codeception

docker run -dit --name tecmint-web -p 80:80 -v /Users/madmaker/Projects/testphp:/usr/local/apache2/htdocs/ httpd:2.4

#include<iostream>
#include<stdlib.h>
#include<stdio.h>

#define MONCK(ARGTERM) printf("The term " #ARGTERM " is a string\n")
#define err(...) fprintf(stderr,__VA_ARGS__)
using namespace std;

int main(){
    MONCK(A TO B);
    err("%s %d\n","The error code: ",48);
    return 0;
}

#
# Note: 
#   Hashicorp does not have a link to the "ulyana" code name that Linux Mint 20 is using.  
#   However, Mint is based on Ubuntu and there is a repository for Ubuntu focal in our case.
#   The version on which your version of Mint is based, can be retrieved in the /etc/os-release file.
#

sudo apt-add-repository "deb [arch=$(dpkg --print-architecture)] https://apt.releases.hashicorp.com $(grep 'UBUNTU_CODENAME' /etc/os-release | awk -F '=' '{ print $2 }') main"

*Rebeka Crooks*



[https://loopia.network/yasna](https://loopia.network/yasna)

`Lucie Braun`

This income is valid for channel visits till Mar 04 and must be updated when channel data changes to reflect actual data.

[https://www.dewiring.com/yasna](https://www.dewiring.com/yasna)

`Alisha Waelchi`



[https://chatsmartly.com/yasna](https://chatsmartly.com/yasna)

`Tia Hyatt`

Female
35 minutes ago
2 posts

[https://www.funbooo.com/yasna](https://www.funbooo.com/yasna)

*Yasna Bella*

In this new era, businesses can get an accurate estimate by comparing celebrities' perception of income with their actual net worth.
However, there are many important factors to consider when determining a celebrity's net worth.
Yasna Bella 6 days ago Yasna Bella 8 days ago A detailed estimate of their net worth is difficult to get because of the intangible nature of it.

[https://chatabox.io/yasnalw ](https://chatabox.io/yasnalw )

`Yasna Debil`

Yasna Debil 17 days ago

#include<iostream>

#if defined(BUILD_TYPE_NORMAL)
# define DEBUG(x) do {;} while (0) /* paranoid-style null code */
#elif defined(BUILD_TYPE_DEBUG)
# define DEBUG(x) _debug_trace x /* e.g. DEBUG((_debug_trace args)) */
#else
#error "Please specify build type in the Makefile"
#endif

using namespace std;

int main(){
    return 0;
}

def tb_insert(cursor):
    print("Inserting into [title_basics]......")
    create_tb_table(cursor)
    tb_miss = 0
    tb_log = open("title_basics_log1.txt", "w")
    tb_chunk_counter = -1
    for chunk in tqdm(pd.read_csv("title.basics.tsv", \
                             low_memory=False, sep="\t",\
                             chunksize = 1000000)):
          
        tb_chunk_counter = tb_chunk_counter + 1
        if (tb_chunk_counter == 3):
            break
        ck = chunk

/**
 * Description:
 * Write a program to find the node at which the intersection of two singly
 * linked lists begins.
 *
 * Example 1:
 *
 * Input: intersectVal = 8, listA = [4,1,8,4,5], listB = [5,6,1,8,4,5], skipA
 * = 2, skipB = 3
 * Output: Reference of the node with value = 8
 * Input Explanation: The intersected node's value is 8 (note that this must
 * not be 0 if the two lists intersect). From the head of A, it reads as [4,
 * 1,8,4,5]. From the head of B, it reads as [5,6,1,8,4,5]. Th

SELECT clntpfx, clntcoy, clntnum, clrrrole, forepfx, forecoy, forenum, used_to_be, user_profile, job_name, datime, source_commit_timestamp, commit_timestamp, source_commit_user, delete_indicator
FROM IEQDS001_LifeDataLake.espdta.clrrpf
WHERE clrrrole IN ('OW', 'JO', 'LF', 'JL');

const initial = { meta: { data: { filters: [] } } }
const clone = { ...initial }
clone.meta.data.filters = [1, 2, 3]
console.log(initial) // { meta: { data: { filters: [1, 2, 3] } } }

export class SpinnerInterceptor implements HttpInterceptor {
requestCount = 0;
constructor(private spinnerService: SpinnerService) { }

intercept(request: HttpRequest<any>, next: HttpHandler): Observable<HttpEvent<any>> {
    this.requestCount++;
        this.spinnerService.show();

    return next.handle(request)
        .pipe(
            finalize(() => {
                this.requestCount--;
                if (this.requestCount === 0) {
                    this.spinnerService.hide();
        

zend_extension=xdebug.so
xdebug.remote_autostart = 1
xdebug.remote_enable = 1
xdebug.remote_handler = dbgp
xdebug.remote_host = 127.0.0.1
xdebug.remote_log = /tmp/xdebug_remote.log
xdebug.remote_mode = req
xdebug.remote_port = 9005 #if you want to change the port you can change 

// CPP program to illustrate
// std :: lower_bound
// returns the index for the element in the vector that is equal or
// greater than the passed in integer
#include <bits/stdc++.h>
 
// Driver code
int main()
{
    // Input vector
    std::vector<int> v{ 10, 20, 30, 30, 30, 40, 50 };
 
    // Print vector
    std::cout << "Vector contains :";
    for (unsigned int i = 0; i < v.size(); i++)
        std::cout << " " << v[i];
    std::cout << "\n";
 
    std::vector<int>::iterator low1, low2, low3

@mixin lhCrop($font-size, $line-height) {
  &::before,
  &::after {
    content: '';
    display: block;
    height: 0;
    width: 0;
    margin-top: calc((1 - #{remove-unit($line-height / $font-size)}) * 0.5em);
  }
}

// 値の単位を除外
@function remove-unit($number) {
  @if type-of($number) != number {
    @error "#{ $number } is not a number.";
    @return false;
  }
  @return $number / ($number * 0 + 1);
}

import React, { useState, useEffect, useMemo } from 'react'

export default function Board({}) {
    function initialCount() {
        console.log('initialCount: 0');
        return 0
    }
    const [count, setcount] = useState(initialCount());
    console.log('after setState', count);

    useEffect(() => {
        console.log('useEffect[]', count);
        return () => {
            console.log('useEffect[] clean...');
        }
    }, [])

    const rest = useMemo(() => {