Discover gists

Let me tell you how easy it is to decompile an Electron app (that's closed source).

Prerequisites

Node.js (LTS or latest)
Electron
asar (for extracting the source code)

Decompilation

First of all, you find the install path of your Electron app. If you found it, find the resources folder. If you found it, you'll have to install asar globally, by running:

About

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

	(define nand
	(lambda (a b) (match (list a b)
	[(list 1 1) 0]
	[(list _ _) 1])))


	(define not
	(lambda (a) (nand a a)))


	.
	..
	........
	@
	*
	.
	..*
	ðŸŽ

	# brew install nginx
	sudo ln -s /usr/local/opt/nginx/homebrew.mxcl.nginx.plist /Library/LaunchDaemons/
	sudo chown root:wheel /usr/local/opt/nginx/homebrew.mxcl.nginx.plist
	sudo launchctl load /Library/LaunchDaemons/homebrew.mxcl.nginx.plist

	# Why do you need sudo?
	# If you want nginx to be able to bind to port 80, it will need superuser privileges

	# choco install -y adobereader
	# choco install -y android-sdk
	# choco install -y androidstudio
	# choco install -y autohotkey.portable
	# choco install -y calibre
	# choco install -y clipx
	# choco install -y defraggler
	# choco install -y dotnet4.0
	# choco install -y explorerplusplus
	# choco install -y fastcopy

	// 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,

	Maintainers:
	veprbl: nlojet, nlojet, nlojet, nlojet