Skip to main content

A look into the pre-release in Python 3.10

 

A look into the pre-release in Python 3.10

Python 3.10 is around the corner and if you want to download the pre-release version of Python 3.10 then head to the link or check out the references at the end of the article.

Photo by Clément Hélardot on Unsplash

So, there are few new things added to Python, and if you want to check all of them out head to this link. But here are the two features that I really like:

Structural Pattern Matching

The match statement first evaluates the subject expression. If a comma is present a tuple is constructed using the standard rules. This has a similar structure as the switch case.

This looks like a powerful tool when matching multiple values in an object or even a tuple.

Fig.1. Simple example using match

Let’s see a small example wherein you might need to retrieve 2 or 3 values based on input. The match pattern helps you to do that easily.

Fig.2. Creating two classes Point3d and Point2d

Let’s create a function that will return Point3d or Point2d object based on input passed as arguments.

Fig.3. Creating a function to return a point value

The match pattern works with any value thus making this work for strings as well thanks to Python’s dynamic nature.

Fig.4. Works for strings as well
Fig.5. Using | for multiple cases

Allow writing union types as X | Y

A new type of union operator was introduced which enables the syntax X | Y. This provides a cleaner way of expressing ‘either type X or type Y’ instead of using typing.Union, especially in type hints.

Fig.6. Union types as X | Y

References:

Python Release Python 3.10.0rc1
Release Date: Aug. 2, 2021, This release, 3.10.0rc1, is the penultimate release preview. Entering the release candidate…www.python.org
PEP 634 -- Structural Pattern Matching: Specification
This PEP provides the technical specification for the match statement. It replaces PEP 622, which is hereby split in…www.python.org
PEP 604 -- Allow writing union types as X | Y
This PEP proposes overloading the | operator on types to allow writing Union[X, Y] as X | Y and allows it to appear in…www.python.org


Labels:

Comments

Post a Comment

Popular posts from this blog

How to use Chess com API using Python

  How to use Chess com API using Python Chess is an amazing strategy-based game and if you have been following the recent boom of online chess then welcome to the chess club. Online chess is amazing since it allows you to play with a random stranger at your level or stockfish (computer). There are many popular online chess websites like lichess.org, chess.com, playchess.com, and newly created kasparovchess.com. Today we will be seeing how to use chess.com API for getting players' stats. You can create software and get affiliates from them (check out the link below), so share it with them if you are planning to create something. Before you start make sure you have the following things: Pre-requirements Postman Anaconda or mini conda or Python idle Any text editor of your choice Pretty good? Now let’s download the JSON file that chess com developers have already made for us from here and then you import it to the Postman. This just helps you with prewritten get methods so that ...
Post a Comment
Read more

First Repeating Element | Easy | Techgig

First Repeating Element | Easy | Techgig C++ Solution First Repeating Element | Easy | Techgig C++ Solution The first repeating element is the problem that comes under the Linear Search problem under the Algorithm section. Linear Search or sequential search is a method for finding an element within a list. The algorithm works by selecting and checking each number sequentially until matched. A linear search runs in at the worst linear time and makes at most n comparisons, where n is the length of the list. If each element is equally likely to be searched, then the sequential search has an average case of (n+1)/2 comparisons, but the average case can be affected if the search probabilities for each element vary. The complexity of the linear search is as follows: The basic linear search algorithm has the following steps: Given a list L on n elements with values L0…Ln-1, and target value T, to find the index of the target T in the list L. Set i to 0. If Li = T , the search te...
Post a Comment
Read more

Data Scraping with Python 2020

Are you a regular coursera user? If yes, then you might like this python program. You can actually use the same program for similar course websites like edx, alison, udemy, etc. So, let’s start. If you have some experience with python and BeautifulSoup then you already have everything you need so make your own. The ones that don’t, follow along. Install python for your operating system. After that install requests and BeautifulSoup like this: After that, lets import the modules, and make a variable to store the url: from bs4 import BeautifulSoup import requests baseUrl = “https://www.coursera.org” Now, take an input from cli or initialize it: skillset = input().split(“ “)  Now, we’ll see the query url for the search input: example: java Fig.1. Search field in a course website Fig.2. Check the url and find a pattern So, the important part is the after the “query=” part. So, we will append the input from the user here. skillset= “%20”.join(input().split(“ “)) courseraUrl = “https://...
Post a Comment
Read more