Skip to main content

Flask 1 - Set Up a Basic App

🍶 Flask is a framework to build websites. Here, we will make a simple blogging website. Below are the steps to start.
  1. Install Python 
  2. Install Pip 
  3. Install Flask

Run the following code in Command Line:

import flask #TO CHECK IF FLASK IS INSTALLED
exit() #TOEXIT FLASK
cd inqzit #TO GO TO THE FOLDER

Create a python file and name it app_001001_start.py. Add the following code in it.

from flask import Flask
app = Flask(__name__)

@app.route("/")
def hello():

    return "Hello World!"

Run the following code in Command Line:

set FLASK_APP=app_001001_start.py #TO START RUNNING THE APPLICATION SERVER
set FLASK_DEBUG = 1 #TO AUTO RUN SERVER WHEN FILES UPDATED
flask run #TO RUN THE SERVER

Go to http://127.0.0.1:5000/ or http://localhost:5000/ in browser.

Instead of set FLASK_DEBUG = 1 line, we can add a few lines of code in the python file itself for auto run of server when a file is updated. Add the following code in the file.

if __name__=='__main__':

app.run(debug=True)

Add another page to website

Simply add the following lines of code again. This time with a different url:

@app.route("/about")
def about():

    return "<h1>About Us</h1>"

To add another URL that calls the same function or page, simply add @app.route("/anything") above it. See in below example:

@app.route("/home")
@app.route("/about")
def about():

    return "<h1>About Us</h1>"
Labels:

Comments

Post a Comment

Popular posts from this blog

Python - List - Append, Count, Extend, Index, Insert, Pop, Remove, Reverse, Sort

🐍 Advance List List is widely used and it's functionalities are heavily useful. Append Adds one element at the end of the list. Syntax list1.append(value) Input l1 = [1, 2, 3] l1.append(4) l1 Output [1, 2, 3, 4] append can be used to add any datatype in a list. It can even add list inside list. Caution: Append does not return anything. It just appends the list. Count .count(value) counts the number of occurrences of an element in the list. Syntax list1.count(value) Input l1 = [1, 2, 3, 4, 3] l1.count(3) Output 2 It returns 0 if the value is not found in the list. Extend .count(value) counts the number of occurrences of an element in the list. Syntax list1.extend(list) Input l1 = [1, 2, 3] l1.extend([4, 5]) Output [1, 2, 3, 4, 5] If we use append, entire list will be added to the first list like one element. Extend, i nstead of considering a list as one element, it joins the two lists one after other. Append works in the following way. Input l1 = [1, 2, 3] l1.append([4, 5]) Output...
Post a Comment
Read more

Difference between .exec() and .execPopulate() in Mongoose?

Here I answer what is the difference between .exec() and .execPopulate() in Mongoose? .exec() is used with a query while .execPopulate() is used with a document Syntax for .exec() is as follows: Model.query() . populate ( 'field' ) . exec () // returns promise . then ( function ( document ) { console . log ( document ); }); Syntax for .execPopulate() is as follows: fetchedDocument . populate ( 'field' ) . execPopulate () // returns promise . then ( function ( document ) { console . log ( document ); }); When working with individual document use .execPopulate(), for model query use .exec(). Both returns a promise. One can do without .exec() or .execPopulate() but then has to pass a callback in populate.
1 comment
Read more

683 K Empty Slots

  Approach #1: Insert Into Sorted Structure [Accepted] Intuition Let's add flowers in the order they bloom. When each flower blooms, we check it's neighbors to see if they can satisfy the condition with the current flower. Algorithm We'll maintain  active , a sorted data structure containing every flower that has currently bloomed. When we add a flower to  active , we should check it's lower and higher neighbors. If some neighbor satisfies the condition, we know the condition occurred first on this day. Complexity Analysis Time Complexity (Java):  O(N \log N) O ( N lo g N ) , where  N N  is the length of  flowers . Every insertion and search is  O(\log N) O ( lo g N ) . Time Complexity (Python):  O(N^2) O ( N 2 ) . As above, except  list.insert  is  O(N) O ( N ) . Space Complexity:  O(N) O ( N ) , the size of  active . Approach #2: Min Queue [Accepted] Intuition For each contiguous block ("window") of  k  po...
Post a Comment
Read more