🪴 Quartz 4.0

Search

SearchSearch
        • __init__.py code (2022 - 12 - 16)
        • __init__.py code (2023 - XX - XX)
        • __init__.py code (2024 - 06 - 06)
        • __init__.py code (2024 - 06 - 07)
        • __init__.py code (2024 - 06 - 08)
        • (Video) How to Program - by Coding Tech
        • 1. The best, but unsafe __init__.py I made
        • 2. The best __init__.py (2021 - 10 -18)
        • 3. The best __init__.py (2022 - 03 - 03)
        • Docker - Container for Python
        • First Order Functions
        • Functional Programming
        • Higher Class Functions - Function Constructors
        • Immutable data
        • Immutable Objects or Variables
        • Logic Programming
        • Monads
        • NO - 1-Tree
        • NO - Adjacency Matrix
        • NO - Approaching a LP (Linear Program)
        • NO - Approximate Algorithms
        • NO - Assignment Problem
        • NO - Basis and Basic Variables
        • NO - BFS (Basic Feasible Solutions)
        • NO - Bipartite Graph
        • NO - Bounding
        • NO - Branch & Bound
        • NO - Branch & Bound for TSP
        • NO - Branch & Cut
        • NO - Branch&Cut for TSP
        • NO - Branching
        • NO - Chapter 1 (Modified). A quick introduction to Mathematical Programming I
        • NO - Chapter 1. A quick introduction to Mathematical Programming I
        • NO - Chapter 2 (Modified). A quick introduction to Mathematical Programming II
        • NO - Chapter 2. A quick introduction to Mathematical Programming II
        • NO - Chapter 3 (Modified). How to solve a Linear Program
        • NO - Chapter 3. How to solve a Linear Program
        • NO - Chapter 4. A quick introduction to Complexity
        • NO - Chapter 5. A quick introduction to Integer Programming
        • NO - Chapter 6. How to solve a MIP (Mixed Integer Program)
        • NO - Chapter 7. A quick introduction to Graphs
        • NO - Chapter 8. Max Flow & Min Cut
        • NO - Chapter 9 (Modified). Minimum Spanning Tree
        • NO - Chapter 9. Minimum Spanning Tree
        • NO - Chapter 10 (Modified). Matching
        • NO - Chapter 10. Matching
        • NO - Chapter 11 (Modified). TSP (Travelling Salesman Problem)
        • NO - Chapter 11. TSP (Travelling Salesman Problem)
        • NO - Chapter 12 (Modified). Classification of algorithms
        • NO - Chapter 12. Classification of algorithms
        • NO - Chapter 13 (Modified). Construction heuristics for TSP
        • NO - Chapter 13. Construction heuristics for TSP
        • NO - Chapter 14 (Modified). A quick introduction to Local Search
        • NO - Chapter 14. A quick introduction to Local Search
        • NO - Chapter 15 (Modified). Local Search for TSP
        • NO - Chapter 15. Local Search for TSP
        • NO - Chapter 16 (Modified). Mathematical Formulation of the TSP
        • NO - Chapter 16. Mathematical Formulation of the TSP
        • NO - Chapter 17 Modified). A quick introduction to Duality
        • NO - Chapter 17. A quick introduction to Duality
        • NO - Chapter 18 (Modified). A quick introduction to Lagrangian Relaxation
        • NO - Chapter 18. A quick introduction to Lagrangian Relaxation
        • NO - Chapter 19 (Modified). Lower Bounds for TSP
        • NO - Chapter 19. Lower Bounds for TSP
        • NO - Chapter 20 (Modified). A quick introduction to Branch&Bound
        • NO - Chapter 20. A quick introduction to Branch&Bound
        • NO - Chapter 21 (Modified). Branch & Bounds for TSP
        • NO - Chapter 21. Branch & Bounds for TSP
        • NO - Chapter 22 (Modified). A quick introduction to Cutting Plane
        • NO - Chapter 22. A quick introduction to Cutting Plane
        • NO - Chapter 23 (Modified). Cutting plane for TSP
        • NO - Chapter 23. Cutting plane for TSP
        • NO - Chapter 24 (Modified). A quick introduction to Branch&Cut
        • NO - Chapter 24. A quick introduction to Branch&Cut
        • NO - Chapter 25. Branch&Cut for TSP
        • NO - Christofides's algorithm
        • NO - Classification of LP (Linear Programs)
        • NO - Complete Graph
        • NO - Connected Graph
        • NO - Convex Hull
        • NO - Convex Program
        • NO - Cut Optimality for Spanning Tree Graphs
        • NO - Cutting a Graph and s-t Cut
        • NO - Cutting Plane
        • NO - Cutting Plane for TSP
        • NO - Data Structure Optimization
        • NO - Definitions and Need-to-Know Stuff
        • NO - Degenerate BFS (Basic Feasible Solutions)
        • NO - DFJ Formulation for TSP
        • NO - Differences between Tree Graphs and Spanning Tree Graphs
        • NO - Duality
        • NO - Edmonds Algorithm (Srhinking Blossoms)
        • NO - Eulerian Cycles
        • NO - Evaluation Function
        • NO - Exact Algorithms
        • NO - Exploration of the Neighbourhood of a Solution
        • NO - Extreme Points and Vertices
        • NO - Feasible and Optimal Solution
        • NO - Feasible Solutions for LP (Linear Programs)
        • NO - Find the Optimal Solution in a LP (Linear Program)
        • NO - Ford-Fulkerson Algorithm
        • NO - Geometrical Description of LP (Linear Programs)
        • NO - Graph and its components
        • NO - Graph Components Cheat-Sheet
        • NO - Greedy (Heuristic) Algorithms
        • NO - Hamiltonian Cycles
        • NO - Heuristic Algorithms
        • NO - Identify a TUM (Totally Unimodular Matrix)
        • NO - Identify a TUM (Totally Unimodular Matrix) (Bad Example)
        • NO - Incidence List
        • NO - Incidence Matrix
        • NO - Ingredients for Branch & Bound
        • NO - IP (Integer Programs)
        • NO - Kruskal and Prim Algorithms of MST (Minimum Spanning Tree)
        • NO - Legrangean Problem
        • NO - Legrangean Relaxation
        • NO - Legrangean Relaxation for TSP
        • NO - Linear Program
        • NO - Linear Relaxation
        • NO - Local and Global Optima
        • NO - Local Search
        • NO - Matching
        • NO - Mathematical Formulation of the TSP
        • NO - Mathematical Program
        • NO - Max Flow & Min Cut Problems
        • NO - Maximum Cardinality Matching Problem and Solution Algorithms
        • NO - Metaheuristic (Heuristic) Algorithms
        • NO - MTZ Formulation for the TSP
        • NO - Neighbourhood of a Solution
        • NO - Optimal Solution for LP (Linear Programs)
        • NO - P (Polynomial) and NP (Non-deterministic Polynomial) Problems
        • NO - Path Optimality for Spanning Tree Graphs
        • NO - Pivot Operation
        • NO - Pruned & Solved Problems
        • NO - Reduced Costs and Descent Direction
        • NO - Relaxation & Restriction of an MP
        • NO - Relaxing & Restricting
        • NO - Simplex Method and Auxiliary Problem
        • NO - Solution Algorithms (Exact, Approximate, Heuristic)
        • NO - Spanning Tree Graph
        • NO - Speed Up for Edge Exchange
        • NO - Standard Form of a Linear Program
        • NO - Strong & Weak Mathematical Formulation
        • NO - Strong Duality
        • NO - Summary of Chapter 1
        • NO - Summary of Chapter 2
        • NO - Summary of Chapter 3
        • NO - Summary of Chapter 3 (Part I)
        • NO - Summary of Chapter 3 (Part II)
        • NO - Summary of Chapter 3 (Part III)
        • NO - Summary of Chapter 3 (Part IV)
        • NO - Summary of Chapter 3 (Part V)
        • NO - Summary of Chapter 3 (Part VI)
        • NO - Summary of Chapter 3 (Part VII)
        • NO - Summary of Chapter 3 (Part VIII)
        • NO - Summary of Chapter 9
        • NO - Summary of Chapter 10
        • NO - Summary of Chapter 16
        • NO - Tree Graph and Forest Graph
        • NO - Triangle Inequality
        • NO - TSP (Travelling Salesman Problem)
        • NO - TSP (Travelling Salesman Problem) & MST (Minimum Spanning Tree)
        • NO - TSP (Travelling Salesman Problem) Arbitrary Insertion
        • NO - TSP (Travelling Salesman Problem) Farthest Addition
        • NO - TSP (Travelling Salesman Problem) Nearest Addition
        • NO - TSP (Travelling Salesman Problem) Nearest Merge
        • NO - TSP (Travelling Salesman Problem) Nearest Neighbour
        • NO - TSP (Travelling Salesman Problem) Tour Construction
        • NO - TSP Edge Exchange r-opt
        • NO - TUM (Total Unimodular Matrix)
        • NO - Upper & Lower Bound
        • NO - Visit Rules for Branch & Bound
        • NO - Weak Duality
        • Pure Functions
        • Python - __getattr__
        • Python - __import__(...)
        • Python - Absolutes and Relative Imports
        • Python - Adaptor Pattern
        • Python - Add new Syntax
        • Python - asyncio
        • Python - C Integration with Python
        • Python - Check if a List is Empty
        • Python - Class-Function
        • Python - Classes
        • Python - Collection of Ideas 'Code Structures'
        • Python - collections
        • Python - Color Output
        • Python - Create a Package
        • Python - Create New File
        • Python - Cython
        • Python - Declare Variable from String
        • Python - Decorators
        • Python - Decorators with Arguments
        • Python - Definable Dunder Methods of Classes
        • Python - dill
        • Python - filter
        • Python - Frozen dataclass
        • Python - Functional Programming
        • Python - Generators
        • Python - Get Caller Function - Calling Line Number
        • Python - Get Caller Function - Calling String of Code
        • Python - Get Caller Function - File Name
        • Python - Get Caller Function - Frame
        • Python - Get Caller Function - Name
        • Python - Get Caller Function - Next Inner Traceback Object
        • Python - Get Caller Function Infos
        • Python - Get Current Directory
        • Python - Get List of Methods of a Module
        • Python - get_variable_name_of_argument
        • Python - Global Interpreter Lock
        • Python - globals( )
        • Python - HOW I IMPORT - My __init__.py Files
        • Python - Idea 'Classify Functions by Their Order'
        • Python - Idea 'Code Anchors'
        • Python - Idea 'where' Keyword
        • Python - Ideas for __init__.py
        • Python - Ideas for Singleton
        • Python - Immutable Class
        • Python - Immutable Struct
        • Python - Immutable Types
        • Python - import
        • Python - Importers
        • Python - Index
        • Python - Inspect
        • Python - lambda Functions
        • Python - Libgen API
        • Python - List as Positional Args
        • Python - List Comprehension
        • Python - List of Files and Folders in Directory
        • Python - List of Port Currently in Use
        • Python - locals( )
        • Python - map
        • Python - metaclasses
        • Python - Move Cursor inside a File
        • Python - multiprocessing
        • Python - multiprocessing Using lambda Functions
        • Python - multiprocessing.Pool( ).map( )
        • Python - partial
        • Python - pathos
        • Python - pickle
        • Python - PIL (Python Imaging Library)
        • Python - Pipeline Pattern
        • Python - pipenv • (pipenv) README.txt • Python Virtual Environment • Create a New pipenv venv
        • Python - Plot Live Graph with Fast Iterations
        • Python - pprint
        • Python - PyQt
        • Python - pyqtgraph
        • Python - Pytorch
        • Python - raise Exception
        • Python - reduce
        • Python - Run Function for a Predefined Limit of Time
        • Python - SAT Solver
        • Python - Software Design
        • Python - start_new_process(...)
        • Python - str split
        • Python - Syncthing API
        • Python - sys.intern
        • Python - Test in the same file
        • Python - The Import System
        • Python - User Defined with Statement
        • Python - venv
        • Python - Work on Files in Different Directory
        • Python - zip
        • Python ~ Ex. My Relative and Absolute Import for Packages
        • Python Project ~ __init__.py
        • Python Project ~ haskell_class decorator
        • Pytorch - LinearRegression Example
        • Pytorch - RNN, LSTM, GRU Example
        • Side Effects
        • Sublime Merge - When it Crashes
        • Sublime Text - 'sublime_plugin.ApplicationCommand' Class
        • Sublime Text - 'sublime_plugin.TextCommand' Class
        • Sublime Text - 'sublime_plugin.WindowCommand' Class
        • Sublime Text - All sublime.view Methods
        • Sublime Text - Build System • Create a New Build System
        • Sublime Text - Build System • Create a Target Plugin as a Build System
        • Sublime Text - Build System • See an Already Installed Build System
        • Sublime Text - Class Name Protocol
        • Sublime Text - Command Classes
        • Sublime Text - Command Palette
        • Sublime Text - Get Last Key Pressed
        • Sublime Text - How to Sync using Syncthing
        • Sublime Text - Ideas
        • Sublime Text - Index
        • Sublime Text - Learn from Other Packages
        • Sublime Text - Official Sync Guide
        • Sublime Text - Output Pannel
        • Sublime Text - Package Control
        • Sublime Text - Package Folder
        • Sublime Text - Package Resources or sublime-extensions
        • Sublime Text - Phantoms
        • Sublime Text - pipenv
        • Sublime Text - Pluign for pipenv • Code • PipenvFastSearch
        • Sublime Text - Pluign for python 'good practices' • Code • myPython
        • Sublime Text - Pluign for testing and debuggin __init__.py files • Code • My__init__test
        • Sublime Text - Run a General Command
        • Sublime Text - Sublime API
        • Sublime Text - Sublime Console
        • Sublime Text - Sublime Plugins
        • Sublime Text - Use view methods Outside Classes
        • Sublime Text - Use window methods Outside Classes
        • Sublime Text - User Folder
        • Sublime Text - What are Packages
        • Sublime Text ~ Builtin Ex. arithmetic.py
        • Sublime Text ~ Builtin Ex. exec.py
        • Sublime Text ~ Builtin Ex. font.py
        • Sublime Text ~ Builtin Ex. goto_line.py
        • Sublime Text ~ Builtin Ex. mark.py
        • Sublime Text ~ Builtin Ex. show_scope_name.py
        • Sublime Text ~ Ex. Hello World
        • Sublime Text ~ Ex. MySublimeDebug --version 0.0.1
        • Sublime Text ~ Ex. on_post_save(...)
        • Sublime Text ~ Ex. view.find_all(...)
        • Sublime Text ~ Ex. view.find(...)
        • The Zen of Python
        • Wikipedia Definition
    Home

    ❯

    Notes and Images

    ❯

    Sublime Text - Get Last Key Pressed

    Sublime Text - Get Last Key Pressed

    Jul 31, 20241 min read

    Reference

    Another Reference


    My Iterations:

    NOTE: IT SUCKS, because it negates all the other plugins, it is higly recommended to never use this code again, its not bad written, it is all the implementation wrong, still here it is to know what NOT TO DO: Sublime Text ~ Ex. MySublimeDebug —version 0.0.1


    Graph View

    Backlinks

    • Sublime Text - Index

    Created with Quartz v4.2.4 © 2024

    • GitHub
    • Discord Community