Next Right Now
Next Right Now (NRN) is meant to help you build production-grade projects using the Next.js framework.
NRN is maintained with several purposes in mind:
- To be used as a boilerplate to quickly deploy a new project.
- It is used in production by Unly, and thus covers enterprise-grade features and needs.
- It has been used to build production-grade websites within 2h time during a French COVID-19 hackathon. (March 2020)
- It has been used to build Unly Solidarity, a fully static website meant to help French students find various solutions regarding the COVID-19 pandemic.
- It has been used to build NRN Admin (Now unmaintained/discontinued)
- To be used as an educational resource, meant to be used as a learning/teaching resource, even if you don't use it as a boilerplate.
- Provide various presets, to help you getting started with the preset that matches the closest your needs.
- To be flexible and allow for extensive customisation, based on your own needs and use-cases.
Don't hesitate to share your opinion about your "getting started" experience!
Documentation
There are several sources of documentation:
- General documentation contains general documentation about the NRN project.
- Great to learn about our concepts and get an overview of all features NRN has to offer
- Demo documentation, which is different for each preset and showcases built-in features within that preset.
- Great to see code usage examples
Both documentations are related and there are many links from the demos toward the general doc.
Overview of available presets
Make sure to check the Doc link of each preset below, to better understand what are the built-in features within each preset.
| Preset | Links | Demo | Features | Notes |
|---|---|---|---|---|
v2-mst-aptd-at-lcz-sty July 2020 |
- Doc - Branch - PR |
- Customer 1 (prod) - Customer 1 (preview) - Customer 2 (prod) - Customer 2 (preview) - Customer 1 CMS - Customer 2 CMS |
- Analytics (Amplitude) - Airtable (DB) - Stacker CMS - I18n (Airtable + Locize) - Monitoring (Sentry) |
- Features a very rich (and complex) application with lots of tooling. Similar to v2-mst-aptd-gcms-lcz-sty but provides a much better build-in CMS and more advanced features like Quick preview - Beware Locize static i18n support doesn't come for free, nor does Stacker once you've deployed your app into production. |
v2-mst-aptd-gcms-lcz-sty May 2020 |
- Doc - Branch - PR |
- Customer 1 (prod) - Customer 1 (preview) - Customer 2 (prod) - Customer 2 (preview) - GraphCMS (credentials in demo) |
- Analytics (Amplitude) - GraphQL (GraphCMS API v2) -GraphCMS CMS - I18n (GraphCMS + Locize) - Monitoring (Sentry) |
- Features a very rich (and complex) application with lots of tooling. - Beware Locize static i18n support doesn't come for free. |
v1-ssr-mst-aptd-gcms-lcz-sty
2019 |
- Doc - Branch |
Online demos have been removed due to deprecation | - Analytics (Amplitude) - GraphQL (GraphCMS) - I18n (GraphCMS + Locize) - Monitoring (Sentry) |
- Features a very rich (and complex) application with lots of tooling. - Beware Locize static i18n support doesn't come for free. |
Quick start
Go to our "Quick start" section.
Testimonials
"We initially built our app with Create React App and as our product evolves we needed to have a solid SEO.We planned to migrate to NextJS, but it looked very time-consuming to set up everything again.Here's come Next Right Now providing a complete boilerplate with great tools already integrated like Sentry or Locize.TypeScript, with good typings, is the icing on the cake.It helps us a lot to move quickly on NextJS." - ApplyFuture, 2020-10
"Edooking is a digital marketplace for the international education industry. It was born in 2019 and we wanted it to be built in a stable and scalable platform, so we decided to use Next.js. After months implementing the MVP we saw that it was going to take a long time to implement all the basic features we needed like i18n, Sentry, Locize and Amplitude, after some research we found Next-Right-Now, a production-grade solution that speeded our development workflow a lot, the work that was going to take months became days. After more than a year using it we're very happy with the decision we made. Maintainers are very responsive and the code is really well written." - Samuel Silva | Edooking, 2021-06
FAQ
CHANGELOG
Contributing
Roadmap
License
Vulnerability disclosure
Contributors and maintainers
This project is being authored by:
- [Unly] Ambroise Dhenain (Vadorequest) (active)
Special thanks to our contributors:
- Hugo Martin (Demmonius) - Github Actions CI/CD pipeline
- Sovattha SOK (sovattha) - GraphQL Authorization
- Samuel Castro (samuelcastro) - Various stuff
- Joshua Andrew Jourdain (jajourda) - Documentation
[ABOUT UNLY] 
Unly is a socially responsible company, fighting inequality and facilitating access to higher education.Unly is committed to making education more inclusive, through responsible funding for students.
We provide technological solutions to help students find the necessary funding for their studies.
We proudly participate in many TechForGood initiatives. To support and learn more about our actions to make education accessible, visit :
- https://twitter.com/UnlyEd
- https://www.facebook.com/UnlyEd/
- https://www.linkedin.com/company/unly
- Interested to work with us?
Tech tips and tricks from our CTO on our Medium page!
#TECHFORGOOD #EDUCATIONFORALL
-
8222. Substrings Problem code: NSUBSTR You are given a string S which consists of 250000 lowercase latin letters at most. We define F(x) as the maximal number of times that some string with length x a
-
The “right-left” rule is a completely regular rule for deciphering C declarations. It can also be useful in creating them. “左右”规则是解密C的完全规则声明。在创建它们时也很有用. First, symbols. Read as “pointer to” - always o
-
Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate each next pointer to point to its next right node. If there is no next right nod
-
Solution 1 对于前一个题 0116. Populating Next Right Pointers in Each Node ，其方法一对于树的内部结构是无关的，因此可以直接拿过来用 时间复杂度： O ( N ) O(N) O(N)，其中 N N N为输入序列的节点个数，线性遍历处理输入 空间复杂度： O ( 2 ⌊ log N ⌋ ) O(2^{\lfloor \log N \rf
-
Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate each next pointer to point to its next right node. If there
-
Populating Next Right Pointers in Each Node 描述 Given a binary tree struct TreeLinkNode { int val; TreeLinkNode *left, *right, *next; TreeLinkNode(int x) : val(x), left(NULL), right(NULL), nex
-
Populating Next Right Pointers in Each Node II 描述 Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tree could be any binary tree? Would your previous solution sti
-
此方法从字符串的右侧返回一定数量的字符。 语法 (Syntax) right(str,count) 参数 (Parameters) str - 源字符串。 count - 从字符串左侧返回的字符数。 返回值 (Return Value) 此方法从字符串的右侧返回一定数量的字符。 例子 (Example) /* Main program */ a = "Hello World" say ri
-
Right函数从给定输入字符串的右侧返回指定数量的字符。 语法 (Syntax) Right(String, Length) 参数描述 (Parameter Description) String - 必需参数。 输入从右侧返回指定字符数的字符串。 Length - 必需参数。 一个Integer，指定要返回的字符数。 例子 (Example) 添加按钮并添加以下功能。 Private Sub
-
描述 (Description) left属性用于定位元素。 右侧属性允许您指定元素从其包含块的左侧偏移的距离（用于绝对定位），或者从元素本身通常所在的位置右侧（用于相对定位）。 可能的值 (Possible Values) length - 距离定位上下文右侧的固定距离。 percent - 定义上下文宽度的某个百分比，假设已明确设置上下文的宽度。 auto - 默认。 让浏览器计算左侧位置。