CrowdSource | Simple example

I'm creating an application with python that's going to show images scraped from DuckDuckGo's image search results. So I need to get a list of links to the images based on the search. The problem is that the HTML that constitutes DuckDuckGo's image search results does not contain any image tags but instead, the images seem to be stored in division tags. How can I with the help of python scrape those damn links to the images and store them in a variable on my program?

What I want my variable to look like:

Is there as way for an iphone app to store global application data in the cloud?

I wish to have global data for an iphone application in the cloud. I say global as the data is not user based. It will be the same for all users of the app. This would allow me to update a small, normally offline, database for every user without updating the application. It would also allow me to crowdsource information sent from the app to central global cloud storage. I am revisiting iOS after a number of years absence.

Does apple provide a cloud solution that will do this where I can buy cloud space for my app?

Could I do this using a single user account for all apps? Are there simple AWS alternatives? Obviously security is an issue. It would be nice if the data was secure against simply sniffing the net traffic. An off the shelf solution would be nice.

TL;DR: My AssignmentReviewPolicy is leading to all HITs being rejected. How do I change my policy to accept when "defendant" radio button is selected?

Details:

I include a golden question in my HITs to allow auto approval or rejection via the AssignmentReviewPolicy. I'm using only qualified workers for whom this question would be trivial.

My expected output is auto-approving the HIT when someone selects the radio button with value="defendant" for the question "checker". I am following this tutorial to set the AssignmentReviewPolicy.

My Python, shortened for clarity:

I have a screen that contains 2 views, a map(top) and a recycler(bottom) The rules are simple .

the recycler view is allowed to extend up to the middle of the screen, if more space is needed then it should scroll instead, the map will occupy the rest of the space, Of course if the recycler has less elements then it should shrink leaving more space for the map ..

I am trying to achieve this using constraint layout, also I am trying to avoid solutions that involved calculations .

Check image below for more information on what I am trying to achieve :

Here is my code

I come from macOS/Cocoa & Mouse Events, and I'm trying to get a hang of these "Finger"(my own name for it) events

My question is:

When a "Finger" event is happening on a UIView (let's call MyView), when does it get sent as a Gesture to a UIGestureRecognizer on MyView, and when does it get sent as a touchesBegan/touchesMoved/touchesEnded to MyView

I have searched with all possible queries I could think of, and really only found a few decent sources, but nothing that answers exactly what I'm looking for

touchesBegan, touchesEnded, touchesMoved for moving UIView

UIGestureRecognizers vs touchesBegan/touchesMoved/touchesEnded (accuracy)

My best guess right now is that the difference between touchBegan/touchMoved/touchEnded and a Gesture recognizer depends on the speed of the finger?

So if you tap, and slowly move, the underlying UIView receives the touchMoved events. If you Tap and drag quickly, a gesture is created and passed to the the GestureRecognizer of the underlying UIView

My current guess is that when the finger touches down, event runloop detects this finger, and fires a touchesBegan. As you move your finger around, it fires touchesMoved.
However, if you are moving quickly enough, or in a way that the runtime thinks that you're making a gesture, it instead creates a Gesture and fires a message to the UIGestureRecognizer, instead of sending touchesMoved

I am currently trying to test out this hypothesis, but it's pretty tedious and I don't have a really good sample project to test with, so I figured I'd crowdsource some insight if possible. I'll report back if I figure it out myself as well

I'm working on a crowdsourced app that will pit about 64 fictional strongmen/strongwomen from different franchises against one another and try and determine who the strongest is. (Think "Batman vs. Spiderman" writ large). Users will choose the winner of any given matchup between two at a time.

After researching many sorting algorithms, I found this fantastic SO post outlining the ELO rating system, which seems absolutely perfect. I've read up on the system and understand both how to award/subtract points in a matchup and how to calculate the performance rating between any two characters based on past results.

What I can't seem to find is any efficient and sensible way to determine which two characters to pit against one another at a given time. Naturally it will start off randomly, but quickly points will accumulate or degrade. We can expect a lot of disagreement but also, if I design this correctly, a large amount of user participation.

So imagine you arrive at this feature after 50,000 votes have been cast. Given that we can expect all sorts of non-transitive results under the hood, and a fair amount of deviance from the performance ratings, is there a way to calculate which matchups I most need more data on? It doesn't seem as simple as choosing two adjacent characters in a sorted list with the closest scores, or just focusing at the top of the list.

With 64 entrants (and yes, I did consider and reject a bracket!), I'm not worried about recomputing the performance ratings after every matchup. I just don't know how to choose the next one, seeing as we'll be ignorant of each voter's biases and favorite characters.

I tried for few hours to find the right syntax for making a regex query that returns reviews from 2-3 different projects but I failed and decided to crowdsource the task ;)

The search is documented at https://review.openstack.org/Documentation/user-search.html and mentions possible use of REGEX,... but it just didn't work.

Task: return all CRs from openstack-infra/gerritlib and openstack-infra/git-review projects from https://review.openstack.org

Doing it for one project works well project:openstack-infra/gerritlib

Ideally I would like to look for somethign like ^openstack-infra\/(gerritlib|git-review), or at least this is the standard regex syntax.

Still, I found impossible to use parentheses so far, every time I used them it stopped it from returning any results.

I am retrieving information with the following command:

In order to stay within the rate limits imposed by the Foursquare API, they previously recommended caching the data requested from it. However, after the recent site redesign, information on how long data should be cached is nowhere to be found. According to archive.org's WayBack machine, the documentation for the venues/categories endpoint previously said that the data for that endpoint should be cached for no more than a week, so I've implemented that in my app. That information is no longer on that documentation page. I'm now looking to cache the data from the venues/ endpoint (all the data of specific places), and likewise, no information about cache age is found, and I don't remember if there was any before. Would the 1 week previously recommended by the venues/categories endpoint be a reasonable cache lifetime for data from venues/? If not, what would be? The API Terms of Use say that no data can be cached more than 30 days without being updated, but that seems like a long time to keep data from a constantly-updated, crowdsourced platform. What cache age has worked well for you in the past?