Xiaomi Announces MIUI 12 and it's new features

MIUI 12 will be rolled out in Q3, which was officially mentioned here. If you are looking for a resource that compiles all of the new MIUI 12 features in one place, then you’ve arrived at the right place. Here are all of the new features in MIUI 12: Also visit here to find list of devices getting MIUI 12 updates.

New Features in MIUI 12

  • Key UI Changes

Xiaomi has been working hard to refine the UI for the past few software releases. A close look at MIUI 12 should be enough to tell you that it’s the most minimal and clean UI that the software has offered to date. 
The company has also improved app opening and closing animations in MIUI 12 to reduce stutter and tearing. The company has integrated its own technologies and algorithms into its Android skin to get real-time blur in the background while closing an app, for example. Several other new animations can be found across the board – even within system apps.

Updated Dark Mode Version

Xiaomi rolled out system-wide dark mode with MIUI 11 and today, it has announced a improvements to it.
First, Xiaomi has worked to improve readability and reduce eye strain while using the dark mode. You will notice automatic font weight and contrast adjustments across the board. The text will appear brighter and sharper in the dark mode as compared to the light theme. This is coupled with a ‘Wallpaper Dimming’ feature that will dynamically adjust the color temperature of your wallpaper – be it a system or custom one.

  • Global Free Window

With MIUI 12, Xiaomi has expanded the capability of the small screen window that allows you to reply to texts or take calls while playing games or watching videos. This feature is now accessible for every app on your smartphone. If you receive a text in between your game, you can slide down on the notification to open a window overlay. But, you can now drag it to the top right corner to see a tiny version of it at all times.

  • Mi Health with MIUI12

The Mi Health app was first spotted in a MIUI developer beta ROM last year. And now, the Mi Health app has officially been introduced in MIUI 12 to make it simpler for users to track their steps, sleep, workouts, and more. You simply need to keep your phone on you to see all your walking, running, or exercise data being recorded by the app.

  • Privacy Enhancements

The company adopts a three-pronged approach to improve privacy in MIUI 12. This includes Flare, Barbed Wire, and the Mask System.
First up, Flare will keep track of the behavior of all apps on your phone and present you with a list of apps that may be out of line – violating your privacy or abusing permissions. MIUI 12 will offer you tips and suggestions to take back control in your hands.
Second, we have Barbed Wire and it builds on the privacy improvements in Android 10. You can currently choose to permanently allow or dole out a one-time permission to access the camera or location in an app in Android 10. But, MIUI 12 won’t show the ‘always allow’ button if the app does not specify what it requires the permission for.
Finally, the Mask System lets users create and share virtual IDs with apps on their MIUI 12 devices. We have already seen similar implementations in Apple’s iOS 13 and Oppo’s ColorOS 7. It gives you more control over what data you want to share with an app.

The intention behind this blog is to help all my fellow programmers. Also to provide solutions for various coding platform problems with solution and explanation. I will add many tutorials in future. I am not a professional blogger but whenever time permits I will post. I hope you’ll enjoy the content and find it useful! Check out my Writer blog for a more valuable quotes. For any queries or suggestions, please feel free to reach out to me. Happy coding!

Comments

Post a Comment

Popular posts from this blog

Balanced Binary Tree

Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the left and right subtrees of  every  node differ in height by no more than 1. Example 1: Input: root = [3,9,20,null,null,15,7] Output: true Example 2: Input: root = [1,2,2,3,3,null,null,4,4] Output: false Example 3: Input: root = [] Output: true   Constraints: The number of nodes in the tree is in the range  [0, 5000] . -10 4  <= Node.val <= 10 4 Solution: /**  * Definition for a binary tree node.  * public class TreeNode {  *     int val;  *     TreeNode left;  *     TreeNode right;  *     TreeNode() {}  *     TreeNode(int val) { this.val = val; }  *     TreeNode(int val, TreeNode left, TreeNode right) {  *         this.val = val;  *         this.left = left;  *         this.right = right;  *     }
Read more

First Unique Character in a String

Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. Examples: s = "leetcode" return 0. s = "loveleetcode", return 2. Note: You may assume the string contain only lowercase letters. class Solution {     public int firstUniqChar(String s) {         int length = s.length();         String str;         for(int i=0;i<length;i++){             if(i==length-1){                 str = s.substring(0, i);             }             else{                 str = s.substring(0,i)+s.substring(i+1);             }             if(!str.contains(s.charAt(i)+""))                 return i;         }         return -1;     } } Try it on Leetcode Here, we are going to use substring method. 1) If character is at end, then take substring from 0 till before last character of string. 2) Else make a temporary string, by removing exactly that particular character using index. [e.g..
Read more

Majority Element

Given an array of size n , find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majority element always exist in the array. Example 1: Input: [3,2,3] Output: 3 Example 2: Input: [2,2,1,1,1,2,2] Output: 2   class Solution { public int majorityElement(int[] nums) { Arrays.sort(nums); return nums[nums.length/2]; } } Here, we are sorting the entire array using sort() of Arrays class. Then, number at index position n/2 would be a majority element. There is no chance of wrong values in odd or even length.   Below is another method using HashMap. METHOD 2: class Solution { public int majorityElement(int[] nums) { HashMap<Integer, Integer>list = new HashMap<Integer, Integer>(); int repeatLen
Read more

Smallest Range II

Given an array   A   of integers, for each integer   A[i]   we need to choose   either  x = -K  or  x = K , and add   x   to   A[i]  (only once) . After this process, we have some array  B . Return the smallest possible difference between the maximum value of  B  and the minimum value of  B . Example 1: Input: A = [1] , K = 0 Output: 0 Explanation : B = [1] Example 2: Input: A = [0,10] , K = 2 Output: 6 Explanation : B = [2,8] Example 3: Input: A = [1,3,6] , K = 3 Output: 3 Explanation : B = [4,6,3] Note: 1 <= A.length <= 10000 0 <= A[i] <= 10000 0 <= K <= 10000 Solution: class Solution {     public int smallestRangeII(int[] A, int K) {         int i, min=0, max=0, min1, min2, max1, max2, length = A.length, diff
Read more