2022-06-09 04:55:50 +00:00
|
|
|
# -- peridot-releng-header-v0.1 --
|
|
|
|
# Copyright (c) Peridot-Releng Authors. All rights reserved.
|
|
|
|
#
|
|
|
|
# Redistribution and use in source and binary forms, with or without
|
|
|
|
# modification, are permitted provided that the following conditions are met:
|
|
|
|
#
|
|
|
|
# 1. Redistributions of source code must retain the above copyright notice,
|
|
|
|
# this list of conditions and the following disclaimer.
|
|
|
|
#
|
|
|
|
# 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
|
|
# this list of conditions and the following disclaimer in the documentation
|
|
|
|
# and/or other materials provided with the distribution.
|
|
|
|
#
|
|
|
|
# 3. Neither the name of the copyright holder nor the names of its contributors
|
|
|
|
# may be used to endorse or promote products derived from this software without
|
|
|
|
# specific prior written permission.
|
|
|
|
#
|
|
|
|
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 'AS IS'
|
|
|
|
# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
|
|
|
|
# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
|
|
# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
|
|
# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
|
|
# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
|
|
# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
|
|
# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
|
|
# POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
|
|
|
import sys
|
|
|
|
import requests
|
|
|
|
import json
|
|
|
|
|
|
|
|
from itertools import islice
|
|
|
|
|
|
|
|
from common import construct_url
|
|
|
|
|
|
|
|
|
|
|
|
def chunks(lst, n):
|
|
|
|
for i in range(0, len(lst), n):
|
2022-08-04 03:01:32 +00:00
|
|
|
yield lst[i : i + n]
|
2022-06-09 04:55:50 +00:00
|
|
|
|
|
|
|
|
|
|
|
def get_packages(page):
|
|
|
|
r = requests.get(
|
2022-08-04 03:01:32 +00:00
|
|
|
construct_url(f"/packages?limit=100&page={page}&filters.no_builds=1")
|
|
|
|
)
|
|
|
|
return r.json()["packages"]
|
2022-06-09 04:55:50 +00:00
|
|
|
|
|
|
|
|
|
|
|
def process_packages():
|
|
|
|
ret = []
|
|
|
|
page = 0
|
|
|
|
while True:
|
|
|
|
res = get_packages(page)
|
|
|
|
if len(res) == 0:
|
|
|
|
return ret
|
|
|
|
ret.extend(res)
|
|
|
|
page = page + 1
|
|
|
|
|
|
|
|
|
2022-08-04 03:01:32 +00:00
|
|
|
if __name__ == "__main__":
|
2022-06-09 04:55:50 +00:00
|
|
|
batch_items = process_packages()
|
|
|
|
|
|
|
|
builds = []
|
|
|
|
for item in batch_items:
|
2022-08-04 03:01:32 +00:00
|
|
|
builds.append({"package_name": item["name"]})
|
2022-06-09 04:55:50 +00:00
|
|
|
for chunk in chunks(builds, 400):
|
|
|
|
print(json.dumps({"builds": chunk}))
|