Skip to main content

005 Inbuilt and Custom Template Tag Filter in Django

Inbuilt and Custom Template Tag Filter in Django

Inbuilt Filter

  • One can use in-built filters directly
  • See an example of in-built filters below. data.number is passed from view and 99 is added to the passed value before displaying

index.html

<!DOCTYPE html>{% extends "mainApp/base.html" %}
    {% block body_block %}
        <div class="container">
            <div class="jumbotron">
                <h1>Welcome to a project about users</h1>
                <h2>{{ data.number|add:"99" }}</h2>
            </div>
        </div>
    {% endblock %}

Custom Filter

  • To create a custom filter as per your unique needs follow this process:
  • Inside app folder, create a folder named templatetags
  • Inside templatetags create a blank file named __init__.py. This tells python that templatetags is a package
  • Create another file named my_extras.py. This is where custom filters will be coded
  • The following example will show how to remove the word "World" from a string.

index.html

<!DOCTYPE html>{% extends "mainApp/base.html" %}
    {% block body_block %}
        <div class="container">
            <div class="jumbotron">
                <h1>Welcome to a project about users</h1>
                <h2>{{ data.text|cut:"World" }}</h2>
            </div>
        </div>
    {% endblock %}
  • And the function will be written in app > templatetags > my_extras.py
# Create Own Template Filter
from django import template

register = template.Library()


@register.filter(name='cut')
def cutout(value, arg):
    """    This cuts out all the values of 'arg' from the string!    :param value:    :param arg:    :return:    """    return value.replace(arg, '')

# register.filter('cut', cutout)
  • And that's how we do it

Comments

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...

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.

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...