This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# The file should be written in the ASCII format. Put the file in your root directory. | |
# If you want to exclude all web spiders from the entire server, you can use this: | |
User-agent: * | |
Disallow: / | |
# If you want the web spider to access everything you can use: | |
User-agent: * | |
Disallow: |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
10 Ways To Improve Your Google Rank: | |
1. Focus on your content. Make sure you provide a quality content. | |
2. Regularly update your website. | |
3. Pointing Links to your Website. | |
4. Page Authority. | |
5. Use a site map(sample: https://gist.github.com/MicBrain/e5125d4b861c3071c63560b51ee66634) | |
6. Effectively use "keyword" and "description" HTML Meta Tags. Make sure that the content of the website matches to these 2 tags. | |
7. Effectively use <title> tag. | |
8. Use ALT text on images. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!--It is strongly recommended that you place your Sitemap(sitemap.html) at the root directory of your HTML.--> | |
<?xml version="1.0" encoding="UTF-8"?> | |
<urlset | |
xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" | |
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" | |
xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9 | |
http://www.sitemaps.org/schemas/sitemap/0.9/sitemap.xsd"> | |
<url> | |
<loc>http://www.book-selves.com/</loc> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!DOCTYPE HTML> | |
<html> | |
<head> | |
<!--To get more Meta Tags visit here: https://gist.github.com/MicBrain/46a9723158307fd30db66a4b2af85411 --> | |
<meta charset="utf-8"> | |
<meta http-equiv="content-type" content="text/html"> | |
<title> The name of your website. </title> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<head> | |
<title>First Meteor App.</title> | |
</head> | |
<body> | |
<h1> fb-welcome</h1> | |
<script> | |
window.fbAsyncInit = function() { | |
FB.init({ | |
appId : '444506449070273', |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* Given two strings, write a method to decide if one is a | |
* permutation of the other. | |
* @author: Rafayel Mkrtchyan | |
* @date: 9/16/2015 | |
*/ | |
#include <iostream> | |
#include <string> | |
#include <cstring> | |
#include <algorithm> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* Problem 1.2: Implement a function void reverse(char* str) | |
* in C or C++, which reverses a null-terminated string. | |
* @author: Rafayel Mkrtchyan | |
* @date: 9/14/2015 | |
*/ | |
#include <iostream> | |
/* This function takes an iterative approach to problem | |
* using an O(n) speed. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* Problem 1.1: Implement an algorithm to determine if a string | |
* has all unique characters. What if you cannot use additional | |
* data structures? | |
* @author: Rafayel Mkrtchyan | |
* @date: 9/13/2015 | |
*/ | |
#include <iostream> | |
#include <algorithm> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
JobInfo* MultiFetcher::WaitForNext() { | |
int index; | |
int timeout = -1; | |
int length = getJobInfoList().size(); | |
download_mgr->watch_fds_ = | |
static_cast<struct pollfd *>(smalloc(length * sizeof(struct pollfd))); | |
download_mgr->watch_fds_size_ = length; | |
for (index = 0; index < length; index++) { | |
download_mgr->watch_fd_[index].fd = JobInfo[idx].pipe_fd | |
download_mgr->watch_fd_[index].events = POLLIN | POLLPRI; |
NewerOlder