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 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330
|
##
#
# Copyright (C) 2007 Mola Pahnadayan
#
# 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
##
import math
monthDays=[31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 29]
monthdays=[31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]
days_in_year = [365,366]
class cal:
def __init__(self):
self.year =0
self.month=0
self.day =0
self.weekOfYear =0
self.weekOfMonth =0
self.dayOfYear =0
self.dayOfWeek =0 # shanbe 0,yekshanbe 1, ... , jome 6
self.era =0
def leap(year):
pr = year
pr-=475 ;
if (pr < 0):
pr -=1
pr%=2820
if (pr >= 2783):
pr-=2783
if (pr == 0):
return 0
elif ((pr % 4) == 0):
return 1
else:
return 0
else:
pr%=128
if (pr<29):
if (pr == 0):
return 0
elif (pr % 4 == 0):
return 1
else:
return 0
elif (pr < 62):
pr-=29
if (pr == 0):
return 0
elif (pr % 4 == 0):
return 1
else:
return 0
elif (pr < 95):
pr-=62
if (pr == 0):
return 0
elif (pr % 4 == 0):
return 1
else:
return 0
else:
pr-=95
if (pr == 0):
return 0
elif (pr % 4 == 0):
return 1
else:
return 0
def scalar_Days (year,month,day):
daysNo=long(0)
year = year -475+2820
month -= 1
daysNo=(year/2820)*1029983
year=year % 2820
daysNo+=(year/128)* 46751
if((year/128)>21):
daysNo-=46751
year=(year%128)+128
else:
year=year%128
if(year>=29):
year-=29
daysNo+=10592
if(year>=66):
year-=66
daysNo+=24106
elif( year>=33):
daysNo+=(year/33)* 12053
year=year%33
if (year >= 5):
daysNo += 1826
year -=5
elif (year == 4):
daysNo += 1460
year -=4
daysNo += 1461 * (year/4)
year %= 4
daysNo += 365 * year
i=0
while(i < month):
daysNo += monthDays[i]
i+=1
daysNo += day
return daysNo-856493
def jalalyDate (daysNo):
h=cal()
month=0
day=0
scalarDays=0
yearOffset=0
monthOffset=0
daysNo+=856493;
scalarDays=daysNo
year=(daysNo/1029983)*2820
daysNo=daysNo%1029983
if((daysNo/46751)<=21):
year+=(daysNo/46751)* 128
daysNo=daysNo%46751
else:
year+=(daysNo/46751)* 128
daysNo=daysNo%46751
year-=128
daysNo+=46751
if (daysNo >= 10592):
year+= 29
daysNo -= 10592
if(daysNo>=24106):
daysNo-=24106
year+=66
if(daysNo>=12053):
daysNo-=12053
year+=33
if (daysNo >= 1826):
year+= 5
daysNo -= 1826
elif (daysNo > 1095):
year+= 3
daysNo -= 1095
year +=(4 * (daysNo/1461))
daysNo %= 1461
if (daysNo == 0):
year -= 1
daysNo = 366
else:
year += daysNo/365
daysNo = daysNo % 365
if (daysNo == 0):
year -= 1
daysNo = 365
h.dayOfYear=daysNo
yearOffset=(scalarDays-h.dayOfYear+4)%7
h.weekOfYear=(h.dayOfYear+yearOffset-1)/7+1
i=0
while((i < 11)and(daysNo > monthDays[i])):
daysNo -= monthDays[i]
i+=1
month = i + 1
day = daysNo
h.day = day
monthOffset=(scalarDays-h.day+4)%7
h.weekOfMonth=(h.day+monthOffset-1)/7+1
h.month = month
h.year = year-2345
if (h.year<0):
h.era=0
else:
h.era=1
h.dayOfWeek=(scalarDays+3)%7
return h.dayOfWeek
BASE_CAL_DAY=11
BASE_CAL_MONTH=10
BASE_CAL_YEAR=1348
DAY_LEN=86400
YEAR_LEN=31557600
SEGMENT_REDIRECTION=0.70
YEAR_LEND=365.24220
def convert_to_jalali(fu_days):
fu_days += (210 * 60)
fu_days = (int(fu_days) / DAY_LEN)
n_days=fu_days
n_days%= 7
n_days+= 5
if (n_days == -1):
n_days = 6
wday = abs(n_days % 7)
fn_days = fu_days + 287
n_years = long(fu_days / YEAR_LEND)
year = n_years + BASE_CAL_YEAR
redirect = ((n_years * YEAR_LEND) - math.floor(n_years * YEAR_LEND))
if (redirect <= SEGMENT_REDIRECTION):
today = math.ceil(fn_days - (n_years * YEAR_LEND))
elif ((redirect > SEGMENT_REDIRECTION) and (redirect < 0.88)):
today = (fn_days - (n_years * YEAR_LEND)) + 1
else:
today = math.floor(fn_days - (n_years * YEAR_LEND))
if ((fu_days<0) and (today<=0)):
if (today == 0):
today = days_in_year[leap(year-1)] #(!leap((year)-1)) ? 365:366
else:
today+= days_in_year[leap(year-1)] #(!is_jleap((*year)-1)) ? 365:366
year-=1
if (today == 366):
if not(leap(year)):
today -= 365
year +=1
elif (today > 366):
if (leap(year)):
today -= 366
else:
today -= 365
year +=1
r_days = int(today)
mon=0
i = 1
while(i<=11):
if (r_days < monthDays[i-1]+1):
month = i
day = r_days
return year,month,day
r_days-=monthDays[i-1]
i+=1
month = 12
day = r_days
return year,month,day
def jalali_to_milady (year,month,day):
gy= gm= gd = 0
g_day_no = j_day_no =long()
leap=0
jy = year-979;
jm = month-1;
jd = day-1;
j_day_no = 365*jy + (jy/33)*8 + (jy%33+3)/4
i = 0
while (i<jm):
j_day_no += monthDays[i]
i +=1
j_day_no += jd
g_day_no = j_day_no+79
gy = 1600 + 400*(g_day_no/146097)
g_day_no = g_day_no % 146097
leap = 1
if (g_day_no >= 36525):
g_day_no -=1
gy += 100*(g_day_no/36524)
g_day_no = g_day_no % 36524
if (g_day_no >= 365):
g_day_no +=1
else:
leap = 0
gy += 4*(g_day_no/1461)
g_day_no %= 1461
if (g_day_no >= 366):
leap = 0
g_day_no -=1
gy += g_day_no/365
g_day_no = g_day_no % 365
i=0
while (g_day_no >= monthdays[i] + (i == 1 and leap)):
g_day_no -= monthdays[i] + (i == 1 and leap)
i+=1
gm = i+1
gd = g_day_no+1
return gy,gm,gd
|