Commit 4b52b2f0 authored by Pallav Agarwal's avatar Pallav Agarwal

Add link to bazel blog description of my project.

parent f37faf2a
......@@ -97,11 +97,9 @@ the best position to help me deploy my code.</p>
<p>Above them is our manager, and then more managers above him (in a nutshell).</p>
<p>So what do I work on? Hmmm.. I am not sure if I'm allowed to say yet?</p>
<pre><code>TODO: Replace with a proper description of my work after project is released
as open source.
</code></pre>
<p>So what do I work on? <del>Hmmm.. I am not sure if I'm allowed to say yet?</del>
This blog article describes my project pretty well: <a href="https://blog.bazel.build/2017/08/25/introducing-sandboxfs.html">Introducing
Sandboxfs</a></p>
<p>Anyway, I am in the Blaze team. Blaze is the internal name for Bazel
(<a href="https://bazel.build">https://bazel.build</a>). To understand what Blaze is, first let's jog your
......@@ -122,15 +120,15 @@ minimizing the work done. For example, if only one file has changed, they'd try
not to build the whole project again, but just that one file. Now as projects
become complicated, these tools become inefficient, and slowly more and more
incompetent. Google has all their source code in one huge repository (really
really huge), and code can takes hours to build on parallel running machine
really huge), and code can take hours to build on parallel running machine
clusters. These tools can neither handle such complexity, nor the functionality
required for such a thing.</p>
<p>This is where Bazel (Blaze) comes in. Blaze is <em>the</em> build tool used by every
project in Google. It is what builds tens of thousands of projects everyday.
Now, Bazel is the open source version of Blaze, which other people can use in
their projects, but is mostly used by other companies (like Dropbox), whose
requirements are that huge.</p>
their projects, but is mostly used by other companies (like Dropbox), who have
such huge requirements.</p>
<p>If you are in a CS related field, you would've heard the term "correctness"
thrown around a lot. Proof of correctness of algorithms? Correctness in multi
......
<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom" ><generator uri="https://jekyllrb.com/" version="3.4.3">Jekyll</generator><link href="http://localhost:4000/feed.xml" rel="self" type="application/atom+xml" /><link href="http://localhost:4000/" rel="alternate" type="text/html" /><updated>2017-08-03T00:06:06-04:00</updated><id>http://localhost:4000/</id><title type="html">VARSTACK</title><subtitle></subtitle><entry><title type="html">An intern’s views - End of Diary</title><link href="http://localhost:4000/2017/07/29/End-of-Diary/" rel="alternate" type="text/html" title="An intern's views - End of Diary" /><published>2017-07-29T00:00:00-04:00</published><updated>2017-07-29T00:00:00-04:00</updated><id>http://localhost:4000/2017/07/29/End-of-Diary</id><content type="html" xml:base="http://localhost:4000/2017/07/29/End-of-Diary/">&lt;p&gt;The series:&lt;/p&gt;
<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom" ><generator uri="https://jekyllrb.com/" version="3.4.3">Jekyll</generator><link href="http://localhost:4000/feed.xml" rel="self" type="application/atom+xml" /><link href="http://localhost:4000/" rel="alternate" type="text/html" /><updated>2017-10-10T20:09:55+05:30</updated><id>http://localhost:4000/</id><title type="html">VARSTACK</title><subtitle></subtitle><entry><title type="html">An intern’s views - End of Diary</title><link href="http://localhost:4000/2017/07/29/End-of-Diary/" rel="alternate" type="text/html" title="An intern's views - End of Diary" /><published>2017-07-29T00:00:00+05:30</published><updated>2017-07-29T00:00:00+05:30</updated><id>http://localhost:4000/2017/07/29/End-of-Diary</id><content type="html" xml:base="http://localhost:4000/2017/07/29/End-of-Diary/">&lt;p&gt;The series:&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;&lt;a href=&quot;/2017/05/07/How-I-got-here/&quot;&gt;An intern's views - How I got here&lt;/a&gt;&lt;/li&gt;
......@@ -48,7 +48,7 @@ its' projects, is in a single repository, that everyone has access to. Which
means that, even as an intern I had tremendous amount of knowledge one click
away. While working, I often read other papers (design documents) of things
Google was working on, and I was never disappointed. Google is fascinating from
the inside.&lt;/p&gt;</content><author><name></name></author><category term="post" /><summary type="html">The series:</summary></entry><entry><title type="html">Mistakes are okay</title><link href="http://localhost:4000/2017/07/24/Mistakes-are-okay/" rel="alternate" type="text/html" title="Mistakes are okay" /><published>2017-07-24T00:00:00-04:00</published><updated>2017-07-24T00:00:00-04:00</updated><id>http://localhost:4000/2017/07/24/Mistakes-are-okay</id><content type="html" xml:base="http://localhost:4000/2017/07/24/Mistakes-are-okay/">&lt;p&gt;Hey.. Whoever is reading this.&lt;/p&gt;
the inside.&lt;/p&gt;</content><author><name></name></author><category term="post" /><summary type="html">The series:</summary></entry><entry><title type="html">Mistakes are okay</title><link href="http://localhost:4000/2017/07/24/Mistakes-are-okay/" rel="alternate" type="text/html" title="Mistakes are okay" /><published>2017-07-24T00:00:00+05:30</published><updated>2017-07-24T00:00:00+05:30</updated><id>http://localhost:4000/2017/07/24/Mistakes-are-okay</id><content type="html" xml:base="http://localhost:4000/2017/07/24/Mistakes-are-okay/">&lt;p&gt;Hey.. Whoever is reading this.&lt;/p&gt;
&lt;p&gt;This article has been sitting in my mind for a week now, and I finally decided
to write it. So, a week ago, a guy messages me to ask some tips on GSoC. I like
......@@ -125,7 +125,7 @@ mistakes. That others are capable of being silly at times. Stop comparing other
peoples (successes) with your (successes, failures). Please.&lt;/p&gt;
&lt;p&gt;If you think this article is worth re-telling, share it :)
&lt;br/&gt; &lt;br/&gt;&lt;/p&gt;</content><author><name></name></author><category term="post" /><summary type="html">Hey.. Whoever is reading this.</summary></entry><entry><title type="html">An intern’s views - How far have I come?</title><link href="http://localhost:4000/2017/07/10/How-far-have-I-come-working-at-Google/" rel="alternate" type="text/html" title="An intern's views - How far have I come?" /><published>2017-07-10T00:00:00-04:00</published><updated>2017-07-10T00:00:00-04:00</updated><id>http://localhost:4000/2017/07/10/How-far-have-I-come-working-at-Google</id><content type="html" xml:base="http://localhost:4000/2017/07/10/How-far-have-I-come-working-at-Google/">&lt;p&gt;AKA, what the hell about work? I have gone on and on about getting here. The
&lt;br/&gt; &lt;br/&gt;&lt;/p&gt;</content><author><name></name></author><category term="post" /><summary type="html">Hey.. Whoever is reading this.</summary></entry><entry><title type="html">An intern’s views - How far have I come?</title><link href="http://localhost:4000/2017/07/10/How-far-have-I-come-working-at-Google/" rel="alternate" type="text/html" title="An intern's views - How far have I come?" /><published>2017-07-10T00:00:00+05:30</published><updated>2017-07-10T00:00:00+05:30</updated><id>http://localhost:4000/2017/07/10/How-far-have-I-come-working-at-Google</id><content type="html" xml:base="http://localhost:4000/2017/07/10/How-far-have-I-come-working-at-Google/">&lt;p&gt;AKA, what the hell about work? I have gone on and on about getting here. The
things I found here. But I have still made no mention of what I do here. Well,
here it is. So sit back, and read on.&lt;/p&gt;
......@@ -149,11 +149,9 @@ the best position to help me deploy my code.&lt;/p&gt;
&lt;p&gt;Above them is our manager, and then more managers above him (in a nutshell).&lt;/p&gt;
&lt;p&gt;So what do I work on? Hmmm.. I am not sure if I'm allowed to say yet?&lt;/p&gt;
&lt;pre&gt;&lt;code&gt;TODO: Replace with a proper description of my work after project is released
as open source.
&lt;/code&gt;&lt;/pre&gt;
&lt;p&gt;So what do I work on? &lt;del&gt;Hmmm.. I am not sure if I'm allowed to say yet?&lt;/del&gt;
This blog article describes my project pretty well: &lt;a href=&quot;https://blog.bazel.build/2017/08/25/introducing-sandboxfs.html&quot;&gt;Introducing
Sandboxfs&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Anyway, I am in the Blaze team. Blaze is the internal name for Bazel
(&lt;a href=&quot;https://bazel.build&quot;&gt;https://bazel.build&lt;/a&gt;). To understand what Blaze is, first let's jog your
......@@ -174,15 +172,15 @@ minimizing the work done. For example, if only one file has changed, they'd try
not to build the whole project again, but just that one file. Now as projects
become complicated, these tools become inefficient, and slowly more and more
incompetent. Google has all their source code in one huge repository (really
really huge), and code can takes hours to build on parallel running machine
really huge), and code can take hours to build on parallel running machine
clusters. These tools can neither handle such complexity, nor the functionality
required for such a thing.&lt;/p&gt;
&lt;p&gt;This is where Bazel (Blaze) comes in. Blaze is &lt;em&gt;the&lt;/em&gt; build tool used by every
project in Google. It is what builds tens of thousands of projects everyday.
Now, Bazel is the open source version of Blaze, which other people can use in
their projects, but is mostly used by other companies (like Dropbox), whose
requirements are that huge.&lt;/p&gt;
their projects, but is mostly used by other companies (like Dropbox), who have
such huge requirements.&lt;/p&gt;
&lt;p&gt;If you are in a CS related field, you would've heard the term &quot;correctness&quot;
thrown around a lot. Proof of correctness of algorithms? Correctness in multi
......@@ -273,7 +271,7 @@ projects and planning lectures on just these topics.
&lt;p&gt;&lt;em&gt;Doubt? Question? Suggestion? I think the comment panel below works :)&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;Next in series: &lt;a href=&quot;/2017/07/29/End-of-Diary/&quot;&gt;An intern's views - End of diary&lt;/a&gt;&lt;/p&gt;</content><author><name></name></author><category term="post" /><summary type="html">AKA, what the hell about work? I have gone on and on about getting here. The things I found here. But I have still made no mention of what I do here. Well, here it is. So sit back, and read on.</summary></entry><entry><title type="html">An intern’s views - A month’s end at Google</title><link href="http://localhost:4000/2017/06/07/A-month-end-at-Google/" rel="alternate" type="text/html" title="An intern's views - A month's end at Google" /><published>2017-06-07T00:00:00-04:00</published><updated>2017-06-07T00:00:00-04:00</updated><id>http://localhost:4000/2017/06/07/A-month-end-at-Google</id><content type="html" xml:base="http://localhost:4000/2017/06/07/A-month-end-at-Google/">&lt;p&gt;The series:&lt;/p&gt;
&lt;p&gt;Next in series: &lt;a href=&quot;/2017/07/29/End-of-Diary/&quot;&gt;An intern's views - End of diary&lt;/a&gt;&lt;/p&gt;</content><author><name></name></author><category term="post" /><summary type="html">AKA, what the hell about work? I have gone on and on about getting here. The things I found here. But I have still made no mention of what I do here. Well, here it is. So sit back, and read on.</summary></entry><entry><title type="html">An intern’s views - A month’s end at Google</title><link href="http://localhost:4000/2017/06/07/A-month-end-at-Google/" rel="alternate" type="text/html" title="An intern's views - A month's end at Google" /><published>2017-06-07T00:00:00+05:30</published><updated>2017-06-07T00:00:00+05:30</updated><id>http://localhost:4000/2017/06/07/A-month-end-at-Google</id><content type="html" xml:base="http://localhost:4000/2017/06/07/A-month-end-at-Google/">&lt;p&gt;The series:&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;&lt;a href=&quot;/2017/05/07/How-I-got-here/&quot;&gt;An intern's views - How I got here&lt;/a&gt;&lt;/li&gt;
......@@ -438,7 +436,7 @@ part of the intern later.&lt;/p&gt;
&lt;p&gt;But till then, if you're reading this, leave a comment below :)&lt;/p&gt;
&lt;p&gt;Next in series: &lt;a href=&quot;/2017/07/10/How-far-have-I-come-working-at-Google/&quot;&gt;An intern's views - How far have I
come?&lt;/a&gt;&lt;/p&gt;</content><author><name></name></author><category term="post" /><summary type="html">The series:</summary></entry><entry><title type="html">An intern’s views - How I got here</title><link href="http://localhost:4000/2017/05/07/How-I-got-here/" rel="alternate" type="text/html" title="An intern's views - How I got here" /><published>2017-05-07T00:00:00-04:00</published><updated>2017-05-07T00:00:00-04:00</updated><id>http://localhost:4000/2017/05/07/How-I-got-here</id><content type="html" xml:base="http://localhost:4000/2017/05/07/How-I-got-here/">&lt;p&gt;AKA, how I got an internship in Google. In case you were wondering why the
come?&lt;/a&gt;&lt;/p&gt;</content><author><name></name></author><category term="post" /><summary type="html">The series:</summary></entry><entry><title type="html">An intern’s views - How I got here</title><link href="http://localhost:4000/2017/05/07/How-I-got-here/" rel="alternate" type="text/html" title="An intern's views - How I got here" /><published>2017-05-07T00:00:00+05:30</published><updated>2017-05-07T00:00:00+05:30</updated><id>http://localhost:4000/2017/05/07/How-I-got-here</id><content type="html" xml:base="http://localhost:4000/2017/05/07/How-I-got-here/">&lt;p&gt;AKA, how I got an internship in Google. In case you were wondering why the
actual title is so obscure, it is because I want this article to be mostly
linked by the rest of the (monthly) articles in this series (I'll update the
links as I write them)&lt;/p&gt;
......@@ -730,7 +728,7 @@ Google&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;&lt;/p&gt;</content><author><name></name></author><category term="post" /><summary type="html">AKA, how I got an internship in Google. In case you were wondering why the actual title is so obscure, it is because I want this article to be mostly linked by the rest of the (monthly) articles in this series (I'll update the links as I write them)</summary></entry><entry><title type="html">YourHonour: A k8s based distributed programming judge</title><link href="http://localhost:4000/2016/09/26/YourHonour-k8s-programming-judge/" rel="alternate" type="text/html" title="YourHonour: A k8s based distributed programming judge" /><published>2016-09-26T00:00:00-04:00</published><updated>2016-09-26T00:00:00-04:00</updated><id>http://localhost:4000/2016/09/26/YourHonour-k8s-programming-judge</id><content type="html" xml:base="http://localhost:4000/2016/09/26/YourHonour-k8s-programming-judge/">&lt;p&gt;So, this is something I have been working on recently for some time. The
&lt;br /&gt;&lt;/p&gt;</content><author><name></name></author><category term="post" /><summary type="html">AKA, how I got an internship in Google. In case you were wondering why the actual title is so obscure, it is because I want this article to be mostly linked by the rest of the (monthly) articles in this series (I'll update the links as I write them)</summary></entry><entry><title type="html">YourHonour: A k8s based distributed programming judge</title><link href="http://localhost:4000/2016/09/26/YourHonour-k8s-programming-judge/" rel="alternate" type="text/html" title="YourHonour: A k8s based distributed programming judge" /><published>2016-09-26T00:00:00+05:30</published><updated>2016-09-26T00:00:00+05:30</updated><id>http://localhost:4000/2016/09/26/YourHonour-k8s-programming-judge</id><content type="html" xml:base="http://localhost:4000/2016/09/26/YourHonour-k8s-programming-judge/">&lt;p&gt;So, this is something I have been working on recently for some time. The
project's name is YourHonour, and is is a Kubernetes(k8s) based Online Judge for
organising programming competitions.&lt;/p&gt;
......@@ -858,7 +856,7 @@ This seems to work well, and I haven't had much problem since.&lt;/p&gt;&lt;/li&
&lt;/ol&gt;
&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;/p&gt;</content><author><name></name></author><category term="post" /><summary type="html">So, this is something I have been working on recently for some time. The project's name is YourHonour, and is is a Kubernetes(k8s) based Online Judge for organising programming competitions.</summary></entry><entry><title type="html">Preparation for Google Summer of Code</title><link href="http://localhost:4000/2016/08/23/Preparing-for-Google-summer-of-code/" rel="alternate" type="text/html" title="Preparation for Google Summer of Code" /><published>2016-08-23T00:00:00-04:00</published><updated>2016-08-23T00:00:00-04:00</updated><id>http://localhost:4000/2016/08/23/Preparing-for-Google-summer-of-code</id><content type="html" xml:base="http://localhost:4000/2016/08/23/Preparing-for-Google-summer-of-code/">&lt;p&gt;&lt;strong&gt;Preface:&lt;/strong&gt; I have been selected for Google Summer of Code ’16 under Gentoo
&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;/p&gt;</content><author><name></name></author><category term="post" /><summary type="html">So, this is something I have been working on recently for some time. The project's name is YourHonour, and is is a Kubernetes(k8s) based Online Judge for organising programming competitions.</summary></entry><entry><title type="html">Preparation for Google Summer of Code</title><link href="http://localhost:4000/2016/08/23/Preparing-for-Google-summer-of-code/" rel="alternate" type="text/html" title="Preparation for Google Summer of Code" /><published>2016-08-23T00:00:00+05:30</published><updated>2016-08-23T00:00:00+05:30</updated><id>http://localhost:4000/2016/08/23/Preparing-for-Google-summer-of-code</id><content type="html" xml:base="http://localhost:4000/2016/08/23/Preparing-for-Google-summer-of-code/">&lt;p&gt;&lt;strong&gt;Preface:&lt;/strong&gt; I have been selected for Google Summer of Code ’16 under Gentoo
Organization.&lt;/p&gt;
&lt;p&gt;Firstly, I would suggest that you start now. Since I do not know anything about
......@@ -1047,7 +1045,7 @@ the &quot;About me&quot; page).&lt;/p&gt;
&lt;p&gt;Pallav Agarwal (&lt;a href=&quot;https://github.com/pallavagarwal07&quot;&gt;https://github.com/pallavagarwal07&lt;/a&gt;)&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Note 4:&lt;/strong&gt; This article was originally written as a Quora answer, and can still
be found on the website.&lt;/p&gt;</content><author><name></name></author><category term="post" /><summary type="html">Preface: I have been selected for Google Summer of Code ’16 under Gentoo Organization.</summary></entry><entry><title type="html">Learning from mistakes: Bugzilla Landfills</title><link href="http://localhost:4000/2016/06/09/Bugzilla-Landfills/" rel="alternate" type="text/html" title="Learning from mistakes: Bugzilla Landfills" /><published>2016-06-09T00:00:00-04:00</published><updated>2016-06-09T00:00:00-04:00</updated><id>http://localhost:4000/2016/06/09/Bugzilla-Landfills</id><content type="html" xml:base="http://localhost:4000/2016/06/09/Bugzilla-Landfills/">&lt;p&gt;This post is regarding a recent incident that happened when I was working for
be found on the website.&lt;/p&gt;</content><author><name></name></author><category term="post" /><summary type="html">Preface: I have been selected for Google Summer of Code ’16 under Gentoo Organization.</summary></entry><entry><title type="html">Learning from mistakes: Bugzilla Landfills</title><link href="http://localhost:4000/2016/06/09/Bugzilla-Landfills/" rel="alternate" type="text/html" title="Learning from mistakes: Bugzilla Landfills" /><published>2016-06-09T00:00:00+05:30</published><updated>2016-06-09T00:00:00+05:30</updated><id>http://localhost:4000/2016/06/09/Bugzilla-Landfills</id><content type="html" xml:base="http://localhost:4000/2016/06/09/Bugzilla-Landfills/">&lt;p&gt;This post is regarding a recent incident that happened when I was working for
my project in Google Summer of Code.&lt;/p&gt;
&lt;p&gt;My day's task was to automate the filing of a bug in bugzilla if and when a
......@@ -1067,7 +1065,7 @@ bug to numerous people.&lt;/p&gt;
that you can use for testing out something on a Bugzilla.&lt;/p&gt;
&lt;p&gt;&lt;i&gt;Thanks for reading&lt;/i&gt;
&lt;br /&gt;&lt;br /&gt;&lt;/p&gt;</content><author><name></name></author><category term="post" /><summary type="html">This post is regarding a recent incident that happened when I was working for my project in Google Summer of Code.</summary></entry><entry><title type="html">Determining legal USE Flag combinations using a CNF SAT Solver</title><link href="http://localhost:4000/2016/05/13/SAT-Solver/" rel="alternate" type="text/html" title="Determining legal USE Flag combinations using a CNF SAT Solver" /><published>2016-05-13T00:00:00-04:00</published><updated>2016-05-13T00:00:00-04:00</updated><id>http://localhost:4000/2016/05/13/SAT-Solver</id><content type="html" xml:base="http://localhost:4000/2016/05/13/SAT-Solver/">&lt;p&gt;I spent my time doing something rather interesting today.&lt;/p&gt;
&lt;br /&gt;&lt;br /&gt;&lt;/p&gt;</content><author><name></name></author><category term="post" /><summary type="html">This post is regarding a recent incident that happened when I was working for my project in Google Summer of Code.</summary></entry><entry><title type="html">Determining legal USE Flag combinations using a CNF SAT Solver</title><link href="http://localhost:4000/2016/05/13/SAT-Solver/" rel="alternate" type="text/html" title="Determining legal USE Flag combinations using a CNF SAT Solver" /><published>2016-05-13T00:00:00+05:30</published><updated>2016-05-13T00:00:00+05:30</updated><id>http://localhost:4000/2016/05/13/SAT-Solver</id><content type="html" xml:base="http://localhost:4000/2016/05/13/SAT-Solver/">&lt;p&gt;I spent my time doing something rather interesting today.&lt;/p&gt;
&lt;p&gt;In my proposal, I had
mentioned that the USE flag combinations to be tested would be:&lt;/p&gt;
......@@ -1132,7 +1130,7 @@ solutions as I want. Also the output is a bit easier on the eyes in the form of
&lt;p&gt;If you have any queries, post them below or open up an issue on github.&lt;/p&gt;
&lt;p&gt;&lt;i&gt;Thanks for reading&lt;/i&gt;
&lt;br /&gt;&lt;br /&gt;&lt;/p&gt;</content><author><name></name></author><category term="post" /><summary type="html">I spent my time doing something rather interesting today.</summary></entry><entry><title type="html">Reference Sheets and Useful Links</title><link href="http://localhost:4000/2016/05/13/Reference-Sheets-and-Useful-Links/" rel="alternate" type="text/html" title="Reference Sheets and Useful Links" /><published>2016-05-13T00:00:00-04:00</published><updated>2016-05-13T00:00:00-04:00</updated><id>http://localhost:4000/2016/05/13/Reference-Sheets-and-Useful-Links</id><content type="html" xml:base="http://localhost:4000/2016/05/13/Reference-Sheets-and-Useful-Links/">&lt;p&gt;This post was long due. I often find blog posts, reference sheets and useful links that
&lt;br /&gt;&lt;br /&gt;&lt;/p&gt;</content><author><name></name></author><category term="post" /><summary type="html">I spent my time doing something rather interesting today.</summary></entry><entry><title type="html">Reference Sheets and Useful Links</title><link href="http://localhost:4000/2016/05/13/Reference-Sheets-and-Useful-Links/" rel="alternate" type="text/html" title="Reference Sheets and Useful Links" /><published>2016-05-13T00:00:00+05:30</published><updated>2016-05-13T00:00:00+05:30</updated><id>http://localhost:4000/2016/05/13/Reference-Sheets-and-Useful-Links</id><content type="html" xml:base="http://localhost:4000/2016/05/13/Reference-Sheets-and-Useful-Links/">&lt;p&gt;This post was long due. I often find blog posts, reference sheets and useful links that
I feel I should bookmark. However, I often lose these bookmarks when I shift Operating
Systems or browsers (which happens very often). I am hoping that this will be a better
and a more reliable way to keep track of all these resources.&lt;/p&gt;
......
......@@ -122,7 +122,7 @@ loadCSS( "/css/search.css", document.getElementById("loadcss"));
<br />
<div class='tags'>
code:22, project:16, people:10, Google:9, work:8, review:7, intern:7, Blaze:6, way:5, view:5, tool:5, lot:5, code reviews:5, source:4, programming:4, problem:4, week:3, time:3, something:3, reviewer:3, request:3, point:3, name:3, dependencie:3, correctness:3, company:3, comment:3, college:3, Googler:3, Bazel:3, years coding:1, works:1, week 1 interns:1, week 1:1, test suites:1, source version:1, source code:1, request 400 lines:1, request:1, project B:1, programming projects:1, planning lectures:1, people aren:1, machine clusters:1, https bazel:1, expert nit picking:1, command structure:1, college right:1, code Reviews:1, change list:1, Style Guides:1, Star Trek:1, Programming Club IITK repositories:1, Next steps:1, Earth people:1, Dropbox:1, Blaze team:1, Anybody reading:1, Ant Maven CMake Gradle:1, 90 comments:1, 850 upvotes:1, 6 rows:1, 50 step radius:1, 5 people:1, 40 comments:1, 3 people:1, 2 weeks:1, 2 people:1,
code:22, project:16, people:10, Google:9, work:7, review:7, intern:7, Blaze:6, way:5, view:5, tool:5, lot:5, code reviews:5, programming:4, problem:4, week:3, time:3, source:3, something:3, reviewer:3, request:3, point:3, name:3, dependencie:3, correctness:3, company:3, comment:3, college:3, Googler:3, Bazel:3, years coding:1, works:1, week 1 interns:1, week 1:1, test suites:1, source version:1, source code:1, request 400 lines:1, request:1, project B:1, programming projects:1, planning lectures:1, people aren:1, machine clusters:1, https bazel:1, expert nit picking:1, command structure:1, college right:1, code Reviews:1, change list:1, blog article:1, Style Guides:1, Star Trek:1, Programming Club IITK repositories:1, Next steps:1, Earth people:1, Dropbox:1, Blaze team:1, Anybody reading:1, Ant Maven CMake Gradle:1, 90 comments:1, 850 upvotes:1, 6 rows:1, 50 step radius:1, 5 people:1, 40 comments:1, 3 people:1, 2 weeks:1, 2 people:1,
</div>
</div>
......
......@@ -2,123 +2,123 @@
<urlset 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" xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>http://localhost:4000/2015/06/18/IIT-Kanpur/</loc>
<lastmod>2015-06-18T00:00:00-04:00</lastmod>
<lastmod>2015-06-18T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2015/06/26/Linuxbrew/</loc>
<lastmod>2015-06-26T00:00:00-04:00</lastmod>
<lastmod>2015-06-26T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2015/06/30/Mouse-with-vim/</loc>
<lastmod>2015-06-30T00:00:00-04:00</lastmod>
<lastmod>2015-06-30T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2015/07/01/Vim-Customization/</loc>
<lastmod>2015-07-01T00:00:00-04:00</lastmod>
<lastmod>2015-07-01T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2015/07/01/Vim-Mappings/</loc>
<lastmod>2015-07-01T00:00:00-04:00</lastmod>
<lastmod>2015-07-01T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2015/07/03/Vim-Plug-Plugin-Manager/</loc>
<lastmod>2015-07-03T00:00:00-04:00</lastmod>
<lastmod>2015-07-03T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2015/07/08/Vim-Colorscheme/</loc>
<lastmod>2015-07-08T00:00:00-04:00</lastmod>
<lastmod>2015-07-08T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2015/07/09/Vim-Plugins/</loc>
<lastmod>2015-07-09T00:00:00-04:00</lastmod>
<lastmod>2015-07-09T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2015/07/09/Wrath-of-Linux-Package-Managers/</loc>
<lastmod>2015-07-09T00:00:00-04:00</lastmod>
<lastmod>2015-07-09T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2015/07/27/Boost-Python-Performance/</loc>
<lastmod>2015-07-27T00:00:00-04:00</lastmod>
<lastmod>2015-07-27T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2015/08/01/SSH-from-Windows/</loc>
<lastmod>2015-08-01T00:00:00-04:00</lastmod>
<lastmod>2015-08-01T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2015/08/01/Windows-10/</loc>
<lastmod>2015-08-01T00:00:00-04:00</lastmod>
<lastmod>2015-08-01T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2015/08/24/Shared-TMUX-sessions/</loc>
<lastmod>2015-08-24T00:00:00-04:00</lastmod>
<lastmod>2015-08-24T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2015/10/06/Introduction-to-Cimulator/</loc>
<lastmod>2015-10-06T00:00:00-04:00</lastmod>
<lastmod>2015-10-06T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2015/12/10/Configuration-Management-in-Linux/</loc>
<lastmod>2015-12-10T00:00:00-05:00</lastmod>
<lastmod>2015-12-10T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2015/12/12/Linux-commands-every-user-should-master/</loc>
<lastmod>2015-12-12T00:00:00-05:00</lastmod>
<lastmod>2015-12-12T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2016/04/27/SSH-keys/</loc>
<lastmod>2016-04-27T00:00:00-04:00</lastmod>
<lastmod>2016-04-27T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2016/04/30/Google-Summer-of-Code-with-Gentoo/</loc>
<lastmod>2016-04-30T00:00:00-04:00</lastmod>
<lastmod>2016-04-30T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2016/05/06/SSH-port-forwarding-and-some-cool-uses/</loc>
<lastmod>2016-05-06T00:00:00-04:00</lastmod>
<lastmod>2016-05-06T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2016/05/06/Ultimate-control-over-mobile-browser/</loc>
<lastmod>2016-05-06T00:00:00-04:00</lastmod>
<lastmod>2016-05-06T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2016/05/13/Reference-Sheets-and-Useful-Links/</loc>
<lastmod>2016-05-13T00:00:00-04:00</lastmod>
<lastmod>2016-05-13T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2016/05/13/SAT-Solver/</loc>
<lastmod>2016-05-13T00:00:00-04:00</lastmod>
<lastmod>2016-05-13T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2016/06/09/Bugzilla-Landfills/</loc>
<lastmod>2016-06-09T00:00:00-04:00</lastmod>
<lastmod>2016-06-09T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2016/08/23/Preparing-for-Google-summer-of-code/</loc>
<lastmod>2016-08-23T00:00:00-04:00</lastmod>
<lastmod>2016-08-23T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2016/09/26/YourHonour-k8s-programming-judge/</loc>
<lastmod>2016-09-26T00:00:00-04:00</lastmod>
<lastmod>2016-09-26T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2017/05/07/How-I-got-here/</loc>
<lastmod>2017-05-07T00:00:00-04:00</lastmod>
<lastmod>2017-05-07T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2017/06/07/A-month-end-at-Google/</loc>
<lastmod>2017-06-07T00:00:00-04:00</lastmod>
<lastmod>2017-06-07T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2017/07/10/How-far-have-I-come-working-at-Google/</loc>
<lastmod>2017-07-10T00:00:00-04:00</lastmod>
<lastmod>2017-07-10T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2017/07/24/Mistakes-are-okay/</loc>
<lastmod>2017-07-24T00:00:00-04:00</lastmod>
<lastmod>2017-07-24T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/2017/07/29/End-of-Diary/</loc>
<lastmod>2017-07-29T00:00:00-04:00</lastmod>
<lastmod>2017-07-29T00:00:00+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/search/</loc>
......@@ -127,13 +127,13 @@
<loc>http://localhost:4000/</loc>
</url>
<url>
<loc>http://localhost:4000/tips/</loc>
<loc>http://localhost:4000/about_me/</loc>
</url>
<url>
<loc>http://localhost:4000/algo/</loc>
<loc>http://localhost:4000/tips/</loc>
</url>
<url>
<loc>http://localhost:4000/about_me/</loc>
<loc>http://localhost:4000/algo/</loc>
</url>
<url>
<loc>http://localhost:4000/page2/</loc>
......@@ -143,14 +143,14 @@
</url>
<url>
<loc>http://localhost:4000/404.html</loc>
<lastmod>2017-03-15T13:26:07-04:00</lastmod>
<lastmod>2017-08-14T00:16:35+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/img/gsoc.pdf</loc>
<lastmod>2016-09-26T13:59:40-04:00</lastmod>
<lastmod>2017-08-14T00:16:36+05:30</lastmod>
</url>
<url>
<loc>http://localhost:4000/res/resume.pdf</loc>
<lastmod>2017-06-05T21:06:08-04:00</lastmod>
<lastmod>2017-08-14T00:16:36+05:30</lastmod>
</url>
</urlset>
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment