晋太元中,武陵人捕鱼为业。缘溪行,忘路之远近。忽逢桃花林,夹岸数百步,中无杂树,芳草鲜美,落英缤纷。渔人甚异之,复前行,欲穷其林。 林尽水源,便得一山,山有小口,仿佛若有光。便舍船,从口入。初极狭,才通人。复行数十步,豁然开朗。土地平旷,屋舍俨然,有良田、美池、桑竹之属。阡陌交通,鸡犬相闻。其中往来种作,男女衣着,悉如外人。黄发垂髫,并怡然自乐。 见渔人,乃大惊,问所从来。具答之。便要还家,设酒杀鸡作食。村中闻有此人,咸来问讯。自云先世避秦时乱,率妻子邑人来此绝境,不复出焉,遂与外人间隔。问今是何世,乃不知有汉,无论魏晋。此人一一为具言所闻,皆叹惋。余人各复延至其家,皆出酒食。停数日,辞去。此中人语云:“不足为外人道也。”(间隔 一作:隔绝) 既出,得其船,便扶向路,处处志之。及郡下,诣太守,说如此。太守即遣人随其往,寻向所志,遂迷,不复得路。 南阳刘子骥,高尚士也,闻之,欣然规往。未果,寻病终。后遂无问津者。
|
Server : Apache System : Linux srv.rainic.com 4.18.0-553.47.1.el8_10.x86_64 #1 SMP Wed Apr 2 05:45:37 EDT 2025 x86_64 User : rainic ( 1014) PHP Version : 7.4.33 Disable Function : exec,passthru,shell_exec,system Directory : /lib64/python3.6/site-packages/setools/ |
Upload File : |
# Copyright 2016, Tresys Technology, LLC
#
# This file is part of SETools.
#
# SETools is free software: you can redistribute it and/or modify
# it under the terms of the GNU Lesser General Public License as
# published by the Free Software Foundation, either version 2.1 of
# the License, or (at your option) any later version.
#
# SETools 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 Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with SETools. If not, see
# <http://www.gnu.org/licenses/>.
#
def match_regex(obj, criteria, regex):
"""
Match the object with optional regular expression.
Parameters:
obj The object to match.
criteria The criteria to match.
regex If regular expression matching should be used.
"""
if regex:
return bool(criteria.search(str(obj)))
else:
return obj == criteria
def match_set(obj, criteria, equal):
"""
Match the object (a set) with optional set equality.
Parameters:
obj The object to match. (a set)
criteria The criteria to match. (a set)
equal If set equality should be used. Otherwise
any set intersection will match.
"""
if equal:
return obj == criteria
else:
return bool(obj.intersection(criteria))
def match_in_set(obj, criteria, regex):
"""
Match if the criteria is in the list, with optional
regular expression matching.
Parameters:
obj The object to match.
criteria The criteria to match.
regex If regular expression matching should be used.
"""
if regex:
return [m for m in obj if criteria.search(str(m))]
else:
return criteria in obj
def match_indirect_regex(obj, criteria, indirect, regex):
"""
Match the object with optional regular expression and indirection.
Parameters:
obj The object to match.
criteria The criteria to match.
regex If regular expression matching should be used.
indirect If object indirection should be used, e.g.
expanding an attribute.
"""
if indirect:
if regex:
return [o for o in obj.expand() if criteria.search(str(o))]
else:
return set(criteria.expand()).intersection(obj.expand())
else:
return match_regex(obj, criteria, regex)
def match_regex_or_set(obj, criteria, equal, regex):
"""
Match the object (a set) with either set comparisons
(equality or intersection) or by regex matching of the
set members. Regular expression matching will override
the set equality option.
Parameters:
obj The object to match. (a set)
criteria The criteria to match.
equal If set equality should be used. Otherwise
any set intersection will match. Ignored
if regular expression matching is used.
regex If regular expression matching should be used.
"""
if regex:
return [m for m in obj if criteria.search(str(m))]
else:
return match_set(obj, set(criteria), equal)
def match_range(obj, criteria, subset, overlap, superset, proper):
"""
Match ranges of objects.
obj An object with attributes named "low" and "high", representing the range.
criteria An object with attributes named "low" and "high", representing the criteria.
subset If true, the criteria will match if it is a subset obj's range.
overlap If true, the criteria will match if it overlaps any of the obj's range.
superset If true, the criteria will match if it is a superset of the obj's range.
proper If true, use proper superset/subset operations.
No effect if not using set operations.
"""
if overlap:
return ((obj.low <= criteria.low <= obj.high) or (
obj.low <= criteria.high <= obj.high) or (
criteria.low <= obj.low and obj.high <= criteria.high))
elif subset:
if proper:
return ((obj.low < criteria.low and criteria.high <= obj.high) or (
obj.low <= criteria.low and criteria.high < obj.high))
else:
return obj.low <= criteria.low and criteria.high <= obj.high
elif superset:
if proper:
return ((criteria.low < obj.low and obj.high <= criteria.high) or (
criteria.low <= obj.low and obj.high < criteria.high))
else:
return (criteria.low <= obj.low and obj.high <= criteria.high)
else:
return criteria.low == obj.low and obj.high == criteria.high
def match_level(obj, criteria, dom, domby, incomp):
"""
Match the an MLS level.
obj The level to match.
criteria The criteria to match. (a level)
dom If true, the criteria will match if it dominates obj.
domby If true, the criteria will match if it is dominated by obj.
incomp If true, the criteria will match if it is incomparable to obj.
"""
if dom:
return (criteria >= obj)
elif domby:
return (criteria <= obj)
elif incomp:
return (criteria ^ obj)
else:
return (criteria == obj)