2 # This file is part of my.gpodder.org.
4 # my.gpodder.org is free software: you can redistribute it and/or modify it
5 # under the terms of the GNU Affero General Public License as published by
6 # the Free Software Foundation, either version 3 of the License, or (at your
7 # option) any later version.
9 # my.gpodder.org is distributed in the hope that it will be useful, but
10 # WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
11 # or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public
12 # License for more details.
14 # You should have received a copy of the GNU Affero General Public License
15 # along with my.gpodder.org. If not, see <http://www.gnu.org/licenses/>.
19 from datetime
import timedelta
, datetime
, time
21 from mygpo
.utils
import daterange
, flatten
22 from mygpo
.db
.couchdb
.podcast
import subscriberdata_for_podcast
23 from mygpo
.db
.couchdb
.episode
import episodes_for_podcast
24 from mygpo
.db
.couchdb
.episode_state
import podcast_listener_count_timespan
, \
25 episode_listener_count_timespan
28 def listener_data(podcasts
, start_date
=datetime(2010, 1, 1), leap
=timedelta(days
=1)):
29 """ Returns data for the podcast listener timeseries
31 An iterator with data for each day (starting from either the first released
32 episode or the earliest listen-event) is returned, where each day
33 is reresented by a dictionary
36 * listeners: the number of listeners on that day
37 * episode: (one of) the episode(s) released on that day
40 # pre-calculate episode list, make it index-able by release-date
41 episodes
= (episodes_for_podcast(podcast
, since
=start_date
) for podcast
in podcasts
)
42 episodes
= flatten(episodes
)
43 episodes
= dict((e
.released
.date(), e
) for e
in episodes
)
45 listeners
= [ podcast_listener_count_timespan(p
, start
=start_date
)
47 listeners
= filter(None, listeners
)
49 # we start either at the first episode-release or the first listen-event
53 events
.append(min(episodes
.keys()))
56 events
.append(min([l
[0][0] for l
in listeners
]))
63 for d
in daterange(start
, leap
=leap
):
75 episode
= episodes
[d
] if d
in episodes
else None
77 yield dict(date
=d
, listeners
=listener_sum
, episode
=episode
)
81 def episode_listener_data(episode
, start_date
=datetime(2010, 1, 1), leap
=timedelta(days
=1)):
82 """ Returns data for the episode listener timeseries
84 An iterator with data for each day (starting from the first listen-event)
85 is returned, where each day is represented by a dictionary
88 * listeners: the number of listeners on that day
89 * episode: the episode, if it was released on that day, otherwise None
92 listeners
= episode_listener_count_timespan(episode
, start
=start_date
)
97 # we always start at the first listen-event
98 start
= listeners
[0][0]
99 start
= datetime
.combine(start
, time())
101 for d
in daterange(start
, leap
=leap
):
104 if listeners
and listeners
[0] and listeners
[0][0] == d
.date():
105 day
, l
= listeners
.pop(0)
109 released
= episode
.released
and episode
.released
>= d
and episode
.released
<= next
110 released_episode
= episode
if released
else None
112 yield dict(date
=d
, listeners
=l
, episode
=released_episode
)
115 def subscriber_data(podcasts
):
116 coll_data
= collections
.defaultdict(int)
118 for podcast
in podcasts
:
119 create_entry
= lambda r
: (r
.timestamp
.strftime('%y-%m'), r
.subscriber_count
)
121 subdata
= podcast
.subscribers
+ subscriberdata_for_podcast(podcast
.get_id()).subscribers
123 data
= dict(map(create_entry
, subdata
))
126 coll_data
[k
] += data
[k
]
128 # create a list of {'x': label, 'y': value}
129 coll_data
= sorted([dict(x
=a
, y
=b
) for (a
, b
) in coll_data
.items()], key
=lambda x
: x
['x'])
134 def check_publisher_permission(user
, podcast
):
138 return (podcast
.get_id() in user
.published_objects
)
141 def colour_repr(val
, max_val
, colours
):
143 returns a color representing the given value within a color gradient.
145 The color gradient is given by a list of (r, g, b) tupels. The value
146 is first located within two colors (of the list) and then approximated
147 between these two colors, based on its position within this segment.
149 if len(colours
) == 1:
155 # calculate position in the gradient; defines the segment
156 pos
= float(val
) / max_val
157 colour_nr1
= min(len(colours
)-1, int(pos
* (len(colours
)-1)))
158 colour_nr2
= min(len(colours
)-1, colour_nr1
+1)
159 colour1
= colours
[ colour_nr1
]
160 colour2
= colours
[ colour_nr2
]
165 # determine bounds of segment
166 lower_bound
= float(max_val
) / (len(colours
)-1) * colour_nr1
167 upper_bound
= min(max_val
, lower_bound
+ float(max_val
) / (len(colours
)-1))
169 # position within the segment
170 percent
= (val
- lower_bound
) / upper_bound
176 return (r1
+ r_step
* percent
, g1
+ g_step
* percent
, b1
+ b_step
* percent
)