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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
# Copyright (C) 2008 Canonical Ltd
#
# 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 2 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, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
"""Miscellaneous useful stuff."""
def single_plural(n, single, plural):
"""Return a single or plural form of a noun based on number."""
if n == 1:
return single
else:
return plural
def defines_to_dict(defines):
"""Convert a list of definition strings to a dictionary."""
if defines is None:
return None
result = {}
for define in defines:
kv = define.split('=', 1)
if len(kv) == 1:
result[define.strip()] = 1
else:
result[kv[0].strip()] = kv[1].strip()
return result
def invert_dict(d):
"""Invert a dictionary with keys matching each value turned into a list."""
# Based on recipe from ASPN
result = {}
for k, v in d.iteritems():
keys = result.setdefault(v, [])
keys.append(k)
return result
def invert_dictset(d):
"""Invert a dictionary with keys matching a set of values, turned into lists."""
# Based on recipe from ASPN
result = {}
for k, c in d.iteritems():
for v in c:
keys = result.setdefault(v, [])
keys.append(k)
return result
def _common_path_and_rest(l1, l2, common=[]):
# From http://code.activestate.com/recipes/208993/
if len(l1) < 1: return (common, l1, l2)
if len(l2) < 1: return (common, l1, l2)
if l1[0] != l2[0]: return (common, l1, l2)
return _common_path_and_rest(l1[1:], l2[1:], common+[l1[0]])
def common_path(path1, path2):
"""Find the common bit of 2 paths."""
return ''.join(_common_path_and_rest(path1, path2)[0])
def binary_stream(stream):
"""Ensure a stream is binary on Windows.
:return: the stream
"""
try:
import os
if os.name == 'nt':
fileno = getattr(stream, 'fileno', None)
if fileno:
no = fileno()
if no >= 0: # -1 means we're working as subprocess
import msvcrt
msvcrt.setmode(no, os.O_BINARY)
except ImportError:
pass
return stream
def common_directory(paths):
"""Find the deepest common directory of a list of paths.
:return: if no paths are provided, None is returned;
if there is no common directory, '' is returned;
otherwise the common directory with a trailing / is returned.
"""
import posixpath
def get_dir_with_slash(path):
if path == '' or path.endswith('/'):
return path
else:
dirname, basename = posixpath.split(path)
if dirname == '':
return dirname
else:
return dirname + '/'
if not paths:
return None
elif len(paths) == 1:
return get_dir_with_slash(paths[0])
else:
common = common_path(paths[0], paths[1])
for path in paths[2:]:
common = common_path(common, path)
return get_dir_with_slash(common)
def is_inside(dir, fname):
"""True if fname is inside dir.
The parameters should typically be passed to osutils.normpath first, so
that . and .. and repeated slashes are eliminated, and the separators
are canonical for the platform.
The empty string as a dir name is taken as top-of-tree and matches
everything.
"""
# XXX: Most callers of this can actually do something smarter by
# looking at the inventory
if dir == fname:
return True
if dir == '':
return True
if dir[-1] != '/':
dir += '/'
return fname.startswith(dir)
def is_inside_any(dir_list, fname):
"""True if fname is inside any of given dirs."""
for dirname in dir_list:
if is_inside(dirname, fname):
return True
return False
|
