Great tutorial how to use Devise with Rails 7 and Turbo: Youtube.
The task is to print all case permutations of letters from strings that can include digits and letters. For example,
a1b, a1B, A1b, A1B.
The trick here is to realize that there are
2^n possible permutations where
n is the number of characters, excluding digits.
To find the exact element or the next element that is greater than the target, use the following code. This algorithm returns an invalid index if the element that is searched for is greater than the greatest element in the array. This needs to be manually checked with
s(items, target) == len(items).
If you want to find the element which is exactly the element or less than the element, change the return value to
return m - 1 instead. In the smallest case this will return
-1 which means that the element searched for is smaller than the smallest on in the list. The resulting code looks like this:
hash method in python produces different results for the same object on each different Python run. This is meant as a security feature to prevent predictable hash values. For testing, this can be disabled by setting the environment variable
0. The hash value for a given key will then always be the same.
OpenAI just reduced their prices, starting September 1 2022 on midnight UTC. For the DaVinci model, the price is cut by around two thirds.
|Model||Before||On Sept 1|
|Davinci||$0.06 / 1k tokens||$0.02 / 1k tokens|
|Curie||$0.006 / 1k tokens||$0.002 / 1k tokens|
|Babbage||$0.0012 / 1k tokens||$0.0005 / 1k tokens|
|Ada||$0.0008 / 1k tokens||$0.0004 / 1k tokens|
|Davinci Embeddings||$0.6 / 1k tokens||$0.2 / 1k tokens|
|Curie Embeddings||$0.06 / 1k tokens||$0.02 / 1k tokens|
|Babbage Embeddings||$0.012 / 1k tokens||$0.005 / 1k tokens|
|Ada Embeddings||$0.008 / 1k tokens||$0.004 / 1k tokens|