The*_*olC 6 python dictionary readability date
我有这个数据结构,每个团队都有开始/结束日期的问题列表.
对于每个团队,我想合并具有相同密钥和重叠日期的问题,在结果发布中,开始日期将是较小的日期,而结束日期将是更大的日期.
我试图用很少的for循环来做,但我想知道什么是最好的Pythonic方法来做到这一点.
我想仅在同一团队中合并具有相同密钥的问题并且具有重叠日期.
问题不是按时间顺序排列的.
输入:
{
'Team A': [{
'start': '11/Jul/13 1:49 PM',
'end': '10/Oct/13 5:16 PM',
'issue': 'KEY-12678'
}, {
'start': '3/Oct/13 10:40 AM',
'end': '11/Nov/13 1:02 PM',
'issue': 'KEY-12678'
}],
'Team B': [{
'start': '5/Sep/13 3:35 PM',
'end': '08/Nov/13 3:35 PM',
'issue': 'KEY-12679'
}, {
'start': '19/Aug/13 5:05 PM',
'end': '10/Sep/13 5:16 PM',
'issue': 'KEY-12679'
}, {
'start': '09/Jul/13 9:15 AM',
'end': '29/Jul/13 9:15 AM',
'issue': 'KEY-12680'
}]
}
Run Code Online (Sandbox Code Playgroud)
输出:
{
'Team A': [{
'start': '11/Jul/13 1:49 PM',
'end': '11/Nov/13 1:02 PM',
'issue': 'KEY-12678'
}],
'Team B': [{
'start': '19/Aug/13 5:05 PM',
'end': '08/Nov/13 3:35 PM',
'issue': 'KEY-12679'
}, {
'start': '09/Jul/13 9:15 AM',
'end': '29/Jul/13 9:15 AM',
'issue': 'KEY-12680'
}]
}
Run Code Online (Sandbox Code Playgroud)
要解析日期,这里是日期格式(为了节省几分钟):
date_format = "%d/%b/%y %H:%M %p"
Run Code Online (Sandbox Code Playgroud)
输入
d = {
"N/A": [
{'start': '23/Jun/14 8:48 PM', 'end': '01/Aug/14 11:00 PM', 'issue': 'KEY-12157'}
,{'start': '09/Jul/13 1:57 PM', 'end': '29/Jul/13 1:57 PM', 'issue': 'KEY-12173'}
,{'start': '21/Aug/13 12:29 PM', 'end': '02/Dec/13 6:06 PM', 'issue': 'KEY-12173'}
,{'start': '17/Feb/14 3:17 PM', 'end': '18/Feb/14 5:51 PM', 'issue': 'KEY-12173'}
,{'start': '12/May/14 4:42 PM', 'end': '02/Jun/14 4:42 PM', 'issue': 'KEY-12173'}
,{'start': '24/Jun/14 11:33 AM', 'end': '01/Aug/14 11:49 AM', 'issue': 'KEY-12173'}
,{'start': '07/Oct/14 1:17 PM', 'end': '17/Nov/14 10:30 AM', 'issue': 'KEY-12173'}
,{'start': '31/Mar/15 1:58 PM', 'end': '12/May/15 4:26 PM', 'issue': 'KEY-12173'}
,{'start': '15/Jul/14 10:06 AM', 'end': '15/Sep/14 5:25 PM', 'issue': 'KEY-12173'}
,{'start': '06/Jan/15 10:46 AM', 'end': '26/Jan/15 10:46 AM', 'issue': 'KEY-20628'}
,{'start': '18/Nov/14 5:08 PM', 'end': '16/Feb/15 1:31 PM', 'issue': 'KEY-20628'}
,{'start': '02/Oct/13 12:32 PM', 'end': '21/Oct/13 5:32 PM', 'issue': 'KEY-12146'}
,{'start': '11/Mar/14 12:08 PM', 'end': '31/Mar/14 12:08 PM', 'issue': 'KEY-12681'}
]}
Run Code Online (Sandbox Code Playgroud)
产量
{'start': '18/Nov/14 05:08 AM', 'issue': 'KEY-20628', 'end': '16/Feb/15 01:31 AM'}
{'start': '09/Jul/13 1:57 PM', 'issue': 'KEY-12173', 'end': '29/Jul/13 1:57 PM'}
{'start': '21/Aug/13 12:29 PM', 'issue': 'KEY-12173', 'end': '02/Dec/13 6:06 PM'}
{'start': '17/Feb/14 3:17 PM', 'issue': 'KEY-12173', 'end': '18/Feb/14 5:51 PM'}
{'start': '12/May/14 4:42 PM', 'issue': 'KEY-12173', 'end': '02/Jun/14 4:42 PM'}
{'start': '24/Jun/14 11:33 AM', 'issue': 'KEY-12173', 'end': '15/Sep/14 05:25 AM'}
{'start': '07/Oct/14 1:17 PM', 'issue': 'KEY-12173', 'end': '17/Nov/14 10:30 AM'}
{'start': '31/Mar/15 1:58 PM', 'issue': 'KEY-12173', 'end': '12/May/15 4:26 PM'}
{'start': '11/Mar/14 12:08 PM', 'issue': 'KEY-12681', 'end': '31/Mar/14 12:08 PM'}
{'start': '23/Jun/14 8:48 PM', 'issue': 'KEY-12157', 'end': '01/Aug/14 11:00 PM'}
{'start': '02/Oct/13 12:32 PM', 'issue': 'KEY-12146', 'end': '21/Oct/13 5:32 PM'}
Run Code Online (Sandbox Code Playgroud)
我正在提出一个 pandas 解决方案,如 aquavitae 在评论中所暗示的那样,其中包含以下步骤:
这看起来像:
import pandas as pd
import numpy as np
df = pd.DataFrame(d['N/A'])
df['end'] = pd.to_datetime(df['end'])
df['start'] = pd.to_datetime(df['start'])
df.sort(['issue', 'start'], inplace=True)
df.index = range(len(df))
time_overlaps = df[:-1]['end'] > df[1:]['start']
same_issue = df[:-1]['issue'] == df[1:]['issue']
rows_to_drop = np.logical_and(time_overlaps, same_issue)
rows_to_drop_indices = [i+1 for i, j in enumerate(rows_to_drop) if j]
for i in rows_to_drop_indices:
df.loc[i-1, 'end'] = df.loc[i, 'end']
df.drop(rows_to_drop_indices, inplace=True)
Run Code Online (Sandbox Code Playgroud)
如果您不想保留 DataFrame 对象并以您在问题中指定的格式进行进一步计算,请执行以下操作:
df.to_dict('records')
Run Code Online (Sandbox Code Playgroud)
编辑:找到了一种有效的方法!
| 归档时间: |
|
| 查看次数: |
236 次 |
| 最近记录: |