Muhammad Huzaifa huzaifaarain

Copied from http://code.lancepollard.com/complete-list-of-html-meta-tags/

Basic HTML Meta Tags

<meta name="keywords" content="your, tags"/>
<meta name="description" content="150 words"/>
<meta name="subject" content="your website's subject">
<meta name="copyright"content="company name">
<meta name="language" content="ES">

First run:

lsof /var/lib/dpkg/lock

Then make sure that process isn't running:

ps cax | grep PID

$orderby = 'name';
$order = 'asc';
$hide_empty = false ;
$cat_args = array(
    'orderby'    => $orderby,
    'order'      => $order,
    'hide_empty' => $hide_empty,
);

What's the difference between git reset --mixed, --soft, and --hard ?

When you modify a file in your repository, the change is initially unstaged. In order to commit it, you must stage it—that is, add it to the index—using git add. When you make a commit, the changes that are committed are those that have been added to the index.

git reset changes, at minimum, where the current branch (HEAD) is pointing. The difference between --mixed and --soft is whether or not your index is also modified. So, if we're on branch master with this series of commits:

- A - B - C (master)

HEAD points to C and the index matches C.

	/*
	Following algorithm decides as if a given number M is the median of A or
	otherwise. The algorithm outputs either M if M is the median, a number M + 1 if median
	is larger than M and the number M – 1 otherwise. Give a tight bound on the running
	time of this algorithm
	*/
	#include <bits/stdc++.h>
	using namespace std;

	/**

	/*
	write an algorithm called Count-Values that takes as
	input two arrays A and C and then compute value of each counter and store it in array C.
	Your algorithm must have ϴ (n) time complexity.
	Hint C[ A[i] ] = C[ A[i] ] + 1 might be a useful statement here
	*/
	#include <bits/stdc++.h>
	using namespace std;

	/**

	// C++ program for Assignment 1 Question 8
	// We will count inversions using merge sort algorithm
	// and divide and conquer paradigm
	#include <bits/stdc++.h>
	using namespace std;

	long long _mergeSort(long long original_array[], long long arbitrary_array[],
	long long left_index, long long right_index);
	long long merge(long long original_array[], long long arbitary_array[],
	long long left_index, long long mid_index, long long right_index);

	# Small Python Script to scrape websites for
	# email addresses and phone numbers(not a very great RE)
	# Author: Dhruv Baldawa (@dhruvbaldawa on twitter)
	# Github: http://www.github.com/dhruvbaldawa

	import urllib,re
	f = urllib.urlopen("http://www.example.com")
	s = f.read()
	re.findall(r"\+\d{2}\s?0?\d{10}",s)
	re.findall(r"[A-Za-z0-9._%+-]+@[A-Za-z0-9.-]+\.[A-Za-z]{2,4}",s)

	<?php
	/*
	* Virtual Themed Page class
	*
	* This class implements virtual pages for a plugin.
	*
	* It is designed to be included then called for each part of the plugin
	* that wants virtual pages.
	*
	* It supports multiple virtual pages and content generation functions.

	<?php
	// check for empty-cart get param to clear the cart
	add_action( 'init', 'woocommerce_clear_cart_url' );
	function woocommerce_clear_cart_url() {
	global $woocommerce;

	if ( isset( $_GET['empty-cart'] ) ) {
	$woocommerce->cart->empty_cart();
	}
	}