11 changed files with 179 additions and 50 deletions
@ -0,0 +1,71 @@ |
|||
#!/usr/bin/env python |
|||
# -*- coding: utf-8 -*- |
|||
# |
|||
# GuessIt - A library for guessing information from filenames |
|||
# Copyright (c) 2013 Nicolas Wack <wackou@gmail.com> |
|||
# |
|||
# GuessIt is free software; you can redistribute it and/or modify it under |
|||
# the terms of the Lesser GNU General Public License as published by |
|||
# the Free Software Foundation; either version 3 of the License, or |
|||
# (at your option) any later version. |
|||
# |
|||
# GuessIt 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 |
|||
# Lesser GNU General Public License for more details. |
|||
# |
|||
# You should have received a copy of the Lesser GNU General Public License |
|||
# along with this program. If not, see <http://www.gnu.org/licenses/>. |
|||
# |
|||
|
|||
from __future__ import unicode_literals |
|||
from guessit.transfo import SingleNodeGuesser |
|||
from guessit.patterns import find_properties |
|||
import re |
|||
import logging |
|||
|
|||
log = logging.getLogger(__name__) |
|||
|
|||
|
|||
def guess_properties(string): |
|||
try: |
|||
prop, value, pos, end = find_properties(string)[0] |
|||
return { prop: value }, (pos, end) |
|||
except IndexError: |
|||
return None, None |
|||
|
|||
_idnum = re.compile(r'(?P<idNumber>[a-zA-Z0-9-]{10,})') # 1.0, (0, 0)) |
|||
|
|||
def guess_idnumber(string): |
|||
match = _idnum.search(string) |
|||
if match is not None: |
|||
result = match.groupdict() |
|||
switch_count = 0 |
|||
DIGIT = 0 |
|||
LETTER = 1 |
|||
OTHER = 2 |
|||
last = LETTER |
|||
for c in result['idNumber']: |
|||
if c in '0123456789': |
|||
ci = DIGIT |
|||
elif c in 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ': |
|||
ci = LETTER |
|||
else: |
|||
ci = OTHER |
|||
|
|||
if ci != last: |
|||
switch_count += 1 |
|||
|
|||
last = ci |
|||
|
|||
switch_ratio = float(switch_count) / len(result['idNumber']) |
|||
|
|||
# only return the result as probable if we alternate often between |
|||
# char type (more likely for hash values than for common words) |
|||
if switch_ratio > 0.4: |
|||
return result, match.span() |
|||
|
|||
return None, None |
|||
|
|||
def process(mtree): |
|||
SingleNodeGuesser(guess_idnumber, 0.4, log).process(mtree) |
Loading…
Reference in new issue