summary refs log tree commit diff stats
path: root/ranger/__init__.py
blob: ae467b3055e2790990ba654918851447640fa856 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
# Copyright (C) 2009, 2010, 2011  Roman Zimbelmann <romanz@lavabit.com>
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program.  If not, see <http://www.gnu.org/licenses/>.

"""
A console file manager with VI key bindings.

It provides a minimalistic and nice curses interface with a view on the
directory hierarchy.  The secondary task of ranger is to figure out which
program you want to use to open your files with.
"""

import os

# Information
__license__ = 'GPL3'
__version__ = '1.5.0 (stable)'
__author__ = __maintainer__ = 'Roman Zimbelmann'
__email__ = 'romanz@lavabit.com'

# Constants
RANGERDIR = os.path.dirname(__file__)
TICKS_BEFORE_COLLECTING_GARBAGE = 100
TIME_BEFORE_FILE_BECOMES_GARBAGE = 1200
MACRO_DELIMITER = '%'
LOGFILE = '/tmp/ranger_errorlog'
USAGE = '%prog [options] [path/filename]'
STABLE = False

# If the environment variable XDG_CONFIG_HOME is non-empty, CONFDIR is ignored
# and the configuration directory will be $XDG_CONFIG_HOME/ranger instead.
CONFDIR = '~/.config/ranger'

from ranger.core.main import main
="k">break-if->= return -1 } return 0 } fn shift-left-by n: int, bits: int -> _/eax: int { var i/eax: int <- copy bits { compare i, 0 break-if-<= shift-left n, 1 i <- decrement loop } return n } fn shift-right-by n: int, bits: int -> _/eax: int { var i/eax: int <- copy bits { compare i, 0 break-if-<= shift-right n, 1 i <- decrement loop } return n } fn clear-lowest-bits _n: (addr int), bits: int { var dest/edi: (addr int) <- copy _n var n/eax: int <- copy *dest n <- shift-right-by n, bits n <- shift-left-by n, bits copy-to *dest, n }