Discover gists

The privacy details that you may need to add for Apple Privacy Manifest.

This config plugin it's already available from expo >=50.0.17 (Part of this PR by aleqsio)

Tip

Read more about Privacy Manifest File from Apple docs

Screen sharing on Hyprland (Arch Linux)

Follow standard conventions.
Keep it simple stupid. Simpler is always better. Reduce complexity as much as possible.
Boy scout rule. Leave the campground cleaner than you found it.
Always find root cause. Always look for the root cause of a problem.

国内从 Docker Hub 拉取镜像有时会遇到困难，此时可以配置镜像加速器。Docker 官方和国内很多云服务商都提供了国内加速器服务。

Dockerized 实践 https://github.com/y0ngb1n/dockerized

Ubuntu 16.04+、Debian 8+、CentOS 7+

	// This function converts the string to lowercase, then perform the conversion
	function toLowerCaseNonAccentVietnamese(str) {
	str = str.toLowerCase();
	// We can also use this instead of from line 11 to line 17
	// str = str.replace(/\u00E0\|\u00E1\|\u1EA1\|\u1EA3\|\u00E3\|\u00E2\|\u1EA7\|\u1EA5\|\u1EAD\|\u1EA9\|\u1EAB\|\u0103\|\u1EB1\|\u1EAF\|\u1EB7\|\u1EB3\|\u1EB5/g, "a");
	// str = str.replace(/\u00E8\|\u00E9\|\u1EB9\|\u1EBB\|\u1EBD\|\u00EA\|\u1EC1\|\u1EBF\|\u1EC7\|\u1EC3\|\u1EC5/g, "e");
	// str = str.replace(/\u00EC\|\u00ED\|\u1ECB\|\u1EC9\|\u0129/g, "i");
	// str = str.replace(/\u00F2\|\u00F3\|\u1ECD\|\u1ECF\|\u00F5\|\u00F4\|\u1ED3\|\u1ED1\|\u1ED9\|\u1ED5\|\u1ED7\|\u01A1\|\u1EDD\|\u1EDB\|\u1EE3\|\u1EDF\|\u1EE1/g, "o");
	// str = str.replace(/\u00F9\|\u00FA\|\u1EE5\|\u1EE7\|\u0169\|\u01B0\|\u1EEB\|\u1EE9\|\u1EF1\|\u1EED\|\u1EEF/g, "u");
	// str = str.replace(/\u1EF3\|\u00FD\|\u1EF5\|\u1EF7\|\u1EF9/g, "y");

	package com.activity

	import android.os.Bundle
	import kotlinx.android.synthetic.main.activity_statistiques.*


	class StatsActivity : BaseActivity() {

	override fun onCreate(savedInstanceState: Bundle?) {
	super.onCreate(savedInstanceState)


	/*
	C++ Program to create a Complete Binary Tree.
	-Ajinkya Sonawane [AJ-CODE-7]

	In a complete binary tree every level, except possibly the last, is completely filled,
	and all nodes in the last level are as far left as possible.
	It can have between 1 and 2h nodes at the last level h.
	An alternative definition is a perfect tree whose rightmost leaves (perhaps all) have been removed.
	Some authors use the term complete to refer instead to a perfect binary tree as defined above,

	using System.Collections;
	using System.Collections.Generic;
	using UnityEngine;
	using UnityEngine.UI;

	public class UIBorder : MaskableGraphic {
	[SerializeField]
	float cornerRadius = 5;

	[SerializeField]

	Maintainers:
	veprbl: nlojet, nlojet, nlojet, nlojet