ranked | Tracking kicker results | Microservice library

json

...

I'm attempting to select two tables that have the same columns and combining them into 1 which will rank column SalesAmount from Highest to Lowest. I've attempted to do this by using UNION ALL but currently, the returned select is ranking them both separately.

TableTwo has a different ReportId value then the values in TableOne.

Here is an example of the returned select from TableOne statement:

StateId ReportTitle ReportId SalesAmount SalesRank 1 Online Sales in California 21 22 1 12 Online Sales in New York 21 13 2 23 Online Sales in Nevada 21 9 4

Here is an example of the returned select from TableTwo which only has 1 value:

StateId ReportTitle ReportId SalesAmount SalesRank 14 Online Sales in Michigan 91 11 3

I am now attempting to combine these two tables and rank them accordingly. when using UNION ALL Here is what is being returned:

StateId ReportTitle ReportId SalesAmount SalesRank 1 Online Sales in California 21 22 1 12 Online Sales in New York 37 13 2 23 Online Sales in Nevada 14 9 4 14 Online Sales in Michigan 91 11 3

The row Michigan is ranked 3. It is selecting both tables into 1 statement but not ranking them as I am trying to do. How can I achieve this? My expected results is having both tables be Ordered By SalesRank appropriately

Here is an example of my expected result:

StateId ReportTitle ReportId SalesAmount SalesRank 1 Online Sales in California 21 22 1 12 Online Sales in New York 37 13 2 14 Online Sales in Michigan 91 11 3 23 Online Sales in Nevada 14 9 4

Here is a query of example:

...

I'm getting some data from a server and Un-Marshalling the JSON. When I cast the datetime string to a string, I get all my results as an Un-Marshalled object, but when I type it as time.Time, the rest of the object is cut short. Also, the date is wrong, which might be a hint.

I started casting the time to a string:

...

I have ranked data from a survey in which participants have ranked multiple items (n=50) in the order from 1 to 5.

The data looks similar to the following example:

...

Here is some fake/sample data:

...

Integer promotion works by promoting everything of an inferior rank to either int or uint. But why is this so?

It makes sense to make a difference between "upgrading" and "downgrading" a type. When you are converting a short to a char you may lose data.

However when going up in ranks (bool -> char -> short -> int -> long -> long long) there is no chance to lose data. If I have a char it doesnt matter if I convert it to a short or an int, I still won't lose any data.

My question is why is int promotion only from a lower ranked type towards int? Why was the decision made to have it like this? Why not towards the next higher ranked type for example (and the go on from there, try to promote again for example).

Seems to me that the implicit conversion semantics seem a bit arbitrary when you try to describe them. "most int types can be "promoted", meaning a conversion with no possibility of data loss, but the promotion only works towards int, not just any higher ranked type. If you convert anything to something else other than int it is called a conversion"

Would it not be simpler to use the actual ranks of the int types to attempt a series of "promotions"? Or just to call any conversion towards a higher ranked int a "promotion"?

P.S. this is an educational question not one a bout a specific programming issue but rather for my own curiosity.

...

I am completely new to all of this so please forgive any issues with how I'm describing and name things. I have an HTML page where the user enters a portion of a URL string in order to launch a new window with the complete URL string. I'd rather just lookup the portion of the URL using an API to create a JSON file and find it automatically. Any ideas how I can accomplish this without user intervention?

HTML (contains text box and button to launch a new window, which I would like to bypass this altogether)

...

Here, the desc key has a value which is a string;

...

I'm new to programming and to Swift; apologies if I'm asking an obvious question. I'm trying to simulate a ranked-choice voting algorithm. Several parts of it work, but I'm stuck on a basic idea: I need to generate an arbitrary number of arrays that contain each voter's imaginary votes. I want software to produce many arrays that look more or less like this:

...