Hugo static site generator

Hugo static site generator

Hugo is a general-purpose website framework. Technically speaking, Hugo is a static site generator. Unlike other systems which dynamically build a page every time a visitor requests one, Hugo does the building when you create your content. Since websites are viewed far more often than they are edited, Hugo is optimized for website viewing while providing a great writing experience.

Sites built with Hugo are extremely fast and very secure. Hugo sites can be hosted anywhere, including Heroku, GoDaddy, DreamHost, GitHub Pages, Google Cloud Storage, Amazon S3 and CloudFront, and work well with CDNs. Hugo sites run without dependencies on expensive runtimes like Ruby, Python or PHP and without dependencies on any databases.

We think of Hugo as the ideal website creation tool. With nearly instant build times and the ability to rebuild whenever a change is made, Hugo provides a very fast feedback loop. This is essential when you are designing websites, but also very useful when creating content.

What makes Hugo different?

Web site generators render content into HTML files. Most are “dynamic site generators.” That means the HTTP server (which is the program running on your website that the user’s browser talks to) runs the generator to create a new HTML file each and every time a user wants to view a page.

Creating the page dynamically means that the computer hosting the HTTP server has to have enough memory and CPU to effectively run the generator around the clock. If not, then the user has to wait in a queue for the page to be generated.

Nobody wants users to wait longer than needed, so the dynamic site generators programmed their systems to cache the HTML files. When a file is cached, a copy of it is temporarily stored on the computer. It is much faster for the HTTP server to send that copy the next time the page is requested than it is to generate it from scratch.

Hugo takes caching a step further. All HTML files are rendered on your computer. You can review the files before you copy them to the computer hosting the HTTP server. Since the HTML files aren’t generated dynamically, we say that Hugo is a “static site generator.”

Not running a web site generator on your HTTP server has many benefits. The most noticeable is performance – HTTP servers are very good at sending files. So good that you can effectively serve the same number of pages with a fraction of the memory and CPU needed for a dynamic site.

Hugo has two components to help you build and test your web site. The one that you’ll probably use most often is the built-in HTTP server. When you run hugo server, Hugo renders all of your content into HTML files and then runs a HTTP server on your computer so that you can see what the pages look like.

The second component is used when you’re ready to publish your web site to the computer running your website. Running Hugo without any actions will rebuild your entire web site using the baseurl setting from your site’s configuration file. That’s required to have your page links work properly with most hosting companies.

Professor Rob J Hyndman

Professor Rob J Hyndman
Rob J Hyndman is Professor of Statistics in the Department of Econometrics and Business Statistics at Monash University and Director of the Monash University Business & Economic Forecasting Unit. He is also Editor-in-Chief of the International Journal of Forecasting and a Director of the International Institute of Forecasters. Rob is the author of over 100 research papers in statistical science. In 2007, he received the Moran medal from the Australian Academy of Science for his contributions to statistical research, especially in the area of statistical forecasting. For 25 years, Rob has maintained an active consulting practice, assisting hundreds of companies and organizations. His recent consulting work has involved forecasting electricity demand, tourism demand, the Australian government health budget and case volume at a US call centre.

John Myles White: “He who refuses to do arithmetic is doomed to talk nonsense.”

John Myles White: “He who refuses to do arithmetic is doomed to talk nonsense.”
This term, I’ve been sitting in on Rene Carmona’s course on Modern Regression and Time Series Analysis. Much of the material on regression covered in the course was familiar to me already, but I’ve never felt that I had a real command of times series analysis methods. When Carmona defined the AR(p) model in class a few weeks ago, it struck me that, though I’d seen the defining equation several times before, I’d never realized earlier that the AR(p) model subsumes all possible linear recurrence relations. Also, the AR(p) model has the nice property that, if you already know the correct value of p, fitting the AR(p) model can be done with an ordinary least squares regression.

John D. Cook Blog

John D. Cook Blog
Suppose you have a number x between 0 and 1. You want to find a rational approximation for x, but you only want to consider fractions with denominators below a given limit. For example, suppose x = 1/e = 0.367879… Rational approximations with powers of 10 in the denominator are trivial to find: 3/10, 36/100, 367/1000, etc. But say you’re willing to have a denominator as large as 10. Could you do better than 3/10? Yes, 3/8 = 0.375 is a better approximation. What about denominators no larger than 100? Then 32/87 = 0.36781… is the best choice, much better than 36/100. How do you find the best approximations? You could do a brute force search. For example, if the maximum denominator size is N, you could try all fractions with denominators less than or equal to N. But there’s a much more efficient algorithm. The algorithm is related to the Farey sequence named after John Farey, though I don’t know whether he invented the algorithm. The idea is to start with two fractions, a/b = 0/1 and

Steve Corona | lessons in life hacking

Steve Corona | lessons in life hacking
I’m Steve Corona. I failed out of college when I was 19 and learned a few lessons along the way. I went from sleeping on the floor of my apartment to being the CTO of Twitpic, a 50 million user startup. My blog has been featured on the New York Times, LifeHacker, Fast Company and a bunch of other important sounding news sites. I enjoy speaking at conferences and meetups near San Francisco, so I do that pretty often. Last year, I was able to speak at WebExpo Prague and it was awesome. All blogs and accounts receiving more than 3,000 visits a day All blogs and accounts receiving more than 3,000 visits a day
A package of bills meant to reinforce the fight against terrorism is to go before the Russian parliament for second reading today. They include a telecommunications bill that was much changed in committee on 15 April. If it is adopted in its present form, blogs and social networks with more than 3,000 visits a day will be subject to requirements similar to news media and will have to register with Roskomnadzor, the communications oversight agency. All blogs and accounts receiving more than 3,000 visits a day will henceforth be required to carry the author’s surname, initials and email address From the Canyon Edge – :-Dustin Kirkland From the Canyon Edge – :-Dustin Kirkland
Dustin Kirkland is Canonical’s Cloud Solutions Product Manager, leading the technical product strategy, road map, and life cycle of the Ubuntu Cloud commercial offerings. Formerly the CTO of Gazzang, a venture funded start-up, Dustin designed and implemented an innovative key management system for the cloud, called zTrustee, and delivered comprehensive security for cloud and big data platforms with eCryptfs and other encryption technologies. Dustin is an active Core Developer of the Ubuntu Linux distribution, maintainer of 20+ open source projects, and the creator of Byobu,, and A Fightin’ Texas Aggie Class of 2001 graduate, Dustin lives in Austin, Texas, with his wife Kim, daughters, and his Australian Shepherds, Aggie and Tiger. Dustin is also an avid home brewer.

Attractive Chaos – Just another weblog

Attractive Chaos – Just another weblog
Directory Programming My programs (See Programs page) Comparison of hash table libraries Comparison of internal sorting algorithms C++ reduces coding time? Garbage collection for C Memory allocation on the heap vs. on the stack Mastering C pointers (or not)? Bioinformatics The Eland short read aligner Biased benchmark on short read aligners: ZOOM The best multialigment program Mathematics The missing theorem in popular books on chaos Derivative-free optimization (DFO) Wild thinking What is moral? Language war Tips Converting source codes to HTML