. How to save a Form into database in Django Skip to main content

How to save a Form into database in Django

Django is the most popular framework for python.

Here we'll discuss about save a form into database in Django.


Step 1: 

First create a model 'models.py' for DB table.
we are creating a model named 'Request'.

 from django.db import models  
 # Create your models here.  
 class Request(models.Model):  
   request_url = models.CharField(max_length=255)  
   created_at = models.DateTimeField('date published')  

run command
python manage.py migrate
. This will create a table into your DB, with two columns.`request_url` and `created_at`.

Step 2:

 Now create a 'forms.py' to define your form. This will render a form in template with HTML code. 
Here creating a form 'RequestForm'.

 from django import forms  
 class RequestForm(forms.Form):  
   request_url = forms.CharField(label="Enter your URL", max_length=500)  

we have a single field form 'request_url'
Now import your model and form into your views. Discuss in next step.

Step 3:

views.py 

 from django.shortcuts import render, get_object_or_404  
 from django.http import HttpResponse, Http404, HttpResponseRedirect  
 from .models import Request  
 from .forms import RequestForm  
 from django.utils import timezone  
 # Create your views here.  
 def index(request):  
   if request.method == 'POST':  
     form = RequestForm(request.POST)  
     if form.is_valid():  
       request_obj = Request(request_url = request.POST.get('request_url'), created_at = timezone.now())  
       request_obj.save()  
       return HttpResponseRedirect("/client")  
   else:  
     form = RequestForm()  
   context = {  
     'title': "Save form",  
     'form': form  
   }  
   return render(request, 'client/index.html', context)  

In views.py we import our model and Form, and render a template which is exist in our app directory.
To render a form on HTML page create a page 'index.html'

Step 4:

index.html

 <form action="/client/" method="post" class="col s12">  
       {% csrf_token %}  
       <div class="row">  
         {{form}}  
         <div class="col s6">  
          <input type="submit" class="waves-effect waves-light btn" value="Submit">  
         </div>  
       </div>  
     </form>  

Here '{{ form }}' is a variable which sent from the views. It has an object of form which is created in forms.py

Now our form is ready.
views.py already has the code to save form into databse. But we clarify again to better understand to save a form.

 if request.method == 'POST':   
    form = RequestForm(request.POST)   
    if form.is_valid():   
     request_obj = Request(request_url = request.POST.get('request_url'), created_at = timezone.now())   
     request_obj.save()   
     return HttpResponseRedirect("/client")   
   else:   
    form = RequestForm()   

This code already placed in views.py.

Explain:

if request.method == 'POST': 

it will check the form is submitted or  not.  We have POST method in form. When form will submit the request method will change from GET to POST and we match the condition.
 
if form.is_valid():  
It will check all required validation rules which is already defined in forms.py.

request_obj = Request(request_url = request.POST.get('request_url'), created_at = timezone.now())   
     request_obj.save()   
     return HttpResponseRedirect("/client")   

And here we create an object of our model and put the form values init.
Then call the 'save()' method to save all values in db.
Thats it.


Comments

Popular posts from this blog

Day 9 - Challenge 1 - Product of Array Except Self

Solving the "Product of Array Except Self" Problem in JavaScript Are you ready to dive into a common coding challenge that not only tests your programming skills but also sharpens your problem-solving mindset? If you're up for the challenge, let's tackle the "Product of Array Except Self" problem together using JavaScript. This problem requires us to return an array where each element at index i is the product of all the elements in the original array except the one at index i . Understanding the Problem:   Imagine you're given an array of integers, let's call it nums . Your task is to create a new array where the value at index i in this new array is the product of all the elements in nums , except the one at index i . In other words, you're calculating the product of all the elements to the left of nums[i] and the product of all the elements to the right of nums[i] , and then multiplying these two products to get the final value at index i ...

Day 9 - Challenge 2 - Reverse Linked List

Reversing a Singly Linked List in JavaScript: An In-Place Approach Introduction:   Singly linked lists are fundamental data structures in computer science that consist of a sequence of nodes, each containing data and a reference to the next node in the list. Reversing a singly linked list is a classic problem that challenges programmers to manipulate pointers effectively to achieve the desired outcome. In this blog post, we'll explore the problem of reversing a singly linked list using an in-place approach and provide a step-by-step solution in JavaScript. Problem Statement:   Given the head of a singly linked list, our task is to reverse the list in-place and return its new head. In other words, we need to modify the pointers of the nodes in such a way that the direction of the linked list is reversed. Solution Approach:   To solve this problem, we will iterate through the linked list while maintaining three pointers: previous , current , and next . The previous pointer...

Day 8 - Challenge 2 - Move Zeroes to the End

Moving Zeroes to the End: A JavaScript Solution Introduction:   When working with arrays, there are often times when we need to manipulate their elements to achieve a specific goal. One common problem is moving all zeroes to the end of an array while keeping the order of non-zero elements unchanged. In this blog post, we will explore an elegant solution to this problem using JavaScript. We'll discuss the problem statement, the approach we'll take, and provide a step-by-step guide to implementing the solution. The Problem:   Given an array of integers, the task is to move all zeroes to the end of the array while maintaining the relative order of the non-zero elements. This means that after rearranging the array, all the zeroes should be at the end, and the order of the non-zero elements should remain the same. The Approach:   To solve this problem, we can utilize a two-pointer approach. We'll maintain two pointers, one for iterating through the array and another for keepin...