diff --git a/.github/workflows/workflow.yml b/.github/workflows/workflow.yml index c397f07c..2dd54852 100644 --- a/.github/workflows/workflow.yml +++ b/.github/workflows/workflow.yml @@ -2,24 +2,24 @@ name: CI on: push: branches: - - master + - main pull_request: branches: - - master + - main jobs: test: - runs-on: ubuntu-20.04 + runs-on: ubuntu-latest steps: - - uses: actions/checkout@v4 + - uses: actions/checkout@v5 - name: Set up Python - uses: actions/setup-python@v5 + uses: actions/setup-python@v6 with: - python-version: '3.11.2' + python-version: '3.12.1' - name: Set up Node - uses: actions/setup-node@v4 + uses: actions/setup-node@v6 with: - node-version: '18.17.1' + node-version: '22.17.0' - name: Install chromedriver uses: nanasess/setup-chromedriver@master - name: Install Python and JS dependencies @@ -38,15 +38,15 @@ jobs: FIREBASE_TOKEN: '1//03I37hFeN4kn3CgYIARAAGAMSNwF-L9IrUvqofZbhOkS8YMtQBhw_bu2TpWYC5MHvnaZDsWPP0KJMypXPyoxogkl8A6p2RxPJQwQ' run: ./scripts/ci_test.sh - name: Upload test artifacts - uses: actions/upload-artifact@v4 + uses: actions/upload-artifact@v5 if: steps.build.outcome == 'success' with: path: '**/test_frontend_assets/' - name: Deploy preview uses: FirebaseExtended/action-hosting-deploy@v0 - if: steps.build.outcome == 'success' && github.ref != 'refs/heads/master' + if: steps.build.outcome == 'success' && github.ref != 'refs/heads/main' with: repoToken: '${{ secrets.GITHUB_TOKEN }}' - firebaseServiceAccount: '{ "type": "service_account", "project_id": "futurecoder-staging", "private_key_id": "22b14cd951860ff430e5dbc8f594fb4bc8f6cdab", "private_key": "-----BEGIN PRIVATE KEY-----\nMIIEvgIBADANBgkqhkiG9w0BAQEFAASCBKgwggSkAgEAAoIBAQCfOtcinbvJ5t9J\nh1N3yA37BUBlm0UdibbcZkQhI2YI5oUogF//F8Q9giEGzKcGexM5Yz2mLKhkwGVl\n+j5H+C3EFqUUqtAHk7Lf/F7KnS54fjMz76MgxG80xFCxrZcD6jJerxKUroukIEsK\n7VO28oY16i2kWF8gFwCIeTPGbRcSi3Y+V9JbOaIkIafx7kOU4u0o6X/KymKmws6G\nW462VBfaOwF81cObDMDBUl2RvbDK7vw2XhyTd5ua/EGNv0gGNdnl3XNVYI+a81Ct\nM1GIxV0r77wHTpEHWkC6bUh+e5D5mom6NQkZo64jcQSKAtkUzSaVdeXkHdEJjEZC\no/xBGRjPAgMBAAECggEADn2ATnokOL912m8iPWhLPWjA734tz/5UUcJMuOdLxcuU\nmpb0JXa4ORC6iK/fE0vn9/T8Cz9NI74OfDVFra78GzgkVbklrUrXoGKLDc04CWcS\nqctJARZfOGIVJdYyQ/zwEIXGHxmzQ4Bc0+W9FI0FgaqJ9MbGAVmWhtTgzVHoI5vA\npPgDBYX6NTKUwcGcIAloapvGUSmBuNE2nt46TA8zR8UFCxSHogY030WQZJJrQhGY\nmwlmWcj4+yVP9DSzGKo4M6eEkfx/uoPT0SHED91Fev3lMre5j4Jcsw5DaAECnyS4\n6osyXDverxmoqHtDjULt8qZR6cpD1lj8j1rukX/ZYQKBgQDRt/UeiqeoGDiQMuii\nG8A6WKc8Ajt/H0NQTHiRxuK0KJWXQoo29rVIRTWYdhiryXn5Ox6IqHyzdR8n/45M\nS2MchwJ5flztePZAfAL1bT5VZ4wS9XvXmg6kqPVDztEM0b/tc8pYbu7vFaa3t1KZ\nWg5OHQG4ujSzB1ov3kZk1rNzIwKBgQDCXoYShoaoAsbXWGrZ5Alwia7ovm+EI0XT\nukeNZ+jrNPs6feBLSZtWmNpWcYtFtudrLJxn/5zesxJdT35y1C2HuH4//9UHpd7q\njKKonUXmRmP+5EirCYr08kO3fzrM8tPpZgEOx/hw+dvS04zgwjGSsZ4L2YyAtT13\nYteV2hFkZQKBgQC8dgHS1mtfxZRfEUC5HRMb27s9VAw/asrFCFN5PS9REv+LFIK8\nbevu7DMDtWzqQ35XGGeSC0c0xdWfzioEKeMBKdpxb7r2tLMms8q83tUbTpg0GWKX\nF5x9IFB4BQ0b5goBywJVgis5s01E33tcz+73B14asUrWb47+YVMFH2PX3QKBgQCx\nX0z+TuFHJPGLxtYLbPvoRNzm7BIcBYxNQOrW8gIt0jWJFSG/0rX8+pQU2pz7y4O3\n3AgHJ85htAyINmjwJQw/lG8xvCcNSaL5a8lsEcmd8JKEIpLl8llqWkLNiz9/lAEq\nNrm0YWwovPqLlB41ZUGT2p6dtbNwKPSkpACUcWH5uQKBgGO1hVeWdVgKESi4eDZF\nRiY7i/RvsVSz6FY4vOB8gjGFuPkucPnDQEczFU64HbqiVqqv50ceGm7CkYWekCbh\nWlqvH/ptmKt71taSi2hbNoinFqWoU2Wqs2n2JFAzFNrS8m2KYjshVK9/ycllGIFr\nYXCZv1gcS+vONiEt5lzPK/We\n-----END PRIVATE KEY-----\n", "client_email": "firebase-adminsdk-r0lzu@futurecoder-staging.iam.gserviceaccount.com", "client_id": "109050011633679213214", "auth_uri": "https://accounts.google.com/o/oauth2/auth", "token_uri": "https://oauth2.googleapis.com/token", "auth_provider_x509_cert_url": "https://www.googleapis.com/oauth2/v1/certs", "client_x509_cert_url": "https://www.googleapis.com/robot/v1/metadata/x509/firebase-adminsdk-r0lzu%40futurecoder-staging.iam.gserviceaccount.com" }' + firebaseServiceAccount: '${{ secrets.FIREBASE_SERVICE_ACCOUNT }}' projectId: futurecoder-staging channelId: ${{ github.ref }} diff --git a/.gitignore b/.gitignore index 659cf51c..7b6cfdd7 100644 --- a/.gitignore +++ b/.gitignore @@ -145,3 +145,4 @@ homepage/static/css/**/*.css translations/codes.json .DS_Store +translations/chunks/ diff --git a/README.md b/README.md index a7a8134c..10df0f0f 100644 --- a/README.md +++ b/README.md @@ -1,5 +1,5 @@

- MIT license + MIT license Tests status logo Testing Powered By SauceLabs @@ -15,7 +15,7 @@ You can try it out here: https://futurecoder.io/ **Please consider [contributing](how_to_contribute.md) or [donating](https://opencollective.com/futurecoder)!** -Alternatively, [come have a chat on slack](https://join.slack.com/t/futurecoder/shared_invite/zt-tp8cmwra-CbdEeX9u3k1VyoMLDupAeQ). +Alternatively, [come have a chat on discord](https://discord.gg/KwWvQCPBjW). ## Features @@ -138,11 +138,11 @@ Several debuggers are provided, including [snoop](https://github.com/alexmojaki/ ## Running locally 1. Fork this repo, `git clone` it, and enter the top-level `futurecoder` folder. -2. Install Python 3.11.2 and [poetry](https://python-poetry.org/docs/#installation). +2. Install Python 3.12.1 and [poetry](https://python-poetry.org/docs/#installation). 3. Run `poetry install` to install Python dependencies. 4. Run `./scripts/generate.sh`. This will generate various static files from Python used by the frontend and run some tests. Repeat this step whenever you change Python files. 5. In the `frontend` folder: - 1. Install `node`. We recommend using version 16.17.1 (lts/gallium) but there are no known issues with other versions. + 1. Install `node >= 22.17.0`. 2. Run `npm ci` to download dependencies. diff --git a/core/chapters/c09_functions.py b/core/chapters/c09_functions.py index a41cc552..b56af9ea 100644 --- a/core/chapters/c09_functions.py +++ b/core/chapters/c09_functions.py @@ -200,7 +200,7 @@ def print_twice(x: str): class print_many(VerbatimStep): """ -Functions can have many parameters. Here's an example: +Functions can have many parameters. Try the below example: __program_indented__ """ diff --git a/core/chapters/c12_dictionaries.py b/core/chapters/c12_dictionaries.py index c4ecd336..68e41809 100644 --- a/core/chapters/c12_dictionaries.py +++ b/core/chapters/c12_dictionaries.py @@ -2,17 +2,14 @@ import ast import random from collections import Counter -from typing import List, Dict +from copy import deepcopy +from typing import Dict, List from core import translation as t from core.exercises import assert_equal from core.exercises import generate_string, generate_dict -from core.text import ( - ExerciseStep, - Page, - Step, - VerbatimStep, -) +from core.text import Page, VerbatimStep, ExerciseStep, Step +from core.utils import returns_stdout, wrap_solution # Similar to word_must_be_hello @@ -450,7 +447,7 @@ class keys_are_iterable2(VerbatimStep): program_in_text = False requirements = ( - "Run the same code as the previous step, but without `.keys()`. after `quantities`, " + "Run the same code as the previous step, but without `.keys()` after `quantities`, " "so the middle line is `for key in quantities:`" ) @@ -666,5 +663,480 @@ def print_words(words): }) final_text = """ - Congratulations! You've reached the end of the course so far. More is on the way! + 👌 + + Now that you can *get* values from a dictionary, you'll soon learn how to *set* values in a dictionary. """ + + +class CreatingKeyValuePairs(Page): + title = "Creating Key-Value Pairs" + + class list_append_reminder(VerbatimStep): + """ + Now we'll learn how to add key-value pairs to a dictionary, + e.g. so that we can keep track of what the customer is buying. + Before looking at dictionaries, let's remind ourselves how to add items to a list. Run this program: + + __copyable__ + __program_indented__ + """ + + def program(self): + cart = [] + cart.append('dog') + cart.append('box') + print(cart) + + predicted_output_choices = [ + "[]", + "['dog']", + "['box']", + "['dog', 'box']", + "['box', 'dog']", + "['dog', 'dog']", + "['box', 'box']", + ] + + class list_assign_reminder(VerbatimStep): + """ + Pretty simple. We can also change the value at an index, replacing it with a different one: + + __copyable__ + __program_indented__ + """ + + def program(self): + cart = ['dog', 'cat'] + cart[1] = 'box' + print(cart) + + predicted_output_choices = [ + "['box']", + "['dog', 'cat']", + "['box', 'dog']", + "['box', 'cat']", + "['dog', 'box']", + "['cat', 'box']", + "['box', 'dog', 'cat']", + "['dog', 'box', 'cat']", + "['dog', 'cat', 'box']", + ] + + class list_assign_invalid(VerbatimStep): + """ + What if we used that idea to create our list in the first place? + We know we want a list where `cart[0]` is `'dog'` and `cart[1]` is `'box'`, so let's just say that: + + __copyable__ + __program_indented__ + """ + + def program(self): + cart = [] + cart[0] = 'dog' + cart[1] = 'box' + print(cart) + + predicted_output_choices = [ + "[]", + "['dog']", + "['box']", + "['dog', 'box']", + "['box', 'dog']", + "['dog', 'dog']", + "['box', 'box']", + ] + + correct_output = "Error" + + class dict_assignment_valid(VerbatimStep): + """ + Sorry, that's not allowed. For lists, subscript assignment only works for existing valid indices. + But that's not true for dictionaries! Try this: + + __program_indented__ + + Note that `{}` means an empty dictionary, i.e. a dictionary with no key-value pairs. + This is similar to `[]` meaning an empty list or `""` meaning an empty string. + """ + predicted_output_choices = [ + "{'dog': 500, 'box': 2}", + "{'dog': 2, 'box': 500}", + "{2: 'dog', 500: 'box'}", + "{500: 'dog', 2: 'box'}", + ] + + def program(self): + quantities = {} + quantities['dog'] = 500 + quantities['box'] = 2 + print(quantities) + + class buy_quantity_exercise(ExerciseStep): + """ + That's exactly what we need. Whether the customer says they want 500 or 5 million dogs, + we can just put that information directly into our dictionary. So as an exercise, let's make a generic version of that. + Write a function `buy_quantity(quantities, item, quantity)` which adds a new key-value pair to the `quantities` dictionary. + Here's some starting code: + + __copyable__ + def buy_quantity(quantities, item, quantity): + ... + + def test(): + quantities = {} + buy_quantity(quantities, 'dog', 500) + assert_equal(quantities, {'dog': 500}) + buy_quantity(quantities, 'box', 2) + assert_equal(quantities, {'dog': 500, 'box': 2}) + + test() + + Note that `buy_quantity` should *modify* the dictionary that's passed in, and doesn't need to `return` or `print` anything. + You can assume that `item` isn't already in `quantities`. + """ + requirements = "Your function should modify the `quantities` argument. It doesn't need to `return` or `print` anything." + + hints = """ + The body of `buy_quantity` only needs one simple line of code. + It's similar to some of the lines in the previous step, but with variables instead of hardcoded values. + Be careful with quotes! + `'dog'` is an example of a value for `item`. + What would be an example of a value for `quantity`? + For `'dog'`, it was `500` above. + You're making a generic version of `quantities['dog'] = 500`. + The `quantities` part is fine as is. + Also keep the `[]` and `=`. + Remember that `item` is a variable, `'item'` is a string literal. + Replace `'dog'` with `item`. + Replace `500` with `quantity`. + Don't use `'item'` or `'quantity'`, use the variables `item` and `quantity` directly. + """ + + no_returns_stdout = True # because the solution doesn't return anything, returning stdout would be assumed + + def solution(self): + def buy_quantity(quantities: Dict[str, int], item: str, quantity: int): + quantities[item] = quantity + return buy_quantity + + @classmethod + def wrap_solution(cls, func): + @wrap_solution(func) + def wrapper(**kwargs): + quantities_name = t.get_code_bit("quantities") + quantities = kwargs[quantities_name] = deepcopy(kwargs[quantities_name]) + + func(**kwargs) + return quantities + return wrapper + + @classmethod + def generate_inputs(cls): + result = super().generate_inputs() + result["quantities"].pop(result["item"], None) # ensure item is not already in quantities + return result + + tests = [ + ( + dict( + quantities={}, + item='dog', + quantity=500 + ), + {'dog': 500} + ), + ( + dict( + quantities={'dog': 500}, + item='box', + quantity=2 + ), + {'dog': 500, 'box': 2} + ), + ( + dict( + quantities={'apple': 3, 'banana': 5}, + item='orange', + quantity=10 + ), + {'apple': 3, 'banana': 5, 'orange': 10} + ), + ( + dict( + quantities={}, + item='cat', + quantity=1 + ), + {'cat': 1} + ), + ] + + class buy_quantity_input_test(VerbatimStep): + """ + Well done! Try it out interactively: + + __copyable__ + __program_indented__ + + Note the `int(input())` part, because `input()` returns a string, and `quantity` should be an integer + (a whole number). This'll break if you enter something that isn't a number, but that's OK for now. + """ + + stdin_input = ["apple", "3", "banana", "5", "cat", "2"] + + def program(self): + def buy_quantity(quantities, item, quantity): + quantities[item] = quantity + + def test(): + quantities = {} + for _ in range(3): + print('What would you like to buy?') + item = input() + + print('How many?') + quantity = int(input()) + + buy_quantity(quantities, item, quantity) + + print("OK, here's your cart so far:") + print(quantities) + + test() + + class total_cost_per_item_exercise(ExerciseStep): + """ + Thanks for shopping with us! Let's see how much you just spent on each item. + + Earlier we defined a function `total_cost(quantities, prices)` which returned a single number + with a grand total of all the items in the cart. Now let's make a function `total_cost_per_item(quantities, prices)` + which returns a new dictionary with the total cost for each item: + + __copyable__ + def total_cost_per_item(quantities, prices): + totals = {} + for item in quantities: + ___ = quantities[item] * prices[item] + return totals + + assert_equal( + total_cost_per_item({'apple': 2}, {'apple': 3, 'box': 5}), + {'apple': 6}, + ) + + assert_equal( + total_cost_per_item({'dog': 500, 'box': 2}, {'dog': 100, 'box': 5}), + {'dog': 50000, 'box': 10}, + ) + """ + hints = """ + You only need to fill in the `___` part. + But if you want, you could also just put a variable name there, and then add a new line below it. + Look at the tests with `assert_equal`. In the first example, the expected output is `{'apple': 6}`. Why? + Because the customer bought 2 apples, and each apple costs 3, so the total cost is `2 * 3 = 6`. + The `'box': 5` part is ignored because the customer didn't buy any boxes. It just means that the price of a box is 5. + You need to add a new key-value pair to a dictionary. + Identify the dictionary, the key, and the value. + They are all present in the given code already. + The value is the total cost for that item, which is the quantity multiplied by the price. + i.e. `quantities[item] * prices[item]`. + The dictionary is the thing that this function creates, builds, and returns. + i.e. `totals`. + Note how `'apple'` is a key in all three dictionaries in that test. + i.e. the dictionaries `quantities`, `prices`, and `totals`. + """ + + requirements = "Run the program above, but replace the `___` with the correct code." + + def solution(self): + def total_cost_per_item(quantities: Dict[str, int], prices: Dict[str, int]): + totals = {} + for item in quantities: + totals[item] = quantities[item] * prices[item] + return totals + return total_cost_per_item + + tests = [ + (({'apple': 2}, {'apple': 3, 'box': 5}), {'apple': 6}), + (({'dog': 500, 'box': 2}, {'dog': 100, 'box': 5}), {'dog': 50000, 'box': 10}), + (({'pen': 5, 'pencil': 10}, {'pen': 1, 'pencil': 0.5, 'eraser': 2}), {'pen': 5, 'pencil': 5.0}), + (({}, {'apple': 1}), {}), + ] + + @classmethod + def generate_inputs(cls): + prices = generate_dict(str, int) + quantities = {k: random.randint(1, 10) for k in prices if random.choice([True, False])} + return {"quantities": quantities, "prices": prices} + + class make_english_to_german_exercise(ExerciseStep): + """ + Perfect! This is like having a nice receipt full of useful information. + + Let's come back to the example of using dictionaries for translation. Suppose we have one dictionary + for translating from English to French, and another for translating from French to German. + Let's use that to create a dictionary that translates from English to German: + + __copyable__ + def make_english_to_german(english_to_french, french_to_german): + ... + + assert_equal( + make_english_to_german( + {'apple': 'pomme', 'box': 'boite'}, + {'pomme': 'apfel', 'boite': 'kasten'}, + ), + {'apple': 'apfel', 'box': 'kasten'}, + ) + """ + parsons_solution = True + + hints = """ + You need to create a new dictionary and fill it with key-value pairs depending on the two input dictionaries. + You've seen code that does this before. + Specifically the previous step. The overall structure you want is similar to `total_cost_per_item`. + Start by creating a new empty dictionary. + Return the dictionary at the end. Then fill in the code in between. + You need a `for` loop. + The line `totals[item] = quantities[item] * prices[item]` from the previous step is close to what you need. + You don't need to multiply anything with `*`, the names are different, and there's another difference in logic. + Think about what the keys and values of the new dictionary should be. + The keys should be English words, so they should come from the first dictionary. + The values should be German words, so they should come from the second dictionary. + Specifically the keys of your dictionary should be the keys of the first dictionary. + And the values of your dictionary should be the values of the second dictionary. + What about the values of the first dictionary and the keys of the second dictionary? They're important. + Look at the French words `'pomme'` and `'boite'` in the example test. + The values of the first input dictionary are the keys of the second input dictionary. + """ + + def solution(self): + def make_english_to_german(english_to_french: Dict[str, str], french_to_german: Dict[str, str]): + english_to_german = {} + for english in english_to_french: + french = english_to_french[english] + german = french_to_german[french] + english_to_german[english] = german + return english_to_german + return make_english_to_german + + tests = [ + (({'apple': 'pomme', 'box': 'boite'}, {'pomme': 'apfel', 'boite': 'kasten'}), + {'apple': 'apfel', 'box': 'kasten'}), + (({'one': 'un', 'two': 'deux', 'three': 'trois'}, {'un': 'eins', 'deux': 'zwei', 'trois': 'drei'}), + {'one': 'eins', 'two': 'zwei', 'three': 'drei'}), + (({}, {}), {}), + ] + + @classmethod + def generate_inputs(cls): + english_to_french = generate_dict(str, str) + french_to_german = {v: generate_string() for v in english_to_french.values()} + return {"english_to_french": english_to_french, "french_to_german": french_to_german} + + class swap_keys_values_exercise(ExerciseStep): + """ + Great job! + + Of course, language isn't so simple, and there are many ways that using a dictionary like this could go wrong. + So...let's do something even worse! Let's use an English-to-French dictionary to create a French-to-English dictionary. + Write a function which takes a dictionary returns a new dictionary where the keys and values are swapped, + so `a: b` becomes `b: a`. + + __copyable__ + def swap_keys_values(d): + ... + + assert_equal( + swap_keys_values({'apple': 'pomme', 'box': 'boite'}), + {'pomme': 'apple', 'boite': 'box'}, + ) + """ + hints = """ + Don't modify the input dictionary `d`. + You need to create a new dictionary and fill it with key-value pairs depending on the input dictionary. + You've done this in the previous exercise. The overall structure you want is similar to `make_english_to_german`. + It's actually even simpler, it just might feel weird. + Start by creating a new empty dictionary. Return the dictionary at the end. Put a `for` loop in between. + Think about what the keys and values of the new dictionary should be. + There's only one possible thing for you to loop over. + Use each key in the input dictionary `d` to get the corresponding value. + """ + + def solution(self): + def swap_keys_values(d: Dict[str, str]): + new_dict = {} + for key in d: + value = d[key] + new_dict[value] = key + return new_dict + return swap_keys_values + + tests = [ + (({'apple': 'pomme', 'box': 'boite'},), {'pomme': 'apple', 'boite': 'box'}), + (({'a': 1, 'b': 2},), {1: 'a', 2: 'b'}), + (({10: 'x', 20: 'y'},), {'x': 10, 'y': 20}), + (({},), {}), + ] + + class avocado_or_lawyer(VerbatimStep): + """ +Magnificent! + +Jokes aside, it's important to remember how exactly this can go wrong. Just like multiple items in the store +can have the same price, multiple words in English can have the same translation in French. If the original dictionary +has duplicate *values*, what happens when you try to swap keys and values? Since dictionary keys must be unique, +some data will be lost. + +For example, 'avocat' in French can mean either 'avocado' and 'lawyer'. So it's easy to translate +'avocado' from English to French, but it's not so clear how to translate 'avocat' back to English. +Try to guess what the following code will print: + + __copyable__ + __program_indented__ + """ + + def program(self): + def swap_keys_values(d): + new_dict = {} + for key in d: + new_dict[d[key]] = key + return new_dict + + print(swap_keys_values({'apple': 'pomme', 'avocado': 'avocat', 'lawyer': 'avocat'})) + print(swap_keys_values({'apple': 'pomme', 'lawyer': 'avocat', 'avocado': 'avocat'})) + + final_text = """ +The result depends on the order of the keys in the original dictionary! +If you're not sure why, try running the code with `snoop` or another debugger. + +But there are many situations where you can be sure that the values in a dictionary *are* unique and that this +'inversion' makes sense. For example, we saw this code [earlier in the chapter](#UsingDictionaries): + + __copyable__ + __no_auto_translate__ + def substitute(string, d): + result = "" + for letter in string: + result += d[letter] + return result + + plaintext = 'helloworld' + encrypted = 'qpeefifmez' + letters = {'h': 'q', 'e': 'p', 'l': 'e', 'o': 'f', 'w': 'i', 'r': 'm', 'd': 'z'} + reverse = {'q': 'h', 'p': 'e', 'e': 'l', 'f': 'o', 'i': 'w', 'm': 'r', 'z': 'd'} + assert_equal(substitute(plaintext, letters), encrypted) + assert_equal(substitute(encrypted, reverse), plaintext) + +Now we can construct the `reverse` dictionary automatically: + + reverse = swap_keys_values(letters) + +For this to work, we just have to make sure that all the values in `letters` are unique. +Otherwise it would be impossible to decrypt messages properly. If both `'h'` and `'j'` got replaced with `'q'` +during encryption, there would be no way to know whether `'qpeef'` means `'hello'` or `'jello'`! + +Congratulations! You've reached the end of the course so far. More is on the way! +""" diff --git a/core/core_imports.txt b/core/core_imports.txt index 66cf3097..3f32002a 100644 --- a/core/core_imports.txt +++ b/core/core_imports.txt @@ -8,13 +8,10 @@ executing friendly_traceback littleutils markdown -packaging -pkg_resources pure_eval pyflakes pygments python_runner sentry_sdk -six.py snoop stack_data \ No newline at end of file diff --git a/core/translation.py b/core/translation.py index bda360e0..007072ea 100644 --- a/core/translation.py +++ b/core/translation.py @@ -275,7 +275,8 @@ class Terms: disallowed_default_label = "more than {max_count} {label}" expected_mode_shell = ( - "Type your code directly in the shell after `>>>` and press Enter." + "Type your code directly in the shell **after `>>>` and press Enter**. " + "Don't type in the editor, which is above the shell. Don't press 'Run' or other buttons at the top." ) expected_mode_birdseye = ( "With your code in the editor, click the `birdseye` button." diff --git a/core/utils.py b/core/utils.py index 16381b81..709b9c2b 100644 --- a/core/utils.py +++ b/core/utils.py @@ -8,7 +8,7 @@ from itertools import combinations from random import shuffle from textwrap import dedent -from tokenize import generate_tokens +from tokenize import generate_tokens, TokenError from types import ModuleType from typing import Union @@ -32,9 +32,10 @@ def qa_error(message, cls=AssertionError): def stub_module(name): - assert name not in sys.modules sys.modules[name] = ModuleType(name) + +assert "selenium" in sys.modules or not ("urllib3" in sys.modules or "certifi" in sys.modules) stub_module("urllib3") stub_module("certifi") @@ -55,7 +56,7 @@ def clean_spaces(string): assert spaces <= {" ", "\n"}, (spaces, string) # In translation, special codes like `__copyable__` often get the wrong indentation. # They must be preceded by 0 or 4 spaces. - if re.search(r"^( {1,3}| {5,})_", string, re.MULTILINE): + if re.search(r"^( {1,3}| {5,})__[a-z]+", string, re.MULTILINE): qa_error("Incorrect indentation of code:\n" + string) return string @@ -309,6 +310,7 @@ def wrapper(*args, **kwargs): if TESTING: raise return internal_error_result(e) + return wrapper @@ -324,12 +326,13 @@ def split_into_tokens_gen(s): linenos = asttokens.LineNumbers(s) try: tokens = list(generate_tokens(StringIO(s).readline)) - except SyntaxError: + except (SyntaxError, TokenError): yield from s return for t1, t2 in zip(tokens, tokens[1:]): start1, end1 = token_text_range(t1, linenos) start2, end2 = token_text_range(t2, linenos) + end1 = min(end1, start2) # workaround a specific unicode bug in 3.12.1 assert start1 <= end1 <= start2 <= end2 yield s[start1:end1] yield s[end1:start2] diff --git a/frontend/craco.config.js b/frontend/craco.config.js index 96b665a0..ecd1075f 100644 --- a/frontend/craco.config.js +++ b/frontend/craco.config.js @@ -1,8 +1,14 @@ const path = require('path'); +const {PyodidePlugin} = require("@pyodide/webpack-plugin"); module.exports = { - // Output to ./course (instead of ./build) webpack: { + plugins: { + add: [ + new PyodidePlugin(), + ] + }, + // Output to ./course (instead of ./build) configure: (webpackConfig, {env, paths}) => { paths.appBuild = webpackConfig.output.path = path.resolve('course'); return webpackConfig; diff --git a/frontend/package-lock.json b/frontend/package-lock.json index a4ab426a..efcb951f 100644 --- a/frontend/package-lock.json +++ b/frontend/package-lock.json @@ -12,20 +12,20 @@ "@fortawesome/fontawesome-svg-core": "^6.2.0", "@fortawesome/free-solid-svg-icons": "^6.2.0", "@fortawesome/react-fontawesome": "^0.2.0", - "@sentry/react": "^7.16.0", + "@sentry/react": "^7.119.1", "ansi_up": "^5.0.0", - "axios": "^1.6.0", + "axios": "^1.12.0", "comlink": "^4.3.1", "comsync": "^0.0.8", "defaults": "^1.0.3", "firebase": "^8.6.3", - "http-proxy-middleware": "^1.0.6", + "http-proxy-middleware": "^3.0.5", "localforage": "^1.9.0", "lodash": "^4.17.21", "p-retry": "^5.0.0", "prop-types": "^15.7.2", - "pyodide": "^0.23.2", - "pyodide-worker-runner": "^1.3.3", + "pyodide": "^0.26.2", + "pyodide-worker-runner": "^1.4.0", "react": "^17.0.2", "react-ace": "^10.0.0", "react-beautiful-dnd": "^13.1.0", @@ -47,12 +47,13 @@ "sync-message": "^0.0.10" }, "devDependencies": { + "@pyodide/webpack-plugin": "^1.3.2", "raw-loader": "^4.0.2", "worker-loader": "^3.0.8" }, "engines": { - "node": ">= 16.17.1", - "npm": ">= 8.15.0" + "node": ">= 22.17.0", + "npm": ">= 10.9.2" } }, "node_modules/@ampproject/remapping": { @@ -68,12 +69,13 @@ } }, "node_modules/@babel/code-frame": { - "version": "7.23.5", - "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.23.5.tgz", - "integrity": "sha512-CgH3s1a96LipHCmSUmYFPwY7MNx8C3avkq7i4Wl3cfa662ldtUe4VM1TPXX70pfmrlWTb6jLqTYrZyT2ZTJBgA==", + "version": "7.27.1", + "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.27.1.tgz", + "integrity": "sha512-cjQ7ZlQ0Mv3b47hABuTevyTuYN4i+loJKGeV9flcCgIK37cCXRh+L1bd3iBHlynerhQ7BhCkn2BPbQUL+rGqFg==", "dependencies": { - "@babel/highlight": "^7.23.4", - "chalk": "^2.4.2" + "@babel/helper-validator-identifier": "^7.27.1", + "js-tokens": "^4.0.0", + "picocolors": "^1.1.1" }, "engines": { "node": ">=6.9.0" @@ -461,17 +463,17 @@ } }, "node_modules/@babel/helper-string-parser": { - "version": "7.23.4", - "resolved": "https://registry.npmjs.org/@babel/helper-string-parser/-/helper-string-parser-7.23.4.tgz", - "integrity": "sha512-803gmbQdqwdf4olxrX4AJyFBV/RTr3rSmOj0rKwesmzlfhYNDEs+/iOcznzpNWlJlIlTJC2QfPFcHB6DlzdVLQ==", + "version": "7.27.1", + "resolved": "https://registry.npmjs.org/@babel/helper-string-parser/-/helper-string-parser-7.27.1.tgz", + "integrity": "sha512-qMlSxKbpRlAridDExk92nSobyDdpPijUq2DW6oDnUqd0iOGxmQjyqhMIihI9+zv4LPyZdRje2cavWPbCbWm3eA==", "engines": { "node": ">=6.9.0" } }, "node_modules/@babel/helper-validator-identifier": { - "version": "7.22.20", - "resolved": "https://registry.npmjs.org/@babel/helper-validator-identifier/-/helper-validator-identifier-7.22.20.tgz", - "integrity": "sha512-Y4OZ+ytlatR8AI+8KZfKuL5urKp7qey08ha31L8b3BwewJAoJamTzyvxPR/5D+KkdJCGPq/+8TukHBlY10FX9A==", + "version": "7.27.1", + "resolved": "https://registry.npmjs.org/@babel/helper-validator-identifier/-/helper-validator-identifier-7.27.1.tgz", + "integrity": "sha512-D2hP9eA+Sqx1kBZgzxZh0y1trbuU+JoDkiEwqhQ36nodYqJwyEIhPSdMNd7lOm/4io72luTPWH20Yda0xOuUow==", "engines": { "node": ">=6.9.0" } @@ -499,35 +501,24 @@ } }, "node_modules/@babel/helpers": { - "version": "7.20.7", - "resolved": "https://registry.npmjs.org/@babel/helpers/-/helpers-7.20.7.tgz", - "integrity": "sha512-PBPjs5BppzsGaxHQCDKnZ6Gd9s6xl8bBCluz3vEInLGRJmnZan4F6BYCeqtyXqkk4W5IlPmjK4JlOuZkpJ3xZA==", + "version": "7.27.6", + "resolved": "https://registry.npmjs.org/@babel/helpers/-/helpers-7.27.6.tgz", + "integrity": "sha512-muE8Tt8M22638HU31A3CgfSUciwz1fhATfoVai05aPXGor//CdWDCbnlY1yvBPo07njuVOCNGCSp/GTt12lIug==", "dependencies": { - "@babel/template": "^7.20.7", - "@babel/traverse": "^7.20.7", - "@babel/types": "^7.20.7" + "@babel/template": "^7.27.2", + "@babel/types": "^7.27.6" }, "engines": { "node": ">=6.9.0" } }, - "node_modules/@babel/highlight": { - "version": "7.23.4", - "resolved": "https://registry.npmjs.org/@babel/highlight/-/highlight-7.23.4.tgz", - "integrity": "sha512-acGdbYSfp2WheJoJm/EBBBLh/ID8KDc64ISZ9DYtBmC8/Q204PZJLHyzeB5qMzJ5trcOkybd78M4x2KWsUq++A==", + "node_modules/@babel/parser": { + "version": "7.28.0", + "resolved": "https://registry.npmjs.org/@babel/parser/-/parser-7.28.0.tgz", + "integrity": "sha512-jVZGvOxOuNSsuQuLRTh13nU0AogFlw32w/MT+LV6D3sP5WdbW61E77RnkbaO2dUvmPAYrBDJXGn5gGS6tH4j8g==", "dependencies": { - "@babel/helper-validator-identifier": "^7.22.20", - "chalk": "^2.4.2", - "js-tokens": "^4.0.0" + "@babel/types": "^7.28.0" }, - "engines": { - "node": ">=6.9.0" - } - }, - "node_modules/@babel/parser": { - "version": "7.23.9", - "resolved": "https://registry.npmjs.org/@babel/parser/-/parser-7.23.9.tgz", - "integrity": "sha512-9tcKgqKbs3xGJ+NtKF2ndOBBLVwPjl1SHxPQkd36r3Dlirw3xWUeGaTbqr7uGZcTaxkVNwc+03SVP7aCdWrTlA==", "bin": { "parser": "bin/babel-parser.js" }, @@ -1827,36 +1818,32 @@ } }, "node_modules/@babel/runtime": { - "version": "7.20.7", - "resolved": "https://registry.npmjs.org/@babel/runtime/-/runtime-7.20.7.tgz", - "integrity": "sha512-UF0tvkUtxwAgZ5W/KrkHf0Rn0fdnLDU9ScxBrEVNUprE/MzirjK4MJUX1/BVDv00Sv8cljtukVK1aky++X1SjQ==", - "dependencies": { - "regenerator-runtime": "^0.13.11" - }, + "version": "7.27.6", + "resolved": "https://registry.npmjs.org/@babel/runtime/-/runtime-7.27.6.tgz", + "integrity": "sha512-vbavdySgbTTrmFE+EsiqUTzlOr5bzlnJtUv9PynGCAKvfQqjIXbvFdumPM/GxMDfyuGMJaJAU6TO4zc1Jf1i8Q==", "engines": { "node": ">=6.9.0" } }, "node_modules/@babel/runtime-corejs3": { - "version": "7.20.7", - "resolved": "https://registry.npmjs.org/@babel/runtime-corejs3/-/runtime-corejs3-7.20.7.tgz", - "integrity": "sha512-jr9lCZ4RbRQmCR28Q8U8Fu49zvFqLxTY9AMOUz+iyMohMoAgpEcVxY+wJNay99oXOpOcCTODkk70NDN2aaJEeg==", + "version": "7.28.0", + "resolved": "https://registry.npmjs.org/@babel/runtime-corejs3/-/runtime-corejs3-7.28.0.tgz", + "integrity": "sha512-nlIXnSqLcBij8K8TtkxbBJgfzfvi75V1pAKSM7dUXejGw12vJAqez74jZrHTsJ3Z+Aczc5Q/6JgNjKRMsVU44g==", "dependencies": { - "core-js-pure": "^3.25.1", - "regenerator-runtime": "^0.13.11" + "core-js-pure": "^3.43.0" }, "engines": { "node": ">=6.9.0" } }, "node_modules/@babel/template": { - "version": "7.23.9", - "resolved": "https://registry.npmjs.org/@babel/template/-/template-7.23.9.tgz", - "integrity": "sha512-+xrD2BWLpvHKNmX2QbpdpsBaWnRxahMwJjO+KZk2JOElj5nSmKezyS1B4u+QbHMTX69t4ukm6hh9lsYQ7GHCKA==", + "version": "7.27.2", + "resolved": "https://registry.npmjs.org/@babel/template/-/template-7.27.2.tgz", + "integrity": "sha512-LPDZ85aEJyYSd18/DkjNh4/y1ntkE5KwUHWTiqgRxruuZL2F1yuHligVHLvcHY2vMHXttKFpJn6LwfI7cw7ODw==", "dependencies": { - "@babel/code-frame": "^7.23.5", - "@babel/parser": "^7.23.9", - "@babel/types": "^7.23.9" + "@babel/code-frame": "^7.27.1", + "@babel/parser": "^7.27.2", + "@babel/types": "^7.27.1" }, "engines": { "node": ">=6.9.0" @@ -1883,13 +1870,12 @@ } }, "node_modules/@babel/types": { - "version": "7.23.9", - "resolved": "https://registry.npmjs.org/@babel/types/-/types-7.23.9.tgz", - "integrity": "sha512-dQjSq/7HaSjRM43FFGnv5keM2HsxpmyV1PfaSVm0nzzjwwTmjOe6J4bC8e3+pTEIgHaHj+1ZlLThRJ2auc/w1Q==", + "version": "7.28.0", + "resolved": "https://registry.npmjs.org/@babel/types/-/types-7.28.0.tgz", + "integrity": "sha512-jYnje+JyZG5YThjHiF28oT4SIZLnYOcSBb6+SDaFIyzDVSkXQmQQYclJ2R+YxcdmK0AX6x1E5OQNtuh3jHDrUg==", "dependencies": { - "@babel/helper-string-parser": "^7.23.4", - "@babel/helper-validator-identifier": "^7.22.20", - "to-fast-properties": "^2.0.0" + "@babel/helper-string-parser": "^7.27.1", + "@babel/helper-validator-identifier": "^7.27.1" }, "engines": { "node": ">=6.9.0" @@ -2214,6 +2200,374 @@ "postcss-selector-parser": "^6.0.10" } }, + "node_modules/@esbuild/aix-ppc64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/aix-ppc64/-/aix-ppc64-0.19.12.tgz", + "integrity": "sha512-bmoCYyWdEL3wDQIVbcyzRyeKLgk2WtWLTWz1ZIAZF/EGbNOwSA6ew3PftJ1PqMiOOGu0OyFMzG53L0zqIpPeNA==", + "cpu": [ + "ppc64" + ], + "dev": true, + "optional": true, + "os": [ + "aix" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/android-arm": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/android-arm/-/android-arm-0.19.12.tgz", + "integrity": "sha512-qg/Lj1mu3CdQlDEEiWrlC4eaPZ1KztwGJ9B6J+/6G+/4ewxJg7gqj8eVYWvao1bXrqGiW2rsBZFSX3q2lcW05w==", + "cpu": [ + "arm" + ], + "dev": true, + "optional": true, + "os": [ + "android" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/android-arm64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/android-arm64/-/android-arm64-0.19.12.tgz", + "integrity": "sha512-P0UVNGIienjZv3f5zq0DP3Nt2IE/3plFzuaS96vihvD0Hd6H/q4WXUGpCxD/E8YrSXfNyRPbpTq+T8ZQioSuPA==", + "cpu": [ + "arm64" + ], + "dev": true, + "optional": true, + "os": [ + "android" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/android-x64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/android-x64/-/android-x64-0.19.12.tgz", + "integrity": "sha512-3k7ZoUW6Q6YqhdhIaq/WZ7HwBpnFBlW905Fa4s4qWJyiNOgT1dOqDiVAQFwBH7gBRZr17gLrlFCRzF6jFh7Kew==", + "cpu": [ + "x64" + ], + "dev": true, + "optional": true, + "os": [ + "android" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/darwin-arm64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/darwin-arm64/-/darwin-arm64-0.19.12.tgz", + "integrity": "sha512-B6IeSgZgtEzGC42jsI+YYu9Z3HKRxp8ZT3cqhvliEHovq8HSX2YX8lNocDn79gCKJXOSaEot9MVYky7AKjCs8g==", + "cpu": [ + "arm64" + ], + "dev": true, + "optional": true, + "os": [ + "darwin" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/darwin-x64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/darwin-x64/-/darwin-x64-0.19.12.tgz", + "integrity": "sha512-hKoVkKzFiToTgn+41qGhsUJXFlIjxI/jSYeZf3ugemDYZldIXIxhvwN6erJGlX4t5h417iFuheZ7l+YVn05N3A==", + "cpu": [ + "x64" + ], + "dev": true, + "optional": true, + "os": [ + "darwin" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/freebsd-arm64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/freebsd-arm64/-/freebsd-arm64-0.19.12.tgz", + "integrity": "sha512-4aRvFIXmwAcDBw9AueDQ2YnGmz5L6obe5kmPT8Vd+/+x/JMVKCgdcRwH6APrbpNXsPz+K653Qg8HB/oXvXVukA==", + "cpu": [ + "arm64" + ], + "dev": true, + "optional": true, + "os": [ + "freebsd" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/freebsd-x64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/freebsd-x64/-/freebsd-x64-0.19.12.tgz", + "integrity": "sha512-EYoXZ4d8xtBoVN7CEwWY2IN4ho76xjYXqSXMNccFSx2lgqOG/1TBPW0yPx1bJZk94qu3tX0fycJeeQsKovA8gg==", + "cpu": [ + "x64" + ], + "dev": true, + "optional": true, + "os": [ + "freebsd" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/linux-arm": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/linux-arm/-/linux-arm-0.19.12.tgz", + "integrity": "sha512-J5jPms//KhSNv+LO1S1TX1UWp1ucM6N6XuL6ITdKWElCu8wXP72l9MM0zDTzzeikVyqFE6U8YAV9/tFyj0ti+w==", + "cpu": [ + "arm" + ], + "dev": true, + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/linux-arm64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/linux-arm64/-/linux-arm64-0.19.12.tgz", + "integrity": "sha512-EoTjyYyLuVPfdPLsGVVVC8a0p1BFFvtpQDB/YLEhaXyf/5bczaGeN15QkR+O4S5LeJ92Tqotve7i1jn35qwvdA==", + "cpu": [ + "arm64" + ], + "dev": true, + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/linux-ia32": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/linux-ia32/-/linux-ia32-0.19.12.tgz", + "integrity": "sha512-Thsa42rrP1+UIGaWz47uydHSBOgTUnwBwNq59khgIwktK6x60Hivfbux9iNR0eHCHzOLjLMLfUMLCypBkZXMHA==", + "cpu": [ + "ia32" + ], + "dev": true, + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/linux-loong64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/linux-loong64/-/linux-loong64-0.19.12.tgz", + "integrity": "sha512-LiXdXA0s3IqRRjm6rV6XaWATScKAXjI4R4LoDlvO7+yQqFdlr1Bax62sRwkVvRIrwXxvtYEHHI4dm50jAXkuAA==", + "cpu": [ + "loong64" + ], + "dev": true, + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/linux-mips64el": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/linux-mips64el/-/linux-mips64el-0.19.12.tgz", + "integrity": "sha512-fEnAuj5VGTanfJ07ff0gOA6IPsvrVHLVb6Lyd1g2/ed67oU1eFzL0r9WL7ZzscD+/N6i3dWumGE1Un4f7Amf+w==", + "cpu": [ + "mips64el" + ], + "dev": true, + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/linux-ppc64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/linux-ppc64/-/linux-ppc64-0.19.12.tgz", + "integrity": "sha512-nYJA2/QPimDQOh1rKWedNOe3Gfc8PabU7HT3iXWtNUbRzXS9+vgB0Fjaqr//XNbd82mCxHzik2qotuI89cfixg==", + "cpu": [ + "ppc64" + ], + "dev": true, + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/linux-riscv64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/linux-riscv64/-/linux-riscv64-0.19.12.tgz", + "integrity": "sha512-2MueBrlPQCw5dVJJpQdUYgeqIzDQgw3QtiAHUC4RBz9FXPrskyyU3VI1hw7C0BSKB9OduwSJ79FTCqtGMWqJHg==", + "cpu": [ + "riscv64" + ], + "dev": true, + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/linux-s390x": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/linux-s390x/-/linux-s390x-0.19.12.tgz", + "integrity": "sha512-+Pil1Nv3Umes4m3AZKqA2anfhJiVmNCYkPchwFJNEJN5QxmTs1uzyy4TvmDrCRNT2ApwSari7ZIgrPeUx4UZDg==", + "cpu": [ + "s390x" + ], + "dev": true, + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/linux-x64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/linux-x64/-/linux-x64-0.19.12.tgz", + "integrity": "sha512-B71g1QpxfwBvNrfyJdVDexenDIt1CiDN1TIXLbhOw0KhJzE78KIFGX6OJ9MrtC0oOqMWf+0xop4qEU8JrJTwCg==", + "cpu": [ + "x64" + ], + "dev": true, + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/netbsd-x64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/netbsd-x64/-/netbsd-x64-0.19.12.tgz", + "integrity": "sha512-3ltjQ7n1owJgFbuC61Oj++XhtzmymoCihNFgT84UAmJnxJfm4sYCiSLTXZtE00VWYpPMYc+ZQmB6xbSdVh0JWA==", + "cpu": [ + "x64" + ], + "dev": true, + "optional": true, + "os": [ + "netbsd" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/openbsd-x64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/openbsd-x64/-/openbsd-x64-0.19.12.tgz", + "integrity": "sha512-RbrfTB9SWsr0kWmb9srfF+L933uMDdu9BIzdA7os2t0TXhCRjrQyCeOt6wVxr79CKD4c+p+YhCj31HBkYcXebw==", + "cpu": [ + "x64" + ], + "dev": true, + "optional": true, + "os": [ + "openbsd" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/sunos-x64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/sunos-x64/-/sunos-x64-0.19.12.tgz", + "integrity": "sha512-HKjJwRrW8uWtCQnQOz9qcU3mUZhTUQvi56Q8DPTLLB+DawoiQdjsYq+j+D3s9I8VFtDr+F9CjgXKKC4ss89IeA==", + "cpu": [ + "x64" + ], + "dev": true, + "optional": true, + "os": [ + "sunos" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/win32-arm64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/win32-arm64/-/win32-arm64-0.19.12.tgz", + "integrity": "sha512-URgtR1dJnmGvX864pn1B2YUYNzjmXkuJOIqG2HdU62MVS4EHpU2946OZoTMnRUHklGtJdJZ33QfzdjGACXhn1A==", + "cpu": [ + "arm64" + ], + "dev": true, + "optional": true, + "os": [ + "win32" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/win32-ia32": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/win32-ia32/-/win32-ia32-0.19.12.tgz", + "integrity": "sha512-+ZOE6pUkMOJfmxmBZElNOx72NKpIa/HFOMGzu8fqzQJ5kgf6aTGrcJaFsNiVMH4JKpMipyK+7k0n2UXN7a8YKQ==", + "cpu": [ + "ia32" + ], + "dev": true, + "optional": true, + "os": [ + "win32" + ], + "engines": { + "node": ">=12" + } + }, + "node_modules/@esbuild/win32-x64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/win32-x64/-/win32-x64-0.19.12.tgz", + "integrity": "sha512-T1QyPSDCyMXaO3pzBkF96E8xMkiRYbUEZADd29SyPGabqxMViNoii+NcK7eWJAEoU6RZyEm5lVSIjTmcdoB9HA==", + "cpu": [ + "x64" + ], + "dev": true, + "optional": true, + "os": [ + "win32" + ], + "engines": { + "node": ">=12" + } + }, "node_modules/@eslint/eslintrc": { "version": "1.4.1", "resolved": "https://registry.npmjs.org/@eslint/eslintrc/-/eslintrc-1.4.1.tgz", @@ -2729,14 +3083,98 @@ } }, "node_modules/@grpc/grpc-js": { - "version": "1.3.2", - "resolved": "https://registry.npmjs.org/@grpc/grpc-js/-/grpc-js-1.3.2.tgz", - "integrity": "sha512-UXepkOKCATJrhHGsxt+CGfpZy9zUn1q9mop5kfcXq1fBkTePxVNPOdnISlCbJFlCtld+pSLGyZCzr9/zVprFKA==", + "version": "1.12.0", + "resolved": "https://registry.npmjs.org/@grpc/grpc-js/-/grpc-js-1.12.0.tgz", + "integrity": "sha512-eWdP97A6xKtZXVP/ze9y8zYRB2t6ugQAuLXFuZXAsyqmyltaAjl4yPkmIfc0wuTFJMOUF1AdvIFQCL7fMtaX6g==", "dependencies": { - "@types/node": ">=12.12.47" + "@grpc/proto-loader": "^0.7.13", + "@js-sdsl/ordered-map": "^4.4.2" }, "engines": { - "node": "^8.13.0 || >=10.10.0" + "node": ">=12.10.0" + } + }, + "node_modules/@grpc/grpc-js/node_modules/@grpc/proto-loader": { + "version": "0.7.13", + "resolved": "https://registry.npmjs.org/@grpc/proto-loader/-/proto-loader-0.7.13.tgz", + "integrity": "sha512-AiXO/bfe9bmxBjxxtYxFAXGZvMaN5s8kO+jBHAJCON8rJoB5YS/D6X7ZNc6XQkuHNmyl4CYaMI1fJ/Gn27RGGw==", + "dependencies": { + "lodash.camelcase": "^4.3.0", + "long": "^5.0.0", + "protobufjs": "^7.2.5", + "yargs": "^17.7.2" + }, + "bin": { + "proto-loader-gen-types": "build/bin/proto-loader-gen-types.js" + }, + "engines": { + "node": ">=6" + } + }, + "node_modules/@grpc/grpc-js/node_modules/cliui": { + "version": "8.0.1", + "resolved": "https://registry.npmjs.org/cliui/-/cliui-8.0.1.tgz", + "integrity": "sha512-BSeNnyus75C4//NQ9gQt1/csTXyo/8Sb+afLAkzAptFuMsod9HFokGNudZpi/oQV73hnVK+sR+5PVRMd+Dr7YQ==", + "dependencies": { + "string-width": "^4.2.0", + "strip-ansi": "^6.0.1", + "wrap-ansi": "^7.0.0" + }, + "engines": { + "node": ">=12" + } + }, + "node_modules/@grpc/grpc-js/node_modules/long": { + "version": "5.2.3", + "resolved": "https://registry.npmjs.org/long/-/long-5.2.3.tgz", + "integrity": "sha512-lcHwpNoggQTObv5apGNCTdJrO69eHOZMi4BNC+rTLER8iHAqGrUVeLh/irVIM7zTw2bOXA8T6uNPeujwOLg/2Q==" + }, + "node_modules/@grpc/grpc-js/node_modules/protobufjs": { + "version": "7.4.0", + "resolved": "https://registry.npmjs.org/protobufjs/-/protobufjs-7.4.0.tgz", + "integrity": "sha512-mRUWCc3KUU4w1jU8sGxICXH/gNS94DvI1gxqDvBzhj1JpcsimQkYiOJfwsPUykUI5ZaspFbSgmBLER8IrQ3tqw==", + "hasInstallScript": true, + "dependencies": { + "@protobufjs/aspromise": "^1.1.2", + "@protobufjs/base64": "^1.1.2", + "@protobufjs/codegen": "^2.0.4", + "@protobufjs/eventemitter": "^1.1.0", + "@protobufjs/fetch": "^1.1.0", + "@protobufjs/float": "^1.0.2", + "@protobufjs/inquire": "^1.1.0", + "@protobufjs/path": "^1.1.2", + "@protobufjs/pool": "^1.1.0", + "@protobufjs/utf8": "^1.1.0", + "@types/node": ">=13.7.0", + "long": "^5.0.0" + }, + "engines": { + "node": ">=12.0.0" + } + }, + "node_modules/@grpc/grpc-js/node_modules/yargs": { + "version": "17.7.2", + "resolved": "https://registry.npmjs.org/yargs/-/yargs-17.7.2.tgz", + "integrity": "sha512-7dSzzRQ++CKnNI/krKnYRV7JKKPUXMEh61soaHKg9mrWEhzFWhFnxPxGl+69cD1Ou63C13NUPCnmIcrvqCuM6w==", + "dependencies": { + "cliui": "^8.0.1", + "escalade": "^3.1.1", + "get-caller-file": "^2.0.5", + "require-directory": "^2.1.1", + "string-width": "^4.2.3", + "y18n": "^5.0.5", + "yargs-parser": "^21.1.1" + }, + "engines": { + "node": ">=12" + } + }, + "node_modules/@grpc/grpc-js/node_modules/yargs-parser": { + "version": "21.1.1", + "resolved": "https://registry.npmjs.org/yargs-parser/-/yargs-parser-21.1.1.tgz", + "integrity": "sha512-tVpsJW7DdjecAiFpbIB1e3qxIQsE6NoPc5/eTdrbbIC4h0LVsWhnoa3g+m2HclBIujHzsxZ4VJVA+GUuc2/LBw==", + "engines": { + "node": ">=12" } }, "node_modules/@grpc/proto-loader": { @@ -3492,6 +3930,15 @@ "@jridgewell/sourcemap-codec": "1.4.14" } }, + "node_modules/@js-sdsl/ordered-map": { + "version": "4.4.2", + "resolved": "https://registry.npmjs.org/@js-sdsl/ordered-map/-/ordered-map-4.4.2.tgz", + "integrity": "sha512-iUKgm52T8HOE/makSxjqoWhe95ZJA1/G1sYsGev2JDKUSS14KAgg1LHb+Ba+IPow0xflbnSkOsZcO08C7w1gYw==", + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/js-sdsl" + } + }, "node_modules/@leichtgewicht/ip-codec": { "version": "2.0.4", "resolved": "https://registry.npmjs.org/@leichtgewicht/ip-codec/-/ip-codec-2.0.4.tgz", @@ -3681,6 +4128,32 @@ "resolved": "https://registry.npmjs.org/@protobufjs/utf8/-/utf8-1.1.0.tgz", "integrity": "sha1-p3c2C1s5oaLlEG+OhY8v0tBgxXA=" }, + "node_modules/@pyodide/webpack-plugin": { + "version": "1.3.2", + "resolved": "https://registry.npmjs.org/@pyodide/webpack-plugin/-/webpack-plugin-1.3.2.tgz", + "integrity": "sha512-Kz6GRcgBO/xounBCVD9aztxqcO+BVFPh8zp6rcQIH0xoKPjG8s38AJJdSC2Ai8yhFCaYPGAP3NcT7qMlO44+VQ==", + "dev": true, + "dependencies": { + "acorn-walk": "^8.2.0", + "copy-webpack-plugin": "^11.0.0", + "esbuild": "^0.19.5" + }, + "peerDependencies": { + "pyodide": ">=0.21.3" + } + }, + "node_modules/@pyodide/webpack-plugin/node_modules/acorn-walk": { + "version": "8.3.3", + "resolved": "https://registry.npmjs.org/acorn-walk/-/acorn-walk-8.3.3.tgz", + "integrity": "sha512-MxXdReSRhGO7VlFe1bRG/oI7/mdLV9B9JJT0N8vZOhF7gFRR5l3M8W9G8JxmKV+JC5mGqJ0QvqfSOLsCPa4nUw==", + "dev": true, + "dependencies": { + "acorn": "^8.11.0" + }, + "engines": { + "node": ">=0.4.0" + } + }, "node_modules/@rollup/plugin-babel": { "version": "5.3.1", "resolved": "https://registry.npmjs.org/@rollup/plugin-babel/-/plugin-babel-5.3.1.tgz", @@ -3760,43 +4233,100 @@ "resolved": "https://registry.npmjs.org/@rushstack/eslint-patch/-/eslint-patch-1.2.0.tgz", "integrity": "sha512-sXo/qW2/pAcmT43VoRKOJbDOfV3cYpq3szSVfIThQXNt+E4DfKj361vaAt3c88U5tPUxzEswam7GW48PJqtKAg==" }, + "node_modules/@sentry-internal/feedback": { + "version": "7.119.1", + "resolved": "https://registry.npmjs.org/@sentry-internal/feedback/-/feedback-7.119.1.tgz", + "integrity": "sha512-EPyW6EKZmhKpw/OQUPRkTynXecZdYl4uhZwdZuGqnGMAzswPOgQvFrkwsOuPYvoMfXqCH7YuRqyJrox3uBOrTA==", + "dependencies": { + "@sentry/core": "7.119.1", + "@sentry/types": "7.119.1", + "@sentry/utils": "7.119.1" + }, + "engines": { + "node": ">=12" + } + }, + "node_modules/@sentry-internal/replay-canvas": { + "version": "7.119.1", + "resolved": "https://registry.npmjs.org/@sentry-internal/replay-canvas/-/replay-canvas-7.119.1.tgz", + "integrity": "sha512-O/lrzENbMhP/UDr7LwmfOWTjD9PLNmdaCF408Wx8SDuj7Iwc+VasGfHg7fPH4Pdr4nJON6oh+UqoV4IoG05u+A==", + "dependencies": { + "@sentry/core": "7.119.1", + "@sentry/replay": "7.119.1", + "@sentry/types": "7.119.1", + "@sentry/utils": "7.119.1" + }, + "engines": { + "node": ">=12" + } + }, + "node_modules/@sentry-internal/tracing": { + "version": "7.119.1", + "resolved": "https://registry.npmjs.org/@sentry-internal/tracing/-/tracing-7.119.1.tgz", + "integrity": "sha512-cI0YraPd6qBwvUA3wQdPGTy8PzAoK0NZiaTN1LM3IczdPegehWOaEG5GVTnpGnTsmBAzn1xnBXNBhgiU4dgcrQ==", + "dependencies": { + "@sentry/core": "7.119.1", + "@sentry/types": "7.119.1", + "@sentry/utils": "7.119.1" + }, + "engines": { + "node": ">=8" + } + }, "node_modules/@sentry/browser": { - "version": "7.16.0", - "resolved": "https://registry.npmjs.org/@sentry/browser/-/browser-7.16.0.tgz", - "integrity": "sha512-tJ063zvoF8Raw7mzQEXupOFPSN6v36WIbsDVGeFdToPCwViaBuATaxvWCrudGzsnBkMyItmTLJkzn9SEIXUOiw==", + "version": "7.119.1", + "resolved": "https://registry.npmjs.org/@sentry/browser/-/browser-7.119.1.tgz", + "integrity": "sha512-aMwAnFU4iAPeLyZvqmOQaEDHt/Dkf8rpgYeJ0OEi50dmP6AjG+KIAMCXU7CYCCQDn70ITJo8QD5+KzCoZPYz0A==", "dependencies": { - "@sentry/core": "7.16.0", - "@sentry/types": "7.16.0", - "@sentry/utils": "7.16.0", - "tslib": "^1.9.3" + "@sentry-internal/feedback": "7.119.1", + "@sentry-internal/replay-canvas": "7.119.1", + "@sentry-internal/tracing": "7.119.1", + "@sentry/core": "7.119.1", + "@sentry/integrations": "7.119.1", + "@sentry/replay": "7.119.1", + "@sentry/types": "7.119.1", + "@sentry/utils": "7.119.1" }, "engines": { "node": ">=8" } }, "node_modules/@sentry/core": { - "version": "7.16.0", - "resolved": "https://registry.npmjs.org/@sentry/core/-/core-7.16.0.tgz", - "integrity": "sha512-vq6H1b/IPTvzDD9coQ3wIudvSjkAYuUlXb1dv69dRlq4v3st9dcKBps1Zf0lQ1i4TVlDLoe1iGMmNFglMF1Q5w==", + "version": "7.119.1", + "resolved": "https://registry.npmjs.org/@sentry/core/-/core-7.119.1.tgz", + "integrity": "sha512-YUNnH7O7paVd+UmpArWCPH4Phlb5LwrkWVqzFWqL3xPyCcTSof2RL8UmvpkTjgYJjJ+NDfq5mPFkqv3aOEn5Sw==", + "dependencies": { + "@sentry/types": "7.119.1", + "@sentry/utils": "7.119.1" + }, + "engines": { + "node": ">=8" + } + }, + "node_modules/@sentry/integrations": { + "version": "7.119.1", + "resolved": "https://registry.npmjs.org/@sentry/integrations/-/integrations-7.119.1.tgz", + "integrity": "sha512-CGmLEPnaBqbUleVqrmGYjRjf5/OwjUXo57I9t0KKWViq81mWnYhaUhRZWFNoCNQHns+3+GPCOMvl0zlawt+evw==", "dependencies": { - "@sentry/types": "7.16.0", - "@sentry/utils": "7.16.0", - "tslib": "^1.9.3" + "@sentry/core": "7.119.1", + "@sentry/types": "7.119.1", + "@sentry/utils": "7.119.1", + "localforage": "^1.8.1" }, "engines": { "node": ">=8" } }, "node_modules/@sentry/react": { - "version": "7.16.0", - "resolved": "https://registry.npmjs.org/@sentry/react/-/react-7.16.0.tgz", - "integrity": "sha512-tJH5zO4MPopzqZgi7Yd4iIB9Am5uGVefgkHaoeCGXffveEVWqEdjj8TqPL36SBb76gCmtpa01NBDsUSDZ1w/yw==", + "version": "7.119.1", + "resolved": "https://registry.npmjs.org/@sentry/react/-/react-7.119.1.tgz", + "integrity": "sha512-Bri314LnSVm16K3JATgn3Zsq6Uj3M/nIjdUb3nggBw0BMlFWMsyFjUCfmCio5d80KJK/lUjOIxRjzu79M6jOzQ==", "dependencies": { - "@sentry/browser": "7.16.0", - "@sentry/types": "7.16.0", - "@sentry/utils": "7.16.0", - "hoist-non-react-statics": "^3.3.2", - "tslib": "^1.9.3" + "@sentry/browser": "7.119.1", + "@sentry/core": "7.119.1", + "@sentry/types": "7.119.1", + "@sentry/utils": "7.119.1", + "hoist-non-react-statics": "^3.3.2" }, "engines": { "node": ">=8" @@ -3805,21 +4335,34 @@ "react": "15.x || 16.x || 17.x || 18.x" } }, + "node_modules/@sentry/replay": { + "version": "7.119.1", + "resolved": "https://registry.npmjs.org/@sentry/replay/-/replay-7.119.1.tgz", + "integrity": "sha512-4da+ruMEipuAZf35Ybt2StBdV1S+oJbSVccGpnl9w6RoeQoloT4ztR6ML3UcFDTXeTPT1FnHWDCyOfST0O7XMw==", + "dependencies": { + "@sentry-internal/tracing": "7.119.1", + "@sentry/core": "7.119.1", + "@sentry/types": "7.119.1", + "@sentry/utils": "7.119.1" + }, + "engines": { + "node": ">=12" + } + }, "node_modules/@sentry/types": { - "version": "7.16.0", - "resolved": "https://registry.npmjs.org/@sentry/types/-/types-7.16.0.tgz", - "integrity": "sha512-i6D+OK6d0l/k+VQvRp/Pt21WkDEgVBUIZq+sOkEZJczbcfexVdXKeXXoYTD2vYuFq8Yy28fzlsZaKI+NoH94yQ==", + "version": "7.119.1", + "resolved": "https://registry.npmjs.org/@sentry/types/-/types-7.119.1.tgz", + "integrity": "sha512-4G2mcZNnYzK3pa2PuTq+M2GcwBRY/yy1rF+HfZU+LAPZr98nzq2X3+mJHNJoobeHRkvVh7YZMPi4ogXiIS5VNQ==", "engines": { "node": ">=8" } }, "node_modules/@sentry/utils": { - "version": "7.16.0", - "resolved": "https://registry.npmjs.org/@sentry/utils/-/utils-7.16.0.tgz", - "integrity": "sha512-3Zh1txg7IRp4kZAdG27YF7K6lD1IZyuAo9KjoPg1Xzqa4DOZyASJuEkbf+rK2a9T4HrtVHHXJUsNbKg8WM3VHg==", + "version": "7.119.1", + "resolved": "https://registry.npmjs.org/@sentry/utils/-/utils-7.119.1.tgz", + "integrity": "sha512-ju/Cvyeu/vkfC5/XBV30UNet5kLEicZmXSyuLwZu95hEbL+foPdxN+re7pCI/eNqfe3B2vz7lvz5afLVOlQ2Hg==", "dependencies": { - "@sentry/types": "7.16.0", - "tslib": "^1.9.3" + "@sentry/types": "7.119.1" }, "engines": { "node": ">=8" @@ -4229,9 +4772,9 @@ "integrity": "sha512-oh/6byDPnL1zeNXFrDXFLyZjkr1MsBG667IM792caf1L2UPOOMf65NFzjUH/ltyfwjAGfs1rsX1eftK0jC/KIg==" }, "node_modules/@types/http-proxy": { - "version": "1.17.9", - "resolved": "https://registry.npmjs.org/@types/http-proxy/-/http-proxy-1.17.9.tgz", - "integrity": "sha512-QsbSjA/fSk7xB+UXlCT3wHBy5ai9wOcNDWwZAtud+jXhwOM3l+EYZh8Lng4+/6n8uar0J7xILzqftJdJ/Wdfkw==", + "version": "1.17.16", + "resolved": "https://registry.npmjs.org/@types/http-proxy/-/http-proxy-1.17.16.tgz", + "integrity": "sha512-sdWoUajOB1cd0A8cRRQ1cfyWNbmFKLAqBB89Y8x5iYyG/mkJHc0YUH8pdWBy2omi9qtCpiIgGjuwO0dQST2l5w==", "dependencies": { "@types/node": "*" } @@ -4762,9 +5305,9 @@ "integrity": "sha512-NBOQlm9+7RBqRqZwimpgquaLeTJFayqb9UEPtTkpC3TkkwDnlsT/TwsCC0svjt9kEZ6G9mH5AEOHSz6Q/HrzQQ==" }, "node_modules/acorn": { - "version": "8.8.1", - "resolved": "https://registry.npmjs.org/acorn/-/acorn-8.8.1.tgz", - "integrity": "sha512-7zFpHzhnqYKrkYdUjF1HI1bzd0VygEGX8lFk4k5zVMqHEoES+P+7TKI+EvLO9WVMJ8eekdO0aDEK044xTXwPPA==", + "version": "8.12.1", + "resolved": "https://registry.npmjs.org/acorn/-/acorn-8.12.1.tgz", + "integrity": "sha512-tcpGyI9zbizT9JbV6oYE477V6mTlXvvi0T0G3SNIYE2apm/G5huBa1+K89VGeovbg+jycCrfhl3ADxErOuO6Jg==", "bin": { "acorn": "bin/acorn" }, @@ -5191,22 +5734,24 @@ } }, "node_modules/axios": { - "version": "1.6.0", - "resolved": "https://registry.npmjs.org/axios/-/axios-1.6.0.tgz", - "integrity": "sha512-EZ1DYihju9pwVB+jg67ogm+Tmqc6JmhamRN6I4Zt8DfZu5lbcQGw3ozH9lFejSJgs/ibaef3A9PMXPLeefFGJg==", + "version": "1.12.0", + "resolved": "https://registry.npmjs.org/axios/-/axios-1.12.0.tgz", + "integrity": "sha512-oXTDccv8PcfjZmPGlWsPSwtOJCZ/b6W5jAMCNcfwJbCzDckwG0jrYJFaWH1yvivfCXjVzV/SPDEhMB3Q+DSurg==", "dependencies": { - "follow-redirects": "^1.15.0", - "form-data": "^4.0.0", + "follow-redirects": "^1.15.6", + "form-data": "^4.0.4", "proxy-from-env": "^1.1.0" } }, "node_modules/axios/node_modules/form-data": { - "version": "4.0.0", - "resolved": "https://registry.npmjs.org/form-data/-/form-data-4.0.0.tgz", - "integrity": "sha512-ETEklSGi5t0QMZuiXoA/Q6vcnxcLQP5vdugSpuAyi6SVGi2clPPp+xgEhuMaHC+zGgn31Kd235W35f7Hykkaww==", + "version": "4.0.4", + "resolved": "https://registry.npmjs.org/form-data/-/form-data-4.0.4.tgz", + "integrity": "sha512-KrGhL9Q4zjj0kiUt5OO4Mr/A/jlI2jDYs5eHBpYHPcBEVSiipAvn2Ko2HnPe20rmcuuvMHNdZFp+4IlGTMF0Ow==", "dependencies": { "asynckit": "^0.4.0", "combined-stream": "^1.0.8", + "es-set-tostringtag": "^2.1.0", + "hasown": "^2.0.2", "mime-types": "^2.1.12" }, "engines": { @@ -5503,11 +6048,6 @@ "resolved": "https://registry.npmjs.org/balanced-match/-/balanced-match-1.0.2.tgz", "integrity": "sha512-3oSeUO0TMV67hN1AmbXsK4yaqU7tjiHlbxRDZOpH0KW9+CeX4bRAaX0Anxt0tx2MrpRpWwQaPwIlISEJhYU5Pw==" }, - "node_modules/base-64": { - "version": "1.0.0", - "resolved": "https://registry.npmjs.org/base-64/-/base-64-1.0.0.tgz", - "integrity": "sha512-kwDPIFCGx0NZHog36dj+tHiwP4QMzsZ3AgMViUBKI0+V5n4U0ufTCUMhnQ04diaRI8EX/QcPfql7zlhZ7j4zgg==" - }, "node_modules/batch": { "version": "0.6.1", "resolved": "https://registry.npmjs.org/batch/-/batch-0.6.1.tgz", @@ -5549,9 +6089,9 @@ "integrity": "sha512-XpNj6GDQzdfW+r2Wnn7xiSAd7TM3jzkxGXBGTtWKuSXv1xUV+azxAm8jdWZN06QTQk+2N2XB9jRDkvbmQmcRtg==" }, "node_modules/body-parser": { - "version": "1.20.2", - "resolved": "https://registry.npmjs.org/body-parser/-/body-parser-1.20.2.tgz", - "integrity": "sha512-ml9pReCu3M61kGlqoTm2umSXTlRTuGTx0bfYj+uIUKKYycG5NtSbeetV3faSU6R7ajOPw0g/J1PvK4qNy7s5bA==", + "version": "1.20.3", + "resolved": "https://registry.npmjs.org/body-parser/-/body-parser-1.20.3.tgz", + "integrity": "sha512-7rAxByjUMqQ3/bHJy7D6OGXvx/MMc4IqBn/X0fcM1QUcAItpZrBEYhWGem+tzXH90c+G01ypMcYJBO9Y30203g==", "dependencies": { "bytes": "3.1.2", "content-type": "~1.0.5", @@ -5561,7 +6101,7 @@ "http-errors": "2.0.0", "iconv-lite": "0.4.24", "on-finished": "2.4.1", - "qs": "6.11.0", + "qs": "6.13.0", "raw-body": "2.5.2", "type-is": "~1.6.18", "unpipe": "1.0.0" @@ -5571,14 +6111,6 @@ "npm": "1.2.8000 || >= 1.4.16" } }, - "node_modules/body-parser/node_modules/bytes": { - "version": "3.1.2", - "resolved": "https://registry.npmjs.org/bytes/-/bytes-3.1.2.tgz", - "integrity": "sha512-/Nf7TyzTx6S3yRJObOAV7956r8cr2+Oj8AC5dt8wSP3BQAoeX58NoHyCU8P8zGkNXStjTSi6fzO6F0pBdcYbEg==", - "engines": { - "node": ">= 0.8" - } - }, "node_modules/body-parser/node_modules/debug": { "version": "2.6.9", "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz", @@ -5620,20 +6152,20 @@ "integrity": "sha512-JZOSA7Mo9sNGB8+UjSgzdLtokWAky1zbztM3WRLCbZ70/3cTANmQmOdR7y2g+J0e2WXywy1yS468tY+IruqEww==" }, "node_modules/brace-expansion": { - "version": "1.1.11", - "resolved": "https://registry.npmjs.org/brace-expansion/-/brace-expansion-1.1.11.tgz", - "integrity": "sha512-iCuPHDFgrHX7H2vEI/5xpz07zSHB00TpugqhmYtVmMO6518mCuRMoOYFldEBl0g187ufozdaHgWKcYFb61qGiA==", + "version": "1.1.12", + "resolved": "https://registry.npmjs.org/brace-expansion/-/brace-expansion-1.1.12.tgz", + "integrity": "sha512-9T9UjW3r0UW5c1Q7GTwllptXwhvYmEzFhzMfZ9H7FQWt+uZePjZPjBP/W1ZEyZ1twGWom5/56TF4lPcqjnDHcg==", "dependencies": { "balanced-match": "^1.0.0", "concat-map": "0.0.1" } }, "node_modules/braces": { - "version": "3.0.2", - "resolved": "https://registry.npmjs.org/braces/-/braces-3.0.2.tgz", - "integrity": "sha512-b8um+L1RzM3WDSzvhm6gIz1yfTbBt6YTlcEKAvsmqCZZFw46z626lVj9j1yEPW33H5H+lBQpZMP1k8l+78Ha0A==", + "version": "3.0.3", + "resolved": "https://registry.npmjs.org/braces/-/braces-3.0.3.tgz", + "integrity": "sha512-yQbXgO/OSZVD2IsiLlro+7Hf6Q18EJrKSEsdoMzKePKXct3gvD8oLcOQdIzGupr5Fj+EDe8gO/lxc1BzfMpxvA==", "dependencies": { - "fill-range": "^7.0.1" + "fill-range": "^7.1.1" }, "engines": { "node": ">=8" @@ -5696,25 +6228,43 @@ } }, "node_modules/bytes": { - "version": "3.0.0", - "resolved": "https://registry.npmjs.org/bytes/-/bytes-3.0.0.tgz", - "integrity": "sha512-pMhOfFDPiv9t5jjIXkHosWmkSyQbvsgEVNkz0ERHbuLh2T/7j4Mqqpz523Fe8MVY89KC6Sh/QfS2sM+SjgFDcw==", + "version": "3.1.2", + "resolved": "https://registry.npmjs.org/bytes/-/bytes-3.1.2.tgz", + "integrity": "sha512-/Nf7TyzTx6S3yRJObOAV7956r8cr2+Oj8AC5dt8wSP3BQAoeX58NoHyCU8P8zGkNXStjTSi6fzO6F0pBdcYbEg==", "engines": { "node": ">= 0.8" } }, "node_modules/call-bind": { - "version": "1.0.2", - "resolved": "https://registry.npmjs.org/call-bind/-/call-bind-1.0.2.tgz", - "integrity": "sha512-7O+FbCihrB5WGbFYesctwmTKae6rOiIzmz1icreWJ+0aA7LJfuqhEso2T9ncpcFtzMQtzXf2QGGueWJGTYsqrA==", + "version": "1.0.7", + "resolved": "https://registry.npmjs.org/call-bind/-/call-bind-1.0.7.tgz", + "integrity": "sha512-GHTSNSYICQ7scH7sZ+M2rFopRoLh8t2bLSW6BbgrtLsahOIB5iyAVJf9GjWK3cYTDaMj4XdBpM1cA6pIS0Kv2w==", "dependencies": { - "function-bind": "^1.1.1", - "get-intrinsic": "^1.0.2" + "es-define-property": "^1.0.0", + "es-errors": "^1.3.0", + "function-bind": "^1.1.2", + "get-intrinsic": "^1.2.4", + "set-function-length": "^1.2.1" + }, + "engines": { + "node": ">= 0.4" }, "funding": { "url": "https://github.com/sponsors/ljharb" } }, + "node_modules/call-bind-apply-helpers": { + "version": "1.0.2", + "resolved": "https://registry.npmjs.org/call-bind-apply-helpers/-/call-bind-apply-helpers-1.0.2.tgz", + "integrity": "sha512-Sp1ablJ0ivDkSzjcaJdxEunN5/XvksFJ2sMBFfq6x0ryhQV/2b/KwFe21cMpmHtPOSij8K99/wSfoEuTObmuMQ==", + "dependencies": { + "es-errors": "^1.3.0", + "function-bind": "^1.1.2" + }, + "engines": { + "node": ">= 0.4" + } + }, "node_modules/callsites": { "version": "3.1.0", "resolved": "https://registry.npmjs.org/callsites/-/callsites-3.1.0.tgz", @@ -6031,16 +6581,16 @@ } }, "node_modules/compression": { - "version": "1.7.4", - "resolved": "https://registry.npmjs.org/compression/-/compression-1.7.4.tgz", - "integrity": "sha512-jaSIDzP9pZVS4ZfQ+TzvtiWhdpFhE2RDHz8QJkpX9SIpLq88VueF5jJw6t+6CUQcAoA6t+x89MLrWAqpfDE8iQ==", + "version": "1.8.1", + "resolved": "https://registry.npmjs.org/compression/-/compression-1.8.1.tgz", + "integrity": "sha512-9mAqGPHLakhCLeNyxPkK4xVo746zQ/czLH1Ky+vkitMnWfWZps8r0qXuwhwizagCRttsL4lfG4pIOvaWLpAP0w==", "dependencies": { - "accepts": "~1.3.5", - "bytes": "3.0.0", - "compressible": "~2.0.16", + "bytes": "3.1.2", + "compressible": "~2.0.18", "debug": "2.6.9", - "on-headers": "~1.0.2", - "safe-buffer": "5.1.2", + "negotiator": "~0.6.4", + "on-headers": "~1.1.0", + "safe-buffer": "5.2.1", "vary": "~1.1.2" }, "engines": { @@ -6060,6 +6610,33 @@ "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz", "integrity": "sha512-Tpp60P6IUJDTuOq/5Z8cdskzJujfwqfOTkrwIwj7IRISpnkJnT6SyJ4PCPnGMoFjC9ddhal5KVIYtAt97ix05A==" }, + "node_modules/compression/node_modules/negotiator": { + "version": "0.6.4", + "resolved": "https://registry.npmjs.org/negotiator/-/negotiator-0.6.4.tgz", + "integrity": "sha512-myRT3DiWPHqho5PrJaIRyaMv2kgYf0mUVgBNOYMuCH5Ki1yEiQaf/ZJuQ62nvpc44wL5WDbTX7yGJi1Neevw8w==", + "engines": { + "node": ">= 0.6" + } + }, + "node_modules/compression/node_modules/safe-buffer": { + "version": "5.2.1", + "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.2.1.tgz", + "integrity": "sha512-rp3So07KcdmmKbGvgaNxQSJr7bGVSVk5S9Eq1F+ppbRo70+YeaDxkw5Dd8NPN+GD6bjnYm2VuPuCXmpuYvmCXQ==", + "funding": [ + { + "type": "github", + "url": "https://github.com/sponsors/feross" + }, + { + "type": "patreon", + "url": "https://www.patreon.com/feross" + }, + { + "type": "consulting", + "url": "https://feross.org/support" + } + ] + }, "node_modules/comsync": { "version": "0.0.8", "resolved": "https://registry.npmjs.org/comsync/-/comsync-0.0.8.tgz", @@ -6131,9 +6708,9 @@ "integrity": "sha512-ASFBup0Mz1uyiIjANan1jzLQami9z1PoYSZCiiYW2FczPbenXc45FZdBZLzOT+r6+iciuEModtmCti+hjaAk0A==" }, "node_modules/cookie": { - "version": "0.6.0", - "resolved": "https://registry.npmjs.org/cookie/-/cookie-0.6.0.tgz", - "integrity": "sha512-U71cyTamuh1CRNCfpGY6to28lxvNwPG4Guz/EVjgf3Jmzv0vlDp1atT9eS5dDjMYHucpHbWns6Lwf3BKz6svdw==", + "version": "0.7.1", + "resolved": "https://registry.npmjs.org/cookie/-/cookie-0.7.1.tgz", + "integrity": "sha512-6DnInpx7SJ2AK3+CTUE/ZM0vWTUboZCegxhC2xiIydHR9jNuTAASBrfEpHhiGOZw/nX51bHt6YQl8jsGo4y/0w==", "engines": { "node": ">= 0.6" } @@ -6143,6 +6720,114 @@ "resolved": "https://registry.npmjs.org/cookie-signature/-/cookie-signature-1.0.6.tgz", "integrity": "sha512-QADzlaHc8icV8I7vbaJXJwod9HWYp8uCqf1xa4OfNu1T7JVxQIrUgOWtHdNDtPiywmFbiS12VjotIXLrKM3orQ==" }, + "node_modules/copy-webpack-plugin": { + "version": "11.0.0", + "resolved": "https://registry.npmjs.org/copy-webpack-plugin/-/copy-webpack-plugin-11.0.0.tgz", + "integrity": "sha512-fX2MWpamkW0hZxMEg0+mYnA40LTosOSa5TqZ9GYIBzyJa9C3QUaMPSE2xAi/buNr8u89SfD9wHSQVBzrRa/SOQ==", + "dev": true, + "dependencies": { + "fast-glob": "^3.2.11", + "glob-parent": "^6.0.1", + "globby": "^13.1.1", + "normalize-path": "^3.0.0", + "schema-utils": "^4.0.0", + "serialize-javascript": "^6.0.0" + }, + "engines": { + "node": ">= 14.15.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/webpack" + }, + "peerDependencies": { + "webpack": "^5.1.0" + } + }, + "node_modules/copy-webpack-plugin/node_modules/ajv": { + "version": "8.17.1", + "resolved": "https://registry.npmjs.org/ajv/-/ajv-8.17.1.tgz", + "integrity": "sha512-B/gBuNg5SiMTrPkC+A2+cW0RszwxYmn6VYxB/inlBStS5nx6xHIt/ehKRhIMhqusl7a8LjQoZnjCs5vhwxOQ1g==", + "dev": true, + "dependencies": { + "fast-deep-equal": "^3.1.3", + "fast-uri": "^3.0.1", + "json-schema-traverse": "^1.0.0", + "require-from-string": "^2.0.2" + }, + "funding": { + "type": "github", + "url": "https://github.com/sponsors/epoberezkin" + } + }, + "node_modules/copy-webpack-plugin/node_modules/ajv-keywords": { + "version": "5.1.0", + "resolved": "https://registry.npmjs.org/ajv-keywords/-/ajv-keywords-5.1.0.tgz", + "integrity": "sha512-YCS/JNFAUyr5vAuhk1DWm1CBxRHW9LbJ2ozWeemrIqpbsqKjHVxYPyi5GC0rjZIT5JxJ3virVTS8wk4i/Z+krw==", + "dev": true, + "dependencies": { + "fast-deep-equal": "^3.1.3" + }, + "peerDependencies": { + "ajv": "^8.8.2" + } + }, + "node_modules/copy-webpack-plugin/node_modules/globby": { + "version": "13.2.2", + "resolved": "https://registry.npmjs.org/globby/-/globby-13.2.2.tgz", + "integrity": "sha512-Y1zNGV+pzQdh7H39l9zgB4PJqjRNqydvdYCDG4HFXM4XuvSaQQlEc91IU1yALL8gUTDomgBAfz3XJdmUS+oo0w==", + "dev": true, + "dependencies": { + "dir-glob": "^3.0.1", + "fast-glob": "^3.3.0", + "ignore": "^5.2.4", + "merge2": "^1.4.1", + "slash": "^4.0.0" + }, + "engines": { + "node": "^12.20.0 || ^14.13.1 || >=16.0.0" + }, + "funding": { + "url": "https://github.com/sponsors/sindresorhus" + } + }, + "node_modules/copy-webpack-plugin/node_modules/json-schema-traverse": { + "version": "1.0.0", + "resolved": "https://registry.npmjs.org/json-schema-traverse/-/json-schema-traverse-1.0.0.tgz", + "integrity": "sha512-NM8/P9n3XjXhIZn1lLhkFaACTOURQXjWhV4BA/RnOv8xvgqtqpAX9IO4mRQxSx1Rlo4tqzeqb0sOlruaOy3dug==", + "dev": true + }, + "node_modules/copy-webpack-plugin/node_modules/schema-utils": { + "version": "4.2.0", + "resolved": "https://registry.npmjs.org/schema-utils/-/schema-utils-4.2.0.tgz", + "integrity": "sha512-L0jRsrPpjdckP3oPug3/VxNKt2trR8TcabrM6FOAAlvC/9Phcmm+cuAgTlxBqdBR1WJx7Naj9WHw+aOmheSVbw==", + "dev": true, + "dependencies": { + "@types/json-schema": "^7.0.9", + "ajv": "^8.9.0", + "ajv-formats": "^2.1.1", + "ajv-keywords": "^5.1.0" + }, + "engines": { + "node": ">= 12.13.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/webpack" + } + }, + "node_modules/copy-webpack-plugin/node_modules/slash": { + "version": "4.0.0", + "resolved": "https://registry.npmjs.org/slash/-/slash-4.0.0.tgz", + "integrity": "sha512-3dOsAHXXUkQTpOYcoAxLIorMTp4gIQr5IW3iVb7A7lFIp0VHhnynm9izx6TssdrIcVIESAlVjtnO2K8bg+Coew==", + "dev": true, + "engines": { + "node": ">=12" + }, + "funding": { + "url": "https://github.com/sponsors/sindresorhus" + } + }, "node_modules/core-js": { "version": "3.27.1", "resolved": "https://registry.npmjs.org/core-js/-/core-js-3.27.1.tgz", @@ -6166,9 +6851,9 @@ } }, "node_modules/core-js-pure": { - "version": "3.27.1", - "resolved": "https://registry.npmjs.org/core-js-pure/-/core-js-pure-3.27.1.tgz", - "integrity": "sha512-BS2NHgwwUppfeoqOXqi08mUqS5FiZpuRuJJpKsaME7kJz0xxuk0xkhDdfMIlP/zLa80krBqss1LtD7f889heAw==", + "version": "3.43.0", + "resolved": "https://registry.npmjs.org/core-js-pure/-/core-js-pure-3.43.0.tgz", + "integrity": "sha512-i/AgxU2+A+BbJdMxh3v7/vxi2SbFqxiFmg6VsDwYB4jkucrd1BZNA9a9gphC0fYMG5IBSgQcbQnk865VCLe7xA==", "hasInstallScript": true, "funding": { "type": "opencollective", @@ -6219,9 +6904,9 @@ "integrity": "sha512-dcKFX3jn0MpIaXjisoRvexIJVEKzaq7z2rZKxf+MSr9TkdmHmsU4m2lcLojrj/FHl8mk5VxMmYA+ftRkP/3oKQ==" }, "node_modules/cross-spawn": { - "version": "7.0.3", - "resolved": "https://registry.npmjs.org/cross-spawn/-/cross-spawn-7.0.3.tgz", - "integrity": "sha512-iRDPJKUPVEND7dHPO8rkbOnPpyDygcDFtWjpeWNCgy8WP2rXcxXL8TskReQl6OrB2G7+UJrags1q15Fudc7G6w==", + "version": "7.0.6", + "resolved": "https://registry.npmjs.org/cross-spawn/-/cross-spawn-7.0.6.tgz", + "integrity": "sha512-uV2QOWP2nWzsy2aMp8aRibhi9dlzF5Hgh5SHaB9OiTGEyDTiJJyx0uy51QXdyWbtAHNua4XJzUKca3OzKUd3vA==", "dependencies": { "path-key": "^3.1.0", "shebang-command": "^2.0.0", @@ -6621,11 +7306,11 @@ } }, "node_modules/debug": { - "version": "4.3.4", - "resolved": "https://registry.npmjs.org/debug/-/debug-4.3.4.tgz", - "integrity": "sha512-PRWFHuSU3eDtQJPvnNY7Jcket1j0t5OuOsFzPPzsekD52Zl8qUfFIPEiswXqIvHWGVHOgX+7G/vCNNhehwxfkQ==", + "version": "4.4.1", + "resolved": "https://registry.npmjs.org/debug/-/debug-4.4.1.tgz", + "integrity": "sha512-KcKCqiftBJcZr++7ykoDIEwSa3XWowTfNPo92BYxjXiyYEVrUQh2aLyhxBCwww+heortUFxEJYcRzosstTEBYQ==", "dependencies": { - "ms": "2.1.2" + "ms": "^2.1.3" }, "engines": { "node": ">=6.0" @@ -6683,6 +7368,22 @@ "clone": "^1.0.2" } }, + "node_modules/define-data-property": { + "version": "1.1.4", + "resolved": "https://registry.npmjs.org/define-data-property/-/define-data-property-1.1.4.tgz", + "integrity": "sha512-rBMvIzlpA8v6E+SJZoo++HAYqsLrkg7MSfIinMPFhmkorw7X+dOXVJQs+QT69zGkzMyfDnIMN2Wid1+NbL3T+A==", + "dependencies": { + "es-define-property": "^1.0.0", + "es-errors": "^1.3.0", + "gopd": "^1.0.1" + }, + "engines": { + "node": ">= 0.4" + }, + "funding": { + "url": "https://github.com/sponsors/ljharb" + } + }, "node_modules/define-lazy-prop": { "version": "2.0.0", "resolved": "https://registry.npmjs.org/define-lazy-prop/-/define-lazy-prop-2.0.0.tgz", @@ -6989,6 +7690,19 @@ "resolved": "https://registry.npmjs.org/dotenv-expand/-/dotenv-expand-5.1.0.tgz", "integrity": "sha512-YXQl1DSa4/PQyRfgrv6aoNjhasp/p4qs9FjJ4q4cQk+8m4r6k4ZSiEyytKG8f8W9gi8WsQtIObNmKd+tMzNTmA==" }, + "node_modules/dunder-proto": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/dunder-proto/-/dunder-proto-1.0.1.tgz", + "integrity": "sha512-KIN/nDJBQRcXw0MLVhZE9iQHmG68qAVIBg9CqmUYjmQIhgij9U5MFvrqkUL5FbtyyzZuOeOt0zdeRe4UY7ct+A==", + "dependencies": { + "call-bind-apply-helpers": "^1.0.1", + "es-errors": "^1.3.0", + "gopd": "^1.2.0" + }, + "engines": { + "node": ">= 0.4" + } + }, "node_modules/duplexer": { "version": "0.1.2", "resolved": "https://registry.npmjs.org/duplexer/-/duplexer-0.1.2.tgz", @@ -7043,9 +7757,9 @@ } }, "node_modules/encodeurl": { - "version": "1.0.2", - "resolved": "https://registry.npmjs.org/encodeurl/-/encodeurl-1.0.2.tgz", - "integrity": "sha512-TPJXq8JqFaVYm2CWmPvnP2Iyo4ZSM7/QKcSmuMLDObfpH5fi7RUGmd/rTDf+rut/saiDiQEeVTNgAmJEdAOx0w==", + "version": "2.0.0", + "resolved": "https://registry.npmjs.org/encodeurl/-/encodeurl-2.0.0.tgz", + "integrity": "sha512-Q0n9HRi4m6JuGIV1eFlmvJB7ZEVxu93IrMyiMsGC0lrMJMWzRgx6WGquyfQgZVb31vhGgXnfmPNNXmxnOkRBrg==", "engines": { "node": ">= 0.8" } @@ -7136,19 +7850,47 @@ "resolved": "https://registry.npmjs.org/es-array-method-boxes-properly/-/es-array-method-boxes-properly-1.0.0.tgz", "integrity": "sha512-wd6JXUmyHmt8T5a2xreUwKcGPq6f1f+WwIJkijUqiGcJz1qqnZgP6XIK+QyIWU5lT7imeNxUll48bziG+TSYcA==" }, + "node_modules/es-define-property": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/es-define-property/-/es-define-property-1.0.1.tgz", + "integrity": "sha512-e3nRfgfUZ4rNGL232gUgX06QNyyez04KdjFrF+LTRoOXmrOgFKDg4BCdsjW8EnT69eqdYGmRpJwiPVYNrCaW3g==", + "engines": { + "node": ">= 0.4" + } + }, + "node_modules/es-errors": { + "version": "1.3.0", + "resolved": "https://registry.npmjs.org/es-errors/-/es-errors-1.3.0.tgz", + "integrity": "sha512-Zf5H2Kxt2xjTvbJvP2ZWLEICxA6j+hAmMzIlypy4xcBg1vKVnx89Wy0GbS+kf5cwCVFFzdCFh2XSCFNULS6csw==", + "engines": { + "node": ">= 0.4" + } + }, "node_modules/es-module-lexer": { "version": "0.9.3", "resolved": "https://registry.npmjs.org/es-module-lexer/-/es-module-lexer-0.9.3.tgz", "integrity": "sha512-1HQ2M2sPtxwnvOvT1ZClHyQDiggdNjURWpY2we6aMKCQiUVxTmVs2UYPLIrD84sS+kMdUwfBSylbJPwNnBrnHQ==" }, + "node_modules/es-object-atoms": { + "version": "1.1.1", + "resolved": "https://registry.npmjs.org/es-object-atoms/-/es-object-atoms-1.1.1.tgz", + "integrity": "sha512-FGgH2h8zKNim9ljj7dankFPcICIK9Cp5bm+c2gQSYePhpaG5+esrLODihIorn+Pe6FGJzWhXQotPv73jTaldXA==", + "dependencies": { + "es-errors": "^1.3.0" + }, + "engines": { + "node": ">= 0.4" + } + }, "node_modules/es-set-tostringtag": { - "version": "2.0.1", - "resolved": "https://registry.npmjs.org/es-set-tostringtag/-/es-set-tostringtag-2.0.1.tgz", - "integrity": "sha512-g3OMbtlwY3QewlqAiMLI47KywjWZoEytKr8pf6iTC8uJq5bIAH52Z9pnQ8pVL6whrCto53JZDuUIsifGeLorTg==", + "version": "2.1.0", + "resolved": "https://registry.npmjs.org/es-set-tostringtag/-/es-set-tostringtag-2.1.0.tgz", + "integrity": "sha512-j6vWzfrGVfyXxge+O0x5sh6cvxAog0a/4Rdd2K36zCMV5eJ+/+tOAngRO8cODMNWbVRdVlmGZQL2YS3yR8bIUA==", "dependencies": { - "get-intrinsic": "^1.1.3", - "has": "^1.0.3", - "has-tostringtag": "^1.0.0" + "es-errors": "^1.3.0", + "get-intrinsic": "^1.2.6", + "has-tostringtag": "^1.0.2", + "hasown": "^2.0.2" }, "engines": { "node": ">= 0.4" @@ -7178,6 +7920,44 @@ "url": "https://github.com/sponsors/ljharb" } }, + "node_modules/esbuild": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/esbuild/-/esbuild-0.19.12.tgz", + "integrity": "sha512-aARqgq8roFBj054KvQr5f1sFu0D65G+miZRCuJyJ0G13Zwx7vRar5Zhn2tkQNzIXcBrNVsv/8stehpj+GAjgbg==", + "dev": true, + "hasInstallScript": true, + "bin": { + "esbuild": "bin/esbuild" + }, + "engines": { + "node": ">=12" + }, + "optionalDependencies": { + "@esbuild/aix-ppc64": "0.19.12", + "@esbuild/android-arm": "0.19.12", + "@esbuild/android-arm64": "0.19.12", + "@esbuild/android-x64": "0.19.12", + "@esbuild/darwin-arm64": "0.19.12", + "@esbuild/darwin-x64": "0.19.12", + "@esbuild/freebsd-arm64": "0.19.12", + "@esbuild/freebsd-x64": "0.19.12", + "@esbuild/linux-arm": "0.19.12", + "@esbuild/linux-arm64": "0.19.12", + "@esbuild/linux-ia32": "0.19.12", + "@esbuild/linux-loong64": "0.19.12", + "@esbuild/linux-mips64el": "0.19.12", + "@esbuild/linux-ppc64": "0.19.12", + "@esbuild/linux-riscv64": "0.19.12", + "@esbuild/linux-s390x": "0.19.12", + "@esbuild/linux-x64": "0.19.12", + "@esbuild/netbsd-x64": "0.19.12", + "@esbuild/openbsd-x64": "0.19.12", + "@esbuild/sunos-x64": "0.19.12", + "@esbuild/win32-arm64": "0.19.12", + "@esbuild/win32-ia32": "0.19.12", + "@esbuild/win32-x64": "0.19.12" + } + }, "node_modules/escalade": { "version": "3.1.1", "resolved": "https://registry.npmjs.org/escalade/-/escalade-3.1.1.tgz", @@ -8008,36 +8788,36 @@ } }, "node_modules/express": { - "version": "4.19.2", - "resolved": "https://registry.npmjs.org/express/-/express-4.19.2.tgz", - "integrity": "sha512-5T6nhjsT+EOMzuck8JjBHARTHfMht0POzlA60WV2pMD3gyXw2LZnZ+ueGdNxG+0calOJcWKbpFcuzLZ91YWq9Q==", + "version": "4.21.2", + "resolved": "https://registry.npmjs.org/express/-/express-4.21.2.tgz", + "integrity": "sha512-28HqgMZAmih1Czt9ny7qr6ek2qddF4FclbMzwhCREB6OFfH+rXAnuNCwo1/wFvrtbgsQDb4kSbX9de9lFbrXnA==", "dependencies": { "accepts": "~1.3.8", "array-flatten": "1.1.1", - "body-parser": "1.20.2", + "body-parser": "1.20.3", "content-disposition": "0.5.4", "content-type": "~1.0.4", - "cookie": "0.6.0", + "cookie": "0.7.1", "cookie-signature": "1.0.6", "debug": "2.6.9", "depd": "2.0.0", - "encodeurl": "~1.0.2", + "encodeurl": "~2.0.0", "escape-html": "~1.0.3", "etag": "~1.8.1", - "finalhandler": "1.2.0", + "finalhandler": "1.3.1", "fresh": "0.5.2", "http-errors": "2.0.0", - "merge-descriptors": "1.0.1", + "merge-descriptors": "1.0.3", "methods": "~1.1.2", "on-finished": "2.4.1", "parseurl": "~1.3.3", - "path-to-regexp": "0.1.7", + "path-to-regexp": "0.1.12", "proxy-addr": "~2.0.7", - "qs": "6.11.0", + "qs": "6.13.0", "range-parser": "~1.2.1", "safe-buffer": "5.2.1", - "send": "0.18.0", - "serve-static": "1.15.0", + "send": "0.19.0", + "serve-static": "1.16.2", "setprototypeof": "1.2.0", "statuses": "2.0.1", "type-is": "~1.6.18", @@ -8046,6 +8826,10 @@ }, "engines": { "node": ">= 0.10.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/express" } }, "node_modules/express/node_modules/array-flatten": { @@ -8091,9 +8875,9 @@ "integrity": "sha512-f3qQ9oQy9j2AhBe/H9VC91wLmKBCCU/gDOnKNAYG5hswO7BLKj09Hc5HYNz9cGI++xlpDCIgDaitVs03ATR84Q==" }, "node_modules/fast-glob": { - "version": "3.2.12", - "resolved": "https://registry.npmjs.org/fast-glob/-/fast-glob-3.2.12.tgz", - "integrity": "sha512-DVj4CQIYYow0BlaelwK1pHl5n5cRSJfM60UA0zK891sVInoPri2Ekj7+e1CT3/3qxXenpI+nBBmQAcJPJgaj4w==", + "version": "3.3.2", + "resolved": "https://registry.npmjs.org/fast-glob/-/fast-glob-3.3.2.tgz", + "integrity": "sha512-oX2ruAFQwf/Orj8m737Y5adxDQO0LAB7/S5MnxCdTNDd4p6BsyIVsv9JQsATbTSq8KHRpLwIHbVlUNatxd+1Ow==", "dependencies": { "@nodelib/fs.stat": "^2.0.2", "@nodelib/fs.walk": "^1.2.3", @@ -8126,6 +8910,12 @@ "resolved": "https://registry.npmjs.org/fast-levenshtein/-/fast-levenshtein-2.0.6.tgz", "integrity": "sha512-DCXu6Ifhqcks7TZKY3Hxp3y6qphY5SJZmrWMDrKcERSOXWQdMhU9Ig/PYrzyw/ul9jOIyh0N4M0tbC5hodg8dw==" }, + "node_modules/fast-uri": { + "version": "3.0.1", + "resolved": "https://registry.npmjs.org/fast-uri/-/fast-uri-3.0.1.tgz", + "integrity": "sha512-MWipKbbYiYI0UC7cl8m/i/IWTqfC8YXsqjzybjddLsFjStroQzsHXkc73JutMvBiXmOvapk+axIl79ig5t55Bw==", + "dev": true + }, "node_modules/fastq": { "version": "1.15.0", "resolved": "https://registry.npmjs.org/fastq/-/fastq-1.15.0.tgz", @@ -8192,9 +8982,9 @@ } }, "node_modules/filelist/node_modules/brace-expansion": { - "version": "2.0.1", - "resolved": "https://registry.npmjs.org/brace-expansion/-/brace-expansion-2.0.1.tgz", - "integrity": "sha512-XnAIvQ8eM+kC6aULx6wuQiwVsnzsi9d3WxzV3FpWTGA19F621kwdbsAcFKXgKUHZWsy+mY6iL1sHTxWEFCytDA==", + "version": "2.0.2", + "resolved": "https://registry.npmjs.org/brace-expansion/-/brace-expansion-2.0.2.tgz", + "integrity": "sha512-Jt0vHyM+jmUBqojB7E1NIYadt0vI0Qxjxd2TErW94wDz+E2LAm5vKMXXwg6ZZBTHPuUlDgQHKXvjGBdfcF1ZDQ==", "dependencies": { "balanced-match": "^1.0.0" } @@ -8219,9 +9009,9 @@ } }, "node_modules/fill-range": { - "version": "7.0.1", - "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-7.0.1.tgz", - "integrity": "sha512-qOo9F+dMUmC2Lcb4BbVvnKJxTPjCm+RRpe4gDuGrzkL7mEVl/djYSu2OdQ2Pa302N4oqkSg9ir6jaLWJ2USVpQ==", + "version": "7.1.1", + "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-7.1.1.tgz", + "integrity": "sha512-YsGpe3WHLK8ZYi4tWDg2Jy3ebRz2rXowDxnld4bkQB00cc/1Zw9AWnC0i9ztDJitivtQvaI9KaLyKrc+hBW0yg==", "dependencies": { "to-regex-range": "^5.0.1" }, @@ -8230,12 +9020,12 @@ } }, "node_modules/finalhandler": { - "version": "1.2.0", - "resolved": "https://registry.npmjs.org/finalhandler/-/finalhandler-1.2.0.tgz", - "integrity": "sha512-5uXcUVftlQMFnWC9qu/svkWv3GTd2PfUhK/3PLkYNAe7FbqJMt3515HaxE6eRL74GdsriiwujiawdaB1BpEISg==", + "version": "1.3.1", + "resolved": "https://registry.npmjs.org/finalhandler/-/finalhandler-1.3.1.tgz", + "integrity": "sha512-6BN9trH7bp3qvnrRyzsBz+g3lZxTNZTbVO2EV1CS0WIcDbawYVdYvGflME/9QP0h0pYlCDBCTjYa9nZzMDpyxQ==", "dependencies": { "debug": "2.6.9", - "encodeurl": "~1.0.2", + "encodeurl": "~2.0.0", "escape-html": "~1.0.3", "on-finished": "2.4.1", "parseurl": "~1.3.3", @@ -8528,13 +9318,15 @@ } }, "node_modules/form-data": { - "version": "3.0.1", - "resolved": "https://registry.npmjs.org/form-data/-/form-data-3.0.1.tgz", - "integrity": "sha512-RHkBKtLWUVwd7SqRIvCZMEvAMoGUp0XU+seQiZejj0COz3RI3hWP4sCv3gZWWLjJTd7rGwcsF5eKZGii0r/hbg==", + "version": "3.0.4", + "resolved": "https://registry.npmjs.org/form-data/-/form-data-3.0.4.tgz", + "integrity": "sha512-f0cRzm6dkyVYV3nPoooP8XlccPQukegwhAnpoLcXy+X+A8KfpGOoXwDr9FLZd3wzgLaBGQBE3lY93Zm/i1JvIQ==", "dependencies": { "asynckit": "^0.4.0", "combined-stream": "^1.0.8", - "mime-types": "^2.1.12" + "es-set-tostringtag": "^2.1.0", + "hasown": "^2.0.2", + "mime-types": "^2.1.35" }, "engines": { "node": ">= 6" @@ -8605,9 +9397,12 @@ } }, "node_modules/function-bind": { - "version": "1.1.1", - "resolved": "https://registry.npmjs.org/function-bind/-/function-bind-1.1.1.tgz", - "integrity": "sha512-yIovAzMX49sF8Yl58fSCWJ5svSLuaibPxXQJFLmBObTuCr0Mf1KiPopGM9NiFjiYBCbfaa2Fh6breQ6ANVTI0A==" + "version": "1.1.2", + "resolved": "https://registry.npmjs.org/function-bind/-/function-bind-1.1.2.tgz", + "integrity": "sha512-7XHNxH7qX9xG5mIwxkhumTox/MIRNcOgDrxWsMt2pAr23WHp6MrRlN7FBSFpCpr+oVO0F744iUgR82nJMfG2SA==", + "funding": { + "url": "https://github.com/sponsors/ljharb" + } }, "node_modules/function.prototype.name": { "version": "1.1.5", @@ -8651,13 +9446,23 @@ } }, "node_modules/get-intrinsic": { - "version": "1.1.3", - "resolved": "https://registry.npmjs.org/get-intrinsic/-/get-intrinsic-1.1.3.tgz", - "integrity": "sha512-QJVz1Tj7MS099PevUG5jvnt9tSkXN8K14dxQlikJuPt4uD9hHAHjLyLBiLR5zELelBdD9QNRAXZzsJx0WaDL9A==", + "version": "1.3.0", + "resolved": "https://registry.npmjs.org/get-intrinsic/-/get-intrinsic-1.3.0.tgz", + "integrity": "sha512-9fSjSaos/fRIVIp+xSJlE6lfwhES7LNtKaCBIamHsjr2na1BiABJPo0mOjjz8GJDURarmCPGqaiVg5mfjb98CQ==", "dependencies": { - "function-bind": "^1.1.1", - "has": "^1.0.3", - "has-symbols": "^1.0.3" + "call-bind-apply-helpers": "^1.0.2", + "es-define-property": "^1.0.1", + "es-errors": "^1.3.0", + "es-object-atoms": "^1.1.1", + "function-bind": "^1.1.2", + "get-proto": "^1.0.1", + "gopd": "^1.2.0", + "has-symbols": "^1.1.0", + "hasown": "^2.0.2", + "math-intrinsics": "^1.1.0" + }, + "engines": { + "node": ">= 0.4" }, "funding": { "url": "https://github.com/sponsors/ljharb" @@ -8676,6 +9481,18 @@ "node": ">=8.0.0" } }, + "node_modules/get-proto": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/get-proto/-/get-proto-1.0.1.tgz", + "integrity": "sha512-sTSfBjoXBp89JvIKIefqw7U2CCebsc74kiY6awiGogKtoSGbgjYE/G/+l9sF3MWFPNc9IcoOC4ODfKHfxFmp0g==", + "dependencies": { + "dunder-proto": "^1.0.1", + "es-object-atoms": "^1.0.0" + }, + "engines": { + "node": ">= 0.4" + } + }, "node_modules/get-stream": { "version": "6.0.1", "resolved": "https://registry.npmjs.org/get-stream/-/get-stream-6.0.1.tgz", @@ -8814,11 +9631,11 @@ } }, "node_modules/gopd": { - "version": "1.0.1", - "resolved": "https://registry.npmjs.org/gopd/-/gopd-1.0.1.tgz", - "integrity": "sha512-d65bNlIadxvpb/A2abVdlqKqV563juRnZ1Wtk6s1sIR8uNsXR70xqIzVqxVf1eTqDunwT2MkczEeaezCKTZhwA==", - "dependencies": { - "get-intrinsic": "^1.1.3" + "version": "1.2.0", + "resolved": "https://registry.npmjs.org/gopd/-/gopd-1.2.0.tgz", + "integrity": "sha512-ZUKRh6/kUFoAiTAtTYPZJ3hw9wNxx+BIBOijnlG9PnrJsCcSjs1wyyD6vJpaYtgnzDrKYRSqf3OO6Rfa93xsRg==", + "engines": { + "node": ">= 0.4" }, "funding": { "url": "https://github.com/sponsors/ljharb" @@ -8886,11 +9703,11 @@ } }, "node_modules/has-property-descriptors": { - "version": "1.0.0", - "resolved": "https://registry.npmjs.org/has-property-descriptors/-/has-property-descriptors-1.0.0.tgz", - "integrity": "sha512-62DVLZGoiEBDHQyqG4w9xCuZ7eJEwNmJRWw2VY84Oedb7WFcA27fiEVe8oUQx9hAUJ4ekurquucTGwsyO1XGdQ==", + "version": "1.0.2", + "resolved": "https://registry.npmjs.org/has-property-descriptors/-/has-property-descriptors-1.0.2.tgz", + "integrity": "sha512-55JNKuIW+vq4Ke1BjOTjM2YctQIvCT7GFzHwmfZPGo5wnrgkid0YQtnAleFSqumZm4az3n2BS+erby5ipJdgrg==", "dependencies": { - "get-intrinsic": "^1.1.1" + "es-define-property": "^1.0.0" }, "funding": { "url": "https://github.com/sponsors/ljharb" @@ -8908,9 +9725,9 @@ } }, "node_modules/has-symbols": { - "version": "1.0.3", - "resolved": "https://registry.npmjs.org/has-symbols/-/has-symbols-1.0.3.tgz", - "integrity": "sha512-l3LCuF6MgDNwTDKkdYGEihYjt5pRPbEg46rtlmnSPlUbgmB8LOIrKJbYYFBSbnPaJexMKtiPO8hmeRjRz2Td+A==", + "version": "1.1.0", + "resolved": "https://registry.npmjs.org/has-symbols/-/has-symbols-1.1.0.tgz", + "integrity": "sha512-1cDNdwJ2Jaohmb3sg4OmKaMBwuC48sYni5HUw2DvsC8LjGTLK9h+eb1X6RyuOHe4hT0ULCW68iomhjUoKUqlPQ==", "engines": { "node": ">= 0.4" }, @@ -8919,11 +9736,11 @@ } }, "node_modules/has-tostringtag": { - "version": "1.0.0", - "resolved": "https://registry.npmjs.org/has-tostringtag/-/has-tostringtag-1.0.0.tgz", - "integrity": "sha512-kFjcSNhnlGV1kyoGk7OXKSawH5JOb/LzUc5w9B02hOTO0dfFRjbHQKvg1d6cf3HbeUmtU9VbbV3qzZ2Teh97WQ==", + "version": "1.0.2", + "resolved": "https://registry.npmjs.org/has-tostringtag/-/has-tostringtag-1.0.2.tgz", + "integrity": "sha512-NqADB8VjPFLM2V0VvHUewwwsw0ZWBaIdgo+ieHtK3hasLz4qeCRjYcqfB6AQrBggRKppKF8L52/VqdVsO47Dlw==", "dependencies": { - "has-symbols": "^1.0.2" + "has-symbols": "^1.0.3" }, "engines": { "node": ">= 0.4" @@ -8932,6 +9749,17 @@ "url": "https://github.com/sponsors/ljharb" } }, + "node_modules/hasown": { + "version": "2.0.2", + "resolved": "https://registry.npmjs.org/hasown/-/hasown-2.0.2.tgz", + "integrity": "sha512-0hJU9SCPvmMzIBdZFqNPXWa6dqh7WdH0cII9y+CyS8rG3nL48Bclra9HmKhVVUHyPWNH5Y7xDwAB7bfgSjkUMQ==", + "dependencies": { + "function-bind": "^1.1.2" + }, + "engines": { + "node": ">= 0.4" + } + }, "node_modules/he": { "version": "1.2.0", "resolved": "https://registry.npmjs.org/he/-/he-1.2.0.tgz", @@ -9122,18 +9950,27 @@ } }, "node_modules/http-proxy-middleware": { - "version": "1.0.6", - "resolved": "https://registry.npmjs.org/http-proxy-middleware/-/http-proxy-middleware-1.0.6.tgz", - "integrity": "sha512-NyL6ZB6cVni7pl+/IT2W0ni5ME00xR0sN27AQZZrpKn1b+qRh+mLbBxIq9Cq1oGfmTc7BUq4HB77mxwCaxAYNg==", + "version": "3.0.5", + "resolved": "https://registry.npmjs.org/http-proxy-middleware/-/http-proxy-middleware-3.0.5.tgz", + "integrity": "sha512-GLZZm1X38BPY4lkXA01jhwxvDoOkkXqjgVyUzVxiEK4iuRu03PZoYHhHRwxnfhQMDuaxi3vVri0YgSro/1oWqg==", "dependencies": { - "@types/http-proxy": "^1.17.4", + "@types/http-proxy": "^1.17.15", + "debug": "^4.3.6", "http-proxy": "^1.18.1", - "is-glob": "^4.0.1", - "lodash": "^4.17.20", - "micromatch": "^4.0.2" + "is-glob": "^4.0.3", + "is-plain-object": "^5.0.0", + "micromatch": "^4.0.8" }, "engines": { - "node": ">=8.0.0" + "node": "^14.15.0 || ^16.10.0 || >=18.0.0" + } + }, + "node_modules/http-proxy-middleware/node_modules/is-plain-object": { + "version": "5.0.0", + "resolved": "https://registry.npmjs.org/is-plain-object/-/is-plain-object-5.0.0.tgz", + "integrity": "sha512-VRSzKkbMm5jMDoKLbltAkFQ5Qr7VDiTFGXxYFXXowVj387GeGNOCsOH6Msy00SGZ3Fp84b1Naa1psqgcCIEP5Q==", + "engines": { + "node": ">=0.10.0" } }, "node_modules/https-proxy-agent": { @@ -12111,6 +12948,14 @@ "node": ">=0.12.0" } }, + "node_modules/math-intrinsics": { + "version": "1.1.0", + "resolved": "https://registry.npmjs.org/math-intrinsics/-/math-intrinsics-1.1.0.tgz", + "integrity": "sha512-/IXtbwEk5HTPyEwyKX6hGkYXxM9nbj64B+ilVJnC/R6B0pH5G4V3b0pVbL7DBj4tkhBAppbQUlf6F6Xl9LHu1g==", + "engines": { + "node": ">= 0.4" + } + }, "node_modules/mdn-data": { "version": "2.0.4", "resolved": "https://registry.npmjs.org/mdn-data/-/mdn-data-2.0.4.tgz", @@ -12141,9 +12986,12 @@ "integrity": "sha512-HKeeBpWvqiVJD57ZUAsJNm71eHTykffzcLZVYWiVfQeI1rJtuEaS7hQiEpWfVVk18donPwJEcFKIkCmPJNOhHA==" }, "node_modules/merge-descriptors": { - "version": "1.0.1", - "resolved": "https://registry.npmjs.org/merge-descriptors/-/merge-descriptors-1.0.1.tgz", - "integrity": "sha512-cCi6g3/Zr1iqQi6ySbseM1Xvooa98N0w31jzUYrXPX2xqObmFGHJ0tQ5u74H3mVh7wLouTseZyYIq39g8cNp1w==" + "version": "1.0.3", + "resolved": "https://registry.npmjs.org/merge-descriptors/-/merge-descriptors-1.0.3.tgz", + "integrity": "sha512-gaNvAS7TZ897/rVaZ0nMtAyxNyi/pdbjbAwUpFQpN70GqnVfOiXpeUUMKRBmzXaSQ8DdTX4/0ms62r2K+hE6mQ==", + "funding": { + "url": "https://github.com/sponsors/sindresorhus" + } }, "node_modules/merge-stream": { "version": "2.0.0", @@ -12167,11 +13015,11 @@ } }, "node_modules/micromatch": { - "version": "4.0.5", - "resolved": "https://registry.npmjs.org/micromatch/-/micromatch-4.0.5.tgz", - "integrity": "sha512-DMy+ERcEW2q8Z2Po+WNXuw3c5YaUSFjAO5GsJqfEl7UjvtIuFKO6ZrKvcItdy98dwFI2N1tg3zNIdKaQT+aNdA==", + "version": "4.0.8", + "resolved": "https://registry.npmjs.org/micromatch/-/micromatch-4.0.8.tgz", + "integrity": "sha512-PXwfBhYu0hBCPw8Dn0E+WDYb7af3dSLVWKi3HGv84IdF4TyFoC0ysxFd0Goxw7nSv4T/PzEJQxsYsEiFCKo2BA==", "dependencies": { - "braces": "^3.0.2", + "braces": "^3.0.3", "picomatch": "^2.3.1" }, "engines": { @@ -12319,9 +13167,9 @@ } }, "node_modules/ms": { - "version": "2.1.2", - "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.2.tgz", - "integrity": "sha512-sGkPx+VjMtmA6MX27oA4FBFELFCZZ4S4XqeGOXCv68tT+jb3vk/RyaKWP0PTKyWtmLSM0b+adUTEvbs1PEaH2w==" + "version": "2.1.3", + "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.3.tgz", + "integrity": "sha512-6FlzubTLZG3J2a/NVCAleEhjzq5oxgHyaCU9yYXvcLsvoVaHJq/s5xXI6/XXP6tz7R9xAOtHnSO/tXtF3WRTlA==" }, "node_modules/multicast-dns": { "version": "7.2.5", @@ -12336,9 +13184,15 @@ } }, "node_modules/nanoid": { - "version": "3.3.4", - "resolved": "https://registry.npmjs.org/nanoid/-/nanoid-3.3.4.tgz", - "integrity": "sha512-MqBkQh/OHTS2egovRtLk45wEyNXwF+cokD+1YPf9u5VfJiRdAiRwB2froX5Co9Rh20xs4siNPm8naNotSD6RBw==", + "version": "3.3.8", + "resolved": "https://registry.npmjs.org/nanoid/-/nanoid-3.3.8.tgz", + "integrity": "sha512-WNLf5Sd8oZxOm+TzppcYk8gVOgP+l58xNy58D0nbUnOxOWRWvlcCV4kUF7ltmI6PsrLl/BgKEyS4mqsGChFN0w==", + "funding": [ + { + "type": "github", + "url": "https://github.com/sponsors/ai" + } + ], "bin": { "nanoid": "bin/nanoid.cjs" }, @@ -12480,9 +13334,12 @@ } }, "node_modules/object-inspect": { - "version": "1.12.2", - "resolved": "https://registry.npmjs.org/object-inspect/-/object-inspect-1.12.2.tgz", - "integrity": "sha512-z+cPxW0QGUp0mcqcsgQyLVRDoXFQbXOwBaqyF7VIgI4TWNQsDHrBpUQslRmIfAoYWdYzs6UlKJtB2XJpTaNSpQ==", + "version": "1.13.2", + "resolved": "https://registry.npmjs.org/object-inspect/-/object-inspect-1.13.2.tgz", + "integrity": "sha512-IRZSRuzJiynemAXPYtPe5BoI/RESNYR7TYm50MC5Mqbd3Jmw5y790sErYw3V6SryFJD64b74qQQs9wn5Bg/k3g==", + "engines": { + "node": ">= 0.4" + }, "funding": { "url": "https://github.com/sponsors/ljharb" } @@ -12603,9 +13460,9 @@ } }, "node_modules/on-headers": { - "version": "1.0.2", - "resolved": "https://registry.npmjs.org/on-headers/-/on-headers-1.0.2.tgz", - "integrity": "sha512-pZAE+FJLoyITytdqK0U5s+FIpjN0JP3OzFi/u8Rx+EV5/W+JTWGXG8xFzevE7AjBfDqHv/8vL8qQsIhHnqRkrA==", + "version": "1.1.0", + "resolved": "https://registry.npmjs.org/on-headers/-/on-headers-1.1.0.tgz", + "integrity": "sha512-737ZY3yNnXy37FHkQxPzt4UZ2UWPWiCZWLvFZ4fu5cueciegX0zGPnrlY6bwRg4FdQOe9YU8MkmJwGhoMybl8A==", "engines": { "node": ">= 0.8" } @@ -12814,9 +13671,9 @@ "integrity": "sha512-LDJzPVEEEPR+y48z93A0Ed0yXb8pAByGWo/k5YYdYgpY2/2EsOsksJrq7lOHxryrVOn1ejG6oAp8ahvOIQD8sw==" }, "node_modules/path-to-regexp": { - "version": "0.1.7", - "resolved": "https://registry.npmjs.org/path-to-regexp/-/path-to-regexp-0.1.7.tgz", - "integrity": "sha512-5DFkuoqlv1uYQKxy8omFBeJPQcdoE07Kv2sferDCrAq1ohOU+MSDswDIbnx3YAM60qIOnYa53wBhXW0EbMonrQ==" + "version": "0.1.12", + "resolved": "https://registry.npmjs.org/path-to-regexp/-/path-to-regexp-0.1.12.tgz", + "integrity": "sha512-RA1GjUVMnvYFxuqovrEqZoxxW5NUZqbwKtYz/Tt7nXerk0LbLblQmrsgdeOxV5SFHf0UDggjS/bSeOZwt1pmEQ==" }, "node_modules/path-type": { "version": "4.0.0", @@ -12832,9 +13689,9 @@ "integrity": "sha512-7EAHlyLHI56VEIdK57uwHdHKIaAGbnXPiw0yWbarQZOKaKpvUIgW0jWRVLiatnM+XXlSwsanIBH/hzGMJulMow==" }, "node_modules/picocolors": { - "version": "1.0.0", - "resolved": "https://registry.npmjs.org/picocolors/-/picocolors-1.0.0.tgz", - "integrity": "sha512-1fygroTLlHu66zi26VoTDv8yRgm0Fccecssto+MhsZ0D/DGW2sm8E8AjW7NU5VVTRt5GxbeZ5qBuJr+HyLYkjQ==" + "version": "1.1.1", + "resolved": "https://registry.npmjs.org/picocolors/-/picocolors-1.1.1.tgz", + "integrity": "sha512-xceH2snhtb5M9liqDsmEw56le376mTZkEX/jEb/RxNFyegNul7eNslCXP9FDj/Lcu0X8KEyMceP2ntpaHrDEVA==" }, "node_modules/picomatch": { "version": "2.3.1", @@ -14309,37 +15166,38 @@ } }, "node_modules/pyodide": { - "version": "0.23.2", - "resolved": "https://registry.npmjs.org/pyodide/-/pyodide-0.23.2.tgz", - "integrity": "sha512-GK4YDZVgzfAXK/7X0IiCI+142k0Ah/HwYTzDHtG8zC47dflWYuPozeFbOngShuL1M9Un5sCmHFqiH3boxJv0pQ==", + "version": "0.26.2", + "resolved": "https://registry.npmjs.org/pyodide/-/pyodide-0.26.2.tgz", + "integrity": "sha512-8VCRdFX83gBsWs6XP2rhG8HMaB+JaVyyav4q/EMzoV8fXH8HN6T5IISC92SNma6i1DRA3SVXA61S1rJcB8efgA==", "dependencies": { - "base-64": "^1.0.0", - "node-fetch": "^2.6.1", "ws": "^8.5.0" + }, + "engines": { + "node": ">=18.0.0" } }, "node_modules/pyodide-worker-runner": { - "version": "1.3.3", - "resolved": "https://registry.npmjs.org/pyodide-worker-runner/-/pyodide-worker-runner-1.3.3.tgz", - "integrity": "sha512-6SyvbsfSis5u4dgcnOo5Xzr9shp2Mc3f2NtoL9B1xWWwKRQqYHNqAvQkf2S0ZfyRd43FS4M/Kp797unKirR98A==", + "version": "1.4.0", + "resolved": "https://registry.npmjs.org/pyodide-worker-runner/-/pyodide-worker-runner-1.4.0.tgz", + "integrity": "sha512-t9v49q4sWSlywNMoMPw1Zs9FBpCP70wkHB5zzzmOErIxPS3w3HVxiwSI/ldpT1GH1exLEPGz16YHGVa65XqdHw==", "dependencies": { "p-retry": "^5.0.0" }, "peerDependencies": { "comsync": "*", - "pyodide": "^0.23.2" + "pyodide": "*" } }, "node_modules/pyodide/node_modules/ws": { - "version": "8.8.1", - "resolved": "https://registry.npmjs.org/ws/-/ws-8.8.1.tgz", - "integrity": "sha512-bGy2JzvzkPowEJV++hF07hAD6niYSr0JzBNo/J29WsB57A2r7Wlc1UFcTR9IzrPvuNVO4B8LGqF8qcpsVOhJCA==", + "version": "8.18.3", + "resolved": "https://registry.npmjs.org/ws/-/ws-8.18.3.tgz", + "integrity": "sha512-PEIGCY5tSlUt50cqyMXfCzX+oOPqN0vuGqWzbcJ2xvnkzkq46oOpz7dQaTDBdfICb4N14+GARUDw2XV2N4tvzg==", "engines": { "node": ">=10.0.0" }, "peerDependencies": { "bufferutil": "^4.0.1", - "utf-8-validate": "^5.0.2" + "utf-8-validate": ">=5.0.2" }, "peerDependenciesMeta": { "bufferutil": { @@ -14360,11 +15218,11 @@ } }, "node_modules/qs": { - "version": "6.11.0", - "resolved": "https://registry.npmjs.org/qs/-/qs-6.11.0.tgz", - "integrity": "sha512-MvjoMCJwEarSbUYk5O+nmoSzSutSsTwF85zcHPQ9OrlFoZOYIjaqBAJIqIXjptyD5vThxGq52Xu/MaJzRkIk4Q==", + "version": "6.13.0", + "resolved": "https://registry.npmjs.org/qs/-/qs-6.13.0.tgz", + "integrity": "sha512-+38qI9SOr8tfZ4QmJNplMUxqjbe7LKvvZgWdExBOmd+egZTtjLB67Gu0HRX3u/XOq7UU2Nx6nsjvS16Z9uwfpg==", "dependencies": { - "side-channel": "^1.0.4" + "side-channel": "^1.0.6" }, "engines": { "node": ">=0.6" @@ -14451,14 +15309,6 @@ "node": ">= 0.8" } }, - "node_modules/raw-body/node_modules/bytes": { - "version": "3.1.2", - "resolved": "https://registry.npmjs.org/bytes/-/bytes-3.1.2.tgz", - "integrity": "sha512-/Nf7TyzTx6S3yRJObOAV7956r8cr2+Oj8AC5dt8wSP3BQAoeX58NoHyCU8P8zGkNXStjTSi6fzO6F0pBdcYbEg==", - "engines": { - "node": ">= 0.8" - } - }, "node_modules/raw-body/node_modules/iconv-lite": { "version": "0.4.24", "resolved": "https://registry.npmjs.org/iconv-lite/-/iconv-lite-0.4.24.tgz", @@ -15223,9 +16073,9 @@ } }, "node_modules/rollup": { - "version": "2.79.1", - "resolved": "https://registry.npmjs.org/rollup/-/rollup-2.79.1.tgz", - "integrity": "sha512-uKxbd0IhMZOhjAiD5oAFp7BqvkA4Dv47qpOCtaNvng4HBwdbWtdOh8f5nZNuk2rp51PMGk3bzfWu5oayNEuYnw==", + "version": "2.79.2", + "resolved": "https://registry.npmjs.org/rollup/-/rollup-2.79.2.tgz", + "integrity": "sha512-fS6iqSPZDs3dr/y7Od6y5nha8dW1YnbgtsyotCVvoFGKbERG++CVRFv1meyGDE1SNItQA8BrnCw7ScdAhRJ3XQ==", "bin": { "rollup": "dist/bin/rollup" }, @@ -15472,9 +16322,9 @@ "integrity": "sha512-3wdGidZyq5PB084XLES5TpOSRA3wjXAlIWMhum2kRcv/41Sn2emQ0dycQW4uZXLejwKvg6EsvbdlVL+FYEct7A==" }, "node_modules/send": { - "version": "0.18.0", - "resolved": "https://registry.npmjs.org/send/-/send-0.18.0.tgz", - "integrity": "sha512-qqWzuOjSFOuqPjFe4NOsMLafToQQwBSOEpS+FwEt3A2V3vKubTquT3vmLTQpFgMXp8AlFWFuP1qKaJZOtPpVXg==", + "version": "0.19.0", + "resolved": "https://registry.npmjs.org/send/-/send-0.19.0.tgz", + "integrity": "sha512-dW41u5VfLXu8SJh5bwRmyYUbAoSB3c9uQh6L8h/KtsFREPWpbX1lrljJo186Jc4nmci/sGUZ9a0a0J2zgfq2hw==", "dependencies": { "debug": "2.6.9", "depd": "2.0.0", @@ -15507,15 +16357,19 @@ "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz", "integrity": "sha512-Tpp60P6IUJDTuOq/5Z8cdskzJujfwqfOTkrwIwj7IRISpnkJnT6SyJ4PCPnGMoFjC9ddhal5KVIYtAt97ix05A==" }, - "node_modules/send/node_modules/ms": { - "version": "2.1.3", - "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.3.tgz", - "integrity": "sha512-6FlzubTLZG3J2a/NVCAleEhjzq5oxgHyaCU9yYXvcLsvoVaHJq/s5xXI6/XXP6tz7R9xAOtHnSO/tXtF3WRTlA==" + "node_modules/send/node_modules/encodeurl": { + "version": "1.0.2", + "resolved": "https://registry.npmjs.org/encodeurl/-/encodeurl-1.0.2.tgz", + "integrity": "sha512-TPJXq8JqFaVYm2CWmPvnP2Iyo4ZSM7/QKcSmuMLDObfpH5fi7RUGmd/rTDf+rut/saiDiQEeVTNgAmJEdAOx0w==", + "engines": { + "node": ">= 0.8" + } }, "node_modules/serialize-javascript": { - "version": "6.0.0", - "resolved": "https://registry.npmjs.org/serialize-javascript/-/serialize-javascript-6.0.0.tgz", - "integrity": "sha512-Qr3TosvguFt8ePWqsvRfrKyQXIiW+nGbYpy8XK24NQHE83caxWt+mIymTT19DGFbNWNLfEwsrkSmN64lVWB9ag==", + "version": "6.0.2", + "resolved": "https://registry.npmjs.org/serialize-javascript/-/serialize-javascript-6.0.2.tgz", + "integrity": "sha512-Saa1xPByTTq2gdeFZYLLo+RFE35NHZkAbqZeWNd3BpzppeVisAqpDjcp8dyf6uIvEqJRd46jemmyA4iFIeVk8g==", + "license": "BSD-3-Clause", "dependencies": { "randombytes": "^2.1.0" } @@ -15591,19 +16445,35 @@ } }, "node_modules/serve-static": { - "version": "1.15.0", - "resolved": "https://registry.npmjs.org/serve-static/-/serve-static-1.15.0.tgz", - "integrity": "sha512-XGuRDNjXUijsUL0vl6nSD7cwURuzEgglbOaFuZM9g3kwDXOWVTck0jLzjPzGD+TazWbboZYu52/9/XPdUgne9g==", + "version": "1.16.2", + "resolved": "https://registry.npmjs.org/serve-static/-/serve-static-1.16.2.tgz", + "integrity": "sha512-VqpjJZKadQB/PEbEwvFdO43Ax5dFBZ2UECszz8bQ7pi7wt//PWe1P6MN7eCnjsatYtBT6EuiClbjSWP2WrIoTw==", "dependencies": { - "encodeurl": "~1.0.2", + "encodeurl": "~2.0.0", "escape-html": "~1.0.3", "parseurl": "~1.3.3", - "send": "0.18.0" + "send": "0.19.0" }, "engines": { "node": ">= 0.8.0" } }, + "node_modules/set-function-length": { + "version": "1.2.2", + "resolved": "https://registry.npmjs.org/set-function-length/-/set-function-length-1.2.2.tgz", + "integrity": "sha512-pgRc4hJ4/sNjWCSS9AmnS40x3bNMDTknHgL5UaMBTMyJnU90EgWh1Rz+MC9eFu4BuN/UwZjKQuY/1v3rM7HMfg==", + "dependencies": { + "define-data-property": "^1.1.4", + "es-errors": "^1.3.0", + "function-bind": "^1.1.2", + "get-intrinsic": "^1.2.4", + "gopd": "^1.0.1", + "has-property-descriptors": "^1.0.2" + }, + "engines": { + "node": ">= 0.4" + } + }, "node_modules/setprototypeof": { "version": "1.2.0", "resolved": "https://registry.npmjs.org/setprototypeof/-/setprototypeof-1.2.0.tgz", @@ -15648,13 +16518,17 @@ } }, "node_modules/side-channel": { - "version": "1.0.4", - "resolved": "https://registry.npmjs.org/side-channel/-/side-channel-1.0.4.tgz", - "integrity": "sha512-q5XPytqFEIKHkGdiMIrY10mvLRvnQh42/+GoBlFW3b2LXLE2xxJpZFdm94we0BaoV3RwJyGqg5wS7epxTv0Zvw==", + "version": "1.0.6", + "resolved": "https://registry.npmjs.org/side-channel/-/side-channel-1.0.6.tgz", + "integrity": "sha512-fDW/EZ6Q9RiO8eFG8Hj+7u/oW+XrPTIChwCOM2+th2A6OblDtYYIpve9m+KvI9Z4C9qSEXlaGR6bTEYHReuglA==", "dependencies": { - "call-bind": "^1.0.0", - "get-intrinsic": "^1.0.2", - "object-inspect": "^1.9.0" + "call-bind": "^1.0.7", + "es-errors": "^1.3.0", + "get-intrinsic": "^1.2.4", + "object-inspect": "^1.13.1" + }, + "engines": { + "node": ">= 0.4" }, "funding": { "url": "https://github.com/sponsors/ljharb" @@ -16363,14 +17237,6 @@ "resolved": "https://registry.npmjs.org/tmpl/-/tmpl-1.0.5.tgz", "integrity": "sha512-3f0uOEAQwIqGuWW2MVzYg8fV/QNnc/IpuJNG837rLuczAaLVHslWHZQj4IGiEl5Hs3kkbhwL9Ab7Hrsmuj+Smw==" }, - "node_modules/to-fast-properties": { - "version": "2.0.0", - "resolved": "https://registry.npmjs.org/to-fast-properties/-/to-fast-properties-2.0.0.tgz", - "integrity": "sha512-/OaKK0xYrs3DmxRYqL/yDc+FxFUVYhDlXMhRmv3z915w2HF1tnN1omB354j8VUGO/hbRzyD6Y3sA7v7GS/ceog==", - "engines": { - "node": ">=4" - } - }, "node_modules/to-regex-range": { "version": "5.0.1", "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-5.0.1.tgz", @@ -17082,9 +17948,9 @@ } }, "node_modules/webpack-dev-server/node_modules/http-proxy-middleware": { - "version": "2.0.6", - "resolved": "https://registry.npmjs.org/http-proxy-middleware/-/http-proxy-middleware-2.0.6.tgz", - "integrity": "sha512-ya/UeJ6HVBYxrgYotAZo1KvPWlgB48kUJLDePFeneHsVujFaW5WNj2NgWCAE//B1Dl02BIfYlpNgBy8Kf8Rjmw==", + "version": "2.0.9", + "resolved": "https://registry.npmjs.org/http-proxy-middleware/-/http-proxy-middleware-2.0.9.tgz", + "integrity": "sha512-c1IyJYLYppU574+YI7R4QyX2ystMtVXZwIdzazUIPIJsHuWNd+mho2j+bKoHftndicGj9yh+xjd+l0yj7VeT1Q==", "dependencies": { "@types/http-proxy": "^1.17.8", "http-proxy": "^1.18.1", @@ -17140,15 +18006,15 @@ } }, "node_modules/webpack-dev-server/node_modules/ws": { - "version": "8.11.0", - "resolved": "https://registry.npmjs.org/ws/-/ws-8.11.0.tgz", - "integrity": "sha512-HPG3wQd9sNQoT9xHyNCXoDUa+Xw/VevmY9FoHyQ+g+rrMn4j6FB4np7Z0OhdTgjx6MgQLK7jwSy1YecU1+4Asg==", + "version": "8.18.3", + "resolved": "https://registry.npmjs.org/ws/-/ws-8.18.3.tgz", + "integrity": "sha512-PEIGCY5tSlUt50cqyMXfCzX+oOPqN0vuGqWzbcJ2xvnkzkq46oOpz7dQaTDBdfICb4N14+GARUDw2XV2N4tvzg==", "engines": { "node": ">=10.0.0" }, "peerDependencies": { "bufferutil": "^4.0.1", - "utf-8-validate": "^5.0.2" + "utf-8-validate": ">=5.0.2" }, "peerDependenciesMeta": { "bufferutil": { @@ -17734,9 +18600,9 @@ } }, "node_modules/ws": { - "version": "7.5.9", - "resolved": "https://registry.npmjs.org/ws/-/ws-7.5.9.tgz", - "integrity": "sha512-F+P9Jil7UiSKSkppIiD94dN07AwvFixvLIj1Og1Rl9GGMuNipJnV9JzjD6XuqmAeiswGvUmNLjr5cFuXwNS77Q==", + "version": "7.5.10", + "resolved": "https://registry.npmjs.org/ws/-/ws-7.5.10.tgz", + "integrity": "sha512-+dbF1tHwZpXcbOJdVOkzLDxZP1ailvSxM6ZweXTegylPny803bFhA+vqBYw4s31NSAk4S2Qz+AKXK9a4wkdjcQ==", "engines": { "node": ">=8.3.0" }, @@ -17856,12 +18722,13 @@ } }, "@babel/code-frame": { - "version": "7.23.5", - "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.23.5.tgz", - "integrity": "sha512-CgH3s1a96LipHCmSUmYFPwY7MNx8C3avkq7i4Wl3cfa662ldtUe4VM1TPXX70pfmrlWTb6jLqTYrZyT2ZTJBgA==", + "version": "7.27.1", + "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.27.1.tgz", + "integrity": "sha512-cjQ7ZlQ0Mv3b47hABuTevyTuYN4i+loJKGeV9flcCgIK37cCXRh+L1bd3iBHlynerhQ7BhCkn2BPbQUL+rGqFg==", "requires": { - "@babel/highlight": "^7.23.4", - "chalk": "^2.4.2" + "@babel/helper-validator-identifier": "^7.27.1", + "js-tokens": "^4.0.0", + "picocolors": "^1.1.1" } }, "@babel/compat-data": { @@ -18146,14 +19013,14 @@ } }, "@babel/helper-string-parser": { - "version": "7.23.4", - "resolved": "https://registry.npmjs.org/@babel/helper-string-parser/-/helper-string-parser-7.23.4.tgz", - "integrity": "sha512-803gmbQdqwdf4olxrX4AJyFBV/RTr3rSmOj0rKwesmzlfhYNDEs+/iOcznzpNWlJlIlTJC2QfPFcHB6DlzdVLQ==" + "version": "7.27.1", + "resolved": "https://registry.npmjs.org/@babel/helper-string-parser/-/helper-string-parser-7.27.1.tgz", + "integrity": "sha512-qMlSxKbpRlAridDExk92nSobyDdpPijUq2DW6oDnUqd0iOGxmQjyqhMIihI9+zv4LPyZdRje2cavWPbCbWm3eA==" }, "@babel/helper-validator-identifier": { - "version": "7.22.20", - "resolved": "https://registry.npmjs.org/@babel/helper-validator-identifier/-/helper-validator-identifier-7.22.20.tgz", - "integrity": "sha512-Y4OZ+ytlatR8AI+8KZfKuL5urKp7qey08ha31L8b3BwewJAoJamTzyvxPR/5D+KkdJCGPq/+8TukHBlY10FX9A==" + "version": "7.27.1", + "resolved": "https://registry.npmjs.org/@babel/helper-validator-identifier/-/helper-validator-identifier-7.27.1.tgz", + "integrity": "sha512-D2hP9eA+Sqx1kBZgzxZh0y1trbuU+JoDkiEwqhQ36nodYqJwyEIhPSdMNd7lOm/4io72luTPWH20Yda0xOuUow==" }, "@babel/helper-validator-option": { "version": "7.18.6", @@ -18172,30 +19039,22 @@ } }, "@babel/helpers": { - "version": "7.20.7", - "resolved": "https://registry.npmjs.org/@babel/helpers/-/helpers-7.20.7.tgz", - "integrity": "sha512-PBPjs5BppzsGaxHQCDKnZ6Gd9s6xl8bBCluz3vEInLGRJmnZan4F6BYCeqtyXqkk4W5IlPmjK4JlOuZkpJ3xZA==", + "version": "7.27.6", + "resolved": "https://registry.npmjs.org/@babel/helpers/-/helpers-7.27.6.tgz", + "integrity": "sha512-muE8Tt8M22638HU31A3CgfSUciwz1fhATfoVai05aPXGor//CdWDCbnlY1yvBPo07njuVOCNGCSp/GTt12lIug==", "requires": { - "@babel/template": "^7.20.7", - "@babel/traverse": "^7.20.7", - "@babel/types": "^7.20.7" + "@babel/template": "^7.27.2", + "@babel/types": "^7.27.6" } }, - "@babel/highlight": { - "version": "7.23.4", - "resolved": "https://registry.npmjs.org/@babel/highlight/-/highlight-7.23.4.tgz", - "integrity": "sha512-acGdbYSfp2WheJoJm/EBBBLh/ID8KDc64ISZ9DYtBmC8/Q204PZJLHyzeB5qMzJ5trcOkybd78M4x2KWsUq++A==", + "@babel/parser": { + "version": "7.28.0", + "resolved": "https://registry.npmjs.org/@babel/parser/-/parser-7.28.0.tgz", + "integrity": "sha512-jVZGvOxOuNSsuQuLRTh13nU0AogFlw32w/MT+LV6D3sP5WdbW61E77RnkbaO2dUvmPAYrBDJXGn5gGS6tH4j8g==", "requires": { - "@babel/helper-validator-identifier": "^7.22.20", - "chalk": "^2.4.2", - "js-tokens": "^4.0.0" + "@babel/types": "^7.28.0" } }, - "@babel/parser": { - "version": "7.23.9", - "resolved": "https://registry.npmjs.org/@babel/parser/-/parser-7.23.9.tgz", - "integrity": "sha512-9tcKgqKbs3xGJ+NtKF2ndOBBLVwPjl1SHxPQkd36r3Dlirw3xWUeGaTbqr7uGZcTaxkVNwc+03SVP7aCdWrTlA==" - }, "@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression": { "version": "7.18.6", "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression/-/plugin-bugfix-safari-id-destructuring-collision-in-function-expression-7.18.6.tgz", @@ -19030,30 +19889,26 @@ } }, "@babel/runtime": { - "version": "7.20.7", - "resolved": "https://registry.npmjs.org/@babel/runtime/-/runtime-7.20.7.tgz", - "integrity": "sha512-UF0tvkUtxwAgZ5W/KrkHf0Rn0fdnLDU9ScxBrEVNUprE/MzirjK4MJUX1/BVDv00Sv8cljtukVK1aky++X1SjQ==", - "requires": { - "regenerator-runtime": "^0.13.11" - } + "version": "7.27.6", + "resolved": "https://registry.npmjs.org/@babel/runtime/-/runtime-7.27.6.tgz", + "integrity": "sha512-vbavdySgbTTrmFE+EsiqUTzlOr5bzlnJtUv9PynGCAKvfQqjIXbvFdumPM/GxMDfyuGMJaJAU6TO4zc1Jf1i8Q==" }, "@babel/runtime-corejs3": { - "version": "7.20.7", - "resolved": "https://registry.npmjs.org/@babel/runtime-corejs3/-/runtime-corejs3-7.20.7.tgz", - "integrity": "sha512-jr9lCZ4RbRQmCR28Q8U8Fu49zvFqLxTY9AMOUz+iyMohMoAgpEcVxY+wJNay99oXOpOcCTODkk70NDN2aaJEeg==", + "version": "7.28.0", + "resolved": "https://registry.npmjs.org/@babel/runtime-corejs3/-/runtime-corejs3-7.28.0.tgz", + "integrity": "sha512-nlIXnSqLcBij8K8TtkxbBJgfzfvi75V1pAKSM7dUXejGw12vJAqez74jZrHTsJ3Z+Aczc5Q/6JgNjKRMsVU44g==", "requires": { - "core-js-pure": "^3.25.1", - "regenerator-runtime": "^0.13.11" + "core-js-pure": "^3.43.0" } }, "@babel/template": { - "version": "7.23.9", - "resolved": "https://registry.npmjs.org/@babel/template/-/template-7.23.9.tgz", - "integrity": "sha512-+xrD2BWLpvHKNmX2QbpdpsBaWnRxahMwJjO+KZk2JOElj5nSmKezyS1B4u+QbHMTX69t4ukm6hh9lsYQ7GHCKA==", + "version": "7.27.2", + "resolved": "https://registry.npmjs.org/@babel/template/-/template-7.27.2.tgz", + "integrity": "sha512-LPDZ85aEJyYSd18/DkjNh4/y1ntkE5KwUHWTiqgRxruuZL2F1yuHligVHLvcHY2vMHXttKFpJn6LwfI7cw7ODw==", "requires": { - "@babel/code-frame": "^7.23.5", - "@babel/parser": "^7.23.9", - "@babel/types": "^7.23.9" + "@babel/code-frame": "^7.27.1", + "@babel/parser": "^7.27.2", + "@babel/types": "^7.27.1" } }, "@babel/traverse": { @@ -19074,13 +19929,12 @@ } }, "@babel/types": { - "version": "7.23.9", - "resolved": "https://registry.npmjs.org/@babel/types/-/types-7.23.9.tgz", - "integrity": "sha512-dQjSq/7HaSjRM43FFGnv5keM2HsxpmyV1PfaSVm0nzzjwwTmjOe6J4bC8e3+pTEIgHaHj+1ZlLThRJ2auc/w1Q==", + "version": "7.28.0", + "resolved": "https://registry.npmjs.org/@babel/types/-/types-7.28.0.tgz", + "integrity": "sha512-jYnje+JyZG5YThjHiF28oT4SIZLnYOcSBb6+SDaFIyzDVSkXQmQQYclJ2R+YxcdmK0AX6x1E5OQNtuh3jHDrUg==", "requires": { - "@babel/helper-string-parser": "^7.23.4", - "@babel/helper-validator-identifier": "^7.22.20", - "to-fast-properties": "^2.0.0" + "@babel/helper-string-parser": "^7.27.1", + "@babel/helper-validator-identifier": "^7.27.1" } }, "@bcoe/v8-coverage": { @@ -19227,25 +20081,186 @@ "postcss-value-parser": "^4.2.0" } }, - "@csstools/postcss-trigonometric-functions": { - "version": "1.0.2", - "resolved": "https://registry.npmjs.org/@csstools/postcss-trigonometric-functions/-/postcss-trigonometric-functions-1.0.2.tgz", - "integrity": "sha512-woKaLO///4bb+zZC2s80l+7cm07M7268MsyG3M0ActXXEFi6SuhvriQYcb58iiKGbjwwIU7n45iRLEHypB47Og==", - "requires": { - "postcss-value-parser": "^4.2.0" - } + "@csstools/postcss-trigonometric-functions": { + "version": "1.0.2", + "resolved": "https://registry.npmjs.org/@csstools/postcss-trigonometric-functions/-/postcss-trigonometric-functions-1.0.2.tgz", + "integrity": "sha512-woKaLO///4bb+zZC2s80l+7cm07M7268MsyG3M0ActXXEFi6SuhvriQYcb58iiKGbjwwIU7n45iRLEHypB47Og==", + "requires": { + "postcss-value-parser": "^4.2.0" + } + }, + "@csstools/postcss-unset-value": { + "version": "1.0.2", + "resolved": "https://registry.npmjs.org/@csstools/postcss-unset-value/-/postcss-unset-value-1.0.2.tgz", + "integrity": "sha512-c8J4roPBILnelAsdLr4XOAR/GsTm0GJi4XpcfvoWk3U6KiTCqiFYc63KhRMQQX35jYMp4Ao8Ij9+IZRgMfJp1g==", + "requires": {} + }, + "@csstools/selector-specificity": { + "version": "2.0.2", + "resolved": "https://registry.npmjs.org/@csstools/selector-specificity/-/selector-specificity-2.0.2.tgz", + "integrity": "sha512-IkpVW/ehM1hWKln4fCA3NzJU8KwD+kIOvPZA4cqxoJHtE21CCzjyp+Kxbu0i5I4tBNOlXPL9mjwnWlL0VEG4Fg==", + "requires": {} + }, + "@esbuild/aix-ppc64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/aix-ppc64/-/aix-ppc64-0.19.12.tgz", + "integrity": "sha512-bmoCYyWdEL3wDQIVbcyzRyeKLgk2WtWLTWz1ZIAZF/EGbNOwSA6ew3PftJ1PqMiOOGu0OyFMzG53L0zqIpPeNA==", + "dev": true, + "optional": true + }, + "@esbuild/android-arm": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/android-arm/-/android-arm-0.19.12.tgz", + "integrity": "sha512-qg/Lj1mu3CdQlDEEiWrlC4eaPZ1KztwGJ9B6J+/6G+/4ewxJg7gqj8eVYWvao1bXrqGiW2rsBZFSX3q2lcW05w==", + "dev": true, + "optional": true + }, + "@esbuild/android-arm64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/android-arm64/-/android-arm64-0.19.12.tgz", + "integrity": "sha512-P0UVNGIienjZv3f5zq0DP3Nt2IE/3plFzuaS96vihvD0Hd6H/q4WXUGpCxD/E8YrSXfNyRPbpTq+T8ZQioSuPA==", + "dev": true, + "optional": true + }, + "@esbuild/android-x64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/android-x64/-/android-x64-0.19.12.tgz", + "integrity": "sha512-3k7ZoUW6Q6YqhdhIaq/WZ7HwBpnFBlW905Fa4s4qWJyiNOgT1dOqDiVAQFwBH7gBRZr17gLrlFCRzF6jFh7Kew==", + "dev": true, + "optional": true + }, + "@esbuild/darwin-arm64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/darwin-arm64/-/darwin-arm64-0.19.12.tgz", + "integrity": "sha512-B6IeSgZgtEzGC42jsI+YYu9Z3HKRxp8ZT3cqhvliEHovq8HSX2YX8lNocDn79gCKJXOSaEot9MVYky7AKjCs8g==", + "dev": true, + "optional": true + }, + "@esbuild/darwin-x64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/darwin-x64/-/darwin-x64-0.19.12.tgz", + "integrity": "sha512-hKoVkKzFiToTgn+41qGhsUJXFlIjxI/jSYeZf3ugemDYZldIXIxhvwN6erJGlX4t5h417iFuheZ7l+YVn05N3A==", + "dev": true, + "optional": true + }, + "@esbuild/freebsd-arm64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/freebsd-arm64/-/freebsd-arm64-0.19.12.tgz", + "integrity": "sha512-4aRvFIXmwAcDBw9AueDQ2YnGmz5L6obe5kmPT8Vd+/+x/JMVKCgdcRwH6APrbpNXsPz+K653Qg8HB/oXvXVukA==", + "dev": true, + "optional": true + }, + "@esbuild/freebsd-x64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/freebsd-x64/-/freebsd-x64-0.19.12.tgz", + "integrity": "sha512-EYoXZ4d8xtBoVN7CEwWY2IN4ho76xjYXqSXMNccFSx2lgqOG/1TBPW0yPx1bJZk94qu3tX0fycJeeQsKovA8gg==", + "dev": true, + "optional": true + }, + "@esbuild/linux-arm": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/linux-arm/-/linux-arm-0.19.12.tgz", + "integrity": "sha512-J5jPms//KhSNv+LO1S1TX1UWp1ucM6N6XuL6ITdKWElCu8wXP72l9MM0zDTzzeikVyqFE6U8YAV9/tFyj0ti+w==", + "dev": true, + "optional": true + }, + "@esbuild/linux-arm64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/linux-arm64/-/linux-arm64-0.19.12.tgz", + "integrity": "sha512-EoTjyYyLuVPfdPLsGVVVC8a0p1BFFvtpQDB/YLEhaXyf/5bczaGeN15QkR+O4S5LeJ92Tqotve7i1jn35qwvdA==", + "dev": true, + "optional": true + }, + "@esbuild/linux-ia32": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/linux-ia32/-/linux-ia32-0.19.12.tgz", + "integrity": "sha512-Thsa42rrP1+UIGaWz47uydHSBOgTUnwBwNq59khgIwktK6x60Hivfbux9iNR0eHCHzOLjLMLfUMLCypBkZXMHA==", + "dev": true, + "optional": true + }, + "@esbuild/linux-loong64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/linux-loong64/-/linux-loong64-0.19.12.tgz", + "integrity": "sha512-LiXdXA0s3IqRRjm6rV6XaWATScKAXjI4R4LoDlvO7+yQqFdlr1Bax62sRwkVvRIrwXxvtYEHHI4dm50jAXkuAA==", + "dev": true, + "optional": true + }, + "@esbuild/linux-mips64el": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/linux-mips64el/-/linux-mips64el-0.19.12.tgz", + "integrity": "sha512-fEnAuj5VGTanfJ07ff0gOA6IPsvrVHLVb6Lyd1g2/ed67oU1eFzL0r9WL7ZzscD+/N6i3dWumGE1Un4f7Amf+w==", + "dev": true, + "optional": true + }, + "@esbuild/linux-ppc64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/linux-ppc64/-/linux-ppc64-0.19.12.tgz", + "integrity": "sha512-nYJA2/QPimDQOh1rKWedNOe3Gfc8PabU7HT3iXWtNUbRzXS9+vgB0Fjaqr//XNbd82mCxHzik2qotuI89cfixg==", + "dev": true, + "optional": true + }, + "@esbuild/linux-riscv64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/linux-riscv64/-/linux-riscv64-0.19.12.tgz", + "integrity": "sha512-2MueBrlPQCw5dVJJpQdUYgeqIzDQgw3QtiAHUC4RBz9FXPrskyyU3VI1hw7C0BSKB9OduwSJ79FTCqtGMWqJHg==", + "dev": true, + "optional": true + }, + "@esbuild/linux-s390x": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/linux-s390x/-/linux-s390x-0.19.12.tgz", + "integrity": "sha512-+Pil1Nv3Umes4m3AZKqA2anfhJiVmNCYkPchwFJNEJN5QxmTs1uzyy4TvmDrCRNT2ApwSari7ZIgrPeUx4UZDg==", + "dev": true, + "optional": true + }, + "@esbuild/linux-x64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/linux-x64/-/linux-x64-0.19.12.tgz", + "integrity": "sha512-B71g1QpxfwBvNrfyJdVDexenDIt1CiDN1TIXLbhOw0KhJzE78KIFGX6OJ9MrtC0oOqMWf+0xop4qEU8JrJTwCg==", + "dev": true, + "optional": true + }, + "@esbuild/netbsd-x64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/netbsd-x64/-/netbsd-x64-0.19.12.tgz", + "integrity": "sha512-3ltjQ7n1owJgFbuC61Oj++XhtzmymoCihNFgT84UAmJnxJfm4sYCiSLTXZtE00VWYpPMYc+ZQmB6xbSdVh0JWA==", + "dev": true, + "optional": true + }, + "@esbuild/openbsd-x64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/openbsd-x64/-/openbsd-x64-0.19.12.tgz", + "integrity": "sha512-RbrfTB9SWsr0kWmb9srfF+L933uMDdu9BIzdA7os2t0TXhCRjrQyCeOt6wVxr79CKD4c+p+YhCj31HBkYcXebw==", + "dev": true, + "optional": true }, - "@csstools/postcss-unset-value": { - "version": "1.0.2", - "resolved": "https://registry.npmjs.org/@csstools/postcss-unset-value/-/postcss-unset-value-1.0.2.tgz", - "integrity": "sha512-c8J4roPBILnelAsdLr4XOAR/GsTm0GJi4XpcfvoWk3U6KiTCqiFYc63KhRMQQX35jYMp4Ao8Ij9+IZRgMfJp1g==", - "requires": {} + "@esbuild/sunos-x64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/sunos-x64/-/sunos-x64-0.19.12.tgz", + "integrity": "sha512-HKjJwRrW8uWtCQnQOz9qcU3mUZhTUQvi56Q8DPTLLB+DawoiQdjsYq+j+D3s9I8VFtDr+F9CjgXKKC4ss89IeA==", + "dev": true, + "optional": true }, - "@csstools/selector-specificity": { - "version": "2.0.2", - "resolved": "https://registry.npmjs.org/@csstools/selector-specificity/-/selector-specificity-2.0.2.tgz", - "integrity": "sha512-IkpVW/ehM1hWKln4fCA3NzJU8KwD+kIOvPZA4cqxoJHtE21CCzjyp+Kxbu0i5I4tBNOlXPL9mjwnWlL0VEG4Fg==", - "requires": {} + "@esbuild/win32-arm64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/win32-arm64/-/win32-arm64-0.19.12.tgz", + "integrity": "sha512-URgtR1dJnmGvX864pn1B2YUYNzjmXkuJOIqG2HdU62MVS4EHpU2946OZoTMnRUHklGtJdJZ33QfzdjGACXhn1A==", + "dev": true, + "optional": true + }, + "@esbuild/win32-ia32": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/win32-ia32/-/win32-ia32-0.19.12.tgz", + "integrity": "sha512-+ZOE6pUkMOJfmxmBZElNOx72NKpIa/HFOMGzu8fqzQJ5kgf6aTGrcJaFsNiVMH4JKpMipyK+7k0n2UXN7a8YKQ==", + "dev": true, + "optional": true + }, + "@esbuild/win32-x64": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/@esbuild/win32-x64/-/win32-x64-0.19.12.tgz", + "integrity": "sha512-T1QyPSDCyMXaO3pzBkF96E8xMkiRYbUEZADd29SyPGabqxMViNoii+NcK7eWJAEoU6RZyEm5lVSIjTmcdoB9HA==", + "dev": true, + "optional": true }, "@eslint/eslintrc": { "version": "1.4.1", @@ -19692,11 +20707,78 @@ } }, "@grpc/grpc-js": { - "version": "1.3.2", - "resolved": "https://registry.npmjs.org/@grpc/grpc-js/-/grpc-js-1.3.2.tgz", - "integrity": "sha512-UXepkOKCATJrhHGsxt+CGfpZy9zUn1q9mop5kfcXq1fBkTePxVNPOdnISlCbJFlCtld+pSLGyZCzr9/zVprFKA==", + "version": "1.12.0", + "resolved": "https://registry.npmjs.org/@grpc/grpc-js/-/grpc-js-1.12.0.tgz", + "integrity": "sha512-eWdP97A6xKtZXVP/ze9y8zYRB2t6ugQAuLXFuZXAsyqmyltaAjl4yPkmIfc0wuTFJMOUF1AdvIFQCL7fMtaX6g==", "requires": { - "@types/node": ">=12.12.47" + "@grpc/proto-loader": "^0.7.13", + "@js-sdsl/ordered-map": "^4.4.2" + }, + "dependencies": { + "@grpc/proto-loader": { + "version": "0.7.13", + "resolved": "https://registry.npmjs.org/@grpc/proto-loader/-/proto-loader-0.7.13.tgz", + "integrity": "sha512-AiXO/bfe9bmxBjxxtYxFAXGZvMaN5s8kO+jBHAJCON8rJoB5YS/D6X7ZNc6XQkuHNmyl4CYaMI1fJ/Gn27RGGw==", + "requires": { + "lodash.camelcase": "^4.3.0", + "long": "^5.0.0", + "protobufjs": "^7.2.5", + "yargs": "^17.7.2" + } + }, + "cliui": { + "version": "8.0.1", + "resolved": "https://registry.npmjs.org/cliui/-/cliui-8.0.1.tgz", + "integrity": "sha512-BSeNnyus75C4//NQ9gQt1/csTXyo/8Sb+afLAkzAptFuMsod9HFokGNudZpi/oQV73hnVK+sR+5PVRMd+Dr7YQ==", + "requires": { + "string-width": "^4.2.0", + "strip-ansi": "^6.0.1", + "wrap-ansi": "^7.0.0" + } + }, + "long": { + "version": "5.2.3", + "resolved": "https://registry.npmjs.org/long/-/long-5.2.3.tgz", + "integrity": "sha512-lcHwpNoggQTObv5apGNCTdJrO69eHOZMi4BNC+rTLER8iHAqGrUVeLh/irVIM7zTw2bOXA8T6uNPeujwOLg/2Q==" + }, + "protobufjs": { + "version": "7.4.0", + "resolved": "https://registry.npmjs.org/protobufjs/-/protobufjs-7.4.0.tgz", + "integrity": "sha512-mRUWCc3KUU4w1jU8sGxICXH/gNS94DvI1gxqDvBzhj1JpcsimQkYiOJfwsPUykUI5ZaspFbSgmBLER8IrQ3tqw==", + "requires": { + "@protobufjs/aspromise": "^1.1.2", + "@protobufjs/base64": "^1.1.2", + "@protobufjs/codegen": "^2.0.4", + "@protobufjs/eventemitter": "^1.1.0", + "@protobufjs/fetch": "^1.1.0", + "@protobufjs/float": "^1.0.2", + "@protobufjs/inquire": "^1.1.0", + "@protobufjs/path": "^1.1.2", + "@protobufjs/pool": "^1.1.0", + "@protobufjs/utf8": "^1.1.0", + "@types/node": ">=13.7.0", + "long": "^5.0.0" + } + }, + "yargs": { + "version": "17.7.2", + "resolved": "https://registry.npmjs.org/yargs/-/yargs-17.7.2.tgz", + "integrity": "sha512-7dSzzRQ++CKnNI/krKnYRV7JKKPUXMEh61soaHKg9mrWEhzFWhFnxPxGl+69cD1Ou63C13NUPCnmIcrvqCuM6w==", + "requires": { + "cliui": "^8.0.1", + "escalade": "^3.1.1", + "get-caller-file": "^2.0.5", + "require-directory": "^2.1.1", + "string-width": "^4.2.3", + "y18n": "^5.0.5", + "yargs-parser": "^21.1.1" + } + }, + "yargs-parser": { + "version": "21.1.1", + "resolved": "https://registry.npmjs.org/yargs-parser/-/yargs-parser-21.1.1.tgz", + "integrity": "sha512-tVpsJW7DdjecAiFpbIB1e3qxIQsE6NoPc5/eTdrbbIC4h0LVsWhnoa3g+m2HclBIujHzsxZ4VJVA+GUuc2/LBw==" + } } }, "@grpc/proto-loader": { @@ -20257,6 +21339,11 @@ "@jridgewell/sourcemap-codec": "1.4.14" } }, + "@js-sdsl/ordered-map": { + "version": "4.4.2", + "resolved": "https://registry.npmjs.org/@js-sdsl/ordered-map/-/ordered-map-4.4.2.tgz", + "integrity": "sha512-iUKgm52T8HOE/makSxjqoWhe95ZJA1/G1sYsGev2JDKUSS14KAgg1LHb+Ba+IPow0xflbnSkOsZcO08C7w1gYw==" + }, "@leichtgewicht/ip-codec": { "version": "2.0.4", "resolved": "https://registry.npmjs.org/@leichtgewicht/ip-codec/-/ip-codec-2.0.4.tgz", @@ -20396,6 +21483,28 @@ "resolved": "https://registry.npmjs.org/@protobufjs/utf8/-/utf8-1.1.0.tgz", "integrity": "sha1-p3c2C1s5oaLlEG+OhY8v0tBgxXA=" }, + "@pyodide/webpack-plugin": { + "version": "1.3.2", + "resolved": "https://registry.npmjs.org/@pyodide/webpack-plugin/-/webpack-plugin-1.3.2.tgz", + "integrity": "sha512-Kz6GRcgBO/xounBCVD9aztxqcO+BVFPh8zp6rcQIH0xoKPjG8s38AJJdSC2Ai8yhFCaYPGAP3NcT7qMlO44+VQ==", + "dev": true, + "requires": { + "acorn-walk": "^8.2.0", + "copy-webpack-plugin": "^11.0.0", + "esbuild": "^0.19.5" + }, + "dependencies": { + "acorn-walk": { + "version": "8.3.3", + "resolved": "https://registry.npmjs.org/acorn-walk/-/acorn-walk-8.3.3.tgz", + "integrity": "sha512-MxXdReSRhGO7VlFe1bRG/oI7/mdLV9B9JJT0N8vZOhF7gFRR5l3M8W9G8JxmKV+JC5mGqJ0QvqfSOLsCPa4nUw==", + "dev": true, + "requires": { + "acorn": "^8.11.0" + } + } + } + }, "@rollup/plugin-babel": { "version": "5.3.1", "resolved": "https://registry.npmjs.org/@rollup/plugin-babel/-/plugin-babel-5.3.1.tgz", @@ -20449,51 +21558,106 @@ "resolved": "https://registry.npmjs.org/@rushstack/eslint-patch/-/eslint-patch-1.2.0.tgz", "integrity": "sha512-sXo/qW2/pAcmT43VoRKOJbDOfV3cYpq3szSVfIThQXNt+E4DfKj361vaAt3c88U5tPUxzEswam7GW48PJqtKAg==" }, + "@sentry-internal/feedback": { + "version": "7.119.1", + "resolved": "https://registry.npmjs.org/@sentry-internal/feedback/-/feedback-7.119.1.tgz", + "integrity": "sha512-EPyW6EKZmhKpw/OQUPRkTynXecZdYl4uhZwdZuGqnGMAzswPOgQvFrkwsOuPYvoMfXqCH7YuRqyJrox3uBOrTA==", + "requires": { + "@sentry/core": "7.119.1", + "@sentry/types": "7.119.1", + "@sentry/utils": "7.119.1" + } + }, + "@sentry-internal/replay-canvas": { + "version": "7.119.1", + "resolved": "https://registry.npmjs.org/@sentry-internal/replay-canvas/-/replay-canvas-7.119.1.tgz", + "integrity": "sha512-O/lrzENbMhP/UDr7LwmfOWTjD9PLNmdaCF408Wx8SDuj7Iwc+VasGfHg7fPH4Pdr4nJON6oh+UqoV4IoG05u+A==", + "requires": { + "@sentry/core": "7.119.1", + "@sentry/replay": "7.119.1", + "@sentry/types": "7.119.1", + "@sentry/utils": "7.119.1" + } + }, + "@sentry-internal/tracing": { + "version": "7.119.1", + "resolved": "https://registry.npmjs.org/@sentry-internal/tracing/-/tracing-7.119.1.tgz", + "integrity": "sha512-cI0YraPd6qBwvUA3wQdPGTy8PzAoK0NZiaTN1LM3IczdPegehWOaEG5GVTnpGnTsmBAzn1xnBXNBhgiU4dgcrQ==", + "requires": { + "@sentry/core": "7.119.1", + "@sentry/types": "7.119.1", + "@sentry/utils": "7.119.1" + } + }, "@sentry/browser": { - "version": "7.16.0", - "resolved": "https://registry.npmjs.org/@sentry/browser/-/browser-7.16.0.tgz", - "integrity": "sha512-tJ063zvoF8Raw7mzQEXupOFPSN6v36WIbsDVGeFdToPCwViaBuATaxvWCrudGzsnBkMyItmTLJkzn9SEIXUOiw==", + "version": "7.119.1", + "resolved": "https://registry.npmjs.org/@sentry/browser/-/browser-7.119.1.tgz", + "integrity": "sha512-aMwAnFU4iAPeLyZvqmOQaEDHt/Dkf8rpgYeJ0OEi50dmP6AjG+KIAMCXU7CYCCQDn70ITJo8QD5+KzCoZPYz0A==", "requires": { - "@sentry/core": "7.16.0", - "@sentry/types": "7.16.0", - "@sentry/utils": "7.16.0", - "tslib": "^1.9.3" + "@sentry-internal/feedback": "7.119.1", + "@sentry-internal/replay-canvas": "7.119.1", + "@sentry-internal/tracing": "7.119.1", + "@sentry/core": "7.119.1", + "@sentry/integrations": "7.119.1", + "@sentry/replay": "7.119.1", + "@sentry/types": "7.119.1", + "@sentry/utils": "7.119.1" } }, "@sentry/core": { - "version": "7.16.0", - "resolved": "https://registry.npmjs.org/@sentry/core/-/core-7.16.0.tgz", - "integrity": "sha512-vq6H1b/IPTvzDD9coQ3wIudvSjkAYuUlXb1dv69dRlq4v3st9dcKBps1Zf0lQ1i4TVlDLoe1iGMmNFglMF1Q5w==", + "version": "7.119.1", + "resolved": "https://registry.npmjs.org/@sentry/core/-/core-7.119.1.tgz", + "integrity": "sha512-YUNnH7O7paVd+UmpArWCPH4Phlb5LwrkWVqzFWqL3xPyCcTSof2RL8UmvpkTjgYJjJ+NDfq5mPFkqv3aOEn5Sw==", + "requires": { + "@sentry/types": "7.119.1", + "@sentry/utils": "7.119.1" + } + }, + "@sentry/integrations": { + "version": "7.119.1", + "resolved": "https://registry.npmjs.org/@sentry/integrations/-/integrations-7.119.1.tgz", + "integrity": "sha512-CGmLEPnaBqbUleVqrmGYjRjf5/OwjUXo57I9t0KKWViq81mWnYhaUhRZWFNoCNQHns+3+GPCOMvl0zlawt+evw==", "requires": { - "@sentry/types": "7.16.0", - "@sentry/utils": "7.16.0", - "tslib": "^1.9.3" + "@sentry/core": "7.119.1", + "@sentry/types": "7.119.1", + "@sentry/utils": "7.119.1", + "localforage": "^1.8.1" } }, "@sentry/react": { - "version": "7.16.0", - "resolved": "https://registry.npmjs.org/@sentry/react/-/react-7.16.0.tgz", - "integrity": "sha512-tJH5zO4MPopzqZgi7Yd4iIB9Am5uGVefgkHaoeCGXffveEVWqEdjj8TqPL36SBb76gCmtpa01NBDsUSDZ1w/yw==", + "version": "7.119.1", + "resolved": "https://registry.npmjs.org/@sentry/react/-/react-7.119.1.tgz", + "integrity": "sha512-Bri314LnSVm16K3JATgn3Zsq6Uj3M/nIjdUb3nggBw0BMlFWMsyFjUCfmCio5d80KJK/lUjOIxRjzu79M6jOzQ==", "requires": { - "@sentry/browser": "7.16.0", - "@sentry/types": "7.16.0", - "@sentry/utils": "7.16.0", - "hoist-non-react-statics": "^3.3.2", - "tslib": "^1.9.3" + "@sentry/browser": "7.119.1", + "@sentry/core": "7.119.1", + "@sentry/types": "7.119.1", + "@sentry/utils": "7.119.1", + "hoist-non-react-statics": "^3.3.2" + } + }, + "@sentry/replay": { + "version": "7.119.1", + "resolved": "https://registry.npmjs.org/@sentry/replay/-/replay-7.119.1.tgz", + "integrity": "sha512-4da+ruMEipuAZf35Ybt2StBdV1S+oJbSVccGpnl9w6RoeQoloT4ztR6ML3UcFDTXeTPT1FnHWDCyOfST0O7XMw==", + "requires": { + "@sentry-internal/tracing": "7.119.1", + "@sentry/core": "7.119.1", + "@sentry/types": "7.119.1", + "@sentry/utils": "7.119.1" } }, "@sentry/types": { - "version": "7.16.0", - "resolved": "https://registry.npmjs.org/@sentry/types/-/types-7.16.0.tgz", - "integrity": "sha512-i6D+OK6d0l/k+VQvRp/Pt21WkDEgVBUIZq+sOkEZJczbcfexVdXKeXXoYTD2vYuFq8Yy28fzlsZaKI+NoH94yQ==" + "version": "7.119.1", + "resolved": "https://registry.npmjs.org/@sentry/types/-/types-7.119.1.tgz", + "integrity": "sha512-4G2mcZNnYzK3pa2PuTq+M2GcwBRY/yy1rF+HfZU+LAPZr98nzq2X3+mJHNJoobeHRkvVh7YZMPi4ogXiIS5VNQ==" }, "@sentry/utils": { - "version": "7.16.0", - "resolved": "https://registry.npmjs.org/@sentry/utils/-/utils-7.16.0.tgz", - "integrity": "sha512-3Zh1txg7IRp4kZAdG27YF7K6lD1IZyuAo9KjoPg1Xzqa4DOZyASJuEkbf+rK2a9T4HrtVHHXJUsNbKg8WM3VHg==", + "version": "7.119.1", + "resolved": "https://registry.npmjs.org/@sentry/utils/-/utils-7.119.1.tgz", + "integrity": "sha512-ju/Cvyeu/vkfC5/XBV30UNet5kLEicZmXSyuLwZu95hEbL+foPdxN+re7pCI/eNqfe3B2vz7lvz5afLVOlQ2Hg==", "requires": { - "@sentry/types": "7.16.0", - "tslib": "^1.9.3" + "@sentry/types": "7.119.1" } }, "@sinclair/typebox": { @@ -20796,9 +21960,9 @@ "integrity": "sha512-oh/6byDPnL1zeNXFrDXFLyZjkr1MsBG667IM792caf1L2UPOOMf65NFzjUH/ltyfwjAGfs1rsX1eftK0jC/KIg==" }, "@types/http-proxy": { - "version": "1.17.9", - "resolved": "https://registry.npmjs.org/@types/http-proxy/-/http-proxy-1.17.9.tgz", - "integrity": "sha512-QsbSjA/fSk7xB+UXlCT3wHBy5ai9wOcNDWwZAtud+jXhwOM3l+EYZh8Lng4+/6n8uar0J7xILzqftJdJ/Wdfkw==", + "version": "1.17.16", + "resolved": "https://registry.npmjs.org/@types/http-proxy/-/http-proxy-1.17.16.tgz", + "integrity": "sha512-sdWoUajOB1cd0A8cRRQ1cfyWNbmFKLAqBB89Y8x5iYyG/mkJHc0YUH8pdWBy2omi9qtCpiIgGjuwO0dQST2l5w==", "requires": { "@types/node": "*" } @@ -21223,9 +22387,9 @@ "integrity": "sha512-NBOQlm9+7RBqRqZwimpgquaLeTJFayqb9UEPtTkpC3TkkwDnlsT/TwsCC0svjt9kEZ6G9mH5AEOHSz6Q/HrzQQ==" }, "acorn": { - "version": "8.8.1", - "resolved": "https://registry.npmjs.org/acorn/-/acorn-8.8.1.tgz", - "integrity": "sha512-7zFpHzhnqYKrkYdUjF1HI1bzd0VygEGX8lFk4k5zVMqHEoES+P+7TKI+EvLO9WVMJ8eekdO0aDEK044xTXwPPA==" + "version": "8.12.1", + "resolved": "https://registry.npmjs.org/acorn/-/acorn-8.12.1.tgz", + "integrity": "sha512-tcpGyI9zbizT9JbV6oYE477V6mTlXvvi0T0G3SNIYE2apm/G5huBa1+K89VGeovbg+jycCrfhl3ADxErOuO6Jg==" }, "acorn-globals": { "version": "6.0.0", @@ -21521,22 +22685,24 @@ "integrity": "sha512-b1WlTV8+XKLj9gZy2DZXgQiyDp9xkkoe2a6U6UbYccScq2wgH/YwCeI2/Jq2mgo0HzQxqJOjWZBLeA/mqsk5Mg==" }, "axios": { - "version": "1.6.0", - "resolved": "https://registry.npmjs.org/axios/-/axios-1.6.0.tgz", - "integrity": "sha512-EZ1DYihju9pwVB+jg67ogm+Tmqc6JmhamRN6I4Zt8DfZu5lbcQGw3ozH9lFejSJgs/ibaef3A9PMXPLeefFGJg==", + "version": "1.12.0", + "resolved": "https://registry.npmjs.org/axios/-/axios-1.12.0.tgz", + "integrity": "sha512-oXTDccv8PcfjZmPGlWsPSwtOJCZ/b6W5jAMCNcfwJbCzDckwG0jrYJFaWH1yvivfCXjVzV/SPDEhMB3Q+DSurg==", "requires": { - "follow-redirects": "^1.15.0", - "form-data": "^4.0.0", + "follow-redirects": "^1.15.6", + "form-data": "^4.0.4", "proxy-from-env": "^1.1.0" }, "dependencies": { "form-data": { - "version": "4.0.0", - "resolved": "https://registry.npmjs.org/form-data/-/form-data-4.0.0.tgz", - "integrity": "sha512-ETEklSGi5t0QMZuiXoA/Q6vcnxcLQP5vdugSpuAyi6SVGi2clPPp+xgEhuMaHC+zGgn31Kd235W35f7Hykkaww==", + "version": "4.0.4", + "resolved": "https://registry.npmjs.org/form-data/-/form-data-4.0.4.tgz", + "integrity": "sha512-KrGhL9Q4zjj0kiUt5OO4Mr/A/jlI2jDYs5eHBpYHPcBEVSiipAvn2Ko2HnPe20rmcuuvMHNdZFp+4IlGTMF0Ow==", "requires": { "asynckit": "^0.4.0", "combined-stream": "^1.0.8", + "es-set-tostringtag": "^2.1.0", + "hasown": "^2.0.2", "mime-types": "^2.1.12" } } @@ -21764,11 +22930,6 @@ "resolved": "https://registry.npmjs.org/balanced-match/-/balanced-match-1.0.2.tgz", "integrity": "sha512-3oSeUO0TMV67hN1AmbXsK4yaqU7tjiHlbxRDZOpH0KW9+CeX4bRAaX0Anxt0tx2MrpRpWwQaPwIlISEJhYU5Pw==" }, - "base-64": { - "version": "1.0.0", - "resolved": "https://registry.npmjs.org/base-64/-/base-64-1.0.0.tgz", - "integrity": "sha512-kwDPIFCGx0NZHog36dj+tHiwP4QMzsZ3AgMViUBKI0+V5n4U0ufTCUMhnQ04diaRI8EX/QcPfql7zlhZ7j4zgg==" - }, "batch": { "version": "0.6.1", "resolved": "https://registry.npmjs.org/batch/-/batch-0.6.1.tgz", @@ -21801,9 +22962,9 @@ "integrity": "sha512-XpNj6GDQzdfW+r2Wnn7xiSAd7TM3jzkxGXBGTtWKuSXv1xUV+azxAm8jdWZN06QTQk+2N2XB9jRDkvbmQmcRtg==" }, "body-parser": { - "version": "1.20.2", - "resolved": "https://registry.npmjs.org/body-parser/-/body-parser-1.20.2.tgz", - "integrity": "sha512-ml9pReCu3M61kGlqoTm2umSXTlRTuGTx0bfYj+uIUKKYycG5NtSbeetV3faSU6R7ajOPw0g/J1PvK4qNy7s5bA==", + "version": "1.20.3", + "resolved": "https://registry.npmjs.org/body-parser/-/body-parser-1.20.3.tgz", + "integrity": "sha512-7rAxByjUMqQ3/bHJy7D6OGXvx/MMc4IqBn/X0fcM1QUcAItpZrBEYhWGem+tzXH90c+G01ypMcYJBO9Y30203g==", "requires": { "bytes": "3.1.2", "content-type": "~1.0.5", @@ -21813,17 +22974,12 @@ "http-errors": "2.0.0", "iconv-lite": "0.4.24", "on-finished": "2.4.1", - "qs": "6.11.0", + "qs": "6.13.0", "raw-body": "2.5.2", "type-is": "~1.6.18", "unpipe": "1.0.0" }, "dependencies": { - "bytes": { - "version": "3.1.2", - "resolved": "https://registry.npmjs.org/bytes/-/bytes-3.1.2.tgz", - "integrity": "sha512-/Nf7TyzTx6S3yRJObOAV7956r8cr2+Oj8AC5dt8wSP3BQAoeX58NoHyCU8P8zGkNXStjTSi6fzO6F0pBdcYbEg==" - }, "debug": { "version": "2.6.9", "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz", @@ -21864,20 +23020,20 @@ "integrity": "sha512-JZOSA7Mo9sNGB8+UjSgzdLtokWAky1zbztM3WRLCbZ70/3cTANmQmOdR7y2g+J0e2WXywy1yS468tY+IruqEww==" }, "brace-expansion": { - "version": "1.1.11", - "resolved": "https://registry.npmjs.org/brace-expansion/-/brace-expansion-1.1.11.tgz", - "integrity": "sha512-iCuPHDFgrHX7H2vEI/5xpz07zSHB00TpugqhmYtVmMO6518mCuRMoOYFldEBl0g187ufozdaHgWKcYFb61qGiA==", + "version": "1.1.12", + "resolved": "https://registry.npmjs.org/brace-expansion/-/brace-expansion-1.1.12.tgz", + "integrity": "sha512-9T9UjW3r0UW5c1Q7GTwllptXwhvYmEzFhzMfZ9H7FQWt+uZePjZPjBP/W1ZEyZ1twGWom5/56TF4lPcqjnDHcg==", "requires": { "balanced-match": "^1.0.0", "concat-map": "0.0.1" } }, "braces": { - "version": "3.0.2", - "resolved": "https://registry.npmjs.org/braces/-/braces-3.0.2.tgz", - "integrity": "sha512-b8um+L1RzM3WDSzvhm6gIz1yfTbBt6YTlcEKAvsmqCZZFw46z626lVj9j1yEPW33H5H+lBQpZMP1k8l+78Ha0A==", + "version": "3.0.3", + "resolved": "https://registry.npmjs.org/braces/-/braces-3.0.3.tgz", + "integrity": "sha512-yQbXgO/OSZVD2IsiLlro+7Hf6Q18EJrKSEsdoMzKePKXct3gvD8oLcOQdIzGupr5Fj+EDe8gO/lxc1BzfMpxvA==", "requires": { - "fill-range": "^7.0.1" + "fill-range": "^7.1.1" } }, "browser-process-hrtime": { @@ -21915,17 +23071,29 @@ "integrity": "sha512-zhaCDicdLuWN5UbN5IMnFqNMhNfo919sH85y2/ea+5Yg9TsTkeZxpL+JLbp6cgYFS4sRLp3YV4S6yDuqVWHYOw==" }, "bytes": { - "version": "3.0.0", - "resolved": "https://registry.npmjs.org/bytes/-/bytes-3.0.0.tgz", - "integrity": "sha512-pMhOfFDPiv9t5jjIXkHosWmkSyQbvsgEVNkz0ERHbuLh2T/7j4Mqqpz523Fe8MVY89KC6Sh/QfS2sM+SjgFDcw==" + "version": "3.1.2", + "resolved": "https://registry.npmjs.org/bytes/-/bytes-3.1.2.tgz", + "integrity": "sha512-/Nf7TyzTx6S3yRJObOAV7956r8cr2+Oj8AC5dt8wSP3BQAoeX58NoHyCU8P8zGkNXStjTSi6fzO6F0pBdcYbEg==" }, "call-bind": { + "version": "1.0.7", + "resolved": "https://registry.npmjs.org/call-bind/-/call-bind-1.0.7.tgz", + "integrity": "sha512-GHTSNSYICQ7scH7sZ+M2rFopRoLh8t2bLSW6BbgrtLsahOIB5iyAVJf9GjWK3cYTDaMj4XdBpM1cA6pIS0Kv2w==", + "requires": { + "es-define-property": "^1.0.0", + "es-errors": "^1.3.0", + "function-bind": "^1.1.2", + "get-intrinsic": "^1.2.4", + "set-function-length": "^1.2.1" + } + }, + "call-bind-apply-helpers": { "version": "1.0.2", - "resolved": "https://registry.npmjs.org/call-bind/-/call-bind-1.0.2.tgz", - "integrity": "sha512-7O+FbCihrB5WGbFYesctwmTKae6rOiIzmz1icreWJ+0aA7LJfuqhEso2T9ncpcFtzMQtzXf2QGGueWJGTYsqrA==", + "resolved": "https://registry.npmjs.org/call-bind-apply-helpers/-/call-bind-apply-helpers-1.0.2.tgz", + "integrity": "sha512-Sp1ablJ0ivDkSzjcaJdxEunN5/XvksFJ2sMBFfq6x0ryhQV/2b/KwFe21cMpmHtPOSij8K99/wSfoEuTObmuMQ==", "requires": { - "function-bind": "^1.1.1", - "get-intrinsic": "^1.0.2" + "es-errors": "^1.3.0", + "function-bind": "^1.1.2" } }, "callsites": { @@ -22163,16 +23331,16 @@ } }, "compression": { - "version": "1.7.4", - "resolved": "https://registry.npmjs.org/compression/-/compression-1.7.4.tgz", - "integrity": "sha512-jaSIDzP9pZVS4ZfQ+TzvtiWhdpFhE2RDHz8QJkpX9SIpLq88VueF5jJw6t+6CUQcAoA6t+x89MLrWAqpfDE8iQ==", + "version": "1.8.1", + "resolved": "https://registry.npmjs.org/compression/-/compression-1.8.1.tgz", + "integrity": "sha512-9mAqGPHLakhCLeNyxPkK4xVo746zQ/czLH1Ky+vkitMnWfWZps8r0qXuwhwizagCRttsL4lfG4pIOvaWLpAP0w==", "requires": { - "accepts": "~1.3.5", - "bytes": "3.0.0", - "compressible": "~2.0.16", + "bytes": "3.1.2", + "compressible": "~2.0.18", "debug": "2.6.9", - "on-headers": "~1.0.2", - "safe-buffer": "5.1.2", + "negotiator": "~0.6.4", + "on-headers": "~1.1.0", + "safe-buffer": "5.2.1", "vary": "~1.1.2" }, "dependencies": { @@ -22188,6 +23356,16 @@ "version": "2.0.0", "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz", "integrity": "sha512-Tpp60P6IUJDTuOq/5Z8cdskzJujfwqfOTkrwIwj7IRISpnkJnT6SyJ4PCPnGMoFjC9ddhal5KVIYtAt97ix05A==" + }, + "negotiator": { + "version": "0.6.4", + "resolved": "https://registry.npmjs.org/negotiator/-/negotiator-0.6.4.tgz", + "integrity": "sha512-myRT3DiWPHqho5PrJaIRyaMv2kgYf0mUVgBNOYMuCH5Ki1yEiQaf/ZJuQ62nvpc44wL5WDbTX7yGJi1Neevw8w==" + }, + "safe-buffer": { + "version": "5.2.1", + "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.2.1.tgz", + "integrity": "sha512-rp3So07KcdmmKbGvgaNxQSJr7bGVSVk5S9Eq1F+ppbRo70+YeaDxkw5Dd8NPN+GD6bjnYm2VuPuCXmpuYvmCXQ==" } } }, @@ -22238,15 +23416,89 @@ "integrity": "sha512-ASFBup0Mz1uyiIjANan1jzLQami9z1PoYSZCiiYW2FczPbenXc45FZdBZLzOT+r6+iciuEModtmCti+hjaAk0A==" }, "cookie": { - "version": "0.6.0", - "resolved": "https://registry.npmjs.org/cookie/-/cookie-0.6.0.tgz", - "integrity": "sha512-U71cyTamuh1CRNCfpGY6to28lxvNwPG4Guz/EVjgf3Jmzv0vlDp1atT9eS5dDjMYHucpHbWns6Lwf3BKz6svdw==" + "version": "0.7.1", + "resolved": "https://registry.npmjs.org/cookie/-/cookie-0.7.1.tgz", + "integrity": "sha512-6DnInpx7SJ2AK3+CTUE/ZM0vWTUboZCegxhC2xiIydHR9jNuTAASBrfEpHhiGOZw/nX51bHt6YQl8jsGo4y/0w==" }, "cookie-signature": { "version": "1.0.6", "resolved": "https://registry.npmjs.org/cookie-signature/-/cookie-signature-1.0.6.tgz", "integrity": "sha512-QADzlaHc8icV8I7vbaJXJwod9HWYp8uCqf1xa4OfNu1T7JVxQIrUgOWtHdNDtPiywmFbiS12VjotIXLrKM3orQ==" }, + "copy-webpack-plugin": { + "version": "11.0.0", + "resolved": "https://registry.npmjs.org/copy-webpack-plugin/-/copy-webpack-plugin-11.0.0.tgz", + "integrity": "sha512-fX2MWpamkW0hZxMEg0+mYnA40LTosOSa5TqZ9GYIBzyJa9C3QUaMPSE2xAi/buNr8u89SfD9wHSQVBzrRa/SOQ==", + "dev": true, + "requires": { + "fast-glob": "^3.2.11", + "glob-parent": "^6.0.1", + "globby": "^13.1.1", + "normalize-path": "^3.0.0", + "schema-utils": "^4.0.0", + "serialize-javascript": "^6.0.0" + }, + "dependencies": { + "ajv": { + "version": "8.17.1", + "resolved": "https://registry.npmjs.org/ajv/-/ajv-8.17.1.tgz", + "integrity": "sha512-B/gBuNg5SiMTrPkC+A2+cW0RszwxYmn6VYxB/inlBStS5nx6xHIt/ehKRhIMhqusl7a8LjQoZnjCs5vhwxOQ1g==", + "dev": true, + "requires": { + "fast-deep-equal": "^3.1.3", + "fast-uri": "^3.0.1", + "json-schema-traverse": "^1.0.0", + "require-from-string": "^2.0.2" + } + }, + "ajv-keywords": { + "version": "5.1.0", + "resolved": "https://registry.npmjs.org/ajv-keywords/-/ajv-keywords-5.1.0.tgz", + "integrity": "sha512-YCS/JNFAUyr5vAuhk1DWm1CBxRHW9LbJ2ozWeemrIqpbsqKjHVxYPyi5GC0rjZIT5JxJ3virVTS8wk4i/Z+krw==", + "dev": true, + "requires": { + "fast-deep-equal": "^3.1.3" + } + }, + "globby": { + "version": "13.2.2", + "resolved": "https://registry.npmjs.org/globby/-/globby-13.2.2.tgz", + "integrity": "sha512-Y1zNGV+pzQdh7H39l9zgB4PJqjRNqydvdYCDG4HFXM4XuvSaQQlEc91IU1yALL8gUTDomgBAfz3XJdmUS+oo0w==", + "dev": true, + "requires": { + "dir-glob": "^3.0.1", + "fast-glob": "^3.3.0", + "ignore": "^5.2.4", + "merge2": "^1.4.1", + "slash": "^4.0.0" + } + }, + "json-schema-traverse": { + "version": "1.0.0", + "resolved": "https://registry.npmjs.org/json-schema-traverse/-/json-schema-traverse-1.0.0.tgz", + "integrity": "sha512-NM8/P9n3XjXhIZn1lLhkFaACTOURQXjWhV4BA/RnOv8xvgqtqpAX9IO4mRQxSx1Rlo4tqzeqb0sOlruaOy3dug==", + "dev": true + }, + "schema-utils": { + "version": "4.2.0", + "resolved": "https://registry.npmjs.org/schema-utils/-/schema-utils-4.2.0.tgz", + "integrity": "sha512-L0jRsrPpjdckP3oPug3/VxNKt2trR8TcabrM6FOAAlvC/9Phcmm+cuAgTlxBqdBR1WJx7Naj9WHw+aOmheSVbw==", + "dev": true, + "requires": { + "@types/json-schema": "^7.0.9", + "ajv": "^8.9.0", + "ajv-formats": "^2.1.1", + "ajv-keywords": "^5.1.0" + } + }, + "slash": { + "version": "4.0.0", + "resolved": "https://registry.npmjs.org/slash/-/slash-4.0.0.tgz", + "integrity": "sha512-3dOsAHXXUkQTpOYcoAxLIorMTp4gIQr5IW3iVb7A7lFIp0VHhnynm9izx6TssdrIcVIESAlVjtnO2K8bg+Coew==", + "dev": true + } + } + }, "core-js": { "version": "3.27.1", "resolved": "https://registry.npmjs.org/core-js/-/core-js-3.27.1.tgz", @@ -22261,9 +23513,9 @@ } }, "core-js-pure": { - "version": "3.27.1", - "resolved": "https://registry.npmjs.org/core-js-pure/-/core-js-pure-3.27.1.tgz", - "integrity": "sha512-BS2NHgwwUppfeoqOXqi08mUqS5FiZpuRuJJpKsaME7kJz0xxuk0xkhDdfMIlP/zLa80krBqss1LtD7f889heAw==" + "version": "3.43.0", + "resolved": "https://registry.npmjs.org/core-js-pure/-/core-js-pure-3.43.0.tgz", + "integrity": "sha512-i/AgxU2+A+BbJdMxh3v7/vxi2SbFqxiFmg6VsDwYB4jkucrd1BZNA9a9gphC0fYMG5IBSgQcbQnk865VCLe7xA==" }, "core-util-is": { "version": "1.0.3", @@ -22297,9 +23549,9 @@ "integrity": "sha512-dcKFX3jn0MpIaXjisoRvexIJVEKzaq7z2rZKxf+MSr9TkdmHmsU4m2lcLojrj/FHl8mk5VxMmYA+ftRkP/3oKQ==" }, "cross-spawn": { - "version": "7.0.3", - "resolved": "https://registry.npmjs.org/cross-spawn/-/cross-spawn-7.0.3.tgz", - "integrity": "sha512-iRDPJKUPVEND7dHPO8rkbOnPpyDygcDFtWjpeWNCgy8WP2rXcxXL8TskReQl6OrB2G7+UJrags1q15Fudc7G6w==", + "version": "7.0.6", + "resolved": "https://registry.npmjs.org/cross-spawn/-/cross-spawn-7.0.6.tgz", + "integrity": "sha512-uV2QOWP2nWzsy2aMp8aRibhi9dlzF5Hgh5SHaB9OiTGEyDTiJJyx0uy51QXdyWbtAHNua4XJzUKca3OzKUd3vA==", "requires": { "path-key": "^3.1.0", "shebang-command": "^2.0.0", @@ -22565,11 +23817,11 @@ } }, "debug": { - "version": "4.3.4", - "resolved": "https://registry.npmjs.org/debug/-/debug-4.3.4.tgz", - "integrity": "sha512-PRWFHuSU3eDtQJPvnNY7Jcket1j0t5OuOsFzPPzsekD52Zl8qUfFIPEiswXqIvHWGVHOgX+7G/vCNNhehwxfkQ==", + "version": "4.4.1", + "resolved": "https://registry.npmjs.org/debug/-/debug-4.4.1.tgz", + "integrity": "sha512-KcKCqiftBJcZr++7ykoDIEwSa3XWowTfNPo92BYxjXiyYEVrUQh2aLyhxBCwww+heortUFxEJYcRzosstTEBYQ==", "requires": { - "ms": "2.1.2" + "ms": "^2.1.3" } }, "decimal.js": { @@ -22613,6 +23865,16 @@ "clone": "^1.0.2" } }, + "define-data-property": { + "version": "1.1.4", + "resolved": "https://registry.npmjs.org/define-data-property/-/define-data-property-1.1.4.tgz", + "integrity": "sha512-rBMvIzlpA8v6E+SJZoo++HAYqsLrkg7MSfIinMPFhmkorw7X+dOXVJQs+QT69zGkzMyfDnIMN2Wid1+NbL3T+A==", + "requires": { + "es-define-property": "^1.0.0", + "es-errors": "^1.3.0", + "gopd": "^1.0.1" + } + }, "define-lazy-prop": { "version": "2.0.0", "resolved": "https://registry.npmjs.org/define-lazy-prop/-/define-lazy-prop-2.0.0.tgz", @@ -22842,6 +24104,16 @@ "resolved": "https://registry.npmjs.org/dotenv-expand/-/dotenv-expand-5.1.0.tgz", "integrity": "sha512-YXQl1DSa4/PQyRfgrv6aoNjhasp/p4qs9FjJ4q4cQk+8m4r6k4ZSiEyytKG8f8W9gi8WsQtIObNmKd+tMzNTmA==" }, + "dunder-proto": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/dunder-proto/-/dunder-proto-1.0.1.tgz", + "integrity": "sha512-KIN/nDJBQRcXw0MLVhZE9iQHmG68qAVIBg9CqmUYjmQIhgij9U5MFvrqkUL5FbtyyzZuOeOt0zdeRe4UY7ct+A==", + "requires": { + "call-bind-apply-helpers": "^1.0.1", + "es-errors": "^1.3.0", + "gopd": "^1.2.0" + } + }, "duplexer": { "version": "0.1.2", "resolved": "https://registry.npmjs.org/duplexer/-/duplexer-0.1.2.tgz", @@ -22881,9 +24153,9 @@ "integrity": "sha512-/kyM18EfinwXZbno9FyUGeFh87KC8HRQBQGildHZbEuRyWFOmv1U10o9BBp8XVZDVNNuQKyIGIu5ZYAAXJ0V2Q==" }, "encodeurl": { - "version": "1.0.2", - "resolved": "https://registry.npmjs.org/encodeurl/-/encodeurl-1.0.2.tgz", - "integrity": "sha512-TPJXq8JqFaVYm2CWmPvnP2Iyo4ZSM7/QKcSmuMLDObfpH5fi7RUGmd/rTDf+rut/saiDiQEeVTNgAmJEdAOx0w==" + "version": "2.0.0", + "resolved": "https://registry.npmjs.org/encodeurl/-/encodeurl-2.0.0.tgz", + "integrity": "sha512-Q0n9HRi4m6JuGIV1eFlmvJB7ZEVxu93IrMyiMsGC0lrMJMWzRgx6WGquyfQgZVb31vhGgXnfmPNNXmxnOkRBrg==" }, "enhanced-resolve": { "version": "5.12.0", @@ -22959,19 +24231,38 @@ "resolved": "https://registry.npmjs.org/es-array-method-boxes-properly/-/es-array-method-boxes-properly-1.0.0.tgz", "integrity": "sha512-wd6JXUmyHmt8T5a2xreUwKcGPq6f1f+WwIJkijUqiGcJz1qqnZgP6XIK+QyIWU5lT7imeNxUll48bziG+TSYcA==" }, + "es-define-property": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/es-define-property/-/es-define-property-1.0.1.tgz", + "integrity": "sha512-e3nRfgfUZ4rNGL232gUgX06QNyyez04KdjFrF+LTRoOXmrOgFKDg4BCdsjW8EnT69eqdYGmRpJwiPVYNrCaW3g==" + }, + "es-errors": { + "version": "1.3.0", + "resolved": "https://registry.npmjs.org/es-errors/-/es-errors-1.3.0.tgz", + "integrity": "sha512-Zf5H2Kxt2xjTvbJvP2ZWLEICxA6j+hAmMzIlypy4xcBg1vKVnx89Wy0GbS+kf5cwCVFFzdCFh2XSCFNULS6csw==" + }, "es-module-lexer": { "version": "0.9.3", "resolved": "https://registry.npmjs.org/es-module-lexer/-/es-module-lexer-0.9.3.tgz", "integrity": "sha512-1HQ2M2sPtxwnvOvT1ZClHyQDiggdNjURWpY2we6aMKCQiUVxTmVs2UYPLIrD84sS+kMdUwfBSylbJPwNnBrnHQ==" }, + "es-object-atoms": { + "version": "1.1.1", + "resolved": "https://registry.npmjs.org/es-object-atoms/-/es-object-atoms-1.1.1.tgz", + "integrity": "sha512-FGgH2h8zKNim9ljj7dankFPcICIK9Cp5bm+c2gQSYePhpaG5+esrLODihIorn+Pe6FGJzWhXQotPv73jTaldXA==", + "requires": { + "es-errors": "^1.3.0" + } + }, "es-set-tostringtag": { - "version": "2.0.1", - "resolved": "https://registry.npmjs.org/es-set-tostringtag/-/es-set-tostringtag-2.0.1.tgz", - "integrity": "sha512-g3OMbtlwY3QewlqAiMLI47KywjWZoEytKr8pf6iTC8uJq5bIAH52Z9pnQ8pVL6whrCto53JZDuUIsifGeLorTg==", + "version": "2.1.0", + "resolved": "https://registry.npmjs.org/es-set-tostringtag/-/es-set-tostringtag-2.1.0.tgz", + "integrity": "sha512-j6vWzfrGVfyXxge+O0x5sh6cvxAog0a/4Rdd2K36zCMV5eJ+/+tOAngRO8cODMNWbVRdVlmGZQL2YS3yR8bIUA==", "requires": { - "get-intrinsic": "^1.1.3", - "has": "^1.0.3", - "has-tostringtag": "^1.0.0" + "es-errors": "^1.3.0", + "get-intrinsic": "^1.2.6", + "has-tostringtag": "^1.0.2", + "hasown": "^2.0.2" } }, "es-shim-unscopables": { @@ -22992,6 +24283,37 @@ "is-symbol": "^1.0.2" } }, + "esbuild": { + "version": "0.19.12", + "resolved": "https://registry.npmjs.org/esbuild/-/esbuild-0.19.12.tgz", + "integrity": "sha512-aARqgq8roFBj054KvQr5f1sFu0D65G+miZRCuJyJ0G13Zwx7vRar5Zhn2tkQNzIXcBrNVsv/8stehpj+GAjgbg==", + "dev": true, + "requires": { + "@esbuild/aix-ppc64": "0.19.12", + "@esbuild/android-arm": "0.19.12", + "@esbuild/android-arm64": "0.19.12", + "@esbuild/android-x64": "0.19.12", + "@esbuild/darwin-arm64": "0.19.12", + "@esbuild/darwin-x64": "0.19.12", + "@esbuild/freebsd-arm64": "0.19.12", + "@esbuild/freebsd-x64": "0.19.12", + "@esbuild/linux-arm": "0.19.12", + "@esbuild/linux-arm64": "0.19.12", + "@esbuild/linux-ia32": "0.19.12", + "@esbuild/linux-loong64": "0.19.12", + "@esbuild/linux-mips64el": "0.19.12", + "@esbuild/linux-ppc64": "0.19.12", + "@esbuild/linux-riscv64": "0.19.12", + "@esbuild/linux-s390x": "0.19.12", + "@esbuild/linux-x64": "0.19.12", + "@esbuild/netbsd-x64": "0.19.12", + "@esbuild/openbsd-x64": "0.19.12", + "@esbuild/sunos-x64": "0.19.12", + "@esbuild/win32-arm64": "0.19.12", + "@esbuild/win32-ia32": "0.19.12", + "@esbuild/win32-x64": "0.19.12" + } + }, "escalade": { "version": "3.1.1", "resolved": "https://registry.npmjs.org/escalade/-/escalade-3.1.1.tgz", @@ -23579,36 +24901,36 @@ } }, "express": { - "version": "4.19.2", - "resolved": "https://registry.npmjs.org/express/-/express-4.19.2.tgz", - "integrity": "sha512-5T6nhjsT+EOMzuck8JjBHARTHfMht0POzlA60WV2pMD3gyXw2LZnZ+ueGdNxG+0calOJcWKbpFcuzLZ91YWq9Q==", + "version": "4.21.2", + "resolved": "https://registry.npmjs.org/express/-/express-4.21.2.tgz", + "integrity": "sha512-28HqgMZAmih1Czt9ny7qr6ek2qddF4FclbMzwhCREB6OFfH+rXAnuNCwo1/wFvrtbgsQDb4kSbX9de9lFbrXnA==", "requires": { "accepts": "~1.3.8", "array-flatten": "1.1.1", - "body-parser": "1.20.2", + "body-parser": "1.20.3", "content-disposition": "0.5.4", "content-type": "~1.0.4", - "cookie": "0.6.0", + "cookie": "0.7.1", "cookie-signature": "1.0.6", "debug": "2.6.9", "depd": "2.0.0", - "encodeurl": "~1.0.2", + "encodeurl": "~2.0.0", "escape-html": "~1.0.3", "etag": "~1.8.1", - "finalhandler": "1.2.0", + "finalhandler": "1.3.1", "fresh": "0.5.2", "http-errors": "2.0.0", - "merge-descriptors": "1.0.1", + "merge-descriptors": "1.0.3", "methods": "~1.1.2", "on-finished": "2.4.1", "parseurl": "~1.3.3", - "path-to-regexp": "0.1.7", + "path-to-regexp": "0.1.12", "proxy-addr": "~2.0.7", - "qs": "6.11.0", + "qs": "6.13.0", "range-parser": "~1.2.1", "safe-buffer": "5.2.1", - "send": "0.18.0", - "serve-static": "1.15.0", + "send": "0.19.0", + "serve-static": "1.16.2", "setprototypeof": "1.2.0", "statuses": "2.0.1", "type-is": "~1.6.18", @@ -23647,9 +24969,9 @@ "integrity": "sha512-f3qQ9oQy9j2AhBe/H9VC91wLmKBCCU/gDOnKNAYG5hswO7BLKj09Hc5HYNz9cGI++xlpDCIgDaitVs03ATR84Q==" }, "fast-glob": { - "version": "3.2.12", - "resolved": "https://registry.npmjs.org/fast-glob/-/fast-glob-3.2.12.tgz", - "integrity": "sha512-DVj4CQIYYow0BlaelwK1pHl5n5cRSJfM60UA0zK891sVInoPri2Ekj7+e1CT3/3qxXenpI+nBBmQAcJPJgaj4w==", + "version": "3.3.2", + "resolved": "https://registry.npmjs.org/fast-glob/-/fast-glob-3.3.2.tgz", + "integrity": "sha512-oX2ruAFQwf/Orj8m737Y5adxDQO0LAB7/S5MnxCdTNDd4p6BsyIVsv9JQsATbTSq8KHRpLwIHbVlUNatxd+1Ow==", "requires": { "@nodelib/fs.stat": "^2.0.2", "@nodelib/fs.walk": "^1.2.3", @@ -23678,6 +25000,12 @@ "resolved": "https://registry.npmjs.org/fast-levenshtein/-/fast-levenshtein-2.0.6.tgz", "integrity": "sha512-DCXu6Ifhqcks7TZKY3Hxp3y6qphY5SJZmrWMDrKcERSOXWQdMhU9Ig/PYrzyw/ul9jOIyh0N4M0tbC5hodg8dw==" }, + "fast-uri": { + "version": "3.0.1", + "resolved": "https://registry.npmjs.org/fast-uri/-/fast-uri-3.0.1.tgz", + "integrity": "sha512-MWipKbbYiYI0UC7cl8m/i/IWTqfC8YXsqjzybjddLsFjStroQzsHXkc73JutMvBiXmOvapk+axIl79ig5t55Bw==", + "dev": true + }, "fastq": { "version": "1.15.0", "resolved": "https://registry.npmjs.org/fastq/-/fastq-1.15.0.tgz", @@ -23728,9 +25056,9 @@ }, "dependencies": { "brace-expansion": { - "version": "2.0.1", - "resolved": "https://registry.npmjs.org/brace-expansion/-/brace-expansion-2.0.1.tgz", - "integrity": "sha512-XnAIvQ8eM+kC6aULx6wuQiwVsnzsi9d3WxzV3FpWTGA19F621kwdbsAcFKXgKUHZWsy+mY6iL1sHTxWEFCytDA==", + "version": "2.0.2", + "resolved": "https://registry.npmjs.org/brace-expansion/-/brace-expansion-2.0.2.tgz", + "integrity": "sha512-Jt0vHyM+jmUBqojB7E1NIYadt0vI0Qxjxd2TErW94wDz+E2LAm5vKMXXwg6ZZBTHPuUlDgQHKXvjGBdfcF1ZDQ==", "requires": { "balanced-match": "^1.0.0" } @@ -23751,20 +25079,20 @@ "integrity": "sha512-pjmC+bkIF8XI7fWaH8KxHcZL3DPybs1roSKP4rKDvy20tAWwIObE4+JIseG2byfGKhud5ZnM4YSGKBz7Sh0ndQ==" }, "fill-range": { - "version": "7.0.1", - "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-7.0.1.tgz", - "integrity": "sha512-qOo9F+dMUmC2Lcb4BbVvnKJxTPjCm+RRpe4gDuGrzkL7mEVl/djYSu2OdQ2Pa302N4oqkSg9ir6jaLWJ2USVpQ==", + "version": "7.1.1", + "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-7.1.1.tgz", + "integrity": "sha512-YsGpe3WHLK8ZYi4tWDg2Jy3ebRz2rXowDxnld4bkQB00cc/1Zw9AWnC0i9ztDJitivtQvaI9KaLyKrc+hBW0yg==", "requires": { "to-regex-range": "^5.0.1" } }, "finalhandler": { - "version": "1.2.0", - "resolved": "https://registry.npmjs.org/finalhandler/-/finalhandler-1.2.0.tgz", - "integrity": "sha512-5uXcUVftlQMFnWC9qu/svkWv3GTd2PfUhK/3PLkYNAe7FbqJMt3515HaxE6eRL74GdsriiwujiawdaB1BpEISg==", + "version": "1.3.1", + "resolved": "https://registry.npmjs.org/finalhandler/-/finalhandler-1.3.1.tgz", + "integrity": "sha512-6BN9trH7bp3qvnrRyzsBz+g3lZxTNZTbVO2EV1CS0WIcDbawYVdYvGflME/9QP0h0pYlCDBCTjYa9nZzMDpyxQ==", "requires": { "debug": "2.6.9", - "encodeurl": "~1.0.2", + "encodeurl": "~2.0.0", "escape-html": "~1.0.3", "on-finished": "2.4.1", "parseurl": "~1.3.3", @@ -23968,13 +25296,15 @@ } }, "form-data": { - "version": "3.0.1", - "resolved": "https://registry.npmjs.org/form-data/-/form-data-3.0.1.tgz", - "integrity": "sha512-RHkBKtLWUVwd7SqRIvCZMEvAMoGUp0XU+seQiZejj0COz3RI3hWP4sCv3gZWWLjJTd7rGwcsF5eKZGii0r/hbg==", + "version": "3.0.4", + "resolved": "https://registry.npmjs.org/form-data/-/form-data-3.0.4.tgz", + "integrity": "sha512-f0cRzm6dkyVYV3nPoooP8XlccPQukegwhAnpoLcXy+X+A8KfpGOoXwDr9FLZd3wzgLaBGQBE3lY93Zm/i1JvIQ==", "requires": { "asynckit": "^0.4.0", "combined-stream": "^1.0.8", - "mime-types": "^2.1.12" + "es-set-tostringtag": "^2.1.0", + "hasown": "^2.0.2", + "mime-types": "^2.1.35" } }, "forwarded": { @@ -24019,9 +25349,9 @@ "optional": true }, "function-bind": { - "version": "1.1.1", - "resolved": "https://registry.npmjs.org/function-bind/-/function-bind-1.1.1.tgz", - "integrity": "sha512-yIovAzMX49sF8Yl58fSCWJ5svSLuaibPxXQJFLmBObTuCr0Mf1KiPopGM9NiFjiYBCbfaa2Fh6breQ6ANVTI0A==" + "version": "1.1.2", + "resolved": "https://registry.npmjs.org/function-bind/-/function-bind-1.1.2.tgz", + "integrity": "sha512-7XHNxH7qX9xG5mIwxkhumTox/MIRNcOgDrxWsMt2pAr23WHp6MrRlN7FBSFpCpr+oVO0F744iUgR82nJMfG2SA==" }, "function.prototype.name": { "version": "1.1.5", @@ -24050,13 +25380,20 @@ "integrity": "sha512-DyFP3BM/3YHTQOCUL/w0OZHR0lpKeGrxotcHWcqNEdnltqFwXVfhEBQ94eIo34AfQpo0rGki4cyIiftY06h2Fg==" }, "get-intrinsic": { - "version": "1.1.3", - "resolved": "https://registry.npmjs.org/get-intrinsic/-/get-intrinsic-1.1.3.tgz", - "integrity": "sha512-QJVz1Tj7MS099PevUG5jvnt9tSkXN8K14dxQlikJuPt4uD9hHAHjLyLBiLR5zELelBdD9QNRAXZzsJx0WaDL9A==", + "version": "1.3.0", + "resolved": "https://registry.npmjs.org/get-intrinsic/-/get-intrinsic-1.3.0.tgz", + "integrity": "sha512-9fSjSaos/fRIVIp+xSJlE6lfwhES7LNtKaCBIamHsjr2na1BiABJPo0mOjjz8GJDURarmCPGqaiVg5mfjb98CQ==", "requires": { - "function-bind": "^1.1.1", - "has": "^1.0.3", - "has-symbols": "^1.0.3" + "call-bind-apply-helpers": "^1.0.2", + "es-define-property": "^1.0.1", + "es-errors": "^1.3.0", + "es-object-atoms": "^1.1.1", + "function-bind": "^1.1.2", + "get-proto": "^1.0.1", + "gopd": "^1.2.0", + "has-symbols": "^1.1.0", + "hasown": "^2.0.2", + "math-intrinsics": "^1.1.0" } }, "get-own-enumerable-property-symbols": { @@ -24069,6 +25406,15 @@ "resolved": "https://registry.npmjs.org/get-package-type/-/get-package-type-0.1.0.tgz", "integrity": "sha512-pjzuKtY64GYfWizNAJ0fr9VqttZkNiK2iS430LtIHzjBEr6bX8Am2zm4sW4Ro5wjWW5cAlRL1qAMTcXbjNAO2Q==" }, + "get-proto": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/get-proto/-/get-proto-1.0.1.tgz", + "integrity": "sha512-sTSfBjoXBp89JvIKIefqw7U2CCebsc74kiY6awiGogKtoSGbgjYE/G/+l9sF3MWFPNc9IcoOC4ODfKHfxFmp0g==", + "requires": { + "dunder-proto": "^1.0.1", + "es-object-atoms": "^1.0.0" + } + }, "get-stream": { "version": "6.0.1", "resolved": "https://registry.npmjs.org/get-stream/-/get-stream-6.0.1.tgz", @@ -24164,12 +25510,9 @@ } }, "gopd": { - "version": "1.0.1", - "resolved": "https://registry.npmjs.org/gopd/-/gopd-1.0.1.tgz", - "integrity": "sha512-d65bNlIadxvpb/A2abVdlqKqV563juRnZ1Wtk6s1sIR8uNsXR70xqIzVqxVf1eTqDunwT2MkczEeaezCKTZhwA==", - "requires": { - "get-intrinsic": "^1.1.3" - } + "version": "1.2.0", + "resolved": "https://registry.npmjs.org/gopd/-/gopd-1.2.0.tgz", + "integrity": "sha512-ZUKRh6/kUFoAiTAtTYPZJ3hw9wNxx+BIBOijnlG9PnrJsCcSjs1wyyD6vJpaYtgnzDrKYRSqf3OO6Rfa93xsRg==" }, "graceful-fs": { "version": "4.2.10", @@ -24218,11 +25561,11 @@ "integrity": "sha512-sKJf1+ceQBr4SMkvQnBDNDtf4TXpVhVGateu0t918bl30FnbE2m4vNLX+VWe/dpjlb+HugGYzW7uQXH98HPEYw==" }, "has-property-descriptors": { - "version": "1.0.0", - "resolved": "https://registry.npmjs.org/has-property-descriptors/-/has-property-descriptors-1.0.0.tgz", - "integrity": "sha512-62DVLZGoiEBDHQyqG4w9xCuZ7eJEwNmJRWw2VY84Oedb7WFcA27fiEVe8oUQx9hAUJ4ekurquucTGwsyO1XGdQ==", + "version": "1.0.2", + "resolved": "https://registry.npmjs.org/has-property-descriptors/-/has-property-descriptors-1.0.2.tgz", + "integrity": "sha512-55JNKuIW+vq4Ke1BjOTjM2YctQIvCT7GFzHwmfZPGo5wnrgkid0YQtnAleFSqumZm4az3n2BS+erby5ipJdgrg==", "requires": { - "get-intrinsic": "^1.1.1" + "es-define-property": "^1.0.0" } }, "has-proto": { @@ -24231,16 +25574,24 @@ "integrity": "sha512-7qE+iP+O+bgF9clE5+UoBFzE65mlBiVj3tKCrlNQ0Ogwm0BjpT/gK4SlLYDMybDh5I3TCTKnPPa0oMG7JDYrhg==" }, "has-symbols": { - "version": "1.0.3", - "resolved": "https://registry.npmjs.org/has-symbols/-/has-symbols-1.0.3.tgz", - "integrity": "sha512-l3LCuF6MgDNwTDKkdYGEihYjt5pRPbEg46rtlmnSPlUbgmB8LOIrKJbYYFBSbnPaJexMKtiPO8hmeRjRz2Td+A==" + "version": "1.1.0", + "resolved": "https://registry.npmjs.org/has-symbols/-/has-symbols-1.1.0.tgz", + "integrity": "sha512-1cDNdwJ2Jaohmb3sg4OmKaMBwuC48sYni5HUw2DvsC8LjGTLK9h+eb1X6RyuOHe4hT0ULCW68iomhjUoKUqlPQ==" }, "has-tostringtag": { - "version": "1.0.0", - "resolved": "https://registry.npmjs.org/has-tostringtag/-/has-tostringtag-1.0.0.tgz", - "integrity": "sha512-kFjcSNhnlGV1kyoGk7OXKSawH5JOb/LzUc5w9B02hOTO0dfFRjbHQKvg1d6cf3HbeUmtU9VbbV3qzZ2Teh97WQ==", + "version": "1.0.2", + "resolved": "https://registry.npmjs.org/has-tostringtag/-/has-tostringtag-1.0.2.tgz", + "integrity": "sha512-NqADB8VjPFLM2V0VvHUewwwsw0ZWBaIdgo+ieHtK3hasLz4qeCRjYcqfB6AQrBggRKppKF8L52/VqdVsO47Dlw==", "requires": { - "has-symbols": "^1.0.2" + "has-symbols": "^1.0.3" + } + }, + "hasown": { + "version": "2.0.2", + "resolved": "https://registry.npmjs.org/hasown/-/hasown-2.0.2.tgz", + "integrity": "sha512-0hJU9SCPvmMzIBdZFqNPXWa6dqh7WdH0cII9y+CyS8rG3nL48Bclra9HmKhVVUHyPWNH5Y7xDwAB7bfgSjkUMQ==", + "requires": { + "function-bind": "^1.1.2" } }, "he": { @@ -24394,15 +25745,23 @@ } }, "http-proxy-middleware": { - "version": "1.0.6", - "resolved": "https://registry.npmjs.org/http-proxy-middleware/-/http-proxy-middleware-1.0.6.tgz", - "integrity": "sha512-NyL6ZB6cVni7pl+/IT2W0ni5ME00xR0sN27AQZZrpKn1b+qRh+mLbBxIq9Cq1oGfmTc7BUq4HB77mxwCaxAYNg==", + "version": "3.0.5", + "resolved": "https://registry.npmjs.org/http-proxy-middleware/-/http-proxy-middleware-3.0.5.tgz", + "integrity": "sha512-GLZZm1X38BPY4lkXA01jhwxvDoOkkXqjgVyUzVxiEK4iuRu03PZoYHhHRwxnfhQMDuaxi3vVri0YgSro/1oWqg==", "requires": { - "@types/http-proxy": "^1.17.4", + "@types/http-proxy": "^1.17.15", + "debug": "^4.3.6", "http-proxy": "^1.18.1", - "is-glob": "^4.0.1", - "lodash": "^4.17.20", - "micromatch": "^4.0.2" + "is-glob": "^4.0.3", + "is-plain-object": "^5.0.0", + "micromatch": "^4.0.8" + }, + "dependencies": { + "is-plain-object": { + "version": "5.0.0", + "resolved": "https://registry.npmjs.org/is-plain-object/-/is-plain-object-5.0.0.tgz", + "integrity": "sha512-VRSzKkbMm5jMDoKLbltAkFQ5Qr7VDiTFGXxYFXXowVj387GeGNOCsOH6Msy00SGZ3Fp84b1Naa1psqgcCIEP5Q==" + } } }, "https-proxy-agent": { @@ -26573,6 +27932,11 @@ "resolved": "https://registry.npmjs.org/material-design-lite/-/material-design-lite-1.3.0.tgz", "integrity": "sha1-0ATOP+6Zoe63Sni4oyUTSl8RcdM=" }, + "math-intrinsics": { + "version": "1.1.0", + "resolved": "https://registry.npmjs.org/math-intrinsics/-/math-intrinsics-1.1.0.tgz", + "integrity": "sha512-/IXtbwEk5HTPyEwyKX6hGkYXxM9nbj64B+ilVJnC/R6B0pH5G4V3b0pVbL7DBj4tkhBAppbQUlf6F6Xl9LHu1g==" + }, "mdn-data": { "version": "2.0.4", "resolved": "https://registry.npmjs.org/mdn-data/-/mdn-data-2.0.4.tgz", @@ -26597,9 +27961,9 @@ "integrity": "sha512-HKeeBpWvqiVJD57ZUAsJNm71eHTykffzcLZVYWiVfQeI1rJtuEaS7hQiEpWfVVk18donPwJEcFKIkCmPJNOhHA==" }, "merge-descriptors": { - "version": "1.0.1", - "resolved": "https://registry.npmjs.org/merge-descriptors/-/merge-descriptors-1.0.1.tgz", - "integrity": "sha512-cCi6g3/Zr1iqQi6ySbseM1Xvooa98N0w31jzUYrXPX2xqObmFGHJ0tQ5u74H3mVh7wLouTseZyYIq39g8cNp1w==" + "version": "1.0.3", + "resolved": "https://registry.npmjs.org/merge-descriptors/-/merge-descriptors-1.0.3.tgz", + "integrity": "sha512-gaNvAS7TZ897/rVaZ0nMtAyxNyi/pdbjbAwUpFQpN70GqnVfOiXpeUUMKRBmzXaSQ8DdTX4/0ms62r2K+hE6mQ==" }, "merge-stream": { "version": "2.0.0", @@ -26617,11 +27981,11 @@ "integrity": "sha512-iclAHeNqNm68zFtnZ0e+1L2yUIdvzNoauKU4WBA3VvH/vPFieF7qfRlwUZU+DA9P9bPXIS90ulxoUoCH23sV2w==" }, "micromatch": { - "version": "4.0.5", - "resolved": "https://registry.npmjs.org/micromatch/-/micromatch-4.0.5.tgz", - "integrity": "sha512-DMy+ERcEW2q8Z2Po+WNXuw3c5YaUSFjAO5GsJqfEl7UjvtIuFKO6ZrKvcItdy98dwFI2N1tg3zNIdKaQT+aNdA==", + "version": "4.0.8", + "resolved": "https://registry.npmjs.org/micromatch/-/micromatch-4.0.8.tgz", + "integrity": "sha512-PXwfBhYu0hBCPw8Dn0E+WDYb7af3dSLVWKi3HGv84IdF4TyFoC0ysxFd0Goxw7nSv4T/PzEJQxsYsEiFCKo2BA==", "requires": { - "braces": "^3.0.2", + "braces": "^3.0.3", "picomatch": "^2.3.1" } }, @@ -26720,9 +28084,9 @@ } }, "ms": { - "version": "2.1.2", - "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.2.tgz", - "integrity": "sha512-sGkPx+VjMtmA6MX27oA4FBFELFCZZ4S4XqeGOXCv68tT+jb3vk/RyaKWP0PTKyWtmLSM0b+adUTEvbs1PEaH2w==" + "version": "2.1.3", + "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.3.tgz", + "integrity": "sha512-6FlzubTLZG3J2a/NVCAleEhjzq5oxgHyaCU9yYXvcLsvoVaHJq/s5xXI6/XXP6tz7R9xAOtHnSO/tXtF3WRTlA==" }, "multicast-dns": { "version": "7.2.5", @@ -26734,9 +28098,9 @@ } }, "nanoid": { - "version": "3.3.4", - "resolved": "https://registry.npmjs.org/nanoid/-/nanoid-3.3.4.tgz", - "integrity": "sha512-MqBkQh/OHTS2egovRtLk45wEyNXwF+cokD+1YPf9u5VfJiRdAiRwB2froX5Co9Rh20xs4siNPm8naNotSD6RBw==" + "version": "3.3.8", + "resolved": "https://registry.npmjs.org/nanoid/-/nanoid-3.3.8.tgz", + "integrity": "sha512-WNLf5Sd8oZxOm+TzppcYk8gVOgP+l58xNy58D0nbUnOxOWRWvlcCV4kUF7ltmI6PsrLl/BgKEyS4mqsGChFN0w==" }, "natural-compare": { "version": "1.4.0", @@ -26841,9 +28205,9 @@ "integrity": "sha512-RSn9F68PjH9HqtltsSnqYC1XXoWe9Bju5+213R98cNGttag9q9yAOTzdbsqvIa7aNm5WffBZFpWYr2aWrklWAw==" }, "object-inspect": { - "version": "1.12.2", - "resolved": "https://registry.npmjs.org/object-inspect/-/object-inspect-1.12.2.tgz", - "integrity": "sha512-z+cPxW0QGUp0mcqcsgQyLVRDoXFQbXOwBaqyF7VIgI4TWNQsDHrBpUQslRmIfAoYWdYzs6UlKJtB2XJpTaNSpQ==" + "version": "1.13.2", + "resolved": "https://registry.npmjs.org/object-inspect/-/object-inspect-1.13.2.tgz", + "integrity": "sha512-IRZSRuzJiynemAXPYtPe5BoI/RESNYR7TYm50MC5Mqbd3Jmw5y790sErYw3V6SryFJD64b74qQQs9wn5Bg/k3g==" }, "object-keys": { "version": "1.1.1", @@ -26925,9 +28289,9 @@ } }, "on-headers": { - "version": "1.0.2", - "resolved": "https://registry.npmjs.org/on-headers/-/on-headers-1.0.2.tgz", - "integrity": "sha512-pZAE+FJLoyITytdqK0U5s+FIpjN0JP3OzFi/u8Rx+EV5/W+JTWGXG8xFzevE7AjBfDqHv/8vL8qQsIhHnqRkrA==" + "version": "1.1.0", + "resolved": "https://registry.npmjs.org/on-headers/-/on-headers-1.1.0.tgz", + "integrity": "sha512-737ZY3yNnXy37FHkQxPzt4UZ2UWPWiCZWLvFZ4fu5cueciegX0zGPnrlY6bwRg4FdQOe9YU8MkmJwGhoMybl8A==" }, "once": { "version": "1.4.0", @@ -27080,9 +28444,9 @@ "integrity": "sha512-LDJzPVEEEPR+y48z93A0Ed0yXb8pAByGWo/k5YYdYgpY2/2EsOsksJrq7lOHxryrVOn1ejG6oAp8ahvOIQD8sw==" }, "path-to-regexp": { - "version": "0.1.7", - "resolved": "https://registry.npmjs.org/path-to-regexp/-/path-to-regexp-0.1.7.tgz", - "integrity": "sha512-5DFkuoqlv1uYQKxy8omFBeJPQcdoE07Kv2sferDCrAq1ohOU+MSDswDIbnx3YAM60qIOnYa53wBhXW0EbMonrQ==" + "version": "0.1.12", + "resolved": "https://registry.npmjs.org/path-to-regexp/-/path-to-regexp-0.1.12.tgz", + "integrity": "sha512-RA1GjUVMnvYFxuqovrEqZoxxW5NUZqbwKtYz/Tt7nXerk0LbLblQmrsgdeOxV5SFHf0UDggjS/bSeOZwt1pmEQ==" }, "path-type": { "version": "4.0.0", @@ -27095,9 +28459,9 @@ "integrity": "sha512-7EAHlyLHI56VEIdK57uwHdHKIaAGbnXPiw0yWbarQZOKaKpvUIgW0jWRVLiatnM+XXlSwsanIBH/hzGMJulMow==" }, "picocolors": { - "version": "1.0.0", - "resolved": "https://registry.npmjs.org/picocolors/-/picocolors-1.0.0.tgz", - "integrity": "sha512-1fygroTLlHu66zi26VoTDv8yRgm0Fccecssto+MhsZ0D/DGW2sm8E8AjW7NU5VVTRt5GxbeZ5qBuJr+HyLYkjQ==" + "version": "1.1.1", + "resolved": "https://registry.npmjs.org/picocolors/-/picocolors-1.1.1.tgz", + "integrity": "sha512-xceH2snhtb5M9liqDsmEw56le376mTZkEX/jEb/RxNFyegNul7eNslCXP9FDj/Lcu0X8KEyMceP2ntpaHrDEVA==" }, "picomatch": { "version": "2.3.1", @@ -27984,27 +29348,25 @@ "integrity": "sha512-XRsRjdf+j5ml+y/6GKHPZbrF/8p2Yga0JPtdqTIY2Xe5ohJPD9saDJJLPvp9+NSBprVvevdXZybnj2cv8OEd0A==" }, "pyodide": { - "version": "0.23.2", - "resolved": "https://registry.npmjs.org/pyodide/-/pyodide-0.23.2.tgz", - "integrity": "sha512-GK4YDZVgzfAXK/7X0IiCI+142k0Ah/HwYTzDHtG8zC47dflWYuPozeFbOngShuL1M9Un5sCmHFqiH3boxJv0pQ==", + "version": "0.26.2", + "resolved": "https://registry.npmjs.org/pyodide/-/pyodide-0.26.2.tgz", + "integrity": "sha512-8VCRdFX83gBsWs6XP2rhG8HMaB+JaVyyav4q/EMzoV8fXH8HN6T5IISC92SNma6i1DRA3SVXA61S1rJcB8efgA==", "requires": { - "base-64": "^1.0.0", - "node-fetch": "^2.6.1", "ws": "^8.5.0" }, "dependencies": { "ws": { - "version": "8.8.1", - "resolved": "https://registry.npmjs.org/ws/-/ws-8.8.1.tgz", - "integrity": "sha512-bGy2JzvzkPowEJV++hF07hAD6niYSr0JzBNo/J29WsB57A2r7Wlc1UFcTR9IzrPvuNVO4B8LGqF8qcpsVOhJCA==", + "version": "8.18.3", + "resolved": "https://registry.npmjs.org/ws/-/ws-8.18.3.tgz", + "integrity": "sha512-PEIGCY5tSlUt50cqyMXfCzX+oOPqN0vuGqWzbcJ2xvnkzkq46oOpz7dQaTDBdfICb4N14+GARUDw2XV2N4tvzg==", "requires": {} } } }, "pyodide-worker-runner": { - "version": "1.3.3", - "resolved": "https://registry.npmjs.org/pyodide-worker-runner/-/pyodide-worker-runner-1.3.3.tgz", - "integrity": "sha512-6SyvbsfSis5u4dgcnOo5Xzr9shp2Mc3f2NtoL9B1xWWwKRQqYHNqAvQkf2S0ZfyRd43FS4M/Kp797unKirR98A==", + "version": "1.4.0", + "resolved": "https://registry.npmjs.org/pyodide-worker-runner/-/pyodide-worker-runner-1.4.0.tgz", + "integrity": "sha512-t9v49q4sWSlywNMoMPw1Zs9FBpCP70wkHB5zzzmOErIxPS3w3HVxiwSI/ldpT1GH1exLEPGz16YHGVa65XqdHw==", "requires": { "p-retry": "^5.0.0" } @@ -28015,11 +29377,11 @@ "integrity": "sha512-kV/CThkXo6xyFEZUugw/+pIOywXcDbFYgSct5cT3gqlbkBE1SJdwy6UQoZvodiWF/ckQLZyDE/Bu1M6gVu5lVw==" }, "qs": { - "version": "6.11.0", - "resolved": "https://registry.npmjs.org/qs/-/qs-6.11.0.tgz", - "integrity": "sha512-MvjoMCJwEarSbUYk5O+nmoSzSutSsTwF85zcHPQ9OrlFoZOYIjaqBAJIqIXjptyD5vThxGq52Xu/MaJzRkIk4Q==", + "version": "6.13.0", + "resolved": "https://registry.npmjs.org/qs/-/qs-6.13.0.tgz", + "integrity": "sha512-+38qI9SOr8tfZ4QmJNplMUxqjbe7LKvvZgWdExBOmd+egZTtjLB67Gu0HRX3u/XOq7UU2Nx6nsjvS16Z9uwfpg==", "requires": { - "side-channel": "^1.0.4" + "side-channel": "^1.0.6" } }, "querystringify": { @@ -28074,11 +29436,6 @@ "unpipe": "1.0.0" }, "dependencies": { - "bytes": { - "version": "3.1.2", - "resolved": "https://registry.npmjs.org/bytes/-/bytes-3.1.2.tgz", - "integrity": "sha512-/Nf7TyzTx6S3yRJObOAV7956r8cr2+Oj8AC5dt8wSP3BQAoeX58NoHyCU8P8zGkNXStjTSi6fzO6F0pBdcYbEg==" - }, "iconv-lite": { "version": "0.4.24", "resolved": "https://registry.npmjs.org/iconv-lite/-/iconv-lite-0.4.24.tgz", @@ -28640,9 +29997,9 @@ } }, "rollup": { - "version": "2.79.1", - "resolved": "https://registry.npmjs.org/rollup/-/rollup-2.79.1.tgz", - "integrity": "sha512-uKxbd0IhMZOhjAiD5oAFp7BqvkA4Dv47qpOCtaNvng4HBwdbWtdOh8f5nZNuk2rp51PMGk3bzfWu5oayNEuYnw==", + "version": "2.79.2", + "resolved": "https://registry.npmjs.org/rollup/-/rollup-2.79.2.tgz", + "integrity": "sha512-fS6iqSPZDs3dr/y7Od6y5nha8dW1YnbgtsyotCVvoFGKbERG++CVRFv1meyGDE1SNItQA8BrnCw7ScdAhRJ3XQ==", "requires": { "fsevents": "~2.3.2" } @@ -28801,9 +30158,9 @@ } }, "send": { - "version": "0.18.0", - "resolved": "https://registry.npmjs.org/send/-/send-0.18.0.tgz", - "integrity": "sha512-qqWzuOjSFOuqPjFe4NOsMLafToQQwBSOEpS+FwEt3A2V3vKubTquT3vmLTQpFgMXp8AlFWFuP1qKaJZOtPpVXg==", + "version": "0.19.0", + "resolved": "https://registry.npmjs.org/send/-/send-0.19.0.tgz", + "integrity": "sha512-dW41u5VfLXu8SJh5bwRmyYUbAoSB3c9uQh6L8h/KtsFREPWpbX1lrljJo186Jc4nmci/sGUZ9a0a0J2zgfq2hw==", "requires": { "debug": "2.6.9", "depd": "2.0.0", @@ -28835,17 +30192,17 @@ } } }, - "ms": { - "version": "2.1.3", - "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.3.tgz", - "integrity": "sha512-6FlzubTLZG3J2a/NVCAleEhjzq5oxgHyaCU9yYXvcLsvoVaHJq/s5xXI6/XXP6tz7R9xAOtHnSO/tXtF3WRTlA==" + "encodeurl": { + "version": "1.0.2", + "resolved": "https://registry.npmjs.org/encodeurl/-/encodeurl-1.0.2.tgz", + "integrity": "sha512-TPJXq8JqFaVYm2CWmPvnP2Iyo4ZSM7/QKcSmuMLDObfpH5fi7RUGmd/rTDf+rut/saiDiQEeVTNgAmJEdAOx0w==" } } }, "serialize-javascript": { - "version": "6.0.0", - "resolved": "https://registry.npmjs.org/serialize-javascript/-/serialize-javascript-6.0.0.tgz", - "integrity": "sha512-Qr3TosvguFt8ePWqsvRfrKyQXIiW+nGbYpy8XK24NQHE83caxWt+mIymTT19DGFbNWNLfEwsrkSmN64lVWB9ag==", + "version": "6.0.2", + "resolved": "https://registry.npmjs.org/serialize-javascript/-/serialize-javascript-6.0.2.tgz", + "integrity": "sha512-Saa1xPByTTq2gdeFZYLLo+RFE35NHZkAbqZeWNd3BpzppeVisAqpDjcp8dyf6uIvEqJRd46jemmyA4iFIeVk8g==", "requires": { "randombytes": "^2.1.0" } @@ -28911,14 +30268,27 @@ } }, "serve-static": { - "version": "1.15.0", - "resolved": "https://registry.npmjs.org/serve-static/-/serve-static-1.15.0.tgz", - "integrity": "sha512-XGuRDNjXUijsUL0vl6nSD7cwURuzEgglbOaFuZM9g3kwDXOWVTck0jLzjPzGD+TazWbboZYu52/9/XPdUgne9g==", + "version": "1.16.2", + "resolved": "https://registry.npmjs.org/serve-static/-/serve-static-1.16.2.tgz", + "integrity": "sha512-VqpjJZKadQB/PEbEwvFdO43Ax5dFBZ2UECszz8bQ7pi7wt//PWe1P6MN7eCnjsatYtBT6EuiClbjSWP2WrIoTw==", "requires": { - "encodeurl": "~1.0.2", + "encodeurl": "~2.0.0", "escape-html": "~1.0.3", "parseurl": "~1.3.3", - "send": "0.18.0" + "send": "0.19.0" + } + }, + "set-function-length": { + "version": "1.2.2", + "resolved": "https://registry.npmjs.org/set-function-length/-/set-function-length-1.2.2.tgz", + "integrity": "sha512-pgRc4hJ4/sNjWCSS9AmnS40x3bNMDTknHgL5UaMBTMyJnU90EgWh1Rz+MC9eFu4BuN/UwZjKQuY/1v3rM7HMfg==", + "requires": { + "define-data-property": "^1.1.4", + "es-errors": "^1.3.0", + "function-bind": "^1.1.2", + "get-intrinsic": "^1.2.4", + "gopd": "^1.0.1", + "has-property-descriptors": "^1.0.2" } }, "setprototypeof": { @@ -28953,13 +30323,14 @@ "integrity": "sha512-8o/QEhSSRb1a5i7TFR0iM4G16Z0vYB2OQVs4G3aAFXjn3T6yEx8AZxy1PgDF7I00LZHYA3WxaSYIf5e5sAX8Rw==" }, "side-channel": { - "version": "1.0.4", - "resolved": "https://registry.npmjs.org/side-channel/-/side-channel-1.0.4.tgz", - "integrity": "sha512-q5XPytqFEIKHkGdiMIrY10mvLRvnQh42/+GoBlFW3b2LXLE2xxJpZFdm94we0BaoV3RwJyGqg5wS7epxTv0Zvw==", + "version": "1.0.6", + "resolved": "https://registry.npmjs.org/side-channel/-/side-channel-1.0.6.tgz", + "integrity": "sha512-fDW/EZ6Q9RiO8eFG8Hj+7u/oW+XrPTIChwCOM2+th2A6OblDtYYIpve9m+KvI9Z4C9qSEXlaGR6bTEYHReuglA==", "requires": { - "call-bind": "^1.0.0", - "get-intrinsic": "^1.0.2", - "object-inspect": "^1.9.0" + "call-bind": "^1.0.7", + "es-errors": "^1.3.0", + "get-intrinsic": "^1.2.4", + "object-inspect": "^1.13.1" } }, "signal-exit": { @@ -29487,11 +30858,6 @@ "resolved": "https://registry.npmjs.org/tmpl/-/tmpl-1.0.5.tgz", "integrity": "sha512-3f0uOEAQwIqGuWW2MVzYg8fV/QNnc/IpuJNG837rLuczAaLVHslWHZQj4IGiEl5Hs3kkbhwL9Ab7Hrsmuj+Smw==" }, - "to-fast-properties": { - "version": "2.0.0", - "resolved": "https://registry.npmjs.org/to-fast-properties/-/to-fast-properties-2.0.0.tgz", - "integrity": "sha512-/OaKK0xYrs3DmxRYqL/yDc+FxFUVYhDlXMhRmv3z915w2HF1tnN1omB354j8VUGO/hbRzyD6Y3sA7v7GS/ceog==" - }, "to-regex-range": { "version": "5.0.1", "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-5.0.1.tgz", @@ -30019,9 +31385,9 @@ } }, "http-proxy-middleware": { - "version": "2.0.6", - "resolved": "https://registry.npmjs.org/http-proxy-middleware/-/http-proxy-middleware-2.0.6.tgz", - "integrity": "sha512-ya/UeJ6HVBYxrgYotAZo1KvPWlgB48kUJLDePFeneHsVujFaW5WNj2NgWCAE//B1Dl02BIfYlpNgBy8Kf8Rjmw==", + "version": "2.0.9", + "resolved": "https://registry.npmjs.org/http-proxy-middleware/-/http-proxy-middleware-2.0.9.tgz", + "integrity": "sha512-c1IyJYLYppU574+YI7R4QyX2ystMtVXZwIdzazUIPIJsHuWNd+mho2j+bKoHftndicGj9yh+xjd+l0yj7VeT1Q==", "requires": { "@types/http-proxy": "^1.17.8", "http-proxy": "^1.18.1", @@ -30056,9 +31422,9 @@ } }, "ws": { - "version": "8.11.0", - "resolved": "https://registry.npmjs.org/ws/-/ws-8.11.0.tgz", - "integrity": "sha512-HPG3wQd9sNQoT9xHyNCXoDUa+Xw/VevmY9FoHyQ+g+rrMn4j6FB4np7Z0OhdTgjx6MgQLK7jwSy1YecU1+4Asg==", + "version": "8.18.3", + "resolved": "https://registry.npmjs.org/ws/-/ws-8.18.3.tgz", + "integrity": "sha512-PEIGCY5tSlUt50cqyMXfCzX+oOPqN0vuGqWzbcJ2xvnkzkq46oOpz7dQaTDBdfICb4N14+GARUDw2XV2N4tvzg==", "requires": {} } } @@ -30532,9 +31898,9 @@ } }, "ws": { - "version": "7.5.9", - "resolved": "https://registry.npmjs.org/ws/-/ws-7.5.9.tgz", - "integrity": "sha512-F+P9Jil7UiSKSkppIiD94dN07AwvFixvLIj1Og1Rl9GGMuNipJnV9JzjD6XuqmAeiswGvUmNLjr5cFuXwNS77Q==", + "version": "7.5.10", + "resolved": "https://registry.npmjs.org/ws/-/ws-7.5.10.tgz", + "integrity": "sha512-+dbF1tHwZpXcbOJdVOkzLDxZP1ailvSxM6ZweXTegylPny803bFhA+vqBYw4s31NSAk4S2Qz+AKXK9a4wkdjcQ==", "requires": {} }, "xml-name-validator": { diff --git a/frontend/package.json b/frontend/package.json index fa14b951..b8cb630d 100644 --- a/frontend/package.json +++ b/frontend/package.json @@ -4,28 +4,28 @@ "homepage": "/course/", "private": true, "engines": { - "node": ">= 16.17.1", - "npm": ">= 8.15.0" + "node": ">= 22.17.0", + "npm": ">= 10.9.2" }, "dependencies": { "@craco/craco": "^7.0.0", "@fortawesome/fontawesome-svg-core": "^6.2.0", "@fortawesome/free-solid-svg-icons": "^6.2.0", "@fortawesome/react-fontawesome": "^0.2.0", - "@sentry/react": "^7.16.0", + "@sentry/react": "^7.119.1", "ansi_up": "^5.0.0", - "axios": "^1.6.0", + "axios": "^1.12.0", "comlink": "^4.3.1", "comsync": "^0.0.8", "defaults": "^1.0.3", "firebase": "^8.6.3", - "http-proxy-middleware": "^1.0.6", + "http-proxy-middleware": "^3.0.5", "localforage": "^1.9.0", "lodash": "^4.17.21", "p-retry": "^5.0.0", "prop-types": "^15.7.2", - "pyodide": "^0.23.2", - "pyodide-worker-runner": "^1.3.3", + "pyodide": "^0.26.2", + "pyodide-worker-runner": "^1.4.0", "react": "^17.0.2", "react-ace": "^10.0.0", "react-beautiful-dnd": "^13.1.0", @@ -67,6 +67,7 @@ ] }, "devDependencies": { + "@pyodide/webpack-plugin": "^1.3.2", "raw-loader": "^4.0.2", "worker-loader": "^3.0.8" } diff --git a/frontend/src/App.js b/frontend/src/App.js index 56e54f9a..51131bb7 100644 --- a/frontend/src/App.js +++ b/frontend/src/App.js @@ -250,7 +250,7 @@ const Assistant = (assistant) => { - {terms.requirements} + {terms.requirements} } >

@@ -269,7 +269,7 @@ const Assistant = (assistant) => { classParentString="assistant-assessment card" contentInnerClassName="assistant-content card-body" trigger={

- {terms.assessment}   + {terms.assessment}   {newMessages && {terms.new}}
} > @@ -278,7 +278,7 @@ const Assistant = (assistant) => { - {terms.hints_and_solution} + {terms.hints_and_solution} } > diff --git a/frontend/src/Feedback.js b/frontend/src/Feedback.js index 64000fe9..8e3fa86c 100644 --- a/frontend/src/Feedback.js +++ b/frontend/src/Feedback.js @@ -99,8 +99,8 @@ ${description.value.trim()}`;
  • - - {terms.chat_on_slack} + + {terms.chat_on_discord}
    • diff --git a/frontend/src/RunCode.js b/frontend/src/RunCode.js index fa24049c..275fe365 100644 --- a/frontend/src/RunCode.js +++ b/frontend/src/RunCode.js @@ -171,15 +171,15 @@ export const _runCode = wrapAsync(async function runCode({code, source}) { finishedLastRunResolve(); postCodeEntry({ - entry, - result: { - passed: data.passed, - messageSections: data.message_sections?.map(section => ({ - type: section.type, - messages: section.messages?.map(m => _.truncate(m, {length: 1000})), - })), - output: _.truncate(data.output, {length: 1000}), - }, + // entry, + // result: { + // passed: data.passed, + // messageSections: data.message_sections?.map(section => ({ + // type: section.type, + // messages: section.messages?.map(m => _.truncate(m, {length: 1000})), + // })), + // output: _.truncate(data.output, {length: 1000}), + // }, }); }); diff --git a/frontend/src/book/store.js b/frontend/src/book/store.js index 473b5db3..b2feeeae 100644 --- a/frontend/src/book/store.js +++ b/frontend/src/book/store.js @@ -514,19 +514,20 @@ export function logEvent(name, data = {}) { } export function postCodeEntry(codeEntry) { - const {user: {developerMode}, route, assistant: {numHints, requestingSolution}} = localState; - codeEntry = { - ...codeEntry, - state: { - developerMode, - page_route: route, - num_hints: numHints, - requesting_solution: requestingSolution, - }, - timestamp: new Date().toISOString(), - }; - console.log("Posting code entry", codeEntry); - if (isProduction) { - databaseRequest("POST", codeEntry, "code_entries").catch(e => console.error(e)); - } + // Disabling for now because this data isn't used. + // const {user: {developerMode}, route, assistant: {numHints, requestingSolution}} = localState; + // codeEntry = { + // ...codeEntry, + // state: { + // developerMode, + // page_route: route, + // num_hints: numHints, + // requesting_solution: requestingSolution, + // }, + // timestamp: new Date().toISOString(), + // }; + // console.log("Posting code entry", codeEntry); + // if (isProduction) { + // databaseRequest("POST", codeEntry, "code_entries").catch(e => console.error(e)); + // } } diff --git a/frontend/src/css/main.scss b/frontend/src/css/main.scss index e4156cb4..7be386ac 100644 --- a/frontend/src/css/main.scss +++ b/frontend/src/css/main.scss @@ -468,28 +468,41 @@ .assistant { margin-top: 1em; + .card-header { + padding: .75rem 3.25rem; + background: rgba(0,0,0,0); + } + .card__trigger { font-size: larger; position: relative; + cursor: pointer; + background: linear-gradient(rgba(0, 0, 0, 0), rgba(0, 0, 0, 0.1)); + + :hover { + background: linear-gradient(rgba(0, 0, 0, 0.05), rgba(0, 0, 0, 0.15)); + } + // Font awesome icons svg { width: 2em; } &:after { - font-family: 'FontAwesome'; - content: '\f107'; + transform: translatey(-3px) rotate(180deg) scalex(1.2); + font-family: 'Tahoma', sans-serif; + content: '^'; position: absolute; - right: 20px; - top: 10px; + left: 20px; + top: 12px; display: block; transition: transform 300ms; } &.is-open { &:after { - transform: rotateZ(180deg); + transform: translatey(3px) rotate(0deg) scalex(1.2); } } } diff --git a/frontend/src/english_terms.json b/frontend/src/english_terms.json index 9cbe2504..fd4af741 100644 --- a/frontend/src/english_terms.json +++ b/frontend/src/english_terms.json @@ -34,7 +34,7 @@ "contact_directly": "Alternatively, you can contact us directly:", "send_email_to": "Email", "open_github_issue": "Open an issue on GitHub", - "chat_on_slack": "Chat on Slack", + "chat_on_discord": "Chat on Discord", "copying_solution_not_allowed": "Copying from the hints/solution area is not allowed!", "no_hints_available": "This step doesn't have any hints. Try reading the instructions and requirements again. You can still check the solution if you're really stuck.", "get_hint": "Get a hint", diff --git a/frontend/src/languages.js b/frontend/src/languages.js index 6929c5cc..47463c11 100644 --- a/frontend/src/languages.js +++ b/frontend/src/languages.js @@ -63,6 +63,22 @@ const languages = [ measurementId: "G-W0ZYL2E5W5" } }, + { + code: 'pl', + name: 'Polski', + url: 'https://pl.futurecoder.io/', + visible: true, + firebaseConfig: { + apiKey: "AIzaSyDUzqc75Vn1UDJ7NSzduCVvwxC3ap9XtSc", + authDomain: "futurecoder-pl.firebaseapp.com", + databaseURL: "https://futurecoder-pl-default-rtdb.europe-west1.firebasedatabase.app/", + projectId: "futurecoder-pl", + storageBucket: "futurecoder-pl.appspot.com", + messagingSenderId: "302555192729", + appId: "1:302555192729:web:9544e6dd2015e822708708", + measurementId: "G-XG7E3KF703" + } + }, { code: 'ta', name: 'தமிழ்', @@ -80,21 +96,21 @@ const languages = [ } }, { - code: 'pl', - name: 'Polski', - url: 'https://pl.futurecoder.io/', - visible: false, + code: 'zh', + name: '中文', + url: 'https://zh.futurecoder.io/', + visible: true, firebaseConfig: { - apiKey: "AIzaSyDUzqc75Vn1UDJ7NSzduCVvwxC3ap9XtSc", - authDomain: "futurecoder-pl.firebaseapp.com", - databaseURL: "https://futurecoder-pl-default-rtdb.europe-west1.firebasedatabase.app/", - projectId: "futurecoder-pl", - storageBucket: "futurecoder-pl.appspot.com", - messagingSenderId: "302555192729", - appId: "1:302555192729:web:9544e6dd2015e822708708", - measurementId: "G-XG7E3KF703" - } - }, + apiKey: "AIzaSyBqtDR34wsBxKB-QrnDY97uJ6uXSVkvb7o", + authDomain: "futurecoder-zh.firebaseapp.com", + databaseURL: "https://futurecoder-zh-default-rtdb.asia-southeast1.firebasedatabase.app/", + projectId: "futurecoder-zh", + storageBucket: "futurecoder-zh.firebasestorage.app", + messagingSenderId: "103387137175", + appId: "1:103387137175:web:a841284a28104ec4f1d5d2", + measurementId: "G-3LND5RGTWT" + }, + } ]; export let language = process.env.REACT_APP_LANGUAGE; diff --git a/homepage/index.html b/homepage/index.html index cd99f20e..c4b37bd1 100644 --- a/homepage/index.html +++ b/homepage/index.html @@ -21,25 +21,33 @@
    -
    - +
    -
    +
    + + + Español Français + + Polski + தமிழ் + + 中文 + Github @@ -52,17 +60,17 @@
    -

    +

    futurecoder

    -

    +

    Learn Python from scratch.

    -
    +
    @@ -81,7 +89,7 @@

    Redefines interactive learning

    -
    +
    @@ -102,7 +110,7 @@

    100% Free & Open Source

    -
    +
    @@ -123,7 +131,7 @@

    Designed with care for beginners

    -
    +
    Start learning @@ -150,7 +158,7 @@

    Designed with care for beginners

    -
    +
    @@ -197,7 +205,7 @@

    See what others think

    GitHub
    - 1000+ + 1300+
    @@ -240,6 +248,26 @@

    See what others think

    A lot of courses could use this treatment.
    +
    + + Hands down, the best learning experience I've had. + The encouraging, down-to-earth language and no lectures at all suited me well. + +
    +
    + + The single best tool that has helped me think better. + I have been devouring it. + I find it so interesting when others can't hold my attention. + +
    +
    + + It's meant to be as easy and fast as possible. + I learned Python's basics within a week. + I attribute where I'm at now to this site. + +
    Honestly I never had any interest in coding, but your course is @@ -432,7 +460,7 @@
    We mean to achieve this by:

    Interested in contributing code or course content?


    -     +    Check out the contribution guide on GitHub
    @@ -447,9 +475,9 @@

    Interested in contributing code or course content?

    Contact Us

    -    - - Chat on Slack +    + + Chat on Discord

    @@ -491,7 +519,7 @@

    Contact Us

    - © 2021 Alex Hall + © 2025 Alex Hall                    Language icon created by Freepik - Flaticon
    @@ -528,14 +556,22 @@

    Contact Us

    - diff --git a/how_to_contribute.md b/how_to_contribute.md index c90cd126..1877178a 100644 --- a/how_to_contribute.md +++ b/how_to_contribute.md @@ -10,7 +10,7 @@ For starters, try using the platform to see what it's like. From the [table of c Please [open an issue](https://github.com/alexmojaki/futurecoder/issues/new) about anything that's confusing, could be done better, or doesn't work. All suggestions and feedback are welcome. Tell me what interests you! -Consider adding your thoughts and ideas to [issues labeled 'discussion'](https://github.com/alexmojaki/futurecoder/issues?q=is%3Aissue+is%3Aopen+label%3Adiscussion). Or [come have a chat about anything on slack](https://join.slack.com/t/futurecoder/shared_invite/zt-tp8cmwra-CbdEeX9u3k1VyoMLDupAeQ). +Consider adding your thoughts and ideas to [issues labeled 'discussion'](https://github.com/alexmojaki/futurecoder/issues?q=is%3Aissue+is%3Aopen+label%3Adiscussion). Or [come have a chat about anything on discord](https://discord.gg/KwWvQCPBjW). The easiest way to contribute concretely is to write learning material for the course and participate in related discussions. This doesn't require any expertise beyond knowing how Python works. See [Helping with course content](#helping-with-course-content) for more information. @@ -28,7 +28,7 @@ It can be helpful to read through existing textbooks and such to find inspiratio If you want to contribute a solid bit of course with actual text, code, and exercises, open a new issue with a proposal draft just in markdown. Actually implementing course content in Python is trickier so I handle those details. If you're really curious, there's partial documentation [here](https://github.com/alexmojaki/futurecoder/wiki/How-course-content-works). -If you have some partial ideas you'd like to talk about but don't feel ready to open an issue, [come chat on slack](https://join.slack.com/t/futurecoder/shared_invite/zt-tp8cmwra-CbdEeX9u3k1VyoMLDupAeQ). +If you have some partial ideas you'd like to talk about but don't feel ready to open an issue, [come chat on discord](https://discord.gg/KwWvQCPBjW). ## Developing diff --git a/poetry.lock b/poetry.lock index b690958b..708c1d5b 100644 --- a/poetry.lock +++ b/poetry.lock @@ -1,4 +1,4 @@ -# This file is automatically @generated by Poetry 1.8.3 and should not be changed by hand. +# This file is automatically @generated by Poetry 2.1.1 and should not be changed by hand. [[package]] name = "astcheck" @@ -6,6 +6,7 @@ version = "0.2.5" description = "Check Python ASTs against templates" optional = false python-versions = "*" +groups = ["main"] files = [ {file = "astcheck-0.2.5-py2.py3-none-any.whl", hash = "sha256:083d3f787e42f7707f4e9b3ea8ef4e08f50753e3612b494ebcb8cda763979f07"}, {file = "astcheck-0.2.5.tar.gz", hash = "sha256:ba9987e8dfe6c2b9ea6720ab8fbdb5aa00fdfa2908017be8a272b2a4b663397d"}, @@ -13,20 +14,39 @@ files = [ [[package]] name = "asttokens" -version = "2.1.0" +version = "3.0.0" description = "Annotate AST trees with source code positions" optional = false -python-versions = "*" +python-versions = ">=3.8" +groups = ["main"] files = [ - {file = "asttokens-2.1.0-py2.py3-none-any.whl", hash = "sha256:1b28ed85e254b724439afc783d4bee767f780b936c3fe8b3275332f42cf5f561"}, - {file = "asttokens-2.1.0.tar.gz", hash = "sha256:4aa76401a151c8cc572d906aad7aea2a841780834a19d780f4321c0fe1b54635"}, + {file = "asttokens-3.0.0-py3-none-any.whl", hash = "sha256:e3078351a059199dd5138cb1c706e6430c05eff2ff136af5eb4790f9d28932e2"}, + {file = "asttokens-3.0.0.tar.gz", hash = "sha256:0dcd8baa8d62b0c1d118b399b2ddba3c4aff271d0d7a9e0d4c1681c79035bbc7"}, ] -[package.dependencies] -six = "*" +[package.extras] +astroid = ["astroid (>=2,<4)"] +test = ["astroid (>=2,<4)", "pytest", "pytest-cov", "pytest-xdist"] + +[[package]] +name = "attrs" +version = "24.2.0" +description = "Classes Without Boilerplate" +optional = false +python-versions = ">=3.7" +groups = ["dev"] +files = [ + {file = "attrs-24.2.0-py3-none-any.whl", hash = "sha256:81921eb96de3191c8258c199618104dd27ac608d9366f5e35d011eae1867ede2"}, + {file = "attrs-24.2.0.tar.gz", hash = "sha256:5cfb1b9148b5b086569baec03f20d7b6bf3bcacc9a42bebf87ffaaca362f6346"}, +] [package.extras] -test = ["astroid (<=2.5.3)", "pytest"] +benchmark = ["cloudpickle ; platform_python_implementation == \"CPython\"", "hypothesis", "mypy (>=1.11.1) ; platform_python_implementation == \"CPython\" and python_version >= \"3.9\"", "pympler", "pytest (>=4.3.0)", "pytest-codspeed", "pytest-mypy-plugins ; platform_python_implementation == \"CPython\" and python_version >= \"3.9\" and python_version < \"3.13\"", "pytest-xdist[psutil]"] +cov = ["cloudpickle ; platform_python_implementation == \"CPython\"", "coverage[toml] (>=5.3)", "hypothesis", "mypy (>=1.11.1) ; platform_python_implementation == \"CPython\" and python_version >= \"3.9\"", "pympler", "pytest (>=4.3.0)", "pytest-mypy-plugins ; platform_python_implementation == \"CPython\" and python_version >= \"3.9\" and python_version < \"3.13\"", "pytest-xdist[psutil]"] +dev = ["cloudpickle ; platform_python_implementation == \"CPython\"", "hypothesis", "mypy (>=1.11.1) ; platform_python_implementation == \"CPython\" and python_version >= \"3.9\"", "pre-commit", "pympler", "pytest (>=4.3.0)", "pytest-mypy-plugins ; platform_python_implementation == \"CPython\" and python_version >= \"3.9\" and python_version < \"3.13\"", "pytest-xdist[psutil]"] +docs = ["cogapp", "furo", "myst-parser", "sphinx", "sphinx-notfound-page", "sphinxcontrib-towncrier", "towncrier (<24.7)"] +tests = ["cloudpickle ; platform_python_implementation == \"CPython\"", "hypothesis", "mypy (>=1.11.1) ; platform_python_implementation == \"CPython\" and python_version >= \"3.9\"", "pympler", "pytest (>=4.3.0)", "pytest-mypy-plugins ; platform_python_implementation == \"CPython\" and python_version >= \"3.9\" and python_version < \"3.13\"", "pytest-xdist[psutil]"] +tests-mypy = ["mypy (>=1.11.1) ; platform_python_implementation == \"CPython\" and python_version >= \"3.9\"", "pytest-mypy-plugins ; platform_python_implementation == \"CPython\" and python_version >= \"3.9\" and python_version < \"3.13\""] [[package]] name = "bettererrormessages" @@ -34,6 +54,7 @@ version = "0.4" description = "Logic to have suggestions in case of errors (NameError, AttributeError, ImportError, TypeError, etc)." optional = false python-versions = "*" +groups = ["main"] files = [ {file = "BetterErrorMessages-0.4-py2-none-any.whl", hash = "sha256:1ec7e7e1614668ace08811f0aeefda50317e5a3e000b50162f86590a9bcdc720"}, {file = "BetterErrorMessages-0.4.tar.gz", hash = "sha256:f565984d39c18bfbd5175792f9f1c0d2bf30333a66c48247e7dd9fb2d2030f70"}, @@ -41,51 +62,135 @@ files = [ [[package]] name = "birdseye" -version = "0.9.1.dev6+g81273e6" +version = "0.9.6.dev23+g8aa06c7" description = "Minimal version of birdseye for futurecoder" optional = false -python-versions = "*" +python-versions = ">=3.8" +groups = ["main"] files = [] develop = false [package.dependencies] asttokens = "*" -cheap-repr = "*" +cheap_repr = "*" littleutils = ">=0.2" [package.extras] -tests = ["bs4", "pytest", "requests", "selenium"] +tests = ["bs4", "pytest", "selenium"] [package.source] type = "git" url = "https://github.com/alexmojaki/birdseye.git" reference = "futurecoder" -resolved_reference = "81273e689c5460a0b44ec28840e6adcf7fd6dad4" +resolved_reference = "8aa06c7e6854d22ecd9fcef05edca2acabb043a1" [[package]] name = "certifi" -version = "2023.7.22" +version = "2024.8.30" description = "Python package for providing Mozilla's CA Bundle." optional = false python-versions = ">=3.6" +groups = ["main", "dev"] files = [ - {file = "certifi-2023.7.22-py3-none-any.whl", hash = "sha256:92d6037539857d8206b8f6ae472e8b77db8058fec5937a1ef3f54304089edbb9"}, - {file = "certifi-2023.7.22.tar.gz", hash = "sha256:539cc1d13202e33ca466e88b2807e29f4c13049d6d87031a3c110744495cb082"}, + {file = "certifi-2024.8.30-py3-none-any.whl", hash = "sha256:922820b53db7a7257ffbda3f597266d435245903d80737e34f8a45ff3e3230d8"}, + {file = "certifi-2024.8.30.tar.gz", hash = "sha256:bec941d2aa8195e248a60b31ff9f0558284cf01a52591ceda73ea9afffd69fd9"}, ] +[[package]] +name = "cffi" +version = "1.17.1" +description = "Foreign Function Interface for Python calling C code." +optional = false +python-versions = ">=3.8" +groups = ["dev"] +markers = "os_name == \"nt\" and implementation_name != \"pypy\"" +files = [ + {file = "cffi-1.17.1-cp310-cp310-macosx_10_9_x86_64.whl", hash = "sha256:df8b1c11f177bc2313ec4b2d46baec87a5f3e71fc8b45dab2ee7cae86d9aba14"}, + {file = "cffi-1.17.1-cp310-cp310-macosx_11_0_arm64.whl", hash = "sha256:8f2cdc858323644ab277e9bb925ad72ae0e67f69e804f4898c070998d50b1a67"}, + {file = "cffi-1.17.1-cp310-cp310-manylinux_2_12_i686.manylinux2010_i686.manylinux_2_17_i686.manylinux2014_i686.whl", hash = "sha256:edae79245293e15384b51f88b00613ba9f7198016a5948b5dddf4917d4d26382"}, + {file = "cffi-1.17.1-cp310-cp310-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:45398b671ac6d70e67da8e4224a065cec6a93541bb7aebe1b198a61b58c7b702"}, + {file = "cffi-1.17.1-cp310-cp310-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:ad9413ccdeda48c5afdae7e4fa2192157e991ff761e7ab8fdd8926f40b160cc3"}, + {file = "cffi-1.17.1-cp310-cp310-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:5da5719280082ac6bd9aa7becb3938dc9f9cbd57fac7d2871717b1feb0902ab6"}, + {file = "cffi-1.17.1-cp310-cp310-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:2bb1a08b8008b281856e5971307cc386a8e9c5b625ac297e853d36da6efe9c17"}, + {file = "cffi-1.17.1-cp310-cp310-musllinux_1_1_aarch64.whl", hash = "sha256:045d61c734659cc045141be4bae381a41d89b741f795af1dd018bfb532fd0df8"}, + {file = "cffi-1.17.1-cp310-cp310-musllinux_1_1_i686.whl", hash = "sha256:6883e737d7d9e4899a8a695e00ec36bd4e5e4f18fabe0aca0efe0a4b44cdb13e"}, + {file = "cffi-1.17.1-cp310-cp310-musllinux_1_1_x86_64.whl", hash = "sha256:6b8b4a92e1c65048ff98cfe1f735ef8f1ceb72e3d5f0c25fdb12087a23da22be"}, + {file = "cffi-1.17.1-cp310-cp310-win32.whl", hash = "sha256:c9c3d058ebabb74db66e431095118094d06abf53284d9c81f27300d0e0d8bc7c"}, + {file = "cffi-1.17.1-cp310-cp310-win_amd64.whl", hash = "sha256:0f048dcf80db46f0098ccac01132761580d28e28bc0f78ae0d58048063317e15"}, + {file = "cffi-1.17.1-cp311-cp311-macosx_10_9_x86_64.whl", hash = "sha256:a45e3c6913c5b87b3ff120dcdc03f6131fa0065027d0ed7ee6190736a74cd401"}, + {file = "cffi-1.17.1-cp311-cp311-macosx_11_0_arm64.whl", hash = "sha256:30c5e0cb5ae493c04c8b42916e52ca38079f1b235c2f8ae5f4527b963c401caf"}, + {file = "cffi-1.17.1-cp311-cp311-manylinux_2_12_i686.manylinux2010_i686.manylinux_2_17_i686.manylinux2014_i686.whl", hash = "sha256:f75c7ab1f9e4aca5414ed4d8e5c0e303a34f4421f8a0d47a4d019ceff0ab6af4"}, + {file = "cffi-1.17.1-cp311-cp311-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:a1ed2dd2972641495a3ec98445e09766f077aee98a1c896dcb4ad0d303628e41"}, + {file = "cffi-1.17.1-cp311-cp311-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:46bf43160c1a35f7ec506d254e5c890f3c03648a4dbac12d624e4490a7046cd1"}, + {file = "cffi-1.17.1-cp311-cp311-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:a24ed04c8ffd54b0729c07cee15a81d964e6fee0e3d4d342a27b020d22959dc6"}, + {file = "cffi-1.17.1-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:610faea79c43e44c71e1ec53a554553fa22321b65fae24889706c0a84d4ad86d"}, + {file = "cffi-1.17.1-cp311-cp311-musllinux_1_1_aarch64.whl", hash = "sha256:a9b15d491f3ad5d692e11f6b71f7857e7835eb677955c00cc0aefcd0669adaf6"}, + {file = "cffi-1.17.1-cp311-cp311-musllinux_1_1_i686.whl", hash = "sha256:de2ea4b5833625383e464549fec1bc395c1bdeeb5f25c4a3a82b5a8c756ec22f"}, + {file = "cffi-1.17.1-cp311-cp311-musllinux_1_1_x86_64.whl", hash = "sha256:fc48c783f9c87e60831201f2cce7f3b2e4846bf4d8728eabe54d60700b318a0b"}, + {file = "cffi-1.17.1-cp311-cp311-win32.whl", hash = "sha256:85a950a4ac9c359340d5963966e3e0a94a676bd6245a4b55bc43949eee26a655"}, + {file = "cffi-1.17.1-cp311-cp311-win_amd64.whl", hash = "sha256:caaf0640ef5f5517f49bc275eca1406b0ffa6aa184892812030f04c2abf589a0"}, + {file = "cffi-1.17.1-cp312-cp312-macosx_10_9_x86_64.whl", hash = "sha256:805b4371bf7197c329fcb3ead37e710d1bca9da5d583f5073b799d5c5bd1eee4"}, + {file = "cffi-1.17.1-cp312-cp312-macosx_11_0_arm64.whl", hash = "sha256:733e99bc2df47476e3848417c5a4540522f234dfd4ef3ab7fafdf555b082ec0c"}, + {file = "cffi-1.17.1-cp312-cp312-manylinux_2_12_i686.manylinux2010_i686.manylinux_2_17_i686.manylinux2014_i686.whl", hash = "sha256:1257bdabf294dceb59f5e70c64a3e2f462c30c7ad68092d01bbbfb1c16b1ba36"}, + {file = "cffi-1.17.1-cp312-cp312-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:da95af8214998d77a98cc14e3a3bd00aa191526343078b530ceb0bd710fb48a5"}, + {file = "cffi-1.17.1-cp312-cp312-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:d63afe322132c194cf832bfec0dc69a99fb9bb6bbd550f161a49e9e855cc78ff"}, + {file = "cffi-1.17.1-cp312-cp312-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:f79fc4fc25f1c8698ff97788206bb3c2598949bfe0fef03d299eb1b5356ada99"}, + {file = "cffi-1.17.1-cp312-cp312-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:b62ce867176a75d03a665bad002af8e6d54644fad99a3c70905c543130e39d93"}, + {file = "cffi-1.17.1-cp312-cp312-musllinux_1_1_aarch64.whl", hash = "sha256:386c8bf53c502fff58903061338ce4f4950cbdcb23e2902d86c0f722b786bbe3"}, + {file = "cffi-1.17.1-cp312-cp312-musllinux_1_1_x86_64.whl", hash = "sha256:4ceb10419a9adf4460ea14cfd6bc43d08701f0835e979bf821052f1805850fe8"}, + {file = "cffi-1.17.1-cp312-cp312-win32.whl", hash = "sha256:a08d7e755f8ed21095a310a693525137cfe756ce62d066e53f502a83dc550f65"}, + {file = "cffi-1.17.1-cp312-cp312-win_amd64.whl", hash = "sha256:51392eae71afec0d0c8fb1a53b204dbb3bcabcb3c9b807eedf3e1e6ccf2de903"}, + {file = "cffi-1.17.1-cp313-cp313-macosx_10_13_x86_64.whl", hash = "sha256:f3a2b4222ce6b60e2e8b337bb9596923045681d71e5a082783484d845390938e"}, + {file = "cffi-1.17.1-cp313-cp313-macosx_11_0_arm64.whl", hash = "sha256:0984a4925a435b1da406122d4d7968dd861c1385afe3b45ba82b750f229811e2"}, + {file = "cffi-1.17.1-cp313-cp313-manylinux_2_12_i686.manylinux2010_i686.manylinux_2_17_i686.manylinux2014_i686.whl", hash = "sha256:d01b12eeeb4427d3110de311e1774046ad344f5b1a7403101878976ecd7a10f3"}, + {file = "cffi-1.17.1-cp313-cp313-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:706510fe141c86a69c8ddc029c7910003a17353970cff3b904ff0686a5927683"}, + {file = "cffi-1.17.1-cp313-cp313-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:de55b766c7aa2e2a3092c51e0483d700341182f08e67c63630d5b6f200bb28e5"}, + {file = "cffi-1.17.1-cp313-cp313-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:c59d6e989d07460165cc5ad3c61f9fd8f1b4796eacbd81cee78957842b834af4"}, + {file = "cffi-1.17.1-cp313-cp313-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:dd398dbc6773384a17fe0d3e7eeb8d1a21c2200473ee6806bb5e6a8e62bb73dd"}, + {file = "cffi-1.17.1-cp313-cp313-musllinux_1_1_aarch64.whl", hash = "sha256:3edc8d958eb099c634dace3c7e16560ae474aa3803a5df240542b305d14e14ed"}, + {file = "cffi-1.17.1-cp313-cp313-musllinux_1_1_x86_64.whl", hash = "sha256:72e72408cad3d5419375fc87d289076ee319835bdfa2caad331e377589aebba9"}, + {file = "cffi-1.17.1-cp313-cp313-win32.whl", hash = "sha256:e03eab0a8677fa80d646b5ddece1cbeaf556c313dcfac435ba11f107ba117b5d"}, + {file = "cffi-1.17.1-cp313-cp313-win_amd64.whl", hash = "sha256:f6a16c31041f09ead72d69f583767292f750d24913dadacf5756b966aacb3f1a"}, + {file = "cffi-1.17.1-cp38-cp38-macosx_10_9_x86_64.whl", hash = "sha256:636062ea65bd0195bc012fea9321aca499c0504409f413dc88af450b57ffd03b"}, + {file = "cffi-1.17.1-cp38-cp38-manylinux_2_12_i686.manylinux2010_i686.manylinux_2_17_i686.manylinux2014_i686.whl", hash = "sha256:c7eac2ef9b63c79431bc4b25f1cd649d7f061a28808cbc6c47b534bd789ef964"}, + {file = "cffi-1.17.1-cp38-cp38-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:e221cf152cff04059d011ee126477f0d9588303eb57e88923578ace7baad17f9"}, + {file = "cffi-1.17.1-cp38-cp38-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:31000ec67d4221a71bd3f67df918b1f88f676f1c3b535a7eb473255fdc0b83fc"}, + {file = "cffi-1.17.1-cp38-cp38-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:6f17be4345073b0a7b8ea599688f692ac3ef23ce28e5df79c04de519dbc4912c"}, + {file = "cffi-1.17.1-cp38-cp38-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:0e2b1fac190ae3ebfe37b979cc1ce69c81f4e4fe5746bb401dca63a9062cdaf1"}, + {file = "cffi-1.17.1-cp38-cp38-win32.whl", hash = "sha256:7596d6620d3fa590f677e9ee430df2958d2d6d6de2feeae5b20e82c00b76fbf8"}, + {file = "cffi-1.17.1-cp38-cp38-win_amd64.whl", hash = "sha256:78122be759c3f8a014ce010908ae03364d00a1f81ab5c7f4a7a5120607ea56e1"}, + {file = "cffi-1.17.1-cp39-cp39-macosx_10_9_x86_64.whl", hash = "sha256:b2ab587605f4ba0bf81dc0cb08a41bd1c0a5906bd59243d56bad7668a6fc6c16"}, + {file = "cffi-1.17.1-cp39-cp39-macosx_11_0_arm64.whl", hash = "sha256:28b16024becceed8c6dfbc75629e27788d8a3f9030691a1dbf9821a128b22c36"}, + {file = "cffi-1.17.1-cp39-cp39-manylinux_2_12_i686.manylinux2010_i686.manylinux_2_17_i686.manylinux2014_i686.whl", hash = "sha256:1d599671f396c4723d016dbddb72fe8e0397082b0a77a4fab8028923bec050e8"}, + {file = "cffi-1.17.1-cp39-cp39-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:ca74b8dbe6e8e8263c0ffd60277de77dcee6c837a3d0881d8c1ead7268c9e576"}, + {file = "cffi-1.17.1-cp39-cp39-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:f7f5baafcc48261359e14bcd6d9bff6d4b28d9103847c9e136694cb0501aef87"}, + {file = "cffi-1.17.1-cp39-cp39-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:98e3969bcff97cae1b2def8ba499ea3d6f31ddfdb7635374834cf89a1a08ecf0"}, + {file = "cffi-1.17.1-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:cdf5ce3acdfd1661132f2a9c19cac174758dc2352bfe37d98aa7512c6b7178b3"}, + {file = "cffi-1.17.1-cp39-cp39-musllinux_1_1_aarch64.whl", hash = "sha256:9755e4345d1ec879e3849e62222a18c7174d65a6a92d5b346b1863912168b595"}, + {file = "cffi-1.17.1-cp39-cp39-musllinux_1_1_i686.whl", hash = "sha256:f1e22e8c4419538cb197e4dd60acc919d7696e5ef98ee4da4e01d3f8cfa4cc5a"}, + {file = "cffi-1.17.1-cp39-cp39-musllinux_1_1_x86_64.whl", hash = "sha256:c03e868a0b3bc35839ba98e74211ed2b05d2119be4e8a0f224fba9384f1fe02e"}, + {file = "cffi-1.17.1-cp39-cp39-win32.whl", hash = "sha256:e31ae45bc2e29f6b2abd0de1cc3b9d5205aa847cafaecb8af1476a609a2f6eb7"}, + {file = "cffi-1.17.1-cp39-cp39-win_amd64.whl", hash = "sha256:d016c76bdd850f3c626af19b0542c9677ba156e4ee4fccfdd7848803533ef662"}, + {file = "cffi-1.17.1.tar.gz", hash = "sha256:1c39c6016c32bc48dd54561950ebd6836e1670f2ae46128f67cf49e789c52824"}, +] + +[package.dependencies] +pycparser = "*" + [[package]] name = "cheap-repr" -version = "0.5.1" +version = "0.5.2" description = "Better version of repr/reprlib for short, cheap string representations." optional = false python-versions = "*" +groups = ["main"] files = [ - {file = "cheap_repr-0.5.1-py2.py3-none-any.whl", hash = "sha256:30096998aeb49367a4a153988d7a99dce9dc59bbdd4b19740da6b4f3f97cf2ff"}, - {file = "cheap_repr-0.5.1.tar.gz", hash = "sha256:31ec63b9d8394aa23d746c8376c8307f75f9fca0b983566b8bcf13cc661fe6dd"}, + {file = "cheap_repr-0.5.2-py2.py3-none-any.whl", hash = "sha256:537ec1991bfee885c13c6d473afd110a408e039cde26882e95bf92761556ab6e"}, + {file = "cheap_repr-0.5.2.tar.gz", hash = "sha256:001a5cf8adb0305c7ad3152c5f776040ac2a559d97f85770cebcb28c6ca5a30f"}, ] [package.extras] -tests = ["Django", "Django (<2)", "Django (<3)", "chainmap", "numpy (>=1.16.3)", "numpy (>=1.16.3,<1.17)", "numpy (>=1.16.3,<1.19)", "pandas (>=0.24.2)", "pandas (>=0.24.2,<0.25)", "pandas (>=0.24.2,<0.26)", "pytest"] +tests = ["Django", "numpy (>=1.16.3) ; platform_python_implementation != \"PyPy\"", "pandas (>=0.24.2) ; platform_python_implementation != \"PyPy\"", "pytest"] [[package]] name = "colorama" @@ -93,6 +198,8 @@ version = "0.4.6" description = "Cross-platform colored terminal text." optional = false python-versions = "!=3.0.*,!=3.1.*,!=3.2.*,!=3.3.*,!=3.4.*,!=3.5.*,!=3.6.*,>=2.7" +groups = ["dev"] +markers = "sys_platform == \"win32\"" files = [ {file = "colorama-0.4.6-py2.py3-none-any.whl", hash = "sha256:4f1d9991f5acc0ca119f9d443620b77f9d6b33703e51011c16baf57afb285fc6"}, {file = "colorama-0.4.6.tar.gz", hash = "sha256:08695f5cb7ed6e0531a20572697297273c47b8cae5a63ffc6d6ed5c201be6e44"}, @@ -100,43 +207,46 @@ files = [ [[package]] name = "executing" -version = "1.2.0" +version = "2.1.0" description = "Get the currently executing AST node of a frame, and other information" optional = false -python-versions = "*" +python-versions = ">=3.8" +groups = ["main"] files = [ - {file = "executing-1.2.0-py2.py3-none-any.whl", hash = "sha256:0314a69e37426e3608aada02473b4161d4caf5a4b244d1d0c48072b8fee7bacc"}, - {file = "executing-1.2.0.tar.gz", hash = "sha256:19da64c18d2d851112f09c287f8d3dbbdf725ab0e569077efb6cdcbd3497c107"}, + {file = "executing-2.1.0-py2.py3-none-any.whl", hash = "sha256:8d63781349375b5ebccc3142f4b30350c0cd9c79f921cde38be2be4637e98eaf"}, + {file = "executing-2.1.0.tar.gz", hash = "sha256:8ea27ddd260da8150fa5a708269c4a10e76161e2496ec3e587da9e3c0fe4b9ab"}, ] [package.extras] -tests = ["asttokens", "littleutils", "pytest", "rich"] +tests = ["asttokens (>=2.1.0)", "coverage", "coverage-enable-subprocess", "ipython", "littleutils", "pytest", "rich ; python_version >= \"3.11\""] [[package]] name = "flake8" -version = "3.8.3" +version = "3.9.2" description = "the modular source code checker: pep8 pyflakes and co" optional = true -python-versions = "!=3.0.*,!=3.1.*,!=3.2.*,!=3.3.*,>=2.7" +python-versions = "!=3.0.*,!=3.1.*,!=3.2.*,!=3.3.*,!=3.4.*,>=2.7" +groups = ["dev"] files = [ - {file = "flake8-3.8.3-py2.py3-none-any.whl", hash = "sha256:15e351d19611c887e482fb960eae4d44845013cc142d42896e9862f775d8cf5c"}, - {file = "flake8-3.8.3.tar.gz", hash = "sha256:f04b9fcbac03b0a3e58c0ab3a0ecc462e023a9faf046d57794184028123aa208"}, + {file = "flake8-3.9.2-py2.py3-none-any.whl", hash = "sha256:bf8fd333346d844f616e8d47905ef3a3384edae6b4e9beb0c5101e25e3110907"}, + {file = "flake8-3.9.2.tar.gz", hash = "sha256:07528381786f2a6237b061f6e96610a4167b226cb926e2aa2b6b1d78057c576b"}, ] [package.dependencies] mccabe = ">=0.6.0,<0.7.0" -pycodestyle = ">=2.6.0a1,<2.7.0" -pyflakes = ">=2.2.0,<2.3.0" +pycodestyle = ">=2.7.0,<2.8.0" +pyflakes = ">=2.3.0,<2.4.0" [[package]] name = "friendly-traceback" -version = "0.7.48" +version = "0.7.61" description = "Friendlier tracebacks in any language." optional = false python-versions = ">=3.6" +groups = ["main"] files = [ - {file = "friendly-traceback-0.7.48.tar.gz", hash = "sha256:0384c49eee16df41b3356bf3071b031eaa85cda5b4b41420cbbe09d9ff8270a0"}, - {file = "friendly_traceback-0.7.48-py3-none-any.whl", hash = "sha256:5b0a917ef4a1e750e92015757870f50cab83c90002863f77bbbf41a3d26e67af"}, + {file = "friendly-traceback-0.7.61.tar.gz", hash = "sha256:8ca149ea4effa114a9d4354078d0252dbc53e291cdcc63f23e34b8fb65ba15f3"}, + {file = "friendly_traceback-0.7.61-py3-none-any.whl", hash = "sha256:6945346e49a4ef72c855723f09a6d9b1b4fbf43759d4529f779f29259efab9f7"}, ] [package.dependencies] @@ -144,7 +254,34 @@ asttokens = ">=2.0.4" executing = ">=1.1.0" pure-eval = ">=0.2.1" six = ">=1.16" -stack-data = ">=0.5.1" +stack-data = ">=0.6.2" + +[[package]] +name = "h11" +version = "0.16.0" +description = "A pure-Python, bring-your-own-I/O implementation of HTTP/1.1" +optional = false +python-versions = ">=3.8" +groups = ["dev"] +files = [ + {file = "h11-0.16.0-py3-none-any.whl", hash = "sha256:63cf8bbe7522de3bf65932fda1d9c2772064ffb3dae62d55932da54b31cb6c86"}, + {file = "h11-0.16.0.tar.gz", hash = "sha256:4e35b956cf45792e4caa5885e69fba00bdbc6ffafbfa020300e549b208ee5ff1"}, +] + +[[package]] +name = "idna" +version = "3.10" +description = "Internationalized Domain Names in Applications (IDNA)" +optional = false +python-versions = ">=3.6" +groups = ["dev"] +files = [ + {file = "idna-3.10-py3-none-any.whl", hash = "sha256:946d195a0d259cbba61165e88e65941f16e9b36ea6ddb97f00452bae8b1287d3"}, + {file = "idna-3.10.tar.gz", hash = "sha256:12f65c9b470abda6dc35cf8e63cc574b1c52b11df2c86030af0ac09b01b13ea9"}, +] + +[package.extras] +all = ["flake8 (>=7.1.1)", "mypy (>=1.11.2)", "pytest (>=8.3.2)", "ruff (>=0.6.2)"] [[package]] name = "iniconfig" @@ -152,6 +289,7 @@ version = "2.0.0" description = "brain-dead simple config-ini parsing" optional = false python-versions = ">=3.7" +groups = ["dev"] files = [ {file = "iniconfig-2.0.0-py3-none-any.whl", hash = "sha256:b6a85871a79d2e3b22d2d1b94ac2824226a63c6b741c88f7ae975f18b6778374"}, {file = "iniconfig-2.0.0.tar.gz", hash = "sha256:2d91e135bf72d31a410b17c16da610a82cb55f6b0477d1a902134b24a455b8b3"}, @@ -159,44 +297,45 @@ files = [ [[package]] name = "isort" -version = "5.1.4" +version = "5.13.2" description = "A Python utility / library to sort Python imports." optional = false -python-versions = ">=3.6,<4.0" +python-versions = ">=3.8.0" +groups = ["dev"] files = [ - {file = "isort-5.1.4-py3-none-any.whl", hash = "sha256:ae3007f72a2e9da36febd3454d8be4b175d6ca17eb765841d5fe3d038aede79d"}, - {file = "isort-5.1.4.tar.gz", hash = "sha256:145072eedc4927cc9c1f9478f2d83b2fc1e6469df4129c02ef4e8c742207a46c"}, + {file = "isort-5.13.2-py3-none-any.whl", hash = "sha256:8ca5e72a8d85860d5a3fa69b8745237f2939afe12dbf656afbcb47fe72d947a6"}, + {file = "isort-5.13.2.tar.gz", hash = "sha256:48fdfcb9face5d58a4f6dde2e72a1fb8dcaf8ab26f95ab49fab84c2ddefb0109"}, ] [package.extras] -pipfile-deprecated-finder = ["pipreqs", "requirementslib", "tomlkit (>=0.5.3)"] -requirements-deprecated-finder = ["pip-api", "pipreqs"] +colors = ["colorama (>=0.4.6)"] [[package]] name = "littleutils" -version = "0.2.2" +version = "0.2.4" description = "Small personal collection of python utility functions" optional = false -python-versions = "*" +python-versions = ">=3.8" +groups = ["main"] files = [ - {file = "littleutils-0.2.2.tar.gz", hash = "sha256:e6cae3a4203e530d51c9667ed310ffe3b1948f2876e3d69605b3de4b7d96916f"}, + {file = "littleutils-0.2.4-py3-none-any.whl", hash = "sha256:d10d5fe2e107c49fe2fc2904a08d6e5a302b41f8405921835ffcc323782d5dbc"}, + {file = "littleutils-0.2.4.tar.gz", hash = "sha256:c7835b01020ced42e291118b7d78fb16bc2d9a1b4f3f42f3cb3787bb4da53d19"}, ] [[package]] name = "markdown" -version = "3.2.1" -description = "Python implementation of Markdown." +version = "3.7" +description = "Python implementation of John Gruber's Markdown." optional = false -python-versions = ">=3.5" +python-versions = ">=3.8" +groups = ["main"] files = [ - {file = "Markdown-3.2.1-py2.py3-none-any.whl", hash = "sha256:e4795399163109457d4c5af2183fbe6b60326c17cfdf25ce6e7474c6624f725d"}, - {file = "Markdown-3.2.1.tar.gz", hash = "sha256:90fee683eeabe1a92e149f7ba74e5ccdc81cd397bd6c516d93a8da0ef90b6902"}, + {file = "Markdown-3.7-py3-none-any.whl", hash = "sha256:7eb6df5690b81a1d7942992c97fad2938e956e79df20cbc6186e9c3a77b1c803"}, + {file = "markdown-3.7.tar.gz", hash = "sha256:2ae2471477cfd02dbbf038d5d9bc226d40def84b4fe2986e49b59b6b472bbed2"}, ] -[package.dependencies] -setuptools = ">=36" - [package.extras] +docs = ["mdx-gh-links (>=0.2)", "mkdocs (>=1.5)", "mkdocs-gen-files", "mkdocs-literate-nav", "mkdocs-nature (>=0.6)", "mkdocs-section-index", "mkdocstrings[python]"] testing = ["coverage", "pyyaml"] [[package]] @@ -205,31 +344,49 @@ version = "0.6.1" description = "McCabe checker, plugin for flake8" optional = true python-versions = "*" +groups = ["dev"] files = [ {file = "mccabe-0.6.1-py2.py3-none-any.whl", hash = "sha256:ab8a6258860da4b6677da4bd2fe5dc2c659cff31b3ee4f7f5d64e79735b80d42"}, {file = "mccabe-0.6.1.tar.gz", hash = "sha256:dd8d182285a0fe56bace7f45b5e7d1a6ebcbf524e8f3bd87eb0f125271b8831f"}, ] +[[package]] +name = "outcome" +version = "1.3.0.post0" +description = "Capture the outcome of Python function calls." +optional = false +python-versions = ">=3.7" +groups = ["dev"] +files = [ + {file = "outcome-1.3.0.post0-py2.py3-none-any.whl", hash = "sha256:e771c5ce06d1415e356078d3bdd68523f284b4ce5419828922b6871e65eda82b"}, + {file = "outcome-1.3.0.post0.tar.gz", hash = "sha256:9dcf02e65f2971b80047b377468e72a268e15c0af3cf1238e6ff14f7f91143b8"}, +] + +[package.dependencies] +attrs = ">=19.2.0" + [[package]] name = "packaging" -version = "23.1" +version = "24.1" description = "Core utilities for Python packages" optional = false -python-versions = ">=3.7" +python-versions = ">=3.8" +groups = ["dev"] files = [ - {file = "packaging-23.1-py3-none-any.whl", hash = "sha256:994793af429502c4ea2ebf6bf664629d07c1a9fe974af92966e4b8d2df7edc61"}, - {file = "packaging-23.1.tar.gz", hash = "sha256:a392980d2b6cffa644431898be54b0045151319d1e7ec34f0cfed48767dd334f"}, + {file = "packaging-24.1-py3-none-any.whl", hash = "sha256:5b8f2217dbdbd2f7f384c41c628544e6d52f2d0f53c6d0c3ea61aa5d1d7ff124"}, + {file = "packaging-24.1.tar.gz", hash = "sha256:026ed72c8ed3fcce5bf8950572258698927fd1dbda10a5e981cdf0ac37f4f002"}, ] [[package]] name = "pluggy" -version = "1.0.0" +version = "1.5.0" description = "plugin and hook calling mechanisms for python" optional = false -python-versions = ">=3.6" +python-versions = ">=3.8" +groups = ["dev"] files = [ - {file = "pluggy-1.0.0-py2.py3-none-any.whl", hash = "sha256:74134bbf457f031a36d68416e1509f34bd5ccc019f0bcc952c7b909d06b37bd3"}, - {file = "pluggy-1.0.0.tar.gz", hash = "sha256:4224373bacce55f955a878bf9cfa763c1e360858e330072059e10bad68531159"}, + {file = "pluggy-1.5.0-py3-none-any.whl", hash = "sha256:44e1ad92c8ca002de6377e165f3e0f1be63266ab4d554740532335b9d75ea669"}, + {file = "pluggy-1.5.0.tar.gz", hash = "sha256:2cffa88e94fdc978c4c574f15f9e59b7f4201d439195c3715ca9e2486f1d0cf1"}, ] [package.extras] @@ -238,24 +395,26 @@ testing = ["pytest", "pytest-benchmark"] [[package]] name = "polib" -version = "1.1.1" +version = "1.2.0" description = "A library to manipulate gettext files (po and mo files)." optional = false python-versions = "*" +groups = ["dev"] files = [ - {file = "polib-1.1.1-py2.py3-none-any.whl", hash = "sha256:d3ee85e0c6788f789353416b1612c6c92d75fe6ccfac0029711974d6abd0f86d"}, - {file = "polib-1.1.1.tar.gz", hash = "sha256:e02c355ae5e054912e3b0d16febc56510eff7e49d60bf22aecb463bd2f2a2dfa"}, + {file = "polib-1.2.0-py2.py3-none-any.whl", hash = "sha256:1c77ee1b81feb31df9bca258cbc58db1bbb32d10214b173882452c73af06d62d"}, + {file = "polib-1.2.0.tar.gz", hash = "sha256:f3ef94aefed6e183e342a8a269ae1fc4742ba193186ad76f175938621dbfc26b"}, ] [[package]] name = "pure-eval" -version = "0.2.2" +version = "0.2.3" description = "Safely evaluate AST nodes without side effects" optional = false python-versions = "*" +groups = ["main"] files = [ - {file = "pure_eval-0.2.2-py3-none-any.whl", hash = "sha256:01eaab343580944bc56080ebe0a674b39ec44a945e6d09ba7db3cb8cec289350"}, - {file = "pure_eval-0.2.2.tar.gz", hash = "sha256:2b45320af6dfaa1750f543d714b6d1c520a1688dec6fd24d339063ce0aaa9ac3"}, + {file = "pure_eval-0.2.3-py3-none-any.whl", hash = "sha256:1db8e35b67b3d218d818ae653e27f06c3aa420901fa7b081ca98cbedc874e0d0"}, + {file = "pure_eval-0.2.3.tar.gz", hash = "sha256:5f4e983f40564c576c7c8635ae88db5956bb2229d7e9237d03b3c0b0190eaf42"}, ] [package.extras] @@ -263,39 +422,68 @@ tests = ["pytest"] [[package]] name = "pycodestyle" -version = "2.6.0" +version = "2.7.0" description = "Python style guide checker" optional = true python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*" +groups = ["dev"] +files = [ + {file = "pycodestyle-2.7.0-py2.py3-none-any.whl", hash = "sha256:514f76d918fcc0b55c6680472f0a37970994e07bbb80725808c17089be302068"}, + {file = "pycodestyle-2.7.0.tar.gz", hash = "sha256:c389c1d06bf7904078ca03399a4816f974a1d590090fecea0c63ec26ebaf1cef"}, +] + +[[package]] +name = "pycparser" +version = "2.22" +description = "C parser in Python" +optional = false +python-versions = ">=3.8" +groups = ["dev"] +markers = "os_name == \"nt\" and implementation_name != \"pypy\"" files = [ - {file = "pycodestyle-2.6.0-py2.py3-none-any.whl", hash = "sha256:2295e7b2f6b5bd100585ebcb1f616591b652db8a741695b3d8f5d28bdc934367"}, - {file = "pycodestyle-2.6.0.tar.gz", hash = "sha256:c58a7d2815e0e8d7972bf1803331fb0152f867bd89adf8a01dfd55085434192e"}, + {file = "pycparser-2.22-py3-none-any.whl", hash = "sha256:c3702b6d3dd8c7abc1afa565d7e63d53a1d0bd86cdc24edd75470f4de499cfcc"}, + {file = "pycparser-2.22.tar.gz", hash = "sha256:491c8be9c040f5390f5bf44a5b07752bd07f56edf992381b05c701439eec10f6"}, ] [[package]] name = "pyflakes" -version = "2.2.0" +version = "2.3.1" description = "passive checker of Python programs" optional = false python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*" +groups = ["main", "dev"] files = [ - {file = "pyflakes-2.2.0-py2.py3-none-any.whl", hash = "sha256:0d94e0e05a19e57a99444b6ddcf9a6eb2e5c68d3ca1e98e90707af8152c90a92"}, - {file = "pyflakes-2.2.0.tar.gz", hash = "sha256:35b2d75ee967ea93b55750aa9edbbf72813e06a66ba54438df2cfac9e3c27fc8"}, + {file = "pyflakes-2.3.1-py2.py3-none-any.whl", hash = "sha256:7893783d01b8a89811dd72d7dfd4d84ff098e5eed95cfa8905b22bbffe52efc3"}, + {file = "pyflakes-2.3.1.tar.gz", hash = "sha256:f5bc8ecabc05bb9d291eb5203d6810b49040f6ff446a756326104746cc00c1db"}, ] [[package]] name = "pygments" -version = "2.15.0" +version = "2.18.0" description = "Pygments is a syntax highlighting package written in Python." optional = false -python-versions = ">=3.7" +python-versions = ">=3.8" +groups = ["main"] files = [ - {file = "Pygments-2.15.0-py3-none-any.whl", hash = "sha256:77a3299119af881904cd5ecd1ac6a66214b6e9bed1f2db16993b54adede64094"}, - {file = "Pygments-2.15.0.tar.gz", hash = "sha256:f7e36cffc4c517fbc252861b9a6e4644ca0e5abadf9a113c72d1358ad09b9500"}, + {file = "pygments-2.18.0-py3-none-any.whl", hash = "sha256:b8e6aca0523f3ab76fee51799c488e38782ac06eafcf95e7ba832985c8e7b13a"}, + {file = "pygments-2.18.0.tar.gz", hash = "sha256:786ff802f32e91311bff3889f6e9a86e81505fe99f2735bb6d60ae0c5004f199"}, ] [package.extras] -plugins = ["importlib-metadata"] +windows-terminal = ["colorama (>=0.4.6)"] + +[[package]] +name = "pysocks" +version = "1.7.1" +description = "A Python SOCKS client module. See https://github.com/Anorov/PySocks for more information." +optional = false +python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*" +groups = ["dev"] +files = [ + {file = "PySocks-1.7.1-py27-none-any.whl", hash = "sha256:08e69f092cc6dbe92a0fdd16eeb9b9ffbc13cadfe5ca4c7bd92ffb078b293299"}, + {file = "PySocks-1.7.1-py3-none-any.whl", hash = "sha256:2725bd0a9925919b9b51739eea5f9e2bae91e83288108a9ad338b2e3a4435ee5"}, + {file = "PySocks-1.7.1.tar.gz", hash = "sha256:3f8804571ebe159c380ac6de37643bb4685970655d3bba243530d6558b799aa0"}, +] [[package]] name = "pytest" @@ -303,6 +491,7 @@ version = "7.3.1" description = "pytest: simple powerful testing with Python" optional = false python-versions = ">=3.7" +groups = ["dev"] files = [ {file = "pytest-7.3.1-py3-none-any.whl", hash = "sha256:3799fa815351fea3a5e96ac7e503a96fa51cc9942c3753cda7651b93c1cfa362"}, {file = "pytest-7.3.1.tar.gz", hash = "sha256:434afafd78b1d78ed0addf160ad2b77a30d35d4bdf8af234fe621919d9ed15e3"}, @@ -323,6 +512,7 @@ version = "0.6.1" description = "Helper for running python code indirectly" optional = false python-versions = "*" +groups = ["main"] files = [ {file = "python_runner-0.6.1-py3-none-any.whl", hash = "sha256:0f8ab76bec0fa9be907e85ef8eb837051b4e15d434d991069a3da7dc33d1e349"}, {file = "python_runner-0.6.1.tar.gz", hash = "sha256:a65368abc006613c9dae064cac012da11ff9e324db2280b9a27712f980414e93"}, @@ -333,27 +523,34 @@ tests = ["pytest", "snoop"] [[package]] name = "selenium" -version = "3.141.0" -description = "Python bindings for Selenium" +version = "4.25.0" +description = "Official Python bindings for Selenium WebDriver" optional = false -python-versions = "*" +python-versions = ">=3.8" +groups = ["dev"] files = [ - {file = "selenium-3.141.0-py2.py3-none-any.whl", hash = "sha256:2d7131d7bc5a5b99a2d9b04aaf2612c411b03b8ca1b1ee8d3de5845a9be2cb3c"}, - {file = "selenium-3.141.0.tar.gz", hash = "sha256:deaf32b60ad91a4611b98d8002757f29e6f2c2d5fcaf202e1c9ad06d6772300d"}, + {file = "selenium-4.25.0-py3-none-any.whl", hash = "sha256:3798d2d12b4a570bc5790163ba57fef10b2afee958bf1d80f2a3cf07c4141f33"}, + {file = "selenium-4.25.0.tar.gz", hash = "sha256:95d08d3b82fb353f3c474895154516604c7f0e6a9a565ae6498ef36c9bac6921"}, ] [package.dependencies] -urllib3 = "*" +certifi = ">=2021.10.8" +trio = ">=0.17,<1.0" +trio-websocket = ">=0.9,<1.0" +typing_extensions = ">=4.9,<5.0" +urllib3 = {version = ">=1.26,<3", extras = ["socks"]} +websocket-client = ">=1.8,<2.0" [[package]] name = "sentry-sdk" -version = "2.8.0" +version = "2.17.0" description = "Python client for Sentry (https://sentry.io)" optional = false python-versions = ">=3.6" +groups = ["main"] files = [ - {file = "sentry_sdk-2.8.0-py2.py3-none-any.whl", hash = "sha256:6051562d2cfa8087bb8b4b8b79dc44690f8a054762a29c07e22588b1f619bfb5"}, - {file = "sentry_sdk-2.8.0.tar.gz", hash = "sha256:aa4314f877d9cd9add5a0c9ba18e3f27f99f7de835ce36bd150e48a41c7c646f"}, + {file = "sentry_sdk-2.17.0-py2.py3-none-any.whl", hash = "sha256:625955884b862cc58748920f9e21efdfb8e0d4f98cca4ab0d3918576d5b606ad"}, + {file = "sentry_sdk-2.17.0.tar.gz", hash = "sha256:dd0a05352b78ffeacced73a94e86f38b32e2eae15fff5f30ca5abb568a72eacf"}, ] [package.dependencies] @@ -376,14 +573,16 @@ falcon = ["falcon (>=1.4)"] fastapi = ["fastapi (>=0.79.0)"] flask = ["blinker (>=1.1)", "flask (>=0.11)", "markupsafe"] grpcio = ["grpcio (>=1.21.1)", "protobuf (>=3.8.0)"] +http2 = ["httpcore[http2] (==1.*)"] httpx = ["httpx (>=0.16.0)"] huey = ["huey (>=2)"] huggingface-hub = ["huggingface-hub (>=0.22)"] langchain = ["langchain (>=0.0.210)"] +litestar = ["litestar (>=2.0.0)"] loguru = ["loguru (>=0.5)"] openai = ["openai (>=1.0.0)", "tiktoken (>=0.3.0)"] opentelemetry = ["opentelemetry-distro (>=0.35b0)"] -opentelemetry-experimental = ["opentelemetry-instrumentation-aio-pika (==0.46b0)", "opentelemetry-instrumentation-aiohttp-client (==0.46b0)", "opentelemetry-instrumentation-aiopg (==0.46b0)", "opentelemetry-instrumentation-asgi (==0.46b0)", "opentelemetry-instrumentation-asyncio (==0.46b0)", "opentelemetry-instrumentation-asyncpg (==0.46b0)", "opentelemetry-instrumentation-aws-lambda (==0.46b0)", "opentelemetry-instrumentation-boto (==0.46b0)", "opentelemetry-instrumentation-boto3sqs (==0.46b0)", "opentelemetry-instrumentation-botocore (==0.46b0)", "opentelemetry-instrumentation-cassandra (==0.46b0)", "opentelemetry-instrumentation-celery (==0.46b0)", "opentelemetry-instrumentation-confluent-kafka (==0.46b0)", "opentelemetry-instrumentation-dbapi (==0.46b0)", "opentelemetry-instrumentation-django (==0.46b0)", "opentelemetry-instrumentation-elasticsearch (==0.46b0)", "opentelemetry-instrumentation-falcon (==0.46b0)", "opentelemetry-instrumentation-fastapi (==0.46b0)", "opentelemetry-instrumentation-flask (==0.46b0)", "opentelemetry-instrumentation-grpc (==0.46b0)", "opentelemetry-instrumentation-httpx (==0.46b0)", "opentelemetry-instrumentation-jinja2 (==0.46b0)", "opentelemetry-instrumentation-kafka-python (==0.46b0)", "opentelemetry-instrumentation-logging (==0.46b0)", "opentelemetry-instrumentation-mysql (==0.46b0)", "opentelemetry-instrumentation-mysqlclient (==0.46b0)", "opentelemetry-instrumentation-pika (==0.46b0)", "opentelemetry-instrumentation-psycopg (==0.46b0)", "opentelemetry-instrumentation-psycopg2 (==0.46b0)", "opentelemetry-instrumentation-pymemcache (==0.46b0)", "opentelemetry-instrumentation-pymongo (==0.46b0)", "opentelemetry-instrumentation-pymysql (==0.46b0)", "opentelemetry-instrumentation-pyramid (==0.46b0)", "opentelemetry-instrumentation-redis (==0.46b0)", "opentelemetry-instrumentation-remoulade (==0.46b0)", "opentelemetry-instrumentation-requests (==0.46b0)", "opentelemetry-instrumentation-sklearn (==0.46b0)", "opentelemetry-instrumentation-sqlalchemy (==0.46b0)", "opentelemetry-instrumentation-sqlite3 (==0.46b0)", "opentelemetry-instrumentation-starlette (==0.46b0)", "opentelemetry-instrumentation-system-metrics (==0.46b0)", "opentelemetry-instrumentation-threading (==0.46b0)", "opentelemetry-instrumentation-tornado (==0.46b0)", "opentelemetry-instrumentation-tortoiseorm (==0.46b0)", "opentelemetry-instrumentation-urllib (==0.46b0)", "opentelemetry-instrumentation-urllib3 (==0.46b0)", "opentelemetry-instrumentation-wsgi (==0.46b0)"] +opentelemetry-experimental = ["opentelemetry-distro"] pure-eval = ["asttokens", "executing", "pure-eval"] pymongo = ["pymongo (>=3.1)"] pyspark = ["pyspark (>=2.4.4)"] @@ -397,19 +596,24 @@ tornado = ["tornado (>=6)"] [[package]] name = "setuptools" -version = "67.8.0" +version = "78.1.1" description = "Easily download, build, install, upgrade, and uninstall Python packages" optional = false -python-versions = ">=3.7" +python-versions = ">=3.9" +groups = ["main"] files = [ - {file = "setuptools-67.8.0-py3-none-any.whl", hash = "sha256:5df61bf30bb10c6f756eb19e7c9f3b473051f48db77fddbe06ff2ca307df9a6f"}, - {file = "setuptools-67.8.0.tar.gz", hash = "sha256:62642358adc77ffa87233bc4d2354c4b2682d214048f500964dbe760ccedf102"}, + {file = "setuptools-78.1.1-py3-none-any.whl", hash = "sha256:c3a9c4211ff4c309edb8b8c4f1cbfa7ae324c4ba9f91ff254e3d305b9fd54561"}, + {file = "setuptools-78.1.1.tar.gz", hash = "sha256:fcc17fd9cd898242f6b4adfaca46137a9edef687f43e6f78469692a5e70d851d"}, ] [package.extras] -docs = ["furo", "jaraco.packaging (>=9)", "jaraco.tidelift (>=1.4)", "pygments-github-lexers (==0.0.5)", "rst.linker (>=1.9)", "sphinx (>=3.5)", "sphinx-favicon", "sphinx-hoverxref (<2)", "sphinx-inline-tabs", "sphinx-lint", "sphinx-notfound-page (==0.8.3)", "sphinx-reredirects", "sphinxcontrib-towncrier"] -testing = ["build[virtualenv]", "filelock (>=3.4.0)", "flake8-2020", "ini2toml[lite] (>=0.9)", "jaraco.envs (>=2.2)", "jaraco.path (>=3.2.0)", "pip (>=19.1)", "pip-run (>=8.8)", "pytest (>=6)", "pytest-black (>=0.3.7)", "pytest-checkdocs (>=2.4)", "pytest-cov", "pytest-enabler (>=1.3)", "pytest-mypy (>=0.9.1)", "pytest-perf", "pytest-ruff", "pytest-timeout", "pytest-xdist", "tomli-w (>=1.0.0)", "virtualenv (>=13.0.0)", "wheel"] -testing-integration = ["build[virtualenv]", "filelock (>=3.4.0)", "jaraco.envs (>=2.2)", "jaraco.path (>=3.2.0)", "pytest", "pytest-enabler", "pytest-xdist", "tomli", "virtualenv (>=13.0.0)", "wheel"] +check = ["pytest-checkdocs (>=2.4)", "pytest-ruff (>=0.2.1) ; sys_platform != \"cygwin\"", "ruff (>=0.8.0) ; sys_platform != \"cygwin\""] +core = ["importlib_metadata (>=6) ; python_version < \"3.10\"", "jaraco.functools (>=4)", "jaraco.text (>=3.7)", "more_itertools", "more_itertools (>=8.8)", "packaging (>=24.2)", "platformdirs (>=4.2.2)", "tomli (>=2.0.1) ; python_version < \"3.11\"", "wheel (>=0.43.0)"] +cover = ["pytest-cov"] +doc = ["furo", "jaraco.packaging (>=9.3)", "jaraco.tidelift (>=1.4)", "pygments-github-lexers (==0.0.5)", "pyproject-hooks (!=1.1)", "rst.linker (>=1.9)", "sphinx (>=3.5)", "sphinx-favicon", "sphinx-inline-tabs", "sphinx-lint", "sphinx-notfound-page (>=1,<2)", "sphinx-reredirects", "sphinxcontrib-towncrier", "towncrier (<24.7)"] +enabler = ["pytest-enabler (>=2.2)"] +test = ["build[virtualenv] (>=1.0.3)", "filelock (>=3.4.0)", "ini2toml[lite] (>=0.14)", "jaraco.develop (>=7.21) ; python_version >= \"3.9\" and sys_platform != \"cygwin\"", "jaraco.envs (>=2.2)", "jaraco.path (>=3.7.2)", "jaraco.test (>=5.5)", "packaging (>=24.2)", "pip (>=19.1)", "pyproject-hooks (!=1.1)", "pytest (>=6,!=8.1.*)", "pytest-home (>=0.5)", "pytest-perf ; sys_platform != \"cygwin\"", "pytest-subprocess", "pytest-timeout", "pytest-xdist (>=3)", "tomli-w (>=1.0.0)", "virtualenv (>=13.0.0)", "wheel (>=0.44.0)"] +type = ["importlib_metadata (>=7.0.2) ; python_version < \"3.10\"", "jaraco.develop (>=7.21) ; sys_platform != \"cygwin\"", "mypy (==1.14.*)", "pytest-mypy"] [[package]] name = "six" @@ -417,20 +621,34 @@ version = "1.16.0" description = "Python 2 and 3 compatibility utilities" optional = false python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*" +groups = ["main"] files = [ {file = "six-1.16.0-py2.py3-none-any.whl", hash = "sha256:8abb2f1d86890a2dfb989f9a77cfcfd3e47c2a354b01111771326f8aa26e0254"}, {file = "six-1.16.0.tar.gz", hash = "sha256:1e61c37477a1626458e36f7b1d82aa5c9b094fa4802892072e49de9c60c4c926"}, ] +[[package]] +name = "sniffio" +version = "1.3.1" +description = "Sniff out which async library your code is running under" +optional = false +python-versions = ">=3.7" +groups = ["dev"] +files = [ + {file = "sniffio-1.3.1-py3-none-any.whl", hash = "sha256:2f6da418d1f1e0fddd844478f41680e794e6051915791a034ff65e5f100525a2"}, + {file = "sniffio-1.3.1.tar.gz", hash = "sha256:f4324edc670a0f49750a81b895f35c3adb843cca46f0530f79fc1babb23789dc"}, +] + [[package]] name = "snoop" -version = "0.4.2" +version = "0.6.0" description = "Powerful debugging tools for Python" optional = false -python-versions = "*" +python-versions = ">=3.8" +groups = ["main"] files = [ - {file = "snoop-0.4.2-py2.py3-none-any.whl", hash = "sha256:0c5d7e472adb4cb37b8ed6631bea3aa8d128a8e9749229d11efe1823a637d282"}, - {file = "snoop-0.4.2.tar.gz", hash = "sha256:3ee2f843f64066b1963d830db66de0257a75b5104a7c83782afaaebca74c758c"}, + {file = "snoop-0.6.0-py3-none-any.whl", hash = "sha256:f5ea9060e65594bf404e6841086b4a964cc27bc30569109c91a470f948b0f729"}, + {file = "snoop-0.6.0.tar.gz", hash = "sha256:c615eddf84d8907f893dec7fde38768aa4b1d88d92d63055b6cfc07e5cde37ec"}, ] [package.dependencies] @@ -438,20 +656,32 @@ asttokens = "*" cheap-repr = ">=0.4.0" executing = "*" pygments = "*" -six = "*" [package.extras] -tests = ["Django", "birdseye", "littleutils", "numpy (>=1.16.5)", "pandas (>=0.24.2)", "pprintpp", "prettyprinter", "pytest", "pytest-order", "pytest-order (<=0.11.0)"] +tests = ["Django", "birdseye ; platform_python_implementation != \"PyPy\"", "littleutils", "numpy (>=1.16.5) ; platform_python_implementation != \"PyPy\"", "pandas (>=0.24.2) ; platform_python_implementation != \"PyPy\"", "pprintpp", "prettyprinter", "pytest", "pytest-order"] + +[[package]] +name = "sortedcontainers" +version = "2.4.0" +description = "Sorted Containers -- Sorted List, Sorted Dict, Sorted Set" +optional = false +python-versions = "*" +groups = ["dev"] +files = [ + {file = "sortedcontainers-2.4.0-py2.py3-none-any.whl", hash = "sha256:a163dcaede0f1c021485e957a39245190e74249897e2ae4b2aa38595db237ee0"}, + {file = "sortedcontainers-2.4.0.tar.gz", hash = "sha256:25caa5a06cc30b6b83d11423433f65d1f9d76c4c6a0c90e3379eaa43b9bfdb88"}, +] [[package]] name = "stack-data" -version = "0.6.1" +version = "0.6.3" description = "Extract data from python stack frames and tracebacks for informative displays" optional = false python-versions = "*" +groups = ["main"] files = [ - {file = "stack_data-0.6.1-py3-none-any.whl", hash = "sha256:960cb054d6a1b2fdd9cbd529e365b3c163e8dabf1272e02cfe36b58403cff5c6"}, - {file = "stack_data-0.6.1.tar.gz", hash = "sha256:6c9a10eb5f342415fe085db551d673955611afb821551f554d91772415464315"}, + {file = "stack_data-0.6.3-py3-none-any.whl", hash = "sha256:d5558e0c25a4cb0853cddad3d77da9891a08cb85dd9f9f91b9f8cd66e511e695"}, + {file = "stack_data-0.6.3.tar.gz", hash = "sha256:836a778de4fec4dcd1dcd89ed8abff8a221f58308462e1c4aa2a3cf30148f0b9"}, ] [package.dependencies] @@ -462,23 +692,108 @@ pure-eval = "*" [package.extras] tests = ["cython", "littleutils", "pygments", "pytest", "typeguard"] +[[package]] +name = "trio" +version = "0.27.0" +description = "A friendly Python library for async concurrency and I/O" +optional = false +python-versions = ">=3.8" +groups = ["dev"] +files = [ + {file = "trio-0.27.0-py3-none-any.whl", hash = "sha256:68eabbcf8f457d925df62da780eff15ff5dc68fd6b367e2dde59f7aaf2a0b884"}, + {file = "trio-0.27.0.tar.gz", hash = "sha256:1dcc95ab1726b2da054afea8fd761af74bad79bd52381b84eae408e983c76831"}, +] + +[package.dependencies] +attrs = ">=23.2.0" +cffi = {version = ">=1.14", markers = "os_name == \"nt\" and implementation_name != \"pypy\""} +idna = "*" +outcome = "*" +sniffio = ">=1.3.0" +sortedcontainers = "*" + +[[package]] +name = "trio-websocket" +version = "0.11.1" +description = "WebSocket library for Trio" +optional = false +python-versions = ">=3.7" +groups = ["dev"] +files = [ + {file = "trio-websocket-0.11.1.tar.gz", hash = "sha256:18c11793647703c158b1f6e62de638acada927344d534e3c7628eedcb746839f"}, + {file = "trio_websocket-0.11.1-py3-none-any.whl", hash = "sha256:520d046b0d030cf970b8b2b2e00c4c2245b3807853ecd44214acd33d74581638"}, +] + +[package.dependencies] +trio = ">=0.11" +wsproto = ">=0.14" + +[[package]] +name = "typing-extensions" +version = "4.12.2" +description = "Backported and Experimental Type Hints for Python 3.8+" +optional = false +python-versions = ">=3.8" +groups = ["dev"] +files = [ + {file = "typing_extensions-4.12.2-py3-none-any.whl", hash = "sha256:04e5ca0351e0f3f85c6853954072df659d0d13fac324d0072316b67d7794700d"}, + {file = "typing_extensions-4.12.2.tar.gz", hash = "sha256:1a7ead55c7e559dd4dee8856e3a88b41225abfe1ce8df57b7c13915fe121ffb8"}, +] + [[package]] name = "urllib3" -version = "1.26.18" +version = "2.5.0" description = "HTTP library with thread-safe connection pooling, file post, and more." optional = false -python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*, !=3.4.*, !=3.5.*" +python-versions = ">=3.9" +groups = ["main", "dev"] +files = [ + {file = "urllib3-2.5.0-py3-none-any.whl", hash = "sha256:e6b01673c0fa6a13e374b50871808eb3bf7046c4b125b216f6bf1cc604cff0dc"}, + {file = "urllib3-2.5.0.tar.gz", hash = "sha256:3fc47733c7e419d4bc3f6b3dc2b4f890bb743906a30d56ba4a5bfa4bbff92760"}, +] + +[package.dependencies] +pysocks = {version = ">=1.5.6,<1.5.7 || >1.5.7,<2.0", optional = true, markers = "extra == \"socks\""} + +[package.extras] +brotli = ["brotli (>=1.0.9) ; platform_python_implementation == \"CPython\"", "brotlicffi (>=0.8.0) ; platform_python_implementation != \"CPython\""] +h2 = ["h2 (>=4,<5)"] +socks = ["pysocks (>=1.5.6,!=1.5.7,<2.0)"] +zstd = ["zstandard (>=0.18.0)"] + +[[package]] +name = "websocket-client" +version = "1.8.0" +description = "WebSocket client for Python with low level API options" +optional = false +python-versions = ">=3.8" +groups = ["dev"] files = [ - {file = "urllib3-1.26.18-py2.py3-none-any.whl", hash = "sha256:34b97092d7e0a3a8cf7cd10e386f401b3737364026c45e622aa02903dffe0f07"}, - {file = "urllib3-1.26.18.tar.gz", hash = "sha256:f8ecc1bba5667413457c529ab955bf8c67b45db799d159066261719e328580a0"}, + {file = "websocket_client-1.8.0-py3-none-any.whl", hash = "sha256:17b44cc997f5c498e809b22cdf2d9c7a9e71c02c8cc2b6c56e7c2d1239bfa526"}, + {file = "websocket_client-1.8.0.tar.gz", hash = "sha256:3239df9f44da632f96012472805d40a23281a991027ce11d2f45a6f24ac4c3da"}, ] [package.extras] -brotli = ["brotli (==1.0.9)", "brotli (>=1.0.9)", "brotlicffi (>=0.8.0)", "brotlipy (>=0.6.0)"] -secure = ["certifi", "cryptography (>=1.3.4)", "idna (>=2.0.0)", "ipaddress", "pyOpenSSL (>=0.14)", "urllib3-secure-extra"] -socks = ["PySocks (>=1.5.6,!=1.5.7,<2.0)"] +docs = ["Sphinx (>=6.0)", "myst-parser (>=2.0.0)", "sphinx-rtd-theme (>=1.1.0)"] +optional = ["python-socks", "wsaccel"] +test = ["websockets"] + +[[package]] +name = "wsproto" +version = "1.2.0" +description = "WebSockets state-machine based protocol implementation" +optional = false +python-versions = ">=3.7.0" +groups = ["dev"] +files = [ + {file = "wsproto-1.2.0-py3-none-any.whl", hash = "sha256:b9acddd652b585d75b20477888c56642fdade28bdfd3579aa24a4d2c037dd736"}, + {file = "wsproto-1.2.0.tar.gz", hash = "sha256:ad565f26ecb92588a3e43bc3d96164de84cd9902482b130d0ddbaa9664a85065"}, +] + +[package.dependencies] +h11 = ">=0.9.0,<1" [metadata] -lock-version = "2.0" -python-versions = "3.11.2" -content-hash = "d6bbb5839e569d323a39807c794029247b5ab3cd2a630aad97f053b649e106e7" +lock-version = "2.1" +python-versions = "3.12.1" +content-hash = "100a6c0c63a1867705570052caaaaec920c9c9b8b633d80ba4505048eb9448ea" diff --git a/pyproject.toml b/pyproject.toml index 578309d8..7f7f8f4a 100644 --- a/pyproject.toml +++ b/pyproject.toml @@ -6,7 +6,7 @@ authors = ["Alex Hall "] package-mode = false [tool.poetry.dependencies] -python = "3.11.2" +python = "3.12.1" birdseye = {git = "https://github.com/alexmojaki/birdseye.git", branch = "futurecoder"} snoop = "*" asttokens = "*" @@ -27,11 +27,11 @@ setuptools = "*" [tool.poetry.dev-dependencies] flake8 = {version = "^3.8.3", optional = true} isort = "^5.1.4" -selenium = "^3.141.0" polib = "^1.1.1" [tool.poetry.group.dev.dependencies] pytest = "7.3.1" +selenium = "^4.24.0" [build-system] requires = ["poetry>=0.12"] diff --git a/tests/golden_files/en/test_transcript.json b/tests/golden_files/en/test_transcript.json index 49a59b85..fb3ddaa8 100644 --- a/tests/golden_files/en/test_transcript.json +++ b/tests/golden_files/en/test_transcript.json @@ -1247,27 +1247,27 @@ "passed": true, "result": [ { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 1\u001b[0m | sentence \u001b[38;5;197m=\u001b[39m \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello World\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 3\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mFalse\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 4\u001b[0m | new_sentence \u001b[38;5;197m=\u001b[39m \u001b[38;5;186m'\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mH\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186me\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186me\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 1\u001b[0m | sentence \u001b[38;5;204m=\u001b[39m \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello World\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 3\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mFalse\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 4\u001b[0m | new_sentence \u001b[38;5;204m=\u001b[39m \u001b[38;5;186m'\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mH\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186me\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186me\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186ml\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mel\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mell\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186ml\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mel\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mell\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186m \u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello \u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", + "text": "\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186m \u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello \u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mW\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello W\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Wo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", + "text": "\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mW\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello W\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Wo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mr\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Wor\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186ml\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Worl\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", + "text": "\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mr\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Wor\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186ml\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Worl\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186md\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello World\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 10\u001b[0m | print(new_sentence)\n", + "text": "\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186md\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello World\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 10\u001b[0m | print(new_sentence)\n", "type": "snoop" }, { @@ -2786,7 +2786,7 @@ ] } ], - "friendly": "

    A TypeError is usually caused by trying\nto combine two incompatible types of objects,\nby calling a function with the wrong type of object,\nor by trying to do an operation not allowed on a given type of object.

    \n

    The parenthesis () following f are interpreted\nby Python as a function call for f.\nHowever, f is not a function but an object of type str.

    ", + "friendly": "

    A TypeError is usually caused by trying\nto combine two incompatible types of objects,\nby calling a function with the wrong type of object,\nor by trying to do an operation not allowed on a given type of object.

    \n

    Because of the surrounding parenthesis, ` \nis interpreted by Python as indicating a function call forf, which is an object of typestr`\nwhich cannot be called.

    ", "tail": "" } ], @@ -3811,7 +3811,7 @@ "passed": true, "result": [ { - "friendly": "

    A SyntaxError occurs when Python cannot understand your code.

    \n

    I suspect that you were trying to use a quote character inside a string\nthat was enclosed in quotes of the same kind.\nPerhaps you should have escaped the inner quote character:

    \n
    print('Alice\\'s Diner')\n            ^^\n
    ", + "friendly": "

    A SyntaxError occurs when Python cannot understand your code.

    \n

    You started writing a string with a single or double quote\nbut never ended the string with another quote on that line.

    ", "text": " print('Alice's Diner')\n ^\nSyntaxError: unterminated string literal (detected at line 1)\nat line 1\n", "type": "syntax_error" } @@ -4978,11 +4978,11 @@ "passed": true, "result": [ { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 1\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_many\u001b[39m(n, thing):\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_twice\u001b[39m(x):\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | print_twice(\u001b[38;5;186m\"\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m\"\u001b[39m)\n\u001b[38;5;242m \u001b[0m\u001b[36m\u001b[1m>>> Call to print_twice in File \"/my_program.py\", line 5\u001b[0m\n\u001b[38;5;242m \u001b[0m...... x = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_twice\u001b[39m(x):\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | print_many(\u001b[38;5;141m2\u001b[39m, x)\n\u001b[38;5;242m \u001b[0m\u001b[36m\u001b[1m>>> Call to print_many in File \"/my_program.py\", line 1\u001b[0m\n\u001b[38;5;242m \u001b[0m...... n = \u001b[38;5;141m2\u001b[39m\n\u001b[38;5;242m \u001b[0m...... thing = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 1\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_many\u001b[39m(n, thing):\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;197min\u001b[39m range(n):\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 1\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_many\u001b[39m(n, thing):\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_twice\u001b[39m(x):\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | print_twice(\u001b[38;5;186m\"\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m\"\u001b[39m)\n\u001b[38;5;245m \u001b[0m\u001b[36m\u001b[1m>>> Call to print_twice in File \"/my_program.py\", line 5\u001b[0m\n\u001b[38;5;245m \u001b[0m...... x = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_twice\u001b[39m(x):\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | print_many(\u001b[38;5;141m2\u001b[39m, x)\n\u001b[38;5;245m \u001b[0m\u001b[36m\u001b[1m>>> Call to print_many in File \"/my_program.py\", line 1\u001b[0m\n\u001b[38;5;245m \u001b[0m...... n = \u001b[38;5;141m2\u001b[39m\n\u001b[38;5;245m \u001b[0m...... thing = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 1\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_many\u001b[39m(n, thing):\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;204min\u001b[39m range(n):\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m.......... _ = \u001b[38;5;141m0\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 3\u001b[0m | print(thing)\n", + "text": "\u001b[38;5;245m \u001b[0m.......... _ = \u001b[38;5;141m0\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 3\u001b[0m | print(thing)\n", "type": "snoop" }, { @@ -4994,11 +4994,11 @@ "type": "stdout" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;197min\u001b[39m range(n):\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;204min\u001b[39m range(n):\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m.......... _ = \u001b[38;5;141m1\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 3\u001b[0m | print(thing)\n", + "text": "\u001b[38;5;245m \u001b[0m.......... _ = \u001b[38;5;141m1\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 3\u001b[0m | print(thing)\n", "type": "snoop" }, { @@ -5010,11 +5010,11 @@ "type": "stdout" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;197min\u001b[39m range(n):\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;204min\u001b[39m range(n):\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[32m\u001b[1m<<< Return value from print_many: \u001b[0m\u001b[38;5;81mNone\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | print_many(\u001b[38;5;141m2\u001b[39m, x)\n\u001b[38;5;242m \u001b[0m\u001b[32m\u001b[1m<<< Return value from print_twice: \u001b[0m\u001b[38;5;81mNone\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | print_twice(\u001b[38;5;186m\"\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m\"\u001b[39m)\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[32m\u001b[1m<<< Return value from print_many: \u001b[0m\u001b[38;5;81mNone\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | print_many(\u001b[38;5;141m2\u001b[39m, x)\n\u001b[38;5;245m \u001b[0m\u001b[32m\u001b[1m<<< Return value from print_twice: \u001b[0m\u001b[38;5;81mNone\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | print_twice(\u001b[38;5;186m\"\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m\"\u001b[39m)\n", "type": "snoop" } ] @@ -7228,5 +7228,371 @@ ] }, "step": "nested_dictionaries" + }, + { + "get_solution": "program", + "page": "Creating Key-Value Pairs", + "program": [ + "cart = []", + "cart.append('dog')", + "cart.append('box')", + "print(cart)" + ], + "response": { + "passed": true, + "prediction": { + "answer": "['dog', 'box']", + "choices": [ + "[]", + "['dog']", + "['box']", + "['dog', 'box']", + "['box', 'dog']", + "['dog', 'dog']", + "['box', 'box']", + "Error" + ] + }, + "result": [ + { + "text": "['dog', 'box']\n", + "type": "stdout" + } + ] + }, + "step": "list_append_reminder" + }, + { + "get_solution": "program", + "page": "Creating Key-Value Pairs", + "program": [ + "cart = ['dog', 'cat']", + "cart[1] = 'box'", + "print(cart)" + ], + "response": { + "passed": true, + "prediction": { + "answer": "['dog', 'box']", + "choices": [ + "['box']", + "['dog', 'cat']", + "['box', 'dog']", + "['box', 'cat']", + "['dog', 'box']", + "['cat', 'box']", + "['box', 'dog', 'cat']", + "['dog', 'box', 'cat']", + "['dog', 'cat', 'box']", + "Error" + ] + }, + "result": [ + { + "text": "['dog', 'box']\n", + "type": "stdout" + } + ] + }, + "step": "list_assign_reminder" + }, + { + "get_solution": "program", + "page": "Creating Key-Value Pairs", + "program": [ + "cart = []", + "cart[0] = 'dog'", + "cart[1] = 'box'", + "print(cart)" + ], + "response": { + "passed": true, + "prediction": { + "answer": "Error", + "choices": [ + "[]", + "['dog']", + "['box']", + "['dog', 'box']", + "['box', 'dog']", + "['dog', 'dog']", + "['box', 'box']", + "Error" + ] + }, + "result": [ + { + "data": [ + { + "didyoumean": [], + "exception": { + "message": "list assignment index out of range", + "type": "IndexError" + }, + "frames": [ + { + "filename": "/my_program.py", + "lineno": 2, + "lines": [ + { + "is_current": true, + "lineno": 2, + "text": "cart[0] = 'dog'", + "type": "line" + } + ], + "name": "", + "type": "frame", + "variables": [ + { + "name": "cart\n", + "value": "[]\n" + } + ] + } + ], + "friendly": "

    An IndexError occurs when you try to get an item from a list,\na tuple, or a similar object (sequence), and use an index which\ndoes not exist; typically, this happens because the index you give\nis greater than the length of the sequence.

    \n

    You have tried to assign a value to index 0 of cart,\na list which contains no item.

    ", + "tail": "" + } + ], + "text": [ + "Traceback (most recent call last):", + " File \"/my_program.py\", line 2, in ", + " 1 | cart = []", + "--> 2 | cart[0] = 'dog'", + " ^^^^^^^", + "cart = []", + "", + "IndexError: list assignment index out of range" + ], + "type": "traceback" + } + ] + }, + "step": "list_assign_invalid" + }, + { + "get_solution": "program", + "page": "Creating Key-Value Pairs", + "program": [ + "quantities = {}", + "quantities['dog'] = 500", + "quantities['box'] = 2", + "print(quantities)" + ], + "response": { + "passed": true, + "prediction": { + "answer": "{'dog': 500, 'box': 2}", + "choices": [ + "{'dog': 500, 'box': 2}", + "{'dog': 2, 'box': 500}", + "{2: 'dog', 500: 'box'}", + "{500: 'dog', 2: 'box'}", + "Error" + ] + }, + "result": [ + { + "text": "{'dog': 500, 'box': 2}\n", + "type": "stdout" + } + ] + }, + "step": "dict_assignment_valid" + }, + { + "get_solution": "program", + "page": "Creating Key-Value Pairs", + "program": [ + "def buy_quantity(quantities, item, quantity):", + " quantities[item] = quantity" + ], + "response": { + "passed": true, + "result": [] + }, + "step": "buy_quantity_exercise" + }, + { + "get_solution": "program", + "page": "Creating Key-Value Pairs", + "program": [ + "def buy_quantity(quantities, item, quantity):", + " quantities[item] = quantity", + "", + "def test():", + " quantities = {}", + " for _ in range(3):", + " print('What would you like to buy?')", + " item = input()", + "", + " print('How many?')", + " quantity = int(input())", + "", + " buy_quantity(quantities, item, quantity)", + "", + " print(\"OK, here's your cart so far:\")", + " print(quantities)", + "", + "test()" + ], + "response": { + "passed": true, + "result": [ + { + "text": "What would you like to buy?\n", + "type": "stdout" + }, + { + "text": "", + "type": "input_prompt" + }, + { + "text": "\n", + "type": "stdout" + }, + { + "text": "How many?\n", + "type": "stdout" + }, + { + "text": "", + "type": "input_prompt" + }, + { + "text": "\n", + "type": "stdout" + }, + { + "text": "OK, here's your cart so far:\n{'apple': 3}\nWhat would you like to buy?\n", + "type": "stdout" + }, + { + "text": "", + "type": "input_prompt" + }, + { + "text": "\n", + "type": "stdout" + }, + { + "text": "How many?\n", + "type": "stdout" + }, + { + "text": "", + "type": "input_prompt" + }, + { + "text": "\n", + "type": "stdout" + }, + { + "text": "OK, here's your cart so far:\n{'apple': 3, 'banana': 5}\nWhat would you like to buy?\n", + "type": "stdout" + }, + { + "text": "", + "type": "input_prompt" + }, + { + "text": "\n", + "type": "stdout" + }, + { + "text": "How many?\n", + "type": "stdout" + }, + { + "text": "", + "type": "input_prompt" + }, + { + "text": "\n", + "type": "stdout" + }, + { + "text": "OK, here's your cart so far:\n{'apple': 3, 'banana': 5, 'cat': 2}\n", + "type": "stdout" + } + ] + }, + "step": "buy_quantity_input_test" + }, + { + "get_solution": "program", + "page": "Creating Key-Value Pairs", + "program": [ + "def total_cost_per_item(quantities, prices):", + " totals = {}", + " for item in quantities:", + " totals[item] = quantities[item] * prices[item]", + " return totals" + ], + "response": { + "passed": true, + "result": [] + }, + "step": "total_cost_per_item_exercise" + }, + { + "get_solution": "program", + "page": "Creating Key-Value Pairs", + "program": [ + "def make_english_to_german(english_to_french, french_to_german):", + " english_to_german = {}", + " for english in english_to_french:", + " french = english_to_french[english]", + " german = french_to_german[french]", + " english_to_german[english] = german", + " return english_to_german" + ], + "response": { + "passed": true, + "result": [] + }, + "step": "make_english_to_german_exercise" + }, + { + "get_solution": "program", + "page": "Creating Key-Value Pairs", + "program": [ + "def swap_keys_values(d):", + " new_dict = {}", + " for key in d:", + " value = d[key]", + " new_dict[value] = key", + " return new_dict" + ], + "response": { + "passed": true, + "result": [] + }, + "step": "swap_keys_values_exercise" + }, + { + "get_solution": "program", + "page": "Creating Key-Value Pairs", + "program": [ + "def swap_keys_values(d):", + " new_dict = {}", + " for key in d:", + " new_dict[d[key]] = key", + " return new_dict", + "", + "print(swap_keys_values({'apple': 'pomme', 'avocado': 'avocat', 'lawyer': 'avocat'}))", + "print(swap_keys_values({'apple': 'pomme', 'lawyer': 'avocat', 'avocado': 'avocat'}))" + ], + "response": { + "passed": true, + "result": [ + { + "text": "{'pomme': 'apple', 'avocat': 'lawyer'}\n{'pomme': 'apple', 'avocat': 'avocado'}\n", + "type": "stdout" + } + ] + }, + "step": "avocado_or_lawyer" } ] \ No newline at end of file diff --git a/tests/golden_files/fr/test_transcript.json b/tests/golden_files/fr/test_transcript.json index bfdfb16b..d4e74041 100644 --- a/tests/golden_files/fr/test_transcript.json +++ b/tests/golden_files/fr/test_transcript.json @@ -17,12 +17,12 @@ "step": "first_expression" }, { + "get_solution": "program", "page": "Pr\u00e9sentation de la console", "program": [ "1+2" ], "response": { - "message": "", "passed": true, "result": [ { @@ -52,12 +52,12 @@ "step": "more_calculation" }, { + "get_solution": "program", "page": "Pr\u00e9sentation de la console", "program": [ "5 - 6" ], "response": { - "message": "", "passed": true, "result": [ { @@ -69,12 +69,12 @@ "step": "more_calculation" }, { + "get_solution": "program", "page": "Pr\u00e9sentation des chaines", "program": [ "'hello'" ], "response": { - "message": "", "passed": true, "result": [ { @@ -86,12 +86,12 @@ "step": "hello_string" }, { + "get_solution": "program", "page": "Concat\u00e9nation de chaines", "program": [ "'hello' + 'world'" ], "response": { - "message": "", "passed": true, "result": [ { @@ -120,15 +120,12 @@ "step": "hello_world_space" }, { - "get_solution": [ - "'hello ' + 'world'" - ], + "get_solution": "program", "page": "Concat\u00e9nation de chaines", "program": [ "'hello ' + 'world'" ], "response": { - "message": "", "passed": true, "result": [ { @@ -140,12 +137,12 @@ "step": "hello_world_space" }, { + "get_solution": "program", "page": "Pr\u00e9sentation des variables", "program": [ "mot = 'Hello'" ], "response": { - "message": "", "passed": true, "result": [] }, @@ -164,12 +161,12 @@ "step": "word_check" }, { + "get_solution": "program", "page": "Pr\u00e9sentation des variables", "program": [ "mot" ], "response": { - "message": "", "passed": true, "result": [ { @@ -181,12 +178,12 @@ "step": "word_check" }, { + "get_solution": "program", "page": "Pr\u00e9sentation des variables", "program": [ "'mot'" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "'mot'", @@ -208,12 +205,12 @@ "step": "word_string_check" }, { + "get_solution": "program", "page": "Pr\u00e9sentation des variables", "program": [ "soleil" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Erreur", @@ -311,31 +308,31 @@ "votre_nom = ' Alex'" ], "response": { - "message": "

    Pour cet exercice, choisissez un nom qui ne commence pas par une espace.

    ", + "message": "

    Pour cet exercice, choisissez un nom qui ne commence pas par un espace.

    ", "passed": false, "result": [] }, "step": "name_assign" }, { + "get_solution": "program", "page": "Utilisation de variables et de print()", "program": [ "votre_nom = 'Alex'" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "name_assign" }, { + "get_solution": "program", "page": "Utilisation de variables et de print()", "program": [ "'Hello ' + votre_nom" ], "response": { - "message": "", "passed": true, "result": [ { @@ -359,12 +356,12 @@ "step": "word_plus_name" }, { + "get_solution": "program", "page": "Utilisation de variables et de print()", "program": [ "mot + votre_nom" ], "response": { - "message": "", "passed": true, "result": [ { @@ -388,15 +385,12 @@ "step": "word_plus_name_with_space" }, { - "get_solution": [ - "mot + ' ' + votre_nom" - ], + "get_solution": "program", "page": "Utilisation de variables et de print()", "program": [ "mot + ' ' + votre_nom" ], "response": { - "message": "", "passed": true, "result": [ { @@ -408,24 +402,24 @@ "step": "word_plus_name_with_space" }, { + "get_solution": "program", "page": "Utilisation de variables et de print()", "program": [ "mot = 'Goodbye'" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "word_assign_goodbye" }, { + "get_solution": "program", "page": "Utilisation de variables et de print()", "program": [ "mot + ' ' + votre_nom" ], "response": { - "message": "", "passed": true, "result": [ { @@ -437,12 +431,12 @@ "step": "goodbye_plus_name" }, { + "get_solution": "program", "page": "Utilisation de variables et de print()", "program": [ "print(mot + ' ' + votre_nom)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -454,6 +448,7 @@ "step": "first_print" }, { + "get_solution": "program", "page": "\u00c9criture de scripts", "program": [ "mot = 'Hello'", @@ -463,7 +458,6 @@ "print(mot + ' ' + nom)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -475,6 +469,7 @@ "step": "editor_hello_world" }, { + "get_solution": "program", "page": "Stockage de r\u00e9sultats avec des variables", "program": [ "mot = 'Hello'", @@ -483,7 +478,6 @@ "print(phrase)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Hello World", @@ -507,6 +501,7 @@ "step": "sentence_equals_word_plus_name" }, { + "get_solution": "program", "page": "Stockage de r\u00e9sultats avec des variables", "program": [ "mot = 'Hello'", @@ -517,7 +512,6 @@ "print(phrase)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Hello World\nHello World", @@ -538,13 +532,13 @@ "step": "sentence_doesnt_change" }, { + "get_solution": "program", "page": "Pr\u00e9sentation des boucles for", "program": [ "nom = 'World'", "for caractere in nom: print(caractere)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -556,13 +550,13 @@ "step": "first_for_loop" }, { + "get_solution": "program", "page": "Indentation", "program": [ "for caractere in nom:", "print(caractere)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -575,6 +569,7 @@ "step": "missing_indentation" }, { + "get_solution": "program", "page": "Indentation", "program": [ "nom = 'World'", @@ -584,7 +579,6 @@ " print('---')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -596,6 +590,7 @@ "step": "two_indented_lines" }, { + "get_solution": "program", "page": "Indentation", "program": [ "nom = 'World'", @@ -605,7 +600,6 @@ "print('---')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -617,6 +611,7 @@ "step": "one_indented_line" }, { + "get_solution": "program", "page": "Indentation", "program": [ "for caractere in nom:", @@ -624,7 +619,6 @@ " print('---')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -648,7 +642,6 @@ " print('---' + caractere)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -671,7 +664,6 @@ " print(nom)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -683,6 +675,7 @@ "step": "loop_exercise_2" }, { + "get_solution": "program", "page": "Construction de chaines", "program": [ "hello = 'Hello'", @@ -691,7 +684,6 @@ "print(hello)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Hello\nHello!", @@ -712,6 +704,7 @@ "step": "hello_plus_equals" }, { + "get_solution": "program", "page": "Construction de chaines", "program": [ "nom = 'World'", @@ -721,7 +714,6 @@ " print(ligne)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "-W\n-Wo\n-Wor\n-Worl\n-World", @@ -747,6 +739,7 @@ "step": "name_triangle" }, { + "get_solution": "program", "page": "Construction de chaines", "program": [ "nom = 'World'", @@ -756,7 +749,6 @@ " ligne = ligne + caractere" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "-\n-W\n-Wo\n-Wor\n-Worl", @@ -777,12 +769,12 @@ "step": "name_triangle_missing_last_line" }, { + "get_solution": "program", "page": "Construction de chaines", "program": [ "'' + '' + ''" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "''", @@ -824,7 +816,6 @@ " print(ligne)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -851,7 +842,6 @@ " print(ligne)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -878,7 +868,6 @@ " print(ligne)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -907,7 +896,6 @@ "print(ligne)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -940,7 +928,6 @@ "print(ligne)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -977,7 +964,6 @@ "print(ligne)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -998,7 +984,7 @@ " print(espaces + caractere)" ], "response": { - "message": "

    On y est presque ! Vous avez une espace de trop avant chaque lettre.\nAssurez-vous que la premi\u00e8re fois que votre boucle appelle print votre variable qui contiendra les espaces soit une cha\u00eene vide.\nV\u00e9rifiez l'agencement de votre code.

    ", + "message": "

    On y est presque ! Vous avez un espace de trop avant chaque lettre.\nAssurez-vous que la premi\u00e8re fois que votre boucle appelle print votre variable qui contiendra les espaces soit une cha\u00eene vide.\nV\u00e9rifiez l'agencement de votre code.

    ", "passed": false, "result": [ { @@ -1025,7 +1011,6 @@ " espaces += ' '" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1037,6 +1022,7 @@ "step": "diagonal_name_bonus_challenge" }, { + "get_solution": "program", "page": "Pr\u00e9sentation des structures conditionnelles", "program": [ "condition = True", @@ -1045,7 +1031,6 @@ "print(condition)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1057,6 +1042,7 @@ "step": "introducing_booleans" }, { + "get_solution": "program", "page": "Pr\u00e9sentation des structures conditionnelles", "program": [ "if True:", @@ -1066,7 +1052,6 @@ " print('Ceci non')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1078,6 +1063,7 @@ "step": "first_if_statements" }, { + "get_solution": "program", "page": "Pr\u00e9sentation des structures conditionnelles", "program": [ "phrase = 'Hello World'", @@ -1087,7 +1073,6 @@ "print(phrase)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Hello World!", @@ -1107,6 +1092,7 @@ "step": "excited_example" }, { + "get_solution": "program", "page": "Pr\u00e9sentation des structures conditionnelles", "program": [ "phrase = 'Hello World'", @@ -1116,7 +1102,6 @@ "print(phrase)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Hello World", @@ -1155,7 +1140,6 @@ "print(phrase)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1167,6 +1151,7 @@ "step": "excited_confused_exercise" }, { + "get_solution": "program", "page": "Structures imbriqu\u00e9es", "program": [ "phrase = 'Hello World'", @@ -1181,7 +1166,6 @@ "print(phrase)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "H!e!l!l!o! !W!o!r!l!d!", @@ -1208,6 +1192,7 @@ "step": "for_inside_if" }, { + "get_solution": "program", "page": "Observation des programmes avec snoop", "program": [ "phrase = 'Hello World'", @@ -1222,7 +1207,6 @@ "print(nouvelle_phrase)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "ello World", @@ -1245,6 +1229,7 @@ "step": "print_tail" }, { + "get_solution": "program", "page": "Observation des programmes avec snoop", "program": [ "phrase = 'Hello World'", @@ -1259,31 +1244,30 @@ "print(nouvelle_phrase)" ], "response": { - "message": "", "passed": true, "result": [ { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 1\u001b[0m | phrase \u001b[38;5;197m=\u001b[39m \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello World\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 3\u001b[0m | inclus \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mFalse\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 4\u001b[0m | nouvelle_phrase \u001b[38;5;197m=\u001b[39m \u001b[38;5;186m'\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;197min\u001b[39m phrase:\n\u001b[38;5;242m \u001b[0m...... caractere = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mH\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | inclus \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;197min\u001b[39m phrase:\n\u001b[38;5;242m \u001b[0m...... caractere = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186me\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | nouvelle_phrase \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m caractere\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 1\u001b[0m | phrase \u001b[38;5;204m=\u001b[39m \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello World\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 3\u001b[0m | inclus \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mFalse\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 4\u001b[0m | nouvelle_phrase \u001b[38;5;204m=\u001b[39m \u001b[38;5;186m'\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;204min\u001b[39m phrase:\n\u001b[38;5;245m \u001b[0m...... caractere = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mH\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | inclus \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;204min\u001b[39m phrase:\n\u001b[38;5;245m \u001b[0m...... caractere = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186me\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | nouvelle_phrase \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m caractere\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m.............. nouvelle_phrase = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186me\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | inclus \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;197min\u001b[39m phrase:\n\u001b[38;5;242m \u001b[0m...... caractere = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186ml\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | nouvelle_phrase \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m caractere\n\u001b[38;5;242m \u001b[0m.............. nouvelle_phrase = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mel\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | inclus \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;197min\u001b[39m phrase:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | nouvelle_phrase \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m caractere\n", + "text": "\u001b[38;5;245m \u001b[0m.............. nouvelle_phrase = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186me\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | inclus \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;204min\u001b[39m phrase:\n\u001b[38;5;245m \u001b[0m...... caractere = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186ml\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | nouvelle_phrase \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m caractere\n\u001b[38;5;245m \u001b[0m.............. nouvelle_phrase = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mel\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | inclus \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;204min\u001b[39m phrase:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | nouvelle_phrase \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m caractere\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m.............. nouvelle_phrase = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mell\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | inclus \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;197min\u001b[39m phrase:\n\u001b[38;5;242m \u001b[0m...... caractere = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | nouvelle_phrase \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m caractere\n\u001b[38;5;242m \u001b[0m.............. nouvelle_phrase = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | inclus \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;197min\u001b[39m phrase:\n\u001b[38;5;242m \u001b[0m...... caractere = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186m \u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | nouvelle_phrase \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m caractere\n", + "text": "\u001b[38;5;245m \u001b[0m.............. nouvelle_phrase = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mell\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | inclus \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;204min\u001b[39m phrase:\n\u001b[38;5;245m \u001b[0m...... caractere = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | nouvelle_phrase \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m caractere\n\u001b[38;5;245m \u001b[0m.............. nouvelle_phrase = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | inclus \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;204min\u001b[39m phrase:\n\u001b[38;5;245m \u001b[0m...... caractere = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186m \u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | nouvelle_phrase \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m caractere\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m.............. nouvelle_phrase = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello \u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | inclus \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;197min\u001b[39m phrase:\n\u001b[38;5;242m \u001b[0m...... caractere = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mW\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | nouvelle_phrase \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m caractere\n\u001b[38;5;242m \u001b[0m.............. nouvelle_phrase = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello W\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | inclus \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;197min\u001b[39m phrase:\n\u001b[38;5;242m \u001b[0m...... caractere = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | nouvelle_phrase \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m caractere\n", + "text": "\u001b[38;5;245m \u001b[0m.............. nouvelle_phrase = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello \u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | inclus \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;204min\u001b[39m phrase:\n\u001b[38;5;245m \u001b[0m...... caractere = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mW\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | nouvelle_phrase \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m caractere\n\u001b[38;5;245m \u001b[0m.............. nouvelle_phrase = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello W\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | inclus \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;204min\u001b[39m phrase:\n\u001b[38;5;245m \u001b[0m...... caractere = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | nouvelle_phrase \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m caractere\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m.............. nouvelle_phrase = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Wo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | inclus \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;197min\u001b[39m phrase:\n\u001b[38;5;242m \u001b[0m...... caractere = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mr\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | nouvelle_phrase \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m caractere\n\u001b[38;5;242m \u001b[0m.............. nouvelle_phrase = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Wor\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | inclus \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;197min\u001b[39m phrase:\n\u001b[38;5;242m \u001b[0m...... caractere = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186ml\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | nouvelle_phrase \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m caractere\n", + "text": "\u001b[38;5;245m \u001b[0m.............. nouvelle_phrase = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Wo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | inclus \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;204min\u001b[39m phrase:\n\u001b[38;5;245m \u001b[0m...... caractere = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mr\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | nouvelle_phrase \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m caractere\n\u001b[38;5;245m \u001b[0m.............. nouvelle_phrase = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Wor\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | inclus \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;204min\u001b[39m phrase:\n\u001b[38;5;245m \u001b[0m...... caractere = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186ml\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | nouvelle_phrase \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m caractere\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m.............. nouvelle_phrase = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Worl\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | inclus \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;197min\u001b[39m phrase:\n\u001b[38;5;242m \u001b[0m...... caractere = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186md\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | nouvelle_phrase \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m caractere\n\u001b[38;5;242m \u001b[0m.............. nouvelle_phrase = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello World\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | inclus \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;197min\u001b[39m phrase:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 10\u001b[0m | print(nouvelle_phrase)\n", + "text": "\u001b[38;5;245m \u001b[0m.............. nouvelle_phrase = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Worl\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | inclus \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;204min\u001b[39m phrase:\n\u001b[38;5;245m \u001b[0m...... caractere = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186md\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m inclus:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | nouvelle_phrase \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m caractere\n\u001b[38;5;245m \u001b[0m.............. nouvelle_phrase = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello World\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | inclus \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m caractere \u001b[38;5;204min\u001b[39m phrase:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 10\u001b[0m | print(nouvelle_phrase)\n", "type": "snoop" }, { @@ -1326,7 +1310,6 @@ "print(nouvelle_phrase)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1338,6 +1321,7 @@ "step": "print_first_character" }, { + "get_solution": "program", "page": "if et else, le bloc sinon", "program": [ "condition = True", @@ -1347,7 +1331,6 @@ " print('Non')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1359,6 +1342,7 @@ "step": "first_if_else" }, { + "get_solution": "program", "page": "if et else, le bloc sinon", "program": [ "condition = False", @@ -1368,7 +1352,6 @@ " print('Non')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1380,6 +1363,7 @@ "step": "first_if_else_false" }, { + "get_solution": "program", "page": "if et else, le bloc sinon", "program": [ "phrase = 'Hello World'", @@ -1391,7 +1375,6 @@ "print(phrase)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1403,6 +1386,7 @@ "step": "if_upper_else_lower" }, { + "get_solution": "program", "page": "if et else, le bloc sinon", "program": [ "phrase = 'Hello World'", @@ -1414,7 +1398,6 @@ "print(phrase)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1426,6 +1409,7 @@ "step": "if_upper_else_lower_false" }, { + "get_solution": "program", "page": "if et else, le bloc sinon", "program": [ "phrase = 'Hello World'", @@ -1438,7 +1422,6 @@ "print(phrase)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Erreur", @@ -1527,7 +1510,6 @@ "print(phrase)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1568,7 +1550,6 @@ "print(nouvelle_phrase)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1611,7 +1592,6 @@ "print(nouvelle_phrase)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1623,6 +1603,7 @@ "step": "spongebob" }, { + "get_solution": "program", "page": "L'op\u00e9rateur d'\u00e9galit\u00e9", "program": [ "print(1 + 2 == 3)", @@ -1630,7 +1611,6 @@ "print('ab' + 'c' == 'a' + 'bc')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1642,12 +1622,12 @@ "step": "introducing_equality" }, { + "get_solution": "program", "page": "L'op\u00e9rateur d'\u00e9galit\u00e9", "program": [ "print(1 + 2 = 3)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1660,6 +1640,7 @@ "step": "equality_vs_assignment" }, { + "get_solution": "program", "page": "L'op\u00e9rateur d'\u00e9galit\u00e9", "program": [ "nom = 'Melissa'", @@ -1672,7 +1653,6 @@ "print(nouveau_nom)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1713,7 +1693,6 @@ "print(nouveau_nom)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1725,6 +1704,7 @@ "step": "if_equals_replacing_characters_exercise" }, { + "get_solution": "program", "page": "Pr\u00e9sentation de elif, le bloc sinon si", "program": [ "adn = 'AGTAGCGTC'", @@ -1743,7 +1723,6 @@ "print(adn_inverse)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1792,7 +1771,6 @@ "print(adn_inverse)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1804,6 +1782,7 @@ "step": "dna_example_with_else" }, { + "get_solution": "program", "page": "Pr\u00e9sentation de elif, le bloc sinon si", "program": [ "adn = 'AGTAGCGTC'", @@ -1822,7 +1801,6 @@ "print(adn_inverse)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1834,12 +1812,12 @@ "step": "dna_example_with_elif" }, { + "get_solution": "program", "page": "Autres op\u00e9rateurs de comparaison", "program": [ "1 != 2" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "True", @@ -1859,6 +1837,7 @@ "step": "try_not_equals" }, { + "get_solution": "program", "page": "Autres op\u00e9rateurs de comparaison", "program": [ "phrase = 'La touche e de mon clavier est cass\u00e9e'", @@ -1869,7 +1848,6 @@ "print(nouvelle_phrase)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1881,15 +1859,12 @@ "step": "brokn_kyboard" }, { - "get_solution": [ - "1 < 2" - ], + "get_solution": "program", "page": "Autres op\u00e9rateurs de comparaison", "program": [ "1 < 2" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1901,15 +1876,12 @@ "step": "introducing_less_than" }, { - "get_solution": [ - "'1' < '2'" - ], + "get_solution": "program", "page": "Autres op\u00e9rateurs de comparaison", "program": [ "'1' < '2'" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1921,6 +1893,7 @@ "step": "comparing_strings" }, { + "get_solution": "program", "page": "Autres op\u00e9rateurs de comparaison", "program": [ "pourcentage = 73", @@ -1937,7 +1910,6 @@ "print(note)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "B", @@ -1990,7 +1962,6 @@ "print(premier)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2002,6 +1973,7 @@ "step": "min_three_exercise" }, { + "get_solution": "program", "page": "Pr\u00e9sentation des listes", "program": [ "mots = ['Ceci', 'est', 'une', 'liste']", @@ -2010,7 +1982,6 @@ " print(mot)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2022,6 +1993,7 @@ "step": "first_list" }, { + "get_solution": "program", "page": "Pr\u00e9sentation des listes", "program": [ "x = 1", @@ -2029,7 +2001,6 @@ "print(choses)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2041,6 +2012,7 @@ "step": "can_contain_anything" }, { + "get_solution": "program", "page": "Pr\u00e9sentation des listes", "program": [ "nombres = [3, 1, 4, 1, 5, 9]", @@ -2052,7 +2024,6 @@ "print(total)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2081,7 +2052,6 @@ "print(total)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2121,7 +2091,6 @@ "print(total)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2148,7 +2117,6 @@ "print(double)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2177,7 +2145,6 @@ "print(grands_nombres)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2209,7 +2176,6 @@ "print(trouve)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2221,6 +2187,7 @@ "step": "list_contains_exercise" }, { + "get_solution": "program", "page": "Lecture d'\u00e9l\u00e9ments \u00e0 une position, range() et len()", "program": [ "mots = ['Ceci', 'est', 'une', 'liste']", @@ -2231,7 +2198,6 @@ "print(mots[3])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2243,12 +2209,12 @@ "step": "introducing_subscripting" }, { + "get_solution": "program", "page": "Lecture d'\u00e9l\u00e9ments \u00e0 une position, range() et len()", "program": [ "mots[4]" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2301,6 +2267,7 @@ "step": "index_error" }, { + "get_solution": "program", "page": "Lecture d'\u00e9l\u00e9ments \u00e0 une position, range() et len()", "program": [ "mots = ['Ceci', 'est', 'une', 'liste']", @@ -2311,7 +2278,6 @@ " print(mots[i])" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "0\nCeci\n1\nest\n2\nune\n3\nliste", @@ -2335,6 +2301,7 @@ "step": "introducing_len_and_range" }, { + "get_solution": "program", "page": "Lecture d'\u00e9l\u00e9ments \u00e0 une position, range() et len()", "program": [ "mots = ['Ceci', 'est', 'une', 'liste']", @@ -2345,7 +2312,6 @@ " print(mots[i])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2357,6 +2323,7 @@ "step": "range_len" }, { + "get_solution": "program", "page": "Lecture d'\u00e9l\u00e9ments \u00e0 une position, range() et len()", "program": [ "indices = range(4)", @@ -2367,7 +2334,6 @@ "print(indices[3])" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "0\n1\n2\n3", @@ -2390,12 +2356,12 @@ "step": "printing_the_range" }, { + "get_solution": "program", "page": "Lecture d'\u00e9l\u00e9ments \u00e0 une position, range() et len()", "program": [ "indices[4]" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Erreur", @@ -2459,12 +2425,12 @@ "step": "indices_out_of_bounds" }, { + "get_solution": "program", "page": "Lecture d'\u00e9l\u00e9ments \u00e0 une position, range() et len()", "program": [ "range(4)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2476,12 +2442,12 @@ "step": "range_almost_the_same_as_list" }, { + "get_solution": "program", "page": "Lecture d'\u00e9l\u00e9ments \u00e0 une position, range() et len()", "program": [ "list(range(4))" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "[0, 1, 2, 3]", @@ -2506,13 +2472,13 @@ "step": "range_versus_list" }, { + "get_solution": "program", "page": "Lecture d'\u00e9l\u00e9ments \u00e0 une position, range() et len()", "program": [ "mots = ['Ceci', 'est', 'une', 'liste']", "print(len(mots))" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "4", @@ -2545,7 +2511,6 @@ "print(mots[len(mots) - 1])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2570,7 +2535,6 @@ " print(mots[indice])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2642,7 +2606,6 @@ " break" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2670,7 +2633,6 @@ " print(caractere_1 + ' ' + caractere_2)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2730,7 +2692,6 @@ " print(caractere_1 + ' ' + caractere_2)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2742,13 +2703,13 @@ "step": "zip_longest_exercise" }, { + "get_solution": "program", "page": "Vocabulaire sur les appels de fonctions et les m\u00e9thodes", "program": [ "print(len)", "print(print)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2760,12 +2721,12 @@ "step": "print_functions" }, { + "get_solution": "program", "page": "Vocabulaire sur les appels de fonctions et les m\u00e9thodes", "program": [ "print(callable(len))" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2777,6 +2738,7 @@ "step": "introducing_callable" }, { + "get_solution": "program", "page": "Vocabulaire sur les appels de fonctions et les m\u00e9thodes", "program": [ "f = 'une chaine'", @@ -2784,7 +2746,6 @@ "f()" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2823,7 +2784,7 @@ ] } ], - "friendly": "

    Une exception TypeError est g\u00e9n\u00e9ralement caus\u00e9e par une tentative\nde combiner deux types d\u2019objets incompatibles,\nen invoquant une fonction avec le mauvais type d\u2019objet,\nou en tentant d'effectuer une op\u00e9ration non permise sur un type d'objet donn\u00e9.

    \n

    En raison des parenth\u00e8ses, f est interpr\u00e9t\u00e9 par Python\ncomme indiquant une invocation de fonction pour f.\nCelui-ci n'est pas une fonction mais plut\u00f4t un objet de type str\nne pouvant pas \u00eatre invoqu\u00e9.

    ", + "friendly": "

    Une exception TypeError est g\u00e9n\u00e9ralement caus\u00e9e par une tentative\nde combiner deux types d\u2019objets incompatibles,\nen invoquant une fonction avec le mauvais type d\u2019objet,\nou en tentant d'effectuer une op\u00e9ration non permise sur un type d'objet donn\u00e9.

    \n

    En raison des parenthees, ` est interpr\u00e9t\u00e9 par Python\ncomme indiquant une invocation de fonction pourf, qui est un objet de typestr`\nne pouvant pas \u00eatre invoqu\u00e9.

    ", "tail": "" } ], @@ -2844,6 +2805,7 @@ "step": "not_callable" }, { + "get_solution": "program", "page": "Vocabulaire sur les appels de fonctions et les m\u00e9thodes", "program": [ "choses = [1, 2, 3]", @@ -2852,7 +2814,6 @@ "print(affichage)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2864,13 +2825,13 @@ "step": "print_returns_none" }, { + "get_solution": "program", "page": "Vocabulaire sur les appels de fonctions et les m\u00e9thodes", "program": [ "choses = print([1, 2, 3])", "longueur = len(choses)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2930,6 +2891,7 @@ "step": "len_of_none" }, { + "get_solution": "program", "page": "Vocabulaire sur les appels de fonctions et les m\u00e9thodes", "program": [ "mot = 'Hello'", @@ -2937,7 +2899,6 @@ "print(mot.upper())" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2949,13 +2910,13 @@ "step": "methods_of_str" }, { + "get_solution": "program", "page": "Vocabulaire sur les appels de fonctions et les m\u00e9thodes", "program": [ "mot = 'Hello'", "mot.append('!')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3009,6 +2970,7 @@ "step": "no_append_for_str" }, { + "get_solution": "program", "page": "Fonctions et m\u00e9thodes sur les listes", "program": [ "nombres = [1, 2, 3]", @@ -3019,7 +2981,6 @@ "print(nombres)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3031,6 +2992,7 @@ "step": "append_vs_concatenate" }, { + "get_solution": "program", "page": "Fonctions et m\u00e9thodes sur les listes", "program": [ "nombres = [1, 2, 3]", @@ -3038,7 +3000,6 @@ "print(nombres)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "[1, 9, 3]", @@ -3062,12 +3023,12 @@ "step": "subscript_assignment_predict" }, { + "get_solution": "program", "page": "Fonctions et m\u00e9thodes sur les listes", "program": [ "[7, 8, 9, 8].index(8)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "1", @@ -3091,6 +3052,7 @@ "step": "index_predict_exercise" }, { + "get_solution": "program", "page": "Fonctions et m\u00e9thodes sur les listes", "program": [ "nombres = [1, 2, 3]", @@ -3098,7 +3060,6 @@ "print(nombres)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "2\n[1, 3]", @@ -3122,6 +3083,7 @@ "step": "pop_predict_exercise" }, { + "get_solution": "program", "page": "Fonctions et m\u00e9thodes sur les listes", "program": [ "nombres = [1, 2, 3]", @@ -3129,7 +3091,6 @@ "print(nombres)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "[2, 3]", @@ -3153,11 +3114,7 @@ "step": "remove_predict_exercise" }, { - "get_solution": [ - "x = ['a', 'b', 'c']", - "x.append(x.pop(0))", - "print(x)" - ], + "get_solution": "program", "page": "Fonctions et m\u00e9thodes sur les listes", "program": [ "x = ['a', 'b', 'c']", @@ -3165,7 +3122,6 @@ "print(x)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3177,11 +3133,7 @@ "step": "pop_remove_index_subscript_assignment" }, { - "get_solution": [ - "x = ['a', 'b', 'c']", - "x[len(x) - 1] = x[0]", - "print(x)" - ], + "get_solution": "program", "page": "Fonctions et m\u00e9thodes sur les listes", "program": [ "x = ['a', 'b', 'c']", @@ -3189,7 +3141,6 @@ "print(x)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3201,11 +3152,7 @@ "step": "subscript_assignment_exercise" }, { - "get_solution": [ - "x = ['a', 'b', 'c']", - "y = x + [x[0]]", - "print(y)" - ], + "get_solution": "program", "page": "Fonctions et m\u00e9thodes sur les listes", "program": [ "x = ['a', 'b', 'c']", @@ -3213,7 +3160,6 @@ "print(y)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3225,11 +3171,7 @@ "step": "negative_index_concatenation_exercise" }, { - "get_solution": [ - "x = [1, 2, 0, 3]", - "x.pop(x.index(0))", - "print(x)" - ], + "get_solution": "program", "page": "Fonctions et m\u00e9thodes sur les listes", "program": [ "x = [1, 2, 0, 3]", @@ -3237,7 +3179,6 @@ "print(x)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3249,12 +3190,12 @@ "step": "remove_exercise" }, { + "get_solution": "program", "page": "Plus de fonctions et de m\u00e9thodes sur les listes", "program": [ "sorted([2, 9, 1, 8, 5, 6])" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "[1, 2, 5, 6, 8, 9]", @@ -3276,6 +3217,7 @@ "step": "sorted_predict_exercise" }, { + "get_solution": "program", "page": "Plus de fonctions et de m\u00e9thodes sur les listes", "program": [ "nombres = [2, 9, 1, 8, 5, 64]", @@ -3283,7 +3225,6 @@ "print(2 in nombres)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "False\nTrue", @@ -3305,12 +3246,12 @@ "step": "in_predict_exercise" }, { + "get_solution": "program", "page": "Plus de fonctions et de m\u00e9thodes sur les listes", "program": [ "sum([5, 3, 4])" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "12", @@ -3331,12 +3272,12 @@ "step": "sum_predict_exercise" }, { + "get_solution": "program", "page": "Plus de fonctions et de m\u00e9thodes sur les listes", "program": [ "[1, 2, 3, 2, 7, 2, 5].count(2)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "3", @@ -3358,11 +3299,7 @@ "step": "count_predict_exercise" }, { - "get_solution": [ - "x = [1, 2, 0, 3]", - "y = x.count(1) > 0", - "print(y)" - ], + "get_solution": "program", "page": "Plus de fonctions et de m\u00e9thodes sur les listes", "program": [ "x = [1, 2, 0, 3]", @@ -3370,7 +3307,6 @@ "print(y)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3382,11 +3318,7 @@ "step": "count_in_sorted_sum" }, { - "get_solution": [ - "x = [15, 12, -6, 3]", - "y = sum(x) / len(x)", - "print(y)" - ], + "get_solution": "program", "page": "Plus de fonctions et de m\u00e9thodes sur les listes", "program": [ "x = [15, 12, -6, 3]", @@ -3394,7 +3326,6 @@ "print(y)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3406,11 +3337,7 @@ "step": "average_exercise" }, { - "get_solution": [ - "x = 100", - "y = sum(range(x + 1))", - "print(y)" - ], + "get_solution": "program", "page": "Plus de fonctions et de m\u00e9thodes sur les listes", "program": [ "x = 100", @@ -3418,7 +3345,6 @@ "print(y)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3430,11 +3356,7 @@ "step": "sum_range_exercise" }, { - "get_solution": [ - "x = [12, -6, 2, -1, 3]", - "y = sorted(x)[1]", - "print(y)" - ], + "get_solution": "program", "page": "Plus de fonctions et de m\u00e9thodes sur les listes", "program": [ "x = [12, -6, 2, -1, 3]", @@ -3442,7 +3364,6 @@ "print(y)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3454,12 +3375,12 @@ "step": "second_smallest_in_list_exercise" }, { + "get_solution": "program", "page": "M\u00e9thodes sur les chaines et immuabilit\u00e9", "program": [ "print('tes' in 'fait tes devoirs et apprend tes le\u00e7ons')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3471,6 +3392,7 @@ "step": "string_in_step" }, { + "get_solution": "program", "page": "M\u00e9thodes sur les chaines et immuabilit\u00e9", "program": [ "chaine = 'fait tes devoirs et apprend tes le\u00e7ons'", @@ -3478,7 +3400,6 @@ "print(chaine.index('tes'))" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3490,12 +3411,12 @@ "step": "string_count_index" }, { + "get_solution": "program", "page": "M\u00e9thodes sur les chaines et immuabilit\u00e9", "program": [ "'Python'.append(' est sympa !')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3542,6 +3463,7 @@ "step": "mutation_string_append" }, { + "get_solution": "program", "page": "M\u00e9thodes sur les chaines et immuabilit\u00e9", "program": [ "phrase = \"Python brille !\"", @@ -3550,7 +3472,6 @@ "print(nouvelle_phrase)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3562,15 +3483,12 @@ "step": "string_lower_upper" }, { - "get_solution": [ - "max([21, 55, 4, 91, 62, 49])" - ], + "get_solution": "program", "page": "Recherche d'informations sur le web", "program": [ "max([21, 55, 4, 91, 62, 49])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3582,11 +3500,7 @@ "step": "sum_list" }, { - "get_solution": [ - "nombres = [1, 2, 3, 4, 5]", - "nombres.insert(2, 9)", - "print(nombres)" - ], + "get_solution": "program", "page": "Recherche d'informations sur le web", "program": [ "nombres = [1, 2, 3, 4, 5]", @@ -3594,7 +3508,6 @@ "print(nombres)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3606,16 +3519,16 @@ "step": "list_insert" }, { + "get_solution": "program", "page": "Recherche d'informations sur le web", "program": [ "dir([])" ], "response": { - "message": "", "passed": true, "result": [ { - "text": "['__add__', '__class__', '__class_getitem__', '__contains__', '__delattr__', '__delitem__', '__dir__', '__doc__', '__eq__', '__format__', '__ge__', '__getattribute__', '__getitem__', '__gt__', '__hash__', '__iadd__', '__imul__', '__init__', '__init_subclass__', '__iter__', '__le__', '__len__', '__lt__', '__mul__', '__ne__', '__new__', '__reduce__', '__reduce_ex__', '__repr__', '__reversed__', '__rmul__', '__setattr__', '__setitem__', '__sizeof__', '__str__', '__subclasshook__', 'append', 'clear', 'copy', 'count', 'extend', 'index', 'insert', 'pop', 'remove', 'reverse', 'sort']\n", + "text": "['__add__', '__class__', '__class_getitem__', '__contains__', '__delattr__', '__delitem__', '__dir__', '__doc__', '__eq__', '__format__', '__ge__', '__getattribute__', '__getitem__', '__getstate__', '__gt__', '__hash__', '__iadd__', '__imul__', '__init__', '__init_subclass__', '__iter__', '__le__', '__len__', '__lt__', '__mul__', '__ne__', '__new__', '__reduce__', '__reduce_ex__', '__repr__', '__reversed__', '__rmul__', '__setattr__', '__setitem__', '__sizeof__', '__str__', '__subclasshook__', 'append', 'clear', 'copy', 'count', 'extend', 'index', 'insert', 'pop', 'remove', 'reverse', 'sort']\n", "type": "stdout" } ] @@ -3623,6 +3536,7 @@ "step": "dir_list" }, { + "get_solution": "program", "page": "Observation des programmes avec Python Tutor", "program": [ "des_nombres = [2, 4, 8, 1, 9, 7]", @@ -3640,7 +3554,6 @@ "print(grands_nombres)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3652,6 +3565,7 @@ "step": "run_with_python_tutor" }, { + "get_solution": "program", "page": "== ou is, test d'\u00e9galit\u00e9 ou d'identit\u00e9", "program": [ "liste_1 = [1, 2, 3]", @@ -3669,7 +3583,6 @@ "print(liste_2)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3681,6 +3594,7 @@ "step": "two_separate_lists" }, { + "get_solution": "program", "page": "== ou is, test d'\u00e9galit\u00e9 ou d'identit\u00e9", "program": [ "liste_1 = [1, 2, 3]", @@ -3698,7 +3612,6 @@ "print(liste_2)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3710,6 +3623,7 @@ "step": "same_list" }, { + "get_solution": "program", "page": "Modifications pendant l'it\u00e9ration", "program": [ "nombres = [10, 7, 8, 3, 12, 15]", @@ -3720,7 +3634,6 @@ "print(nombres)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3799,6 +3712,7 @@ "step": "run_broken_with_python_tutor" }, { + "get_solution": "program", "page": "Modifications pendant l'it\u00e9ration", "program": [ "nombres = [10, 7, 8, 3, 12, 15]", @@ -3808,7 +3722,6 @@ "print(nombres)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3820,6 +3733,7 @@ "step": "remove_instead_of_pop" }, { + "get_solution": "program", "page": "Modifications pendant l'it\u00e9ration", "program": [ "nombres = [10, 7, 8, 3, 12, 15]", @@ -3829,7 +3743,6 @@ "print(nombres)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3841,6 +3754,7 @@ "step": "make_copy" }, { + "get_solution": "program", "page": "Modifications pendant l'it\u00e9ration", "program": [ "nombres = [10, 7, 8, 3, 12, 15]", @@ -3852,7 +3766,6 @@ "print(grands_nombres)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3864,6 +3777,7 @@ "step": "make_copy2" }, { + "get_solution": "program", "page": "Modifications pendant l'it\u00e9ration", "program": [ "nombres = [10, 7, 8, 3, 12, 15]", @@ -3875,7 +3789,6 @@ "print(grands_nombres)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3887,17 +3800,17 @@ "step": "make_new_list" }, { + "get_solution": "program", "page": "Guillemets simples et doubles dans les chaines", "program": [ "print('Alice s'en va diner')" ], "response": { - "message": "", "passed": true, "result": [ { - "friendly": "

    Une exception de type SyntaxError se produit lorsque Python ne peut pas comprendre votre code.

    \n

    Pr\u00e9sentement, je ne peux pas deviner la cause probable de cette erreur.\nEssayez d\u2019examiner attentivement la ligne indiqu\u00e9e ainsi que celle\nimm\u00e9diatement au dessus pour voir si vous pouvez identifier\nun mot mal orthographi\u00e9, ou des symboles manquants, comme (,), [,],:, etc.

    \n

    Si votre code n'utilise pas d'annotations de type,\net que vous pensez que friendly devrait\npouvoir l'analyser correctement, SVP rapporter ce cas au site suivant:\nhttps://github.com/friendly-traceback/friendly-traceback/issues

    ", - "text": " print('Alice s'en va diner')\n ^^^^^^^^^^^\nSyntaxError: invalid syntax. Perhaps you forgot a comma?\nat line 1\n", + "friendly": "

    Une exception de type SyntaxError se produit lorsque Python ne peut pas comprendre votre code.

    \n

    Vous aviez commenc\u00e9 \u00e0 \u00e9crire une cha\u00eene de caract\u00e8res\navec un guillemet simple ou double, mais n'avez jamais\ntermin\u00e9 la cha\u00eene avec un autre guillemet sur cette ligne.

    ", + "text": " print('Alice s'en va diner')\n ^\nSyntaxError: unterminated string literal (detected at line 1)\nat line 1\n", "type": "syntax_error" } ] @@ -3905,12 +3818,12 @@ "step": "single_quotes_apostrophe" }, { + "get_solution": "program", "page": "Guillemets simples et doubles dans les chaines", "program": [ "print(\"Alice s'en va diner\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3922,12 +3835,12 @@ "step": "double_quotes" }, { + "get_solution": "program", "page": "Guillemets simples et doubles dans les chaines", "program": [ "'Alice' == \"Alice\"" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "True", @@ -3947,15 +3860,12 @@ "step": "single_double_quotes_equal" }, { - "get_solution": [ - "print(\"Un cas n\u2019est jamais assez particulier pour autoriser de briser une r\u00e8gle.\")" - ], + "get_solution": "program", "page": "Guillemets simples et doubles dans les chaines", "program": [ "print(\"Un cas n\u2019est jamais assez particulier pour autoriser de briser une r\u00e8gle.\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3967,15 +3877,12 @@ "step": "double_quote_exercise" }, { - "get_solution": [ - "print('\"Parler est facile. Montre-moi le code.\" - Linus Torvalds')" - ], + "get_solution": "program", "page": "Guillemets simples et doubles dans les chaines", "program": [ "print('\"Parler est facile. Montre-moi le code.\" - Linus Torvalds')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3987,6 +3894,7 @@ "step": "single_quote_exercise" }, { + "get_solution": "program", "page": "Les f-string", "program": [ "nom = \"Alice\"", @@ -3995,7 +3903,6 @@ "print(f\"{nom} est all\u00e9(e) {repas} avec {ami}.\")" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Alice est all\u00e9(e) d\u00e9jeuner avec Bob.", @@ -4022,6 +3929,7 @@ "step": "introduce_f_strings" }, { + "get_solution": "program", "page": "Les f-string", "program": [ "nom = \"Alice\"", @@ -4029,7 +3937,6 @@ "print(\"Bonjour \" + nom + \". Vous avez \" + age + \" ans.\")" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Erreur", @@ -4108,11 +4015,7 @@ "step": "concatenate_string_number" }, { - "get_solution": [ - "nom = \"Alice\"", - "age = 20", - "print(f'Bonjour {nom}. Vous avez {age} ans.')" - ], + "get_solution": "program", "page": "Les f-string", "program": [ "nom = \"Alice\"", @@ -4120,7 +4023,6 @@ "print(f'Bonjour {nom}. Vous avez {age} ans.')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4132,12 +4034,12 @@ "step": "basic_f_string_exercise" }, { + "get_solution": "program", "page": "Les f-string", "program": [ "f\"2 * 3 + 4 est \u00e9gal \u00e0 {2 * 3 + 4}\"" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4154,15 +4056,14 @@ ], "page": "Les f-string", "program": [ - "personnes = ['eODoUwNzS', 'ofHBEzZxs', 'zwTrQA', 'LDaOKmpHU', 'HCMLTt', 'NbRmEjaoyD']", + "personnes = ['Alice', 'Bob', 'Charlie']", "print(f\"Il y a {len(personnes)} personnes qui attendent, la premi\u00e8re personne s'appelle {personnes[0]}.\")" ], "response": { - "message": "", "passed": true, "result": [ { - "text": "Il y a 6 personnes qui attendent, la premi\u00e8re personne s'appelle eODoUwNzS.\n", + "text": "Il y a 3 personnes qui attendent, la premi\u00e8re personne s'appelle Alice.\n", "type": "stdout" } ] @@ -4170,6 +4071,7 @@ "step": "fix_broken_program" }, { + "get_solution": "program", "page": "Pr\u00e9sentation des boucles imbriqu\u00e9es", "program": [ "for lettre in \"ABC\":", @@ -4179,7 +4081,6 @@ " print('---')" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "A\nA 0\nA 1\nA 2\nA 3\n---\nB\nB 0\nB 1\nB 2\nB 3\n---\nC\nC 0\nC 1\nC 2\nC 3\n---", @@ -4360,14 +4261,7 @@ "step": "times_table_exercise" }, { - "get_solution": [ - "for gauche in range(12):", - " gauche += 1", - " for droite in range(12):", - " droite += 1", - " print(f'{gauche} x {droite} = {gauche * droite}')", - " print('---')" - ], + "get_solution": "program", "page": "Pr\u00e9sentation des boucles imbriqu\u00e9es", "program": [ "for gauche in range(12):", @@ -4378,7 +4272,6 @@ " print('---')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4402,18 +4295,17 @@ ], "page": "Pr\u00e9sentation des boucles imbriqu\u00e9es", "program": [ - "joueurs = ['OUumHyG', 'ocUyWBh', 'DbNQe', 'XjItgGJ', 'iOuKYyzZt', 'iySpdUX', 'EZkLNo']", + "joueurs = ['Alice', 'Bob', 'Charlie']", "for joueur_1 in joueurs:", " for joueur_2 in joueurs:", " if joueur_1 != joueur_2:", " print(f'{joueur_1} contre {joueur_2}')" ], "response": { - "message": "", "passed": true, "result": [ { - "text": "OUumHyG contre ocUyWBh\nOUumHyG contre DbNQe\nOUumHyG contre XjItgGJ\nOUumHyG contre iOuKYyzZt\nOUumHyG contre iySpdUX\nOUumHyG contre EZkLNo\nocUyWBh contre OUumHyG\nocUyWBh contre DbNQe\nocUyWBh contre XjItgGJ\nocUyWBh contre iOuKYyzZt\nocUyWBh contre iySpdUX\nocUyWBh contre EZkLNo\nDbNQe contre OUumHyG\nDbNQe contre ocUyWBh\nDbNQe contre XjItgGJ\nDbNQe contre iOuKYyzZt\nDbNQe contre iySpdUX\nDbNQe contre EZkLNo\nXjItgGJ contre OUumHyG\nXjItgGJ contre ocUyWBh\nXjItgGJ contre DbNQe\nXjItgGJ contre iOuKYyzZt\nXjItgGJ contre iySpdUX\nXjItgGJ contre EZkLNo\niOuKYyzZt contre OUumHyG\niOuKYyzZt contre ocUyWBh\niOuKYyzZt contre DbNQe\niOuKYyzZt contre XjItgGJ\niOuKYyzZt contre iySpdUX\niOuKYyzZt contre EZkLNo\niySpdUX contre OUumHyG\niySpdUX contre ocUyWBh\niySpdUX contre DbNQe\niySpdUX contre XjItgGJ\niySpdUX contre iOuKYyzZt\niySpdUX contre EZkLNo\nEZkLNo contre OUumHyG\nEZkLNo contre ocUyWBh\nEZkLNo contre DbNQe\nEZkLNo contre XjItgGJ\nEZkLNo contre iOuKYyzZt\nEZkLNo contre iySpdUX\n", + "text": "Alice contre Bob\nAlice contre Charlie\nBob contre Alice\nBob contre Charlie\nCharlie contre Alice\nCharlie contre Bob\n", "type": "stdout" } ] @@ -4438,7 +4330,6 @@ " print(c_1 + c_2 + c_3 + c_4)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4469,7 +4360,6 @@ " print(ligne)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4489,18 +4379,17 @@ ], "page": "Pr\u00e9sentation des boucles imbriqu\u00e9es", "program": [ - "joueurs = ['JwsUZyHWXS', 'UepKEbOB', 'uTRiPVo', 'VWkbqMa', 'BwdsYFWHh', 'XmgDJ', 'WRoYNxvLF']", + "joueurs = ['Alice', 'Bob', 'Charlie']", "for i in range(len(joueurs)):", " for j in range(len(joueurs)):", " if i < j:", " print(f'{joueurs[i]} contre {joueurs[j]}')" ], "response": { - "message": "", "passed": true, "result": [ { - "text": "JwsUZyHWXS contre UepKEbOB\nJwsUZyHWXS contre uTRiPVo\nJwsUZyHWXS contre VWkbqMa\nJwsUZyHWXS contre BwdsYFWHh\nJwsUZyHWXS contre XmgDJ\nJwsUZyHWXS contre WRoYNxvLF\nUepKEbOB contre uTRiPVo\nUepKEbOB contre VWkbqMa\nUepKEbOB contre BwdsYFWHh\nUepKEbOB contre XmgDJ\nUepKEbOB contre WRoYNxvLF\nuTRiPVo contre VWkbqMa\nuTRiPVo contre BwdsYFWHh\nuTRiPVo contre XmgDJ\nuTRiPVo contre WRoYNxvLF\nVWkbqMa contre BwdsYFWHh\nVWkbqMa contre XmgDJ\nVWkbqMa contre WRoYNxvLF\nBwdsYFWHh contre XmgDJ\nBwdsYFWHh contre WRoYNxvLF\nXmgDJ contre WRoYNxvLF\n", + "text": "Alice contre Bob\nAlice contre Charlie\nBob contre Charlie\n", "type": "stdout" } ] @@ -4508,6 +4397,7 @@ "step": "player_vs_player_bonus" }, { + "get_solution": "program", "page": "Observation des programmes avec birdseye", "program": [ "a = 2", @@ -4517,7 +4407,6 @@ "print(a * b + c * d)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4529,6 +4418,7 @@ "step": "first_birdseye_example" }, { + "get_solution": "program", "page": "Observation des programmes avec birdseye", "program": [ "mot = 'Fabuleux'", @@ -4543,7 +4433,6 @@ "print(consonnes)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4566,7 +4455,6 @@ "print(chaine[0])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4578,13 +4466,13 @@ "step": "string_list_exercise" }, { + "get_solution": "program", "page": "Pr\u00e9sentation des listes imbriqu\u00e9es", "program": [ "chaines = [\"abc\", \"def\", \"ghi\"]", "print(chaines[1][0])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4605,7 +4493,6 @@ "print(chaines[-2][-1])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4617,13 +4504,13 @@ "step": "double_subscripting_exercise" }, { + "get_solution": "program", "page": "Pr\u00e9sentation des listes imbriqu\u00e9es", "program": [ "chaines = [['hello', 'there'], ['comment', 'allez', 'vous']]", "print(chaines[1][0])" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "comment", @@ -4661,7 +4548,6 @@ "print(chaines[1][2][0])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4673,6 +4559,7 @@ "step": "triple_subscripting" }, { + "get_solution": "program", "page": "Faire des boucles avec des listes imbriqu\u00e9es", "program": [ "nombres = [[1, 2, 3], [4, 5], [6], []]", @@ -4682,7 +4569,6 @@ " print('---')" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "1\n2\n3\n---\n4\n5\n---\n6\n---\n---", @@ -4705,6 +4591,7 @@ "step": "nested_list_nested_loop_example" }, { + "get_solution": "program", "page": "Faire des boucles avec des listes imbriqu\u00e9es", "program": [ "nombres = [[1, 2, 3], [4, 5], [6], []]", @@ -4714,7 +4601,6 @@ " print('---')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4742,7 +4628,6 @@ " print(chaine)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4774,7 +4659,6 @@ " print(cadeau)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4806,7 +4690,6 @@ "print(cadeau)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4835,7 +4718,6 @@ " print(ligne)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4880,7 +4762,6 @@ " print(ligne)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4892,6 +4773,7 @@ "step": "zip_longest_strings_exercise" }, { + "get_solution": "program", "page": "D\u00e9finitions de fonctions", "program": [ "def salutation(nom):", @@ -4901,7 +4783,6 @@ "salutation(\"Bob\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4913,6 +4794,7 @@ "step": "define_greet" }, { + "get_solution": "program", "page": "D\u00e9finitions de fonctions", "program": [ "def salutation(nom):", @@ -4923,7 +4805,6 @@ "salutation(\"Bob\")" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Bonjour Alice !\nComment allez-vous ?\nBonjour Bob !\nComment allez-vous ?", @@ -4944,14 +4825,7 @@ "step": "how_are_you" }, { - "get_solution": [ - "def dit_bonjour(nom):", - " print(f\"Bonjour {nom} !\")", - " print(\"Comment allez-vous ?\")", - "", - "dit_bonjour(\"Alice\")", - "dit_bonjour(\"Bob\")" - ], + "get_solution": "program", "page": "D\u00e9finitions de fonctions", "program": [ "def dit_bonjour(nom):", @@ -4962,7 +4836,6 @@ "dit_bonjour(\"Bob\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4974,14 +4847,7 @@ "step": "change_function_name" }, { - "get_solution": [ - "def dit_bonjour(nom_personne):", - " print(f\"Bonjour {nom_personne} !\")", - " print(\"Comment allez-vous ?\")", - "", - "dit_bonjour(\"Alice\")", - "dit_bonjour(\"Bob\")" - ], + "get_solution": "program", "page": "D\u00e9finitions de fonctions", "program": [ "def dit_bonjour(nom_personne):", @@ -4992,7 +4858,6 @@ "dit_bonjour(\"Bob\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5004,11 +4869,7 @@ "step": "change_parameter_name" }, { - "get_solution": [ - "def affiche_deux_fois(x):", - " print(x)", - " print(x)" - ], + "get_solution": "program", "page": "D\u00e9finitions de fonctions", "program": [ "def affiche_deux_fois(x):", @@ -5016,13 +4877,13 @@ " print(x)" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "print_twice_exercise" }, { + "get_solution": "program", "page": "D\u00e9finitions de fonctions", "program": [ "def affiche_plusieurs(chose, n):", @@ -5032,7 +4893,6 @@ "affiche_plusieurs(\"Hello\", 3)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Hello\nHello\nHello", @@ -5055,13 +4915,7 @@ "step": "print_many" }, { - "get_solution": [ - "def affiche_plusieurs(n, chose):", - " for _ in range(n):", - " print(chose)", - "", - "affiche_plusieurs(3, \"Hello\")" - ], + "get_solution": "program", "page": "D\u00e9finitions de fonctions", "program": [ "def affiche_plusieurs(n, chose):", @@ -5071,7 +4925,6 @@ "affiche_plusieurs(3, \"Hello\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5083,6 +4936,7 @@ "step": "swap_parameters" }, { + "get_solution": "program", "page": "Appels de fonctions dans des fonctions", "program": [ "def affiche_plusieurs(n, chose):", @@ -5095,7 +4949,6 @@ "affiche_deux_fois(\"Hello\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5107,6 +4960,7 @@ "step": "print_twice_call_print_many" }, { + "get_solution": "program", "page": "Appels de fonctions dans des fonctions", "program": [ "def affiche_plusieurs(n, chose):", @@ -5119,15 +4973,14 @@ "affiche_deux_fois(\"Hello\")" ], "response": { - "message": "", "passed": true, "result": [ { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 1\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148maffiche_plusieurs\u001b[39m(n, chose):\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148maffiche_deux_fois\u001b[39m(x):\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | affiche_deux_fois(\u001b[38;5;186m\"\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m\"\u001b[39m)\n\u001b[38;5;242m \u001b[0m\u001b[36m\u001b[1m>>> Call to affiche_deux_fois in File \"/my_program.py\", line 5\u001b[0m\n\u001b[38;5;242m \u001b[0m...... x = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148maffiche_deux_fois\u001b[39m(x):\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | affiche_plusieurs(\u001b[38;5;141m2\u001b[39m, x)\n\u001b[38;5;242m \u001b[0m\u001b[36m\u001b[1m>>> Call to affiche_plusieurs in File \"/my_program.py\", line 1\u001b[0m\n\u001b[38;5;242m \u001b[0m...... n = \u001b[38;5;141m2\u001b[39m\n\u001b[38;5;242m \u001b[0m...... chose = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 1\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148maffiche_plusieurs\u001b[39m(n, chose):\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 1\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148maffiche_plusieurs\u001b[39m(n, chose):\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148maffiche_deux_fois\u001b[39m(x):\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | affiche_deux_fois(\u001b[38;5;186m\"\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m\"\u001b[39m)\n\u001b[38;5;245m \u001b[0m\u001b[36m\u001b[1m>>> Call to affiche_deux_fois in File \"/my_program.py\", line 5\u001b[0m\n\u001b[38;5;245m \u001b[0m...... x = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148maffiche_deux_fois\u001b[39m(x):\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | affiche_plusieurs(\u001b[38;5;141m2\u001b[39m, x)\n\u001b[38;5;245m \u001b[0m\u001b[36m\u001b[1m>>> Call to affiche_plusieurs in File \"/my_program.py\", line 1\u001b[0m\n\u001b[38;5;245m \u001b[0m...... n = \u001b[38;5;141m2\u001b[39m\n\u001b[38;5;245m \u001b[0m...... chose = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 1\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148maffiche_plusieurs\u001b[39m(n, chose):\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;197min\u001b[39m range(n):\n\u001b[38;5;242m \u001b[0m.......... _ = \u001b[38;5;141m0\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 3\u001b[0m | print(chose)\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;204min\u001b[39m range(n):\n\u001b[38;5;245m \u001b[0m.......... _ = \u001b[38;5;141m0\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 3\u001b[0m | print(chose)\n", "type": "snoop" }, { @@ -5139,11 +4992,11 @@ "type": "stdout" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;197min\u001b[39m range(n):\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;204min\u001b[39m range(n):\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m.......... _ = \u001b[38;5;141m1\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 3\u001b[0m | print(chose)\n", + "text": "\u001b[38;5;245m \u001b[0m.......... _ = \u001b[38;5;141m1\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 3\u001b[0m | print(chose)\n", "type": "snoop" }, { @@ -5155,11 +5008,11 @@ "type": "stdout" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;197min\u001b[39m range(n):\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;204min\u001b[39m range(n):\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[32m\u001b[1m<<< Return value from affiche_plusieurs: \u001b[0m\u001b[38;5;81mNone\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | affiche_plusieurs(\u001b[38;5;141m2\u001b[39m, x)\n\u001b[38;5;242m \u001b[0m\u001b[32m\u001b[1m<<< Return value from affiche_deux_fois: \u001b[0m\u001b[38;5;81mNone\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | affiche_deux_fois(\u001b[38;5;186m\"\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m\"\u001b[39m)\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[32m\u001b[1m<<< Return value from affiche_plusieurs: \u001b[0m\u001b[38;5;81mNone\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | affiche_plusieurs(\u001b[38;5;141m2\u001b[39m, x)\n\u001b[38;5;245m \u001b[0m\u001b[32m\u001b[1m<<< Return value from affiche_deux_fois: \u001b[0m\u001b[38;5;81mNone\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | affiche_deux_fois(\u001b[38;5;186m\"\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m\"\u001b[39m)\n", "type": "snoop" } ] @@ -5167,6 +5020,7 @@ "step": "see_stack_in_snoop" }, { + "get_solution": "program", "page": "Appels de fonctions dans des fonctions", "program": [ "def affiche_plusieurs(n, chose):", @@ -5179,7 +5033,6 @@ "affiche_deux_fois(\"Hello\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5191,6 +5044,7 @@ "step": "see_stack_in_pythontutor" }, { + "get_solution": "program", "page": "Appels de fonctions dans des fonctions", "program": [ "def affiche_plusieurs(n, chose):", @@ -5203,7 +5057,6 @@ "affiche_deux_fois(\"Hello\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5215,6 +5068,7 @@ "step": "see_stack_in_birdseye" }, { + "get_solution": "program", "page": "Renvoi de valeurs par des fonctions", "program": [ "def double(x):", @@ -5226,7 +5080,6 @@ "print(deux_fois)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "5\n10", @@ -5247,6 +5100,7 @@ "step": "first_return" }, { + "get_solution": "program", "page": "Renvoi de valeurs par des fonctions", "program": [ "def double(x):", @@ -5257,7 +5111,6 @@ "print(nombre)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "5", @@ -5303,13 +5156,13 @@ " return double(double(x))" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "quadruple_exercise" }, { + "get_solution": "program", "page": "Fonctions de tests", "program": [ "def double(x):", @@ -5319,7 +5172,6 @@ "assert_equal(double(5), 10)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "OK\nOK", @@ -5342,6 +5194,7 @@ "step": "introducing_assert_equal" }, { + "get_solution": "program", "page": "Fonctions de tests", "program": [ "def double(x):", @@ -5351,7 +5204,6 @@ "assert_equal(double(5), 10)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Error! 6 != 4\nError! 15 != 10", @@ -5373,6 +5225,7 @@ "step": "make_tests_fail" }, { + "get_solution": "program", "page": "Fonctions de tests", "program": [ "def double(x):", @@ -5385,7 +5238,6 @@ "assert_equal(quadruple(5), 20)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5397,17 +5249,13 @@ "step": "complete_quadruple_tests" }, { - "get_solution": [ - "def entoure(chaine, balise):", - " return balise + chaine + balise" - ], + "get_solution": "program", "page": "Fonctions de tests", "program": [ "def entoure(chaine, balise):", " return balise + chaine + balise" ], "response": { - "message": "", "passed": true, "result": [] }, @@ -5466,13 +5314,13 @@ " return chaine" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "alert_exercise" }, { + "get_solution": "program", "page": "return termine l'appel de la fonction", "program": [ "def foo():", @@ -5482,7 +5330,6 @@ "print(foo())" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "1", @@ -5505,6 +5352,7 @@ "step": "double_return_in_one_function" }, { + "get_solution": "program", "page": "return termine l'appel de la fonction", "program": [ "def nombres_doubles(nombres):", @@ -5514,7 +5362,6 @@ "assert_equal(nombres_doubles([1, 2, 3]), [2, 4, 6])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5526,6 +5373,7 @@ "step": "cannot_return_multiple_values" }, { + "get_solution": "program", "page": "return termine l'appel de la fonction", "program": [ "def foo():", @@ -5538,7 +5386,6 @@ "foo()" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "a 0\na 1\na 2\nb 0", @@ -5561,6 +5408,7 @@ "step": "return_ends_whole_function" }, { + "get_solution": "program", "page": "return termine l'appel de la fonction", "program": [ "def foo():", @@ -5573,7 +5421,6 @@ "foo()" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "a 0\na 1\na 2\nb 0\nc 0\nc 1\nc 2", @@ -5596,6 +5443,7 @@ "step": "break_vs_return" }, { + "get_solution": "program", "page": "Pr\u00e9sentation de or", "program": [ "def est_ami(nom):", @@ -5611,7 +5459,6 @@ "assert_equal(est_ami(\"Carole\"), False)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5623,12 +5470,12 @@ "step": "InputAliceBob" }, { + "get_solution": "program", "page": "Pr\u00e9sentation de or", "program": [ "True or True" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "True", @@ -5648,12 +5495,12 @@ "step": "TrueOrTrue" }, { + "get_solution": "program", "page": "Pr\u00e9sentation de or", "program": [ "True or False" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "True", @@ -5673,12 +5520,12 @@ "step": "TrueOrFalse" }, { + "get_solution": "program", "page": "Pr\u00e9sentation de or", "program": [ "False or False" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "False", @@ -5698,6 +5545,7 @@ "step": "FalseOrFalse" }, { + "get_solution": "program", "page": "Pr\u00e9sentation de or", "program": [ "def est_ami(nom):", @@ -5711,7 +5559,6 @@ "assert_equal(est_ami(\"Carole\"), False)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5723,6 +5570,7 @@ "step": "ImprovingWithOr" }, { + "get_solution": "program", "page": "Pr\u00e9sentation de or", "program": [ "def est_ami(nom):", @@ -5733,7 +5581,6 @@ "assert_equal(est_ami(\"Carole\"), False)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5745,6 +5592,7 @@ "step": "FurtherImprovement" }, { + "get_solution": "program", "page": "Pr\u00e9sentation de or", "program": [ "def est_ami(nom):", @@ -5755,7 +5603,6 @@ "assert_equal(est_ami(\"Carole\"), False)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5767,6 +5614,7 @@ "step": "ACommonMistake" }, { + "get_solution": "program", "page": "Pr\u00e9sentation de or", "program": [ "def est_ami(nom):", @@ -5777,7 +5625,6 @@ "assert_equal(est_ami(\"Carole\"), False)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5789,13 +5636,7 @@ "step": "InspectWithBirdseye" }, { - "get_solution": [ - "def est_pourcentage_valide(x):", - " if x < 0 or x > 100:", - " return False", - " else:", - " return True" - ], + "get_solution": "program", "page": "Pr\u00e9sentation de or", "program": [ "def est_pourcentage_valide(x):", @@ -5805,19 +5646,18 @@ " return True" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "AnExercise" }, { + "get_solution": "program", "page": "Pr\u00e9sentation de and", "program": [ "True and True" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "True", @@ -5837,12 +5677,12 @@ "step": "TrueAndTrue" }, { + "get_solution": "program", "page": "Pr\u00e9sentation de and", "program": [ "True and False" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "False", @@ -5862,12 +5702,12 @@ "step": "TrueAndFalse" }, { + "get_solution": "program", "page": "Pr\u00e9sentation de and", "program": [ "False and False" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "False", @@ -5887,13 +5727,7 @@ "step": "FalseAndFalse" }, { - "get_solution": [ - "def est_pourcentage_valide(x):", - " if 0 <= x and x <= 100:", - " return True", - " else:", - " return False" - ], + "get_solution": "program", "page": "Pr\u00e9sentation de and", "program": [ "def est_pourcentage_valide(x):", @@ -5903,37 +5737,32 @@ " return False" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "AndExercise" }, { - "get_solution": [ - "def tous_egaux(ligne):", - " return ligne[0] == ligne[1] and ligne[0] == ligne[2]" - ], + "get_solution": "program", "page": "Pr\u00e9sentation de and", "program": [ "def tous_egaux(ligne):", " return ligne[0] == ligne[1] and ligne[0] == ligne[2]" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "TicTacToeWinningRow" }, { + "get_solution": "program", "page": "Instructions sur plusieurs lignes", "program": [ "est_ami = nom == \"Alice\" or", " nom == \"Bob\"" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5946,6 +5775,7 @@ "step": "invalid_multiline" }, { + "get_solution": "program", "page": "Instructions sur plusieurs lignes", "program": [ "nom = \"Bob\"", @@ -5966,7 +5796,6 @@ " nom == \"Bob\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5978,12 +5807,12 @@ "step": "valid_multiline" }, { + "get_solution": "program", "page": "M\u00e9langes de and et or", "program": [ "True or False and False" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5995,14 +5824,7 @@ "step": "CombiningAndOr" }, { - "get_solution": [ - "def victoire_en_diagonale(plateau):", - " milieu = plateau[1][1]", - " return (", - " (milieu == plateau[0][0] and milieu == plateau[2][2]) or", - " (milieu == plateau[0][2] and milieu == plateau[2][0])", - " )" - ], + "get_solution": "program", "page": "M\u00e9langes de and et or", "program": [ "def victoire_en_diagonale(plateau):", @@ -6013,19 +5835,18 @@ " )" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "AndHasHigherPriority" }, { + "get_solution": "program", "page": "Pr\u00e9sentation de not", "program": [ "not True" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "False", @@ -6045,12 +5866,12 @@ "step": "IntroducingNot" }, { + "get_solution": "program", "page": "Pr\u00e9sentation de not", "program": [ "not False" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "True", @@ -6070,13 +5891,13 @@ "step": "NotFalse" }, { + "get_solution": "program", "page": "Pr\u00e9sentation de not", "program": [ "b = True", "print(not b or b)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6088,17 +5909,13 @@ "step": "NotTrueOrTrue" }, { - "get_solution": [ - "def est_image_invalide(nom_fichier):", - " return not (nom_fichier.endswith(\".png\") or nom_fichier.endswith(\".jpg\"))" - ], + "get_solution": "program", "page": "Pr\u00e9sentation de not", "program": [ "def est_image_invalide(nom_fichier):", " return not (nom_fichier.endswith(\".png\") or nom_fichier.endswith(\".jpg\"))" ], "response": { - "message": "", "passed": true, "result": [] }, @@ -6127,19 +5944,7 @@ "step": "intro_row_winner" }, { - "get_solution": [ - "def victoire_en_ligne(plateau):", - " for ligne in plateau:", - " tous_egaux = True", - " marque = ligne[0]", - " for valeur in ligne:", - " if valeur == ' ' or marque != valeur:", - " tous_egaux = False", - " break", - " if tous_egaux:", - " return True", - " return False" - ], + "get_solution": "program", "page": "V\u00e9rification du plateau pour un gagnant", "program": [ "def victoire_en_ligne(plateau):", @@ -6155,26 +5960,13 @@ " return False" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "intro_row_winner" }, { - "get_solution": [ - "def victoire_en_colonne(plateau):", - " for i_colonne in range(len(plateau[0])):", - " tous_egaux = True", - " marque = plateau[0][i_colonne]", - " for ligne in plateau:", - " if ligne[i_colonne] == ' ' or ligne[i_colonne] != marque:", - " tous_egaux = False", - " break", - " if tous_egaux:", - " return True", - " return False" - ], + "get_solution": "program", "page": "V\u00e9rification du plateau pour un gagnant", "program": [ "def victoire_en_colonne(plateau):", @@ -6190,26 +5982,13 @@ " return False" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "column_winner" }, { - "get_solution": [ - "def victoire_en_diagonale(plateau):", - " tous_egaux_1 = True", - " tous_egaux_2 = True", - " haut_gauche = plateau[0][0]", - " haut_droite = plateau[0][-1]", - " for i in range(len(plateau)):", - " if plateau[i][i] == ' ' or plateau[i][i] != haut_gauche:", - " tous_egaux_1 = False", - " if plateau[i][-i - 1] == ' ' or plateau[i][-i - 1] != haut_droite:", - " tous_egaux_2 = False", - " return tous_egaux_1 or tous_egaux_2" - ], + "get_solution": "program", "page": "V\u00e9rification du plateau pour un gagnant", "program": [ "def victoire_en_diagonale(plateau):", @@ -6225,7 +6004,6 @@ " return tous_egaux_1 or tous_egaux_2" ], "response": { - "message": "", "passed": true, "result": [] }, @@ -6274,13 +6052,13 @@ " return victoire_en_ligne(plateau) or victoire_en_colonne(plateau) or victoire_en_diagonale(plateau)" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "winner" }, { + "get_solution": "program", "page": "Le caract\u00e8re saut de ligne, representation", "program": [ "def affiche_plateau(plateau):", @@ -6294,7 +6072,6 @@ "])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6306,6 +6083,7 @@ "step": "one_way_to_print_board" }, { + "get_solution": "program", "page": "Le caract\u00e8re saut de ligne, representation", "program": [ "assert_equal(", @@ -6320,7 +6098,6 @@ ")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6333,6 +6110,7 @@ "step": "invalid_multi_line_string" }, { + "get_solution": "program", "page": "Le caract\u00e8re saut de ligne, representation", "program": [ "chaine = \"\"\"Premi\u00e8re ligne", @@ -6340,7 +6118,6 @@ "print(chaine)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6364,12 +6141,12 @@ "step": "discovering_newline" }, { + "get_solution": "program", "page": "Le caract\u00e8re saut de ligne, representation", "program": [ "chaine" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6381,12 +6158,12 @@ "step": "discovering_newline" }, { + "get_solution": "program", "page": "Le caract\u00e8re saut de ligne, representation", "program": [ "len('\\n')" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "1", @@ -6406,16 +6183,7 @@ "step": "introducing_newline" }, { - "get_solution": [ - "def representation(plateau):", - " resultat = ''", - " for i in range(len(plateau)):", - " for caractere in plateau[i]:", - " resultat += caractere", - " if i != len(plateau) - 1:", - " resultat += '\\n'", - " return resultat" - ], + "get_solution": "program", "page": "Le caract\u00e8re saut de ligne, representation", "program": [ "def representation(plateau):", @@ -6428,24 +6196,13 @@ " return resultat" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "format_board_simple" }, { - "get_solution": [ - "def representation(plateau):", - " liste_de_lignes = []", - " for ligne in plateau:", - " liste_de_lignes.append(\"|\".join(ligne))", - " lignes = []", - " for _ in plateau[0]:", - " lignes.append(\"-\")", - " ligne = f'\\n{\"+\".join(lignes)}\\n'", - " return ligne.join(liste_de_lignes)" - ], + "get_solution": "program", "page": "Le caract\u00e8re saut de ligne, representation", "program": [ "def representation(plateau):", @@ -6459,13 +6216,13 @@ " return ligne.join(liste_de_lignes)" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "format_board_bonus_challenge" }, { + "get_solution": "program", "page": "Les types", "program": [ "print(type('Hello World'))", @@ -6475,7 +6232,6 @@ "print(type(4.56))" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6487,12 +6243,12 @@ "step": "five_different_types" }, { + "get_solution": "program", "page": "Les types", "program": [ "type(3) == int" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6504,6 +6260,7 @@ "step": "check_type_manually" }, { + "get_solution": "program", "page": "Les types", "program": [ "print('123')", @@ -6511,7 +6268,6 @@ "print(123 == '123')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6523,13 +6279,13 @@ "step": "different_types_look_same" }, { + "get_solution": "program", "page": "Les types", "program": [ "print(123 + 456)", "print('123' + '456')" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "579\n123456", @@ -6553,13 +6309,13 @@ "step": "plus_has_two_meanings" }, { + "get_solution": "program", "page": "Les types", "program": [ "print(13 < 120)", "print('13' < '120')" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "True\nFalse", @@ -6581,13 +6337,13 @@ "step": "less_than_has_two_meanings" }, { + "get_solution": "program", "page": "Les types", "program": [ "print(sorted([120, 13, 0]))", "print(sorted(['120', '13', '0']))" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "[0, 13, 120]\n['0', '120', '13']", @@ -6611,12 +6367,12 @@ "step": "less_than_sorting_strings" }, { + "get_solution": "program", "page": "Les types", "program": [ "12 + '34'" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Erreur", @@ -6680,17 +6436,16 @@ ], "page": "Les types", "program": [ - "nombre = '2'", + "nombre = '1'", "for i in range(int(nombre)):", " print('\u00c0 la... ' + str(i + 1))", "print('Et hop !')" ], "response": { - "message": "", "passed": true, "result": [ { - "text": "\u00c0 la... 1\n\u00c0 la... 2\nEt hop !\n", + "text": "\u00c0 la... 1\nEt hop !\n", "type": "stdout" } ] @@ -6698,17 +6453,7 @@ "step": "fixing_type_errors_with_conversion" }, { - "get_solution": [ - "def representation(plateau):", - " premiere_ligne = ' '", - " for i in range(len(plateau)):", - " premiere_ligne += str(i + 1)", - " liste_de_lignes = [premiere_ligne]", - " for i in range(len(plateau)):", - " ligne = str(i + 1) + ''.join(plateau[i])", - " liste_de_lignes.append(ligne)", - " return \"\\n\".join(liste_de_lignes)" - ], + "get_solution": "program", "page": "Les types", "program": [ "def representation(plateau):", @@ -6722,13 +6467,13 @@ " return \"\\n\".join(liste_de_lignes)" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "format_board_with_numbers" }, { + "get_solution": "program", "page": "Programmes interactifs avec input()", "program": [ "print('Tapez votre nom, puis appuyez sur \"Entr\u00e9e\" :')", @@ -6736,7 +6481,6 @@ "print(f'Bonjour {nom} !')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6761,7 +6505,6 @@ }, { "get_solution": [ - "nombre_super_secret = 7", "print(\"Quel est le nombre auquel je pense ?\")", "reponse = input()", "if int(reponse) == nombre_super_secret:", @@ -6780,7 +6523,6 @@ " print(\"Perdu !\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6792,11 +6534,11 @@ "type": "input_prompt" }, { - "text": "\n", + "text": "\n", "type": "stdout" }, { - "text": "Perdu !\n", + "text": "Incroyable ! \u00cates-vous devin ?\n", "type": "stdout" } ] @@ -6804,6 +6546,7 @@ "step": "convert_input_to_int" }, { + "get_solution": "program", "page": "Affectation avec liste imbriqu\u00e9e : Jouer un coup sur un plateau", "program": [ "def joue_un_coup(plateau, joueur):", @@ -6817,7 +6560,6 @@ "lance_jeu()" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "[' ', 'X', ' ']", @@ -6844,6 +6586,7 @@ "step": "modify_list_in_function" }, { + "get_solution": "program", "page": "Affectation avec liste imbriqu\u00e9e : Jouer un coup sur un plateau", "program": [ "def joue_un_coup(plateau, joueur):", @@ -6862,7 +6605,6 @@ "lance_jeu()" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6874,12 +6616,7 @@ "step": "nested_assignment_two_lines" }, { - "get_solution": [ - "def joue_un_coup(plateau, joueur):", - " ligne = int(input()) - 1", - " i_colonne = int(input()) - 1", - " plateau[ligne][i_colonne] = joueur" - ], + "get_solution": "program", "page": "Affectation avec liste imbriqu\u00e9e : Jouer un coup sur un plateau", "program": [ "def joue_un_coup(plateau, joueur):", @@ -6888,13 +6625,13 @@ " plateau[ligne][i_colonne] = joueur" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "nested_assignment_input" }, { + "get_solution": "program", "page": "Fabrication du plateau", "program": [ "def fabrique_plateau(taille):", @@ -6923,7 +6660,6 @@ "test()" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6941,23 +6677,14 @@ "def fabrique_plateau(taille): return [[' '] * taille] * taille" ], "response": { - "message": "

    Les sous-listes dans le r\u00e9sultat sont des objets identiques.

    ", + "message": "

    Avec ces valeurs :

    \n
    taille = 2\n
    \n

    votre code affiche :

    \n
    [[' ', ' '], [' ', ' ']]\n
    \n

    ce qui est exact !

    \n

    N\u00e9anmoins, les sous-listes dans le r\u00e9sultat sont des objets identiques.

    ", "passed": false, "result": [] }, "step": "fix_make_board" }, { - "get_solution": [ - "def fabrique_plateau(taille):", - " plateau = []", - " for _ in range(taille):", - " ligne = []", - " for _ in range(taille):", - " ligne.append(' ')", - " plateau.append(ligne)", - " return plateau" - ], + "get_solution": "program", "page": "Fabrication du plateau", "program": [ "def fabrique_plateau(taille):", @@ -6970,7 +6697,6 @@ " return plateau" ], "response": { - "message": "", "passed": true, "result": [] }, @@ -7060,19 +6786,18 @@ " affiche_egalite()" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "the_full_game" }, { + "get_solution": "program", "page": "Introduction aux Dictionnaires", "program": [ "anglais = {'pomme': 'apple', 'boite': 'box'}" ], "response": { - "message": "", "passed": true, "result": [] }, @@ -7091,12 +6816,12 @@ "step": "dict_access" }, { + "get_solution": "program", "page": "Introduction aux Dictionnaires", "program": [ "anglais[0]" ], "response": { - "message": "", "passed": true, "result": [ { @@ -7161,12 +6886,12 @@ "step": "dict_access2" }, { + "get_solution": "program", "page": "Introduction aux Dictionnaires", "program": [ "anglais['pomme']" ], "response": { - "message": "", "passed": true, "result": [ { @@ -7190,12 +6915,12 @@ "step": "dict_access3" }, { + "get_solution": "program", "page": "Introduction aux Dictionnaires", "program": [ "anglais['boite']" ], "response": { - "message": "", "passed": true, "result": [ { @@ -7219,12 +6944,12 @@ "step": "dict_access4" }, { + "get_solution": "program", "page": "Introduction aux Dictionnaires", "program": [ "anglais['apple']" ], "response": { - "message": "", "passed": true, "result": [ { @@ -7277,14 +7002,7 @@ "step": "dict_access4" }, { - "get_solution": [ - "def cout_total(panier, prix):", - " resultat = 0", - " for element in panier:", - " tarif = prix[element]", - " resultat += tarif", - " return resultat" - ], + "get_solution": "program", "page": "Utiliser les Dictionnaires sur un exemple pratique", "program": [ "def cout_total(panier, prix):", @@ -7295,22 +7013,13 @@ " return resultat" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "shopping_cart1" }, { - "get_solution": [ - "def cout_total(panier, quantites, prix):", - " resultat = 0", - " for element in panier:", - " tarif = prix[element]", - " quantite = quantites[element]", - " resultat += tarif * quantite", - " return resultat" - ], + "get_solution": "program", "page": "Utiliser les Dictionnaires sur un exemple pratique", "program": [ "def cout_total(panier, quantites, prix):", @@ -7322,13 +7031,13 @@ " return resultat" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "shopping_cart4" }, { + "get_solution": "program", "page": "Utiliser les Dictionnaires sur un exemple pratique", "program": [ "def substitution(chaine):", @@ -7350,7 +7059,6 @@ "assert_equal(substitution(original), attendu)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -7362,13 +7070,7 @@ "step": "dna_part1" }, { - "get_solution": [ - "def substitution(chaine, d):", - " resultat = \"\"", - " for lettre in chaine:", - " resultat += d[lettre]", - " return resultat" - ], + "get_solution": "program", "page": "Utiliser les Dictionnaires sur un exemple pratique", "program": [ "def substitution(chaine, d):", @@ -7378,20 +7080,19 @@ " return resultat" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "dna_part2" }, { + "get_solution": "program", "page": "It\u00e9rer sur les clefs d'un dictionnaire", "program": [ "quantites = {'pomme': 1, 'chat': 10}", "print(quantites.keys())" ], "response": { - "message": "", "passed": true, "result": [ { @@ -7403,6 +7104,7 @@ "step": "introducing_keys" }, { + "get_solution": "program", "page": "It\u00e9rer sur les clefs d'un dictionnaire", "program": [ "quantites = {'pomme': 1, 'chat': 10}", @@ -7410,7 +7112,6 @@ " print(clef)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -7422,6 +7123,7 @@ "step": "keys_are_iterable" }, { + "get_solution": "program", "page": "It\u00e9rer sur les clefs d'un dictionnaire", "program": [ "quantites = {'pomme': 1, 'chat': 10}", @@ -7429,7 +7131,6 @@ " print(clef)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -7441,15 +7142,7 @@ "step": "keys_are_iterable2" }, { - "get_solution": [ - "def cout_total(quantites, prix):", - " resultat = 0", - " for element in quantites:", - " tarif = prix[element]", - " quantite = quantites[element]", - " resultat += tarif * quantite", - " return resultat" - ], + "get_solution": "program", "page": "It\u00e9rer sur les clefs d'un dictionnaire", "program": [ "def cout_total(quantites, prix):", @@ -7461,20 +7154,13 @@ " return resultat" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "cleanup_shopping_cart" }, { - "get_solution": [ - "def affiche_mots(anglais):", - " for mot in anglais:", - " print(\"Francais: \" + mot)", - " print(\"Anglais: \" + anglais[mot])", - " print(\"---\")" - ], + "get_solution": "program", "page": "It\u00e9rer sur les clefs d'un dictionnaire", "program": [ "def affiche_mots(anglais):", @@ -7484,21 +7170,13 @@ " print(\"---\")" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "english_to_french" }, { - "get_solution": [ - "def affiche_mots(anglais, allemand):", - " for mot in anglais:", - " print(\"Francais: \" + mot)", - " print(\"Anglais: \" + anglais[mot])", - " print(\"Allemand: \" + allemand[mot])", - " print(\"---\")" - ], + "get_solution": "program", "page": "It\u00e9rer sur les clefs d'un dictionnaire", "program": [ "def affiche_mots(anglais, allemand):", @@ -7509,13 +7187,13 @@ " print(\"---\")" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "english_to_german" }, { + "get_solution": "program", "page": "It\u00e9rer sur les clefs d'un dictionnaire", "program": [ "def affiche_mots(mots):", @@ -7539,7 +7217,6 @@ "})" ], "response": { - "message": "", "passed": true, "result": [ { diff --git a/tests/golden_files/pl/test_transcript.json b/tests/golden_files/pl/test_transcript.json index e7d5dd3b..909e8122 100644 --- a/tests/golden_files/pl/test_transcript.json +++ b/tests/golden_files/pl/test_transcript.json @@ -1247,27 +1247,27 @@ "passed": true, "result": [ { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 1\u001b[0m | sentence \u001b[38;5;197m=\u001b[39m \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello World\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 3\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mFalse\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 4\u001b[0m | new_sentence \u001b[38;5;197m=\u001b[39m \u001b[38;5;186m'\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mH\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186me\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186me\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 1\u001b[0m | sentence \u001b[38;5;204m=\u001b[39m \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello World\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 3\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mFalse\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 4\u001b[0m | new_sentence \u001b[38;5;204m=\u001b[39m \u001b[38;5;186m'\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mH\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186me\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186me\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186ml\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mel\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mell\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186ml\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mel\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mell\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186m \u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello \u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", + "text": "\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186m \u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello \u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mW\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello W\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Wo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", + "text": "\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mW\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello W\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Wo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mr\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Wor\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186ml\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Worl\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", + "text": "\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mr\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Wor\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186ml\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Worl\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186md\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello World\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 10\u001b[0m | print(new_sentence)\n", + "text": "\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186md\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello World\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 10\u001b[0m | print(new_sentence)\n", "type": "snoop" }, { @@ -2786,7 +2786,7 @@ ] } ], - "friendly": "

    A TypeError is usually caused by trying\nto combine two incompatible types of objects,\nby calling a function with the wrong type of object,\nor by trying to do an operation not allowed on a given type of object.

    \n

    The parenthesis () following f are interpreted\nby Python as a function call for f.\nHowever, f is not a function but an object of type str.

    ", + "friendly": "

    A TypeError is usually caused by trying\nto combine two incompatible types of objects,\nby calling a function with the wrong type of object,\nor by trying to do an operation not allowed on a given type of object.

    \n

    Because of the surrounding parenthesis, ` \nis interpreted by Python as indicating a function call forf, which is an object of typestr`\nwhich cannot be called.

    ", "tail": "" } ], @@ -3811,7 +3811,7 @@ "passed": true, "result": [ { - "friendly": "

    A SyntaxError occurs when Python cannot understand your code.

    \n

    I suspect that you were trying to use a quote character inside a string\nthat was enclosed in quotes of the same kind.\nPerhaps you should have escaped the inner quote character:

    \n
    print('Alice\\'s Diner')\n            ^^\n
    ", + "friendly": "

    A SyntaxError occurs when Python cannot understand your code.

    \n

    You started writing a string with a single or double quote\nbut never ended the string with another quote on that line.

    ", "text": " print('Alice's Diner')\n ^\nSyntaxError: unterminated string literal (detected at line 1)\nw linii 1\n", "type": "syntax_error" } @@ -4978,11 +4978,11 @@ "passed": true, "result": [ { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 1\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_many\u001b[39m(n, thing):\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_twice\u001b[39m(x):\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | print_twice(\u001b[38;5;186m\"\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m\"\u001b[39m)\n\u001b[38;5;242m \u001b[0m\u001b[36m\u001b[1m>>> Call to print_twice in File \"/my_program.py\", line 5\u001b[0m\n\u001b[38;5;242m \u001b[0m...... x = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_twice\u001b[39m(x):\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | print_many(\u001b[38;5;141m2\u001b[39m, x)\n\u001b[38;5;242m \u001b[0m\u001b[36m\u001b[1m>>> Call to print_many in File \"/my_program.py\", line 1\u001b[0m\n\u001b[38;5;242m \u001b[0m...... n = \u001b[38;5;141m2\u001b[39m\n\u001b[38;5;242m \u001b[0m...... thing = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 1\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_many\u001b[39m(n, thing):\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;197min\u001b[39m range(n):\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 1\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_many\u001b[39m(n, thing):\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_twice\u001b[39m(x):\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | print_twice(\u001b[38;5;186m\"\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m\"\u001b[39m)\n\u001b[38;5;245m \u001b[0m\u001b[36m\u001b[1m>>> Call to print_twice in File \"/my_program.py\", line 5\u001b[0m\n\u001b[38;5;245m \u001b[0m...... x = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_twice\u001b[39m(x):\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | print_many(\u001b[38;5;141m2\u001b[39m, x)\n\u001b[38;5;245m \u001b[0m\u001b[36m\u001b[1m>>> Call to print_many in File \"/my_program.py\", line 1\u001b[0m\n\u001b[38;5;245m \u001b[0m...... n = \u001b[38;5;141m2\u001b[39m\n\u001b[38;5;245m \u001b[0m...... thing = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 1\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_many\u001b[39m(n, thing):\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;204min\u001b[39m range(n):\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m.......... _ = \u001b[38;5;141m0\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 3\u001b[0m | print(thing)\n", + "text": "\u001b[38;5;245m \u001b[0m.......... _ = \u001b[38;5;141m0\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 3\u001b[0m | print(thing)\n", "type": "snoop" }, { @@ -4994,11 +4994,11 @@ "type": "stdout" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;197min\u001b[39m range(n):\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;204min\u001b[39m range(n):\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m.......... _ = \u001b[38;5;141m1\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 3\u001b[0m | print(thing)\n", + "text": "\u001b[38;5;245m \u001b[0m.......... _ = \u001b[38;5;141m1\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 3\u001b[0m | print(thing)\n", "type": "snoop" }, { @@ -5010,11 +5010,11 @@ "type": "stdout" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;197min\u001b[39m range(n):\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;204min\u001b[39m range(n):\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[32m\u001b[1m<<< Return value from print_many: \u001b[0m\u001b[38;5;81mNone\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | print_many(\u001b[38;5;141m2\u001b[39m, x)\n\u001b[38;5;242m \u001b[0m\u001b[32m\u001b[1m<<< Return value from print_twice: \u001b[0m\u001b[38;5;81mNone\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | print_twice(\u001b[38;5;186m\"\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m\"\u001b[39m)\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[32m\u001b[1m<<< Return value from print_many: \u001b[0m\u001b[38;5;81mNone\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | print_many(\u001b[38;5;141m2\u001b[39m, x)\n\u001b[38;5;245m \u001b[0m\u001b[32m\u001b[1m<<< Return value from print_twice: \u001b[0m\u001b[38;5;81mNone\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | print_twice(\u001b[38;5;186m\"\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m\"\u001b[39m)\n", "type": "snoop" } ] diff --git a/tests/golden_files/ta/test_transcript.json b/tests/golden_files/ta/test_transcript.json index 7ea915be..2e5a43d6 100644 --- a/tests/golden_files/ta/test_transcript.json +++ b/tests/golden_files/ta/test_transcript.json @@ -1247,27 +1247,27 @@ "passed": true, "result": [ { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 1\u001b[0m | sentence \u001b[38;5;197m=\u001b[39m \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello World\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 3\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mFalse\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 4\u001b[0m | new_sentence \u001b[38;5;197m=\u001b[39m \u001b[38;5;186m'\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mH\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186me\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186me\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 1\u001b[0m | sentence \u001b[38;5;204m=\u001b[39m \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello World\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 3\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mFalse\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 4\u001b[0m | new_sentence \u001b[38;5;204m=\u001b[39m \u001b[38;5;186m'\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mH\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186me\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186me\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186ml\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mel\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mell\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186ml\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mel\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mell\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186m \u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello \u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", + "text": "\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186m \u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello \u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mW\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello W\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Wo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", + "text": "\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mW\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello W\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Wo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mr\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Wor\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186ml\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Worl\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", + "text": "\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mr\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Wor\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186ml\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Worl\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186md\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello World\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 10\u001b[0m | print(new_sentence)\n", + "text": "\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186md\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello World\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 10\u001b[0m | print(new_sentence)\n", "type": "snoop" }, { @@ -2786,7 +2786,7 @@ ] } ], - "friendly": "

    \u0b92\u0bb0\u0bc1 \u0bb5\u0b95\u0bc8\u0baa\u0bcd\u0baa\u0bbf\u0bb4\u0bc8 TypeError \u0b8e\u0ba9\u0bcd\u0baa\u0ba4\u0bc1 \u0baa\u0bca\u0ba4\u0bc1\u0bb5\u0bbe\u0b95 \u0baa\u0bca\u0bb0\u0bc1\u0ba8\u0bcd\u0ba4\u0bbe\u0ba4 \u0b87\u0bb0\u0ba3\u0bcd\u0b9f\u0bc1\n\u0bb5\u0b95\u0bc8\u0baf\u0bbe\u0ba9 \u0baa\u0bca\u0bb0\u0bc1\u0bb3\u0bcd\u0b95\u0bb3\u0bc8 \u0b87\u0ba3\u0bc8\u0b95\u0bcd\u0b95 \u0bae\u0bc1\u0baf\u0bb1\u0bcd\u0b9a\u0bbf\u0baa\u0bcd\u0baa\u0ba4\u0bbe\u0bb2\u0bcb, \u0b92\u0bb0\u0bc1 \u0b9a\u0bc6\u0baf\u0bb2\u0bcd\u0baa\u0bbe\u0b9f\u0bcd\u0b9f\u0bc8\n\u0ba4\u0bb5\u0bb1\u0bbe\u0ba9 \u0bb5\u0b95\u0bc8\u0baa\u0bcd \u0baa\u0bca\u0bb0\u0bc1\u0bb3\u0bc1\u0b9f\u0ba9\u0bcd \u0b85\u0bb4\u0bc8\u0baa\u0bcd\u0baa\u0ba4\u0bbe\u0bb2\u0bcb \u0b85\u0bb2\u0bcd\u0bb2\u0ba4\u0bc1 \u0b95\u0bca\u0b9f\u0bc1\u0b95\u0bcd\u0b95\u0baa\u0bcd\u0baa\u0b9f\u0bcd\u0b9f\n\u0bb5\u0b95\u0bc8\u0baa\u0bcd \u0baa\u0bca\u0bb0\u0bc1\u0bb3\u0bbf\u0bb2\u0bcd \u0b85\u0ba9\u0bc1\u0bae\u0ba4\u0bbf\u0b95\u0bcd\u0b95\u0baa\u0bcd\u0baa\u0b9f\u0bbe\u0ba4 \u0b9a\u0bc6\u0baf\u0bb2\u0bc8\u0b9a\u0bcd \u0b9a\u0bc6\u0baf\u0bcd\u0baf \u0bae\u0bc1\u0baf\u0bb1\u0bcd\u0b9a\u0bbf\u0baa\u0bcd\u0baa\u0ba4\u0bbe\u0bb2\u0bcb \u0b8f\u0bb1\u0bcd\u0baa\u0b9f\u0bc1\u0b95\u0bbf\u0bb1\u0ba4\u0bc1.

    \n

    f \u0b8e\u0ba9\u0bcd\u0baa\u0ba4\u0bb1\u0bcd\u0b95\u0bc1\u0baa\u0bcd \u0baa\u0bbf\u0ba9\u0bcd \u0bb5\u0bb0\u0bc1\u0bae\u0bcd () \u0b85\u0b9f\u0bc8\u0baa\u0bcd\u0baa\u0bc1\u0b95\u0bcd\u0b95\u0bc1\u0bb1\u0bbf\u0baf\u0bbe\u0ba9\u0ba4\u0bc1 \nf\u0b95\u0bcd\u0b95\u0bbe\u0ba9 \u0b9a\u0bc6\u0baf\u0bb2\u0bcd\u0baa\u0bbe\u0b9f\u0bcd\u0b9f\u0bc1 \u0b85\u0bb4\u0bc8\u0baa\u0bcd\u0baa\u0bbe\u0b95 \u0baa\u0bc8\u0ba4\u0bcd\u0ba4\u0bbe\u0ba9\u0bbe\u0bb2\u0bcd \u0bb5\u0bbf\u0bb3\u0b95\u0bcd\u0b95\u0baa\u0bcd\u0baa\u0b9f\u0bc1\u0b95\u0bbf\u0bb1\u0ba4\u0bc1. \n\u0b87\u0bb0\u0bc1\u0baa\u0bcd\u0baa\u0bbf\u0ba9\u0bc1\u0bae\u0bcd, f \u0b8e\u0ba9\u0bcd\u0baa\u0ba4\u0bc1 \u0b92\u0bb0\u0bc1 \u0b9a\u0bc6\u0baf\u0bb2\u0bcd\u0baa\u0bbe\u0b9f\u0bc1 \u0b85\u0bb2\u0bcd\u0bb2, \u0bae\u0bbe\u0bb1\u0bbe\u0b95 str \u0bb5\u0b95\u0bc8\u0baf\u0bbf\u0ba9\u0bcd \u0baa\u0bca\u0bb0\u0bc1\u0bb3\u0bcd.

    ", + "friendly": "

    \u0b92\u0bb0\u0bc1 \u0bb5\u0b95\u0bc8\u0baa\u0bcd\u0baa\u0bbf\u0bb4\u0bc8 TypeError \u0b8e\u0ba9\u0bcd\u0baa\u0ba4\u0bc1 \u0baa\u0bca\u0ba4\u0bc1\u0bb5\u0bbe\u0b95 \u0baa\u0bca\u0bb0\u0bc1\u0ba8\u0bcd\u0ba4\u0bbe\u0ba4 \u0b87\u0bb0\u0ba3\u0bcd\u0b9f\u0bc1\n\u0bb5\u0b95\u0bc8\u0baf\u0bbe\u0ba9 \u0baa\u0bca\u0bb0\u0bc1\u0bb3\u0bcd\u0b95\u0bb3\u0bc8 \u0b87\u0ba3\u0bc8\u0b95\u0bcd\u0b95 \u0bae\u0bc1\u0baf\u0bb1\u0bcd\u0b9a\u0bbf\u0baa\u0bcd\u0baa\u0ba4\u0bbe\u0bb2\u0bcb, \u0b92\u0bb0\u0bc1 \u0b9a\u0bc6\u0baf\u0bb2\u0bcd\u0baa\u0bbe\u0b9f\u0bcd\u0b9f\u0bc8\n\u0ba4\u0bb5\u0bb1\u0bbe\u0ba9 \u0bb5\u0b95\u0bc8\u0baa\u0bcd \u0baa\u0bca\u0bb0\u0bc1\u0bb3\u0bc1\u0b9f\u0ba9\u0bcd \u0b85\u0bb4\u0bc8\u0baa\u0bcd\u0baa\u0ba4\u0bbe\u0bb2\u0bcb \u0b85\u0bb2\u0bcd\u0bb2\u0ba4\u0bc1 \u0b95\u0bca\u0b9f\u0bc1\u0b95\u0bcd\u0b95\u0baa\u0bcd\u0baa\u0b9f\u0bcd\u0b9f\n\u0bb5\u0b95\u0bc8\u0baa\u0bcd \u0baa\u0bca\u0bb0\u0bc1\u0bb3\u0bbf\u0bb2\u0bcd \u0b85\u0ba9\u0bc1\u0bae\u0ba4\u0bbf\u0b95\u0bcd\u0b95\u0baa\u0bcd\u0baa\u0b9f\u0bbe\u0ba4 \u0b9a\u0bc6\u0baf\u0bb2\u0bc8\u0b9a\u0bcd \u0b9a\u0bc6\u0baf\u0bcd\u0baf \u0bae\u0bc1\u0baf\u0bb1\u0bcd\u0b9a\u0bbf\u0baa\u0bcd\u0baa\u0ba4\u0bbe\u0bb2\u0bcb \u0b8f\u0bb1\u0bcd\u0baa\u0b9f\u0bc1\u0b95\u0bbf\u0bb1\u0ba4\u0bc1.

    \n

    \u0b9a\u0bc1\u0bb1\u0bcd\u0bb1\u0bbf\u0baf\u0bc1\u0bb3\u0bcd\u0bb3 \u0b85\u0b9f\u0bc8\u0baa\u0bcd\u0baa\u0bc1\u0b95\u0bcd\u0b95\u0bc1\u0bb1\u0bbf\u0baf\u0bbf\u0ba9\u0bcd \u0b95\u0bbe\u0bb0\u0ba3\u0bae\u0bbe\u0b95, ` \u0b8e\u0ba9\u0bcd\u0baa\u0ba4\u0bc1f\u0b95\u0bcd\u0b95\u0bbe\u0ba9 \u0b9a\u0bc6\u0baf\u0bb2\u0bcd\u0baa\u0bbe\u0b9f\u0bcd\u0b9f\u0bc1 \u0b85\u0bb4\u0bc8\u0baa\u0bcd\u0baa\u0bc8\u0b95\u0bcd \u0b95\u0bc1\u0bb1\u0bbf\u0b95\u0bcd\u0b95\u0bc1\u0bae\u0bcd \u0b8e\u0ba9 \u0baa\u0bc8\u0ba4\u0bcd\u0ba4\u0bbe\u0ba9\u0bbe\u0bb2\u0bcd \n\u0bb5\u0bbf\u0bb3\u0b95\u0bcd\u0b95\u0baa\u0bcd\u0baa\u0b9f\u0bc1\u0b95\u0bbf\u0bb1\u0ba4\u0bc1, \u0b87\u0ba4\u0bc1str` \u0bb5\u0b95\u0bc8\u0baf\u0bbf\u0ba9\u0bcd \u0b92\u0bb0\u0bc1 \u0baa\u0bca\u0bb0\u0bc1\u0bb3\u0bbe\u0b95\u0bc1\u0bae\u0bcd, \n\u0b87\u0ba4\u0bc1 \u0b85\u0bb4\u0bc8\u0b95\u0bcd\u0b95\u0baa\u0bcd\u0baa\u0b9f \u0bae\u0bc1\u0b9f\u0bbf\u0baf\u0bbe\u0ba4\u0bc1.

    ", "tail": "" } ], @@ -3811,7 +3811,7 @@ "passed": true, "result": [ { - "friendly": "

    \u0baa\u0bc8\u0ba4\u0bcd\u0ba4\u0bbe\u0ba9\u0bbe\u0bb2\u0bcd \u0b89\u0b99\u0bcd\u0b95\u0bb3\u0bcd \u0b95\u0bc1\u0bb1\u0bbf\u0baf\u0bc0\u0b9f\u0bcd\u0b9f\u0bc8\u0baa\u0bcd \u0baa\u0bc1\u0bb0\u0bbf\u0ba8\u0bcd\u0ba4\u0bc1 \u0b95\u0bca\u0bb3\u0bcd\u0bb3 \u0bae\u0bc1\u0b9f\u0bbf\u0baf\u0bbe\u0ba4\u0baa\u0bcb\u0ba4\u0bc1 \u0ba4\u0bca\u0b9f\u0bb0\u0bbf\u0baf\u0bb2\u0bcd\u0baa\u0bbf\u0bb4\u0bc8 SyntaxError \u0b8f\u0bb1\u0bcd\u0baa\u0b9f\u0bc1\u0b95\u0bbf\u0bb1\u0ba4\u0bc1.

    \n

    I suspect that you were trying to use a quote character inside a string\nthat was enclosed in quotes of the same kind.\nPerhaps you should have escaped the inner quote character:

    \n
    print('Alice\\'s Diner')\n            ^^\n
    ", + "friendly": "

    \u0baa\u0bc8\u0ba4\u0bcd\u0ba4\u0bbe\u0ba9\u0bbe\u0bb2\u0bcd \u0b89\u0b99\u0bcd\u0b95\u0bb3\u0bcd \u0b95\u0bc1\u0bb1\u0bbf\u0baf\u0bc0\u0b9f\u0bcd\u0b9f\u0bc8\u0baa\u0bcd \u0baa\u0bc1\u0bb0\u0bbf\u0ba8\u0bcd\u0ba4\u0bc1 \u0b95\u0bca\u0bb3\u0bcd\u0bb3 \u0bae\u0bc1\u0b9f\u0bbf\u0baf\u0bbe\u0ba4\u0baa\u0bcb\u0ba4\u0bc1 \u0ba4\u0bca\u0b9f\u0bb0\u0bbf\u0baf\u0bb2\u0bcd\u0baa\u0bbf\u0bb4\u0bc8 SyntaxError \u0b8f\u0bb1\u0bcd\u0baa\u0b9f\u0bc1\u0b95\u0bbf\u0bb1\u0ba4\u0bc1.

    \n

    \u0ba8\u0bc0\u0b99\u0bcd\u0b95\u0bb3\u0bcd \u0b92\u0bb1\u0bcd\u0bb1\u0bc8 \u0b85\u0bb2\u0bcd\u0bb2\u0ba4\u0bc1 \u0b87\u0bb0\u0b9f\u0bcd\u0b9f\u0bc8 \u0bae\u0bc7\u0bb1\u0bcd\u0b95\u0bcb\u0bb3\u0bc1\u0b9f\u0ba9\u0bcd \u0b92\u0bb0\u0bc1 \u0b9a\u0bb0\u0ba4\u0bcd\u0ba4\u0bc8 \u0b8e\u0bb4\u0bc1\u0ba4\u0ba4\u0bcd \n\u0ba4\u0bca\u0b9f\u0b99\u0bcd\u0b95\u0bbf\u0baf\u0bc1\u0bb3\u0bcd\u0bb3\u0bc0\u0bb0\u0bcd\u0b95\u0bb3\u0bcd, \u0b86\u0ba9\u0bbe\u0bb2\u0bcd \u0b85\u0ba8\u0bcd\u0ba4 \u0bb5\u0bb0\u0bbf\u0baf\u0bbf\u0bb2\u0bcd \u0bae\u0bb1\u0bcd\u0bb1\u0bca\u0bb0\u0bc1 \u0bae\u0bc7\u0bb1\u0bcd\u0b95\u0bcb\u0bb3\u0bc1\u0b9f\u0ba9\u0bcd \u0b9a\u0bb0\u0ba4\u0bcd\u0ba4\u0bc8 \u0bae\u0bc1\u0b9f\u0bbf\u0b95\u0bcd\u0b95\u0bb5\u0bbf\u0bb2\u0bcd\u0bb2\u0bc8.

    ", "text": " print('Alice's Diner')\n ^\nSyntaxError: unterminated string literal (detected at line 1)\n\u0bb5\u0bb0\u0bbf\u0b9a\u0bc8\u0baf\u0bbf\u0bb2\u0bcd 1\n", "type": "syntax_error" } @@ -4978,11 +4978,11 @@ "passed": true, "result": [ { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 1\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_many\u001b[39m(n, thing):\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_twice\u001b[39m(x):\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | print_twice(\u001b[38;5;186m\"\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m\"\u001b[39m)\n\u001b[38;5;242m \u001b[0m\u001b[36m\u001b[1m>>> Call to print_twice in File \"/my_program.py\", line 5\u001b[0m\n\u001b[38;5;242m \u001b[0m...... x = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_twice\u001b[39m(x):\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | print_many(\u001b[38;5;141m2\u001b[39m, x)\n\u001b[38;5;242m \u001b[0m\u001b[36m\u001b[1m>>> Call to print_many in File \"/my_program.py\", line 1\u001b[0m\n\u001b[38;5;242m \u001b[0m...... n = \u001b[38;5;141m2\u001b[39m\n\u001b[38;5;242m \u001b[0m...... thing = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 1\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_many\u001b[39m(n, thing):\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;197min\u001b[39m range(n):\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 1\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_many\u001b[39m(n, thing):\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_twice\u001b[39m(x):\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | print_twice(\u001b[38;5;186m\"\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m\"\u001b[39m)\n\u001b[38;5;245m \u001b[0m\u001b[36m\u001b[1m>>> Call to print_twice in File \"/my_program.py\", line 5\u001b[0m\n\u001b[38;5;245m \u001b[0m...... x = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_twice\u001b[39m(x):\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | print_many(\u001b[38;5;141m2\u001b[39m, x)\n\u001b[38;5;245m \u001b[0m\u001b[36m\u001b[1m>>> Call to print_many in File \"/my_program.py\", line 1\u001b[0m\n\u001b[38;5;245m \u001b[0m...... n = \u001b[38;5;141m2\u001b[39m\n\u001b[38;5;245m \u001b[0m...... thing = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 1\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_many\u001b[39m(n, thing):\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;204min\u001b[39m range(n):\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m.......... _ = \u001b[38;5;141m0\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 3\u001b[0m | print(thing)\n", + "text": "\u001b[38;5;245m \u001b[0m.......... _ = \u001b[38;5;141m0\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 3\u001b[0m | print(thing)\n", "type": "snoop" }, { @@ -4994,11 +4994,11 @@ "type": "stdout" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;197min\u001b[39m range(n):\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;204min\u001b[39m range(n):\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m.......... _ = \u001b[38;5;141m1\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 3\u001b[0m | print(thing)\n", + "text": "\u001b[38;5;245m \u001b[0m.......... _ = \u001b[38;5;141m1\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 3\u001b[0m | print(thing)\n", "type": "snoop" }, { @@ -5010,11 +5010,11 @@ "type": "stdout" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;197min\u001b[39m range(n):\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;204min\u001b[39m range(n):\n", "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[32m\u001b[1m<<< Return value from print_many: \u001b[0m\u001b[38;5;81mNone\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | print_many(\u001b[38;5;141m2\u001b[39m, x)\n\u001b[38;5;242m \u001b[0m\u001b[32m\u001b[1m<<< Return value from print_twice: \u001b[0m\u001b[38;5;81mNone\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | print_twice(\u001b[38;5;186m\"\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m\"\u001b[39m)\n", + "text": "\u001b[38;5;245m \u001b[0m\u001b[32m\u001b[1m<<< Return value from print_many: \u001b[0m\u001b[38;5;81mNone\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | print_many(\u001b[38;5;141m2\u001b[39m, x)\n\u001b[38;5;245m \u001b[0m\u001b[32m\u001b[1m<<< Return value from print_twice: \u001b[0m\u001b[38;5;81mNone\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | print_twice(\u001b[38;5;186m\"\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m\"\u001b[39m)\n", "type": "snoop" } ] diff --git a/tests/golden_files/zh/test_transcript.json b/tests/golden_files/zh/test_transcript.json index e032ca5d..a816e2c3 100644 --- a/tests/golden_files/zh/test_transcript.json +++ b/tests/golden_files/zh/test_transcript.json @@ -1,11 +1,11 @@ [ { - "page": "Introducing The Shell", + "page": "\u4ecb\u7ecd Shell", "program": [ "'literally anything'" ], "response": { - "message": "

    Awesome, you're trying out your own experiments!\nThat's a great sign. Keep it up.\nJust letting you know that you do need to eventually type 1+2 for the book to move forward.

    ", + "message": "

    \u5f88\u597d\uff0c\u4f60\u5728\u5c1d\u8bd5\u81ea\u5df1\u7684\u5b9e\u9a8c\uff01\n\u8fd9\u771f\u662f\u4e2a\u597d\u5146\u5934\u3002\u7ee7\u7eed\u4fdd\u6301\u3002\n\u6211\u53ea\u662f\u60f3\u8ba9\u4f60\u77e5\u9053\uff0c\u4f60\u6700\u7ec8\u9700\u8981\u8f93\u5165 1+2 \u624d\u80fd\u7ee7\u7eed\u8fdb\u884c\u3002

    ", "passed": false, "result": [ { @@ -17,12 +17,12 @@ "step": "first_expression" }, { - "page": "Introducing The Shell", + "get_solution": "program", + "page": "\u4ecb\u7ecd Shell", "program": [ "1+2" ], "response": { - "message": "", "passed": true, "result": [ { @@ -34,16 +34,17 @@ "step": "first_expression" }, { - "page": "Introducing The Shell", + "page": "\u4ecb\u7ecd Shell", "program": [ "3 x 4" ], "response": { - "message": "

    I see an 'x'. If you're trying to multiply, use an asterisk, e.g:

    \n
    3 * 4\n
    ", + "message": "

    \u6211\u770b\u5230\u4e00\u4e2a 'x'\u3002\u5982\u679c\u4f60\u60f3\u8fdb\u884c\u4e58\u6cd5\u8fd0\u7b97\uff0c\u8bf7\u4f7f\u7528\u661f\u53f7\uff0c\u4f8b\u5982\uff1a

    \n
    3 * 4\n
    ", "passed": false, "result": [ { - "text": " 3 x 4\n ^\nSyntaxError: invalid syntax\nat line 1\n\nA `SyntaxError` occurs when Python cannot understand your code.\n\nCurrently, I cannot guess the likely cause of this error.\nTry to examine closely the line indicated as well as the line\nimmediately above to see if you can identify some misspelled\nword, or missing symbols, like (, ), [, ], :, etc.\n\nUnless your code uses type annotations, which are beyond our scope,\nif you think that this is something which should be handled\nby friendly, please report this case to\nhttps://github.com/aroberge/friendly/issues\n\n\n\n", + "friendly": "

    A SyntaxError occurs when Python cannot understand your code.

    \n

    Currently, I cannot guess the likely cause of this error.\nTry to examine closely the line indicated as well as the line\nimmediately above to see if you can identify some misspelled\nword, or missing symbols, like (, ), [, ], :, etc.

    \n

    Unless your code uses type annotations, which are beyond our scope,\nif you think that this is something which should be handled\nby friendly, please report this case to\nhttps://github.com/friendly-traceback/friendly-traceback/issues

    ", + "text": " 3 x 4\n ^\nSyntaxError: invalid syntax\n\u5728\u7b2c 1\n", "type": "syntax_error" } ] @@ -51,12 +52,12 @@ "step": "more_calculation" }, { - "page": "Introducing The Shell", + "get_solution": "program", + "page": "\u4ecb\u7ecd Shell", "program": [ "5 - 6" ], "response": { - "message": "", "passed": true, "result": [ { @@ -68,12 +69,12 @@ "step": "more_calculation" }, { - "page": "Introducing Strings", + "get_solution": "program", + "page": "\u4ecb\u7ecd\u5b57\u7b26\u4e32", "program": [ "'hello'" ], "response": { - "message": "", "passed": true, "result": [ { @@ -85,12 +86,12 @@ "step": "hello_string" }, { - "page": "Adding Strings", + "get_solution": "program", + "page": "\u6dfb\u52a0\u5b57\u7b26\u4e32", "program": [ "'hello' + 'world'" ], "response": { - "message": "", "passed": true, "result": [ { @@ -102,12 +103,12 @@ "step": "hello_world_concat" }, { - "page": "Adding Strings", + "page": "\u6dfb\u52a0\u5b57\u7b26\u4e32", "program": [ "'hello world'" ], "response": { - "message": "

    You must still add two or more strings together.

    ", + "message": "

    \u4f60\u4ecd\u7136\u5fc5\u987b\u5c06\u4e24\u4e2a\u6216\u66f4\u591a\u5b57\u7b26\u4e32\u76f8\u52a0\u3002

    ", "passed": false, "result": [ { @@ -119,15 +120,12 @@ "step": "hello_world_space" }, { - "get_solution": [ - "'hello ' + 'world'" - ], - "page": "Adding Strings", + "get_solution": "program", + "page": "\u6dfb\u52a0\u5b57\u7b26\u4e32", "program": [ "'hello ' + 'world'" ], "response": { - "message": "", "passed": true, "result": [ { @@ -139,36 +137,36 @@ "step": "hello_world_space" }, { - "page": "Introducing Variables", + "get_solution": "program", + "page": "\u4ecb\u7ecd\u53d8\u91cf", "program": [ "word = 'Hello'" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "word_assign" }, { - "page": "Introducing Variables", + "page": "\u4ecb\u7ecd\u53d8\u91cf", "program": [ "word = 2" ], "response": { - "message": "

    Oops, you need to set word = 'Hello' before we can continue.

    ", + "message": "

    \u54ce\u5440\uff0c\u4f60\u9700\u8981\u5148\u8bbe\u7f6e word = 'Hello'\uff0c\u7136\u540e\u6211\u4eec\u624d\u80fd\u7ee7\u7eed\u3002

    ", "passed": false, "result": [] }, "step": "word_check" }, { - "page": "Introducing Variables", + "get_solution": "program", + "page": "\u4ecb\u7ecd\u53d8\u91cf", "program": [ "word" ], "response": { - "message": "", "passed": true, "result": [ { @@ -180,12 +178,12 @@ "step": "word_check" }, { - "page": "Introducing Variables", + "get_solution": "program", + "page": "\u4ecb\u7ecd\u53d8\u91cf", "program": [ "'word'" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "'word'", @@ -194,7 +192,7 @@ "'word'", "Hello", "'Hello'", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -207,21 +205,21 @@ "step": "word_string_check" }, { - "page": "Introducing Variables", + "get_solution": "program", + "page": "\u4ecb\u7ecd\u53d8\u91cf", "program": [ "sunshine" ], "response": { - "message": "", "passed": true, "prediction": { - "answer": "Error", + "answer": "\u9519\u8bef", "choices": [ "sunshine", "'sunshine'", "Hello", "'Hello'", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -235,11 +233,13 @@ }, "frames": [ { + "filename": "/my_program.py", + "lineno": 1, "lines": [ { - "content": "sunshine", "is_current": true, "lineno": 1, + "text": "sunshine", "type": "line" } ], @@ -254,7 +254,7 @@ ], "text": [ "Traceback (most recent call last):", - " File \"my_program.py\", line 1, in ", + " File \"/my_program.py\", line 1, in ", "--> 1 | sunshine", " ^^^^^^^^", "", @@ -267,72 +267,72 @@ "step": "sunshine_undefined_check" }, { - "page": "Using Variables and print()", + "page": "\u4f7f\u7528\u53d8\u91cf\u548c print()", "program": [ "foo = 3" ], "response": { - "message": "

    Put your_name before the = to create a variable called your_name.

    ", + "message": "

    \u5728 = \u524d\u9762\u653e\u4e0a your_name \u6765\u521b\u5efa\u4e00\u4e2a\u540d\u4e3a your_name \u7684\u53d8\u91cf\u3002

    ", "passed": false, "result": [] }, "step": "name_assign" }, { - "page": "Using Variables and print()", + "page": "\u4f7f\u7528\u53d8\u91cf\u548c print()", "program": [ "your_name = ''" ], "response": { - "message": "

    For this exercise, choose a non-empty string

    ", + "message": "

    \u5728\u8fd9\u4e2a\u7ec3\u4e60\u4e2d\uff0c\u9009\u62e9\u4e00\u4e2a\u975e\u7a7a\u5b57\u7b26\u4e32\u3002

    ", "passed": false, "result": [] }, "step": "name_assign" }, { - "page": "Using Variables and print()", + "page": "\u4f7f\u7528\u53d8\u91cf\u548c print()", "program": [ "your_name = 3" ], "response": { - "message": "

    You've got the your_name = part right, now put a string (use quotes) on the right of the =.

    ", + "message": "

    \u4f60\u5df2\u7ecf\u628a your_name = \u90e8\u5206\u5199\u5bf9\u4e86\uff0c\u73b0\u5728\u5728 = \u7684\u53f3\u8fb9\u653e\u4e00\u4e2a\u5b57\u7b26\u4e32\uff08\u4f7f\u7528\u5f15\u53f7\uff09\u3002

    ", "passed": false, "result": [] }, "step": "name_assign" }, { - "page": "Using Variables and print()", + "page": "\u4f7f\u7528\u53d8\u91cf\u548c print()", "program": [ "your_name = ' Alex'" ], "response": { - "message": "

    For this exercise, choose a name that doesn't start with a space.

    ", + "message": "

    \u5728\u8fd9\u4e2a\u7ec3\u4e60\u4e2d\uff0c\u9009\u62e9\u4e00\u4e2a\u4e0d\u4ee5\u7a7a\u683c\u5f00\u5934\u7684\u540d\u5b57\u3002

    ", "passed": false, "result": [] }, "step": "name_assign" }, { - "page": "Using Variables and print()", + "get_solution": "program", + "page": "\u4f7f\u7528\u53d8\u91cf\u548c print()", "program": [ "your_name = 'Alex'" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "name_assign" }, { - "page": "Using Variables and print()", + "get_solution": "program", + "page": "\u4f7f\u7528\u53d8\u91cf\u548c print()", "program": [ "'Hello ' + your_name" ], "response": { - "message": "", "passed": true, "result": [ { @@ -344,24 +344,24 @@ "step": "hello_plus_name" }, { - "page": "Using Variables and print()", + "page": "\u4f7f\u7528\u53d8\u91cf\u548c print()", "program": [ "word = 2" ], "response": { - "message": "

    Oops, you need to set word = 'Hello' before we can continue.

    ", + "message": "

    \u54ce\u5440\uff0c\u4f60\u9700\u8981\u5148\u8bbe\u7f6e word = 'Hello'\uff0c\u7136\u540e\u6211\u4eec\u624d\u80fd\u7ee7\u7eed\u3002

    ", "passed": false, "result": [] }, "step": "word_plus_name" }, { - "page": "Using Variables and print()", + "get_solution": "program", + "page": "\u4f7f\u7528\u53d8\u91cf\u548c print()", "program": [ "word + your_name" ], "response": { - "message": "", "passed": true, "result": [ { @@ -373,27 +373,24 @@ "step": "word_plus_name" }, { - "page": "Using Variables and print()", + "page": "\u4f7f\u7528\u53d8\u91cf\u548c print()", "program": [ "word = 2" ], "response": { - "message": "

    Oops, you need to set word = 'Hello' before we can continue.

    ", + "message": "

    \u54ce\u5440\uff0c\u4f60\u9700\u8981\u5148\u8bbe\u7f6e word = 'Hello'\uff0c\u7136\u540e\u6211\u4eec\u624d\u80fd\u7ee7\u7eed\u3002

    ", "passed": false, "result": [] }, "step": "word_plus_name_with_space" }, { - "get_solution": [ - "word + ' ' + your_name" - ], - "page": "Using Variables and print()", + "get_solution": "program", + "page": "\u4f7f\u7528\u53d8\u91cf\u548c print()", "program": [ "word + ' ' + your_name" ], "response": { - "message": "", "passed": true, "result": [ { @@ -405,24 +402,24 @@ "step": "word_plus_name_with_space" }, { - "page": "Using Variables and print()", + "get_solution": "program", + "page": "\u4f7f\u7528\u53d8\u91cf\u548c print()", "program": [ "word = 'Goodbye'" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "word_assign_goodbye" }, { - "page": "Using Variables and print()", + "get_solution": "program", + "page": "\u4f7f\u7528\u53d8\u91cf\u548c print()", "program": [ "word + ' ' + your_name" ], "response": { - "message": "", "passed": true, "result": [ { @@ -434,12 +431,12 @@ "step": "goodbye_plus_name" }, { - "page": "Using Variables and print()", + "get_solution": "program", + "page": "\u4f7f\u7528\u53d8\u91cf\u548c print()", "program": [ "print(word + ' ' + your_name)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -451,7 +448,8 @@ "step": "first_print" }, { - "page": "Writing Programs", + "get_solution": "program", + "page": "\u7f16\u5199\u7a0b\u5e8f", "program": [ "word = 'Hello'", "name = 'World'", @@ -460,7 +458,6 @@ "print(word + ' ' + name)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -472,7 +469,8 @@ "step": "editor_hello_world" }, { - "page": "Storing Calculations In Variables", + "get_solution": "program", + "page": "\u5728\u53d8\u91cf\u4e2d\u5b58\u50a8\u8ba1\u7b97\u7ed3\u679c", "program": [ "word = 'Hello'", "name = 'World'", @@ -480,7 +478,6 @@ "print(sentence)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Hello World", @@ -491,7 +488,7 @@ "'Hello' + ' ' + 'World'", "Hello World", "'Hello World'", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -504,7 +501,8 @@ "step": "sentence_equals_word_plus_name" }, { - "page": "Storing Calculations In Variables", + "get_solution": "program", + "page": "\u5728\u53d8\u91cf\u4e2d\u5b58\u50a8\u8ba1\u7b97\u7ed3\u679c", "program": [ "word = 'Hello'", "name = 'World'", @@ -514,7 +512,6 @@ "print(sentence)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Hello World\nHello World", @@ -522,7 +519,7 @@ "Hello World\nHello World", "Hello World\nGoodbye World", "Goodbye World\nGoodbye World", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -535,13 +532,13 @@ "step": "sentence_doesnt_change" }, { - "page": "Introducing For Loops", + "get_solution": "program", + "page": "\u4ecb\u7ecd For \u5faa\u73af", "program": [ "name = 'World'", "for character in name: print(character)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -553,17 +550,18 @@ "step": "first_for_loop" }, { - "page": "Indentation", + "get_solution": "program", + "page": "\u7f29\u8fdb", "program": [ "for character in name:", "print(character)" ], "response": { - "message": "", "passed": true, "result": [ { - "text": " print(character)\n ^\nIndentationError: expected an indented block\nat line 2\n\nAn `IndentationError` occurs when a given line of code is\nnot indented (aligned vertically with other lines) as expected.\n\nLine `2` identified above was expected to begin a new indented block.\n\n\n", + "friendly": "

    An IndentationError occurs when a given line of code is\nnot indented (aligned vertically with other lines) as expected.

    \n

    Line 2 identified above was expected to begin a new indented block.

    ", + "text": " print(character)\n ^^^^^\nIndentationError: expected an indented block after 'for' statement on line 1\n\u5728\u7b2c 2\n", "type": "syntax_error" } ] @@ -571,7 +569,8 @@ "step": "missing_indentation" }, { - "page": "Indentation", + "get_solution": "program", + "page": "\u7f29\u8fdb", "program": [ "name = 'World'", "", @@ -580,7 +579,6 @@ " print('---')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -592,7 +590,8 @@ "step": "two_indented_lines" }, { - "page": "Indentation", + "get_solution": "program", + "page": "\u7f29\u8fdb", "program": [ "name = 'World'", "", @@ -601,7 +600,6 @@ "print('---')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -613,18 +611,19 @@ "step": "one_indented_line" }, { - "page": "Indentation", + "get_solution": "program", + "page": "\u7f29\u8fdb", "program": [ "for character in name:", " print(character)", " print('---')" ], "response": { - "message": "", "passed": true, "result": [ { - "text": " print('---')\n ^\nIndentationError: unindent does not match any outer indentation level\nat line 3\n\nAn `IndentationError` occurs when a given line of code is\nnot indented (aligned vertically with other lines) as expected.\n\nLine `3` identified above is less indented than expected.\n\n\n", + "friendly": "

    An IndentationError occurs when a given line of code is\nnot indented (aligned vertically with other lines) as expected.

    \n

    Line 3 identified above is less indented than expected.

    ", + "text": " print('---')\n ^\nIndentationError: unindent does not match any outer indentation level\n\u5728\u7b2c 3\n", "type": "syntax_error" } ] @@ -636,14 +635,13 @@ "for character in name:", " print('---' + character)" ], - "page": "Basic For Loop Exercises", + "page": "\u57fa\u7840 for \u5faa\u73af\u7ec3\u4e60", "program": [ "name = 'World'", "for character in name:", " print('---' + character)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -659,14 +657,13 @@ "for _ in name:", " print(name)" ], - "page": "Basic For Loop Exercises", + "page": "\u57fa\u7840 for \u5faa\u73af\u7ec3\u4e60", "program": [ "name = 'World'", "for _ in name:", " print(name)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -678,7 +675,8 @@ "step": "loop_exercise_2" }, { - "page": "Building Up Strings", + "get_solution": "program", + "page": "\u6784\u5efa\u5b57\u7b26\u4e32", "program": [ "hello = 'Hello'", "print(hello)", @@ -686,7 +684,6 @@ "print(hello)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Hello\nHello!", @@ -694,7 +691,7 @@ "Hello\nHello", "Hello\nHello!", "Hello!\nHello!", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -707,7 +704,8 @@ "step": "hello_plus_equals" }, { - "page": "Building Up Strings", + "get_solution": "program", + "page": "\u6784\u5efa\u5b57\u7b26\u4e32", "program": [ "name = 'World'", "line = '-'", @@ -716,7 +714,6 @@ " print(line)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "-W\n-Wo\n-Wor\n-Worl\n-World", @@ -729,7 +726,7 @@ "-World\n-Worl\n-Wor\n-Wo\n-W", "-World\n-World\n-World\n-World\n-World", "-World\n--World\n---World\n----World\n-----World", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -742,7 +739,8 @@ "step": "name_triangle" }, { - "page": "Building Up Strings", + "get_solution": "program", + "page": "\u6784\u5efa\u5b57\u7b26\u4e32", "program": [ "name = 'World'", "line = '-'", @@ -751,7 +749,6 @@ " line = line + char" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "-\n-W\n-Wo\n-Wor\n-Worl", @@ -759,7 +756,7 @@ "-W\n-Wo\n-Wor\n-Worl\n-World", "-Wo\n-Wor\n-Worl\n-World", "-\n-W\n-Wo\n-Wor\n-Worl", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -772,12 +769,12 @@ "step": "name_triangle_missing_last_line" }, { - "page": "Building Up Strings", + "get_solution": "program", + "page": "\u6784\u5efa\u5b57\u7b26\u4e32", "program": [ "'' + '' + ''" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "''", @@ -791,7 +788,7 @@ "'' '' ''", "' '' '' '", "++", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -810,7 +807,7 @@ " line = line + char", " print(line)" ], - "page": "Building Up Strings", + "page": "\u6784\u5efa\u5b57\u7b26\u4e32", "program": [ "name = 'World'", "line = ''", @@ -819,7 +816,6 @@ " print(line)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -837,7 +833,7 @@ " line = line + char + ' '", " print(line)" ], - "page": "Building Up Strings Exercises", + "page": "\u5b57\u7b26\u4e32\u6784\u5efa\u7ec3\u4e60", "program": [ "name = 'World'", "line = ''", @@ -846,7 +842,6 @@ " print(line)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -864,7 +859,7 @@ " line = char + line", " print(line)" ], - "page": "Building Up Strings Exercises", + "page": "\u5b57\u7b26\u4e32\u6784\u5efa\u7ec3\u4e60", "program": [ "name = 'World'", "line = ''", @@ -873,7 +868,6 @@ " print(line)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -892,7 +886,7 @@ "print(name)", "print(line)" ], - "page": "Building Up Strings Exercises", + "page": "\u5b57\u7b26\u4e32\u6784\u5efa\u7ec3\u4e60", "program": [ "name = 'World'", "line = ''", @@ -902,7 +896,6 @@ "print(line)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -923,7 +916,7 @@ "print('|' + name + '|')", "print(line)" ], - "page": "Building Up Strings Exercises", + "page": "\u5b57\u7b26\u4e32\u6784\u5efa\u7ec3\u4e60", "program": [ "name = 'World'", "line = ''", @@ -935,7 +928,6 @@ "print(line)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -958,7 +950,7 @@ " print(char + spaces + char)", "print(line)" ], - "page": "Building Up Strings Exercises", + "page": "\u5b57\u7b26\u4e32\u6784\u5efa\u7ec3\u4e60", "program": [ "name = 'World'", "line = '+' + name + '+'", @@ -972,7 +964,6 @@ "print(line)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -984,7 +975,7 @@ "step": "name_box_2" }, { - "page": "Building Up Strings Exercises", + "page": "\u5b57\u7b26\u4e32\u6784\u5efa\u7ec3\u4e60", "program": [ "name = 'World'", "spaces = ''", @@ -993,7 +984,7 @@ " print(spaces + char)" ], "response": { - "message": "

    Almost there! You have one space too many before each letter.\nMake sure that the first time your loop calls print\nyour variable which will contain the spaces is an empty string.\nCheck the order of your code.

    ", + "message": "

    \u5feb\u5230\u4e86\uff01\u6bcf\u4e2a\u5b57\u6bcd\u524d\u9762\u591a\u4e86\u4e00\u4e2a\u7a7a\u683c\u3002\n\u786e\u4fdd\u4f60\u7684\u5faa\u73af\u7b2c\u4e00\u6b21\u8c03\u7528 print \u65f6\uff0c\n\u5305\u542b\u7a7a\u683c\u7684\u53d8\u91cf\u662f\u4e00\u4e2a\u7a7a\u5b57\u7b26\u4e32\u3002\n\u68c0\u67e5\u4f60\u7684\u4ee3\u7801\u987a\u5e8f\u3002

    ", "passed": false, "result": [ { @@ -1011,7 +1002,7 @@ " print(spaces + char)", " spaces += ' '" ], - "page": "Building Up Strings Exercises", + "page": "\u5b57\u7b26\u4e32\u6784\u5efa\u7ec3\u4e60", "program": [ "name = 'World'", "spaces = ''", @@ -1020,7 +1011,6 @@ " spaces += ' '" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1032,7 +1022,8 @@ "step": "diagonal_name_bonus_challenge" }, { - "page": "Introducing If Statements", + "get_solution": "program", + "page": "\u4ecb\u7ecd if \u8bed\u53e5", "program": [ "condition = True", "print(condition)", @@ -1040,7 +1031,6 @@ "print(condition)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1052,7 +1042,8 @@ "step": "introducing_booleans" }, { - "page": "Introducing If Statements", + "get_solution": "program", + "page": "\u4ecb\u7ecd if \u8bed\u53e5", "program": [ "if True:", " print('This gets printed')", @@ -1061,7 +1052,6 @@ " print('This does not')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1073,7 +1063,8 @@ "step": "first_if_statements" }, { - "page": "Introducing If Statements", + "get_solution": "program", + "page": "\u4ecb\u7ecd if \u8bed\u53e5", "program": [ "sentence = 'Hello World'", "excited = True", @@ -1082,14 +1073,13 @@ "print(sentence)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Hello World!", "choices": [ "Hello World", "Hello World!", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -1102,7 +1092,8 @@ "step": "excited_example" }, { - "page": "Introducing If Statements", + "get_solution": "program", + "page": "\u4ecb\u7ecd if \u8bed\u53e5", "program": [ "sentence = 'Hello World'", "excited = False", @@ -1111,14 +1102,13 @@ "print(sentence)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Hello World", "choices": [ "Hello World", "Hello World!", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -1138,7 +1128,7 @@ " sentence += '?'", "print(sentence)" ], - "page": "Introducing If Statements", + "page": "\u4ecb\u7ecd if \u8bed\u53e5", "program": [ "sentence = 'Hello'", "excited = True", @@ -1150,7 +1140,6 @@ "print(sentence)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1162,7 +1151,8 @@ "step": "excited_confused_exercise" }, { - "page": "Combining Compound Statements", + "get_solution": "program", + "page": "\u7ec4\u5408\u590d\u5408\u8bed\u53e5", "program": [ "sentence = 'Hello World'", "excited = True", @@ -1176,7 +1166,6 @@ "print(sentence)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "H!e!l!l!o! !W!o!r!l!d!", @@ -1190,7 +1179,7 @@ "!Hello World!", "H!e!l!l!o! !W!o!r!l!d!", "!H!e!l!l!o! !W!o!r!l!d", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -1203,7 +1192,8 @@ "step": "for_inside_if" }, { - "page": "Understanding Programs With snoop", + "get_solution": "program", + "page": "\u4f7f\u7528 snoop \u7406\u89e3\u7a0b\u5e8f", "program": [ "sentence = 'Hello World'", "", @@ -1217,7 +1207,6 @@ "print(new_sentence)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "ello World", @@ -1227,7 +1216,7 @@ "Hello Worl", "H", "d", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -1240,7 +1229,8 @@ "step": "print_tail" }, { - "page": "Understanding Programs With snoop", + "get_solution": "program", + "page": "\u4f7f\u7528 snoop \u7406\u89e3\u7a0b\u5e8f", "program": [ "sentence = 'Hello World'", "", @@ -1254,208 +1244,43 @@ "print(new_sentence)" ], "response": { - "message": "", "passed": true, "result": [ { - "text": "", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 1\u001b[0m | sentence \u001b[38;5;197m=\u001b[39m \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello World\u001b[39m\u001b[38;5;186m'\u001b[39m\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 3\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mFalse\u001b[39m\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 4\u001b[0m | new_sentence \u001b[38;5;197m=\u001b[39m \u001b[38;5;186m'\u001b[39m\u001b[38;5;186m'\u001b[39m\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mH\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186me\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186me\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186ml\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mel\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mell\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186m \u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello \u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mW\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello W\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Wo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mr\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Wor\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186ml\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n", - "type": "stdout" + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 1\u001b[0m | sentence \u001b[38;5;204m=\u001b[39m \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello World\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 3\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mFalse\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 4\u001b[0m | new_sentence \u001b[38;5;204m=\u001b[39m \u001b[38;5;186m'\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mH\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186me\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186me\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n", + "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Worl\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n", - "type": "stdout" + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186ml\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mel\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mell\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n", + "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", - "type": "stdout" + "text": "\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186m \u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello \u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n", + "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186md\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n", - "type": "stdout" + "text": "\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mW\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello W\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Wo\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n", + "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 7\u001b[0m | new_sentence \u001b[38;5;197m+\u001b[39m\u001b[38;5;197m=\u001b[39m char\n", - "type": "stdout" + "text": "\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mr\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Wor\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186ml\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello Worl\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n", + "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello World\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | include \u001b[38;5;197m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n", - "type": "stdout" + "text": "\u001b[38;5;245m \u001b[0m...... char = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186md\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | \u001b[38;5;81mif\u001b[39m include:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 7\u001b[0m | new_sentence \u001b[38;5;204m+\u001b[39m\u001b[38;5;204m=\u001b[39m char\n\u001b[38;5;245m \u001b[0m.............. new_sentence = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mello World\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | include \u001b[38;5;204m=\u001b[39m \u001b[38;5;81mTrue\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;204min\u001b[39m sentence:\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 10\u001b[0m | print(new_sentence)\n", + "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mfor\u001b[39m char \u001b[38;5;197min\u001b[39m sentence:\n", + "text": "ello World", "type": "stdout" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 10\u001b[0m | print(new_sentence)\n", + "text": "\n", "type": "stdout" }, { - "text": "ello World\n", - "type": "stdout" + "text": "", + "type": "snoop" } ] }, @@ -1472,7 +1297,7 @@ "", "print(new_sentence)" ], - "page": "Understanding Programs With snoop", + "page": "\u4f7f\u7528 snoop \u7406\u89e3\u7a0b\u5e8f", "program": [ "sentence = 'Hello there'", "include = True", @@ -1485,7 +1310,6 @@ "print(new_sentence)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1497,7 +1321,8 @@ "step": "print_first_character" }, { - "page": "if and else", + "get_solution": "program", + "page": "if \u548c else", "program": [ "condition = True", "if condition:", @@ -1506,7 +1331,6 @@ " print('No')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1518,7 +1342,8 @@ "step": "first_if_else" }, { - "page": "if and else", + "get_solution": "program", + "page": "if \u548c else", "program": [ "condition = False", "if condition:", @@ -1527,7 +1352,6 @@ " print('No')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1539,7 +1363,8 @@ "step": "first_if_else_false" }, { - "page": "if and else", + "get_solution": "program", + "page": "if \u548c else", "program": [ "sentence = 'Hello World'", "excited = True", @@ -1550,7 +1375,6 @@ "print(sentence)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1562,7 +1386,8 @@ "step": "if_upper_else_lower" }, { - "page": "if and else", + "get_solution": "program", + "page": "if \u548c else", "program": [ "sentence = 'Hello World'", "excited = False", @@ -1573,7 +1398,6 @@ "print(sentence)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1585,7 +1409,8 @@ "step": "if_upper_else_lower_false" }, { - "page": "if and else", + "get_solution": "program", + "page": "if \u548c else", "program": [ "sentence = 'Hello World'", "excited = False", @@ -1597,14 +1422,13 @@ "print(sentence)" ], "response": { - "message": "", "passed": true, "prediction": { - "answer": "Error", + "answer": "\u9519\u8bef", "choices": [ "Hello World", "Hello World!", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -1620,11 +1444,13 @@ }, "frames": [ { + "filename": "/my_program.py", + "lineno": 6, "lines": [ { - "content": "sentence += char", "is_current": true, "lineno": 6, + "text": "sentence += char", "type": "line" } ], @@ -1648,7 +1474,7 @@ ], "text": [ "Traceback (most recent call last):", - " File \"my_program.py\", line 6, in ", + " File \"/my_program.py\", line 6, in ", " 5 | char = '!'", "--> 6 | sentence += char", " ^^^^", @@ -1664,7 +1490,16 @@ "step": "undefined_char" }, { - "page": "if and else", + "get_solution": [ + "if excited:", + " char = '!'", + "else:", + " char = '.'", + "sentence += char", + "", + "print(sentence)" + ], + "page": "if \u548c else", "program": [ "sentence = 'Hello there'", "excited = True", @@ -1677,7 +1512,6 @@ "print(sentence)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1702,7 +1536,7 @@ "", "print(new_sentence)" ], - "page": "if and else", + "page": "if \u548c else", "program": [ "sentence = 'HELLO THERE'", "upper = True", @@ -1718,7 +1552,6 @@ "print(new_sentence)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1744,7 +1577,7 @@ "", "print(new_sentence)" ], - "page": "if and else", + "page": "if \u548c else", "program": [ "sentence = 'One more exercise, and then you can relax.'", "upper = True", @@ -1761,7 +1594,6 @@ "print(new_sentence)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1773,14 +1605,14 @@ "step": "spongebob" }, { - "page": "The Equality Operator", + "get_solution": "program", + "page": "\u7b49\u53f7\u64cd\u4f5c\u7b26", "program": [ "print(1 + 2 == 3)", "print(4 + 5 == 6)", "print('ab' + 'c' == 'a' + 'bc')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1792,16 +1624,17 @@ "step": "introducing_equality" }, { - "page": "The Equality Operator", + "get_solution": "program", + "page": "\u7b49\u53f7\u64cd\u4f5c\u7b26", "program": [ "print(1 + 2 = 3)" ], "response": { - "message": "", "passed": true, "result": [ { - "text": " print(1 + 2 = 3)\n ^\nSyntaxError: expression cannot contain assignment, perhaps you meant \"==\"?\nat line 1\n\nA `SyntaxError` occurs when Python cannot understand your code.\n\nYou likely called a function with a named argument:\n\n a_function(invalid=something) \n\nwhere `invalid` is not a valid variable name in Python\neither because it starts with a number, or is a string,\nor contains a period, etc.\n\n\n", + "friendly": "

    A SyntaxError occurs when Python cannot understand your code.

    \n

    You likely called a function with a named argument:

    \n
    a_function(invalid=something)\n
    \n

    where invalid is not a valid variable name in Python\neither because it starts with a number, or is a string,\nor contains a period, etc.

    ", + "text": " print(1 + 2 = 3)\n ^^^^^^^\nSyntaxError: expression cannot contain assignment, perhaps you meant \"==\"?\n\u5728\u7b2c 1\n", "type": "syntax_error" } ] @@ -1809,7 +1642,8 @@ "step": "equality_vs_assignment" }, { - "page": "The Equality Operator", + "get_solution": "program", + "page": "\u7b49\u53f7\u64cd\u4f5c\u7b26", "program": [ "name = 'kesha'", "new_name = ''", @@ -1821,7 +1655,6 @@ "print(new_name)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1846,7 +1679,7 @@ "", "print(new_name)" ], - "page": "The Equality Operator", + "page": "\u7b49\u53f7\u64cd\u4f5c\u7b26", "program": [ "name = 'kesha'", "new_name = ''", @@ -1862,7 +1695,6 @@ "print(new_name)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1874,7 +1706,8 @@ "step": "if_equals_replacing_characters_exercise" }, { - "page": "Introducing elif", + "get_solution": "program", + "page": "\u4ecb\u7ecd elif", "program": [ "dna = 'AGTAGCGTC'", "opposite_dna = ''", @@ -1892,7 +1725,6 @@ "print(opposite_dna)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1921,7 +1753,7 @@ "", "print(opposite_dna)" ], - "page": "Introducing elif", + "page": "\u4ecb\u7ecd elif", "program": [ "dna = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT'", "opposite_dna = ''", @@ -1941,7 +1773,6 @@ "print(opposite_dna)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1953,7 +1784,8 @@ "step": "dna_example_with_else" }, { - "page": "Introducing elif", + "get_solution": "program", + "page": "\u4ecb\u7ecd elif", "program": [ "dna = 'AGTAGCGTC'", "opposite_dna = ''", @@ -1971,7 +1803,6 @@ "print(opposite_dna)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -1983,13 +1814,21 @@ "step": "dna_example_with_elif" }, { - "page": "Other Comparison Operators", + "get_solution": "program", + "page": "\u5176\u4ed6\u6bd4\u8f83\u8fd0\u7b97\u7b26", "program": [ "1 != 2" ], "response": { - "message": "", "passed": true, + "prediction": { + "answer": "True", + "choices": [ + "True", + "False", + "\u9519\u8bef" + ] + }, "result": [ { "text": "True\n", @@ -2000,7 +1839,8 @@ "step": "try_not_equals" }, { - "page": "Other Comparison Operators", + "get_solution": "program", + "page": "\u5176\u4ed6\u6bd4\u8f83\u8fd0\u7b97\u7b26", "program": [ "sentence = 'The e key on my keyboard is broken'", "new_sentence = ''", @@ -2010,7 +1850,6 @@ "print(new_sentence)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2022,15 +1861,12 @@ "step": "brokn_kyboard" }, { - "get_solution": [ - "1 < 2" - ], - "page": "Other Comparison Operators", + "get_solution": "program", + "page": "\u5176\u4ed6\u6bd4\u8f83\u8fd0\u7b97\u7b26", "program": [ "1 < 2" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2042,15 +1878,12 @@ "step": "introducing_less_than" }, { - "get_solution": [ - "'1' < '2'" - ], - "page": "Other Comparison Operators", + "get_solution": "program", + "page": "\u5176\u4ed6\u6bd4\u8f83\u8fd0\u7b97\u7b26", "program": [ "'1' < '2'" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2062,7 +1895,8 @@ "step": "comparing_strings" }, { - "page": "Other Comparison Operators", + "get_solution": "program", + "page": "\u5176\u4ed6\u6bd4\u8f83\u8fd0\u7b97\u7b26", "program": [ "percentage = 73", "", @@ -2078,7 +1912,6 @@ "print(grade)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "B", @@ -2087,7 +1920,7 @@ "C", "B", "A", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -2113,7 +1946,7 @@ " first = x3", "print(first)" ], - "page": "Other Comparison Operators", + "page": "\u5176\u4ed6\u6bd4\u8f83\u8fd0\u7b97\u7b26", "program": [ "x1 = 1", "x2 = 2", @@ -2131,7 +1964,6 @@ "print(first)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2143,7 +1975,8 @@ "step": "min_three_exercise" }, { - "page": "Introducing Lists", + "get_solution": "program", + "page": "\u4ecb\u7ecd\u5217\u8868", "program": [ "words = ['This', 'is', 'a', 'list']", "", @@ -2151,7 +1984,6 @@ " print(word)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2163,14 +1995,14 @@ "step": "first_list" }, { - "page": "Introducing Lists", + "get_solution": "program", + "page": "\u4ecb\u7ecd\u5217\u8868", "program": [ "x = 1", "things = ['Hello', x, x + 3]", "print(things)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2182,7 +2014,8 @@ "step": "can_contain_anything" }, { - "page": "Introducing Lists", + "get_solution": "program", + "page": "\u4ecb\u7ecd\u5217\u8868", "program": [ "numbers = [3, 1, 4, 1, 5, 9]", "", @@ -2193,7 +2026,6 @@ "print(total)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2212,7 +2044,7 @@ "", "print(total)" ], - "page": "Introducing Lists", + "page": "\u4ecb\u7ecd\u5217\u8868", "program": [ "words = ['This', 'is', 'a', 'list']", "total = ''", @@ -2222,7 +2054,6 @@ "print(total)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2246,7 +2077,7 @@ "", "print(total)" ], - "page": "Introducing Lists", + "page": "\u4ecb\u7ecd\u5217\u8868", "program": [ "words = ['This', 'is', 'a', 'list']", "separator = ' - '", @@ -2262,7 +2093,6 @@ "print(total)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2280,7 +2110,7 @@ " double += [number * 2]", "print(double)" ], - "page": "Building New Lists", + "page": "\u521b\u5efa\u65b0\u5217\u8868", "program": [ "numbers = [3, 1, 4, 1, 5, 9, 2, 6, 5]", "double = []", @@ -2289,7 +2119,6 @@ "print(double)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2308,7 +2137,7 @@ " big_numbers.append(number)", "print(big_numbers)" ], - "page": "Building New Lists", + "page": "\u521b\u5efa\u65b0\u5217\u8868", "program": [ "numbers = [3, 1, 4, 1, 5, 9, 2, 6, 5]", "big_numbers = []", @@ -2318,7 +2147,6 @@ "print(big_numbers)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2338,7 +2166,7 @@ "", "print(found)" ], - "page": "Using break to end a loop early", + "page": "\u4f7f\u7528 break \u63d0\u524d\u7ed3\u675f\u5faa\u73af", "program": [ "things = ['This', 'is', 'a', 'list']", "thing_to_find = 'is'", @@ -2350,7 +2178,6 @@ "print(found)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2362,7 +2189,8 @@ "step": "list_contains_exercise" }, { - "page": "Getting elements at a position, range(), and len()", + "get_solution": "program", + "page": "\u83b7\u53d6\u4f4d\u7f6e\u4e0a\u7684\u5143\u7d20\uff0crange() \u548c len()", "program": [ "words = ['This', 'is', 'a', 'list']", "", @@ -2372,7 +2200,6 @@ "print(words[3])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2384,12 +2211,12 @@ "step": "introducing_subscripting" }, { - "page": "Getting elements at a position, range(), and len()", + "get_solution": "program", + "page": "\u83b7\u53d6\u4f4d\u7f6e\u4e0a\u7684\u5143\u7d20\uff0crange() \u548c len()", "program": [ "words[4]" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2402,11 +2229,13 @@ }, "frames": [ { + "filename": "/my_program.py", + "lineno": 1, "lines": [ { - "content": "words[4]", "is_current": true, "lineno": 1, + "text": "words[4]", "type": "line" } ], @@ -2426,7 +2255,7 @@ ], "text": [ "Traceback (most recent call last):", - " File \"my_program.py\", line 1, in ", + " File \"/my_program.py\", line 1, in ", "--> 1 | words[4]", " ^^^^^^^^", "words = ['This', 'is', 'a', 'list']", @@ -2440,7 +2269,8 @@ "step": "index_error" }, { - "page": "Getting elements at a position, range(), and len()", + "get_solution": "program", + "page": "\u83b7\u53d6\u4f4d\u7f6e\u4e0a\u7684\u5143\u7d20\uff0crange() \u548c len()", "program": [ "words = ['This', 'is', 'a', 'list']", "indices = [0, 1, 2, 3]", @@ -2450,7 +2280,6 @@ " print(words[index])" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "0\nThis\n1\nis\n2\na\n3\nlist", @@ -2461,7 +2290,7 @@ "This\n0\nis\n1\na\n2\nlist\n3", "0\n1\n2\n3\nThis\nis\na\nlist", "This\nis\na\nlist\n0\n1\n2\n3", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -2474,7 +2303,8 @@ "step": "introducing_len_and_range" }, { - "page": "Getting elements at a position, range(), and len()", + "get_solution": "program", + "page": "\u83b7\u53d6\u4f4d\u7f6e\u4e0a\u7684\u5143\u7d20\uff0crange() \u548c len()", "program": [ "words = ['This', 'is', 'a', 'list']", "indices = range(4)", @@ -2484,7 +2314,6 @@ " print(words[index])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2496,7 +2325,8 @@ "step": "range_len" }, { - "page": "Getting elements at a position, range(), and len()", + "get_solution": "program", + "page": "\u83b7\u53d6\u4f4d\u7f6e\u4e0a\u7684\u5143\u7d20\uff0crange() \u548c len()", "program": [ "indices = range(4)", "", @@ -2506,7 +2336,6 @@ "print(indices[3])" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "0\n1\n2\n3", @@ -2516,7 +2345,7 @@ "[0]\n[1]\n[2]\n[3]", "[1]\n[2]\n[3]\n[4]", "This\nis\na\nlist", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -2529,22 +2358,22 @@ "step": "printing_the_range" }, { - "page": "Getting elements at a position, range(), and len()", + "get_solution": "program", + "page": "\u83b7\u53d6\u4f4d\u7f6e\u4e0a\u7684\u5143\u7d20\uff0crange() \u548c len()", "program": [ "indices[4]" ], "response": { - "message": "", "passed": true, "prediction": { - "answer": "Error", + "answer": "\u9519\u8bef", "choices": [ "0", "1", "2", "3", "4", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -2558,11 +2387,13 @@ }, "frames": [ { + "filename": "/my_program.py", + "lineno": 1, "lines": [ { - "content": "indices[4]", "is_current": true, "lineno": 1, + "text": "indices[4]", "type": "line" } ], @@ -2576,13 +2407,13 @@ ] } ], - "friendly": "

    An IndexError occurs when you try to get an item from a list,\na tuple, or a similar object (sequence), and use an index which\ndoes not exist; typically, this happens because the index you give\nis greater than the length of the sequence.

    \n

    You have tried to get the item with index 4 of indices,\nrange object of length 4.\nThe valid index values of indices are integers ranging from\n-4 to 3.

    ", + "friendly": "

    An IndexError occurs when you try to get an item from a list,\na tuple, or a similar object (sequence), and use an index which\ndoes not exist; typically, this happens because the index you give\nis greater than the length of the sequence.

    \n

    You have tried to get the item with index 4 of indices,\nrange object of length 4.\nThe valid index values of indices are integers ranging from\n-4 to 3.

    ", "tail": "" } ], "text": [ "Traceback (most recent call last):", - " File \"my_program.py\", line 1, in ", + " File \"/my_program.py\", line 1, in ", "--> 1 | indices[4]", " ^^^^^^^^^^", "indices = range(0, 4)", @@ -2596,12 +2427,12 @@ "step": "indices_out_of_bounds" }, { - "page": "Getting elements at a position, range(), and len()", + "get_solution": "program", + "page": "\u83b7\u53d6\u4f4d\u7f6e\u4e0a\u7684\u5143\u7d20\uff0crange() \u548c len()", "program": [ "range(4)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2613,12 +2444,12 @@ "step": "range_almost_the_same_as_list" }, { - "page": "Getting elements at a position, range(), and len()", + "get_solution": "program", + "page": "\u83b7\u53d6\u4f4d\u7f6e\u4e0a\u7684\u5143\u7d20\uff0crange() \u548c len()", "program": [ "list(range(4))" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "[0, 1, 2, 3]", @@ -2630,7 +2461,7 @@ "range(0, 1, 2, 3)", "(0, 1, 2, 3)", "[0, 1, 2, 3]", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -2643,13 +2474,13 @@ "step": "range_versus_list" }, { - "page": "Getting elements at a position, range(), and len()", + "get_solution": "program", + "page": "\u83b7\u53d6\u4f4d\u7f6e\u4e0a\u7684\u5143\u7d20\uff0crange() \u548c len()", "program": [ "words = ['This', 'is', 'a', 'list']", "print(len(words))" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "4", @@ -2660,7 +2491,7 @@ "3", "4", "5", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -2676,13 +2507,12 @@ "get_solution": [ "print(words[len(words) - 1])" ], - "page": "Getting elements at a position, range(), and len()", + "page": "\u83b7\u53d6\u4f4d\u7f6e\u4e0a\u7684\u5143\u7d20\uff0crange() \u548c len()", "program": [ "words = ['Python']", "print(words[len(words) - 1])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2699,7 +2529,7 @@ " print(index)", " print(words[index])" ], - "page": "Getting elements at a position, range(), and len()", + "page": "\u83b7\u53d6\u4f4d\u7f6e\u4e0a\u7684\u5143\u7d20\uff0crange() \u548c len()", "program": [ "words = ['Python']", "for index in range(len(words)):", @@ -2707,7 +2537,6 @@ " print(words[index])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2719,7 +2548,7 @@ "step": "print_indices_and_words" }, { - "page": "Exercises with range() and len()", + "page": "\u4f7f\u7528 range() \u548c len() \u7684\u7ec3\u4e60", "program": [ "things = ['on', 'the', 'way', 'to', 'the', 'store']", "to_find = 'the'", @@ -2728,7 +2557,7 @@ " print(i)" ], "response": { - "message": "

    You're almost there! However, this prints all the indices,\nnot just the first one.

    ", + "message": "

    \u4f60\u5feb\u5230\u4e86\uff01\u4f46\u662f\uff0c\u8fd9\u4f1a\u6253\u5370\u6240\u6709\u7684\u7d22\u5f15\uff0c\n\u800c\u4e0d\u4ec5\u4ec5\u662f\u7b2c\u4e00\u4e2a\u3002

    ", "passed": false, "result": [ { @@ -2740,7 +2569,7 @@ "step": "index_exercise" }, { - "page": "Exercises with range() and len()", + "page": "\u4f7f\u7528 range() \u548c len() \u7684\u7ec3\u4e60", "program": [ "things = ['on', 'the', 'way', 'to', 'the', 'store']", "to_find = 'the'", @@ -2751,7 +2580,7 @@ "print(answer)" ], "response": { - "message": "

    You're almost there! However, this prints the last index,\nnot the first one.

    ", + "message": "

    \u4f60\u5feb\u5230\u4e86\uff01\u4f46\u662f\uff0c\u8fd9\u4f1a\u6253\u5370 \u6700\u540e \u4e00\u4e2a\u7d22\u5f15\uff0c\n\u800c\u4e0d\u662f\u7b2c\u4e00\u4e2a\u3002

    ", "passed": false, "result": [ { @@ -2769,7 +2598,7 @@ " print(i)", " break" ], - "page": "Exercises with range() and len()", + "page": "\u4f7f\u7528 range() \u548c len() \u7684\u7ec3\u4e60", "program": [ "things = ['on', 'the', 'way', 'to', 'the', 'store']", "to_find = 'the'", @@ -2779,7 +2608,6 @@ " break" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2797,7 +2625,7 @@ " char2 = string2[i]", " print(char1 + ' ' + char2)" ], - "page": "Exercises with range() and len()", + "page": "\u4f7f\u7528 range() \u548c len() \u7684\u7ec3\u4e60", "program": [ "string1 = 'Hello'", "string2 = 'World'", @@ -2807,7 +2635,6 @@ " print(char1 + ' ' + char2)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2841,7 +2668,7 @@ "", " print(char1 + ' ' + char2)" ], - "page": "Exercises with range() and len()", + "page": "\u4f7f\u7528 range() \u548c len() \u7684\u7ec3\u4e60", "program": [ "string1 = 'Goodbye'", "string2 = 'World'", @@ -2867,7 +2694,6 @@ " print(char1 + ' ' + char2)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2879,13 +2705,13 @@ "step": "zip_longest_exercise" }, { - "page": "Terminology: Calling functions and methods", + "get_solution": "program", + "page": "\u672f\u8bed\uff1a\u8c03\u7528\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "print(len)", "print(print)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2897,12 +2723,12 @@ "step": "print_functions" }, { - "page": "Terminology: Calling functions and methods", + "get_solution": "program", + "page": "\u672f\u8bed\uff1a\u8c03\u7528\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "print(callable(len))" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2914,14 +2740,14 @@ "step": "introducing_callable" }, { - "page": "Terminology: Calling functions and methods", + "get_solution": "program", + "page": "\u672f\u8bed\uff1a\u8c03\u7528\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "f = 'a string'", "print(callable(f))", "f()" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2940,11 +2766,13 @@ }, "frames": [ { + "filename": "/my_program.py", + "lineno": 3, "lines": [ { - "content": "f()", "is_current": true, "lineno": 3, + "text": "f()", "type": "line" } ], @@ -2958,13 +2786,13 @@ ] } ], - "friendly": "

    A TypeError is usually caused by trying\nto combine two incompatible types of objects,\nby calling a function with the wrong type of object,\nor by trying to do an operation not allowed on a given type of object.

    \n

    The parenthesis () following f are interpreted\nby Python as a function call for f.\nHowever, f is not a function but an object of type str.

    ", + "friendly": "

    A TypeError is usually caused by trying\nto combine two incompatible types of objects,\nby calling a function with the wrong type of object,\nor by trying to do an operation not allowed on a given type of object.

    \n

    Because of the surrounding parenthesis, ` \nis interpreted by Python as indicating a function call forf, which is an object of typestr`\nwhich cannot be called.

    ", "tail": "" } ], "text": [ "Traceback (most recent call last):", - " File \"my_program.py\", line 3, in ", + " File \"/my_program.py\", line 3, in ", " 2 | print(callable(f))", "--> 3 | f()", " ^^^", @@ -2979,7 +2807,8 @@ "step": "not_callable" }, { - "page": "Terminology: Calling functions and methods", + "get_solution": "program", + "page": "\u672f\u8bed\uff1a\u8c03\u7528\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "things = [1, 2, 3]", "length = len(things)", @@ -2987,7 +2816,6 @@ "print(printed)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -2999,13 +2827,13 @@ "step": "print_returns_none" }, { - "page": "Terminology: Calling functions and methods", + "get_solution": "program", + "page": "\u672f\u8bed\uff1a\u8c03\u7528\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "things = print([1, 2, 3])", "length = len(things)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3024,11 +2852,13 @@ }, "frames": [ { + "filename": "/my_program.py", + "lineno": 2, "lines": [ { - "content": "length = len(things)", "is_current": true, "lineno": 2, + "text": "length = len(things)", "type": "line" } ], @@ -3048,7 +2878,7 @@ ], "text": [ "Traceback (most recent call last):", - " File \"my_program.py\", line 2, in ", + " File \"/my_program.py\", line 2, in ", " 1 | things = print([1, 2, 3])", "--> 2 | length = len(things)", " ^^^^^^^^^^^", @@ -3063,14 +2893,14 @@ "step": "len_of_none" }, { - "page": "Terminology: Calling functions and methods", + "get_solution": "program", + "page": "\u672f\u8bed\uff1a\u8c03\u7528\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "word = 'Hello'", "print(word.upper)", "print(word.upper())" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3082,13 +2912,13 @@ "step": "methods_of_str" }, { - "page": "Terminology: Calling functions and methods", + "get_solution": "program", + "page": "\u672f\u8bed\uff1a\u8c03\u7528\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "word = 'Hello'", "word.append('!')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3101,11 +2931,13 @@ }, "frames": [ { + "filename": "/my_program.py", + "lineno": 2, "lines": [ { - "content": "word.append('!')", "is_current": true, "lineno": 2, + "text": "word.append('!')", "type": "line" } ], @@ -3125,7 +2957,7 @@ ], "text": [ "Traceback (most recent call last):", - " File \"my_program.py\", line 2, in ", + " File \"/my_program.py\", line 2, in ", " 1 | word = 'Hello'", "--> 2 | word.append('!')", " ^^^^^^^^^^^", @@ -3140,7 +2972,8 @@ "step": "no_append_for_str" }, { - "page": "Functions and Methods for Lists", + "get_solution": "program", + "page": "\u5217\u8868\u7684\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "nums = [1, 2, 3]", "new_nums = nums + [4, 5]", @@ -3150,7 +2983,6 @@ "print(nums)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3162,14 +2994,14 @@ "step": "append_vs_concatenate" }, { - "page": "Functions and Methods for Lists", + "get_solution": "program", + "page": "\u5217\u8868\u7684\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "nums = [1, 2, 3]", "nums[1] = 9", "print(nums)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "[1, 9, 3]", @@ -3180,7 +3012,7 @@ "[9, 2, 3]", "[1, 9, 3]", "[1, 2, 9]", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -3193,12 +3025,12 @@ "step": "subscript_assignment_predict" }, { - "page": "Functions and Methods for Lists", + "get_solution": "program", + "page": "\u5217\u8868\u7684\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "[7, 8, 9, 8].index(8)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "1", @@ -3209,7 +3041,7 @@ "1", "2", "3", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -3222,14 +3054,14 @@ "step": "index_predict_exercise" }, { - "page": "Functions and Methods for Lists", + "get_solution": "program", + "page": "\u5217\u8868\u7684\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "nums = [1, 2, 3]", "print(nums.pop(1))", "print(nums)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "2\n[1, 3]", @@ -3240,7 +3072,7 @@ "2\n[2, 3]", "1\n[2, 1, 3]", "2\n[2, 1, 3]", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -3253,14 +3085,14 @@ "step": "pop_predict_exercise" }, { - "page": "Functions and Methods for Lists", + "get_solution": "program", + "page": "\u5217\u8868\u7684\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "nums = [1, 2, 3]", "nums.remove(1)", "print(nums)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "[2, 3]", @@ -3271,7 +3103,7 @@ "1", "2", "3", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -3284,19 +3116,14 @@ "step": "remove_predict_exercise" }, { - "get_solution": [ - "x = ['a', 'b', 'c']", - "x.append(x.pop(0))", - "print(x)" - ], - "page": "Functions and Methods for Lists", + "get_solution": "program", + "page": "\u5217\u8868\u7684\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "x = ['a', 'b', 'c']", "x.append(x.pop(0))", "print(x)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3308,19 +3135,14 @@ "step": "pop_remove_index_subscript_assignment" }, { - "get_solution": [ - "x = ['a', 'b', 'c']", - "x[len(x) - 1] = x[0]", - "print(x)" - ], - "page": "Functions and Methods for Lists", + "get_solution": "program", + "page": "\u5217\u8868\u7684\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "x = ['a', 'b', 'c']", "x[len(x) - 1] = x[0]", "print(x)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3332,19 +3154,14 @@ "step": "subscript_assignment_exercise" }, { - "get_solution": [ - "x = ['a', 'b', 'c']", - "y = x + [x[0]]", - "print(y)" - ], - "page": "Functions and Methods for Lists", + "get_solution": "program", + "page": "\u5217\u8868\u7684\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "x = ['a', 'b', 'c']", "y = x + [x[0]]", "print(y)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3356,19 +3173,14 @@ "step": "negative_index_concatenation_exercise" }, { - "get_solution": [ - "x = [1, 2, 0, 3]", - "x.pop(x.index(0))", - "print(x)" - ], - "page": "Functions and Methods for Lists", + "get_solution": "program", + "page": "\u5217\u8868\u7684\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "x = [1, 2, 0, 3]", "x.pop(x.index(0))", "print(x)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3380,12 +3192,12 @@ "step": "remove_exercise" }, { - "page": "More List Functions and Methods", + "get_solution": "program", + "page": "\u66f4\u591a\u5217\u8868\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "sorted([2, 9, 1, 8, 5, 6])" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "[1, 2, 5, 6, 8, 9]", @@ -3394,7 +3206,7 @@ "[1, 8, 6, 2, 5, 9]", "[1, 2, 5, 6, 8, 9]", "[2, 9, 1, 8, 5, 6]", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -3407,14 +3219,14 @@ "step": "sorted_predict_exercise" }, { - "page": "More List Functions and Methods", + "get_solution": "program", + "page": "\u66f4\u591a\u5217\u8868\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "nums = [2, 9, 1, 8, 5, 64]", "print(7 in nums)", "print(2 in nums)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "False\nTrue", @@ -3423,7 +3235,7 @@ "False\nTrue", "True\nTrue", "False\nFalse", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -3436,12 +3248,12 @@ "step": "in_predict_exercise" }, { - "page": "More List Functions and Methods", + "get_solution": "program", + "page": "\u66f4\u591a\u5217\u8868\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "sum([5, 3, 4])" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "12", @@ -3449,7 +3261,7 @@ "10", "12", "7", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -3462,12 +3274,12 @@ "step": "sum_predict_exercise" }, { - "page": "More List Functions and Methods", + "get_solution": "program", + "page": "\u66f4\u591a\u5217\u8868\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "[1, 2, 3, 2, 7, 2, 5].count(2)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "3", @@ -3476,7 +3288,7 @@ "1", "2", "3", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -3489,19 +3301,14 @@ "step": "count_predict_exercise" }, { - "get_solution": [ - "x = [1, 2, 0, 3]", - "y = x.count(1) > 0", - "print(y)" - ], - "page": "More List Functions and Methods", + "get_solution": "program", + "page": "\u66f4\u591a\u5217\u8868\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "x = [1, 2, 0, 3]", "y = x.count(1) > 0", "print(y)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3513,19 +3320,14 @@ "step": "count_in_sorted_sum" }, { - "get_solution": [ - "x = [15, 12, -6, 3]", - "y = sum(x) / len(x)", - "print(y)" - ], - "page": "More List Functions and Methods", + "get_solution": "program", + "page": "\u66f4\u591a\u5217\u8868\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "x = [15, 12, -6, 3]", "y = sum(x) / len(x)", "print(y)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3537,19 +3339,14 @@ "step": "average_exercise" }, { - "get_solution": [ - "x = 100", - "y = sum(range(x + 1))", - "print(y)" - ], - "page": "More List Functions and Methods", + "get_solution": "program", + "page": "\u66f4\u591a\u5217\u8868\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "x = 100", "y = sum(range(x + 1))", "print(y)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3561,19 +3358,14 @@ "step": "sum_range_exercise" }, { - "get_solution": [ - "x = [12, -6, 2, -1, 3]", - "y = sorted(x)[1]", - "print(y)" - ], - "page": "More List Functions and Methods", + "get_solution": "program", + "page": "\u66f4\u591a\u5217\u8868\u51fd\u6570\u548c\u65b9\u6cd5", "program": [ "x = [12, -6, 2, -1, 3]", "y = sorted(x)[1]", "print(y)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3585,12 +3377,12 @@ "step": "second_smallest_in_list_exercise" }, { - "page": "String Methods and Immutability", + "get_solution": "program", + "page": "\u5b57\u7b26\u4e32\u65b9\u6cd5\u4e0e\u4e0d\u53ef\u53d8\u6027", "program": [ "print('the' in 'feed the dog and the cat')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3602,14 +3394,14 @@ "step": "string_in_step" }, { - "page": "String Methods and Immutability", + "get_solution": "program", + "page": "\u5b57\u7b26\u4e32\u65b9\u6cd5\u4e0e\u4e0d\u53ef\u53d8\u6027", "program": [ "string = 'feed the dog and the cat'", "print(string.count('the'))", "print(string.index('the'))" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3621,12 +3413,12 @@ "step": "string_count_index" }, { - "page": "String Methods and Immutability", + "get_solution": "program", + "page": "\u5b57\u7b26\u4e32\u65b9\u6cd5\u4e0e\u4e0d\u53ef\u53d8\u6027", "program": [ "'Python'.append(' is cool!')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3639,11 +3431,13 @@ }, "frames": [ { + "filename": "/my_program.py", + "lineno": 1, "lines": [ { - "content": "'Python'.append(' is cool!')", "is_current": true, "lineno": 1, + "text": "'Python'.append(' is cool!')", "type": "line" } ], @@ -3658,7 +3452,7 @@ ], "text": [ "Traceback (most recent call last):", - " File \"my_program.py\", line 1, in ", + " File \"/my_program.py\", line 1, in ", "--> 1 | 'Python'.append(' is cool!')", " ^^^^^^^^^^^^^^^", "", @@ -3671,7 +3465,8 @@ "step": "mutation_string_append" }, { - "page": "String Methods and Immutability", + "get_solution": "program", + "page": "\u5b57\u7b26\u4e32\u65b9\u6cd5\u4e0e\u4e0d\u53ef\u53d8\u6027", "program": [ "sentence = \"Python rocks!\"", "new_sentence = sentence.upper()", @@ -3679,7 +3474,6 @@ "print(new_sentence)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3691,15 +3485,12 @@ "step": "string_lower_upper" }, { - "get_solution": [ - "max([21, 55, 4, 91, 62, 49])" - ], - "page": "How to Find Information with Google, and more", + "get_solution": "program", + "page": "\u5982\u4f55\u4f7f\u7528 Google \u67e5\u627e\u4fe1\u606f\uff0c\u4ee5\u53ca\u66f4\u591a", "program": [ "max([21, 55, 4, 91, 62, 49])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3711,19 +3502,14 @@ "step": "sum_list" }, { - "get_solution": [ - "nums = [1, 2, 3, 4, 5]", - "nums.insert(2, 9)", - "print(nums)" - ], - "page": "How to Find Information with Google, and more", + "get_solution": "program", + "page": "\u5982\u4f55\u4f7f\u7528 Google \u67e5\u627e\u4fe1\u606f\uff0c\u4ee5\u53ca\u66f4\u591a", "program": [ "nums = [1, 2, 3, 4, 5]", "nums.insert(2, 9)", "print(nums)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3735,16 +3521,16 @@ "step": "list_insert" }, { - "page": "How to Find Information with Google, and more", + "get_solution": "program", + "page": "\u5982\u4f55\u4f7f\u7528 Google \u67e5\u627e\u4fe1\u606f\uff0c\u4ee5\u53ca\u66f4\u591a", "program": [ "dir([])" ], "response": { - "message": "", "passed": true, "result": [ { - "text": "['__add__', '__class__', '__class_getitem__', '__contains__', '__delattr__', '__delitem__', '__dir__', '__doc__', '__eq__', '__format__', '__ge__', '__getattribute__', '__getitem__', '__gt__', '__hash__', '__iadd__', '__imul__', '__init__', '__init_subclass__', '__iter__', '__le__', '__len__', '__lt__', '__mul__', '__ne__', '__new__', '__reduce__', '__reduce_ex__', '__repr__', '__reversed__', '__rmul__', '__setattr__', '__setitem__', '__sizeof__', '__str__', '__subclasshook__', 'append', 'clear', 'copy', 'count', 'extend', 'index', 'insert', 'pop', 'remove', 'reverse', 'sort']\n", + "text": "['__add__', '__class__', '__class_getitem__', '__contains__', '__delattr__', '__delitem__', '__dir__', '__doc__', '__eq__', '__format__', '__ge__', '__getattribute__', '__getitem__', '__getstate__', '__gt__', '__hash__', '__iadd__', '__imul__', '__init__', '__init_subclass__', '__iter__', '__le__', '__len__', '__lt__', '__mul__', '__ne__', '__new__', '__reduce__', '__reduce_ex__', '__repr__', '__reversed__', '__rmul__', '__setattr__', '__setitem__', '__sizeof__', '__str__', '__subclasshook__', 'append', 'clear', 'copy', 'count', 'extend', 'index', 'insert', 'pop', 'remove', 'reverse', 'sort']\n", "type": "stdout" } ] @@ -3752,7 +3538,8 @@ "step": "dir_list" }, { - "page": "Understanding Programs With Python Tutor", + "get_solution": "program", + "page": "\u4f7f\u7528 Python Tutor \u7406\u89e3\u7a0b\u5e8f", "program": [ "all_numbers = [2, 4, 8, 1, 9, 7]", "", @@ -3769,7 +3556,6 @@ "print(big_numbers)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3781,7 +3567,8 @@ "step": "run_with_python_tutor" }, { - "page": "== vs is, and Having Multiple Names for One Value", + "get_solution": "program", + "page": "== \u4e0e is\uff0c\u4ee5\u53ca\u4e00\u4e2a\u503c\u7684\u591a\u4e2a\u540d\u79f0", "program": [ "list1 = [1, 2, 3]", "list2 = [1, 2, 3]", @@ -3798,7 +3585,6 @@ "print(list2)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3810,7 +3596,8 @@ "step": "two_separate_lists" }, { - "page": "== vs is, and Having Multiple Names for One Value", + "get_solution": "program", + "page": "== \u4e0e is\uff0c\u4ee5\u53ca\u4e00\u4e2a\u503c\u7684\u591a\u4e2a\u540d\u79f0", "program": [ "list1 = [1, 2, 3]", "list2 = list1", @@ -3827,7 +3614,6 @@ "print(list2)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3839,7 +3625,8 @@ "step": "same_list" }, { - "page": "Modifying While Iterating", + "get_solution": "program", + "page": "\u5728\u8fed\u4ee3\u65f6\u4fee\u6539", "program": [ "numbers = [10, 7, 8, 3, 12, 15]", "for i in range(len(numbers)):", @@ -3849,7 +3636,6 @@ "print(numbers)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3862,11 +3648,13 @@ }, "frames": [ { + "filename": "/my_program.py", + "lineno": 3, "lines": [ { - "content": "number = numbers[i]", "is_current": true, "lineno": 3, + "text": "number = numbers[i]", "type": "line" } ], @@ -3906,7 +3694,7 @@ ], "text": [ "Traceback (most recent call last):", - " File \"my_program.py\", line 3, in ", + " File \"/my_program.py\", line 3, in ", " 2 | for i in range(len(numbers)):", "--> 3 | number = numbers[i]", " ^^^^^^^^^^", @@ -3926,7 +3714,8 @@ "step": "run_broken_with_python_tutor" }, { - "page": "Modifying While Iterating", + "get_solution": "program", + "page": "\u5728\u8fed\u4ee3\u65f6\u4fee\u6539", "program": [ "numbers = [10, 7, 8, 3, 12, 15]", "for number in numbers:", @@ -3935,7 +3724,6 @@ "print(numbers)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3947,7 +3735,8 @@ "step": "remove_instead_of_pop" }, { - "page": "Modifying While Iterating", + "get_solution": "program", + "page": "\u5728\u8fed\u4ee3\u65f6\u4fee\u6539", "program": [ "numbers = [10, 7, 8, 3, 12, 15]", "for number in numbers.copy():", @@ -3956,7 +3745,6 @@ "print(numbers)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3968,7 +3756,8 @@ "step": "make_copy" }, { - "page": "Modifying While Iterating", + "get_solution": "program", + "page": "\u5728\u8fed\u4ee3\u65f6\u4fee\u6539", "program": [ "numbers = [10, 7, 8, 3, 12, 15]", "big_numbers = numbers.copy()", @@ -3979,7 +3768,6 @@ "print(big_numbers)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -3991,7 +3779,8 @@ "step": "make_copy2" }, { - "page": "Modifying While Iterating", + "get_solution": "program", + "page": "\u5728\u8fed\u4ee3\u65f6\u4fee\u6539", "program": [ "numbers = [10, 7, 8, 3, 12, 15]", "big_numbers = []", @@ -4002,7 +3791,6 @@ "print(big_numbers)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4014,16 +3802,17 @@ "step": "make_new_list" }, { - "page": "Single and Double Quotes in Strings", + "get_solution": "program", + "page": "\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u5f15\u53f7\u548c\u53cc\u5f15\u53f7", "program": [ "print('Alice's Diner')" ], "response": { - "message": "", "passed": true, "result": [ { - "text": " print('Alice's Diner')\n ^\nSyntaxError: invalid syntax\nat line 1\n\nA `SyntaxError` occurs when Python cannot understand your code.\n\nI suspect that you were trying to use a quote character inside a string\nthat was enclosed in quotes of the same kind.\nPerhaps you should have escaped the inner quote character:\n\n print('Alice\\'s Diner')\n ^^\n\n\n", + "friendly": "

    A SyntaxError occurs when Python cannot understand your code.

    \n

    You started writing a string with a single or double quote\nbut never ended the string with another quote on that line.

    ", + "text": " print('Alice's Diner')\n ^\nSyntaxError: unterminated string literal (detected at line 1)\n\u5728\u7b2c 1\n", "type": "syntax_error" } ] @@ -4031,12 +3820,12 @@ "step": "single_quotes_apostrophe" }, { - "page": "Single and Double Quotes in Strings", + "get_solution": "program", + "page": "\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u5f15\u53f7\u548c\u53cc\u5f15\u53f7", "program": [ "print(\"Alice's Diner\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4048,19 +3837,19 @@ "step": "double_quotes" }, { - "page": "Single and Double Quotes in Strings", + "get_solution": "program", + "page": "\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u5f15\u53f7\u548c\u53cc\u5f15\u53f7", "program": [ "'Alice' == \"Alice\"" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "True", "choices": [ "True", "False", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -4073,15 +3862,12 @@ "step": "single_double_quotes_equal" }, { - "get_solution": [ - "print(\"Special cases aren't special enough to break the rules.\")" - ], - "page": "Single and Double Quotes in Strings", + "get_solution": "program", + "page": "\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u5f15\u53f7\u548c\u53cc\u5f15\u53f7", "program": [ "print(\"Special cases aren't special enough to break the rules.\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4093,15 +3879,12 @@ "step": "double_quote_exercise" }, { - "get_solution": [ - "print('\"Talk is cheap. Show me the code.\" - Linus Torvalds')" - ], - "page": "Single and Double Quotes in Strings", + "get_solution": "program", + "page": "\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u5f15\u53f7\u548c\u53cc\u5f15\u53f7", "program": [ "print('\"Talk is cheap. Show me the code.\" - Linus Torvalds')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4113,6 +3896,7 @@ "step": "single_quote_exercise" }, { + "get_solution": "program", "page": "f-strings", "program": [ "name = \"Alice\"", @@ -4121,7 +3905,6 @@ "print(f\"{name} went to {meal} with {friend}.\")" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Alice went to lunch with Bob.", @@ -4135,7 +3918,7 @@ "'Alice' went to 'lunch' with 'Bob'.", "\"Alice went to lunch with Bob.\"", "Alice went to lunch with Bob.", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -4148,6 +3931,7 @@ "step": "introduce_f_strings" }, { + "get_solution": "program", "page": "f-strings", "program": [ "name = \"Alice\"", @@ -4155,16 +3939,15 @@ "print(\"Hello \" + name + \". You are \" + age + \" years old.\")" ], "response": { - "message": "", "passed": true, "prediction": { - "answer": "Error", + "answer": "\u9519\u8bef", "choices": [ "\"Hello \" + name + \". You are \" + age + \" years old.\"", "Hello name. You are age years old.", "Hello Alice. You are 20 years old.", "Hello 'Alice'. You are 20 years old.", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -4178,11 +3961,13 @@ }, "frames": [ { + "filename": "/my_program.py", + "lineno": 3, "lines": [ { - "content": "print("Hello " + name + ". You are " + age + " years old.")", "is_current": true, "lineno": 3, + "text": "print("Hello " + name + ". You are " + age + " years old.")", "type": "line" } ], @@ -4214,7 +3999,7 @@ ], "text": [ "Traceback (most recent call last):", - " File \"my_program.py\", line 3, in ", + " File \"/my_program.py\", line 3, in ", " 2 | age = 20", "--> 3 | print(\"Hello \" + name + \". You are \" + age + \" years old.\")", " ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^", @@ -4232,11 +4017,7 @@ "step": "concatenate_string_number" }, { - "get_solution": [ - "name = \"Alice\"", - "age = 20", - "print(f'Hello {name}. You are {age} years old.')" - ], + "get_solution": "program", "page": "f-strings", "program": [ "name = \"Alice\"", @@ -4244,7 +4025,6 @@ "print(f'Hello {name}. You are {age} years old.')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4256,12 +4036,12 @@ "step": "basic_f_string_exercise" }, { + "get_solution": "program", "page": "f-strings", "program": [ "f\"2 * 3 + 4 is equal to {2 * 3 + 4}\"" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4278,15 +4058,14 @@ ], "page": "f-strings", "program": [ - "people = ['eODoUwNzS', 'ofHBEzZxs', 'zwTrQA', 'LDaOKmpHU', 'HCMLTt', 'NbRmEjaoyD']", + "people = ['Alice', 'Bob', 'Charlie']", "print(f\"There are {len(people)} people waiting, the first one's name is {people[0]}.\")" ], "response": { - "message": "", "passed": true, "result": [ { - "text": "There are 6 people waiting, the first one's name is eODoUwNzS.\n", + "text": "There are 3 people waiting, the first one's name is Alice.\n", "type": "stdout" } ] @@ -4294,7 +4073,8 @@ "step": "fix_broken_program" }, { - "page": "Introducing Nested Loops", + "get_solution": "program", + "page": "\u4ecb\u7ecd\u5d4c\u5957\u5faa\u73af", "program": [ "for letter in \"ABC\":", " print(letter)", @@ -4303,7 +4083,6 @@ " print('---')" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "A\nA 0\nA 1\nA 2\nA 3\n---\nB\nB 0\nB 1\nB 2\nB 3\n---\nC\nC 0\nC 1\nC 2\nC 3\n---", @@ -4312,7 +4091,7 @@ "A\nA 0\nA 1\nA 2\nA 3\n---\nB\nB 0\nB 1\nB 2\nB 3\n---\nC\nC 0\nC 1\nC 2\nC 3\n---", "A 1\nA 2\nA 3\nA 4\n---\nB 1\nB 2\nB 3\nB 4\n---\nC 1\nC 2\nC 3\nC 4\n---", "A\nB\nC\n---\nA 0\nB 0\nC 0\n---\nA 1\nB 1\nC 1\n---\nA 2\nB 2\nC 2\n---\nA 3\nB 3\nC 3", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -4325,12 +4104,12 @@ "step": "first_nested_loop" }, { - "page": "Introducing Nested Loops", + "page": "\u4ecb\u7ecd\u5d4c\u5957\u5faa\u73af", "program": [ "print(1 + \"x\")" ], "response": { - "message": "

    You can't add together strings and numbers. Use an f-string.

    ", + "message": "

    \u4f60\u4e0d\u80fd\u5c06\u5b57\u7b26\u4e32\u548c\u6570\u5b57\u76f8\u52a0\u3002\u4f7f\u7528 f-string\u3002

    ", "passed": false, "result": [ { @@ -4343,11 +4122,13 @@ }, "frames": [ { + "filename": "/my_program.py", + "lineno": 1, "lines": [ { - "content": "print(1 + "x")", "is_current": true, "lineno": 1, + "text": "print(1 + "x")", "type": "line" } ], @@ -4362,7 +4143,7 @@ ], "text": [ "Traceback (most recent call last):", - " File \"my_program.py\", line 1, in ", + " File \"/my_program.py\", line 1, in ", "--> 1 | print(1 + \"x\")", " ^^^^^^^", "", @@ -4375,25 +4156,25 @@ "step": "times_table_exercise" }, { - "page": "Introducing Nested Loops", + "page": "\u4ecb\u7ecd\u5d4c\u5957\u5faa\u73af", "program": [ "for left in range(12):", " for right in range(12):", " left += 1", " right += 1", " print(f'{left} x {right} = {left * right}')", - " print('----------')" + " print('---')" ], "response": { - "message": "

    You added 1 to your outer loop variable at the wrong place!\nWhere should you do that instead to fix it?

    ", + "message": "

    \u4f60\u5728\u9519\u8bef\u7684\u5730\u65b9\u5c06 1 \u52a0\u5230\u4e86\u5916\u90e8\u5faa\u73af\u53d8\u91cf\u4e0a\uff01\n\u4f60\u5e94\u8be5\u5728\u54ea\u91cc\u505a\u8fd9\u4e2a\u4ee5\u4fee\u590d\u5b83\uff1f

    ", "passed": false, "result": [ { - "text": "1 x 1 = 1\n2 x 2 = 4\n3 x 3 = 9\n4 x 4 = 16\n5 x 5 = 25\n6 x 6 = 36\n7 x 7 = 49\n8 x 8 = 64\n9 x 9 = 81\n10 x 10 = 100\n11 x 11 = 121\n12 x 12 = 144\n----------\n2 x 1 = 2\n3 x 2 = 6\n4 x 3 = 12\n5 x 4 = 20\n6 x 5 = 30\n7 x 6 = 42\n8 x 7 = 56\n9 x 8 = 72\n10 x 9 = 90\n11 x 10 = 110\n12 x 11 = 132\n13 x 12 = 156\n----------\n3 x 1 = 3\n4 x 2 = 8\n5 x 3 = 15\n6 x 4 = 24\n7 x 5 = 35\n8 x 6 = 48\n9 x 7 = 63\n10 x 8 = 80\n11 x 9 = 99\n12 x 10 = 120\n13 x 11 = 143\n14 x 12 = 168\n----------\n4 x 1 = 4\n5 x 2 = 10\n6 x 3 = 18\n7 x 4 = 28\n8 x 5 = 40\n9 x 6 = 54\n10 x 7 = 70\n11 x 8 = 88\n12 x 9 = 108\n13 x 10 = 130\n14 x 11 = 154\n15 x 12 = 180\n----------\n5 x 1 = 5\n6 x 2 = 12\n7 x 3 = 21\n8 x 4 = 32\n9 x 5 = 45\n10 x 6 = 60\n11 x 7 = 77\n12 x 8 = 96\n13 x 9 = 117\n14 x 10 = 140\n15 x 11 = 165\n16 x 12 = 192\n----------\n6 x 1 = 6\n7 x 2 = 14\n8 x 3 = 24\n9 x 4 = 36\n10 x 5 = 50\n11 x 6 = 66\n12 x 7 = 84\n13 x 8 = 104\n14 x 9 = 126\n15 x 10 = 150\n16 x 11 = 176\n17 x 12 = 204\n----------\n7 x 1 = 7\n8 x 2 = 16\n9 x 3 = 27\n10 x 4 = 40\n11 x 5 = 55\n12 x 6 = 72\n13 x 7 = 91", + "text": "1 x 1 = 1\n2 x 2 = 4\n3 x 3 = 9\n4 x 4 = 16\n5 x 5 = 25\n6 x 6 = 36\n7 x 7 = 49\n8 x 8 = 64\n9 x 9 = 81\n10 x 10 = 100\n11 x 11 = 121\n12 x 12 = 144\n---\n2 x 1 = 2\n3 x 2 = 6\n4 x 3 = 12\n5 x 4 = 20\n6 x 5 = 30\n7 x 6 = 42\n8 x 7 = 56\n9 x 8 = 72\n10 x 9 = 90\n11 x 10 = 110\n12 x 11 = 132\n13 x 12 = 156\n---\n3 x 1 = 3\n4 x 2 = 8\n5 x 3 = 15\n6 x 4 = 24\n7 x 5 = 35\n8 x 6 = 48\n9 x 7 = 63\n10 x 8 = 80\n11 x 9 = 99\n12 x 10 = 120\n13 x 11 = 143\n14 x 12 = 168\n---\n4 x 1 = 4\n5 x 2 = 10\n6 x 3 = 18\n7 x 4 = 28\n8 x 5 = 40\n9 x 6 = 54\n10 x 7 = 70\n11 x 8 = 88\n12 x 9 = 108\n13 x 10 = 130\n14 x 11 = 154\n15 x 12 = 180\n---\n5 x 1 = 5\n6 x 2 = 12\n7 x 3 = 21\n8 x 4 = 32\n9 x 5 = 45\n10 x 6 = 60\n11 x 7 = 77\n12 x 8 = 96\n13 x 9 = 117\n14 x 10 = 140\n15 x 11 = 165\n16 x 12 = 192\n---\n6 x 1 = 6\n7 x 2 = 14\n8 x 3 = 24\n9 x 4 = 36\n10 x 5 = 50\n11 x 6 = 66\n12 x 7 = 84\n13 x 8 = 104\n14 x 9 = 126\n15 x 10 = 150\n16 x 11 = 176\n17 x 12 = 204\n---\n7 x 1 = 7\n8 x 2 = 16\n9 x 3 = 27\n10 x 4 = 40\n11 x 5 = 55\n12 x 6 = 72\n13 x 7 = 91\n14 x 8 = 112\n15 x 9 = 135\n16 x 10 = 160\n17 x 11 = 187", "type": "stdout" }, { - "text": "\n14 x 8 = 112\n15 x 9 = 135\n16 x 10 = 160\n17 x 11 = 187\n18 x 12 = 216\n----------\n8 x 1 = 8\n9 x 2 = 18\n10 x 3 = 30\n11 x 4 = 44\n12 x 5 = 60\n13 x 6 = 78\n14 x 7 = 98\n15 x 8 = 120\n16 x 9 = 144\n17 x 10 = 170\n18 x 11 = 198\n19 x 12 = 228\n----------\n9 x 1 = 9\n10 x 2 = 20\n11 x 3 = 33\n12 x 4 = 48\n13 x 5 = 65\n14 x 6 = 84\n15 x 7 = 105\n16 x 8 = 128\n17 x 9 = 153\n18 x 10 = 180\n19 x 11 = 209\n20 x 12 = 240\n----------\n10 x 1 = 10\n11 x 2 = 22\n12 x 3 = 36\n13 x 4 = 52\n14 x 5 = 70\n15 x 6 = 90\n16 x 7 = 112\n17 x 8 = 136\n18 x 9 = 162\n19 x 10 = 190\n20 x 11 = 220\n21 x 12 = 252\n----------\n11 x 1 = 11\n12 x 2 = 24\n13 x 3 = 39\n14 x 4 = 56\n15 x 5 = 75\n16 x 6 = 96\n17 x 7 = 119\n18 x 8 = 144\n19 x 9 = 171\n20 x 10 = 200\n21 x 11 = 231\n22 x 12 = 264\n----------\n12 x 1 = 12\n13 x 2 = 26\n14 x 3 = 42\n15 x 4 = 60\n16 x 5 = 80\n17 x 6 = 102\n18 x 7 = 126\n19 x 8 = 152\n20 x 9 = 180\n21 x 10 = 210\n22 x 11 = 242\n23 x 12 = 276\n----------\n", + "text": "\n18 x 12 = 216\n---\n8 x 1 = 8\n9 x 2 = 18\n10 x 3 = 30\n11 x 4 = 44\n12 x 5 = 60\n13 x 6 = 78\n14 x 7 = 98\n15 x 8 = 120\n16 x 9 = 144\n17 x 10 = 170\n18 x 11 = 198\n19 x 12 = 228\n---\n9 x 1 = 9\n10 x 2 = 20\n11 x 3 = 33\n12 x 4 = 48\n13 x 5 = 65\n14 x 6 = 84\n15 x 7 = 105\n16 x 8 = 128\n17 x 9 = 153\n18 x 10 = 180\n19 x 11 = 209\n20 x 12 = 240\n---\n10 x 1 = 10\n11 x 2 = 22\n12 x 3 = 36\n13 x 4 = 52\n14 x 5 = 70\n15 x 6 = 90\n16 x 7 = 112\n17 x 8 = 136\n18 x 9 = 162\n19 x 10 = 190\n20 x 11 = 220\n21 x 12 = 252\n---\n11 x 1 = 11\n12 x 2 = 24\n13 x 3 = 39\n14 x 4 = 56\n15 x 5 = 75\n16 x 6 = 96\n17 x 7 = 119\n18 x 8 = 144\n19 x 9 = 171\n20 x 10 = 200\n21 x 11 = 231\n22 x 12 = 264\n---\n12 x 1 = 12\n13 x 2 = 26\n14 x 3 = 42\n15 x 4 = 60\n16 x 5 = 80\n17 x 6 = 102\n18 x 7 = 126\n19 x 8 = 152\n20 x 9 = 180\n21 x 10 = 210\n22 x 11 = 242\n23 x 12 = 276\n---\n", "type": "stdout" } ] @@ -4401,7 +4182,7 @@ "step": "times_table_exercise" }, { - "page": "Introducing Nested Loops", + "page": "\u4ecb\u7ecd\u5d4c\u5957\u5faa\u73af", "program": [ "for left in range(12):", " left += 1", @@ -4417,18 +4198,18 @@ " print(left, 'x 10 =', left * 10)", " print(left, 'x 11 =', left * 11)", " print(left, 'x 12 =', left * 12)", - " print('----------')" + " print('---')" ], "response": { - "message": "

    Your solution is too long. You only need a few lines of code for this problem.\nUse a nested loop so that you don't need to repeat yourself.\nThe computer will do the repetition for you!

    ", + "message": "

    \u4f60\u7684\u89e3\u51b3\u65b9\u6848\u592a\u957f\u4e86\u3002\u5bf9\u4e8e\u8fd9\u4e2a\u95ee\u9898\uff0c\u4f60\u53ea\u9700\u8981\u51e0\u884c\u4ee3\u7801\u3002\n\u4f7f\u7528\u5d4c\u5957\u5faa\u73af\uff0c\u8fd9\u6837\u4f60\u5c31\u4e0d\u9700\u8981\u91cd\u590d\u81ea\u5df1\u3002\n\u8ba1\u7b97\u673a\u4f1a\u4e3a\u4f60\u5b8c\u6210\u91cd\u590d\u7684\u5de5\u4f5c\uff01

    ", "passed": false, "result": [ { - "text": "1 x 1 = 1\n1 x 2 = 2\n1 x 3 = 3\n1 x 4 = 4\n1 x 5 = 5\n1 x 6 = 6\n1 x 7 = 7\n1 x 8 = 8\n1 x 9 = 9\n1 x 10 = 10\n1 x 11 = 11\n1 x 12 = 12\n----------\n2 x 1 = 2\n2 x 2 = 4\n2 x 3 = 6\n2 x 4 = 8\n2 x 5 = 10\n2 x 6 = 12\n2 x 7 = 14\n2 x 8 = 16\n2 x 9 = 18\n2 x 10 = 20\n2 x 11 = 22\n2 x 12 = 24\n----------\n3 x 1 = 3\n3 x 2 = 6\n3 x 3 = 9\n3 x 4 = 12\n3 x 5 = 15\n3 x 6 = 18\n3 x 7 = 21\n3 x 8 = 24\n3 x 9 = 27\n3 x 10 = 30\n3 x 11 = 33\n3 x 12 = 36\n----------\n4 x 1 = 4\n4 x 2 = 8\n4 x 3 = 12\n4 x 4 = 16\n4 x 5 = 20\n4 x 6 = 24\n4 x 7 = 28\n4 x 8 = 32\n4 x 9 = 36\n4 x 10 = 40\n4 x 11 = 44\n4 x 12 = 48\n----------\n5 x 1 = 5\n5 x 2 = 10\n5 x 3 = 15\n5 x 4 = 20\n5 x 5 = 25\n5 x 6 = 30\n5 x 7 = 35\n5 x 8 = 40\n5 x 9 = 45\n5 x 10 = 50\n5 x 11 = 55\n5 x 12 = 60\n----------\n6 x 1 = 6\n6 x 2 = 12\n6 x 3 = 18\n6 x 4 = 24\n6 x 5 = 30\n6 x 6 = 36\n6 x 7 = 42\n6 x 8 = 48\n6 x 9 = 54\n6 x 10 = 60\n6 x 11 = 66\n6 x 12 = 72\n----------\n7 x 1 = 7\n7 x 2 = 14\n7 x 3 = 21\n7 x 4 = 28\n7 x 5 = 35\n7 x 6 = 42\n7 x 7 = 49\n7 x 8 = 56\n7 x 9 = 63\n7 x 10 = 70\n7 x 11 = 77\n7 x 12 = 84\n----------", + "text": "1 x 1 = 1\n1 x 2 = 2\n1 x 3 = 3\n1 x 4 = 4\n1 x 5 = 5\n1 x 6 = 6\n1 x 7 = 7\n1 x 8 = 8\n1 x 9 = 9\n1 x 10 = 10\n1 x 11 = 11\n1 x 12 = 12\n---\n2 x 1 = 2\n2 x 2 = 4\n2 x 3 = 6\n2 x 4 = 8\n2 x 5 = 10\n2 x 6 = 12\n2 x 7 = 14\n2 x 8 = 16\n2 x 9 = 18\n2 x 10 = 20\n2 x 11 = 22\n2 x 12 = 24\n---\n3 x 1 = 3\n3 x 2 = 6\n3 x 3 = 9\n3 x 4 = 12\n3 x 5 = 15\n3 x 6 = 18\n3 x 7 = 21\n3 x 8 = 24\n3 x 9 = 27\n3 x 10 = 30\n3 x 11 = 33\n3 x 12 = 36\n---\n4 x 1 = 4\n4 x 2 = 8\n4 x 3 = 12\n4 x 4 = 16\n4 x 5 = 20\n4 x 6 = 24\n4 x 7 = 28\n4 x 8 = 32\n4 x 9 = 36\n4 x 10 = 40\n4 x 11 = 44\n4 x 12 = 48\n---\n5 x 1 = 5\n5 x 2 = 10\n5 x 3 = 15\n5 x 4 = 20\n5 x 5 = 25\n5 x 6 = 30\n5 x 7 = 35\n5 x 8 = 40\n5 x 9 = 45\n5 x 10 = 50\n5 x 11 = 55\n5 x 12 = 60\n---\n6 x 1 = 6\n6 x 2 = 12\n6 x 3 = 18\n6 x 4 = 24\n6 x 5 = 30\n6 x 6 = 36\n6 x 7 = 42\n6 x 8 = 48\n6 x 9 = 54\n6 x 10 = 60\n6 x 11 = 66\n6 x 12 = 72\n---\n7 x 1 = 7\n7 x 2 = 14\n7 x 3 = 21\n7 x 4 = 28\n7 x 5 = 35\n7 x 6 = 42\n7 x 7 = 49\n7 x 8 = 56\n7 x 9 = 63\n7 x 10 = 70\n7 x 11 = 77\n7 x 12 = 84\n---\n8 x 1 = 8\n8 x 2 = 16\n8 x 3 = 24\n8 x 4 = 32\n8 x 5 =", "type": "stdout" }, { - "text": "\n8 x 1 = 8\n8 x 2 = 16\n8 x 3 = 24\n8 x 4 = 32\n8 x 5 = 40\n8 x 6 = 48\n8 x 7 = 56\n8 x 8 = 64\n8 x 9 = 72\n8 x 10 = 80\n8 x 11 = 88\n8 x 12 = 96\n----------\n9 x 1 = 9\n9 x 2 = 18\n9 x 3 = 27\n9 x 4 = 36\n9 x 5 = 45\n9 x 6 = 54\n9 x 7 = 63\n9 x 8 = 72\n9 x 9 = 81\n9 x 10 = 90\n9 x 11 = 99\n9 x 12 = 108\n----------\n10 x 1 = 10\n10 x 2 = 20\n10 x 3 = 30\n10 x 4 = 40\n10 x 5 = 50\n10 x 6 = 60\n10 x 7 = 70\n10 x 8 = 80\n10 x 9 = 90\n10 x 10 = 100\n10 x 11 = 110\n10 x 12 = 120\n----------\n11 x 1 = 11\n11 x 2 = 22\n11 x 3 = 33\n11 x 4 = 44\n11 x 5 = 55\n11 x 6 = 66\n11 x 7 = 77\n11 x 8 = 88\n11 x 9 = 99\n11 x 10 = 110\n11 x 11 = 121\n11 x 12 = 132\n----------\n12 x 1 = 12\n12 x 2 = 24\n12 x 3 = 36\n12 x 4 = 48\n12 x 5 = 60\n12 x 6 = 72\n12 x 7 = 84\n12 x 8 = 96\n12 x 9 = 108\n12 x 10 = 120\n12 x 11 = 132\n12 x 12 = 144\n----------\n", + "text": " 40\n8 x 6 = 48\n8 x 7 = 56\n8 x 8 = 64\n8 x 9 = 72\n8 x 10 = 80\n8 x 11 = 88\n8 x 12 = 96\n---\n9 x 1 = 9\n9 x 2 = 18\n9 x 3 = 27\n9 x 4 = 36\n9 x 5 = 45\n9 x 6 = 54\n9 x 7 = 63\n9 x 8 = 72\n9 x 9 = 81\n9 x 10 = 90\n9 x 11 = 99\n9 x 12 = 108\n---\n10 x 1 = 10\n10 x 2 = 20\n10 x 3 = 30\n10 x 4 = 40\n10 x 5 = 50\n10 x 6 = 60\n10 x 7 = 70\n10 x 8 = 80\n10 x 9 = 90\n10 x 10 = 100\n10 x 11 = 110\n10 x 12 = 120\n---\n11 x 1 = 11\n11 x 2 = 22\n11 x 3 = 33\n11 x 4 = 44\n11 x 5 = 55\n11 x 6 = 66\n11 x 7 = 77\n11 x 8 = 88\n11 x 9 = 99\n11 x 10 = 110\n11 x 11 = 121\n11 x 12 = 132\n---\n12 x 1 = 12\n12 x 2 = 24\n12 x 3 = 36\n12 x 4 = 48\n12 x 5 = 60\n12 x 6 = 72\n12 x 7 = 84\n12 x 8 = 96\n12 x 9 = 108\n12 x 10 = 120\n12 x 11 = 132\n12 x 12 = 144\n---\n", "type": "stdout" } ] @@ -4436,7 +4217,7 @@ "step": "times_table_exercise" }, { - "page": "Introducing Nested Loops", + "page": "\u4ecb\u7ecd\u5d4c\u5957\u5faa\u73af", "program": [ "for left in range(12):", " left += 1", @@ -4444,18 +4225,18 @@ " right += 1", " # for the sake of translation", " print(f'{left} x {right} = {left * right}'.replace('x', '*'))", - " print('----------')" + " print('---')" ], "response": { - "message": "

    That's almost correct! Make sure to display the right character x in your table.\nFor example, your solution should display 3 x 4 = 12 and not 3 * 4 = 12.

    ", + "message": "

    \u8fd9\u51e0\u4e4e\u662f\u6b63\u786e\u7684\uff01\u786e\u4fdd\u5728\u4f60\u7684\u8868\u4e2d\u663e\u793a\u6b63\u786e\u7684\u5b57\u7b26 x\u3002\n\u4f8b\u5982\uff0c\u4f60\u7684\u89e3\u51b3\u65b9\u6848\u5e94\u8be5\u663e\u793a 3 x 4 = 12 \u800c\u4e0d\u662f 3 * 4 = 12\u3002

    ", "passed": false, "result": [ { - "text": "1 * 1 = 1\n1 * 2 = 2\n1 * 3 = 3\n1 * 4 = 4\n1 * 5 = 5\n1 * 6 = 6\n1 * 7 = 7\n1 * 8 = 8\n1 * 9 = 9\n1 * 10 = 10\n1 * 11 = 11\n1 * 12 = 12\n----------\n2 * 1 = 2\n2 * 2 = 4\n2 * 3 = 6\n2 * 4 = 8\n2 * 5 = 10\n2 * 6 = 12\n2 * 7 = 14\n2 * 8 = 16\n2 * 9 = 18\n2 * 10 = 20\n2 * 11 = 22\n2 * 12 = 24\n----------\n3 * 1 = 3\n3 * 2 = 6\n3 * 3 = 9\n3 * 4 = 12\n3 * 5 = 15\n3 * 6 = 18\n3 * 7 = 21\n3 * 8 = 24\n3 * 9 = 27\n3 * 10 = 30\n3 * 11 = 33\n3 * 12 = 36\n----------\n4 * 1 = 4\n4 * 2 = 8\n4 * 3 = 12\n4 * 4 = 16\n4 * 5 = 20\n4 * 6 = 24\n4 * 7 = 28\n4 * 8 = 32\n4 * 9 = 36\n4 * 10 = 40\n4 * 11 = 44\n4 * 12 = 48\n----------\n5 * 1 = 5\n5 * 2 = 10\n5 * 3 = 15\n5 * 4 = 20\n5 * 5 = 25\n5 * 6 = 30\n5 * 7 = 35\n5 * 8 = 40\n5 * 9 = 45\n5 * 10 = 50\n5 * 11 = 55\n5 * 12 = 60\n----------\n6 * 1 = 6\n6 * 2 = 12\n6 * 3 = 18\n6 * 4 = 24\n6 * 5 = 30\n6 * 6 = 36\n6 * 7 = 42\n6 * 8 = 48\n6 * 9 = 54\n6 * 10 = 60\n6 * 11 = 66\n6 * 12 = 72\n----------\n7 * 1 = 7\n7 * 2 = 14\n7 * 3 = 21\n7 * 4 = 28\n7 * 5 = 35\n7 * 6 = 42\n7 * 7 = 49\n7 * 8 = 56\n7 * 9 = 63\n7 * 10 = 70\n7 * 11 = 77\n7 * 12 = 84\n----------", + "text": "1 * 1 = 1\n1 * 2 = 2\n1 * 3 = 3\n1 * 4 = 4\n1 * 5 = 5\n1 * 6 = 6\n1 * 7 = 7\n1 * 8 = 8\n1 * 9 = 9\n1 * 10 = 10\n1 * 11 = 11\n1 * 12 = 12\n---\n2 * 1 = 2\n2 * 2 = 4\n2 * 3 = 6\n2 * 4 = 8\n2 * 5 = 10\n2 * 6 = 12\n2 * 7 = 14\n2 * 8 = 16\n2 * 9 = 18\n2 * 10 = 20\n2 * 11 = 22\n2 * 12 = 24\n---\n3 * 1 = 3\n3 * 2 = 6\n3 * 3 = 9\n3 * 4 = 12\n3 * 5 = 15\n3 * 6 = 18\n3 * 7 = 21\n3 * 8 = 24\n3 * 9 = 27\n3 * 10 = 30\n3 * 11 = 33\n3 * 12 = 36\n---\n4 * 1 = 4\n4 * 2 = 8\n4 * 3 = 12\n4 * 4 = 16\n4 * 5 = 20\n4 * 6 = 24\n4 * 7 = 28\n4 * 8 = 32\n4 * 9 = 36\n4 * 10 = 40\n4 * 11 = 44\n4 * 12 = 48\n---\n5 * 1 = 5\n5 * 2 = 10\n5 * 3 = 15\n5 * 4 = 20\n5 * 5 = 25\n5 * 6 = 30\n5 * 7 = 35\n5 * 8 = 40\n5 * 9 = 45\n5 * 10 = 50\n5 * 11 = 55\n5 * 12 = 60\n---\n6 * 1 = 6\n6 * 2 = 12\n6 * 3 = 18\n6 * 4 = 24\n6 * 5 = 30\n6 * 6 = 36\n6 * 7 = 42\n6 * 8 = 48\n6 * 9 = 54\n6 * 10 = 60\n6 * 11 = 66\n6 * 12 = 72\n---\n7 * 1 = 7\n7 * 2 = 14\n7 * 3 = 21\n7 * 4 = 28\n7 * 5 = 35\n7 * 6 = 42\n7 * 7 = 49\n7 * 8 = 56\n7 * 9 = 63\n7 * 10 = 70\n7 * 11 = 77\n7 * 12 = 84\n---\n8 * 1 = 8\n8 * 2 = 16\n8 * 3 = 24\n8 * 4 = 32\n8 * 5 = 40", "type": "stdout" }, { - "text": "\n8 * 1 = 8\n8 * 2 = 16\n8 * 3 = 24\n8 * 4 = 32\n8 * 5 = 40\n8 * 6 = 48\n8 * 7 = 56\n8 * 8 = 64\n8 * 9 = 72\n8 * 10 = 80\n8 * 11 = 88\n8 * 12 = 96\n----------\n9 * 1 = 9\n9 * 2 = 18\n9 * 3 = 27\n9 * 4 = 36\n9 * 5 = 45\n9 * 6 = 54\n9 * 7 = 63\n9 * 8 = 72\n9 * 9 = 81\n9 * 10 = 90\n9 * 11 = 99\n9 * 12 = 108\n----------\n10 * 1 = 10\n10 * 2 = 20\n10 * 3 = 30\n10 * 4 = 40\n10 * 5 = 50\n10 * 6 = 60\n10 * 7 = 70\n10 * 8 = 80\n10 * 9 = 90\n10 * 10 = 100\n10 * 11 = 110\n10 * 12 = 120\n----------\n11 * 1 = 11\n11 * 2 = 22\n11 * 3 = 33\n11 * 4 = 44\n11 * 5 = 55\n11 * 6 = 66\n11 * 7 = 77\n11 * 8 = 88\n11 * 9 = 99\n11 * 10 = 110\n11 * 11 = 121\n11 * 12 = 132\n----------\n12 * 1 = 12\n12 * 2 = 24\n12 * 3 = 36\n12 * 4 = 48\n12 * 5 = 60\n12 * 6 = 72\n12 * 7 = 84\n12 * 8 = 96\n12 * 9 = 108\n12 * 10 = 120\n12 * 11 = 132\n12 * 12 = 144\n----------\n", + "text": "\n8 * 6 = 48\n8 * 7 = 56\n8 * 8 = 64\n8 * 9 = 72\n8 * 10 = 80\n8 * 11 = 88\n8 * 12 = 96\n---\n9 * 1 = 9\n9 * 2 = 18\n9 * 3 = 27\n9 * 4 = 36\n9 * 5 = 45\n9 * 6 = 54\n9 * 7 = 63\n9 * 8 = 72\n9 * 9 = 81\n9 * 10 = 90\n9 * 11 = 99\n9 * 12 = 108\n---\n10 * 1 = 10\n10 * 2 = 20\n10 * 3 = 30\n10 * 4 = 40\n10 * 5 = 50\n10 * 6 = 60\n10 * 7 = 70\n10 * 8 = 80\n10 * 9 = 90\n10 * 10 = 100\n10 * 11 = 110\n10 * 12 = 120\n---\n11 * 1 = 11\n11 * 2 = 22\n11 * 3 = 33\n11 * 4 = 44\n11 * 5 = 55\n11 * 6 = 66\n11 * 7 = 77\n11 * 8 = 88\n11 * 9 = 99\n11 * 10 = 110\n11 * 11 = 121\n11 * 12 = 132\n---\n12 * 1 = 12\n12 * 2 = 24\n12 * 3 = 36\n12 * 4 = 48\n12 * 5 = 60\n12 * 6 = 72\n12 * 7 = 84\n12 * 8 = 96\n12 * 9 = 108\n12 * 10 = 120\n12 * 11 = 132\n12 * 12 = 144\n---\n", "type": "stdout" } ] @@ -4463,17 +4244,18 @@ "step": "times_table_exercise" }, { - "page": "Introducing Nested Loops", + "page": "\u4ecb\u7ecd\u5d4c\u5957\u5faa\u73af", "program": [ "pass", "3 x 4" ], "response": { - "message": "

    To multiply numbers, use *

    ", + "message": "

    \u8981\u4e58\u6570\u5b57\uff0c\u4f7f\u7528 *

    ", "passed": false, "result": [ { - "text": " 3 x 4\n ^\nSyntaxError: invalid syntax\nat line 2\n\nA `SyntaxError` occurs when Python cannot understand your code.\n\nCurrently, I cannot guess the likely cause of this error.\nTry to examine closely the line indicated as well as the line\nimmediately above to see if you can identify some misspelled\nword, or missing symbols, like (, ), [, ], :, etc.\n\nUnless your code uses type annotations, which are beyond our scope,\nif you think that this is something which should be handled\nby friendly, please report this case to\nhttps://github.com/aroberge/friendly/issues\n\n\n\n", + "friendly": "

    A SyntaxError occurs when Python cannot understand your code.

    \n

    Currently, I cannot guess the likely cause of this error.\nTry to examine closely the line indicated as well as the line\nimmediately above to see if you can identify some misspelled\nword, or missing symbols, like (, ), [, ], :, etc.

    \n

    Unless your code uses type annotations, which are beyond our scope,\nif you think that this is something which should be handled\nby friendly, please report this case to\nhttps://github.com/friendly-traceback/friendly-traceback/issues

    ", + "text": " 3 x 4\n ^\nSyntaxError: invalid syntax\n\u5728\u7b2c 2\n", "type": "syntax_error" } ] @@ -4481,33 +4263,25 @@ "step": "times_table_exercise" }, { - "get_solution": [ - "for left in range(12):", - " left += 1", - " for right in range(12):", - " right += 1", - " print(f'{left} x {right} = {left * right}')", - " print('----------')" - ], - "page": "Introducing Nested Loops", + "get_solution": "program", + "page": "\u4ecb\u7ecd\u5d4c\u5957\u5faa\u73af", "program": [ "for left in range(12):", " left += 1", " for right in range(12):", " right += 1", " print(f'{left} x {right} = {left * right}')", - " print('----------')" + " print('---')" ], "response": { - "message": "", "passed": true, "result": [ { - "text": "1 x 1 = 1\n1 x 2 = 2\n1 x 3 = 3\n1 x 4 = 4\n1 x 5 = 5\n1 x 6 = 6\n1 x 7 = 7\n1 x 8 = 8\n1 x 9 = 9\n1 x 10 = 10\n1 x 11 = 11\n1 x 12 = 12\n----------\n2 x 1 = 2\n2 x 2 = 4\n2 x 3 = 6\n2 x 4 = 8\n2 x 5 = 10\n2 x 6 = 12\n2 x 7 = 14\n2 x 8 = 16\n2 x 9 = 18\n2 x 10 = 20\n2 x 11 = 22\n2 x 12 = 24\n----------\n3 x 1 = 3\n3 x 2 = 6\n3 x 3 = 9\n3 x 4 = 12\n3 x 5 = 15\n3 x 6 = 18\n3 x 7 = 21\n3 x 8 = 24\n3 x 9 = 27\n3 x 10 = 30\n3 x 11 = 33\n3 x 12 = 36\n----------\n4 x 1 = 4\n4 x 2 = 8\n4 x 3 = 12\n4 x 4 = 16\n4 x 5 = 20\n4 x 6 = 24\n4 x 7 = 28\n4 x 8 = 32\n4 x 9 = 36\n4 x 10 = 40\n4 x 11 = 44\n4 x 12 = 48\n----------\n5 x 1 = 5\n5 x 2 = 10\n5 x 3 = 15\n5 x 4 = 20\n5 x 5 = 25\n5 x 6 = 30\n5 x 7 = 35\n5 x 8 = 40\n5 x 9 = 45\n5 x 10 = 50\n5 x 11 = 55\n5 x 12 = 60\n----------\n6 x 1 = 6\n6 x 2 = 12\n6 x 3 = 18\n6 x 4 = 24\n6 x 5 = 30\n6 x 6 = 36\n6 x 7 = 42\n6 x 8 = 48\n6 x 9 = 54\n6 x 10 = 60\n6 x 11 = 66\n6 x 12 = 72\n----------\n7 x 1 = 7\n7 x 2 = 14\n7 x 3 = 21\n7 x 4 = 28\n7 x 5 = 35\n7 x 6 = 42\n7 x 7 = 49\n7 x 8 = 56\n7 x 9 = 63\n7 x 10 = 70\n7 x 11 = 77\n7 x 12 = 84\n----------", + "text": "1 x 1 = 1\n1 x 2 = 2\n1 x 3 = 3\n1 x 4 = 4\n1 x 5 = 5\n1 x 6 = 6\n1 x 7 = 7\n1 x 8 = 8\n1 x 9 = 9\n1 x 10 = 10\n1 x 11 = 11\n1 x 12 = 12\n---\n2 x 1 = 2\n2 x 2 = 4\n2 x 3 = 6\n2 x 4 = 8\n2 x 5 = 10\n2 x 6 = 12\n2 x 7 = 14\n2 x 8 = 16\n2 x 9 = 18\n2 x 10 = 20\n2 x 11 = 22\n2 x 12 = 24\n---\n3 x 1 = 3\n3 x 2 = 6\n3 x 3 = 9\n3 x 4 = 12\n3 x 5 = 15\n3 x 6 = 18\n3 x 7 = 21\n3 x 8 = 24\n3 x 9 = 27\n3 x 10 = 30\n3 x 11 = 33\n3 x 12 = 36\n---\n4 x 1 = 4\n4 x 2 = 8\n4 x 3 = 12\n4 x 4 = 16\n4 x 5 = 20\n4 x 6 = 24\n4 x 7 = 28\n4 x 8 = 32\n4 x 9 = 36\n4 x 10 = 40\n4 x 11 = 44\n4 x 12 = 48\n---\n5 x 1 = 5\n5 x 2 = 10\n5 x 3 = 15\n5 x 4 = 20\n5 x 5 = 25\n5 x 6 = 30\n5 x 7 = 35\n5 x 8 = 40\n5 x 9 = 45\n5 x 10 = 50\n5 x 11 = 55\n5 x 12 = 60\n---\n6 x 1 = 6\n6 x 2 = 12\n6 x 3 = 18\n6 x 4 = 24\n6 x 5 = 30\n6 x 6 = 36\n6 x 7 = 42\n6 x 8 = 48\n6 x 9 = 54\n6 x 10 = 60\n6 x 11 = 66\n6 x 12 = 72\n---\n7 x 1 = 7\n7 x 2 = 14\n7 x 3 = 21\n7 x 4 = 28\n7 x 5 = 35\n7 x 6 = 42\n7 x 7 = 49\n7 x 8 = 56\n7 x 9 = 63\n7 x 10 = 70\n7 x 11 = 77\n7 x 12 = 84\n---\n8 x 1 = 8\n8 x 2 = 16\n8 x 3 = 24\n8 x 4 = 32\n8 x 5 = 40", "type": "stdout" }, { - "text": "\n8 x 1 = 8\n8 x 2 = 16\n8 x 3 = 24\n8 x 4 = 32\n8 x 5 = 40\n8 x 6 = 48\n8 x 7 = 56\n8 x 8 = 64\n8 x 9 = 72\n8 x 10 = 80\n8 x 11 = 88\n8 x 12 = 96\n----------\n9 x 1 = 9\n9 x 2 = 18\n9 x 3 = 27\n9 x 4 = 36\n9 x 5 = 45\n9 x 6 = 54\n9 x 7 = 63\n9 x 8 = 72\n9 x 9 = 81\n9 x 10 = 90\n9 x 11 = 99\n9 x 12 = 108\n----------\n10 x 1 = 10\n10 x 2 = 20\n10 x 3 = 30\n10 x 4 = 40\n10 x 5 = 50\n10 x 6 = 60\n10 x 7 = 70\n10 x 8 = 80\n10 x 9 = 90\n10 x 10 = 100\n10 x 11 = 110\n10 x 12 = 120\n----------\n11 x 1 = 11\n11 x 2 = 22\n11 x 3 = 33\n11 x 4 = 44\n11 x 5 = 55\n11 x 6 = 66\n11 x 7 = 77\n11 x 8 = 88\n11 x 9 = 99\n11 x 10 = 110\n11 x 11 = 121\n11 x 12 = 132\n----------\n12 x 1 = 12\n12 x 2 = 24\n12 x 3 = 36\n12 x 4 = 48\n12 x 5 = 60\n12 x 6 = 72\n12 x 7 = 84\n12 x 8 = 96\n12 x 9 = 108\n12 x 10 = 120\n12 x 11 = 132\n12 x 12 = 144\n----------\n", + "text": "\n8 x 6 = 48\n8 x 7 = 56\n8 x 8 = 64\n8 x 9 = 72\n8 x 10 = 80\n8 x 11 = 88\n8 x 12 = 96\n---\n9 x 1 = 9\n9 x 2 = 18\n9 x 3 = 27\n9 x 4 = 36\n9 x 5 = 45\n9 x 6 = 54\n9 x 7 = 63\n9 x 8 = 72\n9 x 9 = 81\n9 x 10 = 90\n9 x 11 = 99\n9 x 12 = 108\n---\n10 x 1 = 10\n10 x 2 = 20\n10 x 3 = 30\n10 x 4 = 40\n10 x 5 = 50\n10 x 6 = 60\n10 x 7 = 70\n10 x 8 = 80\n10 x 9 = 90\n10 x 10 = 100\n10 x 11 = 110\n10 x 12 = 120\n---\n11 x 1 = 11\n11 x 2 = 22\n11 x 3 = 33\n11 x 4 = 44\n11 x 5 = 55\n11 x 6 = 66\n11 x 7 = 77\n11 x 8 = 88\n11 x 9 = 99\n11 x 10 = 110\n11 x 11 = 121\n11 x 12 = 132\n---\n12 x 1 = 12\n12 x 2 = 24\n12 x 3 = 36\n12 x 4 = 48\n12 x 5 = 60\n12 x 6 = 72\n12 x 7 = 84\n12 x 8 = 96\n12 x 9 = 108\n12 x 10 = 120\n12 x 11 = 132\n12 x 12 = 144\n---\n", "type": "stdout" } ] @@ -4521,7 +4295,7 @@ " if player1 != player2:", " print(f'{player1} vs {player2}')" ], - "page": "Introducing Nested Loops", + "page": "\u4ecb\u7ecd\u5d4c\u5957\u5faa\u73af", "program": [ "players = ['Alice', 'Bob', 'Charlie']", "for player1 in players:", @@ -4530,7 +4304,6 @@ " print(f'{player1} vs {player2}')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4549,7 +4322,7 @@ " for c4 in letters:", " print(c1 + c2 + c3 + c4)" ], - "page": "Introducing Nested Loops", + "page": "\u4ecb\u7ecd\u5d4c\u5957\u5faa\u73af", "program": [ "letters = 'AB'", "for c1 in letters:", @@ -4559,7 +4332,6 @@ " print(c1 + c2 + c3 + c4)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4579,7 +4351,7 @@ " line += '+'", " print(line)" ], - "page": "Introducing Nested Loops", + "page": "\u4ecb\u7ecd\u5d4c\u5957\u5faa\u73af", "program": [ "size = 3", "for i in range(size):", @@ -4590,7 +4362,6 @@ " print(line)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4608,7 +4379,7 @@ " if i < j:", " print(f'{players[i]} vs {players[j]}')" ], - "page": "Introducing Nested Loops", + "page": "\u4ecb\u7ecd\u5d4c\u5957\u5faa\u73af", "program": [ "players = ['Alice', 'Bob', 'Charlie']", "for i in range(len(players)):", @@ -4617,7 +4388,6 @@ " print(f'{players[i]} vs {players[j]}')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4629,7 +4399,8 @@ "step": "player_vs_player_bonus" }, { - "page": "Understanding Programs with birdseye", + "get_solution": "program", + "page": "\u4f7f\u7528 birdseye \u7406\u89e3\u7a0b\u5e8f", "program": [ "a = 2", "b = 3", @@ -4638,7 +4409,6 @@ "print(a * b + c * d)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4650,7 +4420,8 @@ "step": "first_birdseye_example" }, { - "page": "Understanding Programs with birdseye", + "get_solution": "program", + "page": "\u4f7f\u7528 birdseye \u7406\u89e3\u7a0b\u5e8f", "program": [ "word = 'Amazing'", "vowels = []", @@ -4664,7 +4435,6 @@ "print(consonants)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4680,14 +4450,13 @@ "string = strings[1]", "print(string[0])" ], - "page": "Introducing Nested Lists", + "page": "\u4ecb\u7ecd\u5d4c\u5957\u5217\u8868", "program": [ "strings = ['abc', 'def', 'ghi']", "string = strings[1]", "print(string[0])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4699,13 +4468,13 @@ "step": "string_list_exercise" }, { - "page": "Introducing Nested Lists", + "get_solution": "program", + "page": "\u4ecb\u7ecd\u5d4c\u5957\u5217\u8868", "program": [ "strings = [\"abc\", \"def\", \"ghi\"]", "print(strings[1][0])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4720,13 +4489,12 @@ "get_solution": [ "print(strings[-2][-1])" ], - "page": "Introducing Nested Lists", + "page": "\u4ecb\u7ecd\u5d4c\u5957\u5217\u8868", "program": [ "strings = ['abc', 'de', 'fghi', 'jklmn', 'o']", "print(strings[-2][-1])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4738,13 +4506,13 @@ "step": "double_subscripting_exercise" }, { - "page": "Introducing Nested Lists", + "get_solution": "program", + "page": "\u4ecb\u7ecd\u5d4c\u5957\u5217\u8868", "program": [ "strings = [['hello', 'there'], ['how', 'are', 'you']]", "print(strings[1][0])" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "how", @@ -4760,7 +4528,7 @@ "t", "e", "a", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -4776,13 +4544,12 @@ "get_solution": [ "print(strings[1][2][0])" ], - "page": "Introducing Nested Lists", + "page": "\u4ecb\u7ecd\u5d4c\u5957\u5217\u8868", "program": [ "strings = [['hello', 'there'], ['how', 'are', 'you']]", "print(strings[1][2][0])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4794,7 +4561,8 @@ "step": "triple_subscripting" }, { - "page": "Looping Over Nested Lists", + "get_solution": "program", + "page": "\u904d\u5386\u5d4c\u5957\u5217\u8868", "program": [ "numbers = [[1, 2, 3], [4, 5], [6], []]", "for sublist in numbers:", @@ -4803,7 +4571,6 @@ " print('---')" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "1\n2\n3\n---\n4\n5\n---\n6\n---\n---", @@ -4813,7 +4580,7 @@ "1\n2\n3\n---\n4\n5\n---\n6\n---", "1 2 3\n---\n4 5\n---\n6\n---\n---", "1 2 3\n---\n4 5\n---\n6\n---", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -4826,7 +4593,8 @@ "step": "nested_list_nested_loop_example" }, { - "page": "Looping Over Nested Lists", + "get_solution": "program", + "page": "\u904d\u5386\u5d4c\u5957\u5217\u8868", "program": [ "numbers = [[1, 2, 3], [4, 5], [6], []]", "for sublist in numbers:", @@ -4835,7 +4603,6 @@ " print('---')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4853,7 +4620,7 @@ " if word in string:", " print(string)" ], - "page": "Looping Over Nested Lists", + "page": "\u904d\u5386\u5d4c\u5957\u5217\u8868", "program": [ "strings = [['hello there', 'how are you'], ['goodbye world', 'hello world']]", "word = 'hello'", @@ -4863,7 +4630,6 @@ " print(string)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4883,7 +4649,7 @@ " present = True", " print(present)" ], - "page": "Looping Over Nested Lists", + "page": "\u904d\u5386\u5d4c\u5957\u5217\u8868", "program": [ "strings = [['hello there', 'how are you'], ['goodbye world', 'hello world']]", "word = 'goodbye'", @@ -4895,7 +4661,6 @@ " print(present)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4915,7 +4680,7 @@ " present = True", "print(present)" ], - "page": "Looping Over Nested Lists", + "page": "\u904d\u5386\u5d4c\u5957\u5217\u8868", "program": [ "strings = [['hello there', 'how are you'], ['goodbye world', 'hello world']]", "word = 'are'", @@ -4927,7 +4692,6 @@ "print(present)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4946,7 +4710,7 @@ " line += string[i]", " print(line)" ], - "page": "Looping Over Nested Lists", + "page": "\u904d\u5386\u5d4c\u5957\u5217\u8868", "program": [ "strings = ['abc', 'def', 'ghi']", "for i in range(len(strings[0])):", @@ -4956,7 +4720,6 @@ " print(line)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -4983,7 +4746,7 @@ " line += string[i]", " print(line)" ], - "page": "Looping Over Nested Lists", + "page": "\u904d\u5386\u5d4c\u5957\u5217\u8868", "program": [ "strings = ['abcqwe', 'def', 'ghiq']", "lengths = []", @@ -5001,7 +4764,6 @@ " print(line)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5013,7 +4775,8 @@ "step": "zip_longest_strings_exercise" }, { - "page": "Defining Functions", + "get_solution": "program", + "page": "\u5b9a\u4e49\u51fd\u6570", "program": [ "def greet(name):", " print(f\"Hello {name}!\")", @@ -5022,7 +4785,6 @@ "greet(\"Bob\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5034,7 +4796,8 @@ "step": "define_greet" }, { - "page": "Defining Functions", + "get_solution": "program", + "page": "\u5b9a\u4e49\u51fd\u6570", "program": [ "def greet(name):", " print(f\"Hello {name}!\")", @@ -5044,7 +4807,6 @@ "greet(\"Bob\")" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Hello Alice!\nHow are you?\nHello Bob!\nHow are you?", @@ -5052,7 +4814,7 @@ "Hello Alice!\nHow are you?\nHello Bob!\nHow are you?", "Hello Alice!\nHello Bob!\nHow are you?", "Hello Alice!\nHow are you?\nHello Bob!", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -5065,15 +4827,8 @@ "step": "how_are_you" }, { - "get_solution": [ - "def say_hello(name):", - " print(f\"Hello {name}!\")", - " print(\"How are you?\")", - "", - "say_hello(\"Alice\")", - "say_hello(\"Bob\")" - ], - "page": "Defining Functions", + "get_solution": "program", + "page": "\u5b9a\u4e49\u51fd\u6570", "program": [ "def say_hello(name):", " print(f\"Hello {name}!\")", @@ -5083,7 +4838,6 @@ "say_hello(\"Bob\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5095,15 +4849,8 @@ "step": "change_function_name" }, { - "get_solution": [ - "def say_hello(person_name):", - " print(f\"Hello {person_name}!\")", - " print(\"How are you?\")", - "", - "say_hello(\"Alice\")", - "say_hello(\"Bob\")" - ], - "page": "Defining Functions", + "get_solution": "program", + "page": "\u5b9a\u4e49\u51fd\u6570", "program": [ "def say_hello(person_name):", " print(f\"Hello {person_name}!\")", @@ -5113,7 +4860,6 @@ "say_hello(\"Bob\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5125,26 +4871,22 @@ "step": "change_parameter_name" }, { - "get_solution": [ - "def print_twice(x):", - " print(x)", - " print(x)" - ], - "page": "Defining Functions", + "get_solution": "program", + "page": "\u5b9a\u4e49\u51fd\u6570", "program": [ "def print_twice(x):", " print(x)", " print(x)" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "print_twice_exercise" }, { - "page": "Defining Functions", + "get_solution": "program", + "page": "\u5b9a\u4e49\u51fd\u6570", "program": [ "def print_many(thing, n):", " for _ in range(n):", @@ -5153,7 +4895,6 @@ "print_many(\"Hello\", 3)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Hello\nHello\nHello", @@ -5163,7 +4904,7 @@ "Hello\nHello\nHello", "Hello", "H\ne\nl\nl\no", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -5176,15 +4917,9 @@ "step": "print_many" }, { - "get_solution": [ - "def print_many(n, thing):", - " for _ in range(n):", - " print(thing)", - "", - "print_many(3, \"Hello\")" - ], - "page": "Defining Functions", - "program": [ + "get_solution": "program", + "page": "\u5b9a\u4e49\u51fd\u6570", + "program": [ "def print_many(n, thing):", " for _ in range(n):", " print(thing)", @@ -5192,7 +4927,6 @@ "print_many(3, \"Hello\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5204,7 +4938,8 @@ "step": "swap_parameters" }, { - "page": "Calling Functions Within Functions", + "get_solution": "program", + "page": "\u5728\u51fd\u6570\u4e2d\u8c03\u7528\u51fd\u6570", "program": [ "def print_many(n, thing):", " for _ in range(n):", @@ -5216,7 +4951,6 @@ "print_twice(\"Hello\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5228,7 +4962,8 @@ "step": "print_twice_call_print_many" }, { - "page": "Calling Functions Within Functions", + "get_solution": "program", + "page": "\u5728\u51fd\u6570\u4e2d\u8c03\u7528\u51fd\u6570", "program": [ "def print_many(n, thing):", " for _ in range(n):", @@ -5240,83 +4975,55 @@ "print_twice(\"Hello\")" ], "response": { - "message": "", "passed": true, "result": [ { - "text": "", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 1\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_many\u001b[39m(n, thing):\n", - "type": "stdout" + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 1\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_many\u001b[39m(n, thing):\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_twice\u001b[39m(x):\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | print_twice(\u001b[38;5;186m\"\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m\"\u001b[39m)\n\u001b[38;5;245m \u001b[0m\u001b[36m\u001b[1m>>> Call to print_twice in File \"/my_program.py\", line 5\u001b[0m\n\u001b[38;5;245m \u001b[0m...... x = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 5\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_twice\u001b[39m(x):\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | print_many(\u001b[38;5;141m2\u001b[39m, x)\n\u001b[38;5;245m \u001b[0m\u001b[36m\u001b[1m>>> Call to print_many in File \"/my_program.py\", line 1\u001b[0m\n\u001b[38;5;245m \u001b[0m...... n = \u001b[38;5;141m2\u001b[39m\n\u001b[38;5;245m \u001b[0m...... thing = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 1\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_many\u001b[39m(n, thing):\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;204min\u001b[39m range(n):\n", + "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_twice\u001b[39m(x):\n", - "type": "stdout" + "text": "\u001b[38;5;245m \u001b[0m.......... _ = \u001b[38;5;141m0\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 3\u001b[0m | print(thing)\n", + "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | print_twice(\u001b[38;5;186m\"\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m\"\u001b[39m)\n", + "text": "Hello", "type": "stdout" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[36m\u001b[1m>>> Call to print_twice in File \"my_program.py\", line 5\u001b[0m\n\u001b[38;5;242m \u001b[0m...... x = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 5\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_twice\u001b[39m(x):\n", + "text": "\n", "type": "stdout" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | print_many(\u001b[38;5;141m2\u001b[39m, x)\n", - "type": "stdout" + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;204min\u001b[39m range(n):\n", + "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[36m\u001b[1m>>> Call to print_many in File \"my_program.py\", line 1\u001b[0m\n\u001b[38;5;242m \u001b[0m...... n = \u001b[38;5;141m2\u001b[39m\n\u001b[38;5;242m \u001b[0m...... thing = \u001b[38;5;186m'\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m'\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 1\u001b[0m | \u001b[38;5;81mdef\u001b[39m \u001b[38;5;148mprint_many\u001b[39m(n, thing):\n", - "type": "stdout" + "text": "\u001b[38;5;245m \u001b[0m.......... _ = \u001b[38;5;141m1\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 3\u001b[0m | print(thing)\n", + "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;197min\u001b[39m range(n):\n", + "text": "Hello", "type": "stdout" }, { - "text": "\u001b[38;5;242m \u001b[0m.......... _ = \u001b[38;5;141m0\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 3\u001b[0m | print(thing)\n", + "text": "\n", "type": "stdout" }, { - "text": "Hello\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;197min\u001b[39m range(n):\n", - "type": "stdout" + "text": "\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;204min\u001b[39m range(n):\n", + "type": "snoop" }, { - "text": "\u001b[38;5;242m \u001b[0m.......... _ = \u001b[38;5;141m1\u001b[39m\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 3\u001b[0m | print(thing)\n", - "type": "stdout" - }, - { - "text": "Hello\n\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 2\u001b[0m | \u001b[38;5;81mfor\u001b[39m _ \u001b[38;5;197min\u001b[39m range(n):\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[32m\u001b[1m<<< Return value from print_many: \u001b[0m\u001b[38;5;81mNone\u001b[39m\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 6\u001b[0m | print_many(\u001b[38;5;141m2\u001b[39m, x)\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[32m\u001b[1m<<< Return value from print_twice: \u001b[0m\u001b[38;5;81mNone\u001b[39m\n", - "type": "stdout" - }, - { - "text": "\u001b[38;5;242m \u001b[0m\u001b[38;5;242m 8\u001b[0m | print_twice(\u001b[38;5;186m\"\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m\"\u001b[39m)\n", - "type": "stdout" - }, - { - "text": "", - "type": "stdout" + "text": "\u001b[38;5;245m \u001b[0m\u001b[32m\u001b[1m<<< Return value from print_many: \u001b[0m\u001b[38;5;81mNone\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 6\u001b[0m | print_many(\u001b[38;5;141m2\u001b[39m, x)\n\u001b[38;5;245m \u001b[0m\u001b[32m\u001b[1m<<< Return value from print_twice: \u001b[0m\u001b[38;5;81mNone\u001b[39m\n\u001b[38;5;245m \u001b[0m\u001b[38;5;245m 8\u001b[0m | print_twice(\u001b[38;5;186m\"\u001b[39m\u001b[38;5;186mHello\u001b[39m\u001b[38;5;186m\"\u001b[39m)\n", + "type": "snoop" } ] }, "step": "see_stack_in_snoop" }, { - "page": "Calling Functions Within Functions", + "get_solution": "program", + "page": "\u5728\u51fd\u6570\u4e2d\u8c03\u7528\u51fd\u6570", "program": [ "def print_many(n, thing):", " for _ in range(n):", @@ -5328,7 +5035,6 @@ "print_twice(\"Hello\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5340,7 +5046,8 @@ "step": "see_stack_in_pythontutor" }, { - "page": "Calling Functions Within Functions", + "get_solution": "program", + "page": "\u5728\u51fd\u6570\u4e2d\u8c03\u7528\u51fd\u6570", "program": [ "def print_many(n, thing):", " for _ in range(n):", @@ -5352,7 +5059,6 @@ "print_twice(\"Hello\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5364,7 +5070,8 @@ "step": "see_stack_in_birdseye" }, { - "page": "Returning Values From Functions", + "get_solution": "program", + "page": "\u4ece\u51fd\u6570\u8fd4\u56de\u503c", "program": [ "def double(x):", " return x * 2", @@ -5375,7 +5082,6 @@ "print(twice)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "5\n10", @@ -5383,7 +5089,7 @@ "5\n5", "5\n10", "10\n10", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -5396,7 +5102,8 @@ "step": "first_return" }, { - "page": "Returning Values From Functions", + "get_solution": "program", + "page": "\u4ece\u51fd\u6570\u8fd4\u56de\u503c", "program": [ "def double(x):", " return x * 2", @@ -5406,14 +5113,13 @@ "print(number)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "5", "choices": [ "5", "10", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -5426,13 +5132,13 @@ "step": "losing_return_value" }, { - "page": "Returning Values From Functions", + "page": "\u4ece\u51fd\u6570\u8fd4\u56de\u503c", "program": [ "def quadruple(x):", " return x * 4" ], "response": { - "message": "

    You cannot use *, +, or even any numbers inside quadruple.\nYou must call double to solve the problem.

    ", + "message": "

    \u4f60\u4e0d\u80fd\u5728 quadruple \u5185\u90e8\u4f7f\u7528 *\u3001+\uff0c\u751a\u81f3\u4efb\u4f55\u6570\u5b57\u3002\n\u4f60\u5fc5\u987b\u8c03\u7528 double \u6765\u89e3\u51b3\u8fd9\u4e2a\u95ee\u9898\u3002

    ", "passed": false, "result": [] }, @@ -5443,7 +5149,7 @@ "def quadruple(x):", " return double(double(x))" ], - "page": "Returning Values From Functions", + "page": "\u4ece\u51fd\u6570\u8fd4\u56de\u503c", "program": [ "def double(x):", " return x * 2", @@ -5452,14 +5158,14 @@ " return double(double(x))" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "quadruple_exercise" }, { - "page": "Testing Functions", + "get_solution": "program", + "page": "\u6d4b\u8bd5\u51fd\u6570", "program": [ "def double(x):", " return x * 2", @@ -5468,7 +5174,6 @@ "assert_equal(double(5), 10)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "OK\nOK", @@ -5478,7 +5183,7 @@ "Error! 2 != 4", "OK\nOK", "OK", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -5491,7 +5196,8 @@ "step": "introducing_assert_equal" }, { - "page": "Testing Functions", + "get_solution": "program", + "page": "\u6d4b\u8bd5\u51fd\u6570", "program": [ "def double(x):", " return x * 3", @@ -5500,7 +5206,6 @@ "assert_equal(double(5), 10)" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "Error! 6 != 4\nError! 15 != 10", @@ -5509,7 +5214,7 @@ "Error! 6 != 4\nError! 15 != 10", "Error! 4 != 6\nError! 10 != 15", "OK\nOK", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -5522,7 +5227,8 @@ "step": "make_tests_fail" }, { - "page": "Testing Functions", + "get_solution": "program", + "page": "\u6d4b\u8bd5\u51fd\u6570", "program": [ "def double(x):", " return x * 2", @@ -5534,7 +5240,6 @@ "assert_equal(quadruple(5), 20)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5546,24 +5251,20 @@ "step": "complete_quadruple_tests" }, { - "get_solution": [ - "def surround(string, sides):", - " return sides + string + sides" - ], - "page": "Testing Functions", + "get_solution": "program", + "page": "\u6d4b\u8bd5\u51fd\u6570", "program": [ "def surround(string, sides):", " return sides + string + sides" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "surround_exercise" }, { - "page": "Testing Functions", + "page": "\u6d4b\u8bd5\u51fd\u6570", "program": [ "def surround(string, sides):", " return sides + string + sides", @@ -5575,21 +5276,21 @@ " return string" ], "response": { - "message": "

    In the alert function, you placed your return statement at the wrong place!\nPay attention to your indentations in alert. You might be ending a loop too early with return.

    ", + "message": "

    \u5728 alert \u51fd\u6570\u4e2d\uff0c\u4f60\u628a return \u8bed\u53e5\u653e\u5728\u4e86\u9519\u8bef\u7684\u4f4d\u7f6e\uff01\n\u6ce8\u610f\u4f60\u5728 alert \u4e2d\u7684\u7f29\u8fdb\u3002\u4f60\u53ef\u80fd\u8fc7\u65e9\u5730\u7528 return \u7ed3\u675f\u4e86\u4e00\u4e2a\u5faa\u73af\u3002

    ", "passed": false, "result": [] }, "step": "alert_exercise" }, { - "page": "Testing Functions", + "page": "\u6d4b\u8bd5\u51fd\u6570", "program": [ "def alert(string, level):", " marks = '!' * level", " return marks + ' ' + string + ' ' + marks" ], "response": { - "message": "

    You cannot use string concatenation/formatting/interpolation/multiplication or f-strings in alert.\nYou must call surround to solve the problem.

    ", + "message": "

    \u4f60\u4e0d\u80fd\u5728 alert \u4e2d\u4f7f\u7528\u5b57\u7b26\u4e32\u8fde\u63a5/\u683c\u5f0f\u5316/\u63d2\u503c/\u4e58\u6cd5\u6216 f-strings\u3002\n\u4f60\u5fc5\u987b\u8c03\u7528 surround \u6765\u89e3\u51b3\u8fd9\u4e2a\u95ee\u9898\u3002

    ", "passed": false, "result": [] }, @@ -5603,7 +5304,7 @@ " string = surround(string, '!')", " return string" ], - "page": "Testing Functions", + "page": "\u6d4b\u8bd5\u51fd\u6570", "program": [ "def surround(string, sides):", " return sides + string + sides", @@ -5615,14 +5316,14 @@ " return string" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "alert_exercise" }, { - "page": "return ends the function call", + "get_solution": "program", + "page": "return \u7ed3\u675f\u51fd\u6570\u8c03\u7528", "program": [ "def foo():", " return 1", @@ -5631,7 +5332,6 @@ "print(foo())" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "1", @@ -5641,7 +5341,7 @@ "[1, 2]", "1\n2", "1 2", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -5654,7 +5354,8 @@ "step": "double_return_in_one_function" }, { - "page": "return ends the function call", + "get_solution": "program", + "page": "return \u7ed3\u675f\u51fd\u6570\u8c03\u7528", "program": [ "def double_numbers(numbers):", " for x in numbers:", @@ -5663,7 +5364,6 @@ "assert_equal(double_numbers([1, 2, 3]), [2, 4, 6])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5675,7 +5375,8 @@ "step": "cannot_return_multiple_values" }, { - "page": "return ends the function call", + "get_solution": "program", + "page": "return \u7ed3\u675f\u51fd\u6570\u8c03\u7528", "program": [ "def foo():", " for letter in 'abc':", @@ -5687,7 +5388,6 @@ "foo()" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "a 0\na 1\na 2\nb 0", @@ -5697,7 +5397,7 @@ "a 0\na 1\na 2\nb 0\nb 1\nb 2", "a 0\na 1\na 2\nb 0\nc 0\nc 1\nc 2", "a 0\na 1\na 2\nb 0\nb 1\nb 2\nc 0\nc 1\nc 2", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -5710,7 +5410,8 @@ "step": "return_ends_whole_function" }, { - "page": "return ends the function call", + "get_solution": "program", + "page": "return \u7ed3\u675f\u51fd\u6570\u8c03\u7528", "program": [ "def foo():", " for letter in 'abc':", @@ -5722,7 +5423,6 @@ "foo()" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "a 0\na 1\na 2\nb 0\nc 0\nc 1\nc 2", @@ -5732,7 +5432,7 @@ "a 0\na 1\na 2\nb 0\nb 1\nb 2", "a 0\na 1\na 2\nb 0\nc 0\nc 1\nc 2", "a 0\na 1\na 2\nb 0\nb 1\nb 2\nc 0\nc 1\nc 2", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -5745,7 +5445,8 @@ "step": "break_vs_return" }, { - "page": "Introducing or", + "get_solution": "program", + "page": "\u4ecb\u7ecd or", "program": [ "def is_friend(name):", " if name == \"Alice\":", @@ -5760,7 +5461,6 @@ "assert_equal(is_friend(\"Charlie\"), False)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5772,19 +5472,19 @@ "step": "InputAliceBob" }, { - "page": "Introducing or", + "get_solution": "program", + "page": "\u4ecb\u7ecd or", "program": [ "True or True" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "True", "choices": [ "True", "False", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -5797,19 +5497,19 @@ "step": "TrueOrTrue" }, { - "page": "Introducing or", + "get_solution": "program", + "page": "\u4ecb\u7ecd or", "program": [ "True or False" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "True", "choices": [ "True", "False", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -5822,19 +5522,19 @@ "step": "TrueOrFalse" }, { - "page": "Introducing or", + "get_solution": "program", + "page": "\u4ecb\u7ecd or", "program": [ "False or False" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "False", "choices": [ "True", "False", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -5847,7 +5547,8 @@ "step": "FalseOrFalse" }, { - "page": "Introducing or", + "get_solution": "program", + "page": "\u4ecb\u7ecd or", "program": [ "def is_friend(name):", " if name == \"Alice\" or name == \"Bob\":", @@ -5860,7 +5561,6 @@ "assert_equal(is_friend(\"Charlie\"), False)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5872,7 +5572,8 @@ "step": "ImprovingWithOr" }, { - "page": "Introducing or", + "get_solution": "program", + "page": "\u4ecb\u7ecd or", "program": [ "def is_friend(name):", " return name == \"Alice\" or name == \"Bob\"", @@ -5882,7 +5583,6 @@ "assert_equal(is_friend(\"Charlie\"), False)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5894,7 +5594,8 @@ "step": "FurtherImprovement" }, { - "page": "Introducing or", + "get_solution": "program", + "page": "\u4ecb\u7ecd or", "program": [ "def is_friend(name):", " return name == \"Alice\" or \"Bob\"", @@ -5904,7 +5605,6 @@ "assert_equal(is_friend(\"Charlie\"), False)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5916,7 +5616,8 @@ "step": "ACommonMistake" }, { - "page": "Introducing or", + "get_solution": "program", + "page": "\u4ecb\u7ecd or", "program": [ "def is_friend(name):", " return name == \"Alice\" or \"Bob\"", @@ -5926,7 +5627,6 @@ "assert_equal(is_friend(\"Charlie\"), False)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -5938,14 +5638,8 @@ "step": "InspectWithBirdseye" }, { - "get_solution": [ - "def is_valid_percentage(x):", - " if x < 0 or x > 100:", - " return False", - " else:", - " return True" - ], - "page": "Introducing or", + "get_solution": "program", + "page": "\u4ecb\u7ecd or", "program": [ "def is_valid_percentage(x):", " if x < 0 or x > 100:", @@ -5954,26 +5648,25 @@ " return True" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "AnExercise" }, { - "page": "Introducing and", + "get_solution": "program", + "page": "\u4ecb\u7ecd and", "program": [ "True and True" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "True", "choices": [ "True", "False", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -5986,19 +5679,19 @@ "step": "TrueAndTrue" }, { - "page": "Introducing and", + "get_solution": "program", + "page": "\u4ecb\u7ecd and", "program": [ "True and False" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "False", "choices": [ "True", "False", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -6011,19 +5704,19 @@ "step": "TrueAndFalse" }, { - "page": "Introducing and", + "get_solution": "program", + "page": "\u4ecb\u7ecd and", "program": [ "False and False" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "False", "choices": [ "True", "False", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -6036,14 +5729,8 @@ "step": "FalseAndFalse" }, { - "get_solution": [ - "def is_valid_percentage(x):", - " if 0 <= x and x <= 100:", - " return True", - " else:", - " return False" - ], - "page": "Introducing and", + "get_solution": "program", + "page": "\u4ecb\u7ecd and", "program": [ "def is_valid_percentage(x):", " if 0 <= x and x <= 100:", @@ -6052,41 +5739,37 @@ " return False" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "AndExercise" }, { - "get_solution": [ - "def all_equal(row):", - " return row[0] == row[1] and row[0] == row[2]" - ], - "page": "Introducing and", + "get_solution": "program", + "page": "\u4ecb\u7ecd and", "program": [ "def all_equal(row):", " return row[0] == row[1] and row[0] == row[2]" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "TicTacToeWinningRow" }, { - "page": "Multi-line statements", + "get_solution": "program", + "page": "\u591a\u884c\u8bed\u53e5", "program": [ "is_friend = name == \"Alice\" or", " name == \"Bob\"" ], "response": { - "message": "", "passed": true, "result": [ { - "text": " is_friend = name == \"Alice\" or\n ^\nSyntaxError: invalid syntax\nat line 1\n\nA `SyntaxError` occurs when Python cannot understand your code.\n\nThe Python keyword `or` can only be used for boolean expressions.\nPerhaps you meant to write\n\n`is_friend = name == \"Alice\" ,`\n\n\n", + "friendly": "

    A SyntaxError occurs when Python cannot understand your code.

    \n

    The Python keyword or can only be used for boolean expressions.\nPerhaps you meant to write

    \n

    is_friend = name == \"Alice\" ,

    ", + "text": " is_friend = name == \"Alice\" or\n ^\nSyntaxError: invalid syntax\n\u5728\u7b2c 1\n", "type": "syntax_error" } ] @@ -6094,7 +5777,8 @@ "step": "invalid_multiline" }, { - "page": "Multi-line statements", + "get_solution": "program", + "page": "\u591a\u884c\u8bed\u53e5", "program": [ "name = \"Bob\"", "", @@ -6114,7 +5798,6 @@ " name == \"Bob\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6126,12 +5809,12 @@ "step": "valid_multiline" }, { - "page": "Combining and and or", + "get_solution": "program", + "page": "\u7ec4\u5408 and \u548c or", "program": [ "True or False and False" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6143,15 +5826,8 @@ "step": "CombiningAndOr" }, { - "get_solution": [ - "def diagonal_winner(board):", - " middle = board[1][1]", - " return (", - " (middle == board[0][0] and middle == board[2][2]) or", - " (middle == board[0][2] and middle == board[2][0])", - " )" - ], - "page": "Combining and and or", + "get_solution": "program", + "page": "\u7ec4\u5408 and \u548c or", "program": [ "def diagonal_winner(board):", " middle = board[1][1]", @@ -6161,26 +5837,25 @@ " )" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "AndHasHigherPriority" }, { - "page": "Introducing not", + "get_solution": "program", + "page": "\u4ecb\u7ecd not", "program": [ "not True" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "False", "choices": [ "True", "False", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -6193,19 +5868,19 @@ "step": "IntroducingNot" }, { - "page": "Introducing not", + "get_solution": "program", + "page": "\u4ecb\u7ecd not", "program": [ "not False" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "True", "choices": [ "True", "False", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -6218,13 +5893,13 @@ "step": "NotFalse" }, { - "page": "Introducing not", + "get_solution": "program", + "page": "\u4ecb\u7ecd not", "program": [ "b = True", "print(not b or b)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6236,24 +5911,20 @@ "step": "NotTrueOrTrue" }, { - "get_solution": [ - "def invalid_image(filename):", - " return not (filename.endswith(\".png\") or filename.endswith(\".jpg\"))" - ], - "page": "Introducing not", + "get_solution": "program", + "page": "\u4ecb\u7ecd not", "program": [ "def invalid_image(filename):", " return not (filename.endswith(\".png\") or filename.endswith(\".jpg\"))" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "NotPriority" }, { - "page": "Checking the board for winners", + "page": "\u68c0\u67e5\u68cb\u76d8\u4e0a\u7684\u83b7\u80dc\u8005", "program": [ "def row_winner(board):", " for row in board:", @@ -6268,27 +5939,15 @@ " return False" ], "response": { - "message": "

    Keep in mind that some entries might be ' '. An empty row is not a winning row.

    ", + "message": "

    \u8bf7\u8bb0\u4f4f\uff0c\u6709\u4e9b\u6761\u76ee\u53ef\u80fd\u662f ' '\u3002\u7a7a\u884c\u4e0d\u662f\u83b7\u80dc\u884c\u3002

    ", "passed": false, "result": [] }, "step": "intro_row_winner" }, { - "get_solution": [ - "def row_winner(board):", - " for row in board:", - " all_equal = True", - " piece = row[0]", - " for entry in row:", - " if entry == ' ' or piece != entry:", - " all_equal = False", - " break", - " if all_equal:", - " return True", - " return False" - ], - "page": "Checking the board for winners", + "get_solution": "program", + "page": "\u68c0\u67e5\u68cb\u76d8\u4e0a\u7684\u83b7\u80dc\u8005", "program": [ "def row_winner(board):", " for row in board:", @@ -6303,27 +5962,14 @@ " return False" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "intro_row_winner" }, { - "get_solution": [ - "def column_winner(board):", - " for col in range(len(board[0])):", - " all_equal = True", - " piece = board[0][col]", - " for row in board:", - " if row[col] == ' ' or row[col] != piece:", - " all_equal = False", - " break", - " if all_equal:", - " return True", - " return False" - ], - "page": "Checking the board for winners", + "get_solution": "program", + "page": "\u68c0\u67e5\u68cb\u76d8\u4e0a\u7684\u83b7\u80dc\u8005", "program": [ "def column_winner(board):", " for col in range(len(board[0])):", @@ -6338,27 +5984,14 @@ " return False" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "column_winner" }, { - "get_solution": [ - "def diagonal_winner(board):", - " all_equal1 = True", - " all_equal2 = True", - " topleft = board[0][0]", - " topright = board[0][-1]", - " for i in range(len(board)):", - " if board[i][i] == ' ' or board[i][i] != topleft:", - " all_equal1 = False", - " if board[i][-i - 1] == ' ' or board[i][-i - 1] != topright:", - " all_equal2 = False", - " return all_equal1 or all_equal2" - ], - "page": "Checking the board for winners", + "get_solution": "program", + "page": "\u68c0\u67e5\u68cb\u76d8\u4e0a\u7684\u83b7\u80dc\u8005", "program": [ "def diagonal_winner(board):", " all_equal1 = True", @@ -6373,7 +6006,6 @@ " return all_equal1 or all_equal2" ], "response": { - "message": "", "passed": true, "result": [] }, @@ -6384,7 +6016,7 @@ "def winner(board):", " return row_winner(board) or column_winner(board) or diagonal_winner(board)" ], - "page": "Checking the board for winners", + "page": "\u68c0\u67e5\u68cb\u76d8\u4e0a\u7684\u83b7\u80dc\u8005", "program": [ "def winning_line(strings):", " piece = strings[0]", @@ -6422,14 +6054,14 @@ " return row_winner(board) or column_winner(board) or diagonal_winner(board)" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "winner" }, { - "page": "The newline character, format_board", + "get_solution": "program", + "page": "\u6362\u884c\u7b26\uff0cformat_board", "program": [ "def print_board(board):", " for row in board:", @@ -6442,7 +6074,6 @@ "])" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6454,7 +6085,8 @@ "step": "one_way_to_print_board" }, { - "page": "The newline character, format_board", + "get_solution": "program", + "page": "\u6362\u884c\u7b26\uff0cformat_board", "program": [ "assert_equal(", " format_board([", @@ -6468,11 +6100,11 @@ ")" ], "response": { - "message": "", "passed": true, "result": [ { - "text": " \"XOX\n ^\nSyntaxError: EOL while scanning string literal\nat line 7\n\nA `SyntaxError` occurs when Python cannot understand your code.\n\nYou started writing a string with a single or double quote\nbut never ended the string with another quote on that line.\n\n\n", + "friendly": "

    A SyntaxError occurs when Python cannot understand your code.

    \n

    You started writing a string with a single or double quote\nbut never ended the string with another quote on that line.

    ", + "text": " \"XOX\n ^\nSyntaxError: unterminated string literal (detected at line 7)\n\u5728\u7b2c 7\n", "type": "syntax_error" } ] @@ -6480,14 +6112,14 @@ "step": "invalid_multi_line_string" }, { - "page": "The newline character, format_board", + "get_solution": "program", + "page": "\u6362\u884c\u7b26\uff0cformat_board", "program": [ "string = \"\"\"First line", "Second line\"\"\"", "print(string)" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6499,24 +6131,24 @@ "step": "multi_line_strings_triple_quotes" }, { - "page": "The newline character, format_board", + "page": "\u6362\u884c\u7b26\uff0cformat_board", "program": [ "string = 'a'" ], "response": { - "message": "

    Oops, string doesn't have the right value. Run the program from the previous step again.

    ", + "message": "

    \u54ce\u5440\uff0cstring \u7684\u503c\u4e0d\u6b63\u786e\u3002\u8bf7\u518d\u6b21\u8fd0\u884c\u4e0a\u4e00\u6b65\u7684\u7a0b\u5e8f\u3002

    ", "passed": false, "result": [] }, "step": "discovering_newline" }, { - "page": "The newline character, format_board", + "get_solution": "program", + "page": "\u6362\u884c\u7b26\uff0cformat_board", "program": [ "string" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6528,19 +6160,19 @@ "step": "discovering_newline" }, { - "page": "The newline character, format_board", + "get_solution": "program", + "page": "\u6362\u884c\u7b26\uff0cformat_board", "program": [ "len('\\n')" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "1", "choices": [ "1", "2", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -6553,17 +6185,8 @@ "step": "introducing_newline" }, { - "get_solution": [ - "def format_board(board):", - " result = ''", - " for i in range(len(board)):", - " for char in board[i]:", - " result += char", - " if i != len(board) - 1:", - " result += '\\n'", - " return result" - ], - "page": "The newline character, format_board", + "get_solution": "program", + "page": "\u6362\u884c\u7b26\uff0cformat_board", "program": [ "def format_board(board):", " result = ''", @@ -6575,25 +6198,14 @@ " return result" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "format_board_simple" }, { - "get_solution": [ - "def format_board(board):", - " joined_rows = []", - " for row in board:", - " joined_rows.append(\"|\".join(row))", - " lines = []", - " for _ in board[0]:", - " lines.append(\"-\")", - " line = f'\\n{\"+\".join(lines)}\\n'", - " return line.join(joined_rows)" - ], - "page": "The newline character, format_board", + "get_solution": "program", + "page": "\u6362\u884c\u7b26\uff0cformat_board", "program": [ "def format_board(board):", " joined_rows = []", @@ -6606,14 +6218,14 @@ " return line.join(joined_rows)" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "format_board_bonus_challenge" }, { - "page": "Types", + "get_solution": "program", + "page": "\u7c7b\u578b", "program": [ "print(type('Hello World'))", "print(type(23))", @@ -6622,7 +6234,6 @@ "print(type(4.56))" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6634,12 +6245,12 @@ "step": "five_different_types" }, { - "page": "Types", + "get_solution": "program", + "page": "\u7c7b\u578b", "program": [ "type(3) == int" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6651,14 +6262,14 @@ "step": "check_type_manually" }, { - "page": "Types", + "get_solution": "program", + "page": "\u7c7b\u578b", "program": [ "print('123')", "print(123)", "print(123 == '123')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6670,13 +6281,13 @@ "step": "different_types_look_same" }, { - "page": "Types", + "get_solution": "program", + "page": "\u7c7b\u578b", "program": [ "print(123 + 456)", "print('123' + '456')" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "579\n123456", @@ -6687,7 +6298,7 @@ "123456\n'123456'", "579\n123456", "579\n'123456'", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -6700,13 +6311,13 @@ "step": "plus_has_two_meanings" }, { - "page": "Types", + "get_solution": "program", + "page": "\u7c7b\u578b", "program": [ "print(13 < 120)", "print('13' < '120')" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "True\nFalse", @@ -6715,7 +6326,7 @@ "True\nFalse", "False\nTrue", "False\nFalse", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -6728,13 +6339,13 @@ "step": "less_than_has_two_meanings" }, { - "page": "Types", + "get_solution": "program", + "page": "\u7c7b\u578b", "program": [ "print(sorted([120, 13, 0]))", "print(sorted(['120', '13', '0']))" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "[0, 13, 120]\n['0', '120', '13']", @@ -6745,7 +6356,7 @@ "[120, 13, 0]\n['0', '120', '13']", "[120, 13, 0]\n['13', '120', '0']", "[120, 13, 0]\n['120', '13', '0']", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -6758,21 +6369,21 @@ "step": "less_than_sorting_strings" }, { - "page": "Types", + "get_solution": "program", + "page": "\u7c7b\u578b", "program": [ "12 + '34'" ], "response": { - "message": "", "passed": true, "prediction": { - "answer": "Error", + "answer": "\u9519\u8bef", "choices": [ "46", "'46'", "1234", "'1234'", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -6786,11 +6397,13 @@ }, "frames": [ { + "filename": "/my_program.py", + "lineno": 1, "lines": [ { - "content": "12 + '34'", "is_current": true, "lineno": 1, + "text": "12 + '34'", "type": "line" } ], @@ -6805,7 +6418,7 @@ ], "text": [ "Traceback (most recent call last):", - " File \"my_program.py\", line 1, in ", + " File \"/my_program.py\", line 1, in ", "--> 1 | 12 + '34'", " ^^^^^^^^^", "", @@ -6823,7 +6436,7 @@ " print('Starting... ' + str(i + 1))", "print('Go!')" ], - "page": "Types", + "page": "\u7c7b\u578b", "program": [ "number = '1'", "for i in range(int(number)):", @@ -6831,7 +6444,6 @@ "print('Go!')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6843,18 +6455,8 @@ "step": "fixing_type_errors_with_conversion" }, { - "get_solution": [ - "def format_board(board):", - " first_row = ' '", - " for i in range(len(board)):", - " first_row += str(i + 1)", - " joined_rows = [first_row]", - " for i in range(len(board)):", - " joined_row = str(i + 1) + ''.join(board[i])", - " joined_rows.append(joined_row)", - " return \"\\n\".join(joined_rows)" - ], - "page": "Types", + "get_solution": "program", + "page": "\u7c7b\u578b", "program": [ "def format_board(board):", " first_row = ' '", @@ -6867,21 +6469,20 @@ " return \"\\n\".join(joined_rows)" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "format_board_with_numbers" }, { - "page": "Interactive Programs with input()", + "get_solution": "program", + "page": "\u4f7f\u7528 input() \u7684\u4e92\u52a8\u7a0b\u5e8f", "program": [ "print('Type your name, then press Enter:')", "name = input()", "print(f'Hello {name}!')" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6906,7 +6507,6 @@ }, { "get_solution": [ - "super_secret_number = 7", "print(\"What number am I thinking of?\")", "guess = input()", "if int(guess) == super_secret_number:", @@ -6914,7 +6514,7 @@ "else:", " print(\"Nope!\")" ], - "page": "Interactive Programs with input()", + "page": "\u4f7f\u7528 input() \u7684\u4e92\u52a8\u7a0b\u5e8f", "program": [ "super_secret_number = 7", "print(\"What number am I thinking of?\")", @@ -6925,7 +6525,6 @@ " print(\"Nope!\")" ], "response": { - "message": "", "passed": true, "result": [ { @@ -6949,7 +6548,8 @@ "step": "convert_input_to_int" }, { - "page": "Nested List Assignment: Playing Moves on the Board", + "get_solution": "program", + "page": "\u5d4c\u5957\u5217\u8868\u4f5c\u4e1a\uff1a\u5728\u68cb\u76d8\u4e0a\u8fdb\u884c\u79fb\u52a8", "program": [ "def play_move(board, player):", " board[1] = player", @@ -6962,7 +6562,6 @@ "play_game()" ], "response": { - "message": "", "passed": true, "prediction": { "answer": "[' ', 'X', ' ']", @@ -6976,7 +6575,7 @@ "['X', ' ', ' ']", "[' ', 'X', ' ']", "[' ', ' ', 'X']", - "Error" + "\u9519\u8bef" ] }, "result": [ @@ -6989,7 +6588,8 @@ "step": "modify_list_in_function" }, { - "page": "Nested List Assignment: Playing Moves on the Board", + "get_solution": "program", + "page": "\u5d4c\u5957\u5217\u8868\u4f5c\u4e1a\uff1a\u5728\u68cb\u76d8\u4e0a\u8fdb\u884c\u79fb\u52a8", "program": [ "def play_move(board, player):", " row = board[1]", @@ -7007,7 +6607,6 @@ "play_game()" ], "response": { - "message": "", "passed": true, "result": [ { @@ -7019,13 +6618,8 @@ "step": "nested_assignment_two_lines" }, { - "get_solution": [ - "def play_move(board, player):", - " row = int(input()) - 1", - " col = int(input()) - 1", - " board[row][col] = player" - ], - "page": "Nested List Assignment: Playing Moves on the Board", + "get_solution": "program", + "page": "\u5d4c\u5957\u5217\u8868\u4f5c\u4e1a\uff1a\u5728\u68cb\u76d8\u4e0a\u8fdb\u884c\u79fb\u52a8", "program": [ "def play_move(board, player):", " row = int(input()) - 1", @@ -7033,14 +6627,14 @@ " board[row][col] = player" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "nested_assignment_input" }, { - "page": "Making the Board", + "get_solution": "program", + "page": "\u5236\u4f5c\u68cb\u76d8", "program": [ "def make_board(size):", " row = []", @@ -7068,7 +6662,6 @@ "test()" ], "response": { - "message": "", "passed": true, "result": [ { @@ -7080,30 +6673,21 @@ "step": "naive_make_board" }, { - "page": "Making the Board", + "page": "\u5236\u4f5c\u68cb\u76d8", "program": [ "pass", "def make_board(size): return [[' '] * size] * size" ], "response": { - "message": "

    The sublists in the result are not all separate objects.

    ", + "message": "

    \u7ed9\u5b9a\u8fd9\u4e9b\u503c\uff1a

    \n
    size = 2\n
    \n

    \u4f60\u7684\u4ee3\u7801\u8f93\u51fa\uff1a

    \n
    [[' ', ' '], [' ', ' ']]\n
    \n

    \u54ea\u4e2a\u662f\u6b63\u786e\u7684\uff01

    \n

    \u7136\u800c\uff0c\u7ed3\u679c\u4e2d\u7684\u5b50\u5217\u8868\u5e76\u4e0d\u662f\u6240\u6709\u72ec\u7acb\u7684\u5bf9\u8c61\u3002

    ", "passed": false, "result": [] }, "step": "fix_make_board" }, { - "get_solution": [ - "def make_board(size):", - " board = []", - " for _ in range(size):", - " row = []", - " for _ in range(size):", - " row.append(' ')", - " board.append(row)", - " return board" - ], - "page": "Making the Board", + "get_solution": "program", + "page": "\u5236\u4f5c\u68cb\u76d8", "program": [ "def make_board(size):", " board = []", @@ -7115,7 +6699,6 @@ " return board" ], "response": { - "message": "", "passed": true, "result": [] }, @@ -7142,7 +6725,7 @@ "", " print_draw()" ], - "page": "The Full Tic-Tac-Toe Game", + "page": "\u5b8c\u6574\u7684\u4e95\u5b57\u68cb\u6e38\u620f", "program": [ "def winning_line(strings):", " strings = set(strings)", @@ -7205,10 +6788,445 @@ " print_draw()" ], "response": { - "message": "", "passed": true, "result": [] }, "step": "the_full_game" + }, + { + "get_solution": "program", + "page": "\u4ecb\u7ecd\u5b57\u5178", + "program": [ + "french = {'apple': 'pomme', 'box': 'boite'}" + ], + "response": { + "passed": true, + "result": [] + }, + "step": "first_dict" + }, + { + "page": "\u4ecb\u7ecd\u5b57\u5178", + "program": [ + "french = {}" + ], + "response": { + "message": "

    \u54ce\u5440\uff0c\u4f60\u9700\u8981\u5148\u8bbe\u7f6e french = {'apple': 'pomme', 'box': 'boite'}\uff0c\u624d\u80fd\u7ee7\u7eed\u3002

    ", + "passed": false, + "result": [] + }, + "step": "dict_access" + }, + { + "get_solution": "program", + "page": "\u4ecb\u7ecd\u5b57\u5178", + "program": [ + "french[0]" + ], + "response": { + "passed": true, + "result": [ + { + "data": [ + { + "didyoumean": [], + "exception": { + "message": "0", + "type": "KeyError" + }, + "frames": [ + { + "filename": "/my_program.py", + "lineno": 1, + "lines": [ + { + "is_current": true, + "lineno": 1, + "text": "french[0]", + "type": "line" + } + ], + "name": "", + "type": "frame", + "variables": [ + { + "name": "french\n", + "value": "{'apple': 'pomme', 'box': 'boite'}\n" + } + ] + } + ], + "friendly": "

    A KeyError is raised when a value is not found as a\nkey in a Python dict or in a similar object.

    \n

    The key 0 cannot be found in the dict french.

    ", + "tail": "" + } + ], + "text": [ + "Traceback (most recent call last):", + " File \"/my_program.py\", line 1, in ", + "--> 1 | french[0]", + " ^^^^^^^^^", + "french = {'apple': 'pomme', 'box': 'boite'}", + "", + "KeyError: 0" + ], + "type": "traceback" + } + ] + }, + "step": "dict_access" + }, + { + "page": "\u4ecb\u7ecd\u5b57\u5178", + "program": [ + "french = {}" + ], + "response": { + "message": "

    \u54ce\u5440\uff0c\u4f60\u9700\u8981\u5148\u8bbe\u7f6e french = {'apple': 'pomme', 'box': 'boite'}\uff0c\u624d\u80fd\u7ee7\u7eed\u3002

    ", + "passed": false, + "result": [] + }, + "step": "dict_access2" + }, + { + "get_solution": "program", + "page": "\u4ecb\u7ecd\u5b57\u5178", + "program": [ + "french['apple']" + ], + "response": { + "passed": true, + "result": [ + { + "text": "'pomme'\n", + "type": "stdout" + } + ] + }, + "step": "dict_access2" + }, + { + "page": "\u4ecb\u7ecd\u5b57\u5178", + "program": [ + "french = {}" + ], + "response": { + "message": "

    \u54ce\u5440\uff0c\u4f60\u9700\u8981\u5148\u8bbe\u7f6e french = {'apple': 'pomme', 'box': 'boite'}\uff0c\u624d\u80fd\u7ee7\u7eed\u3002

    ", + "passed": false, + "result": [] + }, + "step": "dict_access3" + }, + { + "get_solution": "program", + "page": "\u4ecb\u7ecd\u5b57\u5178", + "program": [ + "french['box']" + ], + "response": { + "passed": true, + "result": [ + { + "text": "'boite'\n", + "type": "stdout" + } + ] + }, + "step": "dict_access3" + }, + { + "page": "\u4ecb\u7ecd\u5b57\u5178", + "program": [ + "french = {}" + ], + "response": { + "message": "

    \u54ce\u5440\uff0c\u4f60\u9700\u8981\u5148\u8bbe\u7f6e french = {'apple': 'pomme', 'box': 'boite'}\uff0c\u624d\u80fd\u7ee7\u7eed\u3002

    ", + "passed": false, + "result": [] + }, + "step": "dict_access4" + }, + { + "get_solution": "program", + "page": "\u4ecb\u7ecd\u5b57\u5178", + "program": [ + "french['pomme']" + ], + "response": { + "passed": true, + "result": [ + { + "data": [ + { + "didyoumean": [], + "exception": { + "message": "'pomme'", + "type": "KeyError" + }, + "frames": [ + { + "filename": "/my_program.py", + "lineno": 1, + "lines": [ + { + "is_current": true, + "lineno": 1, + "text": "french['pomme']", + "type": "line" + } + ], + "name": "", + "type": "frame", + "variables": [ + { + "name": "french\n", + "value": "{'apple': 'pomme', 'box': 'boite'}\n" + } + ] + } + ], + "friendly": "

    A KeyError is raised when a value is not found as a\nkey in a Python dict or in a similar object.

    \n

    The key 'pomme' cannot be found in the dict french.

    ", + "tail": "" + } + ], + "text": [ + "Traceback (most recent call last):", + " File \"/my_program.py\", line 1, in ", + "--> 1 | french['pomme']", + " ^^^^^^^^^^^^^^^", + "french = {'apple': 'pomme', 'box': 'boite'}", + "", + "KeyError: 'pomme'" + ], + "type": "traceback" + } + ] + }, + "step": "dict_access4" + }, + { + "get_solution": "program", + "page": "\u5728\u5b9e\u8df5\u4e2d\u4f7f\u7528\u5b57\u5178", + "program": [ + "def total_cost(cart, prices):", + " result = 0", + " for item in cart:", + " price = prices[item]", + " result += price", + " return result" + ], + "response": { + "passed": true, + "result": [] + }, + "step": "shopping_cart1" + }, + { + "get_solution": "program", + "page": "\u5728\u5b9e\u8df5\u4e2d\u4f7f\u7528\u5b57\u5178", + "program": [ + "def total_cost(cart, quantities, prices):", + " result = 0", + " for item in cart:", + " price = prices[item]", + " quantity = quantities[item]", + " result += price * quantity", + " return result" + ], + "response": { + "passed": true, + "result": [] + }, + "step": "shopping_cart4" + }, + { + "get_solution": "program", + "page": "\u5728\u5b9e\u8df5\u4e2d\u4f7f\u7528\u5b57\u5178", + "program": [ + "def substitute(string):", + " result = ''", + " for char in string:", + " if char == 'A':", + " char = 'T'", + " elif char == 'T':", + " char = 'A'", + " elif char == 'G':", + " char = 'C'", + " elif char == 'C':", + " char = 'G'", + " result += char", + " return result", + "", + "original = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT'", + "expected = 'TCATCGCAGGAATCAATGTCCTACCGAATA'", + "assert_equal(substitute(original), expected)" + ], + "response": { + "passed": true, + "result": [ + { + "text": "OK\n", + "type": "stdout" + } + ] + }, + "step": "dna_part1" + }, + { + "get_solution": "program", + "page": "\u5728\u5b9e\u8df5\u4e2d\u4f7f\u7528\u5b57\u5178", + "program": [ + "def substitute(string, d):", + " result = \"\"", + " for letter in string:", + " result += d[letter]", + " return result" + ], + "response": { + "passed": true, + "result": [] + }, + "step": "dna_part2" + }, + { + "get_solution": "program", + "page": "\u904d\u5386\u5b57\u5178\u952e", + "program": [ + "quantities = {'apple': 1, 'cat': 10}", + "print(quantities.keys())" + ], + "response": { + "passed": true, + "result": [ + { + "text": "dict_keys(['apple', 'cat'])\n", + "type": "stdout" + } + ] + }, + "step": "introducing_keys" + }, + { + "get_solution": "program", + "page": "\u904d\u5386\u5b57\u5178\u952e", + "program": [ + "quantities = {'apple': 1, 'cat': 10}", + "for key in quantities.keys():", + " print(key)" + ], + "response": { + "passed": true, + "result": [ + { + "text": "apple\ncat\n", + "type": "stdout" + } + ] + }, + "step": "keys_are_iterable" + }, + { + "get_solution": "program", + "page": "\u904d\u5386\u5b57\u5178\u952e", + "program": [ + "quantities = {'apple': 1, 'cat': 10}", + "for key in quantities:", + " print(key)" + ], + "response": { + "passed": true, + "result": [ + { + "text": "apple\ncat\n", + "type": "stdout" + } + ] + }, + "step": "keys_are_iterable2" + }, + { + "get_solution": "program", + "page": "\u904d\u5386\u5b57\u5178\u952e", + "program": [ + "def total_cost(quantities, prices):", + " result = 0", + " for item in quantities:", + " price = prices[item]", + " quantity = quantities[item]", + " result += price * quantity", + " return result" + ], + "response": { + "passed": true, + "result": [] + }, + "step": "cleanup_shopping_cart" + }, + { + "get_solution": "program", + "page": "\u904d\u5386\u5b57\u5178\u952e", + "program": [ + "def print_words(french):", + " for word in french:", + " print(\"English: \" + word)", + " print(\"French: \" + french[word])", + " print(\"---\")" + ], + "response": { + "passed": true, + "result": [] + }, + "step": "english_to_french" + }, + { + "get_solution": "program", + "page": "\u904d\u5386\u5b57\u5178\u952e", + "program": [ + "def print_words(french, german):", + " for word in french:", + " print(\"English: \" + word)", + " print(\"French: \" + french[word])", + " print(\"German: \" + german[word])", + " print(\"---\")" + ], + "response": { + "passed": true, + "result": [] + }, + "step": "english_to_german" + }, + { + "get_solution": "program", + "page": "\u904d\u5386\u5b57\u5178\u952e", + "program": [ + "def print_words(words):", + " for word in words:", + " translations = words[word]", + "", + " print(f\"English: {word}\")", + " for language in translations:", + " print(f\"{language}: {translations[language]}\")", + " print(f\"---\")", + "", + "print_words({", + " 'apple': {", + " 'French': 'pomme',", + " 'German': 'apfel',", + " },", + " 'box': {", + " 'French': 'boite',", + " 'German': 'kasten',", + " },", + "})" + ], + "response": { + "passed": true, + "result": [ + { + "text": "English: apple\nFrench: pomme\nGerman: apfel\n---\nEnglish: box\nFrench: boite\nGerman: kasten\n---\n", + "type": "stdout" + } + ] + }, + "step": "nested_dictionaries" } ] \ No newline at end of file diff --git a/tests/test_frontend.py b/tests/test_frontend.py index 1b131463..c2028d2b 100644 --- a/tests/test_frontend.py +++ b/tests/test_frontend.py @@ -5,7 +5,6 @@ import pytest from selenium import webdriver -from selenium.webdriver import DesiredCapabilities from selenium.webdriver.chrome.options import Options from selenium.webdriver.common.by import By from selenium.webdriver.common.keys import Keys @@ -41,11 +40,8 @@ def get_driver(caps): options = Options() options.add_argument("--headless") options.add_argument("--disable-gpu") - desired_capabilities = DesiredCapabilities.CHROME - desired_capabilities["goog:loggingPrefs"] = {"browser": "ALL"} - driver = webdriver.Chrome( - options=options, desired_capabilities=desired_capabilities - ) + options.set_capability("goog:loggingPrefs", {"browser": "ALL"}) + driver = webdriver.Chrome(options=options) driver.set_window_size(1024, 768) driver.implicitly_wait(5) return driver @@ -100,7 +96,7 @@ def _tests(driver): driver.get("http://localhost:3000/course/#toc") # Go to page - driver.find_element_by_partial_link_text("Getting elements at a position").click() + driver.find_element(By.PARTIAL_LINK_TEXT, "Getting elements at a position").click() # Wait for page to load locator = (By.CSS_SELECTOR, ".book-text h1") @@ -110,49 +106,51 @@ def _tests(driver): assert driver.find_element(*locator).text.startswith( "Getting elements at a position" ) - assert driver.find_element_by_css_selector(".book-text p").text.startswith( + assert driver.find_element(By.CSS_SELECTOR, ".book-text p").text.startswith( "Looping is great" ) # Reverse buttons don't exist (developer mode is off) - assert not driver.find_elements_by_class_name("button-reverse-step"), "Is developer mode on?" + assert not driver.find_elements(By.CLASS_NAME, "button-reverse-step"), "Is developer mode on?" - assert driver.find_element_by_class_name("navbar").text.strip() == "Login / Sign up\nTable of Contents" + assert driver.find_element(By.CLASS_NAME, "navbar").text.strip() == "Login / Sign up\nTable of Contents" # Click on menu - driver.find_element_by_css_selector(".nav-item.custom-popup").click() + driver.find_element(By.CSS_SELECTOR, ".nav-item.custom-popup").click() assert ( - driver.find_element_by_class_name("menu-popup").text + driver.find_element(By.CLASS_NAME, "menu-popup").text == """\ Sign out Settings Feedback Español Français -தமிழ்""" +Polski +தமிழ் +中文""" ) # Open settings - settings_button = driver.find_element_by_css_selector(".menu-popup .btn.btn-primary") + settings_button = driver.find_element(By.CSS_SELECTOR, ".menu-popup .btn.btn-primary") assert settings_button.text.strip() == "Settings" settings_button.click() # Turn on developer mode - developer_mode_togle = driver.find_element_by_css_selector(".settings-modal label") + developer_mode_togle = driver.find_element(By.CSS_SELECTOR, ".settings-modal label") developer_mode_togle.click() # Reverse buttons exist now - reverse_button = driver.find_element_by_class_name("button-reverse-step") - skip_button = driver.find_element_by_class_name("button-skip-step") + reverse_button = driver.find_element(By.CLASS_NAME, "button-reverse-step") + skip_button = driver.find_element(By.CLASS_NAME, "button-skip-step") # Escape settings - driver.find_element_by_tag_name("html").send_keys(Keys.ESCAPE) + driver.find_element(By.TAG_NAME, "html").send_keys(Keys.ESCAPE) # Empty shell await_result(driver, "", ">>> ") # Run code in shell, check result - driver.find_element_by_css_selector(".terminal input").send_keys("12345\n") + driver.find_element(By.CSS_SELECTOR, ".terminal input").send_keys("12345\n") await_result( driver, "12345\n12345", @@ -162,9 +160,9 @@ def _tests(driver): >>> """, ) - editor = driver.find_element_by_css_selector("#editor textarea") - run_button = driver.find_element_by_css_selector(".editor-buttons .btn-primary") - snoop_button = driver.find_element_by_css_selector(".editor-buttons .btn-success") + editor = driver.find_element(By.CSS_SELECTOR, "#editor textarea") + run_button = driver.find_element(By.CSS_SELECTOR, ".editor-buttons .btn-primary") + snoop_button = driver.find_element(By.CSS_SELECTOR, ".editor-buttons .btn-success") # Run test_steps within futurecoder! run_code(editor, run_button, get_test_steps_code()) @@ -175,7 +173,7 @@ def _tests(driver): reverse_button.click() if ( "In general, you can get the element" - not in driver.find_element_by_css_selector(".book-text").text + not in driver.find_element(By.CSS_SELECTOR, ".book-text").text ): break sleep(0.1) @@ -183,7 +181,7 @@ def _tests(driver): pytest.fail() # Get code from instructions - code = driver.find_element_by_css_selector("#step-text-0 pre").text + code = driver.find_element(By.CSS_SELECTOR, "#step-text-0 pre").text assert ( code == """\ @@ -213,7 +211,7 @@ def _tests(driver): # Passed onto next step assert ( "In general, you can get the element" - in driver.find_element_by_css_selector(".book-text").text + in driver.find_element(By.CSS_SELECTOR, ".book-text").text ) # Run with snoop @@ -242,7 +240,7 @@ def _tests(driver): assert ( "As you can see, the result is the same" - in driver.find_element_by_css_selector(".book-text").text + in driver.find_element(By.CSS_SELECTOR, ".book-text").text ) # Correct answer first time @@ -261,7 +259,7 @@ def _tests(driver): predict_output(driver, editor, run_button, 1, 2) # Click OK - driver.find_element_by_css_selector(".submit-prediction button").click() + driver.find_element(By.CSS_SELECTOR, ".submit-prediction button").click() # Course has moved on to next step: indices_out_of_bounds # Let's skip to the end of this page @@ -270,15 +268,15 @@ def _tests(driver): skip_button.click() sleep(0.1) - force_click(driver, driver.find_element_by_class_name("next-button")) + force_click(driver, driver.find_element(By.CLASS_NAME, "next-button")) - assert "Given a list" in driver.find_element_by_css_selector(".book-text").text + assert "Given a list" in driver.find_element(By.CSS_SELECTOR, ".book-text").text - driver.find_element_by_css_selector(".assistant-hints .card-header").click() + driver.find_element(By.CSS_SELECTOR, ".assistant-hints .card-header").click() show_hints_and_solution(driver, num_hints=9, parsons=False) # Hidden solution contains correct text - code = driver.find_element_by_css_selector(".gradual-solution code") + code = driver.find_element(By.CSS_SELECTOR, ".gradual-solution code") assert ( code.text == """\ @@ -289,26 +287,26 @@ def _tests(driver): ) # Click button repeatedly to reveal solution - get_hint_button = driver.find_element_by_css_selector(".hints-popup .btn-primary") + get_hint_button = driver.find_element(By.CSS_SELECTOR, ".hints-popup .btn-primary") assert get_hint_button.text == "Reveal" scroll_to_bottom(driver) for i in range(24): - assert len(code.find_elements_by_class_name("solution-token-hidden")) == 24 - i - assert len(code.find_elements_by_class_name("solution-token-visible")) == 12 + i + assert len(code.find_elements(By.CLASS_NAME, "solution-token-hidden")) == 24 - i + assert len(code.find_elements(By.CLASS_NAME, "solution-token-visible")) == 12 + i get_hint_button.click() # Open assessment - force_click(driver, driver.find_element_by_css_selector(".assistant-assessment .card-header")) + force_click(driver, driver.find_element(By.CSS_SELECTOR, ".assistant-assessment .card-header")) # No messages visible - assert not driver.find_elements_by_class_name("assistant-messages-message") + assert not driver.find_elements(By.CLASS_NAME, "assistant-messages-message") # Run code which triggers a message run_code(editor, run_button, "12345") # Now we have a message assert ( - driver.find_element_by_css_selector(".assistant-messages-message").text + driver.find_element(By.CSS_SELECTOR, ".assistant-messages-message").text == """\ Your code should start like this: things = '...' @@ -330,7 +328,7 @@ def _tests(driver): # Now we have a message assert ( - driver.find_element_by_css_selector(".assistant-messages-message").text + driver.find_element(By.CSS_SELECTOR, ".assistant-messages-message").text == "You're almost there! However, this prints all the indices, not just the first one." ) @@ -340,7 +338,7 @@ def _tests(driver): sleep(0.2) # Step has passed, message has disappeared - assert not driver.find_elements_by_class_name("assistant-messages-message") + assert not driver.find_elements(By.CLASS_NAME, "assistant-messages-message") # Skip to zip_longest exercise skip_button.click() @@ -349,9 +347,9 @@ def _tests(driver): show_hints_and_solution(driver, num_hints=10, parsons=True) assert { - node.text - for node in driver.find_elements_by_css_selector(".parsons-droppable code") - } == set( + node.text + for node in driver.find_elements(By.CSS_SELECTOR, ".parsons-droppable code") + } == set( """\ length1 = len(string1) length2 = len(string2) @@ -372,7 +370,7 @@ def _tests(driver): ) # Cannot go to next page yet - assert not driver.find_elements_by_class_name("next-button") + assert not driver.find_elements(By.CLASS_NAME, "next-button") # Next button appears after completing last step # Scroll to end of page to get skip button out of the way @@ -380,19 +378,19 @@ def _tests(driver): sleep(0.1) driver.execute_script("window.scrollTo(0, document.body.scrollHeight);") sleep(0.1) - driver.find_element_by_class_name("next-button").click() + driver.find_element(By.CLASS_NAME, "next-button").click() # On next page sleep(0.1) assert ( - driver.find_element_by_css_selector(".book-text h1").text + driver.find_element(By.CSS_SELECTOR, ".book-text h1").text == "Terminology: Calling functions and methods" ) # Back to previous page - driver.find_element_by_class_name("previous-button").click() + driver.find_element(By.CLASS_NAME, "previous-button").click() sleep(0.1) - assert driver.find_element_by_css_selector(".book-text h1").text.startswith( + assert driver.find_element(By.CSS_SELECTOR, ".book-text h1").text.startswith( "Exercises with" ) @@ -404,8 +402,8 @@ def scroll_to_bottom(driver): def show_hints_and_solution(driver, *, num_hints, parsons): # Show all hints for hint_num in range(num_hints): - assert len(driver.find_elements_by_class_name("hint-body")) == hint_num - get_hint_button = driver.find_element_by_css_selector( + assert len(driver.find_elements(By.CLASS_NAME, "hint-body")) == hint_num + get_hint_button = driver.find_element(By.CSS_SELECTOR, ".hints-popup .btn-primary" ) assert get_hint_button.text == ( @@ -414,38 +412,40 @@ def show_hints_and_solution(driver, *, num_hints, parsons): scroll_to_bottom(driver) get_hint_button.click() if hint_num < num_hints - 1: - hints_progress = driver.find_element_by_css_selector( + hints_progress = driver.find_element(By.CSS_SELECTOR, ".hints-popup .hints-progress" ) assert hints_progress.text == f"Shown {hint_num + 1} of {num_hints} hints" # All hints are shown - assert len(driver.find_elements_by_class_name("hint-body")) == num_hints + assert len(driver.find_elements(By.CLASS_NAME, "hint-body")) == num_hints # Click 'Show solution' - get_hint_button = driver.find_element_by_css_selector(".hints-popup .btn-primary") + get_hint_button = driver.find_element(By.CSS_SELECTOR, ".hints-popup .btn-primary") assert get_hint_button.text == ("Show shuffled solution" if parsons else "Show solution") scroll_to_bottom(driver) get_hint_button.click() # Solution not yet visible - assert not driver.find_elements_by_css_selector(".gradual-solution") - assert not driver.find_elements_by_css_selector(".parsons-droppable") + assert not driver.find_elements(By.CSS_SELECTOR, ".gradual-solution") + assert not driver.find_elements(By.CSS_SELECTOR, ".parsons-droppable") # Are you sure? Click 'Yes' - get_hint_button = driver.find_element_by_css_selector(".hints-popup .btn-primary") + get_hint_button = driver.find_element(By.CSS_SELECTOR, ".hints-popup .btn-primary") assert get_hint_button.text == "Yes" scroll_to_bottom(driver) get_hint_button.click() # Exactly one kind of solution visible - assert bool(driver.find_elements_by_css_selector(".gradual-solution")) == (not parsons) - assert bool(driver.find_elements_by_css_selector(".parsons-droppable")) == parsons + assert bool(driver.find_elements(By.CSS_SELECTOR, ".gradual-solution")) == (not parsons) + assert bool(driver.find_elements(By.CSS_SELECTOR, ".parsons-droppable")) == parsons def run_code(editor, run_button, text): editor.send_keys(Keys.CONTROL + "a") editor.send_keys(Keys.BACK_SPACE) + editor.send_keys(Keys.COMMAND + "a") + editor.send_keys(Keys.BACK_SPACE) editor.send_keys(text) run_button.click() @@ -487,7 +487,7 @@ def predict_output(driver, editor, run_button, first_choice, second_choice): sleep(2) # Check the choices - choices = driver.find_elements_by_class_name("prediction-choice") + choices = driver.find_elements(By.CLASS_NAME, "prediction-choice") assert len(choices) == 6 # Click first choice @@ -498,7 +498,7 @@ def predict_output(driver, editor, run_button, first_choice, second_choice): check_choice_status(driver, first_choice, "selected") # Click Submit - driver.find_element_by_css_selector(".submit-prediction button").click() + driver.find_element(By.CSS_SELECTOR, ".submit-prediction button").click() sleep(0.1) check_choice_status(driver, first_choice, "correct" if is_correct else "wrong") @@ -507,7 +507,7 @@ def predict_output(driver, editor, run_button, first_choice, second_choice): bottom_text = "Correct!" else: bottom_text = "Oops, that's not right. You can try one more time!\nSubmit" - assert driver.find_element_by_css_selector(".submit-prediction").text == bottom_text + assert driver.find_element(By.CSS_SELECTOR, ".submit-prediction").text == bottom_text if is_correct: return @@ -523,7 +523,7 @@ def predict_output(driver, editor, run_button, first_choice, second_choice): check_choice_status(driver, second_choice, "selected") # Click Submit - driver.find_element_by_css_selector(".submit-prediction button").click() + driver.find_element(By.CSS_SELECTOR, ".submit-prediction button").click() sleep(0.1) check_choice_status(driver, first_choice, "wrong") @@ -533,17 +533,17 @@ def predict_output(driver, editor, run_button, first_choice, second_choice): bottom_text = "Correct!" else: bottom_text = "Sorry, wrong answer. Try again next time!\nOK" - assert driver.find_element_by_css_selector(".submit-prediction").text == bottom_text + assert driver.find_element(By.CSS_SELECTOR, ".submit-prediction").text == bottom_text def check_choice_status(driver, choice_index, status): - choices = driver.find_elements_by_class_name("prediction-choice") + choices = driver.find_elements(By.CLASS_NAME, "prediction-choice") choice = choices[choice_index] assert choice.get_attribute("class") == ( f"prediction-choice prediction-{status}" ), [ choice.get_attribute("class") - for choice in driver.find_elements_by_class_name("prediction-choice") + for choice in driver.find_elements(By.CLASS_NAME, "prediction-choice") ] diff --git a/tests/test_steps.py b/tests/test_steps.py index fb3bd426..12d0a4da 100644 --- a/tests/test_steps.py +++ b/tests/test_steps.py @@ -4,8 +4,6 @@ import re from pathlib import Path -from littleutils import only - import core.utils from core import translation as t from core.checker import check_entry, FullRunner @@ -99,6 +97,10 @@ def normalise_response(response, is_message, substep): message_sections = response.pop("message_sections") if not is_message: + if message_sections: + for section in message_sections: + for message in section['messages']: + print(message) assert not message_sections else: section = message_sections[0] diff --git a/translations/english.po b/translations/english.po index efd5978c..446198a0 100644 --- a/translations/english.po +++ b/translations/english.po @@ -1205,6 +1205,29 @@ msgstr "\"Nope!\"" msgid "code_bits.\"OK\"" msgstr "\"OK\"" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_input_test +#. +#. def buy_quantity(quantities, item, quantity): +#. quantities[item] = quantity +#. +#. def test(): +#. quantities = {} +#. for _ in range(3): +#. print('What would you like to buy?') +#. item = input() +#. +#. print('How many?') +#. quantity = int(input()) +#. +#. buy_quantity(quantities, item, quantity) +#. +#. print("OK, here's your cart so far:") +#. print(quantities) +#. +#. test() +msgid "code_bits.\"OK, here's your cart so far:\"" +msgstr "\"OK, here's your cart so far:\"" + #. https://poeditor.com/projects/view_terms?id=490053&search=pages.StringMethodsUnderstandingMutation.steps.string_lower_upper #. #. sentence = "Python rocks!" @@ -2512,6 +2535,29 @@ msgstr "'Hello there'" msgid "code_bits.'Hello'" msgstr "'Hello'" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_input_test +#. +#. def buy_quantity(quantities, item, quantity): +#. quantities[item] = quantity +#. +#. def test(): +#. quantities = {} +#. for _ in range(3): +#. print('What would you like to buy?') +#. item = input() +#. +#. print('How many?') +#. quantity = int(input()) +#. +#. buy_quantity(quantities, item, quantity) +#. +#. print("OK, here's your cart so far:") +#. print(quantities) +#. +#. test() +msgid "code_bits.'How many?'" +msgstr "'How many?'" + #. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.first_if_else #. #. condition = True @@ -2703,6 +2749,29 @@ msgstr "'This'" msgid "code_bits.'Type your name, then press Enter:'" msgstr "'Type your name, then press Enter:'" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_input_test +#. +#. def buy_quantity(quantities, item, quantity): +#. quantities[item] = quantity +#. +#. def test(): +#. quantities = {} +#. for _ in range(3): +#. print('What would you like to buy?') +#. item = input() +#. +#. print('How many?') +#. quantity = int(input()) +#. +#. buy_quantity(quantities, item, quantity) +#. +#. print("OK, here's your cart so far:") +#. print(quantities) +#. +#. test() +msgid "code_bits.'What would you like to buy?'" +msgstr "'What would you like to buy?'" + #. https://poeditor.com/projects/view_terms?id=490053&search=pages.BasicForLoopExercises.steps.loop_exercise_1 #. #. name = 'World' @@ -3185,6 +3254,21 @@ msgstr "'abcqwe'" msgid "code_bits.'aeiou'" msgstr "'aeiou'" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.text +#. +#. def make_english_to_german(english_to_french, french_to_german): +#. ... +#. +#. assert_equal( +#. make_english_to_german( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'pomme': 'apfel', 'boite': 'kasten'}, +#. ), +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +#. +#. ------ +#. #. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german.text #. #. def print_words(french, german): @@ -3221,6 +3305,66 @@ msgstr "'aeiou'" msgid "code_bits.'apfel'" msgstr "'apfel'" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.avocado_or_lawyer +#. +#. def swap_keys_values(d): +#. new_dict = {} +#. for key in d: +#. new_dict[d[key]] = key +#. return new_dict +#. +#. print(swap_keys_values({'apple': 'pomme', 'avocado': 'avocat', 'lawyer': 'avocat'})) +#. print(swap_keys_values({'apple': 'pomme', 'lawyer': 'avocat', 'avocado': 'avocat'})) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.text +#. +#. def make_english_to_german(english_to_french, french_to_german): +#. ... +#. +#. assert_equal( +#. make_english_to_german( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'pomme': 'apfel', 'boite': 'kasten'}, +#. ), +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise.text +#. +#. def swap_keys_values(d): +#. ... +#. +#. assert_equal( +#. swap_keys_values({'apple': 'pomme', 'box': 'boite'}), +#. {'pomme': 'apple', 'boite': 'box'}, +#. ) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.text +#. +#. def total_cost_per_item(quantities, prices): +#. totals = {} +#. for item in quantities: +#. ___ = quantities[item] * prices[item] +#. return totals +#. +#. assert_equal( +#. total_cost_per_item({'apple': 2}, {'apple': 3, 'box': 5}), +#. {'apple': 6}, +#. ) +#. +#. assert_equal( +#. total_cost_per_item({'dog': 500, 'box': 2}, {'dog': 100, 'box': 5}), +#. {'dog': 50000, 'box': 10}, +#. ) +#. +#. ------ +#. #. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.text #. #. def total_cost(quantities, prices): @@ -3400,6 +3544,32 @@ msgstr "'apple'" msgid "code_bits.'are'" msgstr "'are'" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.avocado_or_lawyer +#. +#. def swap_keys_values(d): +#. new_dict = {} +#. for key in d: +#. new_dict[d[key]] = key +#. return new_dict +#. +#. print(swap_keys_values({'apple': 'pomme', 'avocado': 'avocat', 'lawyer': 'avocat'})) +#. print(swap_keys_values({'apple': 'pomme', 'lawyer': 'avocat', 'avocado': 'avocat'})) +msgid "code_bits.'avocado'" +msgstr "'avocado'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.avocado_or_lawyer +#. +#. def swap_keys_values(d): +#. new_dict = {} +#. for key in d: +#. new_dict[d[key]] = key +#. return new_dict +#. +#. print(swap_keys_values({'apple': 'pomme', 'avocado': 'avocat', 'lawyer': 'avocat'})) +#. print(swap_keys_values({'apple': 'pomme', 'lawyer': 'avocat', 'avocado': 'avocat'})) +msgid "code_bits.'avocat'" +msgstr "'avocat'" + #. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheEqualityOperator.steps.introducing_equality #. #. print(1 + 2 == 3) @@ -3408,6 +3578,33 @@ msgstr "'are'" msgid "code_bits.'bc'" msgstr "'bc'" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.text +#. +#. def make_english_to_german(english_to_french, french_to_german): +#. ... +#. +#. assert_equal( +#. make_english_to_german( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'pomme': 'apfel', 'boite': 'kasten'}, +#. ), +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise.text +#. +#. def swap_keys_values(d): +#. ... +#. +#. assert_equal( +#. swap_keys_values({'apple': 'pomme', 'box': 'boite'}), +#. {'pomme': 'apple', 'boite': 'box'}, +#. ) +#. +#. ------ +#. #. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_french.text #. #. def print_words(french): @@ -3459,6 +3656,104 @@ msgstr "'bc'" msgid "code_bits.'boite'" msgstr "'boite'" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.text +#. +#. def buy_quantity(quantities, item, quantity): +#. ... +#. +#. def test(): +#. quantities = {} +#. buy_quantity(quantities, 'dog', 500) +#. assert_equal(quantities, {'dog': 500}) +#. buy_quantity(quantities, 'box', 2) +#. assert_equal(quantities, {'dog': 500, 'box': 2}) +#. +#. test() +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.dict_assignment_valid +#. +#. quantities = {} +#. quantities['dog'] = 500 +#. quantities['box'] = 2 +#. print(quantities) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_append_reminder +#. +#. cart = [] +#. cart.append('dog') +#. cart.append('box') +#. print(cart) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_invalid +#. +#. cart = [] +#. cart[0] = 'dog' +#. cart[1] = 'box' +#. print(cart) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_reminder +#. +#. cart = ['dog', 'cat'] +#. cart[1] = 'box' +#. print(cart) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.text +#. +#. def make_english_to_german(english_to_french, french_to_german): +#. ... +#. +#. assert_equal( +#. make_english_to_german( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'pomme': 'apfel', 'boite': 'kasten'}, +#. ), +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise.text +#. +#. def swap_keys_values(d): +#. ... +#. +#. assert_equal( +#. swap_keys_values({'apple': 'pomme', 'box': 'boite'}), +#. {'pomme': 'apple', 'boite': 'box'}, +#. ) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.text +#. +#. def total_cost_per_item(quantities, prices): +#. totals = {} +#. for item in quantities: +#. ___ = quantities[item] * prices[item] +#. return totals +#. +#. assert_equal( +#. total_cost_per_item({'apple': 2}, {'apple': 3, 'box': 5}), +#. {'apple': 6}, +#. ) +#. +#. assert_equal( +#. total_cost_per_item({'dog': 500, 'box': 2}, {'dog': 100, 'box': 5}), +#. {'dog': 50000, 'box': 10}, +#. ) +#. +#. ------ +#. #. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.text #. #. def total_cost(quantities, prices): @@ -3582,6 +3877,14 @@ msgstr "'boite'" msgid "code_bits.'box'" msgstr "'box'" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_reminder +#. +#. cart = ['dog', 'cat'] +#. cart[1] = 'box' +#. print(cart) +#. +#. ------ +#. #. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.text #. #. def total_cost(quantities, prices): @@ -3723,6 +4026,77 @@ msgstr "'de'" msgid "code_bits.'def'" msgstr "'def'" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.text +#. +#. def buy_quantity(quantities, item, quantity): +#. ... +#. +#. def test(): +#. quantities = {} +#. buy_quantity(quantities, 'dog', 500) +#. assert_equal(quantities, {'dog': 500}) +#. buy_quantity(quantities, 'box', 2) +#. assert_equal(quantities, {'dog': 500, 'box': 2}) +#. +#. test() +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.dict_assignment_valid +#. +#. quantities = {} +#. quantities['dog'] = 500 +#. quantities['box'] = 2 +#. print(quantities) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_append_reminder +#. +#. cart = [] +#. cart.append('dog') +#. cart.append('box') +#. print(cart) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_invalid +#. +#. cart = [] +#. cart[0] = 'dog' +#. cart[1] = 'box' +#. print(cart) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_reminder +#. +#. cart = ['dog', 'cat'] +#. cart[1] = 'box' +#. print(cart) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.text +#. +#. def total_cost_per_item(quantities, prices): +#. totals = {} +#. for item in quantities: +#. ___ = quantities[item] * prices[item] +#. return totals +#. +#. assert_equal( +#. total_cost_per_item({'apple': 2}, {'apple': 3, 'box': 5}), +#. {'apple': 6}, +#. ) +#. +#. assert_equal( +#. total_cost_per_item({'dog': 500, 'box': 2}, {'dog': 100, 'box': 5}), +#. {'dog': 50000, 'box': 10}, +#. ) +#. +#. ------ +#. #. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.text #. #. def total_cost(quantities, prices): @@ -4102,6 +4476,21 @@ msgstr "'is'" msgid "code_bits.'jklmn'" msgstr "'jklmn'" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.text +#. +#. def make_english_to_german(english_to_french, french_to_german): +#. ... +#. +#. assert_equal( +#. make_english_to_german( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'pomme': 'apfel', 'boite': 'kasten'}, +#. ), +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +#. +#. ------ +#. #. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german.text #. #. def print_words(french, german): @@ -4168,6 +4557,19 @@ msgstr "'kasten'" msgid "code_bits.'kesha'" msgstr "'kesha'" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.avocado_or_lawyer +#. +#. def swap_keys_values(d): +#. new_dict = {} +#. for key in d: +#. new_dict[d[key]] = key +#. return new_dict +#. +#. print(swap_keys_values({'apple': 'pomme', 'avocado': 'avocat', 'lawyer': 'avocat'})) +#. print(swap_keys_values({'apple': 'pomme', 'lawyer': 'avocat', 'avocado': 'avocat'})) +msgid "code_bits.'lawyer'" +msgstr "'lawyer'" + #. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum #. #. words = ['This', 'is', 'a', 'list'] @@ -4220,6 +4622,46 @@ msgstr "'list'" msgid "code_bits.'on'" msgstr "'on'" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.avocado_or_lawyer +#. +#. def swap_keys_values(d): +#. new_dict = {} +#. for key in d: +#. new_dict[d[key]] = key +#. return new_dict +#. +#. print(swap_keys_values({'apple': 'pomme', 'avocado': 'avocat', 'lawyer': 'avocat'})) +#. print(swap_keys_values({'apple': 'pomme', 'lawyer': 'avocat', 'avocado': 'avocat'})) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.text +#. +#. def make_english_to_german(english_to_french, french_to_german): +#. ... +#. +#. assert_equal( +#. make_english_to_german( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'pomme': 'apfel', 'boite': 'kasten'}, +#. ), +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise.text +#. +#. def swap_keys_values(d): +#. ... +#. +#. assert_equal( +#. swap_keys_values({'apple': 'pomme', 'box': 'boite'}), +#. {'pomme': 'apple', 'boite': 'box'}, +#. ) +#. +#. ------ +#. #. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_french.text #. #. def print_words(french): @@ -4374,103 +4816,159 @@ msgstr "'you'" msgid "code_bits.Hello" msgstr "Hello" -#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.keys_are_iterable.text +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.text #. -#. __program_indented__ +#. def total_cost_per_item(quantities, prices): +#. totals = {} +#. for item in quantities: +#. ___ = quantities[item] * prices[item] +#. return totals #. -#. ------ +#. assert_equal( +#. total_cost_per_item({'apple': 2}, {'apple': 3, 'box': 5}), +#. {'apple': 6}, +#. ) #. -#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.nested_dictionaries.text +#. assert_equal( +#. total_cost_per_item({'dog': 500, 'box': 2}, {'dog': 100, 'box': 5}), +#. {'dog': 50000, 'box': 10}, +#. ) +msgid "code_bits.___" +msgstr "___" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.avocado_or_lawyer.text #. #. __program_indented__ #. #. ------ #. -#. https://poeditor.com/projects/view_terms?id=490053&search=pages.EqualsVsIs.steps.two_separate_lists.text +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_input_test.text #. #. __program_indented__ #. #. ------ #. -#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.append_vs_concatenate.text +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.dict_assignment_valid.text #. #. __program_indented__ #. #. ------ #. -#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.printing_the_range.text +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_append_reminder.text #. #. __program_indented__ #. #. ------ #. -#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.using_len_first_time.text +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_invalid.text #. #. __program_indented__ #. #. ------ #. -#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Indentation.steps.one_indented_line.text +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_reminder.text #. #. __program_indented__ #. #. ------ #. -#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Indentation.steps.two_indented_lines.text +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.keys_are_iterable.text #. #. __program_indented__ #. #. ------ #. -#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.first_input.text +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.nested_dictionaries.text #. #. __program_indented__ #. #. ------ #. -#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingBirdseye.steps.birdseye_loop_example.text +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.EqualsVsIs.steps.two_separate_lists.text #. #. __program_indented__ #. #. ------ #. -#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingBirdseye.steps.first_birdseye_example.text +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.append_vs_concatenate.text #. #. __program_indented__ #. #. ------ #. -#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingDictionaries.steps.first_dict.text +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.printing_the_range.text #. #. __program_indented__ #. #. ------ #. -#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingElif.steps.dna_example.text +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.using_len_first_time.text #. #. __program_indented__ #. #. ------ #. -#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.concatenate_string_number.text +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Indentation.steps.one_indented_line.text #. #. __program_indented__ #. #. ------ #. -#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotTrueOrTrue.text +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Indentation.steps.two_indented_lines.text #. #. __program_indented__ #. #. ------ #. -#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.InputAliceBob.text +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.first_input.text #. #. __program_indented__ #. #. ------ #. -#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.naive_make_board.text +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingBirdseye.steps.birdseye_loop_example.text +#. +#. __program_indented__ +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingBirdseye.steps.first_birdseye_example.text +#. +#. __program_indented__ +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingDictionaries.steps.first_dict.text +#. +#. __program_indented__ +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingElif.steps.dna_example.text +#. +#. __program_indented__ +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.concatenate_string_number.text +#. +#. __program_indented__ +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotTrueOrTrue.text +#. +#. __program_indented__ +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.InputAliceBob.text +#. +#. __program_indented__ +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.naive_make_board.text #. #. __program_indented__ #. @@ -4857,6 +5355,69 @@ msgstr "all_numbers" #. #. ------ #. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.text +#. +#. def buy_quantity(quantities, item, quantity): +#. ... +#. +#. def test(): +#. quantities = {} +#. buy_quantity(quantities, 'dog', 500) +#. assert_equal(quantities, {'dog': 500}) +#. buy_quantity(quantities, 'box', 2) +#. assert_equal(quantities, {'dog': 500, 'box': 2}) +#. +#. test() +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.text +#. +#. def make_english_to_german(english_to_french, french_to_german): +#. ... +#. +#. assert_equal( +#. make_english_to_german( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'pomme': 'apfel', 'boite': 'kasten'}, +#. ), +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise.text +#. +#. def swap_keys_values(d): +#. ... +#. +#. assert_equal( +#. swap_keys_values({'apple': 'pomme', 'box': 'boite'}), +#. {'pomme': 'apple', 'boite': 'box'}, +#. ) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.text +#. +#. def total_cost_per_item(quantities, prices): +#. totals = {} +#. for item in quantities: +#. ___ = quantities[item] * prices[item] +#. return totals +#. +#. assert_equal( +#. total_cost_per_item({'apple': 2}, {'apple': 3, 'box': 5}), +#. {'apple': 6}, +#. ) +#. +#. assert_equal( +#. total_cost_per_item({'dog': 500, 'box': 2}, {'dog': 100, 'box': 5}), +#. {'dog': 50000, 'box': 10}, +#. ) +#. +#. ------ +#. #. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.text #. #. def total_cost(quantities, prices): @@ -6422,6 +6983,52 @@ msgstr "board" msgid "code_bits.board_size" msgstr "board_size" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise +#. +#. def buy_quantity(quantities, item, quantity): +#. quantities[item] = quantity +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.text +#. +#. def buy_quantity(quantities, item, quantity): +#. ... +#. +#. def test(): +#. quantities = {} +#. buy_quantity(quantities, 'dog', 500) +#. assert_equal(quantities, {'dog': 500}) +#. buy_quantity(quantities, 'box', 2) +#. assert_equal(quantities, {'dog': 500, 'box': 2}) +#. +#. test() +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_input_test +#. +#. def buy_quantity(quantities, item, quantity): +#. quantities[item] = quantity +#. +#. def test(): +#. quantities = {} +#. for _ in range(3): +#. print('What would you like to buy?') +#. item = input() +#. +#. print('How many?') +#. quantity = int(input()) +#. +#. buy_quantity(quantities, item, quantity) +#. +#. print("OK, here's your cart so far:") +#. print(quantities) +#. +#. test() +msgid "code_bits.buy_quantity" +msgstr "buy_quantity" + #. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.crack_password_exercise #. #. letters = 'AB' @@ -6466,6 +7073,32 @@ msgstr "c3" msgid "code_bits.c4" msgstr "c4" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_append_reminder +#. +#. cart = [] +#. cart.append('dog') +#. cart.append('box') +#. print(cart) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_invalid +#. +#. cart = [] +#. cart[0] = 'dog' +#. cart[1] = 'box' +#. print(cart) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_reminder +#. +#. cart = ['dog', 'cat'] +#. cart[1] = 'box' +#. print(cart) +#. +#. ------ +#. #. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1 #. #. def total_cost(cart, prices): @@ -8612,6 +9245,57 @@ msgstr "doubles" msgid "code_bits.element" msgstr "element" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +#. +#. def make_english_to_german(english_to_french, french_to_german): +#. english_to_german = {} +#. for english in english_to_french: +#. french = english_to_french[english] +#. german = french_to_german[french] +#. english_to_german[english] = german +#. return english_to_german +msgid "code_bits.english" +msgstr "english" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +#. +#. def make_english_to_german(english_to_french, french_to_german): +#. english_to_german = {} +#. for english in english_to_french: +#. french = english_to_french[english] +#. german = french_to_german[french] +#. english_to_german[english] = german +#. return english_to_german +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.text +#. +#. def make_english_to_german(english_to_french, french_to_german): +#. ... +#. +#. assert_equal( +#. make_english_to_german( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'pomme': 'apfel', 'boite': 'kasten'}, +#. ), +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +msgid "code_bits.english_to_french" +msgstr "english_to_french" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +#. +#. def make_english_to_german(english_to_french, french_to_german): +#. english_to_german = {} +#. for english in english_to_french: +#. french = english_to_french[english] +#. german = french_to_german[french] +#. english_to_german[english] = german +#. return english_to_german +msgid "code_bits.english_to_german" +msgstr "english_to_german" + #. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner #. #. def row_winner(board): @@ -10302,6 +10986,18 @@ msgstr "format_board" msgid "code_bits.found" msgstr "found" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +#. +#. def make_english_to_german(english_to_french, french_to_german): +#. english_to_german = {} +#. for english in english_to_french: +#. french = english_to_french[english] +#. german = french_to_german[french] +#. english_to_german[english] = german +#. return english_to_german +#. +#. ------ +#. #. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_french #. #. def print_words(french): @@ -10374,6 +11070,33 @@ msgstr "found" msgid "code_bits.french" msgstr "french" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +#. +#. def make_english_to_german(english_to_french, french_to_german): +#. english_to_german = {} +#. for english in english_to_french: +#. french = english_to_french[english] +#. german = french_to_german[french] +#. english_to_german[english] = german +#. return english_to_german +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.text +#. +#. def make_english_to_german(english_to_french, french_to_german): +#. ... +#. +#. assert_equal( +#. make_english_to_german( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'pomme': 'apfel', 'boite': 'kasten'}, +#. ), +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +msgid "code_bits.french_to_german" +msgstr "french_to_german" + #. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings #. #. name = "Alice" @@ -10412,6 +11135,18 @@ msgstr "friend" msgid "code_bits.game_board" msgstr "game_board" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +#. +#. def make_english_to_german(english_to_french, french_to_german): +#. english_to_german = {} +#. for english in english_to_french: +#. french = english_to_french[english] +#. german = french_to_german[french] +#. english_to_german[english] = german +#. return english_to_german +#. +#. ------ +#. #. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german #. #. def print_words(french, german): @@ -10863,6 +11598,82 @@ msgstr "is_friend" msgid "code_bits.is_valid_percentage" msgstr "is_valid_percentage" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise +#. +#. def buy_quantity(quantities, item, quantity): +#. quantities[item] = quantity +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.text +#. +#. def buy_quantity(quantities, item, quantity): +#. ... +#. +#. def test(): +#. quantities = {} +#. buy_quantity(quantities, 'dog', 500) +#. assert_equal(quantities, {'dog': 500}) +#. buy_quantity(quantities, 'box', 2) +#. assert_equal(quantities, {'dog': 500, 'box': 2}) +#. +#. test() +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_input_test +#. +#. def buy_quantity(quantities, item, quantity): +#. quantities[item] = quantity +#. +#. def test(): +#. quantities = {} +#. for _ in range(3): +#. print('What would you like to buy?') +#. item = input() +#. +#. print('How many?') +#. quantity = int(input()) +#. +#. buy_quantity(quantities, item, quantity) +#. +#. print("OK, here's your cart so far:") +#. print(quantities) +#. +#. test() +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise +#. +#. def total_cost_per_item(quantities, prices): +#. totals = {} +#. for item in quantities: +#. totals[item] = quantities[item] * prices[item] +#. return totals +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.text +#. +#. def total_cost_per_item(quantities, prices): +#. totals = {} +#. for item in quantities: +#. ___ = quantities[item] * prices[item] +#. return totals +#. +#. assert_equal( +#. total_cost_per_item({'apple': 2}, {'apple': 3, 'box': 5}), +#. {'apple': 6}, +#. ) +#. +#. assert_equal( +#. total_cost_per_item({'dog': 500, 'box': 2}, {'dog': 100, 'box': 5}), +#. {'dog': 50000, 'box': 10}, +#. ) +#. +#. ------ +#. #. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart #. #. def total_cost(quantities, prices): @@ -11076,6 +11887,30 @@ msgstr "joined_row" msgid "code_bits.joined_rows" msgstr "joined_rows" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.avocado_or_lawyer +#. +#. def swap_keys_values(d): +#. new_dict = {} +#. for key in d: +#. new_dict[d[key]] = key +#. return new_dict +#. +#. print(swap_keys_values({'apple': 'pomme', 'avocado': 'avocat', 'lawyer': 'avocat'})) +#. print(swap_keys_values({'apple': 'pomme', 'lawyer': 'avocat', 'avocado': 'avocat'})) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise +#. +#. def swap_keys_values(d): +#. new_dict = {} +#. for key in d: +#. value = d[key] +#. new_dict[value] = key +#. return new_dict +#. +#. ------ +#. #. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.keys_are_iterable #. #. quantities = {'apple': 1, 'cat': 10} @@ -11335,6 +12170,12 @@ msgstr "lengths" msgid "code_bits.letter" msgstr "letter" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.final_text.text +#. +#. reverse = swap_keys_values(letters) +#. +#. ------ +#. #. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.crack_password_exercise #. #. letters = 'AB' @@ -12113,6 +12954,33 @@ msgstr "make_board" msgid "code_bits.make_cube" msgstr "make_cube" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +#. +#. def make_english_to_german(english_to_french, french_to_german): +#. english_to_german = {} +#. for english in english_to_french: +#. french = english_to_french[english] +#. german = french_to_german[french] +#. english_to_german[english] = german +#. return english_to_german +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.text +#. +#. def make_english_to_german(english_to_french, french_to_german): +#. ... +#. +#. assert_equal( +#. make_english_to_german( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'pomme': 'apfel', 'boite': 'kasten'}, +#. ), +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +msgid "code_bits.make_english_to_german" +msgstr "make_english_to_german" + #. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings #. #. name = "Alice" @@ -12680,6 +13548,30 @@ msgstr "middle" msgid "code_bits.name" msgstr "name" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.avocado_or_lawyer +#. +#. def swap_keys_values(d): +#. new_dict = {} +#. for key in d: +#. new_dict[d[key]] = key +#. return new_dict +#. +#. print(swap_keys_values({'apple': 'pomme', 'avocado': 'avocat', 'lawyer': 'avocat'})) +#. print(swap_keys_values({'apple': 'pomme', 'lawyer': 'avocat', 'avocado': 'avocat'})) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise +#. +#. def swap_keys_values(d): +#. new_dict = {} +#. for key in d: +#. value = d[key] +#. new_dict[value] = key +#. return new_dict +msgid "code_bits.new_dict" +msgstr "new_dict" + #. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheEqualityOperator.steps.if_equals_replacing_characters #. #. name = 'kesha' @@ -14640,6 +15532,36 @@ msgstr "present" msgid "code_bits.price" msgstr "price" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise +#. +#. def total_cost_per_item(quantities, prices): +#. totals = {} +#. for item in quantities: +#. totals[item] = quantities[item] * prices[item] +#. return totals +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.text +#. +#. def total_cost_per_item(quantities, prices): +#. totals = {} +#. for item in quantities: +#. ___ = quantities[item] * prices[item] +#. return totals +#. +#. assert_equal( +#. total_cost_per_item({'apple': 2}, {'apple': 3, 'box': 5}), +#. {'apple': 6}, +#. ) +#. +#. assert_equal( +#. total_cost_per_item({'dog': 500, 'box': 2}, {'dog': 100, 'box': 5}), +#. {'dog': 50000, 'box': 10}, +#. ) +#. +#. ------ +#. #. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart #. #. def total_cost(quantities, prices): @@ -15268,32 +16190,117 @@ msgstr "printed" msgid "code_bits.quadruple" msgstr "quadruple" -#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise #. -#. def total_cost(quantities, prices): -#. result = 0 -#. for item in quantities: -#. price = prices[item] -#. quantity = quantities[item] -#. result += price * quantity -#. return result +#. def buy_quantity(quantities, item, quantity): +#. quantities[item] = quantity #. #. ------ #. -#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.text +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.text #. -#. def total_cost(quantities, prices): -#. result = 0 -#. for item in ...: -#. price = prices[item] -#. quantity = quantities[item] -#. result += price * quantity -#. return result +#. def buy_quantity(quantities, item, quantity): +#. ... #. -#. assert_equal( -#. total_cost( -#. {'dog': 5000000, 'box': 2}, -#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. def test(): +#. quantities = {} +#. buy_quantity(quantities, 'dog', 500) +#. assert_equal(quantities, {'dog': 500}) +#. buy_quantity(quantities, 'box', 2) +#. assert_equal(quantities, {'dog': 500, 'box': 2}) +#. +#. test() +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_input_test +#. +#. def buy_quantity(quantities, item, quantity): +#. quantities[item] = quantity +#. +#. def test(): +#. quantities = {} +#. for _ in range(3): +#. print('What would you like to buy?') +#. item = input() +#. +#. print('How many?') +#. quantity = int(input()) +#. +#. buy_quantity(quantities, item, quantity) +#. +#. print("OK, here's your cart so far:") +#. print(quantities) +#. +#. test() +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.dict_assignment_valid +#. +#. quantities = {} +#. quantities['dog'] = 500 +#. quantities['box'] = 2 +#. print(quantities) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise +#. +#. def total_cost_per_item(quantities, prices): +#. totals = {} +#. for item in quantities: +#. totals[item] = quantities[item] * prices[item] +#. return totals +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.text +#. +#. def total_cost_per_item(quantities, prices): +#. totals = {} +#. for item in quantities: +#. ___ = quantities[item] * prices[item] +#. return totals +#. +#. assert_equal( +#. total_cost_per_item({'apple': 2}, {'apple': 3, 'box': 5}), +#. {'apple': 6}, +#. ) +#. +#. assert_equal( +#. total_cost_per_item({'dog': 500, 'box': 2}, {'dog': 100, 'box': 5}), +#. {'dog': 50000, 'box': 10}, +#. ) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart +#. +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in quantities: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.text +#. +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in ...: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. +#. assert_equal( +#. total_cost( +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, #. ), #. 500000010, #. ) @@ -15363,6 +16370,52 @@ msgstr "quadruple" msgid "code_bits.quantities" msgstr "quantities" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise +#. +#. def buy_quantity(quantities, item, quantity): +#. quantities[item] = quantity +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.text +#. +#. def buy_quantity(quantities, item, quantity): +#. ... +#. +#. def test(): +#. quantities = {} +#. buy_quantity(quantities, 'dog', 500) +#. assert_equal(quantities, {'dog': 500}) +#. buy_quantity(quantities, 'box', 2) +#. assert_equal(quantities, {'dog': 500, 'box': 2}) +#. +#. test() +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_input_test +#. +#. def buy_quantity(quantities, item, quantity): +#. quantities[item] = quantity +#. +#. def test(): +#. quantities = {} +#. for _ in range(3): +#. print('What would you like to buy?') +#. item = input() +#. +#. print('How many?') +#. quantity = int(input()) +#. +#. buy_quantity(quantities, item, quantity) +#. +#. print("OK, here's your cart so far:") +#. print(quantities) +#. +#. test() +#. +#. ------ +#. #. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart #. #. def total_cost(quantities, prices): @@ -15581,6 +16634,12 @@ msgstr "quantity" msgid "code_bits.result" msgstr "result" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.final_text.text +#. +#. reverse = swap_keys_values(letters) +msgid "code_bits.reverse" +msgstr "reverse" + #. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.times_table_exercise #. #. for left in range(12): @@ -17961,6 +19020,48 @@ msgstr "super_secret_number" msgid "code_bits.surround" msgstr "surround" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.avocado_or_lawyer +#. +#. def swap_keys_values(d): +#. new_dict = {} +#. for key in d: +#. new_dict[d[key]] = key +#. return new_dict +#. +#. print(swap_keys_values({'apple': 'pomme', 'avocado': 'avocat', 'lawyer': 'avocat'})) +#. print(swap_keys_values({'apple': 'pomme', 'lawyer': 'avocat', 'avocado': 'avocat'})) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.final_text.text +#. +#. reverse = swap_keys_values(letters) +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise +#. +#. def swap_keys_values(d): +#. new_dict = {} +#. for key in d: +#. value = d[key] +#. new_dict[value] = key +#. return new_dict +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise.text +#. +#. def swap_keys_values(d): +#. ... +#. +#. assert_equal( +#. swap_keys_values({'apple': 'pomme', 'box': 'boite'}), +#. {'pomme': 'apple', 'boite': 'box'}, +#. ) +msgid "code_bits.swap_keys_values" +msgstr "swap_keys_values" + #. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle.text #. #. temp = hello @@ -17975,6 +19076,45 @@ msgstr "surround" msgid "code_bits.temp" msgstr "temp" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.text +#. +#. def buy_quantity(quantities, item, quantity): +#. ... +#. +#. def test(): +#. quantities = {} +#. buy_quantity(quantities, 'dog', 500) +#. assert_equal(quantities, {'dog': 500}) +#. buy_quantity(quantities, 'box', 2) +#. assert_equal(quantities, {'dog': 500, 'box': 2}) +#. +#. test() +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_input_test +#. +#. def buy_quantity(quantities, item, quantity): +#. quantities[item] = quantity +#. +#. def test(): +#. quantities = {} +#. for _ in range(3): +#. print('What would you like to buy?') +#. item = input() +#. +#. print('How many?') +#. quantity = int(input()) +#. +#. buy_quantity(quantities, item, quantity) +#. +#. print("OK, here's your cart so far:") +#. print(quantities) +#. +#. test() +#. +#. ------ +#. #. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.final_text.text #. #. def make_board(size): @@ -18434,6 +19574,66 @@ msgstr "total" msgid "code_bits.total_cost" msgstr "total_cost" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise +#. +#. def total_cost_per_item(quantities, prices): +#. totals = {} +#. for item in quantities: +#. totals[item] = quantities[item] * prices[item] +#. return totals +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.text +#. +#. def total_cost_per_item(quantities, prices): +#. totals = {} +#. for item in quantities: +#. ___ = quantities[item] * prices[item] +#. return totals +#. +#. assert_equal( +#. total_cost_per_item({'apple': 2}, {'apple': 3, 'box': 5}), +#. {'apple': 6}, +#. ) +#. +#. assert_equal( +#. total_cost_per_item({'dog': 500, 'box': 2}, {'dog': 100, 'box': 5}), +#. {'dog': 50000, 'box': 10}, +#. ) +msgid "code_bits.total_cost_per_item" +msgstr "total_cost_per_item" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise +#. +#. def total_cost_per_item(quantities, prices): +#. totals = {} +#. for item in quantities: +#. totals[item] = quantities[item] * prices[item] +#. return totals +#. +#. ------ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.text +#. +#. def total_cost_per_item(quantities, prices): +#. totals = {} +#. for item in quantities: +#. ___ = quantities[item] * prices[item] +#. return totals +#. +#. assert_equal( +#. total_cost_per_item({'apple': 2}, {'apple': 3, 'box': 5}), +#. {'apple': 6}, +#. ) +#. +#. assert_equal( +#. total_cost_per_item({'dog': 500, 'box': 2}, {'dog': 100, 'box': 5}), +#. {'dog': 50000, 'box': 10}, +#. ) +msgid "code_bits.totals" +msgstr "totals" + #. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.nested_dictionaries #. #. def print_words(words): @@ -18526,6 +19726,17 @@ msgstr "upper" msgid "code_bits.valid_image" msgstr "valid_image" +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise +#. +#. def swap_keys_values(d): +#. new_dict = {} +#. for key in d: +#. value = d[key] +#. new_dict[value] = key +#. return new_dict +#. +#. ------ +#. #. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.index_predict_exercise.text #. #. some_list.index(value) @@ -19655,8 +20866,8 @@ msgstr "On the bright side, your code passed ${num} test(s)!" msgid "frontend.cancel" msgstr "Cancel" -msgid "frontend.chat_on_slack" -msgstr "Chat on Slack" +msgid "frontend.chat_on_discord" +msgstr "Chat on Discord" msgid "frontend.click_for_error_details" msgstr "Click for error details" @@ -20017,7 +21228,9 @@ msgid "misc_terms.expected_mode_pythontutor" msgstr "With your code in the editor, click the Python Tutor button." msgid "misc_terms.expected_mode_shell" -msgstr "Type your code directly in the shell after `>>>` and press Enter." +msgstr "" +"Type your code directly in the shell **after `>>>` and press Enter**. Don't type in the editor, which is above the " +"shell. Don't press 'Run' or other buttons at the top." msgid "misc_terms.expected_mode_snoop" msgstr "With your code in the editor, click the `snoop` button." @@ -21483,6 +22696,735 @@ msgstr "" msgid "pages.CombiningCompoundStatements.title" msgstr "Combining Compound Statements" +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. # __code0__: +#. __program_indented__ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.CreatingKeyValuePairs.steps.avocado_or_lawyer.text" +msgstr "" +"Magnificent!\n" +"\n" +"Jokes aside, it's important to remember how exactly this can go wrong. Just like multiple items in the store\n" +"can have the same price, multiple words in English can have the same translation in French. If the original dictionary\n" +"has duplicate *values*, what happens when you try to swap keys and values? Since dictionary keys must be unique,\n" +"some data will be lost.\n" +"\n" +"For example, 'avocat' in French can mean either 'avocado' and 'lawyer'. So it's easy to translate\n" +"'avocado' from English to French, but it's not so clear how to translate 'avocat' back to English.\n" +"Try to guess what the following code will print:\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise +msgid "pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.hints.0.text" +msgstr "The body of `buy_quantity` only needs one simple line of code." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise +msgid "pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.hints.1.text" +msgstr "It's similar to some of the lines in the previous step, but with variables instead of hardcoded values." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise +msgid "pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.hints.10.text" +msgstr "Replace `'dog'` with `item`." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise +msgid "pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.hints.11.text" +msgstr "Replace `500` with `quantity`." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise +msgid "pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.hints.12.text" +msgstr "Don't use `'item'` or `'quantity'`, use the variables `item` and `quantity` directly." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise +msgid "pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.hints.2.text" +msgstr "Be careful with quotes!" + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise +msgid "pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.hints.3.text" +msgstr "`'dog'` is an example of a value for `item`." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise +msgid "pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.hints.4.text" +msgstr "What would be an example of a value for `quantity`?" + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise +msgid "pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.hints.5.text" +msgstr "For `'dog'`, it was `500` above." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise +msgid "pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.hints.6.text" +msgstr "You're making a generic version of `quantities['dog'] = 500`." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise +msgid "pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.hints.7.text" +msgstr "The `quantities` part is fine as is." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise +msgid "pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.hints.8.text" +msgstr "Also keep the `[]` and `=`." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.buy_quantity_exercise +msgid "pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.hints.9.text" +msgstr "Remember that `item` is a variable, `'item'` is a string literal." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +msgid "pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.requirements" +msgstr "Your function should modify the `quantities` argument. It doesn't need to `return` or `print` anything." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. # __code0__: +#. def buy_quantity(quantities, item, quantity): +#. ... +#. +#. def test(): +#. quantities = {} +#. buy_quantity(quantities, 'dog', 500) +#. assert_equal(quantities, {'dog': 500}) +#. buy_quantity(quantities, 'box', 2) +#. assert_equal(quantities, {'dog': 500, 'box': 2}) +#. +#. test() +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27box%27 +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27dog%27 +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.buy_quantity +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.item +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.quantities +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.quantity +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.test +msgid "pages.CreatingKeyValuePairs.steps.buy_quantity_exercise.text" +msgstr "" +"That's exactly what we need. Whether the customer says they want 500 or 5 million dogs,\n" +"we can just put that information directly into our dictionary. So as an exercise, let's make a generic version of that.\n" +"Write a function `buy_quantity(quantities, item, quantity)` which adds a new key-value pair to the `quantities` dictionary.\n" +"Here's some starting code:\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"Note that `buy_quantity` should *modify* the dictionary that's passed in, and doesn't need to `return` or `print` anything.\n" +"You can assume that `item` isn't already in `quantities`." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. # __code0__: +#. __program_indented__ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.CreatingKeyValuePairs.steps.buy_quantity_input_test.text" +msgstr "" +"Well done! Try it out interactively:\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"Note the `int(input())` part, because `input()` returns a string, and `quantity` should be an integer\n" +"(a whole number). This'll break if you enter something that isn't a number, but that's OK for now." + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.dict_assignment_valid +msgid "pages.CreatingKeyValuePairs.steps.dict_assignment_valid.output_prediction_choices.0" +msgstr "{'dog': 500, 'box': 2}" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.dict_assignment_valid +msgid "pages.CreatingKeyValuePairs.steps.dict_assignment_valid.output_prediction_choices.1" +msgstr "{'dog': 2, 'box': 500}" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.dict_assignment_valid +msgid "pages.CreatingKeyValuePairs.steps.dict_assignment_valid.output_prediction_choices.2" +msgstr "{2: 'dog', 500: 'box'}" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.dict_assignment_valid +msgid "pages.CreatingKeyValuePairs.steps.dict_assignment_valid.output_prediction_choices.3" +msgstr "{500: 'dog', 2: 'box'}" + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. # __code0__: +#. __program_indented__ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.CreatingKeyValuePairs.steps.dict_assignment_valid.text" +msgstr "" +"Sorry, that's not allowed. For lists, subscript assignment only works for existing valid indices.\n" +"But that's not true for dictionaries! Try this:\n" +"\n" +"__code0__\n" +"\n" +"Note that `{}` means an empty dictionary, i.e. a dictionary with no key-value pairs.\n" +"This is similar to `[]` meaning an empty list or `\"\"` meaning an empty string." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. # __code0__: +#. reverse = swap_keys_values(letters) +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.letters +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.reverse +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.swap_keys_values +msgid "pages.CreatingKeyValuePairs.steps.final_text.text" +msgstr "" +"The result depends on the order of the keys in the original dictionary!\n" +"If you're not sure why, try running the code with `snoop` or another debugger.\n" +"\n" +"But there are many situations where you can be sure that the values in a dictionary *are* unique and that this\n" +"'inversion' makes sense. For example, we saw this code [earlier in the chapter](#UsingDictionaries):\n" +"\n" +" __copyable__\n" +" __no_auto_translate__\n" +" def substitute(string, d):\n" +" result = \"\"\n" +" for letter in string:\n" +" result += d[letter]\n" +" return result\n" +"\n" +" plaintext = 'helloworld'\n" +" encrypted = 'qpeefifmez'\n" +" letters = {'h': 'q', 'e': 'p', 'l': 'e', 'o': 'f', 'w': 'i', 'r': 'm', 'd': 'z'}\n" +" reverse = {'q': 'h', 'p': 'e', 'e': 'l', 'f': 'o', 'i': 'w', 'm': 'r', 'z': 'd'}\n" +" assert_equal(substitute(plaintext, letters), encrypted)\n" +" assert_equal(substitute(encrypted, reverse), plaintext)\n" +"\n" +"Now we can construct the `reverse` dictionary automatically:\n" +"\n" +"__code0__\n" +"\n" +"For this to work, we just have to make sure that all the values in `letters` are unique.\n" +"Otherwise it would be impossible to decrypt messages properly. If both `'h'` and `'j'` got replaced with `'q'`\n" +"during encryption, there would be no way to know whether `'qpeef'` means `'hello'` or `'jello'`!\n" +"\n" +"Congratulations! You've reached the end of the course so far. More is on the way!" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_append_reminder +msgid "pages.CreatingKeyValuePairs.steps.list_append_reminder.output_prediction_choices.1" +msgstr "['dog']" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_append_reminder +msgid "pages.CreatingKeyValuePairs.steps.list_append_reminder.output_prediction_choices.2" +msgstr "['box']" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_append_reminder +msgid "pages.CreatingKeyValuePairs.steps.list_append_reminder.output_prediction_choices.3" +msgstr "['dog', 'box']" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_append_reminder +msgid "pages.CreatingKeyValuePairs.steps.list_append_reminder.output_prediction_choices.4" +msgstr "['box', 'dog']" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_append_reminder +msgid "pages.CreatingKeyValuePairs.steps.list_append_reminder.output_prediction_choices.5" +msgstr "['dog', 'dog']" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_append_reminder +msgid "pages.CreatingKeyValuePairs.steps.list_append_reminder.output_prediction_choices.6" +msgstr "['box', 'box']" + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. # __code0__: +#. __program_indented__ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.CreatingKeyValuePairs.steps.list_append_reminder.text" +msgstr "" +"Now we'll learn how to add key-value pairs to a dictionary,\n" +"e.g. so that we can keep track of what the customer is buying.\n" +"Before looking at dictionaries, let's remind ourselves how to add items to a list. Run this program:\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_invalid +msgid "pages.CreatingKeyValuePairs.steps.list_assign_invalid.output_prediction_choices.1" +msgstr "['dog']" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_invalid +msgid "pages.CreatingKeyValuePairs.steps.list_assign_invalid.output_prediction_choices.2" +msgstr "['box']" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_invalid +msgid "pages.CreatingKeyValuePairs.steps.list_assign_invalid.output_prediction_choices.3" +msgstr "['dog', 'box']" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_invalid +msgid "pages.CreatingKeyValuePairs.steps.list_assign_invalid.output_prediction_choices.4" +msgstr "['box', 'dog']" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_invalid +msgid "pages.CreatingKeyValuePairs.steps.list_assign_invalid.output_prediction_choices.5" +msgstr "['dog', 'dog']" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_invalid +msgid "pages.CreatingKeyValuePairs.steps.list_assign_invalid.output_prediction_choices.6" +msgstr "['box', 'box']" + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. # __code0__: +#. __program_indented__ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.CreatingKeyValuePairs.steps.list_assign_invalid.text" +msgstr "" +"What if we used that idea to create our list in the first place?\n" +"We know we want a list where `cart[0]` is `'dog'` and `cart[1]` is `'box'`, so let's just say that:\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_reminder +msgid "pages.CreatingKeyValuePairs.steps.list_assign_reminder.output_prediction_choices.0" +msgstr "['box']" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_reminder +msgid "pages.CreatingKeyValuePairs.steps.list_assign_reminder.output_prediction_choices.1" +msgstr "['dog', 'cat']" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_reminder +msgid "pages.CreatingKeyValuePairs.steps.list_assign_reminder.output_prediction_choices.2" +msgstr "['box', 'dog']" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_reminder +msgid "pages.CreatingKeyValuePairs.steps.list_assign_reminder.output_prediction_choices.3" +msgstr "['box', 'cat']" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_reminder +msgid "pages.CreatingKeyValuePairs.steps.list_assign_reminder.output_prediction_choices.4" +msgstr "['dog', 'box']" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_reminder +msgid "pages.CreatingKeyValuePairs.steps.list_assign_reminder.output_prediction_choices.5" +msgstr "['cat', 'box']" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_reminder +msgid "pages.CreatingKeyValuePairs.steps.list_assign_reminder.output_prediction_choices.6" +msgstr "['box', 'dog', 'cat']" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_reminder +msgid "pages.CreatingKeyValuePairs.steps.list_assign_reminder.output_prediction_choices.7" +msgstr "['dog', 'box', 'cat']" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.list_assign_reminder +msgid "pages.CreatingKeyValuePairs.steps.list_assign_reminder.output_prediction_choices.8" +msgstr "['dog', 'cat', 'box']" + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. # __code0__: +#. __program_indented__ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.CreatingKeyValuePairs.steps.list_assign_reminder.text" +msgstr "" +"Pretty simple. We can also change the value at an index, replacing it with a different one:\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +msgid "pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.hints.0.text" +msgstr "You need to create a new dictionary and fill it with key-value pairs depending on the two input dictionaries." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +msgid "pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.hints.1.text" +msgstr "You've seen code that does this before." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +msgid "pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.hints.10.text" +msgstr "The values should be German words, so they should come from the second dictionary." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +msgid "pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.hints.11.text" +msgstr "Specifically the keys of your dictionary should be the keys of the first dictionary." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +msgid "pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.hints.12.text" +msgstr "And the values of your dictionary should be the values of the second dictionary." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +msgid "pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.hints.13.text" +msgstr "What about the values of the first dictionary and the keys of the second dictionary? They're important." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +msgid "pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.hints.14.text" +msgstr "Look at the French words `'pomme'` and `'boite'` in the example test." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +msgid "pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.hints.15.text" +msgstr "The values of the first input dictionary are the keys of the second input dictionary." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +msgid "pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.hints.2.text" +msgstr "Specifically the previous step. The overall structure you want is similar to `total_cost_per_item`." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +msgid "pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.hints.3.text" +msgstr "Start by creating a new empty dictionary." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +msgid "pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.hints.4.text" +msgstr "Return the dictionary at the end. Then fill in the code in between." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +msgid "pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.hints.5.text" +msgstr "You need a `for` loop." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +msgid "pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.hints.6.text" +msgstr "The line `totals[item] = quantities[item] * prices[item]` from the previous step is close to what you need." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +msgid "pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.hints.7.text" +msgstr "You don't need to multiply anything with `*`, the names are different, and there's another difference in logic." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +msgid "pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.hints.8.text" +msgstr "Think about what the keys and values of the new dictionary should be." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise +msgid "pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.hints.9.text" +msgstr "The keys should be English words, so they should come from the first dictionary." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. # __code0__: +#. def make_english_to_german(english_to_french, french_to_german): +#. ... +#. +#. assert_equal( +#. make_english_to_german( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'pomme': 'apfel', 'boite': 'kasten'}, +#. ), +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27apfel%27 +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27apple%27 +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27boite%27 +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27box%27 +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27kasten%27 +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27pomme%27 +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.english_to_french +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.french_to_german +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.make_english_to_german +msgid "pages.CreatingKeyValuePairs.steps.make_english_to_german_exercise.text" +msgstr "" +"Perfect! This is like having a nice receipt full of useful information.\n" +"\n" +"Let's come back to the example of using dictionaries for translation. Suppose we have one dictionary\n" +"for translating from English to French, and another for translating from French to German.\n" +"Let's use that to create a dictionary that translates from English to German:\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise +msgid "pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise.hints.0.text" +msgstr "Don't modify the input dictionary `d`." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise +msgid "pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise.hints.1.text" +msgstr "You need to create a new dictionary and fill it with key-value pairs depending on the input dictionary." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise +msgid "pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise.hints.2.text" +msgstr "" +"You've done this in the previous exercise. The overall structure you want is similar to `make_english_to_german`." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise +msgid "pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise.hints.3.text" +msgstr "It's actually even simpler, it just might feel weird." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise +msgid "pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise.hints.4.text" +msgstr "Start by creating a new empty dictionary. Return the dictionary at the end. Put a `for` loop in between." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise +msgid "pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise.hints.5.text" +msgstr "Think about what the keys and values of the new dictionary should be." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise +msgid "pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise.hints.6.text" +msgstr "There's only one possible thing for you to loop over." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise +msgid "pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise.hints.7.text" +msgstr "Use each key in the input dictionary `d` to get the corresponding value." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. # __code0__: +#. def swap_keys_values(d): +#. ... +#. +#. assert_equal( +#. swap_keys_values({'apple': 'pomme', 'box': 'boite'}), +#. {'pomme': 'apple', 'boite': 'box'}, +#. ) +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27apple%27 +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27boite%27 +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27box%27 +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27pomme%27 +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.swap_keys_values +msgid "pages.CreatingKeyValuePairs.steps.swap_keys_values_exercise.text" +msgstr "" +"Great job!\n" +"\n" +"Of course, language isn't so simple, and there are many ways that using a dictionary like this could go wrong.\n" +"So...let's do something even worse! Let's use an English-to-French dictionary to create a French-to-English dictionary.\n" +"Write a function which takes a dictionary returns a new dictionary where the keys and values are swapped,\n" +"so `a: b` becomes `b: a`.\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise +msgid "pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.hints.0.text" +msgstr "You only need to fill in the `___` part." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise +msgid "pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.hints.1.text" +msgstr "But if you want, you could also just put a variable name there, and then add a new line below it." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise +msgid "pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.hints.10.text" +msgstr "The dictionary is the thing that this function creates, builds, and returns." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise +msgid "pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.hints.11.text" +msgstr "i.e. `totals`." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise +msgid "pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.hints.12.text" +msgstr "Note how `'apple'` is a key in all three dictionaries in that test." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise +msgid "pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.hints.13.text" +msgstr "i.e. the dictionaries `quantities`, `prices`, and `totals`." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise +msgid "pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.hints.2.text" +msgstr "Look at the tests with `assert_equal`. In the first example, the expected output is `{'apple': 6}`. Why?" + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise +msgid "pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.hints.3.text" +msgstr "Because the customer bought 2 apples, and each apple costs 3, so the total cost is `2 * 3 = 6`." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise +msgid "pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.hints.4.text" +msgstr "" +"The `'box': 5` part is ignored because the customer didn't buy any boxes. It just means that the price of a box is 5." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise +msgid "pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.hints.5.text" +msgstr "You need to add a new key-value pair to a dictionary." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise +msgid "pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.hints.6.text" +msgstr "Identify the dictionary, the key, and the value." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise +msgid "pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.hints.7.text" +msgstr "They are all present in the given code already." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise +msgid "pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.hints.8.text" +msgstr "The value is the total cost for that item, which is the quantity multiplied by the price." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise +msgid "pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.hints.9.text" +msgstr "i.e. `quantities[item] * prices[item]`." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +msgid "pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.requirements" +msgstr "Run the program above, but replace the `___` with the correct code." + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +#. +#. # __code0__: +#. def total_cost_per_item(quantities, prices): +#. totals = {} +#. for item in quantities: +#. ___ = quantities[item] * prices[item] +#. return totals +#. +#. assert_equal( +#. total_cost_per_item({'apple': 2}, {'apple': 3, 'box': 5}), +#. {'apple': 6}, +#. ) +#. +#. assert_equal( +#. total_cost_per_item({'dog': 500, 'box': 2}, {'dog': 100, 'box': 5}), +#. {'dog': 50000, 'box': 10}, +#. ) +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27apple%27 +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27box%27 +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27dog%27 +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.___ +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.item +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.prices +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.quantities +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.total_cost_per_item +#. +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.totals +msgid "pages.CreatingKeyValuePairs.steps.total_cost_per_item_exercise.text" +msgstr "" +"Thanks for shopping with us! Let's see how much you just spent on each item.\n" +"\n" +"Earlier we defined a function `total_cost(quantities, prices)` which returned a single number\n" +"with a grand total of all the items in the cart. Now let's make a function `total_cost_per_item(quantities, prices)`\n" +"which returns a new dictionary with the total cost for each item:\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#CreatingKeyValuePairs +msgid "pages.CreatingKeyValuePairs.title" +msgstr "Creating Key-Value Pairs" + #. https://futurecoder.io/course/#DefiningFunctions #. #. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_function_name @@ -21719,7 +23661,7 @@ msgstr "" #. https://futurecoder.io/course/#DefiningFunctions msgid "pages.DefiningFunctions.steps.print_many.text" msgstr "" -"Functions can have many parameters. Here's an example:\n" +"Functions can have many parameters. Try the below example:\n" "\n" "__program_indented__" @@ -22072,7 +24014,10 @@ msgstr "" #. https://futurecoder.io/course/#DictionaryKeysAndValues msgid "pages.DictionaryKeysAndValues.steps.final_text.text" -msgstr "Congratulations! You've reached the end of the course so far. More is on the way!" +msgstr "" +"👌\n" +"\n" +"Now that you can *get* values from a dictionary, you'll soon learn how to *set* values in a dictionary." #. https://futurecoder.io/course/#DictionaryKeysAndValues msgid "pages.DictionaryKeysAndValues.steps.introducing_keys.requirements" @@ -22115,7 +24060,7 @@ msgstr "" #. https://futurecoder.io/course/#DictionaryKeysAndValues msgid "pages.DictionaryKeysAndValues.steps.keys_are_iterable2.requirements" msgstr "" -"Run the same code as the previous step, but without `.keys()`. after `quantities`, so the middle line is `for key in " +"Run the same code as the previous step, but without `.keys()` after `quantities`, so the middle line is `for key in " "quantities:`" #. https://futurecoder.io/course/#DictionaryKeysAndValues diff --git a/translations/locales/en/LC_MESSAGES/futurecoder.mo b/translations/locales/en/LC_MESSAGES/futurecoder.mo index 58291986..4615d9cf 100644 Binary files a/translations/locales/en/LC_MESSAGES/futurecoder.mo and b/translations/locales/en/LC_MESSAGES/futurecoder.mo differ diff --git a/translations/locales/es/LC_MESSAGES/futurecoder.mo b/translations/locales/es/LC_MESSAGES/futurecoder.mo index 9e8294d2..e585db7c 100644 Binary files a/translations/locales/es/LC_MESSAGES/futurecoder.mo and b/translations/locales/es/LC_MESSAGES/futurecoder.mo differ diff --git a/translations/locales/es/index.html b/translations/locales/es/index.html index 51df2f18..b21948ac 100644 --- a/translations/locales/es/index.html +++ b/translations/locales/es/index.html @@ -21,25 +21,33 @@
    -
    - +
    -
    +
    English + + + Français + + Polski + தமிழ் + + 中文 + Github @@ -52,17 +60,17 @@
    -

    +

    futurecoder

    -

    +

    Learn Python from scratch.

    -
    +
    @@ -81,7 +89,7 @@

    Redefines interactive learning

    -
    +
    @@ -102,7 +110,7 @@

    100% Free & Open Source

    -
    +
    @@ -123,7 +131,7 @@

    Designed with care for beginners

    -
    +
    Start learning @@ -150,7 +158,7 @@

    Designed with care for beginners

    -
    +
    @@ -197,7 +205,7 @@

    See what others think

    GitHub
    - 1000+ + 1300+
    @@ -432,7 +440,7 @@
    We mean to achieve this by:

    Interested in contributing code or course content?


    - +    Check out the contribution guide on GitHub
    @@ -447,9 +455,9 @@

    Interested in contributing code or course content?

    Contact Us

    -    - - Chat on Slack +    + + Chat on Discord

    @@ -491,7 +499,7 @@

    Contact Us

    - © 2021 Alex Hall + © 2025 Alex Hall                    Language icon created by Freepik - Flaticon
    @@ -528,14 +536,22 @@

    Contact Us

    - diff --git a/translations/locales/fr/LC_MESSAGES/futurecoder.mo b/translations/locales/fr/LC_MESSAGES/futurecoder.mo index ec7107f2..de8cb6ea 100644 Binary files a/translations/locales/fr/LC_MESSAGES/futurecoder.mo and b/translations/locales/fr/LC_MESSAGES/futurecoder.mo differ diff --git a/translations/locales/fr/index.html b/translations/locales/fr/index.html index 310b16e3..179bd9a4 100644 --- a/translations/locales/fr/index.html +++ b/translations/locales/fr/index.html @@ -27,7 +27,6 @@
    -
    @@ -35,19 +34,27 @@
    + data-aos-delay="0">
    -
    +
    English Español + + + + + Polski + தமிழ் + + 中文 + Github @@ -62,18 +69,18 @@

    + data-aos-delay="100"> futurecoder

    + data-aos-delay="200"> Le code du futur, c'est vous !

    -
    @@ -104,7 +111,7 @@

    Du nouveau dans les cours en ligne interactifs

    -
    @@ -142,7 +149,7 @@

    100 % Libre et Open-Source

    -
    @@ -171,7 +178,7 @@

    Spécialement adapté si vous débutez en Python - @@ -384,7 +391,7 @@

    Puzzle de Parsons

    Si un étudiant est bloqué malgré les différentes aides proposées, la solution lui est fournie dans le désordre... À lui de la réorganiser. - + Il peut ainsi progresser facilement sans pour autant arrêter de réfléchir !

    @@ -507,7 +514,7 @@
    Comment faire ?

    Vous souhaitez participer au développement ou proposer du contenu ?


    -    Visitez la page du projet sur GitHub @@ -523,10 +530,10 @@

    Vous souhaitez participer au développement ou proposer d

    Contacts

    -    +    - Discuter sur Slack + href="https://discord.gg/KwWvQCPBjW"> + Discuter sur Discord

    @@ -567,7 +574,7 @@

    Contacts

    -
    © 2021 Alex Hall
    +
    © 2025 Alex Hall
    + + + + தமிழ் + + + 中文 + + + Github + +
    +
    +

    +
    +
    +
    +
    +
    +
    +

    + futurecoder +

    +

    + Learn Python from scratch. +

    + + +
    +
    +
    +
    +
    +
    + + + + + + + + + +
    +

    Redefines interactive learning

    +
    + +
    +
    +
    +
    +
    +
    + + + + + + + + + + + +
    +

    100% Free & Open Source

    +
    + +
    +
    +
    +
    +
    +
    + + + + + + + +
    +

    Designed with care for beginners

    +
    + +
    +
    +
    +
    + + + + +
    +
    +
    + +
    +
    +
    +
    + +
    +
    +
    + +
    +
    + +
    +
    +
    + +
    + + +
    +
    +

    See what others think

    +
    +
    + +
    + + r/LearnProgramming +
    +
    + 1786 + 36 + 118 +
    +     +
    +
    + +
    + + r/InternetIsBeautiful +
    +
    + 560 + 6 + 37 +
    +     +
    +
    + +
    + + GitHub +
    +
    + 1300+ +
    +     +
    +
    + + I use w3schools and other apps but + + this is by far the best interactive app I can find + + right now. Thanks so very much for making this. + +
    +
    + + This is brilliant! I love it! + I feel like it would have been + such an easy way to learn + I'm almost upset I didn't have it when I did. + +
    +
    + + Futurecoder was the + best interactive (or non-interactive) programming tutorial I've ever + encountered. + Great pace, perfect UI/UX. + +
    +
    + + I like this way better than Codecademy. + You are 99% active learning while doing the exercises. + More classes need to be taught this way! I love it! + +
    +
    + + Amazing resource. + This was extremely well put together. + A lot of courses could use this treatment. + +
    +
    + + Hands down, the best learning experience I've had. + The encouraging, down-to-earth language and no lectures at all suited me well. + +
    +
    + + The single best tool that has helped me think better. + I have been devouring it. + I find it so interesting when others can't hold my attention. + +
    +
    + + It's meant to be as easy and fast as possible. + I learned Python's basics within a week. + I attribute where I'm at now to this site. + +
    +
    + + Honestly I never had any interest in coding, but your course is + really easy to use + so I'm learning programming everyday. + +
    +
    +
    +
    + +
    +
    +
    +

    Take a peek inside!

    +
    +
    + +
    +
    +
    + +
    +
    +
    +
    +

    Fully Interactive

    +
    +

    + Users must run code in the provided editor or shell and answer questions to advance. +

    +
    +
    + +
    +
    +
    +

    Easy Debugging

    +
    +
    +
    +

    + With a single click, users can run powerful debuggers to visualise execution and find problems. + There are three debuggers, each with their own strengths: + Python Tutor, Snoop, and + Bird's Eye (pictured). +

    +
    +
    + +
    +
    + +
    +
    + +
    +
    +
    +
    +

    Enhanced Error Messages

    +
    +

    + Normal Python tracebacks are intimidating to beginners. + futurecoder removes the fear and makes them helpful instead. +

    +
    +
    + +
    +
    +
    +

    Parsons Problems

    +
    +
    +

    + If a student is stuck trying to solve an exercise, and they've exhausted all the hints, + they can try putting the shuffled solution in the correct order instead. + This ensures they still apply their mind while reducing frustration. +

    +
    +
    + +
    +
    + +
    +
    + +
    +
    +
    +
    +

    Solution Breadcrumbs

    +
    +

    + As a last resort, students can gradually reveal the solution until they have enough + information to fill in the remaining gaps themselves. +

    +
    +
    + +

    + This is just a sample of the features. +
    For more, watch the video below for more information or + get started immediately! +

    +
    + +
    +
    + +
    +
    +
    +

    Watch a demo of the features and benefits:

    + +
    + +
    +
    +
    +
    + +
    +
    +
    +

    Want to receive updates about futurecoder?

    +
    +
    + + + +
    +
    +
    + +
    +
    +
    + +
    +
    +

    About

    +

    + futurecoder is a free and open-source platform and course for + complete beginners to teach themselves programming in Python. +

    +
    The long-term goals of futurecoder are ambitious:
    +
      +
    • Revolutionise computing education. We believe current learn-to-code platforms could be so much better.
      • +
    • Make the best learning resource possible which everyone can contribute to and improve
      • +
    • Allow anyone to learn programming on their own, regardless of background or talent
      • +
    +
    We mean to achieve this by:
    +
      +
    • Keeping students engaged and interested as they learn to write real code
      • +
    • Providing powerful tools that are easy to use to prevent frustration
      • +
    • Teaching Python, widely considered to be the best language to learn first + as well as the most popular language in real applications.
      • +
    • Consistently iterating with an open-source codebase
      • +
    +
    +
    +
    + +
    +
    +
    +

    + This is a never-ending project. + There is lots of work to do to make this site bigger and better. + All kinds of help are needed and greatly appreciated! +

    +
    +
    + + +

    Interested in contributing code or course content?

    +
    + +    Check out the contribution guide on GitHub + +
    +
    + +
    +
    + +
    +
    +
    +
    +

    Contact Us

    +

    +    + + Chat on Discord + +

    +

    +    + + Open an Issue on GitHub + +

    +

    +

    +    + + hello@futurecoder.io + +

    +
    +
    +
    + + +
    + + +
    + + + + + + + diff --git a/translations/locales/ta/LC_MESSAGES/futurecoder.mo b/translations/locales/ta/LC_MESSAGES/futurecoder.mo index 4367bb98..e13443cc 100644 Binary files a/translations/locales/ta/LC_MESSAGES/futurecoder.mo and b/translations/locales/ta/LC_MESSAGES/futurecoder.mo differ diff --git a/translations/locales/ta/index.html b/translations/locales/ta/index.html index 95e49baf..d9fc3525 100644 --- a/translations/locales/ta/index.html +++ b/translations/locales/ta/index.html @@ -21,16 +21,15 @@
    -
    - +
    -
    +
    English @@ -40,6 +39,15 @@ Français + + Polski + + + + + + 中文 + Github @@ -52,17 +60,17 @@
    -

    +

    எதிர்காலகுறியீட்டாளர்

    -

    +

    புதிதாக பைத்தானைக் கற்றுக்கொள்ளுங்கள்.

    -
    +
    @@ -81,7 +89,7 @@

    ஊடாடும் கற்றலை மறு

    -
    +
    @@ -102,7 +110,7 @@

    100% இலவச & திறந்த மூலம

    -
    +
    @@ -123,7 +131,7 @@

    ஆரம்பநிலையாளர்களு

    -
    +
    ஆரம்பநிலையாளர்களு
    -
    +
    @@ -201,7 +209,7 @@

    மற்றவர்கள் என்ன நினை GitHub

    - 1000+ + 1300+
    @@ -436,7 +444,7 @@
    இதை அடைய நாங்கள் சொல்கிறோம்:

    குறியீடு அல்லது பாடநெறி உள்ளடக்கத்தை பங்களிக்க ஆர்வமா?


    - +    GitHub கிட்மையத்தில் பங்களிப்பு வழிகாட்டியைப் பார்க்கவும்
    @@ -451,9 +459,9 @@

    குறியீடு அல்லது பாடந

    எங்களை தொடர்பு கொள்ள

    -    - - Slack சுலாக்கில் அரட்டை அடிக்கவும் +    + + Discord சுலாக்கில் அரட்டை அடிக்கவும்

    @@ -495,7 +503,7 @@

    எங்களை தொடர்பு கொள்ள

    - © 2021 Alex Hall + © 2025 Alex Hall                    மொழி ஐகான் உருவாக்கப்பட்டது ஃப்ரீபிக் Freepik - ஃபிளாட்டிகான் Flaticon
    @@ -537,14 +545,22 @@

    எங்களை தொடர்பு கொள்ள

    - diff --git a/translations/locales/zh/LC_MESSAGES/futurecoder.mo b/translations/locales/zh/LC_MESSAGES/futurecoder.mo index e79c1c48..65dfdc51 100644 Binary files a/translations/locales/zh/LC_MESSAGES/futurecoder.mo and b/translations/locales/zh/LC_MESSAGES/futurecoder.mo differ diff --git a/translations/locales/zh/LC_MESSAGES/futurecoder.po b/translations/locales/zh/LC_MESSAGES/futurecoder.po new file mode 100644 index 00000000..94052558 --- /dev/null +++ b/translations/locales/zh/LC_MESSAGES/futurecoder.po @@ -0,0 +1,25725 @@ +# +msgid "" +msgstr "" +"Language: zh\n" +"MIME-Version: 1.0\n" +"Content-Type: text/plain; charset=utf-8\n" +"Content-Transfer-Encoding: 8bit\n" +"Plural-Forms: nplurals=1; plural=0;\n" + +#. https://futurecoder.io/course/#AddingStrings +#. # __code0__: +#. 'hello ' + 'world' +#. 'hello' + ' world' +#. 'hello' + ' ' + 'world' +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27+world%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27hello%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27hello+%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27world%27 +msgid "pages.AddingStrings.steps.final_text.text" +msgstr "" +"做得好！以下任何一个都是有效的解决方案：\n" +"\n" +"__code0__" + +#. https://futurecoder.io/course/#AddingStrings +msgid "pages.AddingStrings.steps.hello_world_concat.text" +msgstr "" +"字符串可以使用 `+` 来相加，尽管这与数字相加的意思非常不同。例如，试试：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#AddingStrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.AddingStrings.steps.hello_world_space +msgid "pages.AddingStrings.steps.hello_world_space.hints.0.text" +msgstr "空格是一个字符，就像 `o` 或 `w` 一样。" + +#. https://futurecoder.io/course/#AddingStrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.AddingStrings.steps.hello_world_space +msgid "pages.AddingStrings.steps.hello_world_space.hints.1.text" +msgstr "空格字符必须在引号内的某个地方。" + +#. https://futurecoder.io/course/#AddingStrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.AddingStrings.steps.hello_world_space +msgid "" +"pages.AddingStrings.steps.hello_world_space.messages.literal_answer.text" +msgstr "你仍然必须将两个或更多字符串相加。" + +#. https://futurecoder.io/course/#AddingStrings +msgid "pages.AddingStrings.steps.hello_world_space.requirements" +msgstr "使用 `+` 将两个或更多字符串相加，使结果为字符串 `'hello world'`。" + +#. https://futurecoder.io/course/#AddingStrings +msgid "pages.AddingStrings.steps.hello_world_space.text" +msgstr "" +"你可以看到 `+` 将两个字符串连接在一起。技术上，这称为连接（concatenation）。\n" +"\n" +"这里有一个练习：稍微改变之前的代码，使结果为字符串 `'hello world'`，也就是在单词之间加一个空格。\n" +"\n" +"顺便说一下，如果你卡住了，可以点击右下角的灯泡图标获取提示。" + +#. https://futurecoder.io/course/#AddingStrings +msgid "pages.AddingStrings.title" +msgstr "添加字符串" + +#. https://futurecoder.io/course/#BasicForLoopExercises +msgid "pages.BasicForLoopExercises.steps.final_text.text" +msgstr "" +"我们进展得非常好！你正在解决问题并编写新代码！\n" +"让我们继续让事情变得更有趣。" + +#. https://futurecoder.io/course/#BasicForLoopExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BasicForLoopExercises.steps.loop_exercise_1 +msgid "pages.BasicForLoopExercises.steps.loop_exercise_1.hints.0.text" +msgstr "你只需要使用一个 `print`，因为每个 print 都会输出在不同的行上。" + +#. https://futurecoder.io/course/#BasicForLoopExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BasicForLoopExercises.steps.loop_exercise_1 +msgid "pages.BasicForLoopExercises.steps.loop_exercise_1.hints.1.text" +msgstr "你需要使用 `+`。" + +#. https://futurecoder.io/course/#BasicForLoopExercises +#. # __code0__: +#. name = 'World' +#. for character in name: +#. print(character) +#. print('---') +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27World%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.character +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.name +msgid "pages.BasicForLoopExercises.steps.loop_exercise_1.text" +msgstr "" +"该进行一些练习了！修改这个程序：\n" +"\n" +"__code0__\n" +"\n" +"使其输出：\n" +"\n" +" __no_auto_translate__\n" +" ---W\n" +" ---o\n" +" ---r\n" +" ---l\n" +" ---d" + +#. https://futurecoder.io/course/#BasicForLoopExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BasicForLoopExercises.steps.loop_exercise_2 +msgid "pages.BasicForLoopExercises.steps.loop_exercise_2.hints.0.text" +msgstr "暂时忘记循环。你会如何编写一个程序，使其打印 `name` 3 次？" + +#. https://futurecoder.io/course/#BasicForLoopExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BasicForLoopExercises.steps.loop_exercise_2 +msgid "pages.BasicForLoopExercises.steps.loop_exercise_2.hints.1.text" +msgstr "这个解决方案看起来和我们在这一部分看到的其他程序非常相似。" + +#. https://futurecoder.io/course/#BasicForLoopExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BasicForLoopExercises.steps.loop_exercise_2 +msgid "pages.BasicForLoopExercises.steps.loop_exercise_2.hints.2.text" +msgstr "for 循环会创建一个变量，比如 `character`，但程序不需要使用它。" + +#. https://futurecoder.io/course/#BasicForLoopExercises +msgid "pages.BasicForLoopExercises.steps.loop_exercise_2.text" +msgstr "" +"太棒了！现在写一个程序，使其为 `name` 中的每个字符打印一次 `name`。例如，对于 `name = 'Amy'`，它应该输出：\n" +"\n" +" __no_auto_translate__\n" +" Amy\n" +" Amy\n" +" Amy\n" +"\n" +"对于 `name = 'World'`，它应该输出：\n" +"\n" +" __no_auto_translate__\n" +" World\n" +" World\n" +" World\n" +" World\n" +" World\n" +"\n" +"顺便说一下，你可以在第一行将 `name` 设置为任何值。只有之后的程序部分会被检查。" + +#. https://futurecoder.io/course/#BasicForLoopExercises +msgid "pages.BasicForLoopExercises.title" +msgstr "基础 for 循环练习" + +#. https://futurecoder.io/course/#BasicTerminology +msgid "pages.BasicTerminology.steps.final_text.text" +msgstr "" +"你需要了解一些术语：\n" +"\n" +"一个 ***表达式*** 是一段有值的代码。例如，在这行代码中：\n" +"\n" +" __no_auto_translate__\n" +" sentence = 'Hello ' + name\n" +"\n" +"这里有三个表达式：\n" +"\n" +"1. `'Hello '`\n" +"2. `name`\n" +"3. `'Hello ' + name`\n" +"\n" +"相对而言，完整的行 `sentence = ...` 是一个 ***语句***。它是一个命令，告诉计算机执行一个动作。它没有自己的值。这意味着，例如，你不能将语句相加。以下代码是无效的：\n" +"\n" +" (word = 'Hello') + (name = 'Bob')\n" +"\n" +"具体来说，像 `sentence = ...` 这样的语句，其中一个变量被赋予一个值，称为 ***赋值*** - 这个值被 *赋给* 变量。\n" +"\n" +"程序是按顺序执行的语句列表。一个 `for` 循环是一个 *复合语句*，这意味着它有自己的主体，其中包含其他语句。大多数语句也会包含表达式，而表达式可以包含其他更小的表达式，但表达式不能包含语句。\n" +"\n" +"计算表达式值的过程称为 ***求值*** 。计算机 *求值* `1 + 2` 得到值 `3`。\n" +"\n" +"执行循环的过程称为 ***迭代***。像 `for char in 'Hello':` 这样的代码是在 *遍历* 字符串 `'Hello'`。能够做到这一点意味着字符串是 *可迭代的*。相对而言，数字是不可迭代的，如果你尝试 `for char in 3:`，Python 会告诉你这一点。每次循环的运行称为 *一次迭代*，所以在这个例子中将会有 5 次迭代。" + +#. https://futurecoder.io/course/#BasicTerminology +msgid "pages.BasicTerminology.title" +msgstr "基本术语" + +#. https://futurecoder.io/course/#BuildingNewLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.double_numbers +msgid "pages.BuildingNewLists.steps.double_numbers.hints.0.text" +msgstr "记住，你可以使用 `*` 来乘法运算。" + +#. https://futurecoder.io/course/#BuildingNewLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.double_numbers +msgid "pages.BuildingNewLists.steps.double_numbers.hints.1.text" +msgstr "这个程序的结构与之前你写的逐字符构建字符串的程序非常相似。" + +#. https://futurecoder.io/course/#BuildingNewLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.double_numbers +msgid "pages.BuildingNewLists.steps.double_numbers.hints.2.text" +msgstr "创建一个新列表，然后在 for 循环中逐个元素地构建它。" + +#. https://futurecoder.io/course/#BuildingNewLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.double_numbers +msgid "pages.BuildingNewLists.steps.double_numbers.hints.3.text" +msgstr "从一个空列表开始。" + +#. https://futurecoder.io/course/#BuildingNewLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.double_numbers +msgid "pages.BuildingNewLists.steps.double_numbers.hints.4.text" +msgstr "你可以通过写 `[x]` 来创建一个包含一个元素 `x` 的列表。" + +#. https://futurecoder.io/course/#BuildingNewLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.double_numbers +msgid "pages.BuildingNewLists.steps.double_numbers.hints.5.text" +msgstr "你可以通过添加一个包含一个元素的列表来向列表中添加一个元素。" + +#. https://futurecoder.io/course/#BuildingNewLists +#. # __code0__: +#. numbers = [1, 2] + [3, 4] +#. print(numbers) +#. new_numbers = [] +#. new_numbers += numbers +#. new_numbers += [5] +#. print(new_numbers) +#. # __code1__: +#. numbers = [3, 1, 4, 1, 5, 9, 2, 6, 5] +#. # __code2__: +#. [6, 2, 8, 2, 10, 18, 4, 12, 10] +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.new_numbers +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.numbers +msgid "pages.BuildingNewLists.steps.double_numbers.text" +msgstr "" +"列表和字符串有很多共同点。\n" +"例如，你可以将两个列表相加，将它们组合成一个新列表。\n" +"你也可以创建一个没有元素的空列表。\n" +"自己检查一下：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"有了这些知识，写一个程序，接受一个数字列表\n" +"并打印一个每个数字都被加倍的新列表。例如，给定：\n" +"\n" +"__code1__\n" +"\n" +"它将打印：\n" +"\n" +"__code2__" + +msgid "pages.BuildingNewLists.steps.filter_numbers.disallowed.0.message" +msgstr "做得好，正确！不过，你应该使用 `.append()` 而不是 `+=`。" + +#. https://futurecoder.io/course/#BuildingNewLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.filter_numbers +msgid "pages.BuildingNewLists.steps.filter_numbers.hints.0.text" +msgstr "这与之前的练习非常相似。" + +#. https://futurecoder.io/course/#BuildingNewLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.filter_numbers +msgid "pages.BuildingNewLists.steps.filter_numbers.hints.1.text" +msgstr "不同之处在于，有时你应该跳过向新列表添加元素。" + +#. https://futurecoder.io/course/#BuildingNewLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.filter_numbers +msgid "pages.BuildingNewLists.steps.filter_numbers.hints.2.text" +msgstr "使用 `if` 语句。" + +#. https://futurecoder.io/course/#BuildingNewLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.filter_numbers +msgid "pages.BuildingNewLists.steps.filter_numbers.hints.3.text" +msgstr "使用比较运算符来测试一个数字是否足够大以添加。" + +#. https://futurecoder.io/course/#BuildingNewLists +#. # __code2__: +#. numbers = [3, 1, 4, 1, 5, 9, 2, 6, 5] +#. # __code1__: +#. some_list.append(element) +#. # __code0__: +#. some_list += [element] +#. # __code3__: +#. [9, 6] +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.element +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.numbers +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.some_list +msgid "pages.BuildingNewLists.steps.filter_numbers.text" +msgstr "" +"太棒了！\n" +"\n" +"当你想将单个元素添加到列表的末尾时，实际上更常见的写法是：\n" +"\n" +"__code0__\n" +"\n" +"而不是：\n" +"\n" +"__code1__\n" +"\n" +"这两者之间并没有太大区别，但 `.append`\n" +"对大多数人来说会更熟悉和易读。\n" +"\n" +"现在使用 `.append` 写一个程序，接受一个数字列表并\n" +"打印一个只包含大于 5 的数字的新列表。\n" +"\n" +"例如，给定：\n" +"\n" +"__code2__\n" +"\n" +"它将打印：\n" +"\n" +"__code3__" + +#. https://futurecoder.io/course/#BuildingNewLists +msgid "pages.BuildingNewLists.steps.final_text.text" +msgstr "太棒了！我们正在取得很大进展。" + +#. https://futurecoder.io/course/#BuildingNewLists +msgid "pages.BuildingNewLists.title" +msgstr "创建新列表" + +#. https://futurecoder.io/course/#BuildingUpStrings +msgid "pages.BuildingUpStrings.steps.empty_string.text" +msgstr "" +"`name`中的最后一个字符只有在循环结束时才会被添加到`line`中，而此时`print(line)`已经最后一次运行过了。因此，该字符和完整的`name`永远不会在三角形的底部打印出来。如果你感到困惑，可以尝试将`print(line)`放在`line = line + char`之前和之后。\n" +"\n" +"让我们去掉输出中的那些`-`字符。你可能已经能够猜到怎么做了。\n" +"\n" +"一个*空字符串*是一个完全不包含任何字符的字符串。\n" +"它的写法就是一对没有内容的引号：`''`。\n" +"它就像字符串的零。\n" +"将它添加到另一个字符串中，只会得到另一个字符串，保持不变，\n" +"就像`0 + 5`只是`5`一样。\n" +"\n" +"在shell中尝试这个：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#BuildingUpStrings +msgid "pages.BuildingUpStrings.steps.final_text.text" +msgstr "" +"这不是很漂亮吗？\n" +"\n" +"从空开始并通过`for`循环逐步构建的模式是*非常*常见的\n" +"，你将会有很多练习机会。一些初始的空值是\n" +"`''`、`0`和`[]` - 一个空列表，你很快就会看到它。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.hello_plus_equals +msgid "" +"pages.BuildingUpStrings.steps.hello_plus_equals.output_prediction_choices.0" +msgstr "" +"Hello\n" +"Hello" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.hello_plus_equals +msgid "" +"pages.BuildingUpStrings.steps.hello_plus_equals.output_prediction_choices.1" +msgstr "" +"Hello\n" +"Hello!" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.hello_plus_equals +msgid "" +"pages.BuildingUpStrings.steps.hello_plus_equals.output_prediction_choices.2" +msgstr "" +"Hello!\n" +"Hello!" + +#. https://futurecoder.io/course/#BuildingUpStrings +msgid "pages.BuildingUpStrings.steps.hello_plus_equals.text" +msgstr "" +"在我们查看更多循环之前，我们需要快速学习另一个概念。看看这个程序：\n" +"\n" +"__program_indented__\n" +"\n" +"你觉得`hello = hello + '!'`这一行做了什么？运行程序来找出答案。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle +msgid "" +"pages.BuildingUpStrings.steps.name_triangle.output_prediction_choices.0" +msgstr "" +"-\n" +"W\n" +"-\n" +"o\n" +"-\n" +"r\n" +"-\n" +"l\n" +"-\n" +"d" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle +msgid "" +"pages.BuildingUpStrings.steps.name_triangle.output_prediction_choices.1" +msgstr "" +"-W\n" +"-o\n" +"-r\n" +"-l\n" +"-d" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle +msgid "" +"pages.BuildingUpStrings.steps.name_triangle.output_prediction_choices.2" +msgstr "-World" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle +msgid "" +"pages.BuildingUpStrings.steps.name_triangle.output_prediction_choices.3" +msgstr "-W-o-r-l-d" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle +msgid "" +"pages.BuildingUpStrings.steps.name_triangle.output_prediction_choices.4" +msgstr "" +"-W\n" +"-Wo\n" +"-Wor\n" +"-Worl\n" +"-World" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle +msgid "" +"pages.BuildingUpStrings.steps.name_triangle.output_prediction_choices.5" +msgstr "" +"-World\n" +"-Worl\n" +"-Wor\n" +"-Wo\n" +"-W" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle +msgid "" +"pages.BuildingUpStrings.steps.name_triangle.output_prediction_choices.6" +msgstr "" +"-World\n" +"-World\n" +"-World\n" +"-World\n" +"-World" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle +msgid "" +"pages.BuildingUpStrings.steps.name_triangle.output_prediction_choices.7" +msgstr "" +"-World\n" +"--World\n" +"---World\n" +"----World\n" +"-----World" + +#. https://futurecoder.io/course/#BuildingUpStrings +#. # __code0__: +#. temp = hello + '!' +#. hello = temp +#. # __code1__: +#. temp = hello +#. hello = temp + '!' +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.hello +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.temp +msgid "pages.BuildingUpStrings.steps.name_triangle.text" +msgstr "" +"Python并不在乎`hello`在`=`的左右两边，它只是像处理不同变量一样处理：它计算`hello + '!'`，此时是`'Hello' + '!'`，结果是`'Hello!'`，这就成为了`hello`的新值。如果有帮助的话，你可以将这一行想象成分成两个步骤：\n" +"\n" +"__code0__\n" +"\n" +"或者：\n" +"\n" +"__code1__\n" +"\n" +"这在循环中非常有用。尝试这个程序：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#BuildingUpStrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle_empty_string +msgid "pages.BuildingUpStrings.steps.name_triangle_empty_string.hints.0.text" +msgstr "首先确保你不是在使用这个页面上之前程序的损坏版本。" + +#. https://futurecoder.io/course/#BuildingUpStrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle_empty_string +msgid "pages.BuildingUpStrings.steps.name_triangle_empty_string.hints.1.text" +msgstr "也就是说，`line = line + char`应该在`print(line)`之前。" + +#. https://futurecoder.io/course/#BuildingUpStrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle_empty_string +msgid "pages.BuildingUpStrings.steps.name_triangle_empty_string.hints.2.text" +msgstr "除此之外，你只需要做一个***小***改动。" + +#. https://futurecoder.io/course/#BuildingUpStrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle_empty_string +msgid "pages.BuildingUpStrings.steps.name_triangle_empty_string.hints.3.text" +msgstr "我们想要去掉`-`。所以就直接去掉它。" + +#. https://futurecoder.io/course/#BuildingUpStrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle_empty_string +msgid "pages.BuildingUpStrings.steps.name_triangle_empty_string.hints.4.text" +msgstr "使用一个空字符串！" + +#. https://futurecoder.io/course/#BuildingUpStrings +msgid "pages.BuildingUpStrings.steps.name_triangle_empty_string.text" +msgstr "" +"不要将空字符串与`' '`混淆，后者是一个包含一个字符（空格）的非空字符串。\n" +"\n" +"现在修复原始程序，去掉输出中的那些行，这样对于`name = 'World'`它将打印：\n" +"\n" +" __no_auto_translate__\n" +" W\n" +" Wo\n" +" Wor\n" +" Worl\n" +" World" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle_missing_last_line +msgid "" +"pages.BuildingUpStrings.steps.name_triangle_missing_last_line.output_prediction_choices.0" +msgstr "" +"-W\n" +"-Wo\n" +"-Wor\n" +"-Worl\n" +"-World" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle_missing_last_line +msgid "" +"pages.BuildingUpStrings.steps.name_triangle_missing_last_line.output_prediction_choices.1" +msgstr "" +"-Wo\n" +"-Wor\n" +"-Worl\n" +"-World" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle_missing_last_line +msgid "" +"pages.BuildingUpStrings.steps.name_triangle_missing_last_line.output_prediction_choices.2" +msgstr "" +"-\n" +"-W\n" +"-Wo\n" +"-Wor\n" +"-Worl" + +#. https://futurecoder.io/course/#BuildingUpStrings +msgid "pages.BuildingUpStrings.steps.name_triangle_missing_last_line.text" +msgstr "" +"花点时间确保你完全理解这个程序。它做的事情类似于：\n" +"\n" +" line = '-'\n" +"\n" +" char = 'W'\n" +" line = line + char\n" +" = '-' + 'W'\n" +" = '-W'\n" +" print('-W')\n" +"\n" +" char = 'o'\n" +" line = line + char\n" +" = '-W' + 'o'\n" +" = '-Wo'\n" +" print('-Wo')\n" +"\n" +" char = 'r'\n" +" line = line + char\n" +" = '-Wo' + 'r'\n" +" = '-Wor'\n" +" print('-Wor')\n" +"\n" +" ...\n" +"\n" +"细节很重要。如果你交换最后两行并运行这个程序，会发生什么？\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#BuildingUpStrings +msgid "pages.BuildingUpStrings.title" +msgstr "构建字符串" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.diagonal_name_bonus_challenge +msgid "" +"pages.BuildingUpStringsExercises.steps.diagonal_name_bonus_challenge.hints.0.text" +msgstr "第一个字母前面应该没有空格，第二个字母前面应该有 1 个空格，第三个字母前面应该有 2 个空格，依此类推。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.diagonal_name_bonus_challenge +msgid "" +"pages.BuildingUpStringsExercises.steps.diagonal_name_bonus_challenge.hints.1.text" +msgstr "你应该把空格保存在一个变量中，并像之前一样在循环中构建它们。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.diagonal_name_bonus_challenge +msgid "" +"pages.BuildingUpStringsExercises.steps.diagonal_name_bonus_challenge.hints.2.text" +msgstr "不同之处在于，你需要在构建空格的同时打印字母。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.diagonal_name_bonus_challenge +msgid "" +"pages.BuildingUpStringsExercises.steps.diagonal_name_bonus_challenge.hints.3.text" +msgstr "换句话说，你需要一个单独的循环来同时完成这两件事。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.diagonal_name_bonus_challenge +msgid "" +"pages.BuildingUpStringsExercises.steps.diagonal_name_bonus_challenge.hints.4.text" +msgstr "循环的主体需要打印空格和字母，并且还要添加一个空格。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.diagonal_name_bonus_challenge +msgid "" +"pages.BuildingUpStringsExercises.steps.diagonal_name_bonus_challenge.hints.5.text" +msgstr "由于第一个字母前面不应该有空格，所以在打印字母后你需要添加一个空格。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.diagonal_name_bonus_challenge +msgid "" +"pages.BuildingUpStringsExercises.steps.diagonal_name_bonus_challenge.messages.add_space_first.text" +msgstr "" +"快到了！每个字母前面多了一个空格。\n" +"确保你的循环第一次调用 `print` 时，\n" +"包含空格的变量是一个空字符串。\n" +"检查你的代码顺序。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +msgid "" +"pages.BuildingUpStringsExercises.steps.diagonal_name_bonus_challenge.text" +msgstr "" +"太棒了！你真的掌握了这个！\n" +"\n" +"如果你想的话，可以在下面做一个额外的可选挑战。\n" +"如果不想，你可以继续到 [下一页](#BasicTerminology)。\n" +"如果你想的话，可以稍后再回来做这个。\n" +"\n" +"尝试写一个程序，输出给定的 `name` 以对角线的形式，例如：\n" +"\n" +" W\n" +" o\n" +" r\n" +" l\n" +" d" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +msgid "pages.BuildingUpStringsExercises.steps.final_text.text" +msgstr "哇，没什么能阻止你了！" + +msgid "pages.BuildingUpStringsExercises.steps.name_box.disallowed.0.message" +msgstr "" +"做得好，这个解决方案是正确的！不过，它可以改进。\n" +"你只需要使用一个循环 - 使用更多的循环效率不高。\n" +"你可以重用包含 `-` 和 `+` 的变量。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_box +msgid "pages.BuildingUpStringsExercises.steps.name_box.hints.0.text" +msgstr "你在上一个练习中完成了所有困难的部分。现在只是简单地添加字符串。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_box +msgid "pages.BuildingUpStringsExercises.steps.name_box.hints.1.text" +msgstr "你只需要一个 for 循环 - 就是上一个练习中用于制作破折号的那个循环。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_box +msgid "pages.BuildingUpStringsExercises.steps.name_box.hints.2.text" +msgstr "不要试图一次性完成所有事情。把问题分解成更小、更简单的子问题。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_box +msgid "pages.BuildingUpStringsExercises.steps.name_box.hints.3.text" +msgstr "" +"尝试写一个程序，输出：\n" +"\n" +" -----\n" +" World\n" +" -----" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_box +msgid "pages.BuildingUpStringsExercises.steps.name_box.hints.4.text" +msgstr "由于你需要输出三行独立的文本，你需要调用 `print()` 三次。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_box +msgid "pages.BuildingUpStringsExercises.steps.name_box.hints.5.text" +msgstr "" +"尝试写一个程序，输出：\n" +"\n" +" |World|" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +msgid "pages.BuildingUpStringsExercises.steps.name_box.text" +msgstr "" +"太棒了！\n" +"\n" +"顺便说一下，当你不需要使用变量时，通常的约定是将该变量命名为 `_`（下划线），例如 `for _ in name:`。这不会改变程序的运行方式，但对读者很有帮助。\n" +"\n" +"让我们把这个做得更花哨。扩展你的程序，在名字周围画一个框，像这样：\n" +"\n" +" +-----+\n" +" |World|\n" +" +-----+" + +msgid "pages.BuildingUpStringsExercises.steps.name_box_2.disallowed.0.message" +msgstr "" +"做得好，这个解决方案是正确的！\n" +"而且你使用了嵌套循环（一个循环在另一个循环里面），我们甚至还没有讲过！\n" +"不过，在这种情况下，嵌套循环效率不高。\n" +"你可以创建一个包含空格的变量，并在每一行中重用它。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_box_2 +msgid "pages.BuildingUpStringsExercises.steps.name_box_2.hints.0.text" +msgstr "你需要对 `name` 使用两个独立的 for 循环。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_box_2 +msgid "pages.BuildingUpStringsExercises.steps.name_box_2.hints.1.text" +msgstr "除了第一行和最后一行，其他每一行的中间都有相同的字符。这意味着你可以重用某些东西。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_box_2 +msgid "pages.BuildingUpStringsExercises.steps.name_box_2.hints.2.text" +msgstr "创建一个包含中间空格的变量，并多次使用它。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_box_2 +msgid "pages.BuildingUpStringsExercises.steps.name_box_2.hints.3.text" +msgstr "使用一个循环创建一堆空格，使用第二个循环打印一堆使用之前创建的空格的行。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +msgid "pages.BuildingUpStringsExercises.steps.name_box_2.text" +msgstr "" +"你越来越棒了！看起来你需要更多的挑战……也许不把名字放在框里，而是让名字成为框？写一个程序，输出这个：\n" +"\n" +" +World+\n" +" W W\n" +" o o\n" +" r r\n" +" l l\n" +" d d\n" +" +World+" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_triangle_backwards +msgid "" +"pages.BuildingUpStringsExercises.steps.name_triangle_backwards.hints.0.text" +msgstr "这个解决方案与原来的三角形程序非常相似，只需做一个小改动。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_triangle_backwards +msgid "" +"pages.BuildingUpStringsExercises.steps.name_triangle_backwards.hints.1.text" +msgstr "你仍然想一次向 `line` 添加一个字符，只是要考虑你添加它的位置。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_triangle_backwards +msgid "" +"pages.BuildingUpStringsExercises.steps.name_triangle_backwards.hints.2.text" +msgstr "你想让行反向，所以你需要反转/翻转某些东西。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_triangle_backwards +msgid "" +"pages.BuildingUpStringsExercises.steps.name_triangle_backwards.hints.3.text" +msgstr "你需要在字符串之前添加字符，而不是之后。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_triangle_backwards +msgid "" +"pages.BuildingUpStringsExercises.steps.name_triangle_backwards.hints.4.text" +msgstr "3 + 7 等于 7 + 3。所有数字都是如此。这对字符串也成立吗？" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +msgid "pages.BuildingUpStringsExercises.steps.name_triangle_backwards.text" +msgstr "" +"非常好！现在修改程序，使每一行都是反向的，像这样：\n" +"\n" +" __no_auto_translate__\n" +" W\n" +" oW\n" +" roW\n" +" lroW\n" +" dlroW" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_triangle_spaced +msgid "" +"pages.BuildingUpStringsExercises.steps.name_triangle_spaced.hints.0.text" +msgstr "你需要再使用一个 `+`。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_triangle_spaced +msgid "" +"pages.BuildingUpStringsExercises.steps.name_triangle_spaced.hints.1.text" +msgstr "你需要使用一个由一个空格组成的字符串：`' '`。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. # __code0__: +#. name = 'World' +#. line = '' +#. for char in name: +#. line = line + char +#. print(line) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27World%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.char +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.line +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.name +msgid "pages.BuildingUpStringsExercises.steps.name_triangle_spaced.text" +msgstr "" +"修改这个程序：\n" +"\n" +"__code0__\n" +"\n" +"在三角形的每个字符后添加一个空格，使输出看起来像这样：\n" +"\n" +" W\n" +" W o\n" +" W o r\n" +" W o r l\n" +" W o r l d" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_underlined +msgid "pages.BuildingUpStringsExercises.steps.name_underlined.hints.0.text" +msgstr "查看三角形程序以获取灵感。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_underlined +msgid "pages.BuildingUpStringsExercises.steps.name_underlined.hints.1.text" +msgstr "查看你为每个字符打印 `name` 的程序以获取灵感。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_underlined +msgid "pages.BuildingUpStringsExercises.steps.name_underlined.hints.2.text" +msgstr "你需要逐个字符地构建一个破折号（`-`）的字符串。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_underlined +msgid "pages.BuildingUpStringsExercises.steps.name_underlined.hints.3.text" +msgstr "for 循环将创建一个变量，比如 `char`，但程序不需要使用它。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +#. # __code0__: +#. line = line + char +#. # __code1__: +#. line += char +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.char +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.line +msgid "pages.BuildingUpStringsExercises.steps.name_underlined.text" +msgstr "" +"太棒了！\n" +"\n" +"像：\n" +"\n" +"__code0__\n" +"\n" +"这样的代码是如此常见，以至于 Python 允许你简写。这样写是等价的：\n" +"\n" +"__code1__\n" +"\n" +"注意 `line = char + line` 没有简写。\n" +"\n" +"现在使用 `+=` 和 for 循环来编写自己的程序，打印出 '划线' 的 `name`，像这样：\n" +"\n" +" World\n" +" -----\n" +"\n" +"每个字符都应该对应一个 `-`。" + +#. https://futurecoder.io/course/#BuildingUpStringsExercises +msgid "pages.BuildingUpStringsExercises.title" +msgstr "字符串构建练习" + +#. https://futurecoder.io/course/#CallingFunctionsTerminology +msgid "pages.CallingFunctionsTerminology.steps.final_text.text" +msgstr "错误信息中的“属性”一词指的是使用 `.` - 实际上，错误仅来自 `word.append`，甚至没有调用。" + +#. https://futurecoder.io/course/#CallingFunctionsTerminology +msgid "pages.CallingFunctionsTerminology.steps.introducing_callable.text" +msgstr "" +"像 `len(things)` 或 `print(things)` 这样的表达式是一个函数 ***调用*** - 当你写下这些时，你是在 ***调用*** 函数 `len` 或 `print`。能够这样做意味着函数是 ***可调用的***：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#CallingFunctionsTerminology +msgid "pages.CallingFunctionsTerminology.steps.len_of_none.text" +msgstr "" +"`None` 是一个特殊的“空”值，不能做任何有趣的事情。它是一个常见的占位符，表示缺少一个真正有用的值。那些不想返回任何东西的函数默认返回 `None`。如果你看到关于 `None` 或 `NoneType` 的错误信息，通常意味着你把错误的东西赋值给了一个变量：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#CallingFunctionsTerminology +msgid "pages.CallingFunctionsTerminology.steps.methods_of_str.text" +msgstr "" +"***方法*** 是属于某种类型的函数，可以使用 `.` 在该类型的所有值上调用。例如，`upper` 和 `lower` 是字符串的方法，可以通过例如 `word.upper()` 来调用：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#CallingFunctionsTerminology +msgid "pages.CallingFunctionsTerminology.steps.no_append_for_str.text" +msgstr "" +"另一个例子是 `append` 是列表的方法。但你不能在列表上使用 `.upper` 或在字符串上使用 `.append`：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#CallingFunctionsTerminology +msgid "pages.CallingFunctionsTerminology.steps.not_callable.text" +msgstr "" +"大多数东西是不可调用的，所以尝试调用它们会给你一个错误：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#CallingFunctionsTerminology +msgid "pages.CallingFunctionsTerminology.steps.print_functions.text" +msgstr "" +"是时候再扩展一下你的词汇了。\n" +"\n" +"`print` 和 `len` 是 ***函数***。自己看看吧：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#CallingFunctionsTerminology +msgid "pages.CallingFunctionsTerminology.steps.print_returns_none.text" +msgstr "" +"在调用 `len(things)` 中，`things` 是一个 ***参数***。有时你也会看到 ***参数*** 这个术语，它基本上和参数的意思是一样的。这有点像你把参数给了函数 - 我们具体说参数 `things` 被 *传递* 给 `len`，而 `len` *接受* 或 *接收* 这个参数。\n" +"\n" +"`len(things)` 将计算出一个数字，例如 3，在这种情况下我们说 `len` ***返回*** 3。\n" +"\n" +"所有调用都必须返回某些东西...即使什么也不返回。例如，`print` 的工作是显示某些内容在屏幕上，而不是返回一个有用的值。所以它返回一些无用的东西：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#CallingFunctionsTerminology +msgid "pages.CallingFunctionsTerminology.title" +msgstr "术语：调用函数和方法" + +#. https://futurecoder.io/course/#CallingFunctionsWithinFunctions +msgid "pages.CallingFunctionsWithinFunctions.steps.final_text.text" +msgstr "" +"`birdseye` 只显示一个帧（函数调用）。一开始你会看到全局帧。\n" +"底部是对 `print_twice` 的调用。点击小蓝箭头进入\n" +"那个帧，然后点击下一个进入 `print_many`。" + +#. https://futurecoder.io/course/#CallingFunctionsWithinFunctions +msgid "" +"pages.CallingFunctionsWithinFunctions.steps.print_twice_call_print_many.text" +msgstr "" +"函数的主体可以包含任何内容，包括函数调用。实际上，我们已经通过调用\n" +"print 做到了这一点。但调用我们自己的函数并没有什么不同，所以我们的函数可以互相调用！\n" +"\n" +"例如，我们可以用 `print_many` 来实现 `print_twice`：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#CallingFunctionsWithinFunctions +msgid "" +"pages.CallingFunctionsWithinFunctions.steps.see_stack_in_birdseye.requirements" +msgstr "运行与上面相同的程序，但使用 `birdseye`。" + +#. https://futurecoder.io/course/#CallingFunctionsWithinFunctions +msgid "pages.CallingFunctionsWithinFunctions.steps.see_stack_in_birdseye.text" +msgstr "" +"每次调用函数时，都会创建一个新的 *帧*，其中包含该调用的局部变量值\n" +"和当前发生的其他信息。当函数调用完成时，帧会被删除。\n" +"\n" +"你可以在右侧的 Python Tutor 中看到这一点，标题为 \"Frames\"。顶部是全局帧，\n" +"整个程序运行的顶层帧。当你点击下一步时，新的帧会出现\n" +"然后消失。在每个帧中，你可以看到变量的值。\n" +"\n" +"最后，使用 `birdseye` 运行程序。" + +#. https://futurecoder.io/course/#CallingFunctionsWithinFunctions +msgid "" +"pages.CallingFunctionsWithinFunctions.steps.see_stack_in_pythontutor.requirements" +msgstr "运行与上面相同的程序，但使用 Python Tutor。" + +#. https://futurecoder.io/course/#CallingFunctionsWithinFunctions +msgid "" +"pages.CallingFunctionsWithinFunctions.steps.see_stack_in_pythontutor.text" +msgstr "" +"`snoop` 每次函数调用开始时会显示：\n" +"\n" +"1. 日志中的新缩进级别。\n" +"2. `>>> Call to `\n" +"3. 参数的值。\n" +"4. 函数头行。\n" +"\n" +"它以 `<<< Return value from ` 结束调用。我们很快就会学习返回值。\n" +"\n" +"现在再次使用 Python Tutor 运行程序。" + +#. https://futurecoder.io/course/#CallingFunctionsWithinFunctions +msgid "" +"pages.CallingFunctionsWithinFunctions.steps.see_stack_in_snoop.requirements" +msgstr "运行与上面相同的程序，但使用 `snoop`。" + +#. https://futurecoder.io/course/#CallingFunctionsWithinFunctions +msgid "pages.CallingFunctionsWithinFunctions.steps.see_stack_in_snoop.text" +msgstr "" +"理解这里发生的事情并知道如何\n" +"探索函数调用是很重要的，所以我们要在每个调试器中尝试一下。\n" +"\n" +"首先，再次使用 `snoop` 运行程序。" + +#. https://futurecoder.io/course/#CallingFunctionsWithinFunctions +msgid "pages.CallingFunctionsWithinFunctions.title" +msgstr "在函数中调用函数" + +#. https://futurecoder.io/course/#CombiningAndAndOr +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.AndHasHigherPriority +msgid "pages.CombiningAndAndOr.steps.AndHasHigherPriority.hints.0.text" +msgstr "棋盘上有多少条对角线？" + +#. https://futurecoder.io/course/#CombiningAndAndOr +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.AndHasHigherPriority +msgid "pages.CombiningAndAndOr.steps.AndHasHigherPriority.hints.1.text" +msgstr "三个子列表的哪些条目构成每条对角线？你如何访问这些条目？" + +#. https://futurecoder.io/course/#CombiningAndAndOr +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.AndHasHigherPriority +msgid "pages.CombiningAndAndOr.steps.AndHasHigherPriority.hints.2.text" +msgstr "每个列表总是有3个条目，所以不需要循环。" + +#. https://futurecoder.io/course/#CombiningAndAndOr +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.AndHasHigherPriority +msgid "pages.CombiningAndAndOr.steps.AndHasHigherPriority.hints.3.text" +msgstr "这里有两个问题需要解决：检查特定对角线是否获胜，以及组合每条对角线的检查。" + +#. https://futurecoder.io/course/#CombiningAndAndOr +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.AndHasHigherPriority +msgid "pages.CombiningAndAndOr.steps.AndHasHigherPriority.hints.4.text" +msgstr "一个问题可以使用 `and` 来解决，另一个可以使用 `or`。" + +#. https://futurecoder.io/course/#CombiningAndAndOr +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.AndHasHigherPriority +msgid "pages.CombiningAndAndOr.steps.AndHasHigherPriority.hints.5.text" +msgstr "这与 `all_equal` 函数有很多相似之处。你甚至可以调用这个函数来帮助你！但你需要包含它的定义。" + +#. https://futurecoder.io/course/#CombiningAndAndOr +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.AndHasHigherPriority +msgid "pages.CombiningAndAndOr.steps.AndHasHigherPriority.hints.6.text" +msgstr "类似于 `all_equal`，检查对角线上的3个条目是否相等，例如使用 `and`。" + +#. https://futurecoder.io/course/#CombiningAndAndOr +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.AndHasHigherPriority +msgid "pages.CombiningAndAndOr.steps.AndHasHigherPriority.hints.7.text" +msgstr "使用 `or` 一起检查两个对角线。" + +#. https://futurecoder.io/course/#CombiningAndAndOr +#. # __code4__: +#. def diagonal_winner(board): +#. ... +#. assert_equal( +#. diagonal_winner( +#. [ +#. ['X', 'O', 'X'], +#. ['X', 'X', 'O'], +#. ['O', 'O', 'X'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. diagonal_winner( +#. [ +#. ['X', 'X', 'O'], +#. ['X', 'O', 'O'], +#. ['O', 'X', 'X'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. diagonal_winner( +#. [ +#. ['O', 'X', 'O'], +#. ['X', 'X', 'X'], +#. ['O', 'O', 'X'] +#. ] +#. ), +#. False +#. ) +#. # __code3__: +#. board = [ +#. ['X', 'O', 'X'], +#. ['X', 'X', 'O'], +#. ['O', 'O', 'X'] +#. ] +#. # __code1__: +#. (True or False) and False +#. # __code2__: +#. True or (False and False) +#. # __code0__: +#. True or False and False +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.board +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.diagonal_winner +msgid "pages.CombiningAndAndOr.steps.AndHasHigherPriority.text" +msgstr "" +"如果你从左到右随意阅读，你可能会认为：\n" +"\n" +"__code0__\n" +"\n" +"等同于\n" +"\n" +"__code1__\n" +"\n" +"但实际上它等同于\n" +"\n" +"__code2__\n" +"\n" +"这是因为 `and` 的优先级高于 `or`。\n" +"这很重要，因为第一个解释简化为 `True and False`，结果是 `False`，而第二个\n" +"解释简化为 `True or False`，结果是 `True`！\n" +"你可以在 shell 中尝试这两种选项，确认一下。\n" +"\n" +"**这里的教训是，在组合运算符时要特别小心。** 要么添加括号以确保安全，要么\n" +"将表达式拆分为更小的部分，并将每部分分配给一个变量。\n" +"这将使你的代码清晰、易读且不含歧义，避免让你犯下痛苦的错误。\n" +"\n" +"现在是练习时间。假设你正在编写一个程序来玩井字棋，\n" +"也称为圈圈叉叉或 X 和 O。如果你从未听说过井字棋，你可以在这里阅读规则\n" +"并玩几局 [这里](https://gametable.org/games/tic-tac-toe/)。\n" +"\n" +"我们需要检查是否有人赢得了比赛。我们的函数 `all_equal` 已经可以帮助检查是否连成线了。\n" +"\n" +"编写一个函数，检查是否有人通过在一条对角线上放置3个相同的棋子赢得了比赛。\n" +"棋盘以嵌套列表 `board` 的形式给出，包含3个子列表，每个子列表包含3个字符串，表示一行。例如：\n" +"\n" +"__code3__\n" +"\n" +"该函数应返回一个布尔值：如果某条对角线有3个相同的棋子，则返回 `True`，否则返回 `False`。\n" +"点击复制按钮以开始下面的代码。\n" +"我们为你提供了一些测试，你的任务是用你的代码替换 `...`。\n" +"\n" +" __copyable__\n" +"__code4__" + +#. https://futurecoder.io/course/#CombiningAndAndOr +msgid "pages.CombiningAndAndOr.steps.CombiningAndOr.text" +msgstr "" +"如果你在一个表达式中同时使用 `and` 和 `or`，这就像结合 `*` 和 `+` 一样。\n" +"运算符按特定顺序进行评估。\n" +"\n" +"例如，尝试在 shell 中运行以下代码。\n" +"你期待什么？\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#CombiningAndAndOr +#. # __code0__: +#. def diagonal_winner(board): +#. middle = board[1][1] +#. return ( +#. (middle == board[0][0] and middle == board[2][2]) or +#. (middle == board[0][2] and middle == board[2][0]) +#. ) +#. # __code1__: +#. diagonal1 = all_equal([board[0][0], board[1][1], board[2][2]]) +#. diagonal2 = all_equal([board[2][0], board[1][1], board[0][2]]) +#. return diagonal1 or diagonal2 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.all_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.board +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.diagonal1 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.diagonal2 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.diagonal_winner +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.middle +msgid "pages.CombiningAndAndOr.steps.final_text.text" +msgstr "" +"干得好！这很难。以下是一些可能的解决方案：\n" +"\n" +"__code0__\n" +"\n" +"或者：\n" +"\n" +"__code1__" + +#. https://futurecoder.io/course/#CombiningAndAndOr +msgid "pages.CombiningAndAndOr.title" +msgstr "组合 `and` 和 `or`" + +#. https://futurecoder.io/course/#CombiningCompoundStatements +#. # __code0__: +#. sentence = 'Hello World' +#. excited = True +#. new_sentence = '' +#. for char in sentence: +#. new_sentence += char +#. if excited: +#. new_sentence += '!' +#. sentence = new_sentence +#. print(sentence) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27Hello+World%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.char +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.excited +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.new_sentence +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.sentence +msgid "pages.CombiningCompoundStatements.steps.final_text.text" +msgstr "" +"注意 `if` 语句的主体（4 行）像往常一样缩进，而 `for` 循环的主体（1 行）在每行额外缩进了 4 个空格，以显示这些行在 `for` 循环内。你可以通过查看缩进来了解程序的整体结构。\n" +"\n" +"或者，你可以在 `for` 循环内放一个 `if`：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"这两个程序的结果完全相同。然而，第一个程序更高效，因为它只在需要时才遍历字符串，因为当 `excited = False` 时，什么都不会改变。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningCompoundStatements.steps.for_inside_if +msgid "" +"pages.CombiningCompoundStatements.steps.for_inside_if.output_prediction_choices.0" +msgstr "Hello World" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningCompoundStatements.steps.for_inside_if +msgid "" +"pages.CombiningCompoundStatements.steps.for_inside_if.output_prediction_choices.2" +msgstr "Hello World!!!!!!!!!!!" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningCompoundStatements.steps.for_inside_if +msgid "" +"pages.CombiningCompoundStatements.steps.for_inside_if.output_prediction_choices.3" +msgstr "!!!!!!!!!!!Hello World" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningCompoundStatements.steps.for_inside_if +msgid "" +"pages.CombiningCompoundStatements.steps.for_inside_if.output_prediction_choices.4" +msgstr "Hello World!" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningCompoundStatements.steps.for_inside_if +msgid "" +"pages.CombiningCompoundStatements.steps.for_inside_if.output_prediction_choices.5" +msgstr "!Hello World" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningCompoundStatements.steps.for_inside_if +msgid "" +"pages.CombiningCompoundStatements.steps.for_inside_if.output_prediction_choices.6" +msgstr "!Hello World!" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningCompoundStatements.steps.for_inside_if +msgid "" +"pages.CombiningCompoundStatements.steps.for_inside_if.output_prediction_choices.7" +msgstr "H!e!l!l!o! !W!o!r!l!d!" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningCompoundStatements.steps.for_inside_if +msgid "" +"pages.CombiningCompoundStatements.steps.for_inside_if.output_prediction_choices.8" +msgstr "!H!e!l!l!o! !W!o!r!l!d" + +#. https://futurecoder.io/course/#CombiningCompoundStatements +msgid "pages.CombiningCompoundStatements.steps.for_inside_if.text" +msgstr "" +"像 `for` 循环和 `if` 语句这样的复合语句有一个主体，它是一个内部语句的列表。那些内部语句可以是任何东西，包括其他复合语句。尝试这个在 `if` 语句内的 `for` 循环的例子，当你想展示你 *真的* 很兴奋时：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#CombiningCompoundStatements +msgid "pages.CombiningCompoundStatements.title" +msgstr "组合复合语句" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_function_name +msgid "pages.DefiningFunctions.steps.change_function_name.hints.0.text" +msgstr "你需要在函数定义头部更改名称，但这还不是全部。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_function_name +msgid "pages.DefiningFunctions.steps.change_function_name.hints.1.text" +msgstr "如果你只是更改函数定义头部的名称，会发生什么？" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_function_name +msgid "pages.DefiningFunctions.steps.change_function_name.hints.2.text" +msgstr "你会得到一个错误。看看这个消息。它在告诉你什么？错误来自哪里？" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_function_name +msgid "pages.DefiningFunctions.steps.change_function_name.hints.3.text" +msgstr "如果你的函数叫 `say_hello`，那么 `greet(\"Alice\")` 代表什么？" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_function_name +msgid "pages.DefiningFunctions.steps.change_function_name.hints.4.text" +msgstr "你需要准确地更改程序中的 3 行。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_function_name +msgid "pages.DefiningFunctions.steps.change_function_name.hints.5.text" +msgstr "在每一行中，你只需更改一个单词。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_function_name +msgid "pages.DefiningFunctions.steps.change_function_name.hints.6.text" +msgstr "不要触碰函数的主体。它应该仍然包含 `print(\"How are you?\")`。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_function_name +msgid "pages.DefiningFunctions.steps.change_function_name.hints.7.text" +msgstr "在定义函数后，你仍然应该调用函数两次，传入参数 `\"Alice\"` 和 `\"Bob\"`。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. # __code0__: +#. name = "Alice" +#. print(f"Hello {name}!") +#. print("How are you?") +#. name = "Bob" +#. print(f"Hello {name}!") +#. print("How are you?") +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Alice%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Bob%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22How+are+you%3F%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.f%22Hello+%7Bname%7D%21%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.name +msgid "pages.DefiningFunctions.steps.change_function_name.text" +msgstr "" +"注意程序的输出是如何变化的。`How are you?` 被打印了两次。你可以把整个程序看作是\n" +"等同于这个：\n" +"\n" +"__code0__\n" +"\n" +"这展示了函数最有用的特性之一。它们让你可以多次重用相同的代码，而不必\n" +"重复自己。这就像在一个程序中编写另一个程序。\n" +"\n" +"函数定义的头部总是包含以下部分：\n" +"\n" +"1. 特殊关键字 `def`，后面跟一个空格。\n" +"2. 函数的名称。这就像一个变量名 - 你可以选择你想要的名称，但有一些限制，\n" +"例如，它不能包含空格。\n" +"3. 一对括号 `(` 和 `)`\n" +"4. 括号之间零个或多个参数名称，如果有多个，用逗号分隔。在这里我们有\n" +"一个名为 `name` 的参数。\n" +"5. 一个冒号 `:`\n" +"\n" +"让我们做一些简单的练习。将函数的名称从 `greet` 改为 `say_hello`。\n" +"确保整个程序仍然可以正常工作，但不要更改其他任何内容。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_parameter_name +msgid "pages.DefiningFunctions.steps.change_parameter_name.hints.0.text" +msgstr "你需要在函数定义头部更改参数名称，但这还不是全部。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_parameter_name +msgid "pages.DefiningFunctions.steps.change_parameter_name.hints.1.text" +msgstr "如果你只是更改函数定义头部的参数名称，会发生什么？" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_parameter_name +msgid "pages.DefiningFunctions.steps.change_parameter_name.hints.2.text" +msgstr "你会得到一个错误。看看这个消息。它在告诉你什么？错误来自哪里？" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_parameter_name +msgid "pages.DefiningFunctions.steps.change_parameter_name.hints.3.text" +msgstr "如果参数叫 `person_name`，那么 `print(f\"Hello {name}!\")` 代表什么？" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_parameter_name +msgid "pages.DefiningFunctions.steps.change_parameter_name.hints.4.text" +msgstr "你需要准确地更改程序中的 2 行。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_parameter_name +msgid "pages.DefiningFunctions.steps.change_parameter_name.hints.5.text" +msgstr "在每一行中，你只需更改一个单词。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_parameter_name +msgid "pages.DefiningFunctions.steps.change_parameter_name.hints.6.text" +msgstr "不要触碰函数定义后的部分，即 `say_hello(\"Alice\")` 和 `say_hello(\"Bob\")`。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_parameter_name +msgid "pages.DefiningFunctions.steps.change_parameter_name.hints.7.text" +msgstr "你应该在函数主体中仍然有两个语句，包括 `print(\"How are you?\")`。" + +#. https://futurecoder.io/course/#DefiningFunctions +msgid "pages.DefiningFunctions.steps.change_parameter_name.text" +msgstr "很好！现在做一个类似的练习：将参数的名称从 `name` 改为 `person_name`。" + +#. https://futurecoder.io/course/#DefiningFunctions +msgid "pages.DefiningFunctions.steps.define_greet.text" +msgstr "" +"你已经见过如何调用像 `print()` 和 `len()` 这样的函数。现在你将学习如何编写你自己的\n" +"函数，供你自己或其他人使用。这在程序变得更大更复杂时非常重要。\n" +"\n" +"这是一个简单的例子：\n" +"\n" +"__program_indented__\n" +"\n" +"这定义了一个名为 `greet` 的函数，它接受一个参数。在定义下面，我们调用这个函数两次。\n" +"运行代码看看会发生什么。" + +#. https://futurecoder.io/course/#DefiningFunctions +msgid "pages.DefiningFunctions.steps.final_text.text" +msgstr "完美！现在你已经掌握了定义函数的基础知识。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.how_are_you +msgid "pages.DefiningFunctions.steps.how_are_you.output_prediction_choices.0" +msgstr "" +"Hello Alice!\n" +"How are you?\n" +"Hello Bob!\n" +"How are you?" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.how_are_you +msgid "pages.DefiningFunctions.steps.how_are_you.output_prediction_choices.1" +msgstr "" +"Hello Alice!\n" +"Hello Bob!\n" +"How are you?" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.how_are_you +msgid "pages.DefiningFunctions.steps.how_are_you.output_prediction_choices.2" +msgstr "" +"Hello Alice!\n" +"How are you?\n" +"Hello Bob!" + +#. https://futurecoder.io/course/#DefiningFunctions +msgid "pages.DefiningFunctions.steps.how_are_you.requirements" +msgstr "" +"在 `print(f\"Hello {name}!\")` 后添加 `print(\"How are you?\")`，并保持相同的缩进。\n" +"保持定义后的两个 `greet` 调用不变。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. # __code0__: +#. def greet(name): +#. print(f"Hello {name}!") +#. print("How are you?") +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22How+are+you%3F%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.f%22Hello+%7Bname%7D%21%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.greet +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.name +msgid "pages.DefiningFunctions.steps.how_are_you.text" +msgstr "" +"函数定义是一个复合语句。像 `if` 和 `for` 一样，它有一个头部行，后面跟着一个缩进的主体\n" +"可以包含一个或多个语句。\n" +"\n" +"向函数添加另一个语句，使其看起来像这样：\n" +"\n" +"__code0__\n" +"\n" +"然后再次运行程序。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.print_many +msgid "pages.DefiningFunctions.steps.print_many.output_prediction_choices.2" +msgstr "" +"Hello\n" +"Hello\n" +"Hello" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.print_many +msgid "pages.DefiningFunctions.steps.print_many.output_prediction_choices.3" +msgstr "Hello" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.print_many +msgid "pages.DefiningFunctions.steps.print_many.output_prediction_choices.4" +msgstr "" +"H\n" +"e\n" +"l\n" +"l\n" +"o" + +#. https://futurecoder.io/course/#DefiningFunctions +msgid "pages.DefiningFunctions.steps.print_many.text" +msgstr "" +"函数可以有多个参数。试试下面的例子：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.print_twice_exercise +msgid "pages.DefiningFunctions.steps.print_twice_exercise.hints.0.text" +msgstr "这里没有聪明的解决问题，这只是关于遵循定义函数的步骤。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.print_twice_exercise +msgid "pages.DefiningFunctions.steps.print_twice_exercise.hints.1.text" +msgstr "确保你有上述列出的所有函数部分。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.print_twice_exercise +msgid "pages.DefiningFunctions.steps.print_twice_exercise.hints.2.text" +msgstr "这包括 `def`、`()` 和 `:`。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.print_twice_exercise +msgid "pages.DefiningFunctions.steps.print_twice_exercise.hints.3.text" +msgstr "确保你的函数名为 `print_twice`。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.print_twice_exercise +msgid "pages.DefiningFunctions.steps.print_twice_exercise.hints.4.text" +msgstr "确保它在括号 `()` 中接受一个名为 `x` 的参数。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.print_twice_exercise +msgid "pages.DefiningFunctions.steps.print_twice_exercise.hints.5.text" +msgstr "查看上面定义的其他函数以获取帮助。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.print_twice_exercise +msgid "pages.DefiningFunctions.steps.print_twice_exercise.hints.6.text" +msgstr "在函数主体中使用参数。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.print_twice_exercise +msgid "pages.DefiningFunctions.steps.print_twice_exercise.hints.7.text" +msgstr "确保主体是缩进的。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.print_twice_exercise +msgid "pages.DefiningFunctions.steps.print_twice_exercise.hints.8.text" +msgstr "主体需要两个语句或一个非常简单的循环。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.print_twice_exercise +msgid "pages.DefiningFunctions.steps.print_twice_exercise.hints.9.text" +msgstr "确保你不在 `print_twice` 的函数主体中调用 `print_twice`。检查你的缩进。" + +#. https://futurecoder.io/course/#DefiningFunctions +msgid "pages.DefiningFunctions.steps.print_twice_exercise.requirements" +msgstr "编写一个程序，定义一个名为 `print_twice` 的函数，如上所述。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. # __code0__: +#. Hello +#. Hello +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.Hello +msgid "pages.DefiningFunctions.steps.print_twice_exercise.text" +msgstr "" +"做得好！\n" +"\n" +"现在编写你自己的函数 `print_twice`，它接受一个参数 `x`，并在两行上打印该参数两次。\n" +"\n" +"例如，`print_twice(\"Hello\")` 应该输出：\n" +"\n" +"__code0__\n" +"\n" +"你可以在函数定义后调用它来测试你的函数，但这不是必需的。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.swap_parameters +msgid "pages.DefiningFunctions.steps.swap_parameters.hints.0.text" +msgstr "函数定义中唯一的更改应该是按照指示交换参数，其他什么都不做。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.swap_parameters +msgid "pages.DefiningFunctions.steps.swap_parameters.hints.1.text" +msgstr "你需要修复对 `print_many` 的调用。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.swap_parameters +msgid "pages.DefiningFunctions.steps.swap_parameters.hints.2.text" +msgstr "如果函数定义为 `def print_many(n, thing)`，那么 `print_many(\"Hello\", 3)` 代表什么？" + +#. https://futurecoder.io/course/#DefiningFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.swap_parameters +msgid "pages.DefiningFunctions.steps.swap_parameters.hints.3.text" +msgstr "我们仍然希望 `thing = \"Hello\"` 和 `n = 3`。" + +#. https://futurecoder.io/course/#DefiningFunctions +#. # __code0__: +#. thing = "Hello" +#. n = 3 +#. for _ in range(n): +#. print(thing) +#. # __code1__: +#. def print_many(n, thing): +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Hello%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.print_many +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.thing +msgid "pages.DefiningFunctions.steps.swap_parameters.text" +msgstr "" +"注意在函数定义和函数调用中用于分隔参数的逗号，以及定义和调用之间的对应关系：\n" +"\n" +" def print_many(thing, n):\n" +" ^ ^\n" +" | |\n" +" print_many(\"Hello\", 3)\n" +"\n" +"所以调用 `print_many(\"Hello\", 3)` 就像运行：\n" +"\n" +"__code0__\n" +"\n" +"现在进行另一个简单的练习。交换函数定义头部中的参数，使其变为：\n" +"\n" +"__code1__\n" +"\n" +"如果你这样做而不更改其他任何内容，你将会得到一个错误。修复程序的其余部分，使其像以前一样工作。\n" +"*不要更改函数的主体*。" + +#. https://futurecoder.io/course/#DefiningFunctions +msgid "pages.DefiningFunctions.title" +msgstr "定义函数" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart +msgid "pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.hints.0.text" +msgstr "请记住，我们之前在函数中有 `for item in cart`，但是 `cart` 不再是一个参数。" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart +msgid "pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.hints.1.text" +msgstr "现在 `quantities` 是唯一定义客户购买内容的参数。" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart +msgid "pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.hints.2.text" +msgstr "你需要遍历 `quantities` 的键。记住，这里的“遍历”意味着用 `for` 循环“循环遍历”。" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart +msgid "pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.hints.3.text" +msgstr "你可以使用 `.keys()`，但这不是必须的。" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +#. # __code0__: +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in ...: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27apple%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27box%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27cat%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27dog%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.item +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.price +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.prices +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.quantities +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.quantity +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.result +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.total_cost +msgid "pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.text" +msgstr "" +"现在你可以用这个来修改我们上一页的函数，以移除 `cart` 参数：\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_french +msgid "pages.DictionaryKeysAndValues.steps.english_to_french.hints.0.text" +msgstr "你需要遍历（循环）字典。" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_french +msgid "pages.DictionaryKeysAndValues.steps.english_to_french.hints.1.text" +msgstr "你需要打印出每个字典条目的键（英语单词）和值（法语单词）。" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_french +msgid "pages.DictionaryKeysAndValues.steps.english_to_french.hints.2.text" +msgstr "你可以像往常一样使用键来获取值。" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +#. # __code0__: +#. def print_words(french): +#. ... +#. print_words({'apple': 'pomme', 'box': 'boite'}) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27apple%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27boite%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27box%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27pomme%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.french +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.print_words +msgid "pages.DictionaryKeysAndValues.steps.english_to_french.text" +msgstr "" +"看起来不错！我们已经完全解决了计算总成本的问题。\n" +"\n" +"回到我们的第一个例子：写一个函数\n" +"打印出英语到法语字典中的每个单词及其翻译，并用它们的语言进行标记。\n" +"这是你的起始代码：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"例如，上面代码的最后一行应该打印：\n" +"\n" +" English: apple\n" +" French: pomme\n" +" ---\n" +" English: box\n" +" French: boite\n" +" ---" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german +msgid "pages.DictionaryKeysAndValues.steps.english_to_german.hints.0.text" +msgstr "这仍然与之前的练习非常相似，尚无特别之处。" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german +msgid "pages.DictionaryKeysAndValues.steps.english_to_german.hints.1.text" +msgstr "你可以重用你之前的解决方案，只需添加另一个参数和一点点代码。" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german +msgid "pages.DictionaryKeysAndValues.steps.english_to_german.hints.2.text" +msgstr "你现在需要打印一个字典键和两个字典值。" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +#. # __code0__: +#. def print_words(french, german): +#. ... +#. print_words( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27apfel%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27apple%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27boite%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27box%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27kasten%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27pomme%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.french +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.german +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.print_words +msgid "pages.DictionaryKeysAndValues.steps.english_to_german.text" +msgstr "" +"太好了！现在我们也来添加一个德语字典：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"这应该打印：\n" +"\n" +" English: apple\n" +" French: pomme\n" +" German: apfel\n" +" ---\n" +" English: box\n" +" French: boite\n" +" German: kasten\n" +" ---\n" +"\n" +"这两个字典将始终具有相同的键，只是值不同。" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +msgid "pages.DictionaryKeysAndValues.steps.final_text.text" +msgstr "恭喜你！到目前为止，你已经完成了课程的所有内容。更多内容正在进行中！" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +msgid "pages.DictionaryKeysAndValues.steps.introducing_keys.requirements" +msgstr "在 `quantities` 是一个字典的地方运行 `print(quantities.keys())`。" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +#. # __code0__: +#. quantities = {'apple': 1, 'cat': 10} +#. print(quantities) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27apple%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27cat%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.quantities +msgid "pages.DictionaryKeysAndValues.steps.introducing_keys.text" +msgstr "" +"将这段代码复制到编辑器中：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"然后将 `print(quantities)` 改为 `print(quantities.keys())`，并运行整个程序。" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.DictionaryKeysAndValues.steps.keys_are_iterable.text" +msgstr "" +"`dict` 的 `.keys()` 方法基本上做了你所期望的。你可以像遍历列表一样遍历它返回的值：\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +msgid "pages.DictionaryKeysAndValues.steps.keys_are_iterable2.requirements" +msgstr "" +"运行与上一步相同的代码，但在 `quantities` 后面不加 `.keys()`，所以中间的行是 `for key in quantities:`。" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +msgid "pages.DictionaryKeysAndValues.steps.keys_are_iterable2.text" +msgstr "" +"实际上，你甚至不需要 `.keys()`。直接遍历字典会自动遍历它的键。\n" +"有时候写 `.keys()` 可以使你的代码更易读，但你并不是非得这样做。\n" +"去掉 `.keys()` 并再次运行代码。" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.DictionaryKeysAndValues.steps.nested_dictionaries.text" +msgstr "" +"太美了！这里出现了一个模式。这两种语言可以合并成一个大的嵌套字典：\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#DictionaryKeysAndValues +msgid "pages.DictionaryKeysAndValues.title" +msgstr "遍历字典键" + +#. https://futurecoder.io/course/#EqualsVsIs +#. # __code0__: +#. list2 = list1.copy() +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.list1 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.list2 +msgid "pages.EqualsVsIs.steps.final_text.text" +msgstr "" +"现在 `list1 is list2` 是 `True`，因为 *只有一个列表*，而两个变量\n" +"`list1` 和 `list2` 都指向那个相同的列表。`list1.append(4)` 会添加到那个列表\n" +"，结果可以在 `print(list1)` 和 `print(list2)` 中看到，因为这两行\n" +"现在只是打印同一个列表的不同方式。\n" +"\n" +"我建议使用 Python Tutor 运行这两个版本，看看它是如何可视化这个差异的。\n" +"在第二种情况下，这两个变量都有箭头指向一个单一的列表对象。\n" +"\n" +"`list2 = list1` 并不会在变量之间创建一个永久的链接。如果你给*任意一个*变量赋一个新值\n" +"，例如 `list1 = [7, 8, 9]`，另一个变量将不会受到影响\n" +"，仍然指向原始列表。\n" +"\n" +"基本上，像这样的赋值：\n" +"\n" +" list2 = \n" +"\n" +"意味着“让变量 `list2` 指向 `` 计算出的值”。\n" +"它并不会复制那个值，这就是为什么两个变量最终可以指向同一个列表。\n" +"但是正如我们之前学到的，`list2` 不记得 ``，只记得值。\n" +"它不知道其他变量。\n" +"\n" +"你可以使用 `copy` 方法复制一个列表：\n" +"\n" +"__code0__\n" +"\n" +"这将使程序再次像第一个版本一样运行。\n" +"\n" +"如果你遇到这种问题，并且仍然对这些内容感到困惑，可以阅读这篇文章 [Facts and myths about Python names and values](https://nedbatchelder.com/text/names.html)。" + +#. https://futurecoder.io/course/#EqualsVsIs +msgid "pages.EqualsVsIs.steps.same_list.requirements" +msgstr "运行与上面相同的程序，但将*第二个* `[1, 2, 3]` 替换为 `list1`。" + +#. https://futurecoder.io/course/#EqualsVsIs +msgid "pages.EqualsVsIs.steps.same_list.text" +msgstr "" +"这个程序相当简单，主要由你熟悉的内容组成。\n" +"我们创建了两个变量，它们指向列表。\n" +"这两个列表有相同的元素，所以它们是相等的：`list1 == list2` 是 `True`。\n" +"\n" +"但是接下来有一个新的比较运算符：`is`。在这里 `list1 is list2` 是 `False`。\n" +"这意味着尽管这两个列表相等，\n" +"它们仍然是两个独立、不同的列表。\n" +"因此，当你向 `list1` 添加 4 时，只有 `list1` 会改变。\n" +"\n" +"现在将 `list2 = [1, 2, 3]` 改为 `list2 = list1`，看看会有什么不同。" + +#. https://futurecoder.io/course/#EqualsVsIs +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.EqualsVsIs.steps.two_separate_lists.text" +msgstr "" +"是时候学习一些常常被误解并导致错误的技术细节了。\n" +"运行这个程序：\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#EqualsVsIs +msgid "pages.EqualsVsIs.title" +msgstr "`==` 与 `is`，以及一个值的多个名称" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.FunctionsAndMethodsForLists.steps.append_vs_concatenate.text" +msgstr "" +"让我们回顾一下如何使用列表。假设我们有一个列表 `nums = [1, 2, 3]`。你可以使用：\n" +"\n" +"- **`append`**：将一个元素添加到列表的末尾。`nums.append(4)` 将列表更改为 `[1, 2, 3, 4]`。\n" +"- **`len`**：返回元素的数量。`len(nums)` 是 `3`。\n" +"- **`range`**：`range(n)` 是一个对象，类似于从 `0` 到 `n - 1` 的数字列表。这意味着它包含 `n` 个数字。特别地，`range(len(nums))` 就像 `[0, 1, 2]`，这些是 `nums` 中每个元素的索引。\n" +"- **`[]` (下标/索引)**：获取某个索引处的值。`nums[0]` 是 `1`，`nums[1]` 是 `2`，`nums[2]` 是 `3`。\n" +"- **`+`**：连接列表。`nums + [4, 5]` 是 `[1, 2, 3, 4, 5]`。\n" +"\n" +"注意，`nums.append(4)` 修改了现有的列表 `nums`，而 `nums + [4, 5]` 则没有。\n" +"保留 `nums + [4, 5]` 的一种方法是将其赋值给一个 *新变量*。\n" +"运行以下代码：\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +msgid "pages.FunctionsAndMethodsForLists.steps.final_text.text" +msgstr "干得好！" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. # __code0__: +#. some_list.index(value) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.some_list +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.value +msgid "pages.FunctionsAndMethodsForLists.steps.index_predict_exercise.text" +msgstr "" +"**`index`**：使用以下语法返回列表中某个值的第一个索引\n" +"\n" +"__code0__\n" +"\n" +"如果该值不存在，则会引发错误。例如在终端中运行这一行：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.negative_index_concatenation_exercise +msgid "" +"pages.FunctionsAndMethodsForLists.steps.negative_index_concatenation_exercise.hints.0.text" +msgstr "" +"你的解决方案应该有正好三条语句：`x = ['a', 'b', 'c']`，`y = ` 后面跟着一行从列表中精确复制的内容，以及 " +"`print(y)`。" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.negative_index_concatenation_exercise +msgid "" +"pages.FunctionsAndMethodsForLists.steps.negative_index_concatenation_exercise.hints.1.text" +msgstr "哪些代码行创建了一个新列表而不是修改？" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.negative_index_concatenation_exercise +msgid "" +"pages.FunctionsAndMethodsForLists.steps.negative_index_concatenation_exercise.hints.2.text" +msgstr "`x` 是一个列表。`x` 的每个元素都是一个字符串。" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.negative_index_concatenation_exercise +msgid "" +"pages.FunctionsAndMethodsForLists.steps.negative_index_concatenation_exercise.hints.3.text" +msgstr "你可以将列表相加，你可以将字符串相加，但你不能将字符串和列表相加。" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.negative_index_concatenation_exercise +msgid "" +"pages.FunctionsAndMethodsForLists.steps.negative_index_concatenation_exercise.hints.4.text" +msgstr "如何创建一个包含一个元素的列表？" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +msgid "" +"pages.FunctionsAndMethodsForLists.steps.negative_index_concatenation_exercise.requirements" +msgstr "" +"复制上面的三行，然后将 `(insert_one_line_from_above)` " +"替换为从之前的长列表中精确复制的一行。你必须选择正确的行，只有一个正确答案。准确输入这一行。不要替换 `y = ` " +"部分，它应该仍然在你输入的行之前，保持在同一行。" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. # __code0__: +#. x = ['a', 'b', 'c'] +#. y = (insert_one_line_from_above) +#. print(y) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.insert_one_line_from_above +msgid "" +"pages.FunctionsAndMethodsForLists.steps.negative_index_concatenation_exercise.text" +msgstr "" +"很棒！\n" +"\n" +"你可能会意识到，通过 `x[len(x) - 1]` 访问最后一个元素有点麻烦。\n" +"同样的效果可以通过 `x[-1]` 来实现。\n" +"类似地，倒数第二个元素 `x[len(x) - 2]` 可以写成 `x[-2]`，依此类推。\n" +"Python 也允许我们从最后一个元素开始向后计数，使用 `-1`：\n" +"\n" +"| 索引 | 第一个元素 | 第二个元素 | 第三个元素 | ... | 倒数第二个元素 | 最后一个元素 |\n" +"|-----------|------------|-------------|-------------|-----|------------------|------------|\n" +"| 正向 | `0` | `1` | `2` | ... | `len(x) - 2` |`len(x) - 1`|\n" +"| 反向 | `-len(x)` |`-len(x) + 1`|`-len(x) + 2`| ... | `-2` | `-1` |\n" +"\n" +"下一个练习：\n" +"\n" +"这次，你将创建一个新列表 `y`，而不是修改列表 `x`：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"`y` 应该与 `x` 相同，但在末尾也有第一个元素的重复。\n" +"因此程序将打印 `['a', 'b', 'c', 'a']`。" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. # __code0__: +#. some_list.pop(index) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.index +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.some_list +msgid "pages.FunctionsAndMethodsForLists.steps.pop_predict_exercise.text" +msgstr "" +"**`pop`**：使用以下语法移除并返回给定 *索引* 处的元素\n" +"\n" +"__code0__\n" +"\n" +"如果没有参数，即仅仅是 `some_list.pop()`，它将移除并返回最后一个元素。\n" +"如果 `index` 不是 `some_list` 的有效索引，则会引发错误。例如运行这个程序：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.pop_remove_index_subscript_assignment +msgid "" +"pages.FunctionsAndMethodsForLists.steps.pop_remove_index_subscript_assignment.hints.0.text" +msgstr "" +"你的解决方案应该有正好三条语句：`x = ['a', 'b', 'c']`，然后一行从列表中精确复制（没有添加），以及 `print(x)`。" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.pop_remove_index_subscript_assignment +msgid "" +"pages.FunctionsAndMethodsForLists.steps.pop_remove_index_subscript_assignment.hints.1.text" +msgstr "将第一个元素移动到末尾需要两件事。" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.pop_remove_index_subscript_assignment +msgid "" +"pages.FunctionsAndMethodsForLists.steps.pop_remove_index_subscript_assignment.hints.2.text" +msgstr "移除第一个元素..." + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.pop_remove_index_subscript_assignment +msgid "" +"pages.FunctionsAndMethodsForLists.steps.pop_remove_index_subscript_assignment.hints.3.text" +msgstr "并将其添加到末尾。" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.pop_remove_index_subscript_assignment +msgid "" +"pages.FunctionsAndMethodsForLists.steps.pop_remove_index_subscript_assignment.hints.4.text" +msgstr "你可以使用哪些函数/方法来做到这一点？" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.pop_remove_index_subscript_assignment +msgid "" +"pages.FunctionsAndMethodsForLists.steps.pop_remove_index_subscript_assignment.hints.5.text" +msgstr "记住，第一个索引是 0。" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +msgid "" +"pages.FunctionsAndMethodsForLists.steps.pop_remove_index_subscript_assignment.requirements" +msgstr "" +"复制上面的三行，然后将 `(insert_one_line_from_above)` " +"替换为从之前的长列表中精确复制的一行。你必须选择正确的行，只有一个正确答案。准确输入这一行。" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. # __code0__: +#. x[len(x)] = x[0] +#. x[len(x) - 1] = x[0] +#. x[len(x) + 1] = x[0] +#. x + x[0] +#. [x] + x[0] +#. x + [x[0]] +#. [x] + [x[0]] +#. x + x.pop(0) +#. [x] + x.pop(0) +#. x + [x.pop(0)] +#. [x] + [x.pop(0)] +#. x.pop(x.append(0)) +#. x.append(x.pop(0)) +#. x.append(x[0]) +#. x.append(x.index(0)) +#. x.index(x.append(0)) +#. x.pop(x.index(0)) +#. x.index(x.pop(0)) +#. # __code1__: +#. x = ['a', 'b', 'c'] +#. (insert_one_line_from_above) +#. print(x) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.insert_one_line_from_above +msgid "" +"pages.FunctionsAndMethodsForLists.steps.pop_remove_index_subscript_assignment.text" +msgstr "" +"现在你将解决四个简短的练习，涉及这些概念。\n" +"下面是一组正确和错误的代码行混合在一起。\n" +"每个即将到来的练习都有一个解决方案，其中包含下面的正好一行，\n" +"你必须从列表中找到正确的行。\n" +"\n" +"__code0__\n" +"\n" +"这是一个不完整的程序：\n" +"\n" +" __copyable__\n" +"__code1__\n" +"\n" +"用上面列表中的一行替换中间行。最终程序应该修改 `x`，将第一个元素移动到末尾，以便打印 `['b', 'c', 'a']`。" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.remove_exercise +msgid "pages.FunctionsAndMethodsForLists.steps.remove_exercise.hints.0.text" +msgstr "你的解决方案应该有正好三条语句：`x = [1, 2, 0, 3]`，一行从列表中精确复制（没有添加），以及 `print(x)`。" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.remove_exercise +msgid "pages.FunctionsAndMethodsForLists.steps.remove_exercise.hints.1.text" +msgstr "`x.remove(0)` 做了什么？" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.remove_exercise +msgid "pages.FunctionsAndMethodsForLists.steps.remove_exercise.hints.2.text" +msgstr "它移除一个元素！" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.remove_exercise +msgid "pages.FunctionsAndMethodsForLists.steps.remove_exercise.hints.3.text" +msgstr "哪个函数/方法也可以移除一个元素？" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.remove_exercise +msgid "pages.FunctionsAndMethodsForLists.steps.remove_exercise.hints.4.text" +msgstr "另一个函数/方法不能简单地被告知“移除 0”，它需要不同类型的信息。" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.remove_exercise +msgid "pages.FunctionsAndMethodsForLists.steps.remove_exercise.hints.5.text" +msgstr "具体来说，它需要被告知 0 在哪里。" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.remove_exercise +msgid "pages.FunctionsAndMethodsForLists.steps.remove_exercise.hints.6.text" +msgstr "哪个函数/方法提供那种信息？" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +msgid "pages.FunctionsAndMethodsForLists.steps.remove_exercise.requirements" +msgstr "" +"复制上面的三行，然后将 `x.remove(0)` 替换为从之前的长列表中精确复制的一行。你选择的行应该与 `x.remove(0)` " +"有相同的效果，以便程序打印 `[1, 2, 3]`。" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. # __code0__: +#. x = [1, 2, 0, 3] +#. x.remove(0) +#. print(x) +msgid "pages.FunctionsAndMethodsForLists.steps.remove_exercise.text" +msgstr "" +"干得好。现在是最后一个练习：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"用列表中的一行替换中间行 `x.remove(0)`，使其完成同样的功能。" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. # __code0__: +#. some_list.remove(value) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.some_list +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.value +msgid "pages.FunctionsAndMethodsForLists.steps.remove_predict_exercise.text" +msgstr "" +"**`remove`**：使用以下语法移除给定 *值* 的第一个出现\n" +"\n" +"__code0__\n" +"\n" +"如果该值不在列表中，则会引发错误。例如运行这个程序：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.subscript_assignment_exercise +msgid "" +"pages.FunctionsAndMethodsForLists.steps.subscript_assignment_exercise.hints.0.text" +msgstr "" +"你的解决方案应该有正好三条语句：`x = ['a', 'b', 'c']`，然后一行从列表中精确复制（没有添加），以及 `print(x)`。" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.subscript_assignment_exercise +msgid "" +"pages.FunctionsAndMethodsForLists.steps.subscript_assignment_exercise.hints.1.text" +msgstr "你需要获取 `x` 中第一个元素的值..." + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.subscript_assignment_exercise +msgid "" +"pages.FunctionsAndMethodsForLists.steps.subscript_assignment_exercise.hints.2.text" +msgstr "并将该值赋给 `x` 中的最后一个位置。" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.subscript_assignment_exercise +msgid "" +"pages.FunctionsAndMethodsForLists.steps.subscript_assignment_exercise.hints.3.text" +msgstr "如何在列表中指定索引处赋值？" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.subscript_assignment_exercise +msgid "" +"pages.FunctionsAndMethodsForLists.steps.subscript_assignment_exercise.hints.4.text" +msgstr "`x` 中第一个和最后一个元素的索引是多少？" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +msgid "" +"pages.FunctionsAndMethodsForLists.steps.subscript_assignment_exercise.requirements" +msgstr "" +"复制上面的三行，然后将 `(insert_one_line_from_above)` " +"替换为从上一步的长列表中精确复制的一行。你必须选择正确的行，只有一个正确答案。准确输入这一行。" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. # __code0__: +#. x = ['a', 'b', 'c'] +#. (insert_one_line_from_above) +#. print(x) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.insert_one_line_from_above +msgid "" +"pages.FunctionsAndMethodsForLists.steps.subscript_assignment_exercise.text" +msgstr "" +"干得不错。在下一个练习中，从同一个不完整的程序开始：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"从列表中选择一行代码，将 `x` 的最后一个元素覆盖为第一个元素，\n" +"这样现在应该打印 `['a', 'b', 'a']`。" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +#. # __code0__: +#. some_list[index] = new_value +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.index +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.new_value +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.some_list +msgid "" +"pages.FunctionsAndMethodsForLists.steps.subscript_assignment_predict.text" +msgstr "" +"如你所见，`+` 不会修改 `nums`，但 `append` 会。\n" +"\n" +"这里有一些新东西。\n" +"\n" +"**`索引赋值`**：使用以下语法在索引处设置一个值（替换之前的值）\n" +"\n" +"__code0__\n" +"\n" +"如果 `index` 不是 `some_list` 的有效索引，则会引发错误。例如，运行这个程序：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#FunctionsAndMethodsForLists +msgid "pages.FunctionsAndMethodsForLists.title" +msgstr "列表的函数和方法" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +msgid "pages.GettingElementsAtPosition.steps.final_text.text" +msgstr "" +"如果你对 `range` 和/或 `len` 还不太熟悉，可以多练习和尝试一下。\n" +"这里有一些简单的练习，你可以自己试试。\n" +"\n" +"- 打印从 `1` 到 `100` 的所有数字（包括100）。\n" +"- 打印你的名字 100 次。\n" +"- 打印列表 `words` 中的每个单词，除了最后一个。\n" +"- 反向打印 `words` 中的每个单词，也就是说，先打印最后一个单词，然后是倒数第二个单词，依此类推。\n" +"- 回顾一下 [介绍列表](#IntroducingLists) 末尾的奖励问题，\n" +"无论你是否完成了它。现在用 `range` 和 `len` 会简单得多！\n" +"\n" +"当你准备好后，继续到下一页，挑战一下更难的内容。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.index_error +msgid "pages.GettingElementsAtPosition.steps.index_error.program" +msgstr "words[4]" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +msgid "pages.GettingElementsAtPosition.steps.index_error.requirements" +msgstr "运行类似 `words[3]` 的代码，但把 `3` 替换成一个更大的数字。" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +msgid "pages.GettingElementsAtPosition.steps.index_error.text" +msgstr "" +"通常，你可以用 `words[i]` 来获取位置为 `i` 的元素。这个操作叫做 *下标* 或 *索引*，而这个位置被称为 *索引*。\n" +"\n" +"你可能注意到了，第一个索引是 0，而不是 1。在编程中，计数是从 0 开始的。这看起来有点奇怪，但大多数编程语言都是这样做的，而且一般认为这样更好。\n" +"\n" +"这也意味着，在这个包含 4 个元素的列表中，最后一个索引是 3。如果你尝试获取一个更大的索引，会发生什么呢？" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +msgid "pages.GettingElementsAtPosition.steps.indices_out_of_bounds.text" +msgstr "现在在命令行中尝试 `__program__`。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.introducing_len_and_range +msgid "" +"pages.GettingElementsAtPosition.steps.introducing_len_and_range.output_prediction_choices.0" +msgstr "" +"This\n" +"is\n" +"a\n" +"list" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.introducing_len_and_range +msgid "" +"pages.GettingElementsAtPosition.steps.introducing_len_and_range.output_prediction_choices.2" +msgstr "" +"0\n" +"This\n" +"1\n" +"is\n" +"2\n" +"a\n" +"3\n" +"list" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.introducing_len_and_range +msgid "" +"pages.GettingElementsAtPosition.steps.introducing_len_and_range.output_prediction_choices.3" +msgstr "" +"This\n" +"0\n" +"is\n" +"1\n" +"a\n" +"2\n" +"list\n" +"3" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.introducing_len_and_range +msgid "" +"pages.GettingElementsAtPosition.steps.introducing_len_and_range.output_prediction_choices.4" +msgstr "" +"0\n" +"1\n" +"2\n" +"3\n" +"This\n" +"is\n" +"a\n" +"list" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.introducing_len_and_range +msgid "" +"pages.GettingElementsAtPosition.steps.introducing_len_and_range.output_prediction_choices.5" +msgstr "" +"This\n" +"is\n" +"a\n" +"list\n" +"0\n" +"1\n" +"2\n" +"3" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.introducing_len_and_range +msgid "" +"pages.GettingElementsAtPosition.steps.introducing_len_and_range.program" +msgstr "" +"words = ['This', 'is', 'a', 'list']\n" +"indices = [0, 1, 2, 3]\n" +"\n" +"for index in indices:\n" +" print(index)\n" +" print(words[index])" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +msgid "pages.GettingElementsAtPosition.steps.introducing_len_and_range.text" +msgstr "" +"看，这样 `words[4]` 及更大的索引是不存在的，所以尝试这样会报错。\n" +"那个第一个程序有点重复。让我们用列表和循环来改进它！\n" +"\n" +"__program_indented__" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.introducing_subscripting +msgid "pages.GettingElementsAtPosition.steps.introducing_subscripting.program" +msgstr "" +"words = ['This', 'is', 'a', 'list']\n" +"\n" +"print(words[0])\n" +"print(words[1])\n" +"print(words[2])\n" +"print(words[3])" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +msgid "pages.GettingElementsAtPosition.steps.introducing_subscripting.text" +msgstr "" +"循环是很好的，但通常你只是想从已知位置的列表中检索单个元素。\n" +"这就是方法：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.print_indices_and_words +msgid "" +"pages.GettingElementsAtPosition.steps.print_indices_and_words.hints.0.text" +msgstr "记得我们之前用过 `range(4)`。" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.print_indices_and_words +msgid "" +"pages.GettingElementsAtPosition.steps.print_indices_and_words.hints.1.text" +msgstr "这次，它应该适用于任何列表。如果列表有 5 个元素，或者 10 个呢？" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.print_indices_and_words +msgid "" +"pages.GettingElementsAtPosition.steps.print_indices_and_words.hints.2.text" +msgstr "把你学到的两个函数结合起来！" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +#. # __code0__: +#. [0, 1, 2, ..., len(words) - 2, len(words) - 1] +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.words +msgid "pages.GettingElementsAtPosition.steps.print_indices_and_words.text" +msgstr "" +"所以一般来说，有效的索引是：\n" +"\n" +"__code0__\n" +"\n" +"现在我们可以修复之前的程序，使其适用于任何列表。填入 `...`：\n" +"\n" +" __copyable__\n" +" __no_auto_translate__\n" +" words = ['This', 'is', 'a', 'list']\n" +"\n" +" for index in ...:\n" +" print(index)\n" +" print(words[index])\n" +"\n" +"对于给定的 `words` 示例值，它应该打印：\n" +"\n" +" 0\n" +" This\n" +" 1\n" +" is\n" +" 2\n" +" a\n" +" 3\n" +" list" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.print_last_element +msgid "pages.GettingElementsAtPosition.steps.print_last_element.hints.0.text" +msgstr "要访问列表的最后一个元素，你需要最后一个位置的索引。" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.print_last_element +msgid "pages.GettingElementsAtPosition.steps.print_last_element.hints.1.text" +msgstr "如果列表有 2 个元素，第一个元素在索引 0，所以最后一个元素在索引 1。" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.print_last_element +msgid "pages.GettingElementsAtPosition.steps.print_last_element.hints.2.text" +msgstr "同样，如果列表有 3 个元素，最后一个元素在索引 2。" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.print_last_element +msgid "pages.GettingElementsAtPosition.steps.print_last_element.hints.3.text" +msgstr "你看到这些数字之间的规律了吗？你能怎么表达它？" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.print_last_element +msgid "pages.GettingElementsAtPosition.steps.print_last_element.hints.4.text" +msgstr "你能想出一个适用于任何长度的通用解决方案吗？" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +msgid "pages.GettingElementsAtPosition.steps.print_last_element.text" +msgstr "" +"练习：对于任何非空列表 `words`，打印最后一个元素。例如，如果\n" +"\n" +" __no_auto_translate__\n" +" words = ['This', 'is', 'a', 'list']\n" +"\n" +"你的程序应该打印 `list`。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.printing_the_range +msgid "" +"pages.GettingElementsAtPosition.steps.printing_the_range.output_prediction_choices.4" +msgstr "" +"This\n" +"is\n" +"a\n" +"list" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.GettingElementsAtPosition.steps.printing_the_range.text" +msgstr "" +"如你所见，结果是一样的。试试这个：\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +msgid "" +"pages.GettingElementsAtPosition.steps.range_almost_the_same_as_list.text" +msgstr "`range(4)` 和 `[0, 1, 2, 3]` 是一样的……几乎是。试试 `__program__` 在命令行中。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.range_len +msgid "pages.GettingElementsAtPosition.steps.range_len.program" +msgstr "" +"words = ['This', 'is', 'a', 'list']\n" +"indices = range(4)\n" +"\n" +"for index in indices:\n" +" print(index)\n" +" print(words[index])" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +msgid "pages.GettingElementsAtPosition.steps.range_len.requirements" +msgstr "运行前一步的相同程序，但将第二行 `indices = [0, 1, 2, 3]` 替换为 `indices = range(4)`。" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +msgid "pages.GettingElementsAtPosition.steps.range_len.text" +msgstr "" +"这要好一些，但写出 `[0, 1, 2, ...]` 并不好，特别是如果它很长的话。\n" +"有一个方便的函数 `range` 可以为你完成这部分。将 `[0, 1, 2, 3]` 替换为 `range(4)`，\n" +"也就是 `indices = range(4)`。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.range_versus_list +msgid "" +"pages.GettingElementsAtPosition.steps.range_versus_list.output_prediction_choices.0" +msgstr "range(4)" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.range_versus_list +msgid "" +"pages.GettingElementsAtPosition.steps.range_versus_list.output_prediction_choices.1" +msgstr "range(0, 4)" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.range_versus_list +msgid "" +"pages.GettingElementsAtPosition.steps.range_versus_list.output_prediction_choices.2" +msgstr "list(range(4))" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.range_versus_list +msgid "" +"pages.GettingElementsAtPosition.steps.range_versus_list.output_prediction_choices.3" +msgstr "list(range(0, 4))" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.range_versus_list +msgid "" +"pages.GettingElementsAtPosition.steps.range_versus_list.output_prediction_choices.4" +msgstr "range(0, 1, 2, 3)" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +msgid "pages.GettingElementsAtPosition.steps.range_versus_list.text" +msgstr "" +"这可能有点令人惊讶。如果你感到好奇，`0` 代表范围的起始。\n" +"`0` 是默认起始，所以 `range(4)` 等于 `range(0, 4)`。\n" +"`4` 是范围的结束，但结束总是被排除，所以最后的值是 `3`。\n" +"如果你现在感到困惑，不用担心。\n" +"\n" +"`range(4)` 不是一个列表是有很好的理由的——它让程序更快、更高效。\n" +"现在不值得详细解释这个。\n" +"\n" +"但你可以很容易地将其转换为列表：在命令行中尝试 `__program__`。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.using_len_first_time +msgid "pages.GettingElementsAtPosition.steps.using_len_first_time.program" +msgstr "" +"words = ['This', 'is', 'a', 'list']\n" +"print(len(words))" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +#. # __code0__: +#. [0, 1, 2, ..., n - 2, n - 1] +#. # __code1__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.GettingElementsAtPosition.steps.using_len_first_time.text" +msgstr "" +"这只是一个演示，让你以更熟悉的形式看到范围。\n" +"你几乎不应该这样做。\n" +"\n" +"如果你感到不知所措，不用担心！你只需要知道 `range(n)`\n" +"与列表非常相似：\n" +"\n" +"__code0__\n" +"\n" +"顺便说一下，你可以使用 `len` 函数获取列表中的元素数量（通常称为 *长度*）。\n" +"通过运行以下代码来尝试一下：\n" +"\n" +" __copyable__\n" +"__code1__" + +#. https://futurecoder.io/course/#GettingElementsAtPosition +msgid "pages.GettingElementsAtPosition.title" +msgstr "获取位置上的元素，`range()` 和 `len()`" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +msgid "pages.GettingElementsAtPositionExercises.steps.final_text.text" +msgstr "太棒了！休息一下，你值得拥有！" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.index_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.index_exercise.hints.0.text" +msgstr "你需要查看 `things` 的所有可能索引，并检查哪个是答案。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.index_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.index_exercise.hints.1.text" +msgstr "要查看所有可能的索引，你需要使用 `range(len(things))` 的循环。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.index_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.index_exercise.hints.2.text" +msgstr "要检查某个索引是否是答案，你需要使用：" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.index_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.index_exercise.hints.3.text" +msgstr "- `if`" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.index_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.index_exercise.hints.4.text" +msgstr "- 在下标中使用索引" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.index_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.index_exercise.hints.5.text" +msgstr "- `==`" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.index_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.index_exercise.hints.6.text" +msgstr "由于你在寻找第一个索引，一旦找到就需要停止循环。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.index_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.index_exercise.hints.7.text" +msgstr "你最近学会了如何在中间停止循环。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.index_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.index_exercise.hints.8.text" +msgstr "你需要使用 `break`。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.index_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.index_exercise.messages.all_indices.text" +msgstr "" +"你快到了！但是，这会打印所有的索引，\n" +"而不仅仅是第一个。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.index_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.index_exercise.messages.last_index.text" +msgstr "" +"你快到了！但是，这会打印 *最后* 一个索引，\n" +"而不是第一个。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +msgid "pages.GettingElementsAtPositionExercises.steps.index_exercise.text" +msgstr "" +"给定一个列表 `things` 和一个值 `to_find`，\n" +"打印 `to_find` 在列表中的第一个索引，即最低的数字 `i`，使得\n" +"`things[i]` 是 `to_find`。例如，对于\n" +"\n" +" __no_auto_translate__\n" +" things = ['on', 'the', 'way', 'to', 'the', 'store']\n" +" to_find = 'the'\n" +"\n" +"你的程序应该打印 `1`。\n" +"\n" +"你可以假设 `to_find` 至少出现一次。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_exercise.hints.0.text" +msgstr "你在命令行中尝试过字符串的索引和 `len()` 吗？" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_exercise.hints.1.text" +msgstr "暂时忘记循环。你如何仅打印第一行，它包含两个字符串的第一个字符？" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_exercise.hints.2.text" +msgstr "在第二行，你想打印每个字符串的第二个字符，以此类推。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_exercise.hints.3.text" +msgstr "你需要一个 `for` 循环。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_exercise.hints.4.text" +msgstr "你需要索引（下标）。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_exercise.hints.5.text" +msgstr "你需要 `range`。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_exercise.hints.6.text" +msgstr "你需要 `len`。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_exercise.hints.7.text" +msgstr "你需要 `+`。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_exercise.hints.8.text" +msgstr "你需要对两个字符串进行索引。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_exercise.hints.9.text" +msgstr "你需要每次将相同的索引传递给两个字符串，以检索匹配的字符。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +msgid "pages.GettingElementsAtPositionExercises.steps.zip_exercise.text" +msgstr "" +"很好！\n" +"\n" +"顺便说一下，索引和 `len()` 也同样适用于字符串。在命令行中试试看。\n" +"\n" +"这是另一个练习。给定两个相同长度的字符串，例如：\n" +"\n" +" __no_auto_translate__\n" +" string1 = 'Hello'\n" +" string2 = 'World'\n" +"\n" +"将它们垂直并排打印，每个字符之间留一个空格：\n" +"\n" +" H W\n" +" e o\n" +" l r\n" +" l l\n" +" o d" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise.hints.0.text" +msgstr "这个解决方案与之前的解决方案有相同的整体结构和基本元素，但它明显更长，并且需要一些额外的想法和部分。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. # __code0__: +#. for i in range(...): +#. ... +#. print(char1 + ' ' + char2) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.char1 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.char2 +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise.hints.1.text" +msgstr "" +"特别是，它仍然应该包含类似于：\n" +"\n" +"__code0__" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise.hints.2.text" +msgstr "`range()` 中应该放什么？`len(string1)` 或 `len(string2)` 都不够好。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise.hints.3.text" +msgstr "你想为更长字符串中的每个字符进行一次循环迭代。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise.hints.4.text" +msgstr "这意味着你需要 `range(<最长字符串的长度>)`" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise.hints.5.text" +msgstr "换句话说，你需要找到两个值中最大的 `len(string1)` 和 `len(string2)`。你已经做过类似的练习。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise.hints.6.text" +msgstr "" +"一旦你理清了 `for i in range(...)`，`i` 有时会太大，无法成为两个字符串的有效索引。你需要在索引之前检查它是否太大。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise.hints.7.text" +msgstr "记住，`string1` 的最大有效索引是 `len(string1) - 1`。`len(string1)` 太大了。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise.hints.8.text" +msgstr "你需要两个 `if` 语句，一个针对每个字符串。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise.hints.9.text" +msgstr "当 `string1[i]` 无效时，你需要设置例如 `char1 = ' '`。" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +#. # __code0__: +#. for i in range(len(string1)): +#. char1 = string1[i] +#. char2 = string2[i] +#. print(char1 + ' ' + char2) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.char1 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.char2 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.string1 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.string2 +msgid "" +"pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise.text" +msgstr "" +"难以置信！\n" +"\n" +"你的解决方案可能看起来像这样：\n" +"\n" +"__code0__\n" +"\n" +"如果字符串长度不同，这样做就不太好。\n" +"实际上，这会根据 `string1` 或 `string2` 的长度不同而出现不同的问题。\n" +"你下一个挑战是通过用空格填充“缺失”的字符来解决这个问题。\n" +"\n" +"例如，对于：\n" +"\n" +" __no_auto_translate__\n" +" string1 = 'Goodbye'\n" +" string2 = 'World'\n" +"\n" +"输出：\n" +"\n" +" G W\n" +" o o\n" +" o r\n" +" d l\n" +" b d\n" +" y\n" +" e\n" +"\n" +"而对于：\n" +"\n" +" __no_auto_translate__\n" +" string1 = 'Hello'\n" +" string2 = 'Elizabeth'\n" +"\n" +"输出：\n" +"\n" +" H E\n" +" e l\n" +" l i\n" +" l z\n" +" o a\n" +" b\n" +" e\n" +" t\n" +" h" + +#. https://futurecoder.io/course/#GettingElementsAtPositionExercises +msgid "pages.GettingElementsAtPositionExercises.title" +msgstr "使用 `range()` 和 `len()` 的练习" + +#. https://futurecoder.io/course/#HowToFindInformationWithGoogleAndMore +msgid "pages.HowToFindInformationWithGoogleAndMore.steps.dir_list.text" +msgstr "" +"完美！\n" +"\n" +"使用 Google 搜索“python list tutorial”这样的内容也很有用，比如说：\n" +"\n" +"- 当你搜索一个特定的方法失败时，你想手动找到它。\n" +"- 在这门课程后你对列表仍然感到困惑。\n" +"- 自从你学习列表以来已经有一段时间了，你需要提醒自己。\n" +"- 你在解决与列表相关的问题时遇到困难，需要回到基础，巩固你的基础知识。\n" +"\n" +"还有一些方法可以在不使用 Google 的情况下找到信息。尝试在命令行中输入 `__program__`。" + +#. https://futurecoder.io/course/#HowToFindInformationWithGoogleAndMore +msgid "pages.HowToFindInformationWithGoogleAndMore.steps.final_text.text" +msgstr "" +"`dir()` 返回一个参数的属性列表，这些属性大多数是方法。许多方法会以 `__` 开头，你现在可以忽略它们 - " +"滚动到列表的末尾，你会看到一些熟悉的方法。" + +#. https://futurecoder.io/course/#HowToFindInformationWithGoogleAndMore +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.HowToFindInformationWithGoogleAndMore.steps.list_insert +msgid "" +"pages.HowToFindInformationWithGoogleAndMore.steps.list_insert.hints.0.text" +msgstr "在你的搜索查询中使用“python”和“list”这两个词。" + +#. https://futurecoder.io/course/#HowToFindInformationWithGoogleAndMore +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.HowToFindInformationWithGoogleAndMore.steps.list_insert +msgid "" +"pages.HowToFindInformationWithGoogleAndMore.steps.list_insert.hints.1.text" +msgstr "我们想把值放在 ____________，而不是放在开头或结尾？" + +#. https://futurecoder.io/course/#HowToFindInformationWithGoogleAndMore +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.HowToFindInformationWithGoogleAndMore.steps.list_insert +msgid "" +"pages.HowToFindInformationWithGoogleAndMore.steps.list_insert.hints.2.text" +msgstr "'中间' 或 '在某个索引' 或 '在特定位置'" + +#. https://futurecoder.io/course/#HowToFindInformationWithGoogleAndMore +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.HowToFindInformationWithGoogleAndMore.steps.list_insert +msgid "" +"pages.HowToFindInformationWithGoogleAndMore.steps.list_insert.hints.3.text" +msgstr "'python 在索引处添加值'" + +#. https://futurecoder.io/course/#HowToFindInformationWithGoogleAndMore +msgid "" +"pages.HowToFindInformationWithGoogleAndMore.steps.list_insert.requirements" +msgstr "" +"运行与上面三行类似的代码，但将 `nums.append(9)` 改为正确的函数/方法调用\n" +"以将 9 放在第二个元素（在示例 `nums = [1, 2, 3, 4, 5]` 中是 2）之后，而不是放在最后。\n" +"中间那行应该有且只有一个正确答案。\n" +"你需要在线搜索以找出应该使用哪个函数/方法以及如何使用它。" + +#. https://futurecoder.io/course/#HowToFindInformationWithGoogleAndMore +#. # __code0__: +#. nums = [1, 2, 3, 4, 5] +#. nums.append(9) +#. print(nums) +#. # __code1__: +#. [1, 2, 3, 4, 5, 9] +#. # __code2__: +#. [1, 2, 9, 3, 4, 5] +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.nums +msgid "pages.HowToFindInformationWithGoogleAndMore.steps.list_insert.text" +msgstr "" +"找得好！我们再做一个。考虑这个程序：\n" +"\n" +"__code0__\n" +"\n" +"这会改变 `nums`，使其打印：\n" +"\n" +"__code1__\n" +"\n" +"但假设你不想让 9 在最后，你想让它在第二个和第三个元素之间，所以输出是：\n" +"\n" +"__code2__\n" +"\n" +"将中间那行 `nums.append(9)` 替换为正确的函数/方法调用来实现这一点。" + +#. https://futurecoder.io/course/#HowToFindInformationWithGoogleAndMore +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.HowToFindInformationWithGoogleAndMore.steps.sum_list +msgid "" +"pages.HowToFindInformationWithGoogleAndMore.steps.sum_list.hints.0.text" +msgstr "在你的搜索查询中使用“python”和“list”这两个词。" + +#. https://futurecoder.io/course/#HowToFindInformationWithGoogleAndMore +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.HowToFindInformationWithGoogleAndMore.steps.sum_list +msgid "" +"pages.HowToFindInformationWithGoogleAndMore.steps.sum_list.hints.1.text" +msgstr "用一个词来说，`91` 在列表 `[21, 55, 4, 91, 62, 49]` 中有什么特别之处？" + +#. https://futurecoder.io/course/#HowToFindInformationWithGoogleAndMore +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.HowToFindInformationWithGoogleAndMore.steps.sum_list +msgid "" +"pages.HowToFindInformationWithGoogleAndMore.steps.sum_list.hints.2.text" +msgstr "'最大' 或 '最大的'" + +#. https://futurecoder.io/course/#HowToFindInformationWithGoogleAndMore +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.HowToFindInformationWithGoogleAndMore.steps.sum_list +msgid "" +"pages.HowToFindInformationWithGoogleAndMore.steps.sum_list.hints.3.text" +msgstr "'python 列表中最大值'" + +#. https://futurecoder.io/course/#HowToFindInformationWithGoogleAndMore +msgid "" +"pages.HowToFindInformationWithGoogleAndMore.steps.sum_list.requirements" +msgstr "" +"运行类似于 `sum([21, 55, 4, 91, 62, 49])` 的代码，但将 `sum` 替换为另一个特定函数的名称。\n" +"只有一个正确答案可以使用哪个函数。你需要在线搜索以找出哪个。\n" +"这是 Python 中一个常用的内置函数。" + +#. https://futurecoder.io/course/#HowToFindInformationWithGoogleAndMore +msgid "pages.HowToFindInformationWithGoogleAndMore.steps.sum_list.text" +msgstr "" +"知道我们刚刚讨论的函数是很有用的，但学习所有函数并不容易，还有很多其他函数。更重要的技能是能够查找信息。例如，如果你忘记了这些函数的名称，这里有一些典型的搜索方式：\n" +"\n" +"- `append`\n" +" - python 向列表添加元素\n" +" - python 在列表末尾添加项目\n" +"- `len`\n" +" - python 列表的大小\n" +" - python 列表中的元素数量\n" +" - python 字符串中有多少个字符\n" +"- `sum`\n" +" - python 添加数字列表\n" +" - python 数字的总和\n" +"- `in`\n" +" - python 检查列表是否包含值\n" +" - python 测试列表是否有元素\n" +"- `index`\n" +" - python 获取元素的位置\n" +" - python 获取值的索引\n" +"\n" +"现在让我们练习这个技能。找一个函数/方法，它返回列表中比其他任何值都大的值。例如，给定列表 `[21, 55, 4, 91, 62, 49]`，它将返回 `91`。你应该在命令行中写下这个答案，作为一个小表达式。例如，如果你在寻找函数 `sum`，你可以写 `sum([21, 55, 4, 91, 62, 49])`。不要手动用循环来解决这个问题。注意，你要找的函数在这里之前没有提到过。" + +#. https://futurecoder.io/course/#HowToFindInformationWithGoogleAndMore +msgid "pages.HowToFindInformationWithGoogleAndMore.title" +msgstr "如何使用 Google 查找信息，以及更多" + +#. https://futurecoder.io/course/#IfAndElse +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.capitalise +msgid "pages.IfAndElse.steps.capitalise.hints.0.text" +msgstr "你已经学会了完成这个任务所需的所有工具。我相信你！看看之前的程序获取灵感吧。" + +#. https://futurecoder.io/course/#IfAndElse +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.capitalise +msgid "pages.IfAndElse.steps.capitalise.hints.1.text" +msgstr "你需要一个循环来逐个字符构建新的句子。" + +#. https://futurecoder.io/course/#IfAndElse +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.capitalise +msgid "pages.IfAndElse.steps.capitalise.hints.2.text" +msgstr "你需要一个 `if/else` 来决定是添加大写字母还是小写字母。" + +#. https://futurecoder.io/course/#IfAndElse +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.capitalise +msgid "pages.IfAndElse.steps.capitalise.hints.3.text" +msgstr "你的 `if/else` 需要根据循环的不同迭代执行不同的代码块。" + +#. https://futurecoder.io/course/#IfAndElse +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.capitalise +msgid "pages.IfAndElse.steps.capitalise.hints.4.text" +msgstr "这意味着你的 `if` 条件需要是一个在循环内改变的变量。" + +#. https://futurecoder.io/course/#IfAndElse +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.capitalise +msgid "pages.IfAndElse.steps.capitalise.hints.5.text" +msgstr "在第一次迭代中你需要一个大写字母。在接下来的迭代中你需要一个小写字母。" + +#. https://futurecoder.io/course/#IfAndElse +msgid "pages.IfAndElse.steps.capitalise.text" +msgstr "" +"该挑战开始了！\n" +"\n" +"写一个程序，给定一个字符串 `sentence`，打印一个修改后的版本，\n" +"其中第一个字母大写，其余字母小写。\n" +"例如，无论输入 `sentence = 'hello world'`\n" +"还是 `'HELLO WORLD'`，输出都应该是 `Hello world`。" + +#. https://futurecoder.io/course/#IfAndElse +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.else_full_stop +msgid "pages.IfAndElse.steps.else_full_stop.hints.0.text" +msgstr "不要改变已经存在的内容，只需添加一点代码。" + +#. https://futurecoder.io/course/#IfAndElse +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.else_full_stop +msgid "pages.IfAndElse.steps.else_full_stop.hints.1.text" +msgstr "`else` 需要紧接在 `if` 代码块之后，中间不要有其他内容。" + +#. https://futurecoder.io/course/#IfAndElse +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.else_full_stop +msgid "pages.IfAndElse.steps.else_full_stop.hints.2.text" +msgstr "`sentence += char` 无论 `excited` 是 `True` 还是 `False` 都需要执行。" + +#. https://futurecoder.io/course/#IfAndElse +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.else_full_stop +msgid "pages.IfAndElse.steps.else_full_stop.hints.3.text" +msgstr "你 *可以* 在 `if` 和 `else` 块中都有一份 `sentence += char`，但有更好的方法。" + +#. https://futurecoder.io/course/#IfAndElse +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.else_full_stop +msgid "pages.IfAndElse.steps.else_full_stop.hints.4.text" +msgstr "使用 `else` 来为 `char` 赋一个不同的值。" + +#. https://futurecoder.io/course/#IfAndElse +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.else_full_stop +msgid "pages.IfAndElse.steps.else_full_stop.hints.5.text" +msgstr "如果 `excited` 是 `False`，那么 `char` 应该是 `'.'` 而不是 `'!'`。" + +#. https://futurecoder.io/course/#IfAndElse +msgid "pages.IfAndElse.steps.else_full_stop.text" +msgstr "" +"如果 `excited` 为真，那么 `char` 被定义，一切运行正常。但如果不是，\n" +"`char` 从未被赋值，因此在 `sentence += char` 中使用它会失败。\n" +"\n" +"通过向 `if` 添加一个 `else` 子句来修复这个问题，这样如果 `excited` 为假，句子的末尾就会添加一个句号（`.`）而不是感叹号（`!`）。" + +#. https://futurecoder.io/course/#IfAndElse +msgid "pages.IfAndElse.steps.final_text.text" +msgstr "完美！花点时间为你所取得的成就感到自豪。你能感觉到你的大脑在成长吗？" + +#. https://futurecoder.io/course/#IfAndElse +msgid "pages.IfAndElse.steps.first_if_else.text" +msgstr "" +"一个 `if` 语句可以选择性地有一个 `else` 部分。运行这个例子：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IfAndElse +msgid "pages.IfAndElse.steps.first_if_else_false.requirements" +msgstr "运行上一步的相同程序，但将 `True` 替换为 `False`，使得 `condition = False`。" + +#. https://futurecoder.io/course/#IfAndElse +msgid "pages.IfAndElse.steps.first_if_else_false.text" +msgstr "现在将第一行改为 `condition = False` 并再次运行它。" + +#. https://futurecoder.io/course/#IfAndElse +msgid "pages.IfAndElse.steps.if_upper_else_lower.text" +msgstr "" +"将 `else` 理解为“否则”或“否则的话”。这意味着如果 `if` 中的条件\n" +"为假，那么 `else` 的代码块将会执行。无论条件是真还是假，\n" +"两个代码块中恰好有一个会执行。\n" +"\n" +"这是一个更有趣的例子可以运行：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IfAndElse +msgid "pages.IfAndElse.steps.if_upper_else_lower_false.requirements" +msgstr "运行上一步的相同程序，但将 `True` 替换为 `False`，使得 `excited = False`。" + +#. https://futurecoder.io/course/#IfAndElse +msgid "pages.IfAndElse.steps.if_upper_else_lower_false.text" +msgstr "" +"`sentence.upper()` 是一种我们还没有遇到的新表达式。这里发生的事情是 `sentence` 是一个字符串，字符串有各种 *方法* 让你方便地计算出新的值，包括 `upper` 和 `lower`。这些名称指的是大写字母（大写字母）和小写字母（小写字母）。`'Hello World'.upper()` 的结果是 `'HELLO WORLD'`。不过，它不会改变 `sentence` 的内容，因此你必须再次用 `sentence = sentence.upper()` 赋值。\n" +"\n" +"现在将 `excited` 改为 `False` 并再次运行它。" + +#. https://futurecoder.io/course/#IfAndElse +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.spongebob +msgid "pages.IfAndElse.steps.spongebob.hints.0.text" +msgstr "这与之前的练习类似。不同之处在于你设置条件变量的时间和位置。" + +#. https://futurecoder.io/course/#IfAndElse +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.spongebob +msgid "pages.IfAndElse.steps.spongebob.hints.1.text" +msgstr "你需要有一个布尔变量，它在每次迭代时都会改变。" + +#. https://futurecoder.io/course/#IfAndElse +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.spongebob +msgid "pages.IfAndElse.steps.spongebob.hints.2.text" +msgstr "" +"首先写一个小程序，接受一个布尔变量并翻转它，也就是说，如果变量是 `True`，它变为 `False`，如果它最开始是 `False`，则变为 " +"`True`。不需要循环，只需一个 `if/else`。" + +#. https://futurecoder.io/course/#IfAndElse +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.spongebob +msgid "pages.IfAndElse.steps.spongebob.hints.3.text" +msgstr "你需要在 `if` 条件中使用这个变量，并且在代码块中也要对同一个变量赋值。" + +#. https://futurecoder.io/course/#IfAndElse +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.spongebob +msgid "pages.IfAndElse.steps.spongebob.hints.4.text" +msgstr "将这个翻转的 `if/else` 与选择大写或小写字母的那个结合起来。" + +#. https://futurecoder.io/course/#IfAndElse +msgid "pages.IfAndElse.steps.spongebob.text" +msgstr "" +"太棒了！！！\n" +"\n" +"再来一个练习，然后你就可以放松了。\n" +"\n" +"写一个程序，以嘲讽的方式打印 `sentence`，例如：\n" +"\n" +" OnE MoRe eXeRcIsE, aNd tHeN YoU CaN ReLaX.\n" +"\n" +"每隔一个字符应该是小写，其余的应该是大写。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.undefined_char +msgid "pages.IfAndElse.steps.undefined_char.output_prediction_choices.0" +msgstr "Hello World" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.undefined_char +msgid "pages.IfAndElse.steps.undefined_char.output_prediction_choices.1" +msgstr "Hello World!" + +#. https://futurecoder.io/course/#IfAndElse +msgid "pages.IfAndElse.steps.undefined_char.requirements" +msgstr "" +"复制上面的程序。如果你想，可以按原样运行它。然后将 `excited = True` 改为 `excited = False` 并再次运行它。" + +#. https://futurecoder.io/course/#IfAndElse +#. # __code0__: +#. sentence = 'Hello World' +#. excited = True +#. if excited: +#. char = '!' +#. sentence += char +#. print(sentence) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27Hello+World%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.char +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.excited +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.sentence +msgid "pages.IfAndElse.steps.undefined_char.text" +msgstr "" +"这是一个有问题的程序：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"你能看到问题吗？如果你运行它，一切似乎都很好。可能出什么问题呢？\n" +"\n" +"下面是剧透！你找到了吗？\n" +"\n" +"如果你将 `excited` 改为 `False` 会发生什么？" + +#. https://futurecoder.io/course/#IfAndElse +msgid "pages.IfAndElse.title" +msgstr "`if` 和 `else`" + +#. https://futurecoder.io/course/#Indentation +msgid "pages.Indentation.steps.final_text.text" +msgstr "" +"当你缩进时，应该始终缩进4个空格。任何一致的缩进都是可以接受的，但4个空格是几乎所有人遵循的约定。请注意，编辑器通常会让你更容易做到这一点。例如，如果你在编辑器中按下键盘上的'Tab'键，它会为你插入4个空格。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Indentation.steps.mismatched_indentations +msgid "pages.Indentation.steps.mismatched_indentations.program" +msgstr "" +"for character in name:\n" +" print(character)\n" +" print('---')" + +#. https://futurecoder.io/course/#Indentation +msgid "pages.Indentation.steps.mismatched_indentations.text" +msgstr "" +"因为`print('---')`没有缩进，所以它不属于循环体。这意味着它只会在整个循环运行完毕后执行一次。这两个程序都是有效的，只是做的事情不同。\n" +"\n" +"下面的程序是无效的。循环体中的两行都缩进了，但缩进的数量不同。第一行以4个空格开始，第二行以2个空格开始。试着运行它。\n" +"\n" +"__program_indented__" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Indentation.steps.missing_indentation +msgid "pages.Indentation.steps.missing_indentation.program" +msgstr "" +"for character in name:\n" +"print(character)" + +#. https://futurecoder.io/course/#Indentation +#. # __code1__: +#. for character in name: +#. print(character) +#. # __code0__: +#. for character in name: print(character) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.character +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.name +msgid "pages.Indentation.steps.missing_indentation.text" +msgstr "" +"这个示例循环：\n" +"\n" +"__code0__\n" +"\n" +"可以运行，但实际上通常（并且应该）写成这样：\n" +"\n" +"__code1__\n" +"\n" +"具体来说，要重复的代码（称为*主体*）在冒号（`:`）后开始新的一行，并且必须*缩进*，即在前面有一些空格。下面没有缩进的代码是无效的，运行它来看看：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#Indentation +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.Indentation.steps.one_indented_line.text" +msgstr "" +"有两行缩进，所以它们都是主体的一部分，因此`---`在每个字符后都会被打印出来。现在尝试运行相同的代码，但最后一行没有缩进：\n" +"\n" +"__code0__" + +#. https://futurecoder.io/course/#Indentation +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.Indentation.steps.two_indented_lines.text" +msgstr "" +"空格是必需的，以告诉Python哪些代码行属于for循环的主体。当循环包含多行代码时，这一点至关重要，循环通常会这样做。例如，运行以下代码：\n" +"\n" +"__code0__" + +#. https://futurecoder.io/course/#Indentation +msgid "pages.Indentation.title" +msgstr "缩进" + +#. https://futurecoder.io/course/#InteractiveProgramsWithInput +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.convert_input_to_int +msgid "" +"pages.InteractiveProgramsWithInput.steps.convert_input_to_int.hints.0.text" +msgstr "`input()` 总是返回一个字符串。" + +#. https://futurecoder.io/course/#InteractiveProgramsWithInput +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.convert_input_to_int +msgid "" +"pages.InteractiveProgramsWithInput.steps.convert_input_to_int.hints.1.text" +msgstr "看起来像数字的字符串仍然是字符串，而不是数字。" + +#. https://futurecoder.io/course/#InteractiveProgramsWithInput +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.convert_input_to_int +msgid "" +"pages.InteractiveProgramsWithInput.steps.convert_input_to_int.hints.2.text" +msgstr "在 `super_secret_number = 7` 中，`7` 是一个数字，而不是字符串。" + +#. https://futurecoder.io/course/#InteractiveProgramsWithInput +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.convert_input_to_int +msgid "" +"pages.InteractiveProgramsWithInput.steps.convert_input_to_int.hints.3.text" +msgstr "这使得 `super_secret_number` 也是一个数字。" + +#. https://futurecoder.io/course/#InteractiveProgramsWithInput +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.convert_input_to_int +msgid "" +"pages.InteractiveProgramsWithInput.steps.convert_input_to_int.hints.4.text" +msgstr "字符串不能等于数字。" + +#. https://futurecoder.io/course/#InteractiveProgramsWithInput +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.convert_input_to_int +msgid "" +"pages.InteractiveProgramsWithInput.steps.convert_input_to_int.hints.5.text" +msgstr "要检查两个值是否相等，首先确保它们是相同类型的。" + +#. https://futurecoder.io/course/#InteractiveProgramsWithInput +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.convert_input_to_int +msgid "" +"pages.InteractiveProgramsWithInput.steps.convert_input_to_int.hints.6.text" +msgstr "所以要比较一个数字和一个字符串，首先将数字转换为字符串，或者将字符串转换为数字。" + +#. https://futurecoder.io/course/#InteractiveProgramsWithInput +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.convert_input_to_int +msgid "" +"pages.InteractiveProgramsWithInput.steps.convert_input_to_int.hints.7.text" +msgstr "你在上一页学会了如何在字符串和数字之间转换。" + +#. https://futurecoder.io/course/#InteractiveProgramsWithInput +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.convert_input_to_int +msgid "" +"pages.InteractiveProgramsWithInput.steps.convert_input_to_int.hints.8.text" +msgstr "使用 `int()` 将其转换为整数（整数）或使用 `str()` 将其转换为字符串。" + +#. https://futurecoder.io/course/#InteractiveProgramsWithInput +#. # __code0__: +#. super_secret_number = 7 +#. print("What number am I thinking of?") +#. guess = input() +#. if guess == super_secret_number: +#. print("Amazing! Are you psychic?") +#. else: +#. print("Nope!") +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Amazing%21+Are+you+psychic%3F%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Nope%21%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22What+number+am+I+thinking+of%3F%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.guess +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.super_secret_number +msgid "pages.InteractiveProgramsWithInput.steps.convert_input_to_int.text" +msgstr "" +"你输入的内容（不包括最后按下的 Enter）会从 `input()` 函数返回为字符串。\n" +"\n" +"理解 `input()` ***总是返回一个字符串*** 是至关重要的，无论用户输入了什么。\n" +"你需要将这个字符串转换为你需要的类型。\n" +"忘记这一点是导致混淆错误的常见原因。\n" +"\n" +"例如，这个程序乍一看似乎没问题，但如果你尝试一下，你会发现它实际上并不工作：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"修复程序，使得当用户输入 `super_secret_number` 的值（在这个例子中是 `7`）时，\n" +"程序按预期打印 `Amazing! Are you psychic?`。\n" +"当 `super_secret_number` 是任何整数（`int`）时，它应该可以工作。" + +#. https://futurecoder.io/course/#InteractiveProgramsWithInput +#. # __code0__: +#. if int(guess) == super_secret_number: +#. # __code1__: +#. if guess == str(super_secret_number): +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.guess +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.super_secret_number +msgid "pages.InteractiveProgramsWithInput.steps.final_text.text" +msgstr "" +"完美！\n" +"\n" +"这里有两个主要的修复方法。你可以将输入转换为数字：\n" +"\n" +"__code0__\n" +"\n" +"或者将正确答案转换为字符串：\n" +"\n" +"__code1__\n" +"\n" +"这两种方法之间一个重要的区别是，第一种方法会在用户输入不是数字的内容时引发错误，这可能是你想要的，也可能不是。" + +#. https://futurecoder.io/course/#InteractiveProgramsWithInput +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.InteractiveProgramsWithInput.steps.first_input.text" +msgstr "" +"到目前为止，我们编写的程序都不是互动的。\n" +"为了制作我们的互动井字棋游戏，我们需要一种接收玩家输入的方法。\n" +"Python 允许我们使用内置的 `input` 函数来做到这一点。运行这个程序：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"当 `name = input()` 运行时，程序实际上会停止并等待你在 shell 中输入并按 Enter，\n" +"所以你需要输入字符后回车才能结束这个语句。" + +#. https://futurecoder.io/course/#InteractiveProgramsWithInput +msgid "pages.InteractiveProgramsWithInput.title" +msgstr "使用 `input()` 的互动程序" + +#. https://futurecoder.io/course/#IntroducingAnd +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.AndExercise +msgid "pages.IntroducingAnd.steps.AndExercise.hints.0.text" +msgstr "如果你有类似 `x < 0 and x > 100` 的条件，那你就走错了方向。这对于 *任何* 值的 `x` 都会是 `False`！" + +#. https://futurecoder.io/course/#IntroducingAnd +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.AndExercise +msgid "pages.IntroducingAnd.steps.AndExercise.hints.1.text" +msgstr "使用 `and` 的解决方案与使用 `or` 的解决方案在几个方面是不同的。" + +#. https://futurecoder.io/course/#IntroducingAnd +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.AndExercise +msgid "pages.IntroducingAnd.steps.AndExercise.hints.2.text" +msgstr "我们使用 `or` 的解决方案首先判断 `x` 是否是一个无效的百分比，否则得出有效性。使用 `and` 将会反过来做这个判断。" + +#. https://futurecoder.io/course/#IntroducingAnd +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.AndExercise +msgid "pages.IntroducingAnd.steps.AndExercise.hints.3.text" +msgstr "你需要相应地反转 `return` 语句。" + +#. https://futurecoder.io/course/#IntroducingAnd +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.AndExercise +msgid "pages.IntroducingAnd.steps.AndExercise.hints.4.text" +msgstr "你也需要更改比较运算符。" + +#. https://futurecoder.io/course/#IntroducingAnd +#. # __code0__: +#. def is_valid_percentage(x): +#. if x < 0 or x > 100: +#. return False +#. else: +#. return True +#. assert_equal(is_valid_percentage(-1), False) +#. assert_equal(is_valid_percentage(0), True) +#. assert_equal(is_valid_percentage(50), True) +#. assert_equal(is_valid_percentage(100), True) +#. assert_equal(is_valid_percentage(101), False) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.is_valid_percentage +msgid "pages.IntroducingAnd.steps.AndExercise.text" +msgstr "" +"现在让我们练习一下。之前我们使用 `or` 写了一个函数 `is_valid_percentage`。这是一个例子\n" +"解决方案：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"请将这个函数重写为使用 `and`。" + +#. https://futurecoder.io/course/#IntroducingAnd +msgid "pages.IntroducingAnd.steps.FalseAndFalse.text" +msgstr "" +"最后，试试：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IntroducingAnd +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.TicTacToeWinningRow +msgid "pages.IntroducingAnd.steps.TicTacToeWinningRow.hints.0.text" +msgstr "这个列表将始终包含 3 个元素。" + +#. https://futurecoder.io/course/#IntroducingAnd +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.TicTacToeWinningRow +msgid "pages.IntroducingAnd.steps.TicTacToeWinningRow.hints.1.text" +msgstr "这意味着你不需要使用循环。" + +#. https://futurecoder.io/course/#IntroducingAnd +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.TicTacToeWinningRow +msgid "pages.IntroducingAnd.steps.TicTacToeWinningRow.hints.2.text" +msgstr "记得你可以使用 `row[0]` 获取第一个元素。" + +#. https://futurecoder.io/course/#IntroducingAnd +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.TicTacToeWinningRow +msgid "pages.IntroducingAnd.steps.TicTacToeWinningRow.hints.3.text" +msgstr "第一个元素、第二个元素和第三个元素都需要相等。" + +#. https://futurecoder.io/course/#IntroducingAnd +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.TicTacToeWinningRow +msgid "pages.IntroducingAnd.steps.TicTacToeWinningRow.hints.4.text" +msgstr "这意味着第一个元素应该等于第二个元素，同时也等于第三个元素。" + +#. https://futurecoder.io/course/#IntroducingAnd +#. # __code5__: +#. def all_equal(row): +#. ... +#. assert_equal(all_equal(["X", "X", "X"]), True) +#. assert_equal(all_equal(["O", "O", "O"]), True) +#. assert_equal(all_equal(["X", "O", "X"]), False) +#. # __code0__: +#. def is_valid_percentage(x): +#. if 0 <= x and x <= 100: +#. return True +#. else: +#. return False +#. # __code1__: +#. def is_valid_percentage(x): +#. return 0 <= x and x <= 100 +#. # __code4__: +#. def is_valid_percentage(x): +#. return 0 <= x <= 100 +#. # __code2__: +#. a < b and b < c +#. # __code3__: +#. a < b < c +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.all_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.is_valid_percentage +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.row +msgid "pages.IntroducingAnd.steps.TicTacToeWinningRow.text" +msgstr "" +"太棒了！这是一个可能的解决方案：\n" +"\n" +"__code0__\n" +"\n" +"和之前一样，我们可以将这个解决方案简化为：\n" +"\n" +"__code1__\n" +"\n" +"还有一个技巧可以进一步改进，叫做比较链。任何这样的条件：\n" +"\n" +"__code2__\n" +"\n" +"可以通过去掉多余的 `and b` 简化为：\n" +"\n" +"__code3__\n" +"\n" +"这适用于任何比较运算符，包括 `==`，而且这两个运算符甚至可以是不同的。\n" +"所以解决方案可以简化为：\n" +"\n" +"__code4__\n" +"\n" +"下一个练习：给定一个包含三个元素的列表，检查这三个元素是否相等。\n" +"\n" +" __copyable__\n" +"__code5__" + +#. https://futurecoder.io/course/#IntroducingAnd +msgid "pages.IntroducingAnd.steps.TrueAndFalse.text" +msgstr "" +"好的，现在试试：\n" +"\n" +"__program_indented__\n" +"\n" +"你期待什么？" + +#. https://futurecoder.io/course/#IntroducingAnd +msgid "pages.IntroducingAnd.steps.TrueAndTrue.text" +msgstr "" +"在 Python 中另一个布尔运算符是 `and`。\n" +"表达式 `A and B` 只有在 `A` 和 `B` 都为 `True` 时才为 `True`。否则就是 `False`。\n" +"在 shell 中试试：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IntroducingAnd +#. # __code0__: +#. def all_equal(row): +#. return row[0] == row[1] and row[0] == row[2] +#. # __code2__: +#. return row == [row[0], row[0], row[0]] +#. # __code1__: +#. return row[0] == row[1] == row[2] +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.all_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.row +msgid "pages.IntroducingAnd.steps.final_text.text" +msgstr "" +"干得好。这里有许多可能的正确解决方案：\n" +"\n" +"__code0__\n" +"\n" +"或者再次使用比较链：\n" +"\n" +"__code1__\n" +"\n" +"或者检查它是否等于一个包含第一个元素三次的列表：\n" +"\n" +"__code2__" + +#. https://futurecoder.io/course/#IntroducingAnd +msgid "pages.IntroducingAnd.title" +msgstr "介绍 `and`" + +#. https://futurecoder.io/course/#IntroducingBirdseye +#. # __code3__: +#. __program_indented__ +#. # __code1__: +#. (a * b) + (c * d) +#. # __code2__: +#. ((a * b) + c) * d +#. # __code0__: +#. a * b + c * d +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.IntroducingBirdseye.steps.birdseye_loop_example.text" +msgstr "" +"虽然其他工具展示代码逐行运行和变量的值，但 `birdseye` 会显示程序中每个表达式的值。这让你看到一个复杂表达式是如何被分解成更小的子表达式\n" +"以及每个子表达式的值是什么。\n" +"\n" +"将鼠标悬停在程序最后一行的各种框住的表达式上。\n" +"当每个框被高亮时，它的值会在屏幕底部显示。点击框会将其固定在面板上，这样你可以同时查看多个表达式的值，并自由移动鼠标。\n" +"\n" +"在这种情况下，`birdseye` 显示表达式：\n" +"\n" +"__code0__\n" +"\n" +"被分解为\n" +"\n" +"__code1__\n" +"\n" +"而不是\n" +"\n" +"__code2__\n" +"\n" +"换句话说，Python 遵循数学中的常规运算顺序，而不是仅仅从左到右进行计算。\n" +"\n" +"请注意，有些表达式 `birdseye` 不会放在框中。在这种情况下，`2`、`3`、`4`、`5` 和 `print` 也是表达式，但它们的值是显而易见的，框住它们只会造成混乱。\n" +"\n" +"这是一个更复杂的例子可以尝试：\n" +"\n" +" __copyable__\n" +"__code3__" + +#. https://futurecoder.io/course/#IntroducingBirdseye +msgid "pages.IntroducingBirdseye.steps.final_text.text" +msgstr "" +"请注意：\n" +"\n" +"1. 在 for 循环旁边有一对箭头。点击它们可以在循环中导航，查看不同迭代中的发生情况。\n" +"2. 因为 `if` 而在某次迭代中未运行的代码会被灰色显示。内部的表达式没有值，因为它们没有被计算。\n" +"3. 表达式 `vowels` 和 `consonants` 记录的值取决于你查看的框。在循环后的行中，它们包含所有字母，但在循环内部它们只包含一些，具体有多少取决于你处于哪个迭代。\n" +"4. 在 `vowels.append(letter)` 中，你看到那些变量的值是 *在那个时刻*。这意味着 `letter` 即将被添加到 `vowels` 中，但这还没有发生，所以 `vowels` 不包含 `letter`。" + +#. https://futurecoder.io/course/#IntroducingBirdseye +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.IntroducingBirdseye.steps.first_birdseye_example.text" +msgstr "" +"你已经见过 `snoop` 和 Python Tutor。futurecoder 还提供了一个最后的工具来分析程序运行时的情况，叫做 `birdseye`。\n" +"\n" +"这是一个可以运行的示例程序。将其复制到编辑器中，然后点击 `birdseye` 按钮。这将打开一个新的浏览器标签页，显示可视化内容。\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#IntroducingBirdseye +msgid "pages.IntroducingBirdseye.title" +msgstr "使用 `birdseye` 理解程序" + +#. https://futurecoder.io/course/#IntroducingDictionaries +msgid "" +"pages.IntroducingDictionaries.steps.dict_access.special_messages.bad_french_value.text" +msgstr "哎呀，你需要先设置 `french = {'apple': 'pomme', 'box': 'boite'}`，才能继续。" + +#. https://futurecoder.io/course/#IntroducingDictionaries +msgid "pages.IntroducingDictionaries.steps.dict_access.text" +msgstr "" +"`french` 是一个包含两个键值对的字典：\n" +"\n" +"- `'apple': 'pomme'`，其中 `'apple'` 是键，`'pomme'` 是值。\n" +"- `'box': 'boite'`，其中 `'box'` 是键，`'boite'` 是值。\n" +"\n" +"和列表一样，逗号 (`,`) 用于分隔各个项目（键值对）。冒号 (`:`) 用于分隔键和值。\n" +"请注意，使用大括号 (`{}`) 来创建字典，而不是在编写列表时使用的方括号 (`[]`)。\n" +"\n" +"记住，对于列表，你是根据它们的 *索引* 来获取值的，也就是它们在列表中的位置。\n" +"所以如果 `words = ['apple', 'box']`，那么 `words[0]` 是 `'apple'`，`words[1]` 是 `'box'`。\n" +"在 shell 中尝试这个：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IntroducingDictionaries +msgid "" +"pages.IntroducingDictionaries.steps.dict_access2.special_messages.bad_french_value.text" +msgstr "哎呀，你需要先设置 `french = {'apple': 'pomme', 'box': 'boite'}`，才能继续。" + +#. https://futurecoder.io/course/#IntroducingDictionaries +msgid "pages.IntroducingDictionaries.steps.dict_access2.text" +msgstr "" +"这不行，因为字典中项目的位置通常并不重要。\n" +"你通常不关心字典中的第 2 个或第 5 个或第 100 个单词，\n" +"你只想找到一个特定的单词，比如 'apple'。所以试试这个：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IntroducingDictionaries +msgid "pages.IntroducingDictionaries.steps.dict_access3.requirements" +msgstr "在 shell 中运行与上一步相同的代码 (`french['apple']`)，但将 `'apple'` 替换为 `'box'`。" + +#. https://futurecoder.io/course/#IntroducingDictionaries +msgid "" +"pages.IntroducingDictionaries.steps.dict_access3.special_messages.bad_french_value.text" +msgstr "哎呀，你需要先设置 `french = {'apple': 'pomme', 'box': 'boite'}`，才能继续。" + +#. https://futurecoder.io/course/#IntroducingDictionaries +msgid "pages.IntroducingDictionaries.steps.dict_access3.text" +msgstr "" +"这样更好！\n" +"\n" +"现在在 shell 中运行类似的代码来查找 `'box'` 的翻译。" + +#. https://futurecoder.io/course/#IntroducingDictionaries +msgid "" +"pages.IntroducingDictionaries.steps.dict_access4.special_messages.bad_french_value.text" +msgstr "哎呀，你需要先设置 `french = {'apple': 'pomme', 'box': 'boite'}`，才能继续。" + +#. https://futurecoder.io/course/#IntroducingDictionaries +msgid "pages.IntroducingDictionaries.steps.dict_access4.text" +msgstr "" +"现在你既懂 Python 也懂法语了！\n" +"\n" +"现在让我们从法语翻译成英语：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IntroducingDictionaries +msgid "pages.IntroducingDictionaries.steps.final_text.text" +msgstr "" +"对不起，你也不能这样做。你只能查找一个键以获取其值，而不能反过来。\n" +"字典 `french` 只有 2 个键：`'apple'` 和 `'box'`。`'pomme'` 是一个值，而不是一个键。\n" +"我们很快就会学习为什么不能直接查找值，以及你可以做些什么。\n" +"\n" +"请注意，`french[0]` 和 `french['pomme']` 都引发了相同类型的错误：`KeyError`。\n" +"这个错误意味着提供的键（在这种情况下是 `0` 或 `'pomme'`）在字典中没有找到。\n" +"并不是说 `french[0]` 不被 *允许*，而是它意味着和往常一样：\n" +"查找与键 `0` 关联的值。在这种情况下，它发现没有这样的键存在。\n" +"但是 `0` *可以* 是一个键，因为许多类型的键都是允许的，包括字符串和数字。" + +#. https://futurecoder.io/course/#IntroducingDictionaries +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.IntroducingDictionaries.steps.first_dict.text" +msgstr "" +"我们见过几种类型：`str`、`int`、`float`、`bool` 和 `list`。\n" +"只有一种类型可以包含多个值：`list`。\n" +"现在我们要学习另一种容器类型：`dict`，即 ***字典***。\n" +"\n" +"想象一下你熟悉的字典，你查找一个单词以找到它的定义或在另一种语言中的翻译。\n" +"Python 中的字典类似，但更通用。你查找一个 *键*（例如一个单词）以获取相关的 *值*（例如定义或翻译）。\n" +"\n" +"例如，这里有一个小字典，将英语单词翻译成法语：\n" +"\n" +"__code0__\n" +"\n" +"在 shell 中运行上面的代码。" + +#. https://futurecoder.io/course/#IntroducingDictionaries +msgid "pages.IntroducingDictionaries.title" +msgstr "介绍字典" + +#. https://futurecoder.io/course/#IntroducingElif +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.IntroducingElif.steps.dna_example.text" +msgstr "" +"快速的生物学课！你身体中的大多数细胞都包含完整的遗传密码在DNA中。\n" +"这由称为核苷酸的分子单位链组成，分为四种类型：\n" +"腺嘌呤、胞嘧啶、鸟嘌呤和胸腺嘧啶，简称为ACGT。\n" +"所以单链的一部分可能是这样的：\n" +"\n" +" AGTAGCGTCCTTAGTTACAGGATGGCTTAT...\n" +"\n" +"这将与另一条链配对，其中A被T替换，反之亦然，\n" +"C被G替换，反之亦然，例如：\n" +"\n" +" TCATCGCAGGAATCAATGTCCTACCGAATA...\n" +"\n" +"这两条链被“拉链”在一起形成著名的双螺旋结构，\n" +"通过匹配的A-T和C-G配对连接在一起。这些配对在细胞分裂和繁殖时复制DNA时至关重要。双螺旋被解开，代码被转录\n" +"成其相对版本以制作副本。\n" +"\n" +"我们将重复这个过程。让我们尝试一下我们刚刚写的同样类型的程序：\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#IntroducingElif +msgid "pages.IntroducingElif.steps.dna_example_with_elif.requirements" +msgstr "" +"从本页第一步复制程序，但将那里的4个`if`块替换为这里的`if`和`elif`块的组合。换句话说，将最后三个`if`替换为`elif`，但保留第一个`if`不变。" + +#. https://futurecoder.io/course/#IntroducingElif +#. # __code0__: +#. if char == 'A': +#. char = 'T' +#. elif char == 'T': +#. char = 'A' +#. elif char == 'G': +#. char = 'C' +#. elif char == 'C': +#. char = 'G' +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.char +msgid "pages.IntroducingElif.steps.dna_example_with_elif.text" +msgstr "" +"太棒了！你模仿了你自己细胞不断在做的事情。\n" +"\n" +"在`else`内部的`if`可以用一个单一的关键字`elif`替换。例如，\n" +"之前的代码可以改成这样：\n" +"\n" +"__code0__" + +#. https://futurecoder.io/course/#IntroducingElif +#. # __code0__: +#. if char == 'A': +#. char = 'T' +#. if char == 'T': +#. char = 'A' +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.char +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingElif.steps.dna_example_with_else +msgid "pages.IntroducingElif.steps.dna_example_with_else.hints.0.text" +msgstr "" +"改变：\n" +"\n" +"__code0__\n" +"\n" +"使其看起来像修订后的代码片段。这只是一个小改动，做的时候不要复制粘贴。" + +#. https://futurecoder.io/course/#IntroducingElif +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingElif.steps.dna_example_with_else +msgid "pages.IntroducingElif.steps.dna_example_with_else.hints.1.text" +msgstr "现在对交换G和C的代码做同样的改变。" + +#. https://futurecoder.io/course/#IntroducingElif +#. # __code0__: +#. if char == 'A': +#. char = 'T' +#. else: +#. if char == 'T': +#. char = 'A' +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.char +msgid "pages.IntroducingElif.steps.dna_example_with_else.text" +msgstr "" +"哦，天哪，这不太行。`T`被改成了`A`，但`A`没有被改成任何东西。\n" +"你能看出原因吗？\n" +"\n" +"当`char == 'A'`时，`char = 'T'`的代码确实会运行。但这意味着接下来的\n" +"条件`char == 'T'`也会通过，因此`char = 'A'`，我们又回到了起点。\n" +"我们需要仅在`char`不是`A`的情况下将`char`从`T`改为`A`，\n" +"这意味着`char == 'A'`为`False`。我们可以用`else`来做到这一点，如下所示：\n" +"\n" +"__code0__\n" +"\n" +"现在修复程序以正确替换所有字符。" + +#. https://futurecoder.io/course/#IntroducingElif +#. # __code0__: +#. if X: +#. ... +#. else: +#. if Y: +#. ... +#. else: +#. if Z: +#. ... +#. else: +#. ... +#. # __code1__: +#. if X: +#. ... +#. elif Y: +#. ... +#. elif Z: +#. ... +#. else: +#. ... +msgid "pages.IntroducingElif.steps.final_text.text" +msgstr "" +"当你想要运行众多代码块中的一个时，通常会有一串`elif`语句，就像在这个例子中一样。一般来说，这样的代码：\n" +"\n" +"__code0__\n" +"\n" +"可以重写为：\n" +"\n" +"__code1__\n" +"\n" +"这既更简短，又可以避免不愉快的嵌套缩进。\n" +"两者之间的区别只是表面上的：一旦计算机运行这段代码，它无法\n" +"分辨这两个版本之间的差异。\n" +"\n" +"请注意，`elif`后面可以选择性地跟一个最终的`else`。我们在DNA示例中没有包含，但我们可以添加一个来提醒我们输入中任何意外的字符，\n" +"或者如果我们对输入的有效性有信心，可以将`elif char == 'C':`改为`else:`。" + +#. https://futurecoder.io/course/#IntroducingElif +msgid "pages.IntroducingElif.title" +msgstr "介绍 `elif`" + +#. https://futurecoder.io/course/#IntroducingForLoops +msgid "pages.IntroducingForLoops.steps.final_text.text" +msgstr "" +"你可以几乎像读普通英语一样阅读这段代码：\n" +"\n" +"> 对于字符串 `name` 中的每个字符，打印该字符。\n" +"\n" +"每个字符都是一个普通字符串。 `character` 是一个普通变量，在 `:` 后面的代码运行之前会被赋予一个新值。所以上面的代码等同于：\n" +"\n" +" __no_auto_translate__\n" +" name = 'World'\n" +"\n" +" character = 'W'\n" +" print(character)\n" +"\n" +" character = 'o'\n" +" print(character)\n" +"\n" +" character = 'r'\n" +" print(character)\n" +"\n" +" character = 'l'\n" +" print(character)\n" +"\n" +" character = 'd'\n" +" print(character)\n" +"\n" +"注意，我们可以使用不同的变量名，`character` 只是让它更清晰。\n" +"\n" +"一个 for 循环通常遵循这个结构：\n" +"\n" +" for in : \n" +"\n" +"`for`、`in` 和 `:` 都是必不可少的。" + +#. https://futurecoder.io/course/#IntroducingForLoops +msgid "pages.IntroducingForLoops.steps.first_for_loop.text" +msgstr "" +"好消息！你已经通过了无聊的基础知识。我们可以开始编写一些有趣的程序，享受一些乐趣。编程中最强大的概念之一是 *循环*，它允许你重复同样的代码。Python 有两种循环：`for` 循环和 `while` 循环。这里有一个 for 循环的例子，试着运行这个程序：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IntroducingForLoops +msgid "pages.IntroducingForLoops.title" +msgstr "介绍 For 循环" + +#. https://futurecoder.io/course/#IntroducingFstrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.basic_f_string_exercise +msgid "pages.IntroducingFstrings.steps.basic_f_string_exercise.hints.0.text" +msgstr "这就像给定的 f-string 示例一样。" + +#. https://futurecoder.io/course/#IntroducingFstrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.basic_f_string_exercise +msgid "pages.IntroducingFstrings.steps.basic_f_string_exercise.hints.1.text" +msgstr "你忘记加 `f` 了吗？" + +#. https://futurecoder.io/course/#IntroducingFstrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.basic_f_string_exercise +msgid "pages.IntroducingFstrings.steps.basic_f_string_exercise.hints.2.text" +msgstr "你需要多少对花括号？" + +#. https://futurecoder.io/course/#IntroducingFstrings +msgid "pages.IntroducingFstrings.steps.basic_f_string_exercise.text" +msgstr "" +"这会失败，因为我们不能在字符串 `\"Hello Alice. You are \"` 和数字 `age` 之间使用 `+`。\n" +"\n" +"通过用一个单独的 f-string 替换所有的字符串连接（+）来修复这个问题。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.concatenate_string_number +msgid "" +"pages.IntroducingFstrings.steps.concatenate_string_number.output_prediction_choices.0" +msgstr "\"Hello \" + name + \". You are \" + age + \" years old.\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.concatenate_string_number +msgid "" +"pages.IntroducingFstrings.steps.concatenate_string_number.output_prediction_choices.1" +msgstr "Hello name. You are age years old." + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.concatenate_string_number +msgid "" +"pages.IntroducingFstrings.steps.concatenate_string_number.output_prediction_choices.2" +msgstr "Hello Alice. You are 20 years old." + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.concatenate_string_number +msgid "" +"pages.IntroducingFstrings.steps.concatenate_string_number.output_prediction_choices.3" +msgstr "Hello 'Alice'. You are 20 years old." + +#. https://futurecoder.io/course/#IntroducingFstrings +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.IntroducingFstrings.steps.concatenate_string_number.text" +msgstr "" +"f-string 的语法以 `f` 开头，后面跟着一个字符串。\n" +"f-string 可以在花括号 `{}` 内包含变量名。\n" +"它们会被替换为那些变量的值，转换为字符串。\n" +"变量可以是任何东西：字符串、数字、列表等等。\n" +"\n" +"因此，f-strings 让你轻松地组合字符串和数字，而这些是不能\n" +"简单地相加在一起的。例如，运行以下程序：\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#IntroducingFstrings +msgid "pages.IntroducingFstrings.steps.eval_expr_inside_f_string.text" +msgstr "" +"除了变量，f-string 实际上可以在花括号内包含任何 Python 表达式。\n" +"在 shell 中试试这个：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IntroducingFstrings +msgid "pages.IntroducingFstrings.steps.final_text.text" +msgstr "" +"太棒了！\n" +"\n" +"从现在开始，鼓励你在可能的情况下使用 f-strings 而不是 `+` 来构建字符串。" + +#. https://futurecoder.io/course/#IntroducingFstrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.fix_broken_program +msgid "pages.IntroducingFstrings.steps.fix_broken_program.hints.0.text" +msgstr "`print` 中的表达式有四个问题。" + +#. https://futurecoder.io/course/#IntroducingFstrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.fix_broken_program +msgid "pages.IntroducingFstrings.steps.fix_broken_program.hints.1.text" +msgstr "找到人数的语法有问题。" + +#. https://futurecoder.io/course/#IntroducingFstrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.fix_broken_program +msgid "pages.IntroducingFstrings.steps.fix_broken_program.hints.2.text" +msgstr "然后其中一个字符串的引号有问题。" + +#. https://futurecoder.io/course/#IntroducingFstrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.fix_broken_program +msgid "pages.IntroducingFstrings.steps.fix_broken_program.hints.3.text" +msgstr "还有找到第一个人名字的语法有问题。" + +#. https://futurecoder.io/course/#IntroducingFstrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.fix_broken_program +msgid "pages.IntroducingFstrings.steps.fix_broken_program.hints.4.text" +msgstr "而且你不能把字符串和数字相加！" + +#. https://futurecoder.io/course/#IntroducingFstrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.fix_broken_program +msgid "pages.IntroducingFstrings.steps.fix_broken_program.hints.5.text" +msgstr "你在 f-string 中正确使用花括号了吗？" + +#. https://futurecoder.io/course/#IntroducingFstrings +msgid "pages.IntroducingFstrings.steps.fix_broken_program.text" +msgstr "" +"如你所见，我们也可以使用双引号定义 f-string，就像定义普通字符串一样。\n" +"而且像引号一样，f-string 只是表示法。一旦它们被计算，计算机就会忘记\n" +"使用了 f-string，它只会把最终结果存储为普通字符串。\n" +"\n" +"这里有一个非常糟糕的程序：\n" +"\n" +" __copyable__\n" +" people = [\"Alice\", \"Bob\", \"Charlie\"]\n" +" print('There are' + people.length() + 'people waiting, the first one's name is' + people.1 + '.')\n" +"\n" +"修复它！\n" +"你的解决方案应该适用于任何名为 `people` 的字符串列表。\n" +"例如，在上述情况下，它应该打印：\n" +"\n" +" There are 3 people waiting, the first one's name is Alice." + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings +msgid "" +"pages.IntroducingFstrings.steps.introduce_f_strings.output_prediction_choices.0" +msgstr "f\"{name} went to {meal} with {friend}.\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings +msgid "" +"pages.IntroducingFstrings.steps.introduce_f_strings.output_prediction_choices.1" +msgstr "\"{name} went to {meal} with {friend}.\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings +msgid "" +"pages.IntroducingFstrings.steps.introduce_f_strings.output_prediction_choices.2" +msgstr "{name} went to {meal} with {friend}." + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings +msgid "" +"pages.IntroducingFstrings.steps.introduce_f_strings.output_prediction_choices.3" +msgstr "'name' went to 'meal' with 'friend'." + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings +msgid "" +"pages.IntroducingFstrings.steps.introduce_f_strings.output_prediction_choices.4" +msgstr "name went to meal with friend." + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings +msgid "" +"pages.IntroducingFstrings.steps.introduce_f_strings.output_prediction_choices.5" +msgstr "\"Alice\" went to \"lunch\" with 'Bob'." + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings +msgid "" +"pages.IntroducingFstrings.steps.introduce_f_strings.output_prediction_choices.6" +msgstr "'Alice' went to 'lunch' with 'Bob'." + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings +msgid "" +"pages.IntroducingFstrings.steps.introduce_f_strings.output_prediction_choices.7" +msgstr "\"Alice went to lunch with Bob.\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings +msgid "" +"pages.IntroducingFstrings.steps.introduce_f_strings.output_prediction_choices.8" +msgstr "Alice went to lunch with Bob." + +#. https://futurecoder.io/course/#IntroducingFstrings +#. # __code0__: +#. name + " went to " + meal + " with " + friend + '.' +#. # __code1__: +#. f"{name} went to {meal} with {friend}." +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22+went+to+%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22+with+%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.f%22%7Bname%7D+went+to+%7Bmeal%7D+with+%7Bfriend%7D.%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.friend +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.meal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.name +msgid "pages.IntroducingFstrings.steps.introduce_f_strings.requirements" +msgstr "" +"运行上面的程序，但在 `print()` 内替换这段代码：\n" +"\n" +"__code0__\n" +"\n" +"用：\n" +"\n" +"__code1__" + +#. https://futurecoder.io/course/#IntroducingFstrings +#. # __code0__: +#. name = "Alice" +#. friend = 'Bob' +#. meal = "lunch" +#. print(name + " went to " + meal + " with " + friend + '.') +#. # __code1__: +#. print(f"{name} went to {meal} with {friend}.") +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22+went+to+%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22+with+%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Alice%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22lunch%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27Bob%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.f%22%7Bname%7D+went+to+%7Bmeal%7D+with+%7Bfriend%7D.%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.friend +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.meal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.name +msgid "pages.IntroducingFstrings.steps.introduce_f_strings.text" +msgstr "" +"到目前为止，我们一直通过使用 `+` 来连接字符串，例如：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"然而，这有点繁琐。我们可以使用 *f-string* 更优雅地写同样的东西。\n" +"用下面的行替换上面程序的最后一行并运行它。\n" +"确保在字符串前加上 `f`。\n" +"\n" +"__code1__" + +#. https://futurecoder.io/course/#IntroducingFstrings +msgid "pages.IntroducingFstrings.title" +msgstr "f-strings" + +#. https://futurecoder.io/course/#IntroducingIfStatements +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.excited_confused_exercise +msgid "" +"pages.IntroducingIfStatements.steps.excited_confused_exercise.hints.0.text" +msgstr "你只需要在现有程序中添加几行代码。所有现有的代码都应该保持不变。" + +#. https://futurecoder.io/course/#IntroducingIfStatements +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.excited_confused_exercise +msgid "" +"pages.IntroducingIfStatements.steps.excited_confused_exercise.hints.1.text" +msgstr "你添加的代码应该与现有代码非常相似。" + +#. https://futurecoder.io/course/#IntroducingIfStatements +#. # __code0__: +#. sentence = 'Hello World' +#. excited = False +#. confused = True +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27Hello+World%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.confused +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.excited +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.sentence +msgid "pages.IntroducingIfStatements.steps.excited_confused_exercise.text" +msgstr "" +"现在是练习时间。修改上面的程序，添加一个额外的\n" +"布尔参数 `confused`，程序应该像这样开始：\n" +"\n" +"__code0__\n" +"\n" +"(`sentence` 可以是任何字符串，两个布尔值可以是 `True` 或 `False`)\n" +"\n" +"当 `confused` 为真时，打印的句子应该在末尾添加一个问号。\n" +"如果 `confused` 和 `excited` 都为真，句子应该以 `!?` 结束。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.excited_example +msgid "" +"pages.IntroducingIfStatements.steps.excited_example.output_prediction_choices.0" +msgstr "Hello World" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.excited_example +msgid "" +"pages.IntroducingIfStatements.steps.excited_example.output_prediction_choices.1" +msgstr "Hello World!" + +#. https://futurecoder.io/course/#IntroducingIfStatements +msgid "pages.IntroducingIfStatements.steps.excited_example.text" +msgstr "" +"注意第一个 `if` 语句中的代码运行了，但第二个没有。\n" +"\n" +"一般来说，`if` 语句看起来像这样：\n" +"\n" +" if :\n" +" \n" +"\n" +"其中 `` 是任何计算为布尔值的表达式，而 `` 是一个 **缩进的** 语句列表\n" +"可以包含一个或多个语句。这个结构与 `for` 循环非常相似。注意冒号 (`:`)，这是必不可少的。\n" +"\n" +"当计算机看到 `if :` 时，它会检查 `` 是否为 `True`。如果是，它就会执行主体。\n" +"如果不是，它会跳过并继续执行程序的其余部分。\n" +"\n" +"这是一个更有趣的例子供你运行：\n" +"\n" +"__program_indented__" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.excited_false_example +msgid "" +"pages.IntroducingIfStatements.steps.excited_false_example.output_prediction_choices.0" +msgstr "Hello World" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.excited_false_example +msgid "" +"pages.IntroducingIfStatements.steps.excited_false_example.output_prediction_choices.1" +msgstr "Hello World!" + +#. https://futurecoder.io/course/#IntroducingIfStatements +msgid "pages.IntroducingIfStatements.steps.excited_false_example.requirements" +msgstr "运行上一步的程序，但将 `True` 替换为 `False`，所以 `excited = False`。" + +#. https://futurecoder.io/course/#IntroducingIfStatements +msgid "pages.IntroducingIfStatements.steps.excited_false_example.text" +msgstr "" +"（记住 `sentence += '!'` 意味着 `sentence = sentence + '!'`）\n" +"\n" +"将 `excited = True` 改为 `excited = False`，然后再次运行程序，看看有什么不同。" + +#. https://futurecoder.io/course/#IntroducingIfStatements +msgid "pages.IntroducingIfStatements.steps.final_text.text" +msgstr "" +"做得好！这个程序可以根据你如何组合 `excited`\n" +"和 `confused` 来做 4 件不同的事情。如果你想的话，可以尝试一下。" + +#. https://futurecoder.io/course/#IntroducingIfStatements +msgid "pages.IntroducingIfStatements.steps.first_if_statements.text" +msgstr "" +"布尔值是用于 *if 语句*（有时也称为 *条件语句*）中的。\n" +"\n" +"这里有一个简单的例子供你运行：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IntroducingIfStatements +msgid "pages.IntroducingIfStatements.steps.introducing_booleans.text" +msgstr "" +"现在我们要学习如何告诉计算机做出决策，并且只在某些条件下运行代码。为此，我们需要一种新的值类型。你已经见过\n" +"数字和字符串，现在来认识一下 *布尔值*。布尔值只有两个：\n" +"`True` 和 `False`。试试这个程序：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IntroducingIfStatements +msgid "pages.IntroducingIfStatements.title" +msgstr "介绍 if 语句" + +#. https://futurecoder.io/course/#IntroducingLists +msgid "pages.IntroducingLists.steps.can_contain_anything.text" +msgstr "" +"列表是一个 *序列*（有序的集合/容器），可以包含任意数量的值。\n" +"这些值通常被称为 *元素*。\n" +"它们可以是任何东西：数字、字符串、布尔值，甚至是列表！它们也可以是不同类型的混合。\n" +"\n" +"要直接创建一个列表，就像上面那样：\n" +"\n" +"1. 写一些方括号： `[]`\n" +"2. 如果你不想要一个空列表，就在里面写一些表达式作为元素。\n" +"3. 用逗号（`,`）分隔元素。\n" +"\n" +"这里还有一个创建列表的例子：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IntroducingLists +msgid "pages.IntroducingLists.steps.final_text.text" +msgstr "" +"恭喜你！这很棘手！一种解决方案是这样的：\n" +"\n" +" __no_auto_translate__\n" +" words = ['This', 'is', 'a', 'list']\n" +" separator = ' - '\n" +" total = ''\n" +" not_first = False\n" +"\n" +" for word in words:\n" +" if not_first:\n" +" total += separator\n" +" total += word\n" +" not_first = True\n" +"\n" +" print(total)" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.first_list +msgid "pages.IntroducingLists.steps.first_list.program" +msgstr "" +"words = ['This', 'is', 'a', 'list']\n" +"\n" +"for word in words:\n" +" print(word)" + +#. https://futurecoder.io/course/#IntroducingLists +msgid "pages.IntroducingLists.steps.first_list.text" +msgstr "" +"现在是学习一种强大的新值类型 *列表* 的时候了。这里有一个例子：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IntroducingLists +msgid "pages.IntroducingLists.steps.numbers_sum.text" +msgstr "" +"正如你在上面看到的，列表是 *可迭代的*，这意味着你可以用 `for loop` 遍历它们。\n" +"这里有一个程序可以将列表中的所有数字相加：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum +msgid "pages.IntroducingLists.steps.strings_sum.hints.0.text" +msgstr "这与之前你做的逐个字符构建字符串的练习非常相似。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum +msgid "pages.IntroducingLists.steps.strings_sum.hints.1.text" +msgstr "解决方案与添加数字的程序非常相似。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum +msgid "pages.IntroducingLists.steps.strings_sum.hints.2.text" +msgstr "事实上，如果你尝试用一个字符串列表运行那个程序，会发生什么呢？" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum +msgid "pages.IntroducingLists.steps.strings_sum.hints.3.text" +msgstr "问题在于 0。你不能将 0 加到字符串上，因为数字和字符串是不兼容的。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum +msgid "pages.IntroducingLists.steps.strings_sum.hints.4.text" +msgstr "在字符串中是否有类似于 0 的概念？一个空的初始值？" + +#. https://futurecoder.io/course/#IntroducingLists +msgid "pages.IntroducingLists.steps.strings_sum.text" +msgstr "" +"现在修改程序，使其可以将字符串列表相加，而不是数字。\n" +"例如，给定：\n" +"\n" +" __no_auto_translate__\n" +" words = ['This', 'is', 'a', 'list']\n" +"\n" +"它应该打印：\n" +"\n" +" __no_auto_translate__\n" +" Thisisalist" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +msgid "pages.IntroducingLists.steps.strings_sum_bonus.hints.0.text" +msgstr "这与之前的练习相似。你可以从那个解决方案开始。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +msgid "pages.IntroducingLists.steps.strings_sum_bonus.hints.1.text" +msgstr "这个练习不需要任何花哨的东西，最终的解决方案可以非常简单。但要正确完成它很棘手，你需要仔细考虑方法。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +msgid "pages.IntroducingLists.steps.strings_sum_bonus.hints.10.text" +msgstr "你 *可以* 编写一个程序来检查你是否在循环的 *第一次* 迭代中。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +msgid "pages.IntroducingLists.steps.strings_sum_bonus.hints.11.text" +msgstr "只需创建一个布尔变量来跟踪这一点。无需任何比较运算符或数字。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +msgid "pages.IntroducingLists.steps.strings_sum_bonus.hints.12.text" +msgstr "我们在[这里](#UnderstandingProgramsWithSnoop)看过做类似事情的程序。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +msgid "pages.IntroducingLists.steps.strings_sum_bonus.hints.13.text" +msgstr "所以如果你只在第一次迭代中跳过添加分隔符，你将会有 `n - 1` 个分隔符。现在你只需要仔细考虑如何确保分隔符在正确的位置。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +msgid "pages.IntroducingLists.steps.strings_sum_bonus.hints.14.text" +msgstr "暂时忘记循环，你需要按以下顺序将其添加到字符串中：第一个单词、分隔符、第二个单词、分隔符、第三个单词，等等。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +msgid "pages.IntroducingLists.steps.strings_sum_bonus.hints.15.text" +msgstr "" +"这意味着在第一次迭代中，你只需添加第一个单词。在第二次迭代中，添加分隔符，然后是第二个单词。在第三次迭代中，添加分隔符，然后是第三个单词。依此类推。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +msgid "pages.IntroducingLists.steps.strings_sum_bonus.hints.16.text" +msgstr "所以在你的循环中，先添加分隔符，然后再添加单词。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +msgid "pages.IntroducingLists.steps.strings_sum_bonus.hints.17.text" +msgstr "通过检查一个布尔变量来跳过在第一次迭代中添加分隔符。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +msgid "pages.IntroducingLists.steps.strings_sum_bonus.hints.18.text" +msgstr "在循环之前创建布尔变量，然后在循环内更改它。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +msgid "pages.IntroducingLists.steps.strings_sum_bonus.hints.19.text" +msgstr "只在检查后在循环中更改它，否则你将无法跳过第一次迭代。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +msgid "pages.IntroducingLists.steps.strings_sum_bonus.hints.2.text" +msgstr "在每次迭代中，除了列表中的一个单词外，你还必须添加分隔符。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +msgid "pages.IntroducingLists.steps.strings_sum_bonus.hints.3.text" +msgstr "但你不想在添加列表中的最后一个单词后添加分隔符。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +msgid "pages.IntroducingLists.steps.strings_sum_bonus.hints.4.text" +msgstr "不幸的是，字符串之间没有“减法”；你不能添加最后一个分隔符然后将其移除。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +msgid "pages.IntroducingLists.steps.strings_sum_bonus.hints.5.text" +msgstr "让我们回顾一下。最终结果应该包含每个单词，以及 `n - 1` 个分隔符，其中 `n` 是单词的数量。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +msgid "pages.IntroducingLists.steps.strings_sum_bonus.hints.6.text" +msgstr "所以你想在每次迭代中添加一个分隔符，除了一个。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +msgid "pages.IntroducingLists.steps.strings_sum_bonus.hints.7.text" +msgstr "你可以使用 `if` 语句跳过在某一次迭代中添加分隔符。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +msgid "pages.IntroducingLists.steps.strings_sum_bonus.hints.8.text" +msgstr "以后你将学习一种方法来遍历列表并检查你是否在最后一次迭代中，但现在你没有办法做到这一点。" + +#. https://futurecoder.io/course/#IntroducingLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +msgid "pages.IntroducingLists.steps.strings_sum_bonus.hints.9.text" +msgstr "然而，你跳过的迭代不必是最后一次！" + +#. https://futurecoder.io/course/#IntroducingLists +msgid "pages.IntroducingLists.steps.strings_sum_bonus.text" +msgstr "" +"太棒了！\n" +"\n" +"如果你愿意，你现在可以继续到[下一页](#BuildingNewLists)。\n" +"\n" +"作为一个可选的额外挑战：扩展程序以在每个单词 *之间* 插入一个分隔符字符串。\n" +"例如，给定\n" +"\n" +" __no_auto_translate__\n" +" words = ['This', 'is', 'a', 'list']\n" +" separator = ' - '\n" +"\n" +"它将输出：\n" +"\n" +" __no_auto_translate__\n" +" This - is - a - list" + +#. https://futurecoder.io/course/#IntroducingLists +msgid "pages.IntroducingLists.title" +msgstr "介绍列表" + +#. https://futurecoder.io/course/#IntroducingNestedLists +msgid "pages.IntroducingNestedLists.steps.double_subscripting.requirements" +msgstr "运行 `print(strings[1][0])` 或类似的代码，使用 `birdseye` 来查看它是如何工作的。" + +#. https://futurecoder.io/course/#IntroducingNestedLists +#. # __code0__: +#. string = strings[1] +#. print(string[0]) +#. # __code1__: +#. print(strings[1][0]) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.string +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.strings +msgid "pages.IntroducingNestedLists.steps.double_subscripting.text" +msgstr "" +"你可能这样解决了这个问题：\n" +"\n" +"__code0__\n" +"\n" +"还有更简洁的方法。`strings[1]` 是一个表达式，像其他任何表达式一样，索引操作 `[0]`\n" +"可以用于任何表达式，而不仅仅是变量。\n" +"所以你可以跳过中间变量，直接用一行代码来完成：\n" +"\n" +"__code1__\n" +"\n" +"仔细看看这个语法。如果它看起来新奇又复杂，其实并不是。\n" +"这只是常见的索引语法，重复应用了两次。\n" +"在 `birdseye` 中尝试一下，看看 Python 是如何将其分解成更小的部分的。" + +#. https://futurecoder.io/course/#IntroducingNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.double_subscripting_exercise +msgid "" +"pages.IntroducingNestedLists.steps.double_subscripting_exercise.hints.0.text" +msgstr "这与之前的练习非常相似。" + +#. https://futurecoder.io/course/#IntroducingNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.double_subscripting_exercise +msgid "" +"pages.IntroducingNestedLists.steps.double_subscripting_exercise.hints.1.text" +msgstr "你还记得如何访问列表的最后一个位置（不使用 `len`）吗？" + +#. https://futurecoder.io/course/#IntroducingNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.double_subscripting_exercise +msgid "" +"pages.IntroducingNestedLists.steps.double_subscripting_exercise.hints.2.text" +msgstr "同样，你如何访问列表中的倒数第二个位置？" + +#. https://futurecoder.io/course/#IntroducingNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.double_subscripting_exercise +msgid "" +"pages.IntroducingNestedLists.steps.double_subscripting_exercise.hints.3.text" +msgstr "如果你想不起来，可以用谷歌搜索一下！" + +#. https://futurecoder.io/course/#IntroducingNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.double_subscripting_exercise +msgid "" +"pages.IntroducingNestedLists.steps.double_subscripting_exercise.hints.4.text" +msgstr "索引在列表和字符串上是类似的。" + +#. https://futurecoder.io/course/#IntroducingNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.double_subscripting_exercise +msgid "" +"pages.IntroducingNestedLists.steps.double_subscripting_exercise.hints.5.text" +msgstr "你遇到 `index out of range` 错误了吗？是字符串的问题，还是列表的问题？为什么？" + +#. https://futurecoder.io/course/#IntroducingNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.double_subscripting_exercise +msgid "" +"pages.IntroducingNestedLists.steps.double_subscripting_exercise.hints.6.text" +msgstr "确保你没有混淆列表索引和字符串索引的顺序。" + +#. https://futurecoder.io/course/#IntroducingNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.double_subscripting_exercise +msgid "" +"pages.IntroducingNestedLists.steps.double_subscripting_exercise.hints.7.text" +msgstr "如果你遇到困难，可以使用 `birdseye`。" + +#. https://futurecoder.io/course/#IntroducingNestedLists +msgid "pages.IntroducingNestedLists.steps.double_subscripting_exercise.text" +msgstr "" +"使用这个语法，修改程序以打印列表 `strings` 中倒数第二个字符串的最后一个字母。\n" +"你必须像上面那样使用单个表达式，并且不允许使用 `len`。\n" +"你的解决方案应该适用于任何非空的字符串列表。\n" +"对于之前的示例输入，它应该打印 `f`。" + +#. https://futurecoder.io/course/#IntroducingNestedLists +#. # __code0__: +#. strings[1].append("today?") +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22today%3F%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.strings +msgid "pages.IntroducingNestedLists.steps.final_text.text" +msgstr "" +"太棒了！你现在非常了解嵌套索引。\n" +"\n" +"我们仍然可以使用之前学习的所有列表方法和函数。\n" +"例如，我们可以用 `append` 向 `strings` 的最后一个子列表添加一个新单词，\n" +"使其出现在 `'you'` 之后：\n" +"\n" +"__code0__\n" +"\n" +"毕竟，子列表 `strings[1]` 仍然是一个和其他列表一样的列表！\n" +"\n" +"在下一页，我们将学习如何遍历嵌套列表。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.first_nested_list_example +msgid "" +"pages.IntroducingNestedLists.steps.first_nested_list_example.output_prediction_choices.0" +msgstr "hello" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.first_nested_list_example +msgid "" +"pages.IntroducingNestedLists.steps.first_nested_list_example.output_prediction_choices.1" +msgstr "there" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.first_nested_list_example +msgid "" +"pages.IntroducingNestedLists.steps.first_nested_list_example.output_prediction_choices.10" +msgstr "a" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.first_nested_list_example +msgid "" +"pages.IntroducingNestedLists.steps.first_nested_list_example.output_prediction_choices.2" +msgstr "how" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.first_nested_list_example +msgid "" +"pages.IntroducingNestedLists.steps.first_nested_list_example.output_prediction_choices.3" +msgstr "are" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.first_nested_list_example +msgid "" +"pages.IntroducingNestedLists.steps.first_nested_list_example.output_prediction_choices.4" +msgstr "you" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.first_nested_list_example +msgid "" +"pages.IntroducingNestedLists.steps.first_nested_list_example.output_prediction_choices.5" +msgstr "['hello', 'there']" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.first_nested_list_example +msgid "" +"pages.IntroducingNestedLists.steps.first_nested_list_example.output_prediction_choices.6" +msgstr "['how', 'are', 'you']" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.first_nested_list_example +msgid "" +"pages.IntroducingNestedLists.steps.first_nested_list_example.output_prediction_choices.7" +msgstr "h" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.first_nested_list_example +msgid "" +"pages.IntroducingNestedLists.steps.first_nested_list_example.output_prediction_choices.8" +msgstr "t" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.first_nested_list_example +msgid "" +"pages.IntroducingNestedLists.steps.first_nested_list_example.output_prediction_choices.9" +msgstr "e" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.first_nested_list_example +msgid "pages.IntroducingNestedLists.steps.first_nested_list_example.program" +msgstr "" +"strings = [['hello', 'there'], ['how', 'are', 'you']]\n" +"print(strings[1][0])" + +#. https://futurecoder.io/course/#IntroducingNestedLists +msgid "pages.IntroducingNestedLists.steps.first_nested_list_example.text" +msgstr "" +"干得好！\n" +"\n" +"应用两次索引可以更强大。\n" +"我们不仅可以在字符串列表上使用它，还可以在 *列表的列表* 上使用。\n" +"例如，以下程序会打印什么？\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IntroducingNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.string_list_exercise +msgid "pages.IntroducingNestedLists.steps.string_list_exercise.hints.0.text" +msgstr "你如何访问列表中的第二个字符串？" + +#. https://futurecoder.io/course/#IntroducingNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.string_list_exercise +msgid "pages.IntroducingNestedLists.steps.string_list_exercise.hints.1.text" +msgstr "那么你如何访问字符串中的特定字母？" + +#. https://futurecoder.io/course/#IntroducingNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.string_list_exercise +msgid "pages.IntroducingNestedLists.steps.string_list_exercise.hints.2.text" +msgstr "记住，列表和字符串的索引非常相似。" + +#. https://futurecoder.io/course/#IntroducingNestedLists +#. # __code0__: +#. strings = ["abc", "def", "ghi"] +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22abc%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22def%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22ghi%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.strings +msgid "pages.IntroducingNestedLists.steps.string_list_exercise.text" +msgstr "" +"练习：给定一个字符串列表，打印列表中第二个字符串的第一个字母。例如，给定：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"你应该打印 `d`。" + +#. https://futurecoder.io/course/#IntroducingNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.triple_subscripting +msgid "pages.IntroducingNestedLists.steps.triple_subscripting.hints.0.text" +msgstr "这与之前的练习非常相似。" + +#. https://futurecoder.io/course/#IntroducingNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.triple_subscripting +msgid "pages.IntroducingNestedLists.steps.triple_subscripting.hints.1.text" +msgstr "你需要使用多少次索引？" + +#. https://futurecoder.io/course/#IntroducingNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.triple_subscripting +msgid "pages.IntroducingNestedLists.steps.triple_subscripting.hints.2.text" +msgstr "首先你需要访问一个子列表。" + +#. https://futurecoder.io/course/#IntroducingNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.triple_subscripting +msgid "pages.IntroducingNestedLists.steps.triple_subscripting.hints.3.text" +msgstr "然后访问该子列表中的一个字符串。" + +#. https://futurecoder.io/course/#IntroducingNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.triple_subscripting +msgid "pages.IntroducingNestedLists.steps.triple_subscripting.hints.4.text" +msgstr "然后访问该字符串中的一个字母。" + +#. https://futurecoder.io/course/#IntroducingNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.triple_subscripting +msgid "pages.IntroducingNestedLists.steps.triple_subscripting.hints.5.text" +msgstr "如果你遇到困难，可以使用 `birdseye`。" + +#. https://futurecoder.io/course/#IntroducingNestedLists +msgid "pages.IntroducingNestedLists.steps.triple_subscripting.text" +msgstr "" +"正如你所看到的，Python 允许我们使用 *嵌套列表*：一个每个元素都是另一个列表的列表（我们称它们为 *子列表*）。\n" +"\n" +"我们可以使用多于两次的索引。\n" +"写一个程序，接受像上面那样的嵌套列表 `strings`，\n" +"并打印 **第二个子列表中的第三个字符串的第一个字母**。\n" +"仅使用一个表达式，像在之前的练习中一样。\n" +"例如，对于上面的列表，它应该打印 `y`。" + +#. https://futurecoder.io/course/#IntroducingNestedLists +msgid "pages.IntroducingNestedLists.title" +msgstr "介绍嵌套列表" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.crack_password_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.crack_password_exercise.hints.0.text" +msgstr "想想你如何手动并系统地做到这一点，使用铅笔和纸。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.crack_password_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.crack_password_exercise.hints.1.text" +msgstr "密码必须是四个字母长这一点非常重要。如果密码可以是任意长度，解决起来会困难得多。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.crack_password_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.crack_password_exercise.hints.2.text" +msgstr "但是字符串 `letters` 可能包含任意数量的字符。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.crack_password_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.crack_password_exercise.hints.3.text" +msgstr "" +"如果有 `n` 个不同的字母，那么可能的密码数量是 `n^4 == n*n*n*n`，因为每个位置都有 `n` 个可能的字母，并且它们都是独立的。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.crack_password_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.crack_password_exercise.hints.4.text" +msgstr "" +"假设 `letters = \"ABCD\"`。想象一下你有所有可能的三字母密码。现在对每一个，添加一个 A 到末尾，或者添加一个 B，或者 C，或者 " +"D。这就是你获得所有可能的四字母密码的方法。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.crack_password_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.crack_password_exercise.hints.5.text" +msgstr "记住，一个 for 循环可以包含任何语句，包括另一个 for 循环。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.crack_password_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.crack_password_exercise.hints.6.text" +msgstr "这适用于所有的 for 循环。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.crack_password_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.crack_password_exercise.hints.7.text" +msgstr "一个 for 循环嵌套在另一个 for 循环中已经不够了。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.crack_password_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.crack_password_exercise.hints.8.text" +msgstr "你需要更深入。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. # __code0__: +#. letters = "ABCD" +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22ABCD%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.letters +msgid "pages.IntroducingNestedLoops.steps.crack_password_exercise.text" +msgstr "" +"在下一个练习中，你需要破解一个密码。你知道它正好是四个字母长，并且只有几个可能的字母，你已经写下来了：\n" +"\n" +"__code0__\n" +"\n" +"你需要打印出所有可能的密码：\n" +"\n" +" AAAA\n" +" AAAB\n" +" AAAC\n" +" AAAD\n" +" AABA\n" +" AABB\n" +" ...跳过一些...\n" +" DDDA\n" +" DDDB\n" +" DDDC\n" +" DDDD" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. # __code0__: +#. players = ['Charlie', 'Alice', 'Dylan', 'Bob'] +#. for i in range(len(players)): +#. for j in range(len(players)): +#. if i < j: +#. print(f'{players[i]} vs {players[j]}') +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27Alice%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27Bob%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27Charlie%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27Dylan%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.f%27%7Bplayers%5Bi%5D%7D+vs+%7Bplayers%5Bj%5D%7D%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.players +msgid "pages.IntroducingNestedLoops.steps.final_text.text" +msgstr "" +"太棒了！解决方案如下：\n" +"\n" +"__code0__" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +msgid "pages.IntroducingNestedLoops.steps.first_nested_loop.text" +msgstr "" +"你已经看到，`if` 或循环的缩进体可以包含任何类型的语句，包括更多的 `if` 语句和循环。特别是一个循环可以包含另一个循环。这里有一个例子：\n" +"\n" +"__program_indented__\n" +"\n" +"这被称为 *嵌套循环*。它没有什么新鲜的，只是值得好好理解，因为它对于编写有趣的程序非常有用。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus +msgid "pages.IntroducingNestedLoops.steps.player_vs_player_bonus.hints.0.text" +msgstr "你需要像之前那样在一个 for 循环中嵌套另一个 for 循环。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus +msgid "pages.IntroducingNestedLoops.steps.player_vs_player_bonus.hints.1.text" +msgstr "这次像 `for player1 in players:` 这样的语句将不够。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus +msgid "" +"pages.IntroducingNestedLoops.steps.player_vs_player_bonus.hints.10.text" +msgstr "你需要使用比较运算符。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus +msgid "" +"pages.IntroducingNestedLoops.steps.player_vs_player_bonus.hints.11.text" +msgstr "一旦你弄清楚了关系，你可以用 `if` 语句来表达它。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus +msgid "pages.IntroducingNestedLoops.steps.player_vs_player_bonus.hints.2.text" +msgstr "你的程序需要使用列表中玩家的 *位置*。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus +msgid "pages.IntroducingNestedLoops.steps.player_vs_player_bonus.hints.3.text" +msgstr "这意味着你需要遍历位置并使用索引（下标）来访问列表条目。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus +msgid "pages.IntroducingNestedLoops.steps.player_vs_player_bonus.hints.4.text" +msgstr "要遍历位置，使用 `range`..." + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus +msgid "pages.IntroducingNestedLoops.steps.player_vs_player_bonus.hints.5.text" +msgstr "...和 `len`。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus +msgid "pages.IntroducingNestedLoops.steps.player_vs_player_bonus.hints.6.text" +msgstr "看看期望的输出：`Charlie vs Alice`：`Charlie` 在 `players` 列表中排在 `Alice` 之前。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus +msgid "pages.IntroducingNestedLoops.steps.player_vs_player_bonus.hints.7.text" +msgstr "我们不想打印 `Alice vs Charlie`，因为 `Alice` 在 `players` 中排在 `Charlie` 之后。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus +msgid "pages.IntroducingNestedLoops.steps.player_vs_player_bonus.hints.8.text" +msgstr "我们只想打印那些左侧玩家在列表中排在右侧玩家之前的配对。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus +msgid "pages.IntroducingNestedLoops.steps.player_vs_player_bonus.hints.9.text" +msgstr "我们如何用两个 for 循环的列表索引来表达这种关系？" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. # __code0__: +#. players = ['Charlie', 'Alice', 'Dylan', 'Bob'] +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27Alice%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27Bob%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27Charlie%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27Dylan%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.players +msgid "pages.IntroducingNestedLoops.steps.player_vs_player_bonus.text" +msgstr "" +"哇，你也是个艺术家！\n" +"\n" +"如果你愿意，你可以现在继续到 [下一页](#IntroducingBirdseye)。或者你可以做一个额外的挑战！\n" +"\n" +"像之前的练习一样，你正在组织一个游戏的锦标赛。你有一个玩家名字的列表：\n" +"\n" +"__code0__\n" +"\n" +"这次，每对玩家只应出现一次。具体来说，只打印那些在 `players` 中按从左到右的顺序排列的配对，从包含 `players` 中最左侧的人的配对开始，向右移动。例如，对于上面的内容，你的程序应该打印\n" +"\n" +" Charlie vs Alice\n" +" Charlie vs Dylan\n" +" Charlie vs Bob\n" +" Alice vs Dylan\n" +" Alice vs Bob\n" +" Dylan vs Bob" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.player_vs_player_exercise.hints.0.text" +msgstr "想想你如何手动并系统地做到这一点，使用铅笔和纸。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.player_vs_player_exercise.hints.1.text" +msgstr "你需要在一个 for 循环中嵌套另一个 for 循环。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.player_vs_player_exercise.hints.2.text" +msgstr "你需要一个 `if` 语句来检查两个玩家不是同一个人。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. # __code0__: +#. players = ["Alice", "Bob", "Charlie"] +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Alice%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Bob%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Charlie%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.players +msgid "pages.IntroducingNestedLoops.steps.player_vs_player_exercise.text" +msgstr "" +"完美！\n" +"\n" +"下一个练习：你正在组织一个游戏的锦标赛，比如国际象棋或网球。你有一个玩家名字的列表：\n" +"\n" +"__code0__\n" +"\n" +"每个玩家将与其他每个玩家比赛两次：一次是他们占优势（例如，先移动或发球），一次则不是。打印出所有比赛组合，如下所示：\n" +"\n" +" Alice vs Bob\n" +" Alice vs Charlie\n" +" Bob vs Alice\n" +" Bob vs Charlie\n" +" Charlie vs Alice\n" +" Charlie vs Bob\n" +"\n" +"注意，“Alice vs Bob”和“Bob vs Alice”都在列表中，但没有“Alice vs Alice”——我们不希望任何人和自己比赛。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.times_table_exercise +msgid "pages.IntroducingNestedLoops.steps.times_table_exercise.hints.0.text" +msgstr "你需要在一个 for 循环中嵌套另一个 for 循环。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.times_table_exercise +msgid "pages.IntroducingNestedLoops.steps.times_table_exercise.hints.1.text" +msgstr "你需要从 1 到 12 的数字。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.times_table_exercise +msgid "pages.IntroducingNestedLoops.steps.times_table_exercise.hints.2.text" +msgstr "每当你需要一系列连续的数字时，使用 `range`。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.times_table_exercise +msgid "pages.IntroducingNestedLoops.steps.times_table_exercise.hints.3.text" +msgstr "你想要类似 `for x in range(n):` 的东西。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.times_table_exercise +msgid "pages.IntroducingNestedLoops.steps.times_table_exercise.hints.4.text" +msgstr "这将以 `x = 0` 开始，但有一个简单的解决方法。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.times_table_exercise +msgid "pages.IntroducingNestedLoops.steps.times_table_exercise.hints.5.text" +msgstr "你可以直接给 `x` 加 1。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.times_table_exercise +msgid "pages.IntroducingNestedLoops.steps.times_table_exercise.hints.6.text" +msgstr "使用 `*` 来乘数字。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.times_table_exercise +msgid "pages.IntroducingNestedLoops.steps.times_table_exercise.hints.7.text" +msgstr "使用一个包含多个变量的 f-string。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.times_table_exercise +msgid "pages.IntroducingNestedLoops.steps.times_table_exercise.hints.8.text" +msgstr "记得在每个部分后打印出正确数量的破折号。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.times_table_exercise +msgid "pages.IntroducingNestedLoops.steps.times_table_exercise.hints.9.text" +msgstr "确保每一行在正确的循环中，并且有正确的缩进量。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.times_table_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.times_table_exercise.messages.added_str_and_int.text" +msgstr "你不能将字符串和数字相加。使用 f-string。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.times_table_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.times_table_exercise.messages.adding_one_in_wrong_loop.text" +msgstr "" +"你在错误的地方将 1 加到了外部循环变量上！\n" +"你应该在哪里做这个以修复它？" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.times_table_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.times_table_exercise.messages.too_long.text" +msgstr "" +"你的解决方案太长了。对于这个问题，你只需要几行代码。\n" +"使用嵌套循环，这样你就不需要重复自己。\n" +"计算机会为你完成重复的工作！" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.times_table_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.times_table_exercise.messages.used_times_instead_of_x.text" +msgstr "" +"这几乎是正确的！确保在你的表中显示正确的字符 `x`。\n" +"例如，你的解决方案应该显示 `3 x 4 = 12` 而不是 `3 * 4 = 12`。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +msgid "" +"pages.IntroducingNestedLoops.steps.times_table_exercise.special_messages.multiply_with_x.text" +msgstr "要乘数字，使用 `*`" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +msgid "pages.IntroducingNestedLoops.steps.times_table_exercise.text" +msgstr "" +"确保你完全理解发生了什么。`print(letter)` 和 `print('---')` 各运行 3 次，因为它们的缩进将它们放在 *外部循环* 中。`print(f'{letter} {number}')` 被调用了 3 × 4 = 12 次，因为它在 *内部循环* `for number in range(4):` 中，该循环有 4 次迭代，但它本身在外部循环中，所以它运行了 3 次。\n" +"\n" +"让我们来利用这个！假设你是一名老师，你需要为你的学生打印出从 1 到 12 的所有乘法表。你不想手动写它们，但你可以写一个程序来为你完成这项工作！你的程序输出应该如下所示，包括破折号的行：\n" +"\n" +" 1 x 1 = 1\n" +" 1 x 2 = 2\n" +" 1 x 3 = 3\n" +" 1 x 4 = 4\n" +" 1 x 5 = 5\n" +" 1 x 6 = 6\n" +" 1 x 7 = 7\n" +" 1 x 8 = 8\n" +" 1 x 9 = 9\n" +" 1 x 10 = 10\n" +" 1 x 11 = 11\n" +" 1 x 12 = 12\n" +" ---\n" +" 2 x 1 = 2\n" +" 2 x 2 = 4\n" +" 2 x 3 = 6\n" +" 2 x 4 = 8\n" +" 2 x 5 = 10\n" +" 2 x 6 = 12\n" +" 2 x 7 = 14\n" +" 2 x 8 = 16\n" +" 2 x 9 = 18\n" +" 2 x 10 = 20\n" +" 2 x 11 = 22\n" +" 2 x 12 = 24\n" +" ---\n" +" 3 x 1 = 3\n" +" 3 x 2 = 6\n" +" 3 x 3 = 9\n" +" （你明白了...）\n" +" 11 x 10 = 110\n" +" 11 x 11 = 121\n" +" 11 x 12 = 132\n" +" ---\n" +" 12 x 1 = 12\n" +" 12 x 2 = 24\n" +" 12 x 3 = 36\n" +" 12 x 4 = 48\n" +" 12 x 5 = 60\n" +" 12 x 6 = 72\n" +" 12 x 7 = 84\n" +" 12 x 8 = 96\n" +" 12 x 9 = 108\n" +" 12 x 10 = 120\n" +" 12 x 11 = 132\n" +" 12 x 12 = 144\n" +" ---" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise.hints.0.text" +msgstr "你会如何描述手动输入这个三角形的步骤？" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise.hints.1.text" +msgstr "" +"打印一行 `size` 个加号，然后是 `size - 1` 个加号，依此类推直到 1 个加号。例如打印 5 个 `+`，然后 4 个 `+`，然后 " +"3，2，和 1。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise.hints.2.text" +msgstr "将这个分解成子问题。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise.hints.3.text" +msgstr "你如何打印给定长度的 `+` 的一行，以及如何遍历所有长度？" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise.hints.4.text" +msgstr "构建一行字符应该是你之前练习中非常熟悉的，唯一的区别是你必须使其达到给定长度，而不是仅仅与另一个字符串的长度相同。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise.hints.5.text" +msgstr "一种简单的方法可以让你做某件事情 `n` 次，就是循环遍历 `range(n)`。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise.hints.6.text" +msgstr "你需要在一个循环里面再用一个循环。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise.hints.7.text" +msgstr "" +"你需要倒数的数字，比如 5, 4, 3, 2, 1。可以用 `range` " +"来做到这一点，你可以很容易地查找，但也可以使用普通的范围，并做一些非常简单的数学运算，把递增的数字转换为递减的数字。" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise +msgid "" +"pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise.hints.8.text" +msgstr "什么公式可以把 0 转换成 5，1 转换成 4，2 转换成 3，等等？" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +#. # __code0__: +#. size = 5 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.size +msgid "pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise.text" +msgstr "" +"哇，你现在基本上就是一个黑客了！\n" +"\n" +"再来一个练习。给定一个大小：\n" +"\n" +"__code0__\n" +"\n" +"打印出一个由加号 `+` 组成的“倒三角”，其边长与给定的大小相等，例如：\n" +"\n" +" +++++\n" +" ++++\n" +" +++\n" +" ++\n" +" +" + +#. https://futurecoder.io/course/#IntroducingNestedLoops +msgid "pages.IntroducingNestedLoops.title" +msgstr "介绍嵌套循环" + +#. https://futurecoder.io/course/#IntroducingNotPage +msgid "pages.IntroducingNotPage.steps.IntroducingNot.text" +msgstr "" +"与其他两个布尔运算符 `and` 和 `or` 不同，\n" +"它们用于两个布尔值之间（称为 *二元* 运算符），\n" +"`not` 仅在一个布尔值之前使用（称为 *一元* 运算符）。\n" +"它否定所应用的表达式，有点像负号。试试在 shell 中：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IntroducingNotPage +msgid "pages.IntroducingNotPage.steps.NotFalse.text" +msgstr "" +"现在尝试以下内容：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IntroducingNotPage +#. # __code0__: +#. def valid_image(filename): +#. if filename.endswith(".png") or filename.endswith(".jpg"): +#. return True +#. else: +#. return False +#. assert_equal(valid_image("dog.png"), True) +#. assert_equal(valid_image("cat.jpg"), True) +#. assert_equal(valid_image("invoice.pdf"), False) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22.jpg%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22.png%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22cat.jpg%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22dog.png%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22invoice.pdf%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.filename +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.valid_image +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority +msgid "pages.IntroducingNotPage.steps.NotPriority.hints.0.text" +msgstr "" +"如果你被要求简化这个相关但相反的函数会怎样？\n" +"\n" +"__code0__" + +#. https://futurecoder.io/course/#IntroducingNotPage +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority +msgid "pages.IntroducingNotPage.steps.NotPriority.hints.1.text" +msgstr "在这种情况下，有一个标准的简化技巧可以应用，我们在几页前讨论过。" + +#. https://futurecoder.io/course/#IntroducingNotPage +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority +msgid "pages.IntroducingNotPage.steps.NotPriority.hints.2.text" +msgstr "" +"特别是 `returns` 是多余的，因为 `filename.endswith(\".png\") or " +"filename.endswith(\".jpg\")` 已经是所需的布尔值。" + +#. https://futurecoder.io/course/#IntroducingNotPage +#. # __code0__: +#. def valid_image(filename): +#. return filename.endswith(".png") or filename.endswith(".jpg") +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22.jpg%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22.png%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.filename +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.valid_image +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority +msgid "pages.IntroducingNotPage.steps.NotPriority.hints.3.text" +msgstr "" +"所以你可以直接写：\n" +"\n" +"__code0__" + +#. https://futurecoder.io/course/#IntroducingNotPage +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority +msgid "pages.IntroducingNotPage.steps.NotPriority.hints.4.text" +msgstr "对于真实的练习，你可以做类似的事情。" + +#. https://futurecoder.io/course/#IntroducingNotPage +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority +msgid "pages.IntroducingNotPage.steps.NotPriority.hints.5.text" +msgstr "真实练习中的区别是结果是反转的。" + +#. https://futurecoder.io/course/#IntroducingNotPage +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority +msgid "pages.IntroducingNotPage.steps.NotPriority.hints.6.text" +msgstr "也就是说，当 `valid_image` 返回 `False` 时，`invalid_image` 返回 `True`，反之亦然。" + +#. https://futurecoder.io/course/#IntroducingNotPage +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority +msgid "pages.IntroducingNotPage.steps.NotPriority.hints.7.text" +msgstr "记得 `not` 是做什么的吗？" + +#. https://futurecoder.io/course/#IntroducingNotPage +#. # __code7__: +#. def invalid_image(filename): +#. if filename.endswith(".png") or filename.endswith(".jpg"): +#. return False +#. else: +#. return True +#. assert_equal(invalid_image("dog.png"), False) +#. assert_equal(invalid_image("cat.jpg"), False) +#. assert_equal(invalid_image("invoice.pdf"), True) +#. # __code6__: +#. if invalid_image(filename): +#. print("I can't process " + filename) +#. # __code1__: +#. (not True) or True +#. # __code2__: +#. not (True or True) +#. # __code0__: +#. not True or True +#. # __code4__: +#. (-1) + 2 +#. # __code5__: +#. -(1 + 2) +#. # __code3__: +#. -1 + 2 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22.jpg%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22.png%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22I+can%27t+process+%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22cat.jpg%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22dog.png%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22invoice.pdf%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.filename +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.invalid_image +msgid "pages.IntroducingNotPage.steps.NotPriority.text" +msgstr "" +"你可以在 `birdseye` 中看到\n" +"\n" +"__code0__\n" +"\n" +"被 Python 解释为\n" +"\n" +"__code1__\n" +"\n" +"而不是：\n" +"\n" +"__code2__\n" +"\n" +"所以，如果没有括号，`not` 的优先级高于 `or`。这就像\n" +"\n" +"__code3__\n" +"\n" +"意味着：\n" +"\n" +"__code4__\n" +"\n" +"而不是\n" +"\n" +"__code5__\n" +"\n" +"`not` 的优先级也高于 `and`。\n" +"\n" +"再次强调，主要要记住的是在不确定时使用括号或额外的变量。\n" +"\n" +"练习：假设你正在编写一个处理图像的程序。只有某些类型的文件可以被处理。\n" +"如果用户给你一个无法处理的文件，你想显示一个错误：\n" +"\n" +"__code6__\n" +"\n" +"假设 .png 和 .jpg 文件可以被处理，但其他文件类型不能。\n" +"这里有一个示例函数来做到这一点：\n" +"\n" +" __copyable__\n" +"__code7__\n" +"\n" +"这比需要的要长。重写 `invalid_image` 使得主体是一行 `return `，\n" +"即没有 `if` 语句。它应该通过相同的测试。" + +#. https://futurecoder.io/course/#IntroducingNotPage +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.IntroducingNotPage.steps.NotTrueOrTrue.text" +msgstr "" +"`not` 的优先级与 `and` 和 `or` 相比如何？在 `birdseye` 中尝试以下内容：\n" +"\n" +"__code0__" + +#. https://futurecoder.io/course/#IntroducingNotPage +#. # __code0__: +#. def invalid_image(filename): +#. return not (filename.endswith(".png") or filename.endswith(".jpg")) +#. def invalid_image(filename): +#. return not filename.endswith(".png") and not +#. filename.endswith(".jpg") +#. # __code1__: +#. if x: +#. return False +#. else: +#. return True +#. # __code2__: +#. return not x +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22.jpg%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22.png%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.filename +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.invalid_image +msgid "pages.IntroducingNotPage.steps.final_text.text" +msgstr "" +"干得好！这里有两个有效的解决方案：\n" +"\n" +"__code0__\n" +"\n" +"（如果你感兴趣，这两个是等效的，因为有一个叫做德摩根定律的东西）\n" +"\n" +"还要注意，这是另一个可以简化的一般模式：如果你的代码的形式是：\n" +"\n" +"__code1__\n" +"\n" +"其中 `x` 本身是一个布尔值，那么可以简化为：\n" +"\n" +"__code2__" + +#. https://futurecoder.io/course/#IntroducingNotPage +msgid "pages.IntroducingNotPage.title" +msgstr "介绍 `not`" + +#. https://futurecoder.io/course/#IntroducingOr +#. # __code0__: +#. return name == "Alice" or name == "Bob" +#. # __code1__: +#. return name == "Alice" or "Bob" +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Alice%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Bob%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.name +msgid "pages.IntroducingOr.steps.ACommonMistake.requirements" +msgstr "" +"运行上一步的程序，但将:\n" +"\n" +"__code0__\n" +"\n" +"替换为:\n" +"\n" +"__code1__" + +#. https://futurecoder.io/course/#IntroducingOr +#. # __code0__: +#. return name == "Alice" or name == "Bob" +#. # __code1__: +#. return name == "Alice" or "Bob" +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Alice%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Bob%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.name +msgid "pages.IntroducingOr.steps.ACommonMistake.text" +msgstr "" +"请仔细注意我们是如何写条件的:\n" +"\n" +"__code0__\n" +"\n" +"一个常见的错误是写成这样:\n" +"\n" +"__code1__\n" +"\n" +"如果你用英语来读它，这样是有道理的:\n" +"\n" +"> `return` whether `name` is equal to either `\"Alice\"` or `\"Bob\"`\n" +"\n" +"但 Python 不是英语，`or` 不是这样工作的。\n" +"\n" +"用上面的行替换代码中的 `return` 行，然后再试着运行它。" + +msgid "pages.IntroducingOr.steps.AnExercise.disallowed.3.label" +msgstr "比较链" + +#. https://futurecoder.io/course/#IntroducingOr +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise +msgid "pages.IntroducingOr.steps.AnExercise.hints.0.text" +msgstr "记住，你可以使用比较运算符 `<, >, <=, >=, ==` 来生成布尔值。" + +#. https://futurecoder.io/course/#IntroducingOr +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise +msgid "pages.IntroducingOr.steps.AnExercise.hints.1.text" +msgstr "你需要检查 `x` 与 0 的比较以及与 100 的比较。" + +#. https://futurecoder.io/course/#IntroducingOr +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise +msgid "pages.IntroducingOr.steps.AnExercise.hints.2.text" +msgstr "你需要将这两个比较结合成一个布尔值，使用 `or`。" + +#. https://futurecoder.io/course/#IntroducingOr +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise +msgid "pages.IntroducingOr.steps.AnExercise.hints.3.text" +msgstr "上面我们使用了一个技巧，使整个函数体只是 `return or `。但在这里不行！" + +#. https://futurecoder.io/course/#IntroducingOr +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise +msgid "pages.IntroducingOr.steps.AnExercise.hints.4.text" +msgstr "你需要使用 `if` 语句。" + +#. https://futurecoder.io/course/#IntroducingOr +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise +msgid "pages.IntroducingOr.steps.AnExercise.hints.5.text" +msgstr "你需要有一个 `return False` 和一个 `return True`。" + +#. https://futurecoder.io/course/#IntroducingOr +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise +msgid "pages.IntroducingOr.steps.AnExercise.hints.6.text" +msgstr "" +"如果你有像 `x >= 0 or x <= 100` 这样的东西，你就走错了方向。这对 *任何* 值的 `x` 都会成立。毕竟，101 大于 0！" + +#. https://futurecoder.io/course/#IntroducingOr +#. # __code4__: +#. assert_equal(is_valid_percentage(-1), False) +#. assert_equal(is_valid_percentage(0), True) +#. assert_equal(is_valid_percentage(50), True) +#. assert_equal(is_valid_percentage(100), True) +#. assert_equal(is_valid_percentage(101), False) +#. # __code3__: +#. return name in ["Alice", "Bob", "Charlie"] +#. # __code2__: +#. (name == "Alice") or ("Bob") +#. # __code1__: +#. name == ("Alice" or "Bob") +#. # __code0__: +#. name == "Alice" or "Bob" +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Alice%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Bob%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Charlie%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.is_valid_percentage +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.name +msgid "pages.IntroducingOr.steps.AnExercise.text" +msgstr "" +"当我们用 `birdseye` 检查它时，我们可以看到:\n" +"\n" +"__code0__\n" +"\n" +"并没有像我们用英语思考的那样翻译成\n" +"\n" +"__code1__\n" +"\n" +"而是:\n" +"\n" +"__code2__\n" +"\n" +"当 `name == \"Alice\"` 为 `False` 时，它的值是 `\"Bob\"`。\n" +"\n" +"也许你会觉得这样:\n" +"\n" +"[![我现在有更多问题](https://i.imgur.com/jN57tGt.png)](https://imgur.com/a/icKzI)\n" +"\n" +"你需要知道的唯一一件事是: 在你知道自己在做什么之前，始终\n" +"确保在 `or` 的两边放置布尔值，因为它是一个布尔运算符。\n" +"`name == \"Alice\" or \"Bob\"` 违反了这个规则。\n" +"\n" +"如果你感到好奇，答案在下面，但如果你想可以跳过它们，继续下面的练习。\n" +"\n" +"----\n" +"\n" +"> 为什么 `(name == \"Alice\") or (\"Bob\")` 等于 `\"Bob\"`？为什么它等于任何东西？`\"Bob\"` 甚至不是布尔值！\n" +"\n" +"定义 \"`A or B` 是 `True` 如果 `A` 或 `B` 为 `True`\" 是一种简化。它是思考 `or` 的最简单方式，尤其是在编写 `if` 语句时。\n" +"真正的定义是，如果 `A` 为真，那么 `A or B` 就是 `A`（实际上 `B` 甚至不会被计算），\n" +"否则就是 `B`。\n" +"你可以自己看到，如果 `A` 和 `B` 是布尔值，那么这两个定义是等价的。\n" +"在这个例子中 `A` 是 `name == \"Alice\"`，它是 `False`，所以 `A or B` 是 `B`，即 `\"Bob\"`。\n" +"\n" +"> 有没有更好的方法来写条件，而不每次都重复 `name ==`？\n" +"\n" +"有的！在 [列表的函数和方法](#FunctionsAndMethodsForLists) 中我们提到过 `in`\n" +"运算符，你可以这样与列表一起使用:\n" +"\n" +"__code3__\n" +"\n" +"但你不能总是像那样去掉 `or`。\n" +"\n" +"----\n" +"\n" +"练习: 编写一个名为 `is_valid_percentage` 的函数，接受一个数值参数 `x`。\n" +"如果 `x` 在 0 到 100 之间（包括 0 和 100），则返回 `True`，否则返回 `False`。\n" +"你的函数应该使用 `or`，并通过这些测试:\n" +"\n" +" __copyable__\n" +"__code4__" + +#. https://futurecoder.io/course/#IntroducingOr +msgid "pages.IntroducingOr.steps.FalseOrFalse.text" +msgstr "" +"最后，尝试:\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IntroducingOr +#. # __code0__: +#. if name == "Alice" or name == "Bob": +#. return True +#. else: +#. return False +#. # __code1__: +#. return name == "Alice" or name == "Bob" +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Alice%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Bob%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.name +msgid "pages.IntroducingOr.steps.FurtherImprovement.requirements" +msgstr "" +"运行上一步的程序，但将:\n" +"\n" +"__code0__\n" +"\n" +"替换为:\n" +"\n" +"__code1__" + +#. https://futurecoder.io/course/#IntroducingOr +#. # __code1__: +#. if x: +#. return True +#. else: +#. return False +#. # __code0__: +#. name == "Alice" or name == "Bob" +#. # __code2__: +#. return x +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Alice%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Bob%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.name +msgid "pages.IntroducingOr.steps.FurtherImprovement.text" +msgstr "" +"我们可以做得更好。注意到\n" +"\n" +"__code0__\n" +"\n" +"是一个布尔值，而两个 `return` 语句都返回布尔值 `True` 或 `False`。\n" +"这个函数:\n" +"\n" +" - 当 `name == \"Alice\" or name == \"Bob\"` 为 `True` 时返回 `True`，\n" +" - 当 `name == \"Alice\" or name == \"Bob\"` 为 `False` 时返回 `False`。\n" +"\n" +"所以我们可以简单地在这两种情况下返回布尔值 `name == \"Alice\" or name == \"Bob\"` 本身！\n" +"\n" +"这是简化代码的常见模式。如果你发现自己写代码像这样:\n" +"\n" +"__code1__\n" +"\n" +"其中 `x` 本身是一个布尔值，你总是可以将这段代码简化为:\n" +"\n" +"__code2__\n" +"\n" +"自己应用这个简化到代码中，并再次运行它。" + +#. https://futurecoder.io/course/#IntroducingOr +msgid "pages.IntroducingOr.steps.ImprovingWithOr.requirements" +msgstr "从页面顶部复制程序，然后将函数的前四行更改为使用 `or`，如建议的那样。" + +#. https://futurecoder.io/course/#IntroducingOr +#. # __code0__: +#. if name == "Alice": +#. return True +#. elif name == "Bob": +#. return True +#. # __code1__: +#. if name == "Alice" or name == "Bob": +#. return True +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Alice%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Bob%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.name +msgid "pages.IntroducingOr.steps.ImprovingWithOr.text" +msgstr "" +"在编辑器中，将:\n" +"\n" +"__code0__\n" +"\n" +"替换为:\n" +"\n" +"__code1__\n" +"\n" +"正如你所看到的，`is_friend` 只有在 `name` 是 Alice 或 Bob 时才会返回 `True`。\n" +"`or` 用于连接两个布尔值 `name == \"Alice\"` 和 `name == \"Bob\"` 之间。" + +#. https://futurecoder.io/course/#IntroducingOr +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.IntroducingOr.steps.InputAliceBob.text" +msgstr "" +"我们在介绍 If 语句时学习了 *布尔值* (`True` 和 `False`)。\n" +"我们还学习了比较运算符 `==`, `<`, `>`, `<=`, `>=`，它们返回布尔值。\n" +"现在我们想要结合布尔值来检查更复杂的条件。\n" +"\n" +"这里有一个简单的例子：想象一下你有两个朋友，Alice 和 Bob。\n" +"下面的函数接受一个参数 `name`，并检查给定名称的人是否是你的朋友。\n" +"复制并运行编辑器中的代码:\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#IntroducingOr +msgid "pages.IntroducingOr.steps.InspectWithBirdseye.requirements" +msgstr "运行与上一步相同的代码，但使用 `birdseye`。" + +#. https://futurecoder.io/course/#IntroducingOr +msgid "pages.IntroducingOr.steps.InspectWithBirdseye.text" +msgstr "" +"第二个和第三个测试失败了！我们的函数似乎做错了事情:\n" +"当 `name` 是 `\"Bob\"` 或 `\"Charlie\"` 时，它返回 `\"Bob\"`（一个字符串，而不是布尔值！）。发生了什么？\n" +"再次使用 `birdseye` 运行同样有问题的代码。仔细检查每个 `is_friend` 调用的 `return` 语句。\n" +"(使用蓝色箭头按钮)" + +#. https://futurecoder.io/course/#IntroducingOr +msgid "pages.IntroducingOr.steps.TrueOrFalse.text" +msgstr "" +"好的，现在尝试:\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IntroducingOr +msgid "pages.IntroducingOr.steps.TrueOrTrue.text" +msgstr "" +"让我们看看是否可以做得更好。\n" +"我们可以使用 **`or`** 结合 `if` 和 `elif` 语句。`or` 是一个 *布尔运算符*，\n" +"意味着它是一个运算符（像 `+` 或 `-`），用于结合两个布尔值（`True` 或 `False`）。\n" +"\n" +"表达式 `A or B` 如果 `A` 或 `B` 为 `True`，即如果 `A` 为 `True` 或 `B` 为 `True`，或两者都为 `True`，则为 `True`。\n" +"只有在 `A` 和 `B` 都为 `False` 时，它才为 `False`。\n" +"\n" +"在 shell 中尝试以下内容。\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IntroducingOr +msgid "pages.IntroducingOr.steps.final_text.text" +msgstr "干得好！" + +#. https://futurecoder.io/course/#IntroducingOr +msgid "pages.IntroducingOr.title" +msgstr "介绍 `or`" + +#. https://futurecoder.io/course/#IntroducingStrings +msgid "pages.IntroducingStrings.steps.final_text.text" +msgstr "" +"shell 只是简单地返回相同的内容，因为没有进一步的计算。`'hello'` 只是等于 `'hello'`。\n" +"\n" +"字符串是字符的序列。字符是单个符号，例如字母、数字、标点符号、空格等。在这个例子中，字符串包含 5 个字符 `hello`。引号不是字符串的一部分 - 它们是用来告诉人类和计算机这是一个由引号之间的字符组成的字符串。" + +#. https://futurecoder.io/course/#IntroducingStrings +msgid "pages.IntroducingStrings.steps.hello_string.text" +msgstr "" +"Python 让你做的不仅仅是计算。事实上，我们一段时间内不会接触数字或数学。相反，我们将关注 *字符串*。字符串本质上是文本的片段。例如，在 shell 中输入以下内容，包含引号 (`'`)：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IntroducingStrings +msgid "pages.IntroducingStrings.title" +msgstr "介绍字符串" + +#. https://futurecoder.io/course/#IntroducingTheShell +msgid "pages.IntroducingTheShell.steps.final_text.text" +msgstr "太棒了！继续尝试。当你准备好了，点击“下一步”继续。" + +#. https://futurecoder.io/course/#IntroducingTheShell +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTheShell.steps.first_expression +msgid "" +"pages.IntroducingTheShell.steps.first_expression.messages.anything_else.text" +msgstr "" +"很好，你在尝试自己的实验！\n" +"这真是个好兆头。继续保持。\n" +"我只是想让你知道，你最终需要输入 `1+2` 才能继续进行。" + +#. https://futurecoder.io/course/#IntroducingTheShell +msgid "pages.IntroducingTheShell.steps.first_expression.text" +msgstr "" +"右边是 *shell*。这是运行小段 Python 代码的地方。只需输入一些代码，按下回车，它就会运行！现在试试：\n" +"\n" +"1. 点击 shell 的任何地方（黑色区域）。\n" +"2. 输入 `__program__`\n" +"3. 按下键盘上的 Enter 键。" + +#. https://futurecoder.io/course/#IntroducingTheShell +msgid "pages.IntroducingTheShell.steps.more_calculation.requirements" +msgstr "在 shell 中运行类似于 `1 + 2` 的代码，但将 `+` 替换为 `*`、`/` 或 `-`。" + +#. https://futurecoder.io/course/#IntroducingTheShell +#. # __code0__: +#. 3 * 4 +msgid "" +"pages.IntroducingTheShell.steps.more_calculation.special_messages.multiply_with_x.text" +msgstr "" +"我看到一个 'x'。如果你想进行乘法运算，请使用星号，例如：\n" +"\n" +"__code0__" + +#. https://futurecoder.io/course/#IntroducingTheShell +msgid "pages.IntroducingTheShell.steps.more_calculation.text" +msgstr "" +"很好！Python 计算了 `1+2` 并得到了结果 `3`，所以 shell 显示了这个结果。\n" +"\n" +"shell 可能是你学习 Python 最重要的工具，你应该花很多时间在里面进行实验和探索。保持好奇心！不断问自己“如果我运行 X，会发生什么？”然后立即通过运行它来回答这个问题。不要害怕尝试任何事情 - 如果你出错了，也不会发生什么坏事。\n" +"\n" +"现在试着做一些更多的计算。你可以用 `*` 乘法，`/` 除法，和 `-` 减法。你还可以使用括号，即 `(` 和 `)`。" + +#. https://futurecoder.io/course/#IntroducingTheShell +msgid "pages.IntroducingTheShell.title" +msgstr "介绍 Shell" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner +msgid "pages.IntroducingTicTacToe.steps.column_winner.hints.0.text" +msgstr "你可以先模仿上面的 `row_winner`，然后修改它以使其适用于列。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner +msgid "pages.IntroducingTicTacToe.steps.column_winner.hints.1.text" +msgstr "你不能像遍历 `board` 的行那样简单地遍历列。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner +msgid "pages.IntroducingTicTacToe.steps.column_winner.hints.10.text" +msgstr "为每一列定义一个布尔值，然后在内部循环中相应地更新它。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner +msgid "pages.IntroducingTicTacToe.steps.column_winner.hints.11.text" +msgstr "剩下的逻辑与 `row_winner` 非常相似。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner +msgid "pages.IntroducingTicTacToe.steps.column_winner.hints.12.text" +msgstr "注意 `' '`。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner +msgid "pages.IntroducingTicTacToe.steps.column_winner.hints.13.text" +msgstr "如果需要，记得在最后返回 `False`。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner +msgid "pages.IntroducingTicTacToe.steps.column_winner.hints.2.text" +msgstr "嵌套列表的列是什么？第一列由第一行的第一个元素、第二行的第一个元素等组成。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner +msgid "pages.IntroducingTicTacToe.steps.column_winner.hints.3.text" +msgstr "遍历所有列意味着查看每一行的第一个元素，然后是每一行的第二个元素，依此类推。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner +msgid "pages.IntroducingTicTacToe.steps.column_winner.hints.4.text" +msgstr "所以你需要先遍历表示位置的数字，第一、第二等。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner +msgid "pages.IntroducingTicTacToe.steps.column_winner.hints.5.text" +msgstr "如何找到 `board` 中的列数？" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner +msgid "pages.IntroducingTicTacToe.steps.column_winner.hints.6.text" +msgstr "这涵盖了外部循环，它遍历每一列。然后你需要一个内部循环来遍历列中的每个元素。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner +msgid "pages.IntroducingTicTacToe.steps.column_winner.hints.7.text" +msgstr "列的不同条目不在同一行。那么你如何访问它们呢？" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner +msgid "pages.IntroducingTicTacToe.steps.column_winner.hints.8.text" +msgstr "你可以遍历棋盘的行，找到与该行和当前列对应的元素。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner +msgid "pages.IntroducingTicTacToe.steps.column_winner.hints.9.text" +msgstr "要访问第 5 列的所有条目，你可以遍历所有行，并访问每一行的第 5 个元素。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. # __code0__: +#. def column_winner(board): +#. ... +#. assert_equal( +#. column_winner( +#. [ +#. ['X', 'O', ' '], +#. ['X', 'O', ' '], +#. ['O', 'X', ' '] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. column_winner( +#. [ +#. ['X', 'O', ' ', 'X'], +#. [' ', 'O', 'X', 'O'], +#. ['O', 'O', 'X', 'X'], +#. ['O', 'O', 'X', ' '] +#. ] +#. ), +#. True +#. ) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.board +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.column_winner +msgid "pages.IntroducingTicTacToe.steps.column_winner.text" +msgstr "" +"干得好！\n" +"\n" +"现在写一个类似的函数 `column_winner`，检查是否有获胜的 *列*（垂直线）：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"这里 `O` 在第二个棋盘的第二列获胜。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner +msgid "pages.IntroducingTicTacToe.steps.diagonal_winner.hints.0.text" +msgstr "在任意大小的方形棋盘上有多少条对角线？" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner +msgid "pages.IntroducingTicTacToe.steps.diagonal_winner.hints.1.text" +msgstr "即使棋盘的大小发生变化，对角线的数量也保持不变！" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner +msgid "pages.IntroducingTicTacToe.steps.diagonal_winner.hints.10.text" +msgstr "你可以使用一个循环同时检查两个对角线。或者你可以为每个对角线使用一个循环。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner +msgid "pages.IntroducingTicTacToe.steps.diagonal_winner.hints.2.text" +msgstr "" +"这次你不能像 `middle == board[0][0] and middle == board[2][2]` 这样做，因为你不知道对角线的长度。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner +msgid "pages.IntroducingTicTacToe.steps.diagonal_winner.hints.3.text" +msgstr "此外，这两个对角线可能没有像 `middle` 这样的共同元素。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner +msgid "pages.IntroducingTicTacToe.steps.diagonal_winner.hints.4.text" +msgstr "首先，关注从左上到右下的对角线。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner +msgid "pages.IntroducingTicTacToe.steps.diagonal_winner.hints.5.text" +msgstr "你如何通过双重下标访问这些条目？" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner +msgid "pages.IntroducingTicTacToe.steps.diagonal_winner.hints.6.text" +msgstr "你在这些双重下标中看到模式了吗？拿出纸和笔，尝试在一些例子上计算一下。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner +msgid "pages.IntroducingTicTacToe.steps.diagonal_winner.hints.7.text" +msgstr "现在关注另一条对角线（从右上到左下）。下标中又有一个模式，但稍微复杂一些。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner +msgid "pages.IntroducingTicTacToe.steps.diagonal_winner.hints.8.text" +msgstr "你还记得负索引吗？这可能在这里有帮助。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner +msgid "pages.IntroducingTicTacToe.steps.diagonal_winner.hints.9.text" +msgstr "一旦你掌握了这些模式，就可以使用之前的相同思路来检查所有条目是否相等。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. # __code1__: +#. def diagonal_winner(board): +#. ... +#. assert_equal( +#. diagonal_winner( +#. [ +#. ['O', 'X', 'O', 'X'], +#. [' ', 'O', 'X', ' '], +#. ['X', 'X', ' ', 'X'], +#. ['X', ' ', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. diagonal_winner( +#. [ +#. ['X', 'X', ' '], +#. ['X', ' ', 'O'], +#. [' ', 'O', 'O'] +#. ] +#. ), +#. False +#. ) +#. # __code0__: +#. def diagonal_winner(board): +#. middle = board[1][1] +#. return ( +#. (middle == board[0][0] and middle == board[2][2]) or +#. (middle == board[0][2] and middle == board[2][0]) +#. ) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.board +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.diagonal_winner +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.middle +msgid "pages.IntroducingTicTacToe.steps.diagonal_winner.text" +msgstr "" +"很棒！这很有挑战性。\n" +"\n" +"最后，我们需要检查获胜的对角线。你已经在上一章中写了一个函数来完成这个任务，适用于 3x3 的棋盘：\n" +"\n" +"__code0__\n" +"\n" +"现在写一个适用于任意大小方形棋盘的 `diagonal_winner`：4x4、5x5，等等...\n" +"\n" +" __copyable__\n" +"__code1__\n" +"\n" +"在第一个例子中，`X` 在从左下到右上的对角线上获胜。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +msgid "pages.IntroducingTicTacToe.steps.final_text.text" +msgstr "" +"干得好！\n" +"\n" +"现在我们有了确定棋盘上获胜状态的代码。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner +msgid "pages.IntroducingTicTacToe.steps.intro_row_winner.hints.0.text" +msgstr "你需要检查棋盘中的每一行，所以你需要一个循环来实现这一点。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner +msgid "pages.IntroducingTicTacToe.steps.intro_row_winner.hints.1.text" +msgstr "你如何检查一行中的所有条目是否相等？" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner +msgid "pages.IntroducingTicTacToe.steps.intro_row_winner.hints.10.text" +msgstr "如果没有获胜的行，请确保返回 `False`" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner +msgid "pages.IntroducingTicTacToe.steps.intro_row_winner.hints.2.text" +msgstr "这是一个独立的问题。你可以先忘记整个棋盘，只检查一行。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner +msgid "pages.IntroducingTicTacToe.steps.intro_row_winner.hints.3.text" +msgstr "你甚至可以写一个只做这个的函数，虽然你不必这样做。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner +msgid "pages.IntroducingTicTacToe.steps.intro_row_winner.hints.4.text" +msgstr "由于行的大小可能不同，你需要遍历整个行。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner +msgid "pages.IntroducingTicTacToe.steps.intro_row_winner.hints.5.text" +msgstr "对于每一行，定义一个布尔值。然后遍历该行，相应地更新布尔值。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner +msgid "pages.IntroducingTicTacToe.steps.intro_row_winner.hints.6.text" +msgstr "你可以使用行中的第一个条目 `row[0]` 来与所有行条目进行比较。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner +msgid "pages.IntroducingTicTacToe.steps.intro_row_winner.hints.7.text" +msgstr "仔细考虑布尔值的初始值应该是什么，以及在什么条件下应该更改它的值。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner +msgid "pages.IntroducingTicTacToe.steps.intro_row_winner.hints.8.text" +msgstr "在遍历一行后，如果你确定所有条目都相等，则返回 `True`（提前结束外部循环）。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner +msgid "pages.IntroducingTicTacToe.steps.intro_row_winner.hints.9.text" +msgstr "确保你不会因为一行全是空格而返回 `True`。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner +msgid "" +"pages.IntroducingTicTacToe.steps.intro_row_winner.messages.catch_empty_row.text" +msgstr "请记住，有些条目可能是 `' '`。空行不是获胜行。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. # __code2__: +#. def row_winner(board): +#. ... +#. assert_equal( +#. row_winner( +#. [ +#. ['A', 'A', 'B', 'A'], +#. [' ', ' ', ' ', ' '], +#. ['A', ' ', ' ', 'A'], +#. ['B', ' ', 'B', 'A'] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. row_winner( +#. [ +#. ['X', ' ', 'X'], +#. ['O', 'X', 'X'], +#. ['O', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. # __code1__: +#. board = [ +#. ['A', 'B', 'A', 'A'], +#. ['B', ' ', ' ', 'A'], +#. [' ', 'A', 'B', 'B'], +#. [' ', 'A', 'B', ' '] +#. ] +#. # __code0__: +#. board = [ +#. ['X', 'O', 'X'], +#. ['O', ' ', ' '], +#. [' ', 'X', 'O'] +#. ] +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.board +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.row_winner +msgid "pages.IntroducingTicTacToe.steps.intro_row_winner.text" +msgstr "" +"你已经完成了许多短小的练习，解决一个个小问题。现在我们将处理一个更大、更复杂的\n" +"项目，这将真正考验你的知识，并需要将许多小部分结合在一起。\n" +"这将会非常有趣！\n" +"\n" +"你将开发一个基于文本的互动井字棋游戏，由两个玩家进行游戏。\n" +"以下是完成的游戏在进行中的小预览：\n" +"\n" +" 1 2 3\n" +" 1 | |\n" +" -+-+-\n" +" 2 | |\n" +" -+-+-\n" +" 3 | |\n" +"\n" +" X 进行游戏：\n" +" 1\n" +" 1\n" +"\n" +" 1 2 3\n" +" 1 X| |\n" +" -+-+-\n" +" 2 | |\n" +" -+-+-\n" +" 3 | |\n" +"\n" +" O 进行游戏：\n" +" 2\n" +" 2\n" +"\n" +" 1 2 3\n" +" 1 X| |\n" +" -+-+-\n" +" 2 |O|\n" +" -+-+-\n" +" 3 | |\n" +"\n" +" X 进行游戏：\n" +" 1\n" +" 3\n" +"\n" +" 1 2 3\n" +" 1 X| |X\n" +" -+-+-\n" +" 2 |O|\n" +" -+-+-\n" +" 3 | |\n" +"\n" +"我们将把这个项目分解成几个小函数，这将是练习。\n" +"\n" +"你将使用到你迄今为止学到的许多概念：字符串、\n" +"嵌套列表、嵌套循环、`range`、在函数内调用函数、比较和布尔值。\n" +"\n" +"在这个过程中，你还将学习一些新概念，包括换行符、类型和 `input()`。\n" +"\n" +"以下是项目的大致轮廓：\n" +"\n" +"- 三个函数 `row_winner`、`column_winner`、`diagonal_winner`，检查整个棋盘的获胜行、列和对角线\n" +"- 一个函数 `winner`，检查整个棋盘是否有获胜者，结合上述函数\n" +"- 一个函数 `format_board`，显示游戏的当前状态\n" +"- 一个函数 `play_move`，接受用户输入以进行移动，\n" +"- 最后一个 `play_game` 函数，将所有内容组合在一起并互动运行游戏。\n" +"- 之后我们将添加进一步的改进。\n" +"\n" +"让我们开始吧！\n" +"\n" +"和上一章一样，我们将把井字棋棋盘表示为一个嵌套的字符串列表。\n" +"对于典型的游戏，这将是一个 3x3 的列表，即 3 个列表，每个包含 3 个字符串，玩家用 `'X'` 或 `'O'` 表示。\n" +"空方格将用一个空格表示，即 `' '`。例如：\n" +"\n" +"__code0__\n" +"\n" +"但是为了让事情更有趣，你的代码需要适用于任意大小的方形棋盘\n" +"(4x4、5x5 等)，玩家可以用任何字符串表示，例如：\n" +"\n" +"__code1__\n" +"\n" +"编写一个函数 `row_winner`，如果 `board` 包含\n" +"一个获胜的行，即所有条目中都有相同的字符（除了 `' '`），则返回 `True`：\n" +"\n" +" __copyable__\n" +"__code2__\n" +"\n" +"在第二个例子中，`O` 在底行获胜。" + +msgid "pages.IntroducingTicTacToe.steps.winner.disallowed.0.message" +msgstr "" +"你的解决方案应该通过调用这三个函数来工作。`winner` 本身不应该进行任何\n" +"循环、下标等操作。它应该非常简短。\n" +"\n" +"复制 `row_winner` 和其他函数，并保持它们原样。不要将代码从它们复制到 `winner` 函数中，只需调用这些函数。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner +msgid "pages.IntroducingTicTacToe.steps.winner.hints.0.text" +msgstr "解决方案非常简短！只需正确使用这三个函数。" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner +msgid "pages.IntroducingTicTacToe.steps.winner.hints.1.text" +msgstr "考虑可能的情况。什么时候 `winner(board)` 返回 `False`？什么时候返回 `True`？" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner +msgid "pages.IntroducingTicTacToe.steps.winner.hints.2.text" +msgstr "你如何将这三个函数和布尔运算符结合使用，以获得所需的结果？" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +#. # __code0__: +#. def winner(board): +#. ... +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i-1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. assert_equal( +#. winner( +#. [ +#. ['X', 'X', 'X', ' '], +#. ['X', 'X', ' ', ' '], +#. ['X', ' ', 'O', 'X'], +#. [' ', ' ', 'O', 'X'] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' ', 'X'], +#. ['O', 'X', 'O'], +#. ['O', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' '], +#. ['X', 'O'] +#. ] +#. ), +#. True +#. ) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.board +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.col +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.column +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.column_winner +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.diagonal1 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.diagonal2 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.diagonal_winner +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.entry +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.piece +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.row +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.row_winner +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.strings +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.winner +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.winning_line +msgid "pages.IntroducingTicTacToe.steps.winner.text" +msgstr "" +"太棒了！这很难。\n" +"\n" +"现在我们可以把这三个函数组合在一起！写一个函数 `winner`，接受参数 `board`，如前所述，\n" +"如果 `board` 包含获胜的行、列或对角线，则返回 `True`，否则返回 `False`。\n" +"\n" +"你的解决方案应该通过调用这三个函数来工作。`winner` 本身不应该进行任何\n" +"循环、下标等操作。\n" +"\n" +"以下是 `row_winner`、`column_winner` 和 `diagonal_winner` 的一些代码，以及 `winner` 的一些测试。\n" +"点击复制按钮，并填写 `winner` 函数的空白部分。\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#IntroducingTicTacToe +msgid "pages.IntroducingTicTacToe.title" +msgstr "检查棋盘上的获胜者" + +#. https://futurecoder.io/course/#IntroducingVariables +msgid "pages.IntroducingVariables.steps.final_text.text" +msgstr "" +"答案是 `sunshine` 看起来像一个变量，所以 Python 尝试查找它的值，但由于我们从未定义过这个名字的变量，因此我们会得到一个错误。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingVariables.steps.sunshine_undefined_check +msgid "" +"pages.IntroducingVariables.steps.sunshine_undefined_check.output_prediction_choices.0" +msgstr "sunshine" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingVariables.steps.sunshine_undefined_check +msgid "" +"pages.IntroducingVariables.steps.sunshine_undefined_check.output_prediction_choices.1" +msgstr "'sunshine'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingVariables.steps.sunshine_undefined_check +msgid "" +"pages.IntroducingVariables.steps.sunshine_undefined_check.output_prediction_choices.2" +msgstr "Hello" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingVariables.steps.sunshine_undefined_check +msgid "" +"pages.IntroducingVariables.steps.sunshine_undefined_check.output_prediction_choices.3" +msgstr "'Hello'" + +#. https://futurecoder.io/course/#IntroducingVariables +msgid "pages.IntroducingVariables.steps.sunshine_undefined_check.text" +msgstr "" +"如你所见，引号使一切变得不同。`'word'` 仅仅是 `'word'`，因此它被称为 *字符串字面量*。另一方面，`word` 是一个变量，它的值可以是任何东西。\n" +"\n" +"同样，`'sunshine'` 是 `'sunshine'`，但没有引号的 `__program__` 是什么呢？" + +#. https://futurecoder.io/course/#IntroducingVariables +msgid "pages.IntroducingVariables.steps.word_assign.text" +msgstr "" +"要制作有趣的程序，我们不能总是操作相同的值。我们需要一种方法来引用那些未知且可以改变的值——可以变化的值。这些被称为 *变量*。\n" +"\n" +"运行这段代码：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#IntroducingVariables +msgid "" +"pages.IntroducingVariables.steps.word_check.special_messages.bad_word.text" +msgstr "哎呀，你需要先设置 `word = 'Hello'`，然后我们才能继续。" + +#. https://futurecoder.io/course/#IntroducingVariables +msgid "pages.IntroducingVariables.steps.word_check.text" +msgstr "" +"这创建了一个名为 `word` 的变量，它引用字符串值 `'Hello'`。\n" +"\n" +"现在看看当你单独在 shell 中运行 `__program__` 时会发生什么。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingVariables.steps.word_string_check +msgid "" +"pages.IntroducingVariables.steps.word_string_check.output_prediction_choices.0" +msgstr "word" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingVariables.steps.word_string_check +msgid "" +"pages.IntroducingVariables.steps.word_string_check.output_prediction_choices.1" +msgstr "'word'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingVariables.steps.word_string_check +msgid "" +"pages.IntroducingVariables.steps.word_string_check.output_prediction_choices.2" +msgstr "Hello" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingVariables.steps.word_string_check +msgid "" +"pages.IntroducingVariables.steps.word_string_check.output_prediction_choices.3" +msgstr "'Hello'" + +#. https://futurecoder.io/course/#IntroducingVariables +msgid "pages.IntroducingVariables.steps.word_string_check.text" +msgstr "很好。为了比较，单独在 shell 中运行 `__program__`，带上引号。" + +#. https://futurecoder.io/course/#IntroducingVariables +msgid "pages.IntroducingVariables.title" +msgstr "介绍变量" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +msgid "pages.LoopingOverNestedLists.steps.final_text.text" +msgstr "" +"你已经掌握了嵌套列表以及如何将它们与嵌套循环结合起来。\n" +"太棒了！你现在在你的工具箱中拥有了非常强大的编程工具。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.list_contains_word_exercise.hints.0.text" +msgstr "这与之前的练习非常相似。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.list_contains_word_exercise.hints.1.text" +msgstr "你应该什么时候打印布尔值？" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.list_contains_word_exercise.hints.2.text" +msgstr "记住你只想打印一次。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.list_contains_word_exercise.hints.3.text" +msgstr "不要为每个子列表定义一个布尔值，而是为整个列表定义一个布尔值。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.list_contains_word_exercise.hints.4.text" +msgstr "你应该什么时候以及如何修改布尔值？" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. # __code0__: +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "Python" +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Python%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22goodbye+world%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22hello+there%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22hello+world%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22how+are+you%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.strings +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.word +msgid "pages.LoopingOverNestedLists.steps.list_contains_word_exercise.text" +msgstr "" +"干得好！\n" +"\n" +"接下来，只打印一个布尔值来指示`word`是否存在于整个嵌套列表中的任何字符串中。例如，如果\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"你的程序应该打印`False`。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +msgid "" +"pages.LoopingOverNestedLists.steps.nested_list_loop_python_tutor.requirements" +msgstr "" +"运行一个由上述两个部分组合而成的单一程序。\n" +"它们被分开是为了让你不需要输入`numbers = [...]`部分，\n" +"但输入嵌套循环部分对学习是最好的。\n" +"确保缩进正确。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +msgid "pages.LoopingOverNestedLists.steps.nested_list_loop_python_tutor.text" +msgstr "" +"现在在Python Tutor中再次运行相同的程序。\n" +"\n" +"检查`numbers`的样子，以及`numbers[0]`到`numbers[3]`是什么。\n" +"看看`sublist`和`num`变量是如何推进的。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +msgid "" +"pages.LoopingOverNestedLists.steps.nested_list_nested_loop_example.requirements" +msgstr "" +"运行一个由上述两个部分组合而成的单一程序。\n" +"它们被分开是为了让你不需要输入`numbers = [...]`部分，\n" +"但输入嵌套循环部分对学习是最好的。\n" +"确保缩进正确。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. # __code1__: +#. for sublist in numbers: +#. for num in sublist: +#. print(num) +#. print('---') +#. # __code0__: +#. numbers = [[1, 2, 3], [4, 5], [6], []] +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.num +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.numbers +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.sublist +msgid "" +"pages.LoopingOverNestedLists.steps.nested_list_nested_loop_example.text" +msgstr "" +"你可以使用嵌套循环来遍历嵌套列表的每个元素和子元素。\n" +"例如，考虑这个嵌套列表。\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"点击按钮将列表复制到编辑器中，然后输入以下嵌套循环。\n" +"\n" +"__code1__\n" +"\n" +"仔细查看代码。注意外层循环创建了一个变量`sublist`\n" +"而内层循环遍历同一个变量。这是一个常见的模式。\n" +"现在运行代码。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.string_contains_word_exercise.hints.0.text" +msgstr "你如何检查一个字符串是否包含一个单词？" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.string_contains_word_exercise.hints.1.text" +msgstr "确保检查**字符串**是否包含该单词，而不是子列表。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.string_contains_word_exercise.hints.2.text" +msgstr "你如何访问嵌套列表中每个子列表的每个字符串？" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.string_contains_word_exercise.hints.3.text" +msgstr "你需要使用嵌套循环。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.string_contains_word_exercise.hints.4.text" +msgstr "循环应该遵循页面开头示例的相同模式。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. # __code0__: +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "hello" +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22goodbye+world%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22hello%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22hello+there%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22hello+world%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22how+are+you%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.strings +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.word +msgid "pages.LoopingOverNestedLists.steps.string_contains_word_exercise.text" +msgstr "" +"现在让我们使用这种循环解决一些问题。\n" +"\n" +"假设我们有一个像下面这样的字符串嵌套列表，\n" +"我们想在列表中深处搜索一个特定的`word`。\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"你可以想象`strings`代表一本书，其中每个子列表是一页，每个字符串是该页中的一行。\n" +"它也可以代表一个图书馆，其中每个列表是一本书，每个字符串是一页。\n" +"\n" +"编写一个程序，打印每个包含`word`的字符串。\n" +"它应该适用于任何`word`和`strings`。对于上面的示例，它应该打印\n" +"\n" +" hello there\n" +" hello world\n" +"\n" +"记住，有一种特定的方法来检查一个字符串是否包含另一个字符串。如果你记不起来，谷歌一下吧！" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise.hints.0.text" +msgstr "为每个子列表定义一个布尔值。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise.hints.1.text" +msgstr "遍历一个子列表，相应地更新布尔值。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise.hints.2.text" +msgstr "只为每个子列表打印一次布尔值。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise.hints.3.text" +msgstr "布尔值的初始值应该是什么？" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise.hints.4.text" +msgstr "如果其中一个子列表是空的，你应该为那个子列表打印什么？" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise.hints.5.text" +msgstr "如果你在一个字符串中找到了这个单词，布尔值应该设置为`True`。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise.hints.6.text" +msgstr "如果一个字符串不包含这个单词怎么办？" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise.hints.7.text" +msgstr "没关系！这并不改变其他字符串是否可能包含这个单词。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise.hints.8.text" +msgstr "换句话说，除了在开始时，不要将布尔值设置为`False`。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. # __code0__: +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "goodbye" +#. # __code1__: +#. False +#. True +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22goodbye%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22goodbye+world%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22hello+there%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22hello+world%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22how+are+you%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.strings +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.word +msgid "pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise.text" +msgstr "" +"很好！\n" +"\n" +"现在让我们稍微改变一下练习。这次输出应该告诉我们哪些*sublists*包含`word`，\n" +"而不是哪些内部字符串。特别是，我们想为每个子列表打印一个布尔值：\n" +"`True`如果子列表在其任何字符串中包含该单词，`False`如果根本不在。\n" +"\n" +"给定这些示例输入：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"那么你的程序应该打印\n" +"\n" +"__code1__\n" +"\n" +"注意`word in sublist`是行不通的。例如，`\"hello\" in [\"hello there\", \"how are you\"]`是`False`\n" +"因为`\"hello\"`并不*等于*该列表的两个元素中的任何一个，即使它在其中一个元素中。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_longest_strings_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.zip_longest_strings_exercise.hints.0.text" +msgstr "由于字符串的长度可能不同，这有点棘手。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_longest_strings_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.zip_longest_strings_exercise.hints.1.text" +msgstr "这次你的外层循环应该持续多久？" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_longest_strings_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.zip_longest_strings_exercise.hints.2.text" +msgstr "在处理字符串之前，先找出最长字符串的长度可能是个好主意。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_longest_strings_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.zip_longest_strings_exercise.hints.3.text" +msgstr "其余部分与之前的练习非常相似。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_longest_strings_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.zip_longest_strings_exercise.hints.4.text" +msgstr "唯一的区别是现在你必须确定是从字符串中添加一个字母，还是一个空格。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +msgid "pages.LoopingOverNestedLists.steps.zip_longest_strings_exercise.text" +msgstr "" +"很好！如果你愿意，你现在可以继续到[下一页](#DefiningFunctions)。\n" +"或者你可以做一个额外的挑战！\n" +"\n" +"现在让我们将之前的练习推广到不等长的字符串。再次给你一个字符串列表。\n" +"像之前一样，编写一个程序，打印每个字符串的第一个字母在一行上，\n" +"然后第二个字母在下一行上，依此类推。\n" +"但这次，如果一个字符串没有足够的字母，它应该打印一个空格。\n" +"\n" +"例如，如果\n" +"\n" +" __no_auto_translate__\n" +" strings = [\"abcqwe\", \"def\", \"ghiq\"]\n" +"\n" +"你的程序应该打印\n" +"\n" +" adg\n" +" beh\n" +" cfi\n" +" q q\n" +" w\n" +" e" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_strings_list_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.zip_strings_list_exercise.hints.0.text" +msgstr "这与本页之前的练习不相似。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_strings_list_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.zip_strings_list_exercise.hints.1.text" +msgstr "想想当只有两个字符串时的解决方案。你如何将其推广到字符串列表？" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_strings_list_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.zip_strings_list_exercise.hints.2.text" +msgstr "你需要遍历第一个字母，然后是第二个字母，依此类推。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_strings_list_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.zip_strings_list_exercise.hints.3.text" +msgstr "你必须使用一个循环，但这个循环应该持续多久？" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_strings_list_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.zip_strings_list_exercise.hints.4.text" +msgstr "记住列表中的字符串长度是相等的。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_strings_list_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.zip_strings_list_exercise.hints.5.text" +msgstr "为每个位置（第一个、第二个等）定义一个新字符串。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_strings_list_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.zip_strings_list_exercise.hints.6.text" +msgstr "那个字符串最初应该是什么？" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_strings_list_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.zip_strings_list_exercise.hints.7.text" +msgstr "对于每个位置（第一个、第二个等），你必须遍历列表中的每个字符串。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_strings_list_exercise +msgid "" +"pages.LoopingOverNestedLists.steps.zip_strings_list_exercise.hints.8.text" +msgstr "你需要在你已有的循环内部再加一个循环。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +#. # __code0__: +#. strings = ["abc", "def", "ghi"] +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22abc%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22def%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22ghi%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.strings +msgid "pages.LoopingOverNestedLists.steps.zip_strings_list_exercise.text" +msgstr "" +"很好！\n" +"\n" +"[在课程早些时候](#GettingElementsAtPositionExercises)有一个练习\n" +"打印两个字符串并排垂直显示，如下所示：\n" +"\n" +" H W\n" +" e o\n" +" l r\n" +" l l\n" +" o d\n" +"\n" +"现在我们要将其推广到字符串列表，而不仅仅是两个。\n" +"\n" +"在这个练习中，你将获得一个**相等长度**的字符串列表。\n" +"编写一个程序，打印每个字符串的第一个字母在一行上，\n" +"然后每个字符串的第二个字母在下一行上，依此类推。例如，如果\n" +"\n" +"__code0__\n" +"\n" +"那么你的程序应该打印\n" +"\n" +" __no_auto_translate__\n" +" adg\n" +" beh\n" +" cfi\n" +"\n" +"你的程序应该适用于任何这样的列表。特别是，如果你使用以下列表，\n" +"你将发现来自Python Zen的隐藏信息！\n" +"\n" +" __copyable__\n" +" __no_auto_translate__\n" +" strings = [\" b n\", \"f ete\", \"liths\", \"astat\", \"t ene\", \" r d\"]\n" +"\n" +"注意这次你不应该在输出中添加字母之间的空格。" + +#. https://futurecoder.io/course/#LoopingOverNestedLists +msgid "pages.LoopingOverNestedLists.title" +msgstr "遍历嵌套列表" + +#. https://futurecoder.io/course/#MakingTheBoard +#. # __code2__: +#. def make_board(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board = [] +#. for _ in range(size): +#. board.append(row.copy()) +#. return board +#. def make_cube(size): +#. cube = [] +#. board = make_board(size) +#. for _ in range(size): +#. cube.append(board.copy()) +#. return cube +#. def test(): +#. cube = make_cube(2) +#. print(cube) +#. cube[0][0][0] = 'X' +#. print(cube) +#. print(cube[0] is cube[1]) +#. print(cube[0][0] is cube[0][1]) +#. print(cube[0][0] is cube[1][0]) +#. test() +#. # __code0__: +#. def make_board(size): +#. board = [] +#. for _ in range(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board.append(row) +#. return board +#. # __code1__: +#. board.append(row.copy()) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.board +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.cube +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.make_board +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.make_cube +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.row +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.size +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.test +msgid "pages.MakingTheBoard.steps.final_text.text" +msgstr "" +"做得好！\n" +"\n" +"这个问题可以通过将第一个循环放入第二个循环中来解决，每次都创建一个新的 `row`：\n" +"\n" +"__code0__\n" +"\n" +"另一种方法是每次都复制 `row`，例如保留原始代码但更改一行：\n" +"\n" +"__code1__\n" +"\n" +"你也可以用 `row[:]` 或 `list(row)` 来复制 `row`。但重要的是要知道\n" +"所有这些方法都会对列表进行*浅拷贝*。\n" +"这意味着它们只复制列表的顶层，而不复制每个元素。\n" +"在这种情况下，`row` 只包含无法修改的字符串，\n" +"所以不需要复制。但如果元素是可变对象，比如列表，\n" +"就像 `board` 的情况，你可能会再次遇到同样的问题。\n" +"这里有一个例子：\n" +"\n" +" __copyable__\n" +"__code2__\n" +"\n" +"这里 `cube` 的每个元素都是一个单独的列表，是 `board` 的副本。\n" +"在每个副本中，每个元素也是一个单独的列表，是 `row` 的副本。\n" +"但是 `board` 的浅拷贝都具有相同的第一个元素（第一个 `row` 的副本），\n" +"相同的第二个元素，依此类推。\n" +"改变 `make_board` 不会解决任何问题，解决方案是：\n" +"\n" +"- 每次调用 `make_board` 来创建一个新的 `board`，或者\n" +"- 使用 `deepcopy` 函数，而不是 `board.copy()`。\n" +"`deepcopy` 会在每个嵌套对象的每个层级进行拷贝。\n" +"\n" +"如果你仍然感到困惑，不用担心。\n" +"这只是让你为将来处理代码行为异常做好准备。\n" +"你现在不需要理解这一点，这节课仍然会很有价值。\n" +"\n" +"无论如何，我们准备好制作完整的游戏了。你可以做到的！" + +#. https://futurecoder.io/course/#MakingTheBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.fix_make_board +msgid "pages.MakingTheBoard.steps.fix_make_board.hints.0.text" +msgstr "现有的代码几乎是正确的。" + +#. https://futurecoder.io/course/#MakingTheBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.fix_make_board +msgid "pages.MakingTheBoard.steps.fix_make_board.hints.1.text" +msgstr "有几种方法可以解决这个问题。" + +#. https://futurecoder.io/course/#MakingTheBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.fix_make_board +msgid "pages.MakingTheBoard.steps.fix_make_board.hints.2.text" +msgstr "一些解决方案涉及添加一些小东西。" + +#. https://futurecoder.io/course/#MakingTheBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.fix_make_board +msgid "pages.MakingTheBoard.steps.fix_make_board.hints.3.text" +msgstr "你也可以在不添加或删除任何东西（除了空格）的情况下重新排列代码。" + +#. https://futurecoder.io/course/#MakingTheBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.fix_make_board +msgid "pages.MakingTheBoard.steps.fix_make_board.hints.4.text" +msgstr "问题在于一个单独的列表 `row` 被多次使用。" + +#. https://futurecoder.io/course/#MakingTheBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.fix_make_board +msgid "pages.MakingTheBoard.steps.fix_make_board.hints.5.text" +msgstr "所以一个解决方案是制作 `row` 的副本，这样它们都是独立的。" + +#. https://futurecoder.io/course/#MakingTheBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.fix_make_board +msgid "pages.MakingTheBoard.steps.fix_make_board.hints.6.text" +msgstr "另一个解决方案是每次从头开始创建一个新的 `row`。" + +#. https://futurecoder.io/course/#MakingTheBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.fix_make_board +msgid "pages.MakingTheBoard.steps.fix_make_board.hints.7.text" +msgstr "在 Python 中，有几种方法可以用一点代码复制列表。" + +#. https://futurecoder.io/course/#MakingTheBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.fix_make_board +msgid "pages.MakingTheBoard.steps.fix_make_board.hints.8.text" +msgstr "每次创建一个新的行可以通过简单地重新排列代码来完成。" + +#. https://futurecoder.io/course/#MakingTheBoard +msgid "" +"pages.MakingTheBoard.steps.fix_make_board.special_messages.not_separate.text" +msgstr "然而，结果中的子列表并不是所有独立的对象。" + +#. https://futurecoder.io/course/#MakingTheBoard +#. # __code0__: +#. board[0][0] = 'X' +#. board[1][0] = 'X' +#. board[2][0] = 'X' +#. # __code4__: +#. board[1][0] = 'X' +#. board[2][0] = 'X' +#. # __code1__: +#. board = [row, row, row] +#. # __code2__: +#. board[0][0] = 'X' +#. # __code3__: +#. row[0] = 'X' +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.board +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.row +msgid "pages.MakingTheBoard.steps.fix_make_board.text" +msgstr "" +"你能看出发生了什么吗？\n" +"\n" +"每一行的第一个位置都得到了一个 `'X'`！\n" +"就好像代码实际上是这样做的：\n" +"\n" +"__code0__\n" +"\n" +"尝试自己找出问题所在。\n" +"但再说一次，这很棘手，所以不要让自己太烦恼。\n" +"\n" +"如果你想，这里有一些提示：\n" +"\n" +" - 尝试通过一些调试工具运行代码。\n" +" - 进行实验。对代码进行更改，看看会发生什么。\n" +" - 不，代码没有像我上面建议的那样进行 3 次赋值。只有一次列表赋值。\n" +" - 没有隐藏的循环或其他东西。\n" +" - `board` 包含多少个列表？3个？\n" +" - 前一页有一个微妙的提示，说明发生了什么。\n" +" - 有一页来自之前的章节，直接解释了这种问题。\n" +" - 具体来说是[这一页](#EqualsVsIs)。\n" +" - 尝试用 Python Tutor 运行代码。\n" +"\n" +"好的，如果你准备好了，这里是答案。\n" +"\n" +"列表 `row` 只创建了一次，并被多次重用。\n" +"`board` 包含相同的列表三次。不是副本，只是在三个地方的一个列表。\n" +"就像它这样做：\n" +"\n" +"__code1__\n" +"\n" +"这意味着这段代码：\n" +"\n" +"__code2__\n" +"\n" +"等同于：\n" +"\n" +"__code3__\n" +"\n" +"这影响了 `board` 中的“所有列表”，因为它们都是同一个列表 `row`。\n" +"换句话说，上面的行*也*等同于这两行中的每一行：\n" +"\n" +"__code4__\n" +"\n" +"因为 `row` 同时是 `board[0]`、`board[1]` 和 `board[2]`。\n" +"\n" +"你现在的任务是修复 `make_board`，使其没有这个问题。\n" +"它仍然应该返回一个长度为 `size` 的列表，其中每个\n" +"元素也是一个长度为 `size` 的列表，每个元素都是字符串 `' '`。\n" +"子列表应该都是独立的列表对象，而不是同一个\n" +"列表的重复。" + +#. https://futurecoder.io/course/#MakingTheBoard +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.MakingTheBoard.steps.naive_make_board.text" +msgstr "" +"到目前为止，棋盘已经作为嵌套列表提供给你。\n" +"但对于完整的程序，你需要自己创建它。\n" +"应该很简单，对吧？这里有一些代码可以做到这一点：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"这很接近，但它有一个微妙的问题。\n" +"确保你理解代码，\n" +"如果你能找到这个错误，额外加分！\n" +"如果没有，不要感到沮丧，也不要浪费太多时间。" + +#. https://futurecoder.io/course/#MakingTheBoard +msgid "pages.MakingTheBoard.title" +msgstr "制作棋盘" + +#. https://futurecoder.io/course/#ModifyingWhileIterating +msgid "pages.ModifyingWhileIterating.steps.final_text.text" +msgstr "" +"重申一下，***在迭代时绝不要修改任何东西***。你的选择有：\n" +"\n" +"- 修改一个副本\n" +"- 在副本上迭代\n" +"- 不修改任何东西，而是创建一个新版本。" + +#. https://futurecoder.io/course/#ModifyingWhileIterating +#. # __code1__: +#. for number in numbers.copy(): +#. # __code0__: +#. for number in numbers: +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.number +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.numbers +msgid "pages.ModifyingWhileIterating.steps.make_copy.requirements" +msgstr "" +"运行与上面相同的程序，但更改第二行：\n" +"\n" +"__code0__\n" +"\n" +"改为：\n" +"\n" +"__code1__\n" +"\n" +"也就是说，在 `numbers` 后面加上 `.copy()`，但在 `:` 之前。" + +#. https://futurecoder.io/course/#ModifyingWhileIterating +#. # __code0__: +#. for number in numbers.copy(): +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.number +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.numbers +msgid "pages.ModifyingWhileIterating.steps.make_copy.text" +msgstr "" +"但事实证明，这几乎做了同样的事情 - 它没有出错，但仍然没有删除 7 或 3。\n" +"这发生的原因是 - 迭代列表时，底层仍然会遍历索引。\n" +"\n" +"这里的教训是***在迭代时绝不要修改任何东西***。保持变更和循环分开。\n" +"\n" +"好消息是，有很多方法可以解决这个问题。你可以选择在副本上循环，如下所示：\n" +"\n" +"__code0__" + +#. https://futurecoder.io/course/#ModifyingWhileIterating +msgid "pages.ModifyingWhileIterating.steps.make_copy2.text" +msgstr "" +"现在，被修改的列表和被迭代的列表是独立的对象，即使它们最开始的内容相同。\n" +"\n" +"同样，你可以在原始列表上循环并修改一个副本：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#ModifyingWhileIterating +msgid "pages.ModifyingWhileIterating.steps.make_new_list.text" +msgstr "" +"或者你可以从头开始构建一个新列表。在这种情况下，我们在一个练习中已经做过类似的事情：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#ModifyingWhileIterating +msgid "pages.ModifyingWhileIterating.steps.remove_instead_of_pop.text" +msgstr "" +"当它运行时，它显然连 7 或 3 都没有查看就跳过了，并且在最后尝试访问一个过高的索引时失败。你能看出这是为什么吗？\n" +"\n" +"索引变量 `i` 按照正常的值 0, 1, 2, ... 运行，但随着列表的变化，这些不再是我们想要的位置。例如，在第一次迭代中 `i` 是 0，`number` 是 10，这个数字被移除了。这使得其余的数字向左移动一个位置，所以现在 7 在位置 0。但在下一次迭代中 `i` 是 1，而 `numbers[i]` 是 8。7 被跳过了。\n" +"\n" +"我们可以尝试编写程序使用 `remove` 而不是 `pop`，这样我们就不必使用索引。这种方式看起来甚至更好。\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#ModifyingWhileIterating +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.ModifyingWhileIterating.steps.run_broken_with_python_tutor.text" +msgstr "" +"考虑这个程序。它循环遍历一个数字列表，并移除小于 10 的数字。或者至少，它是这样尝试的。\n" +"用 Python Tutor 运行它。\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"(记住 `numbers.pop(i)` 会从 `numbers` 中移除索引为 `i` 的元素)" + +#. https://futurecoder.io/course/#ModifyingWhileIterating +msgid "pages.ModifyingWhileIterating.title" +msgstr "在迭代时修改" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.average_exercise +msgid "pages.MoreListFunctionsAndMethods.steps.average_exercise.hints.0.text" +msgstr "" +"你的解决方案应该有正好三条语句：`x = [15, 12, -6, 3]`，`y = `后面跟着从列表中精确复制的一行，以及`print(y)`。" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.average_exercise +msgid "pages.MoreListFunctionsAndMethods.steps.average_exercise.hints.1.text" +msgstr "如果你不确定，可以查一下如何计算平均值/均值。" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.average_exercise +msgid "pages.MoreListFunctionsAndMethods.steps.average_exercise.hints.2.text" +msgstr "要计算`x`中数字的平均值，我们需要两个东西。" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.average_exercise +msgid "pages.MoreListFunctionsAndMethods.steps.average_exercise.hints.3.text" +msgstr "哪两个函数/方法能给你这两个东西？" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.average_exercise +msgid "pages.MoreListFunctionsAndMethods.steps.average_exercise.hints.4.text" +msgstr "你如何将这两个东西结合起来计算平均值？" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +msgid "pages.MoreListFunctionsAndMethods.steps.average_exercise.requirements" +msgstr "" +"复制上面的三行，然后用上面长列表中的一行精确替换`(insert_one_line_from_above)`。中间的行仍然应该以`y = `开头。" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. # __code0__: +#. x = [15, 12, -6, 3] +#. y = (insert_one_line_from_above) +#. print(y) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.insert_one_line_from_above +msgid "pages.MoreListFunctionsAndMethods.steps.average_exercise.text" +msgstr "" +"干得好！在下一个练习中，从这个不完整的程序开始：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"将`y = `后面的部分替换为上面列表中的一行。\n" +"最终程序应该打印出`x`中数字的平均值（严格来说是*均值*）。" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.count_in_sorted_sum +msgid "" +"pages.MoreListFunctionsAndMethods.steps.count_in_sorted_sum.hints.0.text" +msgstr "" +"你的解决方案应该有正好三条语句：`x = ['a', 'b', 'c']`，`y = `后面跟着从列表中精确复制的一行，以及`print(y)`。" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.count_in_sorted_sum +msgid "" +"pages.MoreListFunctionsAndMethods.steps.count_in_sorted_sum.hints.1.text" +msgstr "什么时候`1 in x`为真？" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.count_in_sorted_sum +msgid "" +"pages.MoreListFunctionsAndMethods.steps.count_in_sorted_sum.hints.2.text" +msgstr "当`1`在`x`中时！" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.count_in_sorted_sum +msgid "" +"pages.MoreListFunctionsAndMethods.steps.count_in_sorted_sum.hints.3.text" +msgstr "`1`可能在`x`中出现一次、两次或三次..." + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.count_in_sorted_sum +msgid "" +"pages.MoreListFunctionsAndMethods.steps.count_in_sorted_sum.hints.4.text" +msgstr "...但不能出现零次！" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +msgid "" +"pages.MoreListFunctionsAndMethods.steps.count_in_sorted_sum.requirements" +msgstr "" +"复制上面的三行，然后用上面长列表中的一行精确替换`1 in x`。中间的行仍然应该以`y = `开头。你选择的行应该与`1 in " +"x`有相同的效果，以便程序打印出`True`。" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. # __code0__: +#. sum(len(x)) +#. sum(range(x)) +#. sum(range(len(x))) +#. sum(len(range(x))) +#. sum(range(x)) + 1 +#. sum(range(x + 1)) +#. sum(x) / len(x) +#. sum(x) / range(x) +#. sum(x) / range(len(x)) +#. sum(x) / len(range(x)) +#. sorted(x)[1] +#. sorted(x)[2] +#. sorted(x)[-1] +#. sorted(x)[-2] +#. x.count(1) >= 0 +#. x.count(1) > 0 +#. x.count(1) > 1 +#. # __code1__: +#. x = [1, 2, 0, 3] +#. y = 1 in x +#. print(y) +msgid "pages.MoreListFunctionsAndMethods.steps.count_in_sorted_sum.text" +msgstr "" +"你可能会认出其中一些来自你的练习。我向你保证，那些练习并不是毫无意义的，\n" +"因为你现在已经学到了有价值的基本技能。例如，你可以使用`in`来检查列表中是否包含5，\n" +"但没有类似简单的方法来检查一个大于5的数字。\n" +"\n" +"现在你将解决另一组涉及这些新概念的四个练习。\n" +"同样，正确和错误的代码行混合在一起，\n" +"你必须从列表中选择正确的行。\n" +"\n" +"__code0__\n" +"\n" +"这是一个程序：\n" +"\n" +" __copyable__\n" +"__code1__\n" +"\n" +"将`1 in x`的部分替换为上面列表中的一行（保留`y = `），以完成相同的功能。" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. # __code0__: +#. some_list.count(value) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.some_list +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.value +msgid "pages.MoreListFunctionsAndMethods.steps.count_predict_exercise.text" +msgstr "" +"**`count`**：使用以下语法返回参数在列表中出现的次数\n" +"\n" +"__code0__\n" +"\n" +"例如在终端中运行这一行：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +msgid "pages.MoreListFunctionsAndMethods.steps.final_text.text" +msgstr "恭喜你！你现在已经掌握了列表方法和函数！" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. # __code0__: +#. value in some_list +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.some_list +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.value +msgid "pages.MoreListFunctionsAndMethods.steps.in_predict_exercise.text" +msgstr "" +"**`in`**：一个比较运算符，用于检查一个值是否在列表中，使用以下语法\n" +"\n" +"__code0__\n" +"\n" +"例如运行这个程序：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.second_smallest_in_list_exercise +msgid "" +"pages.MoreListFunctionsAndMethods.steps.second_smallest_in_list_exercise.hints.0.text" +msgstr "" +"你的解决方案应该有正好三条语句：`x = [12, -6, 2, -1, 3]`，`y = `后面跟着从列表中精确复制的一行，以及`print(y)`。" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.second_smallest_in_list_exercise +msgid "" +"pages.MoreListFunctionsAndMethods.steps.second_smallest_in_list_exercise.hints.1.text" +msgstr "`x`中的数字似乎都是乱的。你能做点什么吗？" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.second_smallest_in_list_exercise +msgid "" +"pages.MoreListFunctionsAndMethods.steps.second_smallest_in_list_exercise.hints.2.text" +msgstr "如果你搞定了那部分，试着在终端中使用那个函数来玩玩。" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.second_smallest_in_list_exercise +msgid "" +"pages.MoreListFunctionsAndMethods.steps.second_smallest_in_list_exercise.hints.3.text" +msgstr "你如何使用那个函数来获取列表中的最小值？那最大的呢？" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.second_smallest_in_list_exercise +msgid "" +"pages.MoreListFunctionsAndMethods.steps.second_smallest_in_list_exercise.hints.4.text" +msgstr "在那之后，你如何获取*第二*小的值？" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +msgid "" +"pages.MoreListFunctionsAndMethods.steps.second_smallest_in_list_exercise.requirements" +msgstr "" +"复制上面的三行，然后用上面长列表中的一行精确替换`(insert_one_line_from_above)`。中间的行仍然应该以`y = `开头。" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. # __code0__: +#. x = [12, -6, 2, -1, 3] +#. y = (insert_one_line_from_above) +#. print(y) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.insert_one_line_from_above +msgid "" +"pages.MoreListFunctionsAndMethods.steps.second_smallest_in_list_exercise.text" +msgstr "" +"很好。最后一个：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"将`y = `后面的部分替换为上面列表中的一行。\n" +"最终程序应该打印出`x`中的*第二小的值*。" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. # __code0__: +#. sorted(some_list) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.some_list +msgid "pages.MoreListFunctionsAndMethods.steps.sorted_predict_exercise.text" +msgstr "" +"这里有一些更有用的函数/方法。\n" +"\n" +"**`sorted`**：接受一个可迭代对象，并返回一个从小到大的元素列表，使用以下语法\n" +"\n" +"__code0__\n" +"\n" +"例如在终端中运行这一行：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. # __code0__: +#. sum(some_list) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.some_list +msgid "pages.MoreListFunctionsAndMethods.steps.sum_predict_exercise.text" +msgstr "" +"**`sum`**：使用以下语法将一个可迭代的数字相加\n" +"\n" +"__code0__\n" +"\n" +"例如在终端中运行这一行：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.sum_range_exercise +msgid "" +"pages.MoreListFunctionsAndMethods.steps.sum_range_exercise.hints.0.text" +msgstr "你的解决方案应该有正好三条语句：`x = 100`，`y = `后面跟着从列表中精确复制的一行，以及`print(y)`。" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.sum_range_exercise +msgid "" +"pages.MoreListFunctionsAndMethods.steps.sum_range_exercise.hints.1.text" +msgstr "什么函数/方法可以用来加总？" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.sum_range_exercise +msgid "" +"pages.MoreListFunctionsAndMethods.steps.sum_range_exercise.hints.2.text" +msgstr "哪个函数/方法给我们数字`1, 2, 3, ..., x`？" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.sum_range_exercise +msgid "" +"pages.MoreListFunctionsAndMethods.steps.sum_range_exercise.hints.3.text" +msgstr "你必须做一个小调整，否则最后一个数字`x`将被遗漏。" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +msgid "" +"pages.MoreListFunctionsAndMethods.steps.sum_range_exercise.requirements" +msgstr "" +"复制上面的三行，然后用上面长列表中的一行精确替换`(insert_one_line_from_above)`。中间的行仍然应该以`y = `开头。" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +#. # __code0__: +#. x = 100 +#. y = (insert_one_line_from_above) +#. print(y) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.insert_one_line_from_above +msgid "pages.MoreListFunctionsAndMethods.steps.sum_range_exercise.text" +msgstr "" +"干得好！在下一个练习中，从这个不完整的程序开始：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"将`y = `后面的部分替换为上面列表中的一行。\n" +"最终程序应该打印出从`1`到`x`（包括`x`）的所有数字的和，即`1 + 2 + 3 + ... + x`。" + +#. https://futurecoder.io/course/#MoreListFunctionsAndMethods +msgid "pages.MoreListFunctionsAndMethods.title" +msgstr "更多列表函数和方法" + +#. https://futurecoder.io/course/#MoreOnReturn +msgid "pages.MoreOnReturn.steps.break_vs_return.requirements" +msgstr "运行与上一步相同的代码，但将函数的最后一行（`return letter`）替换为仅 `break`。" + +#. https://futurecoder.io/course/#MoreOnReturn +msgid "pages.MoreOnReturn.steps.break_vs_return.text" +msgstr "" +"和之前一样，`return` ***会停止整个函数***，包括所有循环。\n" +"\n" +"之前我们展示了 [如何用 `break` 停止一个循环](#UsingBreak)。\n" +"将 `return letter` 改为 `break`，看看有什么不同。" + +#. https://futurecoder.io/course/#MoreOnReturn +#. # __code0__: +#. if condition: +#. return value1 +#. else: +#. return value2 +#. # __code1__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.condition +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.value1 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.value2 +msgid "pages.MoreOnReturn.steps.cannot_return_multiple_values.text" +msgstr "" +"一旦执行了 `return` 语句，函数将停止，后面的代码将被忽略。\n" +"这意味着在同一个代码块中，`return` 后面的任何代码都是 *不可达* 的：\n" +"`return 2` 无论我们运行这个函数多少次都 *永远* 不会被到达！\n" +"\n" +"***每次函数调用只能执行一个 `return`，然后执行停止。***\n" +"\n" +"多个 `return` 语句在适当使用时仍然很有用，例如在 `if-else` 块中：\n" +"\n" +"__code0__\n" +"\n" +"一个常见的错误是误解 `return` 在 `for` 循环中的作用。试试以下代码：\n" +"\n" +" __copyable__\n" +"__code1__" + +#. https://futurecoder.io/course/#MoreOnReturn +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.MoreOnReturn.steps.double_return_in_one_function.text" +msgstr "" +"有时 `return` 对新学习者来说可能是混淆和错误的来源。\n" +"让我们更多地了解它是如何工作的。\n" +"\n" +"运行这段代码：\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#MoreOnReturn +msgid "pages.MoreOnReturn.steps.final_text.text" +msgstr "" +"与 `return` 不同，`break` 只会停止它所使用的最内层循环，在这个例子中是 `for number in range(3):`。\n" +"以下是确切发生的事情：\n" +"\n" +"- 对于 `letter = b`，`print(f\"{letter} {number}\")` 这一行只在 `number = 0` 时执行，\n" +"- 然后内层循环被 `break` 停止，但\n" +"- 外层循环继续执行，转到下一个字母 `c`\n" +"- 这个字母会完全执行，因为它没有触发 `break` 语句。" + +#. https://futurecoder.io/course/#MoreOnReturn +#. # __code0__: +#. def double_numbers(numbers): +#. doubles = [] +#. for x in numbers: +#. doubles.append(x * 2) +#. return doubles +#. assert_equal(double_numbers([1, 2, 3]), [2, 4, 6]) +#. # __code1__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.double_numbers +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.doubles +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.numbers +msgid "pages.MoreOnReturn.steps.return_ends_whole_function.text" +msgstr "" +"起初，在 `for` 循环中对每次迭代 `return` 一个值看起来很直观。\n" +"但并不是这样工作的！\n" +"如果你用 `snoop` 或 Python tutor 检查代码，你会看到函数在第一次\n" +"循环迭代中返回 2，然后立即结束。\n" +"\n" +"即使只有一个 `return` 语句，它也只会执行一次并返回一个值。\n" +"如果你想返回多个值，可以返回一个列表：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"如果有嵌套循环会发生什么？试试以下函数：\n" +"\n" +" __copyable__\n" +"__code1__" + +#. https://futurecoder.io/course/#MoreOnReturn +msgid "pages.MoreOnReturn.title" +msgstr "`return` 结束函数调用" + +#. https://futurecoder.io/course/#MultiLineExpressions +msgid "pages.MultiLineExpressions.steps.final_text.text" +msgstr "所以如果你遇到神秘的 `SyntaxError`，请确保你没有错误地拆分任何行！" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MultiLineExpressions.steps.invalid_multiline +msgid "pages.MultiLineExpressions.steps.invalid_multiline.program" +msgstr "" +"is_friend = name == \"Alice\" or\n" +" name == \"Bob\"" + +#. https://futurecoder.io/course/#MultiLineExpressions +msgid "pages.MultiLineExpressions.steps.invalid_multiline.text" +msgstr "" +"我们的代码行开始变得相当长了。\n" +"幸运的是，Python提供了几种方法来将一个语句分散到多行中，\n" +"但这不是自动的。你必须确保Python明白你正在做什么。\n" +"例如，这段代码是无效的语法，会给你一个错误：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#MultiLineExpressions +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.MultiLineExpressions.steps.valid_multiline.text" +msgstr "" +"Python试图将这解释为两行独立的代码，并感到困惑。你需要告诉它\n" +"第一行是继续到第二行的。\n" +"\n" +"一种方法是在行末添加 `\\` 来“转义”换行符。\n" +"\n" +"另一种方法是确保换行符包含在某种括号内。这样，行\n" +"的延续是隐含的，因为Python会等到所有括号都关闭后，\n" +"才会认为一行是完整的。如果你已经有括号了，比如你在调用一个函数\n" +"或者创建一个列表，你可能不需要做任何事情！否则，你可以在任何表达式中添加括号\n" +"来暗示行的延续。\n" +"\n" +"这里有一些例子。请仔细注意细节。\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#MultiLineExpressions +msgid "pages.MultiLineExpressions.title" +msgstr "多行语句" + +#. https://futurecoder.io/course/#NavigatingShellHistory +msgid "pages.NavigatingShellHistory.steps.final_text.text" +msgstr "" +"这里有个小提示：你经常会想要重新运行之前输入的代码，或者稍微修改过的版本。你可以复制和粘贴，但这很繁琐，会妨碍你进行实验。一个更好的方法是按下键盘上的上箭头键。这会将之前的代码行插入到命令行中。继续按它可以向更早的历史记录回溯，如果你回溯得太远，可以按下箭头键向前移动。现在试试看吧。" + +#. https://futurecoder.io/course/#NavigatingShellHistory +msgid "pages.NavigatingShellHistory.title" +msgstr "浏览命令行历史" + +#. https://futurecoder.io/course/#NestedListAssignment +msgid "pages.NestedListAssignment.steps.final_text.text" +msgstr "太棒了！你快要把所有内容整合在一起了，继续加油！" + +#. https://futurecoder.io/course/#NestedListAssignment +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.NestedListAssignment.steps.modify_list_in_function.text" +msgstr "" +"我们已经看到如何从用户那里获取输入，现在让我们用这些输入来实际在棋盘上放置棋子\n" +"并进行游戏。首先，试试这段代码：\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#NestedListAssignment +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input +msgid "pages.NestedListAssignment.steps.nested_assignment_input.hints.0.text" +msgstr "你的函数需要调用 `input()` 两次。输入不会作为参数传递给 `play_move`。" + +#. https://futurecoder.io/course/#NestedListAssignment +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input +msgid "pages.NestedListAssignment.steps.nested_assignment_input.hints.1.text" +msgstr "`input()` 总是返回一个字符串。" + +#. https://futurecoder.io/course/#NestedListAssignment +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input +msgid "pages.NestedListAssignment.steps.nested_assignment_input.hints.10.text" +msgstr "一旦你得到了两个数字，你需要用它们来修改嵌套列表 `board`。" + +#. https://futurecoder.io/course/#NestedListAssignment +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input +msgid "pages.NestedListAssignment.steps.nested_assignment_input.hints.11.text" +msgstr "这段代码在上面已经给你展示过了。" + +#. https://futurecoder.io/course/#NestedListAssignment +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input +msgid "pages.NestedListAssignment.steps.nested_assignment_input.hints.12.text" +msgstr "你只需要使用用户输入的数字，而不是硬编码的 1 和 0。" + +#. https://futurecoder.io/course/#NestedListAssignment +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input +msgid "pages.NestedListAssignment.steps.nested_assignment_input.hints.13.text" +msgstr "你可以在一行中使用嵌套下标，或者分两步来完成。" + +#. https://futurecoder.io/course/#NestedListAssignment +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input +msgid "pages.NestedListAssignment.steps.nested_assignment_input.hints.2.text" +msgstr "看起来像数字的字符串仍然是字符串，而不是数字。" + +#. https://futurecoder.io/course/#NestedListAssignment +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input +msgid "pages.NestedListAssignment.steps.nested_assignment_input.hints.3.text" +msgstr "列表索引必须是数字，而不是字符串。" + +#. https://futurecoder.io/course/#NestedListAssignment +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input +msgid "pages.NestedListAssignment.steps.nested_assignment_input.hints.4.text" +msgstr "如果棋盘是 3x3，用户可能会为每个坐标输入 1、2 或 3。" + +#. https://futurecoder.io/course/#NestedListAssignment +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input +msgid "pages.NestedListAssignment.steps.nested_assignment_input.hints.5.text" +msgstr "长度为 3 的列表的有效索引是什么？" + +#. https://futurecoder.io/course/#NestedListAssignment +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input +msgid "pages.NestedListAssignment.steps.nested_assignment_input.hints.6.text" +msgstr "你需要将输入的 1、2 或 3 转换为 0、1 或 2。" + +#. https://futurecoder.io/course/#NestedListAssignment +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input +msgid "pages.NestedListAssignment.steps.nested_assignment_input.hints.7.text" +msgstr "你还需要能够处理更大的棋盘，比如 9x9 或更大。" + +#. https://futurecoder.io/course/#NestedListAssignment +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input +msgid "pages.NestedListAssignment.steps.nested_assignment_input.hints.8.text" +msgstr "你不能用字符串进行数学运算，只能用数字。" + +#. https://futurecoder.io/course/#NestedListAssignment +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input +msgid "pages.NestedListAssignment.steps.nested_assignment_input.hints.9.text" +msgstr "你如何将字符串转换为数字？" + +#. https://futurecoder.io/course/#NestedListAssignment +msgid "pages.NestedListAssignment.steps.nested_assignment_input.requirements" +msgstr "你的函数应该修改 `board` 参数。它不需要 `return` 或 `print` 任何内容。" + +#. https://futurecoder.io/course/#NestedListAssignment +#. # __code3__: +#. def format_board(board): +#. first_row = ' ' +#. for i in range(len(board)): +#. first_row += str(i + 1) +#. joined_rows = [first_row] +#. for i in range(len(board)): +#. joined_row = str(i + 1) + ''.join(board[i]) +#. joined_rows.append(joined_row) +#. return "\n".join(joined_rows) +#. def play_game(): +#. board = [ +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ] +#. print(format_board(board)) +#. print('\nX to play:\n') +#. play_move(board, 'X') +#. print(format_board(board)) +#. print('\nO to play:\n') +#. play_move(board, 'O') +#. print(format_board(board)) +#. def play_move(board, player): +#. ... +#. play_game() +#. # __code0__: +#. row = board[1] +#. row[0] = player +#. # __code1__: +#. board[1][0] = player +#. # __code2__: +#. 2 +#. 1 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22%5Cn%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27%5CnO+to+play%3A%5Cn%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27%5CnX+to+play%3A%5Cn%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.board +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.first_row +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.format_board +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.joined_row +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.joined_rows +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.play_game +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.play_move +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.player +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.row +msgid "pages.NestedListAssignment.steps.nested_assignment_input.text" +msgstr "" +"这两行：\n" +"\n" +"__code0__\n" +"\n" +"可以合并成一行：\n" +"\n" +"__code1__\n" +"\n" +"这两段代码几乎完全等价。Python 首先计算\n" +"`board[1]` 来 *获取* 内部列表，而 `[0] = ...` 则设置 `board[1]` 的一个元素。\n" +"你可以在 `birdseye` 中看到 `board[1]` 的值，因为它是一个表达式，\n" +"你实际上可以用任何其他表达式替换它。\n" +"\n" +"现在你知道如何在嵌套列表中设置元素，是时候让这个游戏互动起来了！\n" +"写你自己的 `play_move` 版本，从用户那里获取输入\n" +"来确定在哪里下棋，而不是总是下在 `board[1][0]`。\n" +"它应该调用 `input()` 两次，这样用户可以分别输入行和列\n" +"作为两个单独的数字。此外，我们的用户不是程序员，所以他们从 1 开始计数，\n" +"而不是从 0 开始。\n" +"\n" +"例如，如果用户输入这些内容：\n" +"\n" +"__code2__\n" +"\n" +"这意味着他们想在第二行和第一列下棋，这与我们的原始示例相同。\n" +"\n" +"这里有一些起始代码：\n" +"\n" +" __copyable__\n" +"__code3__\n" +"\n" +"这会调用 `play_move` 两次，因此用户需要输入两对数字。\n" +"以下是一个“游戏”应该是什么样子的示例：\n" +"\n" +" 123\n" +" 1\n" +" 2\n" +" 3\n" +"\n" +" X 下棋：\n" +"\n" +"__code2__\n" +" 123\n" +" 1\n" +" 2X\n" +" 3\n" +"\n" +" O 下棋：\n" +"\n" +" 1\n" +" 3\n" +" 123\n" +" 1 O\n" +" 2X\n" +" 3\n" +"\n" +"你不需要完全使用提供的代码，它只是让你感受一下发生了什么。\n" +"重要的是你的 `play_move` 函数正确地修改 `board` 参数。\n" +"它不需要返回或打印任何内容，这不会被检查。\n" +"\n" +"你可以假设用户总是会输入有效的数字。稍后我们将学习如何处理\n" +"无效输入，比如超出范围的数字或根本不是数字的输入。" + +#. https://futurecoder.io/course/#NestedListAssignment +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.NestedListAssignment.steps.nested_assignment_two_lines.text" +msgstr "" +"注意调用 `play_move(game_board, 'X')` 实际上是 *直接修改* `game_board`。\n" +"在调用 `play_move` 时的变量 `board` 和\n" +"在调用 `play_game` 时的变量 `game_board` 指向同一个列表对象。\n" +"没有复制。Python Tutor 很擅长用箭头来显示这一点。\n" +"\n" +"这也意味着在这种情况下 `play_move` 不需要返回任何内容，\n" +"它可以直接修改 `board`，而调用者（在这种情况下是 `play_game`）将看到效果。\n" +"\n" +"然而，我们的棋盘是二维的，由嵌套列表表示。\n" +"所以我们需要将 `player` 分配给内部列表的一个元素，类似于这样：\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#NestedListAssignment +msgid "pages.NestedListAssignment.title" +msgstr "嵌套列表作业：在棋盘上进行移动" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +msgid "" +"pages.NewlinesAndFormatBoard.steps.discovering_newline.special_messages.bad_string.text" +msgstr "哎呀，`string` 的值不正确。请再次运行上一步的程序。" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +msgid "pages.NewlinesAndFormatBoard.steps.discovering_newline.text" +msgstr "" +"太棒了！*三重引号字符串*可以跨越多行，并且它们会在输出中显示。\n" +"\n" +"和单引号、双引号一样，三重引号只是另一种表示法，并不是一种新的字符串类型。\n" +"`\"\"\"abc\"\"\"` 和 `\"abc\"` 是一样的。\n" +"\n" +"不过 `string` 确实包含了一些新内容。请在终端中运行 `__program__` 来查看。" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +msgid "pages.NewlinesAndFormatBoard.steps.final_text.text" +msgstr "" +"干得好！这真是一个挑战。\n" +"\n" +"现在你已经掌握了如何构建多行文本的字符串，并解决了向玩家显示棋盘的问题。\n" +"\n" +"接下来你将学习更多关于 Python 中的数据类型，以及如何转换它们，如何从玩家那里获取输入。\n" +"你已经完成了项目的一半。继续加油！" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge +msgid "" +"pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.hints.0.text" +msgstr "有两种类型的行需要显示：一种类型是用 `|` 连接的棋子，另一种类型是用 `-` 连接的 `+`。" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge +msgid "" +"pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.hints.1.text" +msgstr "这两种类型的行都可以通过适当地使用 `join` 来构建。" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge +msgid "" +"pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.hints.10.text" +msgstr "然后对该列表应用 `join`，用 `+-` 行作为分隔符。" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge +msgid "" +"pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.hints.11.text" +msgstr "为了正确地将换行符添加到 `+-` 行，请查看我们提供的测试用例。" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge +msgid "" +"pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.hints.2.text" +msgstr "例如，你如何使用 `join` 将一行 `['X', 'O', 'X']` 转换为 `'X|O|X'`？" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge +msgid "" +"pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.hints.3.text" +msgstr "同样，你如何使用 `join` 获得 `'-+-+-'`？你应该对哪个列表应用 `join`？" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge +msgid "" +"pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.hints.4.text" +msgstr "一旦你弄清楚了如何构建这两种类型的行，你如何将它们组合在一起以获得最终结果？" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge +msgid "" +"pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.hints.5.text" +msgstr "注意，带有 `+-` 符号的行总是相同的。" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge +msgid "" +"pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.hints.6.text" +msgstr "而且每对相邻的棋子行之间都有一行 `+-` 分隔。" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge +msgid "" +"pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.hints.7.text" +msgstr "你可以直接对行本身使用 `join`！" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge +msgid "" +"pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.hints.8.text" +msgstr "带有棋子的行可以用 `+-` 行连接在一起（在适当的位置添加换行符）。" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge +msgid "" +"pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.hints.9.text" +msgstr "为此，首先你需要在构建它们时将带有棋子的行存储在一个列表中。" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. # __code0__: +#. def format_board(board): +#. result = '' +#. for i in range(len(board)): +#. for char in board[i]: +#. result += char +#. if i != len(board) - 1: +#. result += '\n' +#. return result +#. # __code3__: +#. def format_board(board): +#. ... +#. assert_equal( +#. format_board([ +#. ['X', 'O', 'X'], +#. ['O', ' ', ' '], +#. [' ', 'X', 'O'] +#. ]), +#. 'X|O|X\n-+-+-\nO| | \n-+-+-\n |X|O' +#. ) +#. # __code1__: +#. def format_board(board): +#. joined_rows = [] +#. for row in board: +#. joined_rows.append("".join(row)) +#. return "\n".join(joined_rows) +#. # __code2__: +#. board = [ +#. ['X', 'O', 'X'], +#. [' ', 'O', 'O'], +#. [' ', 'X', ' '] +#. ] +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22%5Cn%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27%5Cn%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27X%7CO%7CX%5Cn-%2B-%2B-%5CnO%7C+%7C+%5Cn-%2B-%2B-%5Cn+%7CX%7CO%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.board +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.char +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.format_board +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.joined_rows +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.result +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.row +msgid "pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.text" +msgstr "" +"很棒！一个典型的解决方案看起来像这样：\n" +"\n" +"__code0__\n" +"\n" +"如果你查阅了 `join` 的用法并在你的解决方案中使用了它，那就太好了！\n" +"你可能用类似这样的方式解决了它：\n" +"\n" +"__code1__\n" +"\n" +"如果你愿意，你可以现在继续到 [下一页](#Types)。或者你可以做一个额外的挑战！\n" +"\n" +"编写一个改进版的 `format_board`，显示行和列的分隔符。例如，如果\n" +"\n" +"__code2__\n" +"\n" +"那么 `print(format_board(board))` 应该打印\n" +"\n" +" X|O|X\n" +" -+-+-\n" +" |O|O\n" +" -+-+-\n" +" |X|\n" +"\n" +"它应该适用于任何大小的方形 `board`。\n" +"\n" +"我们强烈鼓励你在这个练习中使用 `join`。我们提供了一个测试，就像之前一样，你可以编写额外的测试：\n" +"\n" +" __copyable__\n" +"__code3__" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_simple +msgid "pages.NewlinesAndFormatBoard.steps.format_board_simple.hints.0.text" +msgstr "仔细查看我们提供的测试用例。它展示了你所需的一切！" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_simple +msgid "pages.NewlinesAndFormatBoard.steps.format_board_simple.hints.1.text" +msgstr "你需要构建整个棋盘的字符串。从一个空字符串开始。" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_simple +msgid "pages.NewlinesAndFormatBoard.steps.format_board_simple.hints.2.text" +msgstr "对于每一行，将该行的字符添加到字符串中。" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_simple +msgid "pages.NewlinesAndFormatBoard.steps.format_board_simple.hints.3.text" +msgstr "你需要一个嵌套循环。" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_simple +msgid "pages.NewlinesAndFormatBoard.steps.format_board_simple.hints.4.text" +msgstr "当你到达一行的末尾时，需要在下一行之前添加一个换行符。" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_simple +msgid "pages.NewlinesAndFormatBoard.steps.format_board_simple.hints.5.text" +msgstr "`'\\n'` 就像任何其他字符一样！你可以像往常一样用 `+` 添加它。" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_simple +msgid "pages.NewlinesAndFormatBoard.steps.format_board_simple.hints.6.text" +msgstr "注意最后一行的结尾与其他行不同。" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_simple +msgid "pages.NewlinesAndFormatBoard.steps.format_board_simple.hints.7.text" +msgstr "在添加换行符之前，你需要检查这是否是最后一行。" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_simple +msgid "pages.NewlinesAndFormatBoard.steps.format_board_simple.hints.8.text" +msgstr "你的外部循环应该遍历棋盘的长度。" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_simple +msgid "pages.NewlinesAndFormatBoard.steps.format_board_simple.hints.9.text" +msgstr "然后检查你是否在最后一个索引。" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. # __code0__: +#. def format_board(board): +#. ... +#. assert_equal( +#. format_board([ +#. ['X', 'O', 'X'], +#. ['O', ' ', ' '], +#. [' ', 'X', 'O'] +#. ]), +#. 'XOX\nO \n XO' +#. ) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27XOX%5CnO++%5Cn+XO%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.board +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.format_board +msgid "pages.NewlinesAndFormatBoard.steps.format_board_simple.text" +msgstr "" +"现在使用换行符编写函数 `format_board`（你的解决方案应该适用于任何大小的方形 `board`）：\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.NewlinesAndFormatBoard.steps.introducing_newline.text" +msgstr "" +"这是秘密！\n" +"\n" +"`\\n` 代表一个 ***换行符***。这只是另一个字符，就像字母或空格 (`' '`) 一样。\n" +"它是你通过按下键盘上的 Enter 键输入的两个独立行之间的字符。\n" +"\n" +"再次强调，`\\n` *表示* Python 字符串字面量中的换行符。\n" +"字符串实际上并不包含 `\\` 和 `n`，它只包含一个字符。在终端中检查一下：\n" +"\n" +"__code0__" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.invalid_multi_line_string +msgid "pages.NewlinesAndFormatBoard.steps.invalid_multi_line_string.program" +msgstr "" +"assert_equal(\n" +" format_board([\n" +" ['X', 'O', 'X'],\n" +" [' ', 'O', 'O'],\n" +" [' ', 'X', ' ']\n" +" ]),\n" +" \"XOX\n" +" OO\n" +" X \"\n" +")" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. # __code1__: +#. def format_board(board): +#. ... +#. return ... +#. assert_equal(format_board([...]), "...") +#. # __code0__: +#. assert_equal(print_board([...]), "...") +#. # __code2__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.board +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.format_board +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.print_board +msgid "pages.NewlinesAndFormatBoard.steps.invalid_multi_line_string.text" +msgstr "" +"这是一个好的开始，但理想情况下我们希望有一个 *返回* 字符串的函数，而不是打印它。\n" +"这样其他代码可以以不同的方式轻松使用这个字符串。我们可能想要操作这个字符串\n" +"(例如，给它画一个框或提取前几行)，我们可能想把它发送到屏幕以外的地方\n" +"(例如，一个文件)，而在这个特定情况下我们希望能够用 `assert_equal` 测试它。这是行不通的：\n" +"\n" +"__code0__\n" +"\n" +"因为 `print_board` 不使用 `return`，所以它默认返回 `None`。\n" +"所以我们想要这样的代码：\n" +"\n" +"__code1__\n" +"\n" +"然后 `print(format_board(board))` 应该打印出我们在开始时看到的内容。\n" +"但是我们如何返回一个包含多行的字符串呢？我们如何测试它？我们想做这样的事情：\n" +"\n" +" __copyable__\n" +"__code2__\n" +"\n" +"看看这怎么不行。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.multi_line_strings_triple_quotes +msgid "" +"pages.NewlinesAndFormatBoard.steps.multi_line_strings_triple_quotes.program" +msgstr "" +"string = \"\"\"First line\n" +"Second line\"\"\"\n" +"print(string)" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +msgid "" +"pages.NewlinesAndFormatBoard.steps.multi_line_strings_triple_quotes.text" +msgstr "" +"通常，字符串字面量必须在一行上，所以这是无效的：\n" +"\n" +" string = \"First line\n" +" Second line\"\n" +" print(string)\n" +"\n" +"但是 Python 提供了一种方法！解决方案是使用 *三重引号*，即三字符连续的引号\n" +"(可以是 `'''` 或 `\"\"\"`) 包围字符串的内容。运行以下代码：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.NewlinesAndFormatBoard.steps.one_way_to_print_board.text" +msgstr "" +"接下来我们想解决显示井字棋棋盘的问题。这是其中一种方法：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"(“`\"\".join` 是什么？去谷歌一下吧！)" + +#. https://futurecoder.io/course/#NewlinesAndFormatBoard +msgid "pages.NewlinesAndFormatBoard.title" +msgstr "换行符，`format_board`" + +#. https://futurecoder.io/course/#OtherComparisonOperators +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.OtherComparisonOperators.steps.brokn_kyboard.text" +msgstr "" +"这是一个使用 `!=` 的可爱小程序：\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#OtherComparisonOperators +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.comparing_strings +msgid "pages.OtherComparisonOperators.steps.comparing_strings.hints.0.text" +msgstr "这几乎和前一步完全一样，只是用字符串而不是数字。" + +#. https://futurecoder.io/course/#OtherComparisonOperators +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.comparing_strings +msgid "pages.OtherComparisonOperators.steps.comparing_strings.hints.1.text" +msgstr "你只需要在命令行中运行一行非常小且简单的代码。" + +#. https://futurecoder.io/course/#OtherComparisonOperators +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.comparing_strings +msgid "pages.OtherComparisonOperators.steps.comparing_strings.hints.2.text" +msgstr "你也可以通过在命令行中运行多行代码来做到这一点，首先定义变量，然后比较它们，但你不需要这样做，这可以在没有变量的情况下完成。" + +#. https://futurecoder.io/course/#OtherComparisonOperators +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.comparing_strings +msgid "pages.OtherComparisonOperators.steps.comparing_strings.hints.3.text" +msgstr "还记得在课程开始时在命令行中添加两个字符串吗？" + +#. https://futurecoder.io/course/#OtherComparisonOperators +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.comparing_strings +msgid "pages.OtherComparisonOperators.steps.comparing_strings.hints.4.text" +msgstr "例如，我们做了 `'hello' + 'world'`" + +#. https://futurecoder.io/course/#OtherComparisonOperators +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.comparing_strings +msgid "pages.OtherComparisonOperators.steps.comparing_strings.hints.5.text" +msgstr "对于这个练习，你基本上需要做的就是比较它们。" + +#. https://futurecoder.io/course/#OtherComparisonOperators +msgid "pages.OtherComparisonOperators.steps.comparing_strings.requirements" +msgstr "在命令行中运行任何代码，使用 `<` 或 `>` 比较两个字符串。" + +#. https://futurecoder.io/course/#OtherComparisonOperators +msgid "pages.OtherComparisonOperators.steps.comparing_strings.text" +msgstr "" +"你也可以使用这些运算符来比较字符串。Python会从左到右逐个比较每个字符的值，遇到第一个不同字符时，该字符的编码值大小决定字符串大小。自己试试看。" + +#. https://futurecoder.io/course/#OtherComparisonOperators +#. # __code0__: +#. if x1 < x2: +#. if x1 < x3: +#. first = x1 +#. else: +#. first = x3 +#. else: +#. if x2 < x3: +#. first = x2 +#. else: +#. first = x3 +#. print(first) +#. # __code1__: +#. first = x1 +#. if x2 < first: +#. first = x2 +#. if x3 < first: +#. first = x3 +#. print(first) +#. # __code2__: +#. x1 = 'Charlie' +#. x2 = 'Alice' +#. x3 = 'Bob' +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27Alice%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27Bob%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27Charlie%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.first +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.x1 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.x2 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.x3 +msgid "pages.OtherComparisonOperators.steps.final_text.text" +msgstr "" +"太棒了！\n" +"\n" +"有很多方法可以解决这个问题。这里有一个解决方案：\n" +"\n" +"__code0__\n" +"\n" +"还有另一个：\n" +"\n" +"__code1__\n" +"\n" +"这些程序（还有你的程序）在处理数字和字符串时都同样有效。所以对于：\n" +"\n" +"__code2__\n" +"\n" +"它们将打印 `Alice`，因为这是按字母顺序排列的第一个字符串。\n" +"\n" +"`<` 和 `>` 在比较值相等时会返回 False。例如，\n" +"3 不小于 3，因此 `3 < 3` 和 `3 > 3` 都是 False。\n" +"要允许相等的值，请使用 `<=` 和 `>=`。\n" +"再说一次，如果你眯着眼睛看，它们看起来有点像 ≤ 和 ≥。\n" +"注意 `=` 是第二个出现的 - 没有 `=<` 或 `=>` 这样的运算符。\n" +"要记住这一点，可以大声读出它们为“少于或等于”和“大于或等于”。\n" +"\n" +"总之，主要的比较运算符是 `==`、`!=`、`<`、`>`、`<=` 和 `>=`。\n" +"如果你对它们的作用有任何疑问，可以在命令行中试试它们！" + +#. https://futurecoder.io/course/#OtherComparisonOperators +msgid "pages.OtherComparisonOperators.steps.grades_example.text" +msgstr "" +"这是一个实际的 `<` 运算符示例，供你尝试：\n" +"\n" +"__program_indented__\n" +"\n" +"记住 `elif percentage < 60` 在 `if percentage < 40` 之后意味着“如果百分比不小于 40 并且也小于 60”，所以它将适用于从 40 到 59 的所有数字（包括 40 和 59）。类似地，'B' 是指 60 到 79 的百分比，而 'A' 是指任何 80 及以上的数字。" + +#. https://futurecoder.io/course/#OtherComparisonOperators +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.introducing_less_than +msgid "" +"pages.OtherComparisonOperators.steps.introducing_less_than.hints.0.text" +msgstr "你只需要在命令行中运行一行非常小且简单的代码。" + +#. https://futurecoder.io/course/#OtherComparisonOperators +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.introducing_less_than +msgid "" +"pages.OtherComparisonOperators.steps.introducing_less_than.hints.1.text" +msgstr "你会如何在命令行中添加两个数字？" + +#. https://futurecoder.io/course/#OtherComparisonOperators +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.introducing_less_than +msgid "" +"pages.OtherComparisonOperators.steps.introducing_less_than.hints.2.text" +msgstr "例如，尝试 `123 + 456`" + +#. https://futurecoder.io/course/#OtherComparisonOperators +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.introducing_less_than +msgid "" +"pages.OtherComparisonOperators.steps.introducing_less_than.hints.3.text" +msgstr "对于这个练习，你基本上需要做的就是比较它们。" + +#. https://futurecoder.io/course/#OtherComparisonOperators +msgid "" +"pages.OtherComparisonOperators.steps.introducing_less_than.requirements" +msgstr "在命令行中运行任何代码，使用 `<` 或 `>` 比较两个数字。" + +#. https://futurecoder.io/course/#OtherComparisonOperators +msgid "pages.OtherComparisonOperators.steps.introducing_less_than.text" +msgstr "" +"其他有用的运算符是 `<`（小于）和 `>`（大于）。例如，`a < b` 意思是 \"`a` 小于 " +"`b`\"。尝试在命令行中使用其中一个来比较两个数字。" + +#. https://futurecoder.io/course/#OtherComparisonOperators +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.min_three_exercise +msgid "pages.OtherComparisonOperators.steps.min_three_exercise.hints.0.text" +msgstr "尝试编写一个程序，打印出 `x1` 和 `x2` 中的最小值。" + +#. https://futurecoder.io/course/#OtherComparisonOperators +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.min_three_exercise +msgid "pages.OtherComparisonOperators.steps.min_three_exercise.hints.1.text" +msgstr "你只需要几次使用 `<`、`if`，也许还有 `else`。" + +#. https://futurecoder.io/course/#OtherComparisonOperators +#. # __code0__: +#. x1 = 30 +#. x2 = 10 +#. x3 = 20 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.x1 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.x2 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.x3 +msgid "pages.OtherComparisonOperators.steps.min_three_exercise.text" +msgstr "" +"现在进行一个练习：编写一个程序，接受三个变量 `x1`、`x2` 和 `x3`，并打印出最小的那个值。所以对于：\n" +"\n" +"__code0__\n" +"\n" +"它应该打印 `10`。" + +#. https://futurecoder.io/course/#OtherComparisonOperators +msgid "pages.OtherComparisonOperators.steps.try_not_equals.text" +msgstr "" +"等于运算符 `==` 的相反是 *不等于* 运算符 `!=`。如果你眯着眼睛看，它有点像 ≠。当两个值不相等时，它的值为 " +"`True`。在命令行中尝试一下 `__program__`。" + +#. https://futurecoder.io/course/#OtherComparisonOperators +msgid "pages.OtherComparisonOperators.title" +msgstr "其他比较运算符" + +#. https://futurecoder.io/course/#ReturningValuesFromFunctions +#. # __code0__: +#. def quadruple(x): +#. x = double(x) +#. x = double(x) +#. return x +#. def quadruple(x): +#. return double(double(x)) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.double +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.quadruple +msgid "pages.ReturningValuesFromFunctions.steps.final_text.text" +msgstr "" +"做得好！这里有两种可能的解决方案：\n" +"\n" +"__code0__" + +#. https://futurecoder.io/course/#ReturningValuesFromFunctions +msgid "pages.ReturningValuesFromFunctions.steps.first_return.text" +msgstr "" +"当函数*返回*值而不仅仅是打印它们时，它们特别有用。试试这个例子：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#ReturningValuesFromFunctions +msgid "pages.ReturningValuesFromFunctions.steps.losing_return_value.text" +msgstr "" +"在这里，我们将 `number`（其值为 `5`）作为参数 `x` 传递给函数 `double`，而 `double` *返回*\n" +"`x * 2`，即 `5 * 2`，即 `10`，这成为变量 `twice` 的值。特殊关键字 `return` 在\n" +"`double` 内部使得 `double(number)` 成为一个有值的表达式 - 特别是返回的值。\n" +"这有点像 `twice = double(number)` 等价于 `twice = number * 2`，尽管这并不是\n" +"确切发生的事情。\n" +"\n" +"注意，`double(number)` *并没有改变 `number`*。最后，`number` 仍然是 `5`。相反，`double(number)`\n" +"返回了一个新值。程序利用了这个返回值，这里是通过将其存储\n" +"在一个变量中。立即用 `print(double(number))` 打印它也可以。另一方面，\n" +"试试这个：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#ReturningValuesFromFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.quadruple_exercise +msgid "" +"pages.ReturningValuesFromFunctions.steps.quadruple_exercise.hints.0.text" +msgstr "要乘以 4，可以先乘以 2 两次。" + +#. https://futurecoder.io/course/#ReturningValuesFromFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.quadruple_exercise +msgid "" +"pages.ReturningValuesFromFunctions.steps.quadruple_exercise.hints.1.text" +msgstr "这意味着你需要调用 `double` 两次。" + +#. https://futurecoder.io/course/#ReturningValuesFromFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.quadruple_exercise +msgid "" +"pages.ReturningValuesFromFunctions.steps.quadruple_exercise.hints.10.text" +msgstr "查看 `double` 的定义以获取示例。" + +#. https://futurecoder.io/course/#ReturningValuesFromFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.quadruple_exercise +msgid "" +"pages.ReturningValuesFromFunctions.steps.quadruple_exercise.hints.11.text" +msgstr "确保你不要在 `quadruple` 的函数体内调用 `quadruple`。检查你的缩进。" + +#. https://futurecoder.io/course/#ReturningValuesFromFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.quadruple_exercise +msgid "" +"pages.ReturningValuesFromFunctions.steps.quadruple_exercise.hints.2.text" +msgstr "确保每次都使用 `double` 返回的值。" + +#. https://futurecoder.io/course/#ReturningValuesFromFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.quadruple_exercise +msgid "" +"pages.ReturningValuesFromFunctions.steps.quadruple_exercise.hints.3.text" +msgstr "确保你有函数定义的所有部分。" + +#. https://futurecoder.io/course/#ReturningValuesFromFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.quadruple_exercise +msgid "" +"pages.ReturningValuesFromFunctions.steps.quadruple_exercise.hints.4.text" +msgstr "这包括 `def`、`()` 和 `:`。" + +#. https://futurecoder.io/course/#ReturningValuesFromFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.quadruple_exercise +msgid "" +"pages.ReturningValuesFromFunctions.steps.quadruple_exercise.hints.5.text" +msgstr "确保你的函数命名为 `quadruple`。" + +#. https://futurecoder.io/course/#ReturningValuesFromFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.quadruple_exercise +msgid "" +"pages.ReturningValuesFromFunctions.steps.quadruple_exercise.hints.6.text" +msgstr "确保它在括号 `()` 中接受一个名为 `x` 的参数。" + +#. https://futurecoder.io/course/#ReturningValuesFromFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.quadruple_exercise +msgid "" +"pages.ReturningValuesFromFunctions.steps.quadruple_exercise.hints.7.text" +msgstr "在函数体内使用这个参数。" + +#. https://futurecoder.io/course/#ReturningValuesFromFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.quadruple_exercise +msgid "" +"pages.ReturningValuesFromFunctions.steps.quadruple_exercise.hints.8.text" +msgstr "确保函数体是缩进的。" + +#. https://futurecoder.io/course/#ReturningValuesFromFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.quadruple_exercise +msgid "" +"pages.ReturningValuesFromFunctions.steps.quadruple_exercise.hints.9.text" +msgstr "确保你在最后返回某个值。" + +#. https://futurecoder.io/course/#ReturningValuesFromFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.quadruple_exercise +msgid "" +"pages.ReturningValuesFromFunctions.steps.quadruple_exercise.messages.used_multiply.text" +msgstr "" +"你不能在 `quadruple` 内部使用 `*`、`+`，甚至任何数字。\n" +"你必须调用 `double` 来解决这个问题。" + +#. https://futurecoder.io/course/#ReturningValuesFromFunctions +msgid "" +"pages.ReturningValuesFromFunctions.steps.quadruple_exercise.requirements" +msgstr "编写一个程序，定义一个名为 `quadruple` 的函数，如上所述。" + +#. https://futurecoder.io/course/#ReturningValuesFromFunctions +msgid "pages.ReturningValuesFromFunctions.steps.quadruple_exercise.text" +msgstr "" +"在这里，`double(number)` 仍然返回 `10`，但我们没有利用这个值，所以它被丢失了。`number` 仍然是 `5`。\n" +"\n" +"编写一个函数 `quadruple`，它接受一个参数 `x` 并返回该参数乘以 4 的值。\n" +"你只能使用 `double` 函数 - 在 `quadruple` 的主体中不允许直接使用数字或乘法。" + +#. https://futurecoder.io/course/#ReturningValuesFromFunctions +msgid "pages.ReturningValuesFromFunctions.title" +msgstr "从函数返回值" + +#. https://futurecoder.io/course/#SingleAndDoubleQuotesInStrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.SingleAndDoubleQuotesInStrings.steps.double_quote_exercise +msgid "" +"pages.SingleAndDoubleQuotesInStrings.steps.double_quote_exercise.hints.0.text" +msgstr "你应该如何定义这个字符串？" + +#. https://futurecoder.io/course/#SingleAndDoubleQuotesInStrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.SingleAndDoubleQuotesInStrings.steps.double_quote_exercise +msgid "" +"pages.SingleAndDoubleQuotesInStrings.steps.double_quote_exercise.hints.1.text" +msgstr "用单引号，还是用双引号？" + +#. https://futurecoder.io/course/#SingleAndDoubleQuotesInStrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.SingleAndDoubleQuotesInStrings.steps.double_quote_exercise +msgid "" +"pages.SingleAndDoubleQuotesInStrings.steps.double_quote_exercise.hints.2.text" +msgstr "你只需要一个字符串。" + +#. https://futurecoder.io/course/#SingleAndDoubleQuotesInStrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.SingleAndDoubleQuotesInStrings.steps.double_quote_exercise +msgid "" +"pages.SingleAndDoubleQuotesInStrings.steps.double_quote_exercise.hints.3.text" +msgstr "不需要把字符串拼接在一起。" + +#. https://futurecoder.io/course/#SingleAndDoubleQuotesInStrings +msgid "pages.SingleAndDoubleQuotesInStrings.steps.double_quote_exercise.text" +msgstr "" +"正如你所看到的，Python认为用单引号或双引号定义的相同字符串是一样的。\n" +"\n" +"现在写一个程序，打印出以下来自Python之禅的文本：\n" +"\n" +" __copyable__\n" +" Special cases aren't special enough to break the rules.\n" +"\n" +"这个程序应该是一行代码，使用`print()`，不使用变量。" + +#. https://futurecoder.io/course/#SingleAndDoubleQuotesInStrings +msgid "pages.SingleAndDoubleQuotesInStrings.steps.double_quotes.text" +msgstr "" +"所以我们不能在单引号的字符串中随意使用撇号。\n" +"撇号被视为单引号，因此作为字符串定义的*结束引号*，例如`'Alice'`。\n" +"然后剩下的文本`s Diner'`是无效的语法，Python无法理解。\n" +"\n" +"幸运的是，Python允许我们用另一种方式定义字符串，使用双引号`\"`代替：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#SingleAndDoubleQuotesInStrings +msgid "pages.SingleAndDoubleQuotesInStrings.steps.final_text.text" +msgstr "" +"做得好！\n" +"\n" +"在大多数情况下，你可以使用单引号或双引号来定义字符串，随你喜欢。\n" +"但是如果你的字符串包含`'`，那么就用`\"`来定义它，反之亦然。" + +#. https://futurecoder.io/course/#SingleAndDoubleQuotesInStrings +msgid "" +"pages.SingleAndDoubleQuotesInStrings.steps.single_double_quotes_equal.text" +msgstr "" +"记住，引号只是人类表示字符串的一部分。\n" +"它们并不作为字符串的实际部分存储。\n" +"在命令行中试试这个：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#SingleAndDoubleQuotesInStrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.SingleAndDoubleQuotesInStrings.steps.single_quote_exercise +msgid "" +"pages.SingleAndDoubleQuotesInStrings.steps.single_quote_exercise.hints.0.text" +msgstr "想简单点！你通常会怎么做？" + +#. https://futurecoder.io/course/#SingleAndDoubleQuotesInStrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.SingleAndDoubleQuotesInStrings.steps.single_quote_exercise +msgid "" +"pages.SingleAndDoubleQuotesInStrings.steps.single_quote_exercise.hints.1.text" +msgstr "如果一个字符串包含一个撇号，我们必须用双引号来定义它。" + +#. https://futurecoder.io/course/#SingleAndDoubleQuotesInStrings +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.SingleAndDoubleQuotesInStrings.steps.single_quote_exercise +msgid "" +"pages.SingleAndDoubleQuotesInStrings.steps.single_quote_exercise.hints.2.text" +msgstr "如果字符串包含双引号呢？" + +#. https://futurecoder.io/course/#SingleAndDoubleQuotesInStrings +msgid "pages.SingleAndDoubleQuotesInStrings.steps.single_quote_exercise.text" +msgstr "" +"很棒！\n" +"\n" +"现在准确地打印出以下引号（包括双引号）：\n" +"\n" +" __copyable__\n" +" \"Talk is cheap. Show me the code.\" - Linus Torvalds\n" +"\n" +"这个程序应该是一行代码，使用`print()`，不使用变量。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.SingleAndDoubleQuotesInStrings.steps.single_quotes_apostrophe +msgid "" +"pages.SingleAndDoubleQuotesInStrings.steps.single_quotes_apostrophe.program" +msgstr "print('Alice's Diner')" + +#. https://futurecoder.io/course/#SingleAndDoubleQuotesInStrings +#. # __code0__: +#. name = 'Alice' +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27Alice%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.name +msgid "" +"pages.SingleAndDoubleQuotesInStrings.steps.single_quotes_apostrophe.text" +msgstr "" +"到目前为止，我们一直在用单引号定义字符串，例如：\n" +"\n" +"__code0__\n" +"\n" +"如果我们想定义一个包含撇号的字符串，会发生什么呢？试试这个：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#SingleAndDoubleQuotesInStrings +msgid "pages.SingleAndDoubleQuotesInStrings.title" +msgstr "字符串中的单引号和双引号" + +#. https://futurecoder.io/course/#StoringCalculationsInVariables +msgid "pages.StoringCalculationsInVariables.steps.final_text.text" +msgstr "" +"与电子表格中公式自动更新不同，像 `sentence` 这样的变量不会记住它是如何计算的，如果基础值 `word` 或 `name` " +"被更改，它也不会改变。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_doesnt_change +msgid "" +"pages.StoringCalculationsInVariables.steps.sentence_doesnt_change.output_prediction_choices.0" +msgstr "" +"Hello World\n" +"Hello World" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_doesnt_change +msgid "" +"pages.StoringCalculationsInVariables.steps.sentence_doesnt_change.output_prediction_choices.1" +msgstr "" +"Hello World\n" +"Goodbye World" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_doesnt_change +msgid "" +"pages.StoringCalculationsInVariables.steps.sentence_doesnt_change.output_prediction_choices.2" +msgstr "" +"Goodbye World\n" +"Goodbye World" + +#. https://futurecoder.io/course/#StoringCalculationsInVariables +msgid "" +"pages.StoringCalculationsInVariables.steps.sentence_doesnt_change.requirements" +msgstr "运行一个程序，包含前一步的四行代码，后面跟着这里的两行。" + +#. https://futurecoder.io/course/#StoringCalculationsInVariables +#. # __code0__: +#. word = 'Goodbye' +#. print(sentence) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27Goodbye%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.sentence +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.word +msgid "pages.StoringCalculationsInVariables.steps.sentence_doesnt_change.text" +msgstr "" +"现在 `sentence` 的值是 `'Hello World'`，可以多次使用。请注意，它会一直保持这个值，直到被直接重新赋值，例如用另一个语句 `sentence = `。例如，将这两行添加到程序的末尾：\n" +"\n" +"__code0__" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_equals_word_plus_name +msgid "" +"pages.StoringCalculationsInVariables.steps.sentence_equals_word_plus_name.output_prediction_choices.0" +msgstr "sentence" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_equals_word_plus_name +msgid "" +"pages.StoringCalculationsInVariables.steps.sentence_equals_word_plus_name.output_prediction_choices.1" +msgstr "word + ' ' + name" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_equals_word_plus_name +msgid "" +"pages.StoringCalculationsInVariables.steps.sentence_equals_word_plus_name.output_prediction_choices.2" +msgstr "Hello + ' ' + World" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_equals_word_plus_name +msgid "" +"pages.StoringCalculationsInVariables.steps.sentence_equals_word_plus_name.output_prediction_choices.3" +msgstr "'Hello' + ' ' + 'World'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_equals_word_plus_name +msgid "" +"pages.StoringCalculationsInVariables.steps.sentence_equals_word_plus_name.output_prediction_choices.4" +msgstr "Hello World" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_equals_word_plus_name +msgid "" +"pages.StoringCalculationsInVariables.steps.sentence_equals_word_plus_name.output_prediction_choices.5" +msgstr "'Hello World'" + +#. https://futurecoder.io/course/#StoringCalculationsInVariables +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "" +"pages.StoringCalculationsInVariables.steps.sentence_equals_word_plus_name.text" +msgstr "" +"通常你会使用变量来存储计算的结果。这将有助于构建更复杂的程序。例如，试试这个程序：\n" +"\n" +"__code0__" + +#. https://futurecoder.io/course/#StoringCalculationsInVariables +msgid "pages.StoringCalculationsInVariables.title" +msgstr "在变量中存储计算结果" + +#. https://futurecoder.io/course/#StringMethodsUnderstandingMutation +#. # __code0__: +#. if word.lower() == 'yes': +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27yes%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.word +msgid "pages.StringMethodsUnderstandingMutation.steps.final_text.text" +msgstr "" +"请注意，`sentence.upper()` 并不会改变原始的 `sentence`。\n" +"\n" +"你也可以在更大的表达式中立即使用 `word.lower()`，例如：\n" +"\n" +"__code0__" + +#. https://futurecoder.io/course/#StringMethodsUnderstandingMutation +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "" +"pages.StringMethodsUnderstandingMutation.steps.mutation_string_append.text" +msgstr "" +"这两个方法在字符串上也像在列表上一样有效。\n" +"`index` 返回搜索词 `'the'` 在更长字符串\n" +"`'feed the dog and the cat'` 中的 *起始索引*，即 `5`。\n" +"\n" +"| 0 | 1 | 2 | 3 | 4 | **5** | 6 | 7 | 8 | ... |\n" +"| :--: | :--: | :--: | :--: | :--: | :---: | :--: | :--: | :--: | :--: |\n" +"| f | e | e | d | | **t** | h | e | | ... |\n" +"\n" +"请注意，在大多数情况下，*就地修改列表* 的方法（`append`、`insert`、`remove`）仅返回 `None`，\n" +"而其他函数/方法则返回一个新的有用值，而不改变原始参数。\n" +"唯一的例外是 `pop` 方法。\n" +"\n" +"直接修改一个值被称为 *变动* (mutation) - 可以被变异的值类型是 *可变的* (mutable)，\n" +"而不能被变异的则是 *不可变的* (immutable)。列表是可变的。\n" +"字符串是不可变的 - 它们没有像 `append` 或甚至下标赋值这样的任何方法。\n" +"自己看看：\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StringMethodsUnderstandingMutation.steps.string_count_index +msgid "" +"pages.StringMethodsUnderstandingMutation.steps.string_count_index.program" +msgstr "" +"string = 'feed the dog and the cat'\n" +"print(string.count('the'))\n" +"print(string.index('the'))" + +#. https://futurecoder.io/course/#StringMethodsUnderstandingMutation +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.StringMethodsUnderstandingMutation.steps.string_count_index.text" +msgstr "" +"`in` 在字符串上的工作方式与在列表上相同！命令返回了 `True`，因为 `the` 在 `feed the dog and the cat` 中作为 *子字符串* 出现。\n" +"那么 `count` 和 `index` 呢？\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StringMethodsUnderstandingMutation.steps.string_in_step +msgid "pages.StringMethodsUnderstandingMutation.steps.string_in_step.program" +msgstr "print('the' in 'feed the dog and the cat')" + +#. https://futurecoder.io/course/#StringMethodsUnderstandingMutation +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.StringMethodsUnderstandingMutation.steps.string_in_step.text" +msgstr "" +"你已经看到 `len` 和下标在字符串上是如何工作的，字符串有点像字符的列表。\n" +"字符串还支持我们学到的一些新方法，不仅适用于字符，也适用于任何子字符串。\n" +"例如，试试以下内容：\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#StringMethodsUnderstandingMutation +#. # __code1__: +#. __program_indented__ +#. # __code0__: +#. word.lower() +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.word +msgid "pages.StringMethodsUnderstandingMutation.steps.string_lower_upper.text" +msgstr "" +"你根本无法改变一个字符串 - 你只能创建新的字符串并使用它们。\n" +"这意味着单独来看这是一个无用的语句：\n" +"\n" +"__code0__\n" +"\n" +"由 `word` 引用的字符串没有被修改，而是 `word.lower()` 返回了一个新的字符串，但这个字符串立即被丢弃了。\n" +"如果你想改变 `word` 引用的值，你必须给变量赋一个新值：\n" +"\n" +" __copyable__\n" +"__code1__" + +#. https://futurecoder.io/course/#StringMethodsUnderstandingMutation +msgid "pages.StringMethodsUnderstandingMutation.title" +msgstr "字符串方法与不可变性" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +msgid "pages.TestingFunctions.steps.alert_exercise.hints.0.text" +msgstr "`string` 应该在每边加一个空格和 `level` 个感叹号 (`!`)。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +msgid "pages.TestingFunctions.steps.alert_exercise.hints.1.text" +msgstr "在你的程序中包含之前的 `surround` 定义，并在 `alert` 中调用它。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +msgid "pages.TestingFunctions.steps.alert_exercise.hints.10.text" +msgstr "想想你如何使用 `+=` 来构建字符串。重复更新同一个变量，逐步构建你的结果。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +msgid "pages.TestingFunctions.steps.alert_exercise.hints.11.text" +msgstr "也就是说，在你的循环中写 `something = surround(something, '!')`。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +msgid "pages.TestingFunctions.steps.alert_exercise.hints.12.text" +msgstr "确保在 `alert` 的最后返回某个值。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +msgid "pages.TestingFunctions.steps.alert_exercise.hints.13.text" +msgstr "确保你不要在循环内部 `return`，而是在循环之后。检查你的缩进。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +msgid "pages.TestingFunctions.steps.alert_exercise.hints.14.text" +msgstr "确保你不要在 `alert` 的函数体内调用 `alert`。检查你的缩进。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +msgid "pages.TestingFunctions.steps.alert_exercise.hints.2.text" +msgstr "使用 `surround` 来处理空格。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +msgid "pages.TestingFunctions.steps.alert_exercise.hints.3.text" +msgstr "使用 `surround` 来处理感叹号。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +msgid "pages.TestingFunctions.steps.alert_exercise.hints.4.text" +msgstr "你不能把多个感叹号合并成一个字符串，所以要多次调用 `surround`。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +msgid "pages.TestingFunctions.steps.alert_exercise.hints.5.text" +msgstr "也就是说，对于每对感叹号调用一次 `surround`。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +msgid "pages.TestingFunctions.steps.alert_exercise.hints.6.text" +msgstr "所以多次调用 `surround(..., '!')`。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +msgid "pages.TestingFunctions.steps.alert_exercise.hints.7.text" +msgstr "使用循环多次调用它。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +msgid "pages.TestingFunctions.steps.alert_exercise.hints.8.text" +msgstr "使用 `range(n)` 让你的循环有 `n` 次迭代。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +msgid "pages.TestingFunctions.steps.alert_exercise.hints.9.text" +msgstr "确保你使用 `surround` 的返回值。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +msgid "" +"pages.TestingFunctions.steps.alert_exercise.messages.catch_return_inside_loop.text" +msgstr "" +"在 `alert` 函数中，你把 `return` 语句放在了错误的位置！\n" +"注意你在 `alert` 中的缩进。你可能过早地用 `return` 结束了一个循环。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +msgid "pages.TestingFunctions.steps.alert_exercise.messages.used_format.text" +msgstr "" +"你不能在 `alert` 中使用字符串连接/格式化/插值/乘法或 f-strings。\n" +"你必须调用 `surround` 来解决这个问题。" + +#. https://futurecoder.io/course/#TestingFunctions +#. # __code0__: +#. assert_equal(alert("Warning", 2), "!! Warning !!") +#. assert_equal(alert("DANGER", 4), "!!!! DANGER !!!!") +#. # __code1__: +#. def alert(string, level): +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22%21%21%21%21+DANGER+%21%21%21%21%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22%21%21+Warning+%21%21%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22DANGER%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22Warning%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.alert +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.level +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.string +msgid "pages.TestingFunctions.steps.alert_exercise.text" +msgstr "" +"完美！现在写一个函数 `alert`，使其通过这些测试：\n" +"\n" +"__code0__\n" +"\n" +"`alert` 的主体不允许包含 `+`。请使用 `surround`。你的函数应该像这样开始：\n" +"\n" +"__code1__" + +#. https://futurecoder.io/course/#TestingFunctions +msgid "pages.TestingFunctions.steps.complete_quadruple_tests.requirements" +msgstr "" +"输入上面的程序。\n" +"然后通过为每个 `assert_equal` 调用添加一个参数来更改最后两行，以使测试通过。\n" +"不要触碰函数定义。" + +#. https://futurecoder.io/course/#TestingFunctions +#. # __code0__: +#. def double(x): +#. return x * 2 +#. def quadruple(x): +#. return double(double(x)) +#. assert_equal(quadruple(2)) +#. assert_equal(quadruple(5)) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.double +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.quadruple +msgid "pages.TestingFunctions.steps.complete_quadruple_tests.text" +msgstr "" +"很好！我们的测试失败了！当然，这通常不是好事，但它告诉我们测试正在\n" +"发挥作用。它们将确保我们实现的 `double` 是正确的。\n" +"\n" +"让我们练习这个新概念。下面是之前的函数 `quadruple` 和一些不完整的测试。\n" +"通过为 `assert_equal` 添加缺失的参数来修复程序。\n" +"\n" +"__code0__" + +#. https://futurecoder.io/course/#TestingFunctions +msgid "pages.TestingFunctions.steps.final_text.text" +msgstr "干得好！这些工具在接下来的章节中会非常有用。" + +#. https://futurecoder.io/course/#TestingFunctions +#. # __code0__: +#. def assert_equal(actual, expected): +#. if actual == expected: +#. print("OK") +#. else: +#. print(f"Error! {repr(actual)} != {repr(expected)}") +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22OK%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.actual +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.expected +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.f%22Error%21+%7Brepr%28actual%29%7D+%21%3D+%7Brepr%28expected%29%7D%22 +msgid "pages.TestingFunctions.steps.introducing_assert_equal.text" +msgstr "" +"编写程序的重要部分是测试它们是否正确工作。你可以手动进行测试，例如通过检查\n" +"`print(double(5))` 是否打印 `10`，但这种方式很快就会变得乏味。\n" +"实际上编写测试你程序的程序是很有帮助的。这被称为 *自动化测试*，\n" +"这些程序被称为 *测试*。\n" +"\n" +"这里有一个简单的函数 `assert_equal` 来帮助我们编写测试：\n" +"\n" +"__code0__\n" +"\n" +"\n" +"(那个函数 `repr` 是什么？试试 `print(f\"{'abc'} {repr('abc')}\")` 来看看一个区别，但不要太担心。)\n" +"\n" +"这不是 Python 的标准部分（虽然类似的函数是），但我们已经将它添加到你的编码环境中，\n" +"所以你可以随时使用它。这里有一个例子供你尝试：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#TestingFunctions +msgid "pages.TestingFunctions.steps.make_tests_fail.requirements" +msgstr "运行上一步的程序，但将 `x * 2` 替换为 `x * 3`。保持其余部分不变。" + +#. https://futurecoder.io/course/#TestingFunctions +msgid "pages.TestingFunctions.steps.make_tests_fail.text" +msgstr "" +"OK 表示测试通过。我们的 `double` 函数似乎工作正常。将其更改为返回\n" +"`x * 3`，然后看看会发生什么。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.surround_exercise +msgid "pages.TestingFunctions.steps.surround_exercise.hints.0.text" +msgstr "参数 `sides` 应该在 `string` 前后添加。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.surround_exercise +msgid "pages.TestingFunctions.steps.surround_exercise.hints.1.text" +msgstr "使用字符串连接来做到这一点。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.surround_exercise +msgid "pages.TestingFunctions.steps.surround_exercise.hints.2.text" +msgstr "确保主体有正确的缩进。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.surround_exercise +msgid "pages.TestingFunctions.steps.surround_exercise.hints.3.text" +msgstr "确保在最后返回某个值。" + +#. https://futurecoder.io/course/#TestingFunctions +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.surround_exercise +msgid "pages.TestingFunctions.steps.surround_exercise.hints.4.text" +msgstr "确保你不要在 `surround` 的函数体内调用 `surround`。检查你的缩进。" + +#. https://futurecoder.io/course/#TestingFunctions +#. # __code0__: +#. assert_equal(surround("more", "++"), "++more++") +#. assert_equal(surround("the same", "="), "=the same=") +#. # __code1__: +#. def surround(string, sides): +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22%2B%2Bmore%2B%2B%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22%3Dthe+same%3D%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22more%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22the+same%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.sides +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.string +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.surround +msgid "pages.TestingFunctions.steps.surround_exercise.text" +msgstr "" +"测试的另一个有用之处在于，任何人都可以阅读它们并看到清晰、明确的示例\n" +"说明函数的作用。当一个函数复杂且难以用英语描述时，这非常有帮助。\n" +"\n" +"例如，这里有一些测试：\n" +"\n" +"__code0__\n" +"\n" +"我不需要解释 `surround` 的作用，你可以自己看到。\n" +"\n" +"写一个函数 `surround`，使其通过这些测试，并像这样开始：\n" +"\n" +"__code1__" + +#. https://futurecoder.io/course/#TestingFunctions +msgid "pages.TestingFunctions.title" +msgstr "测试函数" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheEqualityOperator.steps.equality_vs_assignment +msgid "pages.TheEqualityOperator.steps.equality_vs_assignment.program" +msgstr "print(1 + 2 = 3)" + +#. https://futurecoder.io/course/#TheEqualityOperator +msgid "pages.TheEqualityOperator.steps.equality_vs_assignment.requirements" +msgstr "运行上一步的程序，但将任何 `==` 替换为 `=`。" + +#. https://futurecoder.io/course/#TheEqualityOperator +msgid "pages.TheEqualityOperator.steps.equality_vs_assignment.text" +msgstr "" +"正如你所看到的，如果值相等，等式表达式的结果为 `True`，\n" +"否则为 `False`。\n" +"\n" +"注意等号操作符 `==` 和单个 `=` 之间的区别，它们有不同的含义，\n" +"特别是在你到目前为止看到的赋值语句中。如果你尝试\n" +"从之前的程序中移除一个 `=` 会发生什么？" + +#. https://futurecoder.io/course/#TheEqualityOperator +msgid "pages.TheEqualityOperator.steps.final_text.text" +msgstr "做得好！" + +#. https://futurecoder.io/course/#TheEqualityOperator +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.TheEqualityOperator.steps.if_equals_replacing_characters.text" +msgstr "" +"让我们在 `if` 语句中使用 `==`。在这个程序中，只有当 `c` 是字符 `'s'` 时，`if` 的主体才会运行。你自己看看吧。\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#TheEqualityOperator +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheEqualityOperator.steps.if_equals_replacing_characters_exercise +msgid "" +"pages.TheEqualityOperator.steps.if_equals_replacing_characters_exercise.hints.0.text" +msgstr "你只需要添加几行与现有代码非常相似的代码。" + +#. https://futurecoder.io/course/#TheEqualityOperator +msgid "" +"pages.TheEqualityOperator.steps.if_equals_replacing_characters_exercise.text" +msgstr "现在扩展程序，使其还将 `e` 替换为 `3`，将 `a` 替换为 `@`。" + +#. https://futurecoder.io/course/#TheEqualityOperator +msgid "pages.TheEqualityOperator.steps.introducing_equality.text" +msgstr "" +"有几种方法可以获得布尔值而不直接赋值，\n" +"这使你能够构建非常有用的 `if` 语句。特别是有许多 *比较操作符* 用于比较两个表达式的值。\n" +"最常见的是等号操作符，它检查两个值是否相等。\n" +"它用两个等号表示： `==`。试着运行这个：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#TheEqualityOperator +msgid "pages.TheEqualityOperator.title" +msgstr "等号操作符" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +msgid "pages.TheFullTicTacToeGame.steps.final_text.text" +msgstr "" +"### ***祝贺你!!!***\n" +"\n" +"你做到了！" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.0.text" +msgstr "" +"你应该在某处使用所有的函数 `winner`、`format_board`（不包括在 `play_move` " +"中的使用）、`play_move`、`make_board`、`print_winner` 和 `print_draw`。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.1.text" +msgstr "你只需要在代码中提到每个函数一次，尽管其中一些函数在程序运行时会被多次调用。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.10.text" +msgstr "无论哪个函数被调用，它必须被调用一次且仅一次。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.11.text" +msgstr "确保你不多次调用一个函数的一个简单方法是将它放在任何循环之外调用。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.12.text" +msgstr "我们已经学习了两种让循环停止的方法。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.13.text" +msgstr "一种方法是 `break`，它专门结束一个循环，不再继续。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.14.text" +msgstr "第二种方法不仅结束循环，还结束整个函数调用。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.15.text" +msgstr "第二种方法是 `return`。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.16.text" +msgstr "" +"不要在示例代码中成对地进行移动，比如 `play_move(board, player1)` 和 `play_move(board, " +"player2)`。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.17.text" +msgstr "相反，每次循环迭代应该只进行一次移动。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.18.text" +msgstr "你需要一个变量来跟踪轮到哪个玩家。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.19.text" +msgstr "每次循环迭代时应该切换玩家。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.2.text" +msgstr "你需要一个 for 循环来重复进行移动。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.20.text" +msgstr "一个 `if` 语句是一个很好的方法来做到这一点。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.21.text" +msgstr "特别是与 `else` 结合使用时。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.22.text" +msgstr "确保 `player1` 先进行第一次移动。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.23.text" +msgstr "只有在用 `if` 语句检查 `winner` 后才调用 `print_winner`。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.24.text" +msgstr "你需要在循环内检查赢家，因为你不知道哪个玩家可能会获胜。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.25.text" +msgstr "一旦你调用了 `print_winner`，你可以使用 `return` 来结束函数。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.26.text" +msgstr "仅仅 `return` 就可以，`play_game` 不需要返回一个值。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.27.text" +msgstr "在检查赢家后，不要使用 `else` 来调用 `print_draw`，如果没有赢家的话。仅仅因为没有人获胜并不意味着已经平局。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.28.text" +msgstr "`print_draw` 只有在所有移动都已进行且仍然没有赢家时才应被调用。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.29.text" +msgstr "所以它应该在循环之后调用，而不是在循环内。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.3.text" +msgstr "你不需要检查棋盘是否已填满，因为你总是可以计算填满棋盘需要多少次移动。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.30.text" +msgstr "检查缩进以确保 `print_draw` 不在 for 循环的主体内。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.4.text" +msgstr "所以你可以使用一个将运行固定次数的循环，并在循环内检查是否需要提前结束循环。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.5.text" +msgstr "在 3x3 的棋盘上最多可以进行多少次移动？4x4 呢？" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.6.text" +msgstr "使用 `range` 的循环是以固定次数迭代的简单方法。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.7.text" +msgstr "所以你可以使用 `for _ in range(N):` 至多进行 `N` 次移动。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.8.text" +msgstr "一旦有赢家，你需要结束循环和游戏。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.hints.9.text" +msgstr "应该调用 `print_winner` 或 `print_draw`，而不是两者都调用。" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +#. # __code0__: +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%22It%27s+a+draw%21%22 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.board +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.board_size +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.col +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.column_winner +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.diagonal_winner +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.f%27%5Cn++%7B%22%2B%22.join%28%22-%22+%2A+size%29%7D%5Cn%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.f%27%7Bi+%2B+1%7D+%7B%22%7C%22.join%28row%29%7D%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.f%27%7Bplayer%7D+to+play%3A%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.f%27%7Bplayer%7D+wins%21%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.f%27++%7B%22+%22.join%28str%28i+%2B+1%29+for+i+in+range%28size%29%29%7D%5Cn%7Bline.join%28rows%29%7D%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.format_board +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.line +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.main_diagonal_winner +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.make_board +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.play_game +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.play_move +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.player +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.player1 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.player2 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.print_draw +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.print_winner +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.row +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.row_winner +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.rows +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.size +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.strings +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.winner +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.winning_line +msgid "pages.TheFullTicTacToeGame.steps.the_full_game.text" +msgstr "" +"是时候把所有东西放在一起了！下面是一些开始的代码。\n" +"\n" +"它包括我们在前面的页面中定义的各种函数的实现，用于解决问题的部分\n" +"，使用一些你还没有学过的技巧来使它们更简短。不要更改它们。\n" +"\n" +"你的任务是正确实现 `play_game`。当前的实现展示了游戏开始时应该发生的事情，但显然是不完整的。\n" +"解决方案应该适用于任何棋盘大小，并继续进行游戏直到结束。\n" +"`play_game` 最后应该做的是，如果 `winner(board)` 为真，则调用 `print_winner(player)`\n" +"，或者如果棋盘填满且没有赢家，则调用 `print_draw()`。\n" +"\n" +"你可以假设用户只会输入有效的输入，\n" +"即从 1 到 `board_size` 的数字，以选择一个尚未被占用的棋盘单元。\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#TheFullTicTacToeGame +msgid "pages.TheFullTicTacToeGame.title" +msgstr "完整的井字棋游戏" + +#. https://futurecoder.io/course/#Types +msgid "pages.Types.steps.check_type_manually.text" +msgstr "" +"Python 首先报告 `type('Hello World')` 是 ``。现在不用担心 `class`。\n" +"`str` 是 *字符串* 的缩写。\n" +"\n" +"然后 `True` 是 `bool`（*布尔值* 的缩写），而 `[1, 2, 3]` 的类型是 `list`。\n" +"\n" +"注意，数字有两种类型：\n" +"\n" +"- `int`，是 '整数' 的缩写，用于表示整数，也就是说没有分数或小数点。\n" +"- `float`，是 '浮点数' 的缩写，用于表示带小数点的数字，可能还有分数部分。\n" +"\n" +"在大多数情况下，你不需要担心数字的不同类型，因为在做数学运算时可以混合使用这两种类型。\n" +"\n" +"类型是可以以各种方式使用的值，就像其他值一样。\n" +"例如，试试在命令行中输入这个：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#Types +msgid "pages.Types.steps.common_type_errors.text" +msgstr "" +"如果你在 `str` 和 `int` 之间使用运算符，会发生什么？试试在命令行中输入：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#Types +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.Types.steps.different_types_look_same.text" +msgstr "" +"不同类型的值通常彼此非常不同，但在打印时它们可能看起来相同，\n" +"这可能会让人困惑。试试这个：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"(你可以使用 `print(repr(123))` 和 `print(repr('123'))` 来区分它们。`repr` 是什么？去谷歌一下吧！)" + +#. https://futurecoder.io/course/#Types +msgid "pages.Types.steps.final_text.text" +msgstr "" +"太棒了！\n" +"\n" +"顺便说一下，当你需要连接字符串和数字时，记得你也可以\n" +"使用 f-strings。它们通常看起来更好。\n" +"\n" +"你已经学习了 Python 中的类型，以及如何通过转换类型来避免常见错误。\n" +"继续完成项目的其余部分吧！" + +#. https://futurecoder.io/course/#Types +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.Types.steps.five_different_types.text" +msgstr "" +"到目前为止，我们已经看到了各种数据类型：字符串、列表、数字和布尔值。\n" +"这些被称为 *类型*。每个值都有一个类型，它会影响它的行为\n" +"并可以通过 `type` 函数来揭示：\n" +"\n" +" __copyable__\n" +"__code0__" + +msgid "" +"pages.Types.steps.fixing_type_errors_with_conversion.disallowed.0.label" +msgstr "f-strings" + +#. https://futurecoder.io/course/#Types +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.fixing_type_errors_with_conversion +msgid "pages.Types.steps.fixing_type_errors_with_conversion.hints.0.text" +msgstr "这段代码在哪些地方出错了？" + +#. https://futurecoder.io/course/#Types +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.fixing_type_errors_with_conversion +msgid "pages.Types.steps.fixing_type_errors_with_conversion.hints.1.text" +msgstr "有些值需要转换为不同的类型。" + +#. https://futurecoder.io/course/#Types +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.fixing_type_errors_with_conversion +msgid "pages.Types.steps.fixing_type_errors_with_conversion.hints.2.text" +msgstr "具体来说，有一个 `str` 需要转换为 `int`。" + +#. https://futurecoder.io/course/#Types +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.fixing_type_errors_with_conversion +msgid "pages.Types.steps.fixing_type_errors_with_conversion.hints.3.text" +msgstr "还有一个 `int` 需要转换为 `str`。" + +#. https://futurecoder.io/course/#Types +#. # __code0__: +#. number = '3' +#. for i in range(number): +#. print('Starting... ' + i + 1) +#. print('Go!') +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27Go%21%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27Starting...+%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.number +msgid "pages.Types.steps.fixing_type_errors_with_conversion.text" +msgstr "" +"在 `range` 中使用字符串而不是整数，比如 `range('5')`，\n" +"或者在列表下标中使用，比如 `list['3']` 也会导致错误。\n" +"\n" +"大多数这些问题可以通过使用 `int` 函数将字符串转换为整数来解决：\n" +"`int('5')` 将返回整数 `5`。\n" +"类似地，可以使用 `str` 函数将整数转换为字符串：\n" +"`str(5)` 将返回字符串 `'5'`。\n" +"\n" +"利用这些新知识，修复这个损坏的程序：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"正确的程序应该打印：\n" +"\n" +" Starting... 1\n" +" Starting... 2\n" +" Starting... 3\n" +" Go!\n" +"\n" +"你的解决方案应该适用于变量 `number` 的任何值。" + +#. https://futurecoder.io/course/#Types +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.format_board_with_numbers +msgid "pages.Types.steps.format_board_with_numbers.hints.0.text" +msgstr "你可以开始使用之前解决方案中的思路来实现 `format_board`。强烈建议使用 `join`！" + +#. https://futurecoder.io/course/#Types +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.format_board_with_numbers +msgid "pages.Types.steps.format_board_with_numbers.hints.1.text" +msgstr "第一行必须与其余部分分开处理。" + +#. https://futurecoder.io/course/#Types +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.format_board_with_numbers +msgid "pages.Types.steps.format_board_with_numbers.hints.2.text" +msgstr "记住 `range` 产生的数字是这样的：0, 1, 2, ..." + +#. https://futurecoder.io/course/#Types +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.format_board_with_numbers +msgid "pages.Types.steps.format_board_with_numbers.hints.3.text" +msgstr "我们希望第一行的数字是这样的：1, 2, 3..." + +#. https://futurecoder.io/course/#Types +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.format_board_with_numbers +msgid "pages.Types.steps.format_board_with_numbers.hints.4.text" +msgstr "每个数字在添加到第一行之前必须转换为字符串！" + +#. https://futurecoder.io/course/#Types +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.format_board_with_numbers +msgid "pages.Types.steps.format_board_with_numbers.hints.5.text" +msgstr "对于棋盘的行本身，做类似的事情。" + +#. https://futurecoder.io/course/#Types +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.format_board_with_numbers +msgid "pages.Types.steps.format_board_with_numbers.hints.6.text" +msgstr "从仅包含你上面构建的第一行的列表开始。" + +#. https://futurecoder.io/course/#Types +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.format_board_with_numbers +msgid "pages.Types.steps.format_board_with_numbers.hints.7.text" +msgstr "将每一行的字符串添加到列表中，然后用换行符连接列表。" + +#. https://futurecoder.io/course/#Types +#. # __code0__: +#. def format_board(board): +#. ... +#. assert_equal( +#. format_board([ +#. ['X', 'O', 'X'], +#. ['O', ' ', ' '], +#. [' ', 'X', 'O'] +#. ]), +#. ' 123\n1XOX\n2O \n3 XO' +#. ) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27+123%5Cn1XOX%5Cn2O++%5Cn3+XO%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.board +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.format_board +msgid "pages.Types.steps.format_board_with_numbers.text" +msgstr "" +"编写一个改进版的 `format_board`，使其具有行和列数字，如下所示：\n" +"\n" +" 123\n" +" 1XOX\n" +" 2 OO\n" +" 3 X\n" +"\n" +"它应该适用于任何单数字大小的棋盘。以下是一个测试案例：\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#Types +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.Types.steps.less_than_has_two_meanings.text" +msgstr "" +"对于两个整数，`+` 表示加法，而对于两个字符串，它表示字符串连接。\n" +"Python 会根据输入的类型自动判断 `+` 的含义。\n" +"类似地，`<` 在两个字符串和两个整数之间的作用不同：\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#Types +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.Types.steps.less_than_sorting_strings.text" +msgstr "" +"所以 `<` 在两个整数之间像通常的 '小于' 一样工作，因为 `13` 小于 `120`，\n" +"但在两个字符串之间，它像字典排序一样工作：`13` 在字母顺序上排在 `120` 之后\n" +"因为 `3` 在 `2` 之后。\n" +"\n" +"看看这在排序列表时有什么不同：\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#Types +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.Types.steps.plus_has_two_meanings.text" +msgstr "" +"不同类型有不同的方法，并支持不同的运算符。\n" +"相同的方法或运算符也可以有不同的含义。\n" +"例如，看看 `+` 对于 `str` 和 `int` 的不同含义：\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#Types +msgid "pages.Types.title" +msgstr "类型" + +#. https://futurecoder.io/course/#UnderstandingProgramsWithPythonTutor +msgid "pages.UnderstandingProgramsWithPythonTutor.steps.final_text.text" +msgstr "" +"请注意，代码会分别运行两次：一次在这里，一次在 pythontutor.com 上。\n" +"根据你的程序，这两次运行可能会产生不同的结果。" + +#. https://futurecoder.io/course/#UnderstandingProgramsWithPythonTutor +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "" +"pages.UnderstandingProgramsWithPythonTutor.steps.run_with_python_tutor.text" +msgstr "" +"现在是时候学习另一个工具来探索程序了。\n" +"将下面的代码复制到编辑器中，然后点击新的“Python Tutor”按钮。\n" +"这个按钮会打开一个新标签页，展示来自 [pythontutor.com](http://pythontutor.com) 的可视化效果。\n" +"在那里，你可以通过“上一个”或“下一个”按钮逐步浏览程序，或者拖动\n" +"滑块向左或向右。你还可以在右侧查看变量的值。\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#UnderstandingProgramsWithPythonTutor +msgid "pages.UnderstandingProgramsWithPythonTutor.title" +msgstr "使用 Python Tutor 理解程序" + +#. https://futurecoder.io/course/#UnderstandingProgramsWithSnoop +msgid "pages.UnderstandingProgramsWithSnoop.steps.final_text.text" +msgstr "干得好！你正在处理越来越复杂的程序。" + +#. https://futurecoder.io/course/#UnderstandingProgramsWithSnoop +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_first_character +msgid "" +"pages.UnderstandingProgramsWithSnoop.steps.print_first_character.hints.0.text" +msgstr "代码应该几乎完全相同，只需做几个小改动。" + +#. https://futurecoder.io/course/#UnderstandingProgramsWithSnoop +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_first_character +msgid "" +"pages.UnderstandingProgramsWithSnoop.steps.print_first_character.hints.1.text" +msgstr "确保 `if include:` 里面的代码在循环开始时运行，也就是在第一次迭代时。" + +#. https://futurecoder.io/course/#UnderstandingProgramsWithSnoop +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_first_character +msgid "" +"pages.UnderstandingProgramsWithSnoop.steps.print_first_character.hints.2.text" +msgstr "这意味着此时 `include` 应该是 `True`。" + +#. https://futurecoder.io/course/#UnderstandingProgramsWithSnoop +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_first_character +msgid "" +"pages.UnderstandingProgramsWithSnoop.steps.print_first_character.hints.3.text" +msgstr "确保 `if include:` 里面的代码在第一次迭代后 *不* 再运行。" + +#. https://futurecoder.io/course/#UnderstandingProgramsWithSnoop +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_first_character +msgid "" +"pages.UnderstandingProgramsWithSnoop.steps.print_first_character.hints.4.text" +msgstr "这意味着在第一次迭代后 `include` 应该是 `False`。" + +#. https://futurecoder.io/course/#UnderstandingProgramsWithSnoop +msgid "pages.UnderstandingProgramsWithSnoop.steps.print_first_character.text" +msgstr "" +"哇！滚动到终端的顶部，让我们一起看看 `snoop` 正在向你展示什么。\n" +"一开始是非常简单的：\n" +"\n" +" 1 | sentence = 'Hello World'\n" +" 3 | include = False\n" +" 4 | new_sentence = ''\n" +" 5 | for char in sentence:\n" +" ...... char = 'H'\n" +"\n" +"前几行只是向你展示计算机运行的程序行。\n" +"左边是编辑器中看到的行号。\n" +"\n" +"运行 `for char in sentence:` 会给变量 `char` 赋值，所以 `snoop` 会显示这个值。\n" +"以 `......` 开头的行表示一个新变量或现有变量值的变化。\n" +"当这些行是多余的时，它们不会被显示，这就是为什么 `snoop` 的输出不会像这样开始：\n" +"\n" +" 1 | sentence = 'Hello World'\n" +" ...... sentence = 'Hello World'\n" +" 3 | include = False\n" +" ...... include = False\n" +" 4 | new_sentence = ''\n" +" ...... new_sentence = ''\n" +" 5 | for char in sentence:\n" +" ...... char = 'H'\n" +"\n" +"接下来的两行是：\n" +"\n" +" 6 | if include:\n" +" 8 | include = True\n" +"\n" +"这里重要的是没有显示的内容：因为 `include` 是 `False`，所以第 7 行 (`new_sentence += char`) 被跳过。但随后 `include` 被设置为 `True`，所以下一次循环的结果就不同了：\n" +"\n" +" 5 | for char in sentence:\n" +" ...... char = 'e'\n" +" 6 | if include:\n" +" 7 | new_sentence += char\n" +" .............. new_sentence = 'e'\n" +"\n" +"`new_sentence += char` 第一次运行，变量 `new_sentence` 得到一个新值。\n" +"\n" +"现在修改程序，做相反的事情：只打印第一个字符，省略其余部分。" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_tail +msgid "" +"pages.UnderstandingProgramsWithSnoop.steps.print_tail.output_prediction_choices.0" +msgstr "Hello World" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_tail +msgid "" +"pages.UnderstandingProgramsWithSnoop.steps.print_tail.output_prediction_choices.1" +msgstr "ello World" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_tail +msgid "" +"pages.UnderstandingProgramsWithSnoop.steps.print_tail.output_prediction_choices.2" +msgstr "Hello Worl" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_tail +msgid "" +"pages.UnderstandingProgramsWithSnoop.steps.print_tail.output_prediction_choices.3" +msgstr "H" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_tail +msgid "" +"pages.UnderstandingProgramsWithSnoop.steps.print_tail.output_prediction_choices.4" +msgstr "d" + +#. https://futurecoder.io/course/#UnderstandingProgramsWithSnoop +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.UnderstandingProgramsWithSnoop.steps.print_tail.text" +msgstr "" +"运行这个程序：\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#UnderstandingProgramsWithSnoop +msgid "" +"pages.UnderstandingProgramsWithSnoop.steps.print_tail_snoop.requirements" +msgstr "运行上一步的相同程序，但使用 `snoop` 按钮而不是 '运行' 按钮。如果你可能修改过程序，请再次复制程序。" + +#. https://futurecoder.io/course/#UnderstandingProgramsWithSnoop +msgid "pages.UnderstandingProgramsWithSnoop.steps.print_tail_snoop.text" +msgstr "" +"程序开始变得复杂了！\n" +"是时候引入一个新工具来帮助你理解程序了。点击 `snoop` 按钮来运行相同的程序，同时显示发生了什么。" + +#. https://futurecoder.io/course/#UnderstandingProgramsWithSnoop +msgid "pages.UnderstandingProgramsWithSnoop.title" +msgstr "使用 `snoop` 理解程序" + +#. https://futurecoder.io/course/#UsingBreak +#. # __code0__: +#. found = False +#. for thing in things: +#. if thing == thing_to_find: +#. found = True +#. print(found) +#. # __code1__: +#. for thing in things: +#. if thing == thing_to_find: +#. found = True +#. break +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.found +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.thing +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.thing_to_find +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.things +msgid "pages.UsingBreak.steps.final_text.text" +msgstr "" +"太好了！\n" +"\n" +"一个典型的解决方案看起来像这样：\n" +"\n" +"__code0__\n" +"\n" +"你的解决方案可能类似。这样很好，但有点低效。\n" +"因为即使在列表的开头找到元素，它也会遍历整个列表。\n" +"你可以使用 `break` 语句来停止任何循环，如下所示：\n" +"\n" +"__code1__\n" +"\n" +"这同样是正确的，但一旦找到元素，就会跳过不必要的迭代和检查。\n" +"你可以使用 `snoop` 来查看差异。" + +#. https://futurecoder.io/course/#UsingBreak +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.list_contains_exercise +msgid "pages.UsingBreak.steps.list_contains_exercise.hints.0.text" +msgstr "你需要一个循环。" + +#. https://futurecoder.io/course/#UsingBreak +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.list_contains_exercise +msgid "pages.UsingBreak.steps.list_contains_exercise.hints.1.text" +msgstr "你需要一个 `if` 语句。" + +#. https://futurecoder.io/course/#UsingBreak +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.list_contains_exercise +msgid "pages.UsingBreak.steps.list_contains_exercise.hints.2.text" +msgstr "你需要一个比较运算符。" + +#. https://futurecoder.io/course/#UsingBreak +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.list_contains_exercise +msgid "pages.UsingBreak.steps.list_contains_exercise.hints.3.text" +msgstr "具体来说是 `==`。" + +#. https://futurecoder.io/course/#UsingBreak +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.list_contains_exercise +msgid "pages.UsingBreak.steps.list_contains_exercise.hints.4.text" +msgstr "你需要一个布尔变量，最后打印出来。" + +#. https://futurecoder.io/course/#UsingBreak +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.list_contains_exercise +msgid "pages.UsingBreak.steps.list_contains_exercise.hints.5.text" +msgstr "如果你在列表中找到元素，你应该把那个变量设置为 `True`。" + +#. https://futurecoder.io/course/#UsingBreak +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.list_contains_exercise +msgid "pages.UsingBreak.steps.list_contains_exercise.hints.6.text" +msgstr "一旦你找到了元素，就不能再“找不到”它了。" + +#. https://futurecoder.io/course/#UsingBreak +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.list_contains_exercise +msgid "pages.UsingBreak.steps.list_contains_exercise.hints.7.text" +msgstr "这意味着一旦你把变量设置为 `True`，之后就不应该再设置为其他任何值。" + +#. https://futurecoder.io/course/#UsingBreak +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.list_contains_exercise +msgid "pages.UsingBreak.steps.list_contains_exercise.hints.8.text" +msgstr "不要使用 `else`。" + +#. https://futurecoder.io/course/#UsingBreak +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.list_contains_exercise +msgid "pages.UsingBreak.steps.list_contains_exercise.hints.9.text" +msgstr "在循环内部没有理由将变量设置为 `False`。" + +#. https://futurecoder.io/course/#UsingBreak +msgid "pages.UsingBreak.steps.list_contains_exercise.text" +msgstr "" +"练习：编写一个程序，接受一个列表和一个值，并检查\n" +"列表是否包含该值。例如，给定：\n" +"\n" +" __no_auto_translate__\n" +" things = ['This', 'is', 'a', 'list']\n" +" thing_to_find = 'is'\n" +"\n" +"它应该打印 `True`，但对于\n" +"\n" +" __no_auto_translate__\n" +" thing_to_find = 'other'\n" +"\n" +"它应该打印 `False`。" + +#. https://futurecoder.io/course/#UsingBreak +msgid "pages.UsingBreak.title" +msgstr "使用 `break` 提前结束循环" + +#. https://futurecoder.io/course/#UsingDictionaries +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.UsingDictionaries.steps.dna_part1.text" +msgstr "" +"不错！但你可能注意到它看起来有点别扭。为什么我们要在 `cart` 和 `quantities` 中都指定 `'dog'` 和 `'box'` 呢？\n" +"在下一页，我们将学习如何直接遍历字典的键，\n" +"这样我们就可以去掉 `cart` 参数。\n" +"\n" +"但首先，让我们再多练习一下我们学到的内容。\n" +"\n" +"[在课程早些时候](#IntroducingElif)，我们学习了如何将一条 DNA 链\n" +"转换为一条具有匹配核苷酸的新链。\n" +"这是使用函数的代码版本。它用不同的字母替换输入 `string` 中的每个字母。\n" +"\n" +" __copyable__\n" +"__code0__" + +#. https://futurecoder.io/course/#UsingDictionaries +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part2 +msgid "pages.UsingDictionaries.steps.dna_part2.hints.0.text" +msgstr "这仍然与之前的练习非常相似，只是使用了字符串而不是数字。" + +#. https://futurecoder.io/course/#UsingDictionaries +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part2 +msgid "pages.UsingDictionaries.steps.dna_part2.hints.1.text" +msgstr "你只需要考虑 `d` 的键和值。" + +#. https://futurecoder.io/course/#UsingDictionaries +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part2 +msgid "pages.UsingDictionaries.steps.dna_part2.hints.2.text" +msgstr "你需要获取正确的值来构建一个字符串以返回。" + +#. https://futurecoder.io/course/#UsingDictionaries +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part2 +msgid "pages.UsingDictionaries.steps.dna_part2.hints.3.text" +msgstr "你基本上可以用一行代码替换整个 `if/elif` 链。" + +#. https://futurecoder.io/course/#UsingDictionaries +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part2 +msgid "pages.UsingDictionaries.steps.dna_part2.hints.4.text" +msgstr "那一行只需要使用 `d` 来获取正确的值。" + +#. https://futurecoder.io/course/#UsingDictionaries +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part2 +msgid "pages.UsingDictionaries.steps.dna_part2.hints.5.text" +msgstr "记住，`d` 的键是 `string` 中的字符。" + +#. https://futurecoder.io/course/#UsingDictionaries +#. # __code0__: +#. def substitute(string, d): +#. ... +#. original = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. expected = 'TCATCGCAGGAATCAATGTCCTACCGAATA' +#. assert_equal(substitute(original, {'A': 'T', 'T': 'A', 'C': 'G', 'G': +#. 'C'}), expected) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27AGTAGCGTCCTTAGTTACAGGATGGCTTAT%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27TCATCGCAGGAATCAATGTCCTACCGAATA%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.expected +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.original +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.string +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.substitute +msgid "pages.UsingDictionaries.steps.dna_part2.text" +msgstr "" +"现在我们可以使用字典使这段代码更简洁、更通用，以便可以用于其他目的。\n" +"\n" +"你的任务是向 `substitute` 函数添加另一个参数：一个名为 `d` 的字典。\n" +"`d` 的键表示在第一个参数 `string` 中应该被 `d` 的对应值替换的字符。例如，`'A': 'T'`\n" +"意味着 `'A'` 应该被 `'T'` 替换：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"这个版本的 `substitute` 应该适用于所有 `string` 中的字符都是 `d` 中的键的参数。\n" +"不再需要 `if` 语句了！" + +#. https://futurecoder.io/course/#UsingDictionaries +msgid "pages.UsingDictionaries.steps.final_text.text" +msgstr "" +"很好！这是一个示例，说明这个函数如何用于加密和解密秘密消息：\n" +"\n" +" __copyable__\n" +" __no_auto_translate__\n" +" def substitute(string, d):\n" +" result = \"\"\n" +" for letter in string:\n" +" result += d[letter]\n" +" return result\n" +"\n" +" plaintext = 'helloworld'\n" +" encrypted = 'qpeefifmez'\n" +" letters = {'h': 'q', 'e': 'p', 'l': 'e', 'o': 'f', 'w': 'i', 'r': 'm', 'd': 'z'}\n" +" reverse = {'q': 'h', 'p': 'e', 'e': 'l', 'f': 'o', 'i': 'w', 'm': 'r', 'z': 'd'}\n" +" assert_equal(substitute(plaintext, letters), encrypted)\n" +" assert_equal(substitute(encrypted, reverse), plaintext)\n" +"\n" +"同一个函数可以在两个方向上工作，我们只需要传递不同的字典。\n" +"\n" +"这两个字典几乎是相同的，我们只是交换了每对中的键和值。\n" +"所以为了加密，我们将 `e` 替换为 `p`，而为了解密，我们将 `p` 改回 `e`。\n" +"\n" +"注意 `'e'` 在 `letters` 中既是一个键也是一个值。\n" +"\n" +"查找 `letters['e']` 意味着我们在询问 `'e'` 作为 *键* 的情况，所以它给出 `'p'`。\n" +"记住，我们不能使用 `letters` 来询问与 `'e'` 作为 *值* 相关联的键。\n" +"但在这种情况下，我们可以使用另一个字典来做到这一点：`reverse['e']` 给出 `'l'`，\n" +"而 `letters['l']` 再次给出 `'e'`。\n" +"\n" +"很快你将编写一个函数来自动创建像 `reverse` 这样的字典，\n" +"即 `reverse = swap_keys_values(letters)`。" + +#. https://futurecoder.io/course/#UsingDictionaries +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1 +msgid "pages.UsingDictionaries.steps.shopping_cart1.hints.0.text" +msgstr "记住 `prices` 是一个字典。" + +#. https://futurecoder.io/course/#UsingDictionaries +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1 +msgid "pages.UsingDictionaries.steps.shopping_cart1.hints.1.text" +msgstr "要访问字典中的值，你需要一个键。" + +#. https://futurecoder.io/course/#UsingDictionaries +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1 +msgid "pages.UsingDictionaries.steps.shopping_cart1.hints.2.text" +msgstr "`prices` 的键是 `cart` 中的项目。" + +#. https://futurecoder.io/course/#UsingDictionaries +#. # __code2__: +#. def total_cost(cart, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. result += price +#. return result +#. assert_equal( +#. total_cost( +#. ['apple', 'box', 'cat'], +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 107, +#. ) +#. # __code0__: +#. prices = {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100} +#. # __code1__: +#. prices = {'apple': 2, 'apple': 3} +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27apple%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27box%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27cat%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27dog%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.cart +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.item +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.price +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.prices +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.result +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.total_cost +msgid "pages.UsingDictionaries.steps.shopping_cart1.text" +msgstr "" +"让我们看看字典在现实生活中的应用。想象一下你正在构建一个在线购物网站。\n" +"你将所有商品的价格保存在一个字典中：\n" +"\n" +"__code0__\n" +"\n" +"在这里，你可以看到查找字典中值的一个原因可能会出现问题。\n" +"`prices[100]` 会是什么？`'dog'`？`'cat'`？`['dog', 'cat']`？\n" +"同样的值可以在字典中重复任意次数。\n" +"另一方面，键必须是唯一的。想象一下，如果你的价格是这样开始的：\n" +"\n" +"__code1__\n" +"\n" +"一个苹果多少钱？我们知道是 `prices['apple']`，但那是 `2` 还是 `3`？\n" +"显然应该只有一个价格，所以不允许重复键。\n" +"\n" +"无论如何，这是一个正常的商店，东西有一个价格。\n" +"这个正常的商店有正常的顾客，他们的购物清单是 `['apple', 'box', 'cat']`。\n" +"尽管你的顾客口袋里有计算器，他们仍然希望你自己加总所有价格\n" +"并告诉他们这将花费多少，因为这就是正常商店所做的。\n" +"\n" +"所以让我们写一个函数来做到这一点。完成下面的函数，特别是 `price = ...` 这一行。\n" +"\n" +" __copyable__\n" +"__code2__" + +#. https://futurecoder.io/course/#UsingDictionaries +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4 +msgid "pages.UsingDictionaries.steps.shopping_cart4.hints.0.text" +msgstr "记住 `prices` 和 `quantities` 的键是相同的。" + +#. https://futurecoder.io/course/#UsingDictionaries +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4 +msgid "pages.UsingDictionaries.steps.shopping_cart4.hints.1.text" +msgstr "这与之前的练习非常相似，我们只是在练习。" + +#. https://futurecoder.io/course/#UsingDictionaries +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4 +msgid "pages.UsingDictionaries.steps.shopping_cart4.hints.2.text" +msgstr "`price` 应该是 `prices` 中的一个值，`quantity` 也是类似的。" + +#. https://futurecoder.io/course/#UsingDictionaries +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4 +msgid "pages.UsingDictionaries.steps.shopping_cart4.hints.3.text" +msgstr "应该使用哪个键来获取每个值？" + +#. https://futurecoder.io/course/#UsingDictionaries +#. # __code0__: +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. quantity = ... +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. ['dog', 'box'], +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27apple%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27box%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27cat%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27dog%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.assert_equal +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.cart +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.item +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.price +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.prices +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.quantities +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.quantity +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.result +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.total_cost +msgid "pages.UsingDictionaries.steps.shopping_cart4.text" +msgstr "" +"完美！你发布了你的网站，开始梦想自己会变得多富有。\n" +"\n" +"但很快你收到了一位顾客的投诉，他想买 500 万只狗……还有 2 个箱子来放它们。\n" +"\n" +"你的网站允许多次购买相同的商品，例如 `total_cost(['box', 'box'], {...})` 可以工作，\n" +"但他们必须逐个添加每个项目，出于某种原因，这位顾客不想点击\n" +"'添加到购物车' 500 万次。人们真是太懒了！\n" +"\n" +"这是你需要修复的新代码：\n" +"\n" +" __copyable__\n" +"__code0__\n" +"\n" +"我们向 `total_cost` 添加了另一个参数，称为 `quantities`。\n" +"现在 `cart` 仍然是一个字符串列表，但没有任何重复。\n" +"`quantities` 是一个字典，其中的键是 `cart` 中的项目，而对应的值是顾客想要购买的该项目的数量。" + +#. https://futurecoder.io/course/#UsingDictionaries +msgid "pages.UsingDictionaries.title" +msgstr "在实践中使用字典" + +#. https://futurecoder.io/course/#UsingVariables +msgid "pages.UsingVariables.steps.final_text.text" +msgstr "" +"太好了！再也不用引号了！我们稍后会详细讲解这段代码发生了什么。现在只需知道 `print()` 会在终端显示 " +"``。特别是，它会显示我们通常关心的字符串的实际内容，而不是适合代码的字符串表示形式，例如带引号的内容。这里的 `print` " +"与在纸上印刷无关。" + +#. https://futurecoder.io/course/#UsingVariables +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.UsingVariables.steps.first_print.text" +msgstr "" +"字符串周围的引号真让人烦。试试运行这个：\n" +"\n" +"__code0__" + +#. https://futurecoder.io/course/#UsingVariables +msgid "pages.UsingVariables.steps.goodbye_plus_name.text" +msgstr "现在通过再次运行 `__program__` 来观察这个变化的效果。" + +#. https://futurecoder.io/course/#UsingVariables +msgid "pages.UsingVariables.steps.hello_plus_name.text" +msgstr "" +"你可以像使用字面量一样在计算中使用变量。例如，试试：\n" +"\n" +"__program_indented__" + +#. https://futurecoder.io/course/#UsingVariables +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.name_assign +msgid "" +"pages.UsingVariables.steps.name_assign.messages.assigned_something_else.text" +msgstr "在 `=` 前面放上 `your_name` 来创建一个名为 `your_name` 的变量。" + +#. https://futurecoder.io/course/#UsingVariables +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.name_assign +msgid "pages.UsingVariables.steps.name_assign.messages.empty_string.text" +msgstr "在这个练习中，选择一个非空字符串。" + +#. https://futurecoder.io/course/#UsingVariables +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.name_assign +msgid "" +"pages.UsingVariables.steps.name_assign.messages.name_equals_something_else.text" +msgstr "你已经把 `your_name = ` 部分写对了，现在在 `=` 的右边放一个字符串（使用引号）。" + +#. https://futurecoder.io/course/#UsingVariables +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.name_assign +msgid "pages.UsingVariables.steps.name_assign.messages.starts_with_space.text" +msgstr "在这个练习中，选择一个不以空格开头的名字。" + +#. https://futurecoder.io/course/#UsingVariables +msgid "pages.UsingVariables.steps.name_assign.requirements" +msgstr "运行类似于 `word = 'Hello'` 的代码，但将 `word` 替换为 `your_name`。" + +#. https://futurecoder.io/course/#UsingVariables +#. # __code0__: +#. word = 'Hello' +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.%27Hello%27 +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.word +msgid "pages.UsingVariables.steps.name_assign.text" +msgstr "" +"之前我们用这段代码创建了一个名为 `word` 的变量，值为 `'Hello'`：\n" +"\n" +"__code0__\n" +"\n" +"现在创建一个名为 `your_name` 的变量，其值是另一个字符串。\n" +"\n" +"(在 `your_name` 中的字符 `_` 被称为 *下划线*。当你想要一个包含多个单词的变量名时，可以用它来分隔单词。大多数键盘上可以通过按 Shift 和连字符/破折号/减号 (`-`) 输入。)" + +#. https://futurecoder.io/course/#UsingVariables +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.UsingVariables.steps.word_assign_goodbye.text" +msgstr "" +"完美！\n" +"\n" +"变量的值也可以随着时间改变。现在 `word` 的值是 `'Hello'`。你可以用与第一次设置相同的方式更改它的值。运行这个：\n" +"\n" +"__code0__" + +#. https://futurecoder.io/course/#UsingVariables +msgid "" +"pages.UsingVariables.steps.word_plus_name.special_messages.bad_word.text" +msgstr "哎呀，你需要先设置 `word = 'Hello'`，然后我们才能继续。" + +#. https://futurecoder.io/course/#UsingVariables +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.UsingVariables.steps.word_plus_name.text" +msgstr "" +"或者你可以直接把变量加在一起。试试：\n" +"\n" +"__code0__" + +#. https://futurecoder.io/course/#UsingVariables +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.word_plus_name_with_space +msgid "pages.UsingVariables.steps.word_plus_name_with_space.hints.0.text" +msgstr "你需要使用 `+` 两次，就像 1+2+3 一样。" + +#. https://futurecoder.io/course/#UsingVariables +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.word_plus_name_with_space +msgid "pages.UsingVariables.steps.word_plus_name_with_space.hints.1.text" +msgstr "你的答案应该包含变量（没有引号）和字符串字面量（有引号）的混合。" + +#. https://futurecoder.io/course/#UsingVariables +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.word_plus_name_with_space +msgid "pages.UsingVariables.steps.word_plus_name_with_space.hints.2.text" +msgstr "你需要在引号内有一个空格字符。" + +#. https://futurecoder.io/course/#UsingVariables +msgid "" +"pages.UsingVariables.steps.word_plus_name_with_space.special_messages.bad_word.text" +msgstr "哎呀，你需要先设置 `word = 'Hello'`，然后我们才能继续。" + +#. https://futurecoder.io/course/#UsingVariables +msgid "pages.UsingVariables.steps.word_plus_name_with_space.text" +msgstr "哎呀……这看起来不太好。你能修改上面的代码，使单词和你的名字之间有一个空格吗？" + +#. https://futurecoder.io/course/#UsingVariables +msgid "pages.UsingVariables.title" +msgstr "使用变量和 `print()`" + +#. https://futurecoder.io/course/#WritingPrograms +#. # __code0__: +#. __program_indented__ +#. https://poeditor.com/projects/view_terms?id=490053&search=code_bits.__program_indented__ +msgid "pages.WritingPrograms.steps.editor_hello_world.text" +msgstr "" +"是时候停止在 shell 中做所有事情了。在右上角，你可以看到 *editor*。这是一个可以编写和运行更长程序的地方。shell 很棒，你应该继续使用它来探索，但 editor 才是真正的程序所在。\n" +"\n" +"在 editor 中输入下面的程序，然后点击 '运行' 按钮：\n" +"\n" +"__code0__" + +#. https://futurecoder.io/course/#WritingPrograms +msgid "pages.WritingPrograms.steps.final_text.text" +msgstr "" +"恭喜你，成功运行了你的第一个实际程序！\n" +"\n" +"花点时间理解这个程序。Python 会从上到下逐行运行每一行。你应该试着在脑海中模拟这个过程——想想每一行做了什么。看看 `word` 的值是如何变化的，以及这有什么影响。注意，当 `print` 被多次使用时，每个内容（在这个例子中是 `Hello World` 和 `Goodbye World`）都会单独打印在一行上。\n" +"\n" +"关于 editor 中的程序，有几点需要注意：\n" +"\n" +"1. 程序在 shell 中运行，这意味着在程序中定义的变量现在在 shell 中存在，并且具有它们在程序中最后的值。这让你在程序完成后可以在 shell 中进行探索。例如，`name` 现在在 shell 中的值是 `'World'`。\n" +"2. 程序在隔离中运行——它们不依赖于任何先前定义的变量。shell 会被重置，所有之前的变量都会被清除。所以即使 `word` 目前在 shell 中存在，如果你删除程序的第一行并再次运行，你会得到一个关于 `word` 未定义的错误。\n" +"3. 如果你在 shell 中输入代码并且它有值，该值会自动显示。对于 editor 中的程序则不会发生这种情况——你必须打印值。如果你从程序中移除 `print()`，将这两行改为 `word + ' ' + name`，什么也不会显示。\n" +"\n" +"我建议你亲自检查这些内容。" + +#. https://futurecoder.io/course/#WritingPrograms +msgid "pages.WritingPrograms.title" +msgstr "编写程序" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings.requirements +#. name + " went to " + meal + " with " + friend + '.' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings.text +#. name = "Alice" +#. friend = 'Bob' +#. meal = "lunch" +#. print(name + " went to " + meal + " with " + friend + '.') +msgid "code_bits.\" went to \"" +msgstr "\" went to \"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings.requirements +#. name + " went to " + meal + " with " + friend + '.' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings.text +#. name = "Alice" +#. friend = 'Bob' +#. meal = "lunch" +#. print(name + " went to " + meal + " with " + friend + '.') +msgid "code_bits.\" with \"" +msgstr "\" with \"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.concatenate_string_number +#. name = "Alice" +#. age = 20 +#. print("Hello " + name + ". You are " + age + " years old.") +msgid "code_bits.\" years old.\"" +msgstr "\" years old.\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise.text +#. assert_equal(alert("Warning", 2), "!! Warning !!") +#. assert_equal(alert("DANGER", 4), "!!!! DANGER !!!!") +msgid "code_bits.\"!! Warning !!\"" +msgstr "\"!! Warning !!\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise.text +#. assert_equal(alert("Warning", 2), "!! Warning !!") +#. assert_equal(alert("DANGER", 4), "!!!! DANGER !!!!") +msgid "code_bits.\"!!!! DANGER !!!!\"" +msgstr "\"!!!! DANGER !!!!\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.surround_exercise.text +#. assert_equal(surround("more", "++"), "++more++") +#. assert_equal(surround("the same", "="), "=the same=") +msgid "code_bits.\"++more++\"" +msgstr "\"++more++\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.concatenate_string_number +#. name = "Alice" +#. age = 20 +#. print("Hello " + name + ". You are " + age + " years old.") +msgid "code_bits.\". You are \"" +msgstr "\". You are \"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority +#. def invalid_image(filename): +#. return not (filename.endswith(".png") or filename.endswith(".jpg")) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.hints.0.text +#. def valid_image(filename): +#. if filename.endswith(".png") or filename.endswith(".jpg"): +#. return True +#. else: +#. return False +#. assert_equal(valid_image("dog.png"), True) +#. assert_equal(valid_image("cat.jpg"), True) +#. assert_equal(valid_image("invoice.pdf"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.hints.3.text +#. def valid_image(filename): +#. return filename.endswith(".png") or filename.endswith(".jpg") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.text +#. def invalid_image(filename): +#. if filename.endswith(".png") or filename.endswith(".jpg"): +#. return False +#. else: +#. return True +#. assert_equal(invalid_image("dog.png"), False) +#. assert_equal(invalid_image("cat.jpg"), False) +#. assert_equal(invalid_image("invoice.pdf"), True) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.final_text.text +#. def invalid_image(filename): +#. return not (filename.endswith(".png") or filename.endswith(".jpg")) +#. def invalid_image(filename): +#. return not filename.endswith(".png") and not +#. filename.endswith(".jpg") +msgid "code_bits.\".jpg\"" +msgstr "\".jpg\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority +#. def invalid_image(filename): +#. return not (filename.endswith(".png") or filename.endswith(".jpg")) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.hints.0.text +#. def valid_image(filename): +#. if filename.endswith(".png") or filename.endswith(".jpg"): +#. return True +#. else: +#. return False +#. assert_equal(valid_image("dog.png"), True) +#. assert_equal(valid_image("cat.jpg"), True) +#. assert_equal(valid_image("invoice.pdf"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.hints.3.text +#. def valid_image(filename): +#. return filename.endswith(".png") or filename.endswith(".jpg") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.text +#. def invalid_image(filename): +#. if filename.endswith(".png") or filename.endswith(".jpg"): +#. return False +#. else: +#. return True +#. assert_equal(invalid_image("dog.png"), False) +#. assert_equal(invalid_image("cat.jpg"), False) +#. assert_equal(invalid_image("invoice.pdf"), True) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.final_text.text +#. def invalid_image(filename): +#. return not (filename.endswith(".png") or filename.endswith(".jpg")) +#. def invalid_image(filename): +#. return not filename.endswith(".png") and not +#. filename.endswith(".jpg") +msgid "code_bits.\".png\"" +msgstr "\".png\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.surround_exercise.text +#. assert_equal(surround("more", "++"), "++more++") +#. assert_equal(surround("the same", "="), "=the same=") +msgid "code_bits.\"=the same=\"" +msgstr "\"=the same=\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.first_nested_loop +#. for letter in "ABC": +#. print(letter) +#. for number in range(4): +#. print(f'{letter} {number}') +#. print('---') +msgid "code_bits.\"ABC\"" +msgstr "\"ABC\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.crack_password_exercise.text +#. letters = "ABCD" +msgid "code_bits.\"ABCD\"" +msgstr "\"ABCD\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_function_name +#. def say_hello(name): +#. print(f"Hello {name}!") +#. print("How are you?") +#. say_hello("Alice") +#. say_hello("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_function_name.text +#. name = "Alice" +#. print(f"Hello {name}!") +#. print("How are you?") +#. name = "Bob" +#. print(f"Hello {name}!") +#. print("How are you?") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_parameter_name +#. def say_hello(person_name): +#. print(f"Hello {person_name}!") +#. print("How are you?") +#. say_hello("Alice") +#. say_hello("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.define_greet +#. def greet(name): +#. print(f"Hello {name}!") +#. greet("Alice") +#. greet("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.how_are_you +#. def greet(name): +#. print(f"Hello {name}!") +#. print("How are you?") +#. greet("Alice") +#. greet("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.basic_f_string_exercise +#. name = "Alice" +#. age = 20 +#. print(f'Hello {name}. You are {age} years old.') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.concatenate_string_number +#. name = "Alice" +#. age = 20 +#. print("Hello " + name + ". You are " + age + " years old.") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings +#. name = "Alice" +#. friend = 'Bob' +#. meal = "lunch" +#. print(f"{name} went to {meal} with {friend}.") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings.text +#. name = "Alice" +#. friend = 'Bob' +#. meal = "lunch" +#. print(name + " went to " + meal + " with " + friend + '.') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_exercise.text +#. players = ["Alice", "Bob", "Charlie"] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ACommonMistake +#. def is_friend(name): +#. return name == "Alice" or "Bob" +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ACommonMistake.requirements +#. return name == "Alice" or "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ACommonMistake.requirements +#. return name == "Alice" or name == "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ACommonMistake.text +#. return name == "Alice" or "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ACommonMistake.text +#. return name == "Alice" or name == "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise.text +#. (name == "Alice") or ("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise.text +#. name == "Alice" or "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise.text +#. name == ("Alice" or "Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise.text +#. return name in ["Alice", "Bob", "Charlie"] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.FurtherImprovement +#. def is_friend(name): +#. return name == "Alice" or name == "Bob" +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.FurtherImprovement.requirements +#. if name == "Alice" or name == "Bob": +#. return True +#. else: +#. return False +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.FurtherImprovement.requirements +#. return name == "Alice" or name == "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.FurtherImprovement.text +#. name == "Alice" or name == "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ImprovingWithOr +#. def is_friend(name): +#. if name == "Alice" or name == "Bob": +#. return True +#. else: +#. return False +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ImprovingWithOr.text +#. if name == "Alice" or name == "Bob": +#. return True +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ImprovingWithOr.text +#. if name == "Alice": +#. return True +#. elif name == "Bob": +#. return True +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.InputAliceBob +#. def is_friend(name): +#. if name == "Alice": +#. return True +#. elif name == "Bob": +#. return True +#. else: +#. return False +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.InspectWithBirdseye +#. def is_friend(name): +#. return name == "Alice" or "Bob" +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MultiLineExpressions.steps.valid_multiline +#. name = "Bob" +#. is_friend = name == "Alice" or \ +#. name == "Bob" +#. print(is_friend) +#. is_friend = (name == "Alice" or +#. name == "Bob") +#. print(is_friend) +#. is_friend = [name == "Alice", +#. name == "Bob"] +#. print(is_friend) +#. print(name == "Alice" or +#. name == "Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.SingleAndDoubleQuotesInStrings.steps.single_double_quotes_equal +#. 'Alice' == "Alice" +msgid "code_bits.\"Alice\"" +msgstr "\"Alice\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.SingleAndDoubleQuotesInStrings.steps.double_quotes +#. print("Alice's Diner") +msgid "code_bits.\"Alice's Diner\"" +msgstr "\"Alice's Diner\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.convert_input_to_int +#. super_secret_number = 7 +#. print("What number am I thinking of?") +#. guess = input() +#. if int(guess) == super_secret_number: +#. print("Amazing! Are you psychic?") +#. else: +#. print("Nope!") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.convert_input_to_int.text +#. super_secret_number = 7 +#. print("What number am I thinking of?") +#. guess = input() +#. if guess == super_secret_number: +#. print("Amazing! Are you psychic?") +#. else: +#. print("Nope!") +msgid "code_bits.\"Amazing! Are you psychic?\"" +msgstr "\"Amazing! Are you psychic?\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_function_name +#. def say_hello(name): +#. print(f"Hello {name}!") +#. print("How are you?") +#. say_hello("Alice") +#. say_hello("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_function_name.text +#. name = "Alice" +#. print(f"Hello {name}!") +#. print("How are you?") +#. name = "Bob" +#. print(f"Hello {name}!") +#. print("How are you?") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_parameter_name +#. def say_hello(person_name): +#. print(f"Hello {person_name}!") +#. print("How are you?") +#. say_hello("Alice") +#. say_hello("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.define_greet +#. def greet(name): +#. print(f"Hello {name}!") +#. greet("Alice") +#. greet("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.how_are_you +#. def greet(name): +#. print(f"Hello {name}!") +#. print("How are you?") +#. greet("Alice") +#. greet("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_exercise.text +#. players = ["Alice", "Bob", "Charlie"] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ACommonMistake +#. def is_friend(name): +#. return name == "Alice" or "Bob" +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ACommonMistake.requirements +#. return name == "Alice" or "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ACommonMistake.requirements +#. return name == "Alice" or name == "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ACommonMistake.text +#. return name == "Alice" or "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ACommonMistake.text +#. return name == "Alice" or name == "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise.text +#. (name == "Alice") or ("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise.text +#. name == "Alice" or "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise.text +#. name == ("Alice" or "Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise.text +#. return name in ["Alice", "Bob", "Charlie"] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.FurtherImprovement +#. def is_friend(name): +#. return name == "Alice" or name == "Bob" +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.FurtherImprovement.requirements +#. if name == "Alice" or name == "Bob": +#. return True +#. else: +#. return False +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.FurtherImprovement.requirements +#. return name == "Alice" or name == "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.FurtherImprovement.text +#. name == "Alice" or name == "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ImprovingWithOr +#. def is_friend(name): +#. if name == "Alice" or name == "Bob": +#. return True +#. else: +#. return False +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ImprovingWithOr.text +#. if name == "Alice" or name == "Bob": +#. return True +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ImprovingWithOr.text +#. if name == "Alice": +#. return True +#. elif name == "Bob": +#. return True +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.InputAliceBob +#. def is_friend(name): +#. if name == "Alice": +#. return True +#. elif name == "Bob": +#. return True +#. else: +#. return False +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.InspectWithBirdseye +#. def is_friend(name): +#. return name == "Alice" or "Bob" +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MultiLineExpressions.steps.valid_multiline +#. name = "Bob" +#. is_friend = name == "Alice" or \ +#. name == "Bob" +#. print(is_friend) +#. is_friend = (name == "Alice" or +#. name == "Bob") +#. print(is_friend) +#. is_friend = [name == "Alice", +#. name == "Bob"] +#. print(is_friend) +#. print(name == "Alice" or +#. name == "Bob") +msgid "code_bits.\"Bob\"" +msgstr "\"Bob\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_exercise.text +#. players = ["Alice", "Bob", "Charlie"] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ACommonMistake +#. def is_friend(name): +#. return name == "Alice" or "Bob" +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise.text +#. return name in ["Alice", "Bob", "Charlie"] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.FurtherImprovement +#. def is_friend(name): +#. return name == "Alice" or name == "Bob" +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ImprovingWithOr +#. def is_friend(name): +#. if name == "Alice" or name == "Bob": +#. return True +#. else: +#. return False +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.InputAliceBob +#. def is_friend(name): +#. if name == "Alice": +#. return True +#. elif name == "Bob": +#. return True +#. else: +#. return False +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.InspectWithBirdseye +#. def is_friend(name): +#. return name == "Alice" or "Bob" +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +msgid "code_bits.\"Charlie\"" +msgstr "\"Charlie\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise.text +#. assert_equal(alert("Warning", 2), "!! Warning !!") +#. assert_equal(alert("DANGER", 4), "!!!! DANGER !!!!") +msgid "code_bits.\"DANGER\"" +msgstr "\"DANGER\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_french +#. def print_words(french): +#. for word in french: +#. print("English: " + word) +#. print("French: " + french[word]) +#. print("---") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german +#. def print_words(french, german): +#. for word in french: +#. print("English: " + word) +#. print("French: " + french[word]) +#. print("German: " + german[word]) +#. print("---") +msgid "code_bits.\"English: \"" +msgstr "\"English: \"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_french +#. def print_words(french): +#. for word in french: +#. print("English: " + word) +#. print("French: " + french[word]) +#. print("---") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german +#. def print_words(french, german): +#. for word in french: +#. print("English: " + word) +#. print("French: " + french[word]) +#. print("German: " + german[word]) +#. print("---") +msgid "code_bits.\"French: \"" +msgstr "\"French: \"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german +#. def print_words(french, german): +#. for word in french: +#. print("English: " + word) +#. print("French: " + french[word]) +#. print("German: " + german[word]) +#. print("---") +msgid "code_bits.\"German: \"" +msgstr "\"German: \"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.concatenate_string_number +#. name = "Alice" +#. age = 20 +#. print("Hello " + name + ". You are " + age + " years old.") +msgid "code_bits.\"Hello \"" +msgstr "\"Hello \"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsWithinFunctions.steps.print_twice_call_print_many +#. def print_many(n, thing): +#. for _ in range(n): +#. print(thing) +#. def print_twice(x): +#. print_many(2, x) +#. print_twice("Hello") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsWithinFunctions.steps.see_stack_in_birdseye +#. def print_many(n, thing): +#. for _ in range(n): +#. print(thing) +#. def print_twice(x): +#. print_many(2, x) +#. print_twice("Hello") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsWithinFunctions.steps.see_stack_in_pythontutor +#. def print_many(n, thing): +#. for _ in range(n): +#. print(thing) +#. def print_twice(x): +#. print_many(2, x) +#. print_twice("Hello") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsWithinFunctions.steps.see_stack_in_snoop +#. def print_many(n, thing): +#. for _ in range(n): +#. print(thing) +#. def print_twice(x): +#. print_many(2, x) +#. print_twice("Hello") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.print_many +#. def print_many(thing, n): +#. for _ in range(n): +#. print(thing) +#. print_many("Hello", 3) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.swap_parameters +#. def print_many(n, thing): +#. for _ in range(n): +#. print(thing) +#. print_many(3, "Hello") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.swap_parameters.text +#. thing = "Hello" +#. n = 3 +#. for _ in range(n): +#. print(thing) +msgid "code_bits.\"Hello\"" +msgstr "\"Hello\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_function_name +#. def say_hello(name): +#. print(f"Hello {name}!") +#. print("How are you?") +#. say_hello("Alice") +#. say_hello("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_function_name.text +#. name = "Alice" +#. print(f"Hello {name}!") +#. print("How are you?") +#. name = "Bob" +#. print(f"Hello {name}!") +#. print("How are you?") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_parameter_name +#. def say_hello(person_name): +#. print(f"Hello {person_name}!") +#. print("How are you?") +#. say_hello("Alice") +#. say_hello("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.how_are_you +#. def greet(name): +#. print(f"Hello {name}!") +#. print("How are you?") +#. greet("Alice") +#. greet("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.how_are_you.text +#. def greet(name): +#. print(f"Hello {name}!") +#. print("How are you?") +msgid "code_bits.\"How are you?\"" +msgstr "\"How are you?\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.text +#. if invalid_image(filename): +#. print("I can't process " + filename) +msgid "code_bits.\"I can't process \"" +msgstr "\"I can't process \"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.\"It's a draw!\"" +msgstr "\"It's a draw!\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.convert_input_to_int +#. super_secret_number = 7 +#. print("What number am I thinking of?") +#. guess = input() +#. if int(guess) == super_secret_number: +#. print("Amazing! Are you psychic?") +#. else: +#. print("Nope!") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.convert_input_to_int.text +#. super_secret_number = 7 +#. print("What number am I thinking of?") +#. guess = input() +#. if guess == super_secret_number: +#. print("Amazing! Are you psychic?") +#. else: +#. print("Nope!") +msgid "code_bits.\"Nope!\"" +msgstr "\"Nope!\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.introducing_assert_equal.text +#. def assert_equal(actual, expected): +#. if actual == expected: +#. print("OK") +#. else: +#. print(f"Error! {repr(actual)} != {repr(expected)}") +msgid "code_bits.\"OK\"" +msgstr "\"OK\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StringMethodsUnderstandingMutation.steps.string_lower_upper +#. sentence = "Python rocks!" +#. new_sentence = sentence.upper() +#. print(sentence) +#. print(new_sentence) +msgid "code_bits.\"Python rocks!\"" +msgstr "\"Python rocks!\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "Python" +msgid "code_bits.\"Python\"" +msgstr "\"Python\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.SingleAndDoubleQuotesInStrings.steps.double_quote_exercise +#. print("Special cases aren't special enough to break the rules.") +msgid "code_bits.\"Special cases aren't special enough to break the rules.\"" +msgstr "\"Special cases aren't special enough to break the rules.\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise.text +#. assert_equal(alert("Warning", 2), "!! Warning !!") +#. assert_equal(alert("DANGER", 4), "!!!! DANGER !!!!") +msgid "code_bits.\"Warning\"" +msgstr "\"Warning\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.convert_input_to_int +#. super_secret_number = 7 +#. print("What number am I thinking of?") +#. guess = input() +#. if int(guess) == super_secret_number: +#. print("Amazing! Are you psychic?") +#. else: +#. print("Nope!") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.convert_input_to_int.text +#. super_secret_number = 7 +#. print("What number am I thinking of?") +#. guess = input() +#. if guess == super_secret_number: +#. print("Amazing! Are you psychic?") +#. else: +#. print("Nope!") +msgid "code_bits.\"What number am I thinking of?\"" +msgstr "\"What number am I thinking of?\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input.text +#. def format_board(board): +#. first_row = ' ' +#. for i in range(len(board)): +#. first_row += str(i + 1) +#. joined_rows = [first_row] +#. for i in range(len(board)): +#. joined_row = str(i + 1) + ''.join(board[i]) +#. joined_rows.append(joined_row) +#. return "\n".join(joined_rows) +#. def play_game(): +#. board = [ +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ] +#. print(format_board(board)) +#. print('\nX to play:\n') +#. play_move(board, 'X') +#. print(format_board(board)) +#. print('\nO to play:\n') +#. play_move(board, 'O') +#. print(format_board(board)) +#. def play_move(board, player): +#. ... +#. play_game() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.text +#. def format_board(board): +#. joined_rows = [] +#. for row in board: +#. joined_rows.append("".join(row)) +#. return "\n".join(joined_rows) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.format_board_with_numbers +#. def format_board(board): +#. first_row = ' ' +#. for i in range(len(board)): +#. first_row += str(i + 1) +#. joined_rows = [first_row] +#. for i in range(len(board)): +#. joined_row = str(i + 1) + ''.join(board[i]) +#. joined_rows.append(joined_row) +#. return "\n".join(joined_rows) +msgid "code_bits.\"\\n\"" +msgstr "\"\\n\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.double_subscripting +#. strings = ["abc", "def", "ghi"] +#. print(strings[1][0]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.string_list_exercise.text +#. strings = ["abc", "def", "ghi"] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_strings_list_exercise.text +#. strings = ["abc", "def", "ghi"] +msgid "code_bits.\"abc\"" +msgstr "\"abc\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.hints.0.text +#. def valid_image(filename): +#. if filename.endswith(".png") or filename.endswith(".jpg"): +#. return True +#. else: +#. return False +#. assert_equal(valid_image("dog.png"), True) +#. assert_equal(valid_image("cat.jpg"), True) +#. assert_equal(valid_image("invoice.pdf"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.text +#. def invalid_image(filename): +#. if filename.endswith(".png") or filename.endswith(".jpg"): +#. return False +#. else: +#. return True +#. assert_equal(invalid_image("dog.png"), False) +#. assert_equal(invalid_image("cat.jpg"), False) +#. assert_equal(invalid_image("invoice.pdf"), True) +msgid "code_bits.\"cat.jpg\"" +msgstr "\"cat.jpg\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.double_subscripting +#. strings = ["abc", "def", "ghi"] +#. print(strings[1][0]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.string_list_exercise.text +#. strings = ["abc", "def", "ghi"] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_strings_list_exercise.text +#. strings = ["abc", "def", "ghi"] +msgid "code_bits.\"def\"" +msgstr "\"def\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.hints.0.text +#. def valid_image(filename): +#. if filename.endswith(".png") or filename.endswith(".jpg"): +#. return True +#. else: +#. return False +#. assert_equal(valid_image("dog.png"), True) +#. assert_equal(valid_image("cat.jpg"), True) +#. assert_equal(valid_image("invoice.pdf"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.text +#. def invalid_image(filename): +#. if filename.endswith(".png") or filename.endswith(".jpg"): +#. return False +#. else: +#. return True +#. assert_equal(invalid_image("dog.png"), False) +#. assert_equal(invalid_image("cat.jpg"), False) +#. assert_equal(invalid_image("invoice.pdf"), True) +msgid "code_bits.\"dog.png\"" +msgstr "\"dog.png\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.double_subscripting +#. strings = ["abc", "def", "ghi"] +#. print(strings[1][0]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.string_list_exercise.text +#. strings = ["abc", "def", "ghi"] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_strings_list_exercise.text +#. strings = ["abc", "def", "ghi"] +msgid "code_bits.\"ghi\"" +msgstr "\"ghi\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "Python" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "hello" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "goodbye" +msgid "code_bits.\"goodbye world\"" +msgstr "\"goodbye world\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "goodbye" +msgid "code_bits.\"goodbye\"" +msgstr "\"goodbye\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "Python" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "hello" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "goodbye" +msgid "code_bits.\"hello there\"" +msgstr "\"hello there\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "Python" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "hello" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "goodbye" +msgid "code_bits.\"hello world\"" +msgstr "\"hello world\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "hello" +msgid "code_bits.\"hello\"" +msgstr "\"hello\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "Python" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "hello" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "goodbye" +msgid "code_bits.\"how are you\"" +msgstr "\"how are you\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.hints.0.text +#. def valid_image(filename): +#. if filename.endswith(".png") or filename.endswith(".jpg"): +#. return True +#. else: +#. return False +#. assert_equal(valid_image("dog.png"), True) +#. assert_equal(valid_image("cat.jpg"), True) +#. assert_equal(valid_image("invoice.pdf"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.text +#. def invalid_image(filename): +#. if filename.endswith(".png") or filename.endswith(".jpg"): +#. return False +#. else: +#. return True +#. assert_equal(invalid_image("dog.png"), False) +#. assert_equal(invalid_image("cat.jpg"), False) +#. assert_equal(invalid_image("invoice.pdf"), True) +msgid "code_bits.\"invoice.pdf\"" +msgstr "\"invoice.pdf\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings +#. name = "Alice" +#. friend = 'Bob' +#. meal = "lunch" +#. print(f"{name} went to {meal} with {friend}.") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings.text +#. name = "Alice" +#. friend = 'Bob' +#. meal = "lunch" +#. print(name + " went to " + meal + " with " + friend + '.') +msgid "code_bits.\"lunch\"" +msgstr "\"lunch\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.surround_exercise.text +#. assert_equal(surround("more", "++"), "++more++") +#. assert_equal(surround("the same", "="), "=the same=") +msgid "code_bits.\"more\"" +msgstr "\"more\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.surround_exercise.text +#. assert_equal(surround("more", "++"), "++more++") +#. assert_equal(surround("the same", "="), "=the same=") +msgid "code_bits.\"the same\"" +msgstr "\"the same\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.final_text.text +#. strings[1].append("today?") +msgid "code_bits.\"today?\"" +msgstr "\"today?\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.format_board_with_numbers.text +#. def format_board(board): +#. ... +#. assert_equal( +#. format_board([ +#. ['X', 'O', 'X'], +#. ['O', ' ', ' '], +#. [' ', 'X', 'O'] +#. ]), +#. ' 123\n1XOX\n2O \n3 XO' +#. ) +msgid "code_bits.' 123\\n1XOX\\n2O \\n3 XO'" +msgstr "' 123\\n1XOX\\n2O \\n3 XO'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StringMethodsUnderstandingMutation.steps.mutation_string_append +#. 'Python'.append(' is cool!') +msgid "code_bits.' is cool!'" +msgstr "' is cool!'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.AddingStrings.steps.final_text.text +#. 'hello ' + 'world' +#. 'hello' + ' world' +#. 'hello' + ' ' + 'world' +msgid "code_bits.' world'" +msgstr "' world'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.SingleAndDoubleQuotesInStrings.steps.single_quote_exercise +#. print('"Talk is cheap. Show me the code." - Linus Torvalds') +msgid "code_bits.'\"Talk is cheap. Show me the code.\" - Linus Torvalds'" +msgstr "'\"Talk is cheap. Show me the code.\" - Linus Torvalds'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.crack_password_exercise +#. letters = 'AB' +#. for c1 in letters: +#. for c2 in letters: +#. for c3 in letters: +#. for c4 in letters: +#. print(c1 + c2 + c3 + c4) +msgid "code_bits.'AB'" +msgstr "'AB'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingElif.steps.dna_example +#. dna = 'AGTAGCGTC' +#. opposite_dna = '' +#. for char in dna: +#. if char == 'A': +#. char = 'T' +#. if char == 'T': +#. char = 'A' +#. if char == 'G': +#. char = 'C' +#. if char == 'C': +#. char = 'G' +#. opposite_dna += char +#. print(opposite_dna) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingElif.steps.dna_example_with_elif +#. dna = 'AGTAGCGTC' +#. opposite_dna = '' +#. for char in dna: +#. if char == 'A': +#. char = 'T' +#. elif char == 'T': +#. char = 'A' +#. elif char == 'G': +#. char = 'C' +#. elif char == 'C': +#. char = 'G' +#. opposite_dna += char +#. print(opposite_dna) +msgid "code_bits.'AGTAGCGTC'" +msgstr "'AGTAGCGTC'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingElif.steps.dna_example_with_else +#. dna = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. opposite_dna = '' +#. for char in dna: +#. if char == 'A': +#. char = 'T' +#. else: +#. if char == 'T': +#. char = 'A' +#. if char == 'G': +#. char = 'C' +#. else: +#. if char == 'C': +#. char = 'G' +#. opposite_dna += char +#. print(opposite_dna) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part1 +#. def substitute(string): +#. result = '' +#. for char in string: +#. if char == 'A': +#. char = 'T' +#. elif char == 'T': +#. char = 'A' +#. elif char == 'G': +#. char = 'C' +#. elif char == 'C': +#. char = 'G' +#. result += char +#. return result +#. original = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. expected = 'TCATCGCAGGAATCAATGTCCTACCGAATA' +#. assert_equal(substitute(original), expected) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part2.text +#. def substitute(string, d): +#. ... +#. original = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. expected = 'TCATCGCAGGAATCAATGTCCTACCGAATA' +#. assert_equal(substitute(original, {'A': 'T', 'T': 'A', 'C': 'G', 'G': +#. 'C'}), expected) +msgid "code_bits.'AGTAGCGTCCTTAGTTACAGGATGGCTTAT'" +msgstr "'AGTAGCGTCCTTAGTTACAGGATGGCTTAT'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.name_assign +#. your_name = 'Alex' +msgid "code_bits.'Alex'" +msgstr "'Alex'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.fix_broken_program +#. people = ['Alice', 'Bob', 'Charlie'] +#. print(f"There are {len(people)} people waiting, the first one's name is +#. {people[0]}.") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.final_text.text +#. players = ['Charlie', 'Alice', 'Dylan', 'Bob'] +#. for i in range(len(players)): +#. for j in range(len(players)): +#. if i < j: +#. print(f'{players[i]} vs {players[j]}') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus +#. players = ['Alice', 'Bob', 'Charlie'] +#. for i in range(len(players)): +#. for j in range(len(players)): +#. if i < j: +#. print(f'{players[i]} vs {players[j]}') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus.text +#. players = ['Charlie', 'Alice', 'Dylan', 'Bob'] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_exercise +#. players = ['Alice', 'Bob', 'Charlie'] +#. for player1 in players: +#. for player2 in players: +#. if player1 != player2: +#. print(f'{player1} vs {player2}') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.final_text.text +#. x1 = 'Charlie' +#. x2 = 'Alice' +#. x3 = 'Bob' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.SingleAndDoubleQuotesInStrings.steps.single_double_quotes_equal +#. 'Alice' == "Alice" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.SingleAndDoubleQuotesInStrings.steps.single_quotes_apostrophe.text +#. name = 'Alice' +msgid "code_bits.'Alice'" +msgstr "'Alice'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingBirdseye.steps.birdseye_loop_example +#. word = 'Amazing' +#. vowels = [] +#. consonants = [] +#. for letter in word: +#. if letter.lower() in 'aeiou': +#. vowels.append(letter) +#. else: +#. consonants.append(letter) +#. print(vowels) +#. print(consonants) +msgid "code_bits.'Amazing'" +msgstr "'Amazing'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.fix_broken_program +#. people = ['Alice', 'Bob', 'Charlie'] +#. print(f"There are {len(people)} people waiting, the first one's name is +#. {people[0]}.") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings +#. name = "Alice" +#. friend = 'Bob' +#. meal = "lunch" +#. print(f"{name} went to {meal} with {friend}.") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings.text +#. name = "Alice" +#. friend = 'Bob' +#. meal = "lunch" +#. print(name + " went to " + meal + " with " + friend + '.') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.final_text.text +#. players = ['Charlie', 'Alice', 'Dylan', 'Bob'] +#. for i in range(len(players)): +#. for j in range(len(players)): +#. if i < j: +#. print(f'{players[i]} vs {players[j]}') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus +#. players = ['Alice', 'Bob', 'Charlie'] +#. for i in range(len(players)): +#. for j in range(len(players)): +#. if i < j: +#. print(f'{players[i]} vs {players[j]}') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus.text +#. players = ['Charlie', 'Alice', 'Dylan', 'Bob'] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_exercise +#. players = ['Alice', 'Bob', 'Charlie'] +#. for player1 in players: +#. for player2 in players: +#. if player1 != player2: +#. print(f'{player1} vs {player2}') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.final_text.text +#. x1 = 'Charlie' +#. x2 = 'Alice' +#. x3 = 'Bob' +msgid "code_bits.'Bob'" +msgstr "'Bob'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.fix_broken_program +#. people = ['Alice', 'Bob', 'Charlie'] +#. print(f"There are {len(people)} people waiting, the first one's name is +#. {people[0]}.") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.final_text.text +#. players = ['Charlie', 'Alice', 'Dylan', 'Bob'] +#. for i in range(len(players)): +#. for j in range(len(players)): +#. if i < j: +#. print(f'{players[i]} vs {players[j]}') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus +#. players = ['Alice', 'Bob', 'Charlie'] +#. for i in range(len(players)): +#. for j in range(len(players)): +#. if i < j: +#. print(f'{players[i]} vs {players[j]}') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus.text +#. players = ['Charlie', 'Alice', 'Dylan', 'Bob'] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_exercise +#. players = ['Alice', 'Bob', 'Charlie'] +#. for player1 in players: +#. for player2 in players: +#. if player1 != player2: +#. print(f'{player1} vs {player2}') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.final_text.text +#. x1 = 'Charlie' +#. x2 = 'Alice' +#. x3 = 'Bob' +msgid "code_bits.'Charlie'" +msgstr "'Charlie'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.final_text.text +#. players = ['Charlie', 'Alice', 'Dylan', 'Bob'] +#. for i in range(len(players)): +#. for j in range(len(players)): +#. if i < j: +#. print(f'{players[i]} vs {players[j]}') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus.text +#. players = ['Charlie', 'Alice', 'Dylan', 'Bob'] +msgid "code_bits.'Dylan'" +msgstr "'Dylan'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.nested_dictionaries +#. def print_words(words): +#. for word in words: +#. translations = words[word] +#. print(f"English: {word}") +#. for language in translations: +#. print(f"{language}: {translations[language]}") +#. print(f"---") +#. print_words({ +#. 'apple': { +#. 'French': 'pomme', +#. 'German': 'apfel', +#. }, +#. 'box': { +#. 'French': 'boite', +#. 'German': 'kasten', +#. }, +#. }) +msgid "code_bits.'French'" +msgstr "'French'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.nested_dictionaries +#. def print_words(words): +#. for word in words: +#. translations = words[word] +#. print(f"English: {word}") +#. for language in translations: +#. print(f"{language}: {translations[language]}") +#. print(f"---") +#. print_words({ +#. 'apple': { +#. 'French': 'pomme', +#. 'German': 'apfel', +#. }, +#. 'box': { +#. 'French': 'boite', +#. 'German': 'kasten', +#. }, +#. }) +msgid "code_bits.'German'" +msgstr "'German'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.fixing_type_errors_with_conversion +#. number = '1' +#. for i in range(int(number)): +#. print('Starting... ' + str(i + 1)) +#. print('Go!') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.fixing_type_errors_with_conversion.text +#. number = '3' +#. for i in range(number): +#. print('Starting... ' + i + 1) +#. print('Go!') +msgid "code_bits.'Go!'" +msgstr "'Go!'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise +#. string1 = 'Goodbye' +#. string2 = 'World' +#. length1 = len(string1) +#. length2 = len(string2) +#. if length1 > length2: +#. length = length1 +#. else: +#. length = length2 +#. for i in range(length): +#. if i < len(string1): +#. char1 = string1[i] +#. else: +#. char1 = ' ' +#. if i < len(string2): +#. char2 = string2[i] +#. else: +#. char2 = ' ' +#. print(char1 + ' ' + char2) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_doesnt_change +#. word = 'Hello' +#. name = 'World' +#. sentence = word + ' ' + name +#. print(sentence) +#. word = 'Goodbye' +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_doesnt_change.text +#. word = 'Goodbye' +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.word_assign_goodbye +#. word = 'Goodbye' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.WritingPrograms.steps.editor_hello_world +#. word = 'Hello' +#. name = 'World' +#. print(word + ' ' + name) +#. word = 'Goodbye' +#. print(word + ' ' + name) +msgid "code_bits.'Goodbye'" +msgstr "'Goodbye'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.capitalise +#. sentence = 'HELLO THERE' +#. upper = True +#. new_sentence = '' +#. for char in sentence: +#. if upper: +#. char = char.upper() +#. else: +#. char = char.lower() +#. new_sentence += char +#. upper = False +#. print(new_sentence) +msgid "code_bits.'HELLO THERE'" +msgstr "'HELLO THERE'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.hello_plus_name +#. 'Hello ' + your_name +msgid "code_bits.'Hello '" +msgstr "'Hello '" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningCompoundStatements.steps.final_text.text +#. sentence = 'Hello World' +#. excited = True +#. new_sentence = '' +#. for char in sentence: +#. new_sentence += char +#. if excited: +#. new_sentence += '!' +#. sentence = new_sentence +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningCompoundStatements.steps.for_inside_if +#. sentence = 'Hello World' +#. excited = True +#. if excited: +#. new_sentence = '' +#. for char in sentence: +#. new_sentence += char + '!' +#. sentence = new_sentence +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.if_upper_else_lower +#. sentence = 'Hello World' +#. excited = True +#. if excited: +#. sentence = sentence.upper() +#. else: +#. sentence = sentence.lower() +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.if_upper_else_lower_false +#. sentence = 'Hello World' +#. excited = False +#. if excited: +#. sentence = sentence.upper() +#. else: +#. sentence = sentence.lower() +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.undefined_char +#. sentence = 'Hello World' +#. excited = False +#. if excited: +#. char = '!' +#. sentence += char +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.undefined_char.text +#. sentence = 'Hello World' +#. excited = True +#. if excited: +#. char = '!' +#. sentence += char +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.excited_confused_exercise.text +#. sentence = 'Hello World' +#. excited = False +#. confused = True +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.excited_example +#. sentence = 'Hello World' +#. excited = True +#. if excited: +#. sentence += '!' +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.excited_false_example +#. sentence = 'Hello World' +#. excited = False +#. if excited: +#. sentence += '!' +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.five_different_types +#. print(type('Hello World')) +#. print(type(23)) +#. print(type(True)) +#. print(type([1, 2, 3])) +#. print(type(4.56)) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_tail +#. sentence = 'Hello World' +#. include = False +#. new_sentence = '' +#. for char in sentence: +#. if include: +#. new_sentence += char +#. include = True +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_tail_snoop +#. sentence = 'Hello World' +#. include = False +#. new_sentence = '' +#. for char in sentence: +#. if include: +#. new_sentence += char +#. include = True +#. print(new_sentence) +msgid "code_bits.'Hello World'" +msgstr "'Hello World'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.else_full_stop +#. sentence = 'Hello there' +#. excited = True +#. if excited: +#. char = '!' +#. else: +#. char = '.' +#. sentence += char +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_first_character +#. sentence = 'Hello there' +#. include = True +#. new_sentence = '' +#. for char in sentence: +#. if include: +#. new_sentence += char +#. include = False +#. print(new_sentence) +msgid "code_bits.'Hello there'" +msgstr "'Hello there'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.hello_plus_equals +#. hello = 'Hello' +#. print(hello) +#. hello = hello + '!' +#. print(hello) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsTerminology.steps.methods_of_str +#. word = 'Hello' +#. print(word.upper) +#. print(word.upper()) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsTerminology.steps.no_append_for_str +#. word = 'Hello' +#. word.append('!') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_exercise +#. string1 = 'Hello' +#. string2 = 'World' +#. for i in range(len(string1)): +#. char1 = string1[i] +#. char2 = string2[i] +#. print(char1 + ' ' + char2) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.excited_confused_exercise +#. sentence = 'Hello' +#. excited = True +#. confused = True +#. if excited: +#. sentence += '!' +#. if confused: +#. sentence += '?' +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.can_contain_anything +#. x = 1 +#. things = ['Hello', x, x + 3] +#. print(things) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingVariables.steps.word_assign +#. word = 'Hello' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_doesnt_change +#. word = 'Hello' +#. name = 'World' +#. sentence = word + ' ' + name +#. print(sentence) +#. word = 'Goodbye' +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_equals_word_plus_name +#. word = 'Hello' +#. name = 'World' +#. sentence = word + ' ' + name +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.name_assign.text +#. word = 'Hello' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.WritingPrograms.steps.editor_hello_world +#. word = 'Hello' +#. name = 'World' +#. print(word + ' ' + name) +#. word = 'Goodbye' +#. print(word + ' ' + name) +msgid "code_bits.'Hello'" +msgstr "'Hello'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.first_if_else +#. condition = True +#. if condition: +#. print('Yes') +#. else: +#. print('No') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.first_if_else_false +#. condition = False +#. if condition: +#. print('Yes') +#. else: +#. print('No') +msgid "code_bits.'No'" +msgstr "'No'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.spongebob +#. sentence = 'One more exercise, and then you can relax.' +#. upper = True +#. new_sentence = '' +#. for char in sentence: +#. if upper: +#. char = char.upper() +#. upper = False +#. else: +#. char = char.lower() +#. upper = True +#. new_sentence += char +#. print(new_sentence) +msgid "code_bits.'One more exercise, and then you can relax.'" +msgstr "'One more exercise, and then you can relax.'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.print_indices_and_words +#. words = ['Python'] +#. for index in range(len(words)): +#. print(index) +#. print(words[index]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.print_last_element +#. words = ['Python'] +#. print(words[len(words) - 1]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StringMethodsUnderstandingMutation.steps.mutation_string_append +#. 'Python'.append(' is cool!') +msgid "code_bits.'Python'" +msgstr "'Python'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.fixing_type_errors_with_conversion +#. number = '1' +#. for i in range(int(number)): +#. print('Starting... ' + str(i + 1)) +#. print('Go!') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.fixing_type_errors_with_conversion.text +#. number = '3' +#. for i in range(number): +#. print('Starting... ' + i + 1) +#. print('Go!') +msgid "code_bits.'Starting... '" +msgstr "'Starting... '" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part1 +#. def substitute(string): +#. result = '' +#. for char in string: +#. if char == 'A': +#. char = 'T' +#. elif char == 'T': +#. char = 'A' +#. elif char == 'G': +#. char = 'C' +#. elif char == 'C': +#. char = 'G' +#. result += char +#. return result +#. original = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. expected = 'TCATCGCAGGAATCAATGTCCTACCGAATA' +#. assert_equal(substitute(original), expected) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part2.text +#. def substitute(string, d): +#. ... +#. original = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. expected = 'TCATCGCAGGAATCAATGTCCTACCGAATA' +#. assert_equal(substitute(original, {'A': 'T', 'T': 'A', 'C': 'G', 'G': +#. 'C'}), expected) +msgid "code_bits.'TCATCGCAGGAATCAATGTCCTACCGAATA'" +msgstr "'TCATCGCAGGAATCAATGTCCTACCGAATA'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.brokn_kyboard +#. sentence = 'The e key on my keyboard is broken' +#. new_sentence = '' +#. for c in sentence: +#. if c != 'e': +#. new_sentence += c +#. print(new_sentence) +msgid "code_bits.'The e key on my keyboard is broken'" +msgstr "'The e key on my keyboard is broken'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.first_if_statements +#. if True: +#. print('This gets printed') +#. if False: +#. print('This does not') +msgid "code_bits.'This does not'" +msgstr "'This does not'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.first_if_statements +#. if True: +#. print('This gets printed') +#. if False: +#. print('This does not') +msgid "code_bits.'This gets printed'" +msgstr "'This gets printed'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum +#. words = ['This', 'is', 'a', 'list'] +#. total = '' +#. for word in words: +#. total += word +#. print(total) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +#. words = ['This', 'is', 'a', 'list'] +#. separator = ' - ' +#. total = '' +#. not_first = False +#. for word in words: +#. if not_first: +#. total += separator +#. total += word +#. not_first = True +#. print(total) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.list_contains_exercise +#. things = ['This', 'is', 'a', 'list'] +#. thing_to_find = 'is' +#. found = False +#. for thing in things: +#. if thing == thing_to_find: +#. found = True +#. print(found) +msgid "code_bits.'This'" +msgstr "'This'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.first_input +#. print('Type your name, then press Enter:') +#. name = input() +#. print(f'Hello {name}!') +msgid "code_bits.'Type your name, then press Enter:'" +msgstr "'Type your name, then press Enter:'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BasicForLoopExercises.steps.loop_exercise_1 +#. name = 'World' +#. for character in name: +#. print('---' + character) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BasicForLoopExercises.steps.loop_exercise_1.text +#. name = 'World' +#. for character in name: +#. print(character) +#. print('---') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BasicForLoopExercises.steps.loop_exercise_2 +#. name = 'World' +#. for _ in name: +#. print(name) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle +#. name = 'World' +#. line = '-' +#. for char in name: +#. line = line + char +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle_empty_string +#. name = 'World' +#. line = '' +#. for char in name: +#. line = line + char +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle_missing_last_line +#. name = 'World' +#. line = '-' +#. for char in name: +#. print(line) +#. line = line + char +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.diagonal_name_bonus_challenge +#. name = 'World' +#. spaces = '' +#. for char in name: +#. print(spaces + char) +#. spaces += ' ' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_box +#. name = 'World' +#. line = '' +#. for _ in name: +#. line += '-' +#. line = '+' + line + '+' +#. print(line) +#. print('|' + name + '|') +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_box_2 +#. name = 'World' +#. line = '+' + name + '+' +#. spaces = '' +#. for _ in name: +#. spaces += ' ' +#. print(line) +#. for char in name: +#. print(char + spaces + char) +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_triangle_backwards +#. name = 'World' +#. line = '' +#. for char in name: +#. line = char + line +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_triangle_spaced +#. name = 'World' +#. line = '' +#. for char in name: +#. line = line + char + ' ' +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_triangle_spaced.text +#. name = 'World' +#. line = '' +#. for char in name: +#. line = line + char +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_underlined +#. name = 'World' +#. line = '' +#. for _ in name: +#. line += '-' +#. print(name) +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_exercise +#. string1 = 'Hello' +#. string2 = 'World' +#. for i in range(len(string1)): +#. char1 = string1[i] +#. char2 = string2[i] +#. print(char1 + ' ' + char2) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise +#. string1 = 'Goodbye' +#. string2 = 'World' +#. length1 = len(string1) +#. length2 = len(string2) +#. if length1 > length2: +#. length = length1 +#. else: +#. length = length2 +#. for i in range(length): +#. if i < len(string1): +#. char1 = string1[i] +#. else: +#. char1 = ' ' +#. if i < len(string2): +#. char2 = string2[i] +#. else: +#. char2 = ' ' +#. print(char1 + ' ' + char2) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Indentation.steps.one_indented_line +#. name = 'World' +#. for character in name: +#. print(character) +#. print('---') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Indentation.steps.two_indented_lines +#. name = 'World' +#. for character in name: +#. print(character) +#. print('---') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingForLoops.steps.first_for_loop +#. name = 'World' +#. for character in name: print(character) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_doesnt_change +#. word = 'Hello' +#. name = 'World' +#. sentence = word + ' ' + name +#. print(sentence) +#. word = 'Goodbye' +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_equals_word_plus_name +#. word = 'Hello' +#. name = 'World' +#. sentence = word + ' ' + name +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.WritingPrograms.steps.editor_hello_world +#. word = 'Hello' +#. name = 'World' +#. print(word + ' ' + name) +#. word = 'Goodbye' +#. print(word + ' ' + name) +msgid "code_bits.'World'" +msgstr "'World'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_simple.text +#. def format_board(board): +#. ... +#. assert_equal( +#. format_board([ +#. ['X', 'O', 'X'], +#. ['O', ' ', ' '], +#. [' ', 'X', 'O'] +#. ]), +#. 'XOX\nO \n XO' +#. ) +msgid "code_bits.'XOX\\nO \\n XO'" +msgstr "'XOX\\nO \\n XO'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.text +#. def format_board(board): +#. ... +#. assert_equal( +#. format_board([ +#. ['X', 'O', 'X'], +#. ['O', ' ', ' '], +#. [' ', 'X', 'O'] +#. ]), +#. 'X|O|X\n-+-+-\nO| | \n-+-+-\n |X|O' +#. ) +msgid "code_bits.'X|O|X\\n-+-+-\\nO| | \\n-+-+-\\n |X|O'" +msgstr "'X|O|X\\n-+-+-\\nO| | \\n-+-+-\\n |X|O'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.first_if_else +#. condition = True +#. if condition: +#. print('Yes') +#. else: +#. print('No') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.first_if_else_false +#. condition = False +#. if condition: +#. print('Yes') +#. else: +#. print('No') +msgid "code_bits.'Yes'" +msgstr "'Yes'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.text +#. def format_board(board): +#. result = '' +#. for i in range(len(board)): +#. for char in board[i]: +#. result += char +#. if i != len(board) - 1: +#. result += '\n' +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_simple +#. def format_board(board): +#. result = '' +#. for i in range(len(board)): +#. for char in board[i]: +#. result += char +#. if i != len(board) - 1: +#. result += '\n' +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.introducing_newline +#. len('\n') +msgid "code_bits.'\\n'" +msgstr "'\\n'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input.text +#. def format_board(board): +#. first_row = ' ' +#. for i in range(len(board)): +#. first_row += str(i + 1) +#. joined_rows = [first_row] +#. for i in range(len(board)): +#. joined_row = str(i + 1) + ''.join(board[i]) +#. joined_rows.append(joined_row) +#. return "\n".join(joined_rows) +#. def play_game(): +#. board = [ +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ] +#. print(format_board(board)) +#. print('\nX to play:\n') +#. play_move(board, 'X') +#. print(format_board(board)) +#. print('\nO to play:\n') +#. play_move(board, 'O') +#. print(format_board(board)) +#. def play_move(board, player): +#. ... +#. play_game() +msgid "code_bits.'\\nO to play:\\n'" +msgstr "'\\nO to play:\\n'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input.text +#. def format_board(board): +#. first_row = ' ' +#. for i in range(len(board)): +#. first_row += str(i + 1) +#. joined_rows = [first_row] +#. for i in range(len(board)): +#. joined_row = str(i + 1) + ''.join(board[i]) +#. joined_rows.append(joined_row) +#. return "\n".join(joined_rows) +#. def play_game(): +#. board = [ +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ] +#. print(format_board(board)) +#. print('\nX to play:\n') +#. play_move(board, 'X') +#. print(format_board(board)) +#. print('\nO to play:\n') +#. play_move(board, 'O') +#. print(format_board(board)) +#. def play_move(board, player): +#. ... +#. play_game() +msgid "code_bits.'\\nX to play:\\n'" +msgstr "'\\nX to play:\\n'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsTerminology.steps.not_callable +#. f = 'a string' +#. print(callable(f)) +#. f() +msgid "code_bits.'a string'" +msgstr "'a string'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheEqualityOperator.steps.introducing_equality +#. print(1 + 2 == 3) +#. print(4 + 5 == 6) +#. print('ab' + 'c' == 'a' + 'bc') +msgid "code_bits.'ab'" +msgstr "'ab'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.double_subscripting_exercise +#. strings = ['abc', 'de', 'fghi', 'jklmn', 'o'] +#. print(strings[-2][-1]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.string_list_exercise +#. strings = ['abc', 'def', 'ghi'] +#. string = strings[1] +#. print(string[0]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_strings_list_exercise +#. strings = ['abc', 'def', 'ghi'] +#. for i in range(len(strings[0])): +#. line = "" +#. for string in strings: +#. line += string[i] +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.break_vs_return +#. def foo(): +#. for letter in 'abc': +#. for number in range(3): +#. print(f"{letter} {number}") +#. if letter == 'b': +#. break +#. foo() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.return_ends_whole_function +#. def foo(): +#. for letter in 'abc': +#. for number in range(3): +#. print(f"{letter} {number}") +#. if letter == 'b': +#. return letter +#. foo() +msgid "code_bits.'abc'" +msgstr "'abc'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_longest_strings_exercise +#. strings = ['abcqwe', 'def', 'ghiq'] +#. lengths = [] +#. for string in strings: +#. lengths.append(len(string)) +#. length = max(lengths) +#. for i in range(length): +#. line = "" +#. for string in strings: +#. if i >= len(string): +#. line += " " +#. else: +#. line += string[i] +#. print(line) +msgid "code_bits.'abcqwe'" +msgstr "'abcqwe'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingBirdseye.steps.birdseye_loop_example +#. word = 'Amazing' +#. vowels = [] +#. consonants = [] +#. for letter in word: +#. if letter.lower() in 'aeiou': +#. vowels.append(letter) +#. else: +#. consonants.append(letter) +#. print(vowels) +#. print(consonants) +msgid "code_bits.'aeiou'" +msgstr "'aeiou'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german.text +#. def print_words(french, german): +#. ... +#. print_words( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.nested_dictionaries +#. def print_words(words): +#. for word in words: +#. translations = words[word] +#. print(f"English: {word}") +#. for language in translations: +#. print(f"{language}: {translations[language]}") +#. print(f"---") +#. print_words({ +#. 'apple': { +#. 'French': 'pomme', +#. 'German': 'apfel', +#. }, +#. 'box': { +#. 'French': 'boite', +#. 'German': 'kasten', +#. }, +#. }) +msgid "code_bits.'apfel'" +msgstr "'apfel'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.text +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in ...: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_french.text +#. def print_words(french): +#. ... +#. print_words({'apple': 'pomme', 'box': 'boite'}) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german.text +#. def print_words(french, german): +#. ... +#. print_words( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.introducing_keys +#. quantities = {'apple': 1, 'cat': 10} +#. print(quantities.keys()) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.introducing_keys.text +#. quantities = {'apple': 1, 'cat': 10} +#. print(quantities) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.keys_are_iterable +#. quantities = {'apple': 1, 'cat': 10} +#. for key in quantities.keys(): +#. print(key) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.keys_are_iterable2 +#. quantities = {'apple': 1, 'cat': 10} +#. for key in quantities: +#. print(key) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.nested_dictionaries +#. def print_words(words): +#. for word in words: +#. translations = words[word] +#. print(f"English: {word}") +#. for language in translations: +#. print(f"{language}: {translations[language]}") +#. print(f"---") +#. print_words({ +#. 'apple': { +#. 'French': 'pomme', +#. 'German': 'apfel', +#. }, +#. 'box': { +#. 'French': 'boite', +#. 'German': 'kasten', +#. }, +#. }) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingDictionaries.steps.dict_access2 +#. french['apple'] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingDictionaries.steps.first_dict +#. french = {'apple': 'pomme', 'box': 'boite'} +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1.text +#. def total_cost(cart, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. result += price +#. return result +#. assert_equal( +#. total_cost( +#. ['apple', 'box', 'cat'], +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 107, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1.text +#. prices = {'apple': 2, 'apple': 3} +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1.text +#. prices = {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100} +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4.text +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. quantity = ... +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. ['dog', 'box'], +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +msgid "code_bits.'apple'" +msgstr "'apple'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.triple_subscripting +#. strings = [['hello', 'there'], ['how', 'are', 'you']] +#. print(strings[1][2][0]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'are' +#. present = False +#. for sublist in strings: +#. for string in sublist: +#. if word in string: +#. present = True +#. print(present) +msgid "code_bits.'are'" +msgstr "'are'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheEqualityOperator.steps.introducing_equality +#. print(1 + 2 == 3) +#. print(4 + 5 == 6) +#. print('ab' + 'c' == 'a' + 'bc') +msgid "code_bits.'bc'" +msgstr "'bc'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_french.text +#. def print_words(french): +#. ... +#. print_words({'apple': 'pomme', 'box': 'boite'}) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german.text +#. def print_words(french, german): +#. ... +#. print_words( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.nested_dictionaries +#. def print_words(words): +#. for word in words: +#. translations = words[word] +#. print(f"English: {word}") +#. for language in translations: +#. print(f"{language}: {translations[language]}") +#. print(f"---") +#. print_words({ +#. 'apple': { +#. 'French': 'pomme', +#. 'German': 'apfel', +#. }, +#. 'box': { +#. 'French': 'boite', +#. 'German': 'kasten', +#. }, +#. }) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingDictionaries.steps.first_dict +#. french = {'apple': 'pomme', 'box': 'boite'} +msgid "code_bits.'boite'" +msgstr "'boite'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.text +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in ...: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_french.text +#. def print_words(french): +#. ... +#. print_words({'apple': 'pomme', 'box': 'boite'}) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german.text +#. def print_words(french, german): +#. ... +#. print_words( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.nested_dictionaries +#. def print_words(words): +#. for word in words: +#. translations = words[word] +#. print(f"English: {word}") +#. for language in translations: +#. print(f"{language}: {translations[language]}") +#. print(f"---") +#. print_words({ +#. 'apple': { +#. 'French': 'pomme', +#. 'German': 'apfel', +#. }, +#. 'box': { +#. 'French': 'boite', +#. 'German': 'kasten', +#. }, +#. }) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingDictionaries.steps.dict_access3 +#. french['box'] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingDictionaries.steps.first_dict +#. french = {'apple': 'pomme', 'box': 'boite'} +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1.text +#. def total_cost(cart, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. result += price +#. return result +#. assert_equal( +#. total_cost( +#. ['apple', 'box', 'cat'], +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 107, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1.text +#. prices = {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100} +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4.text +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. quantity = ... +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. ['dog', 'box'], +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +msgid "code_bits.'box'" +msgstr "'box'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.text +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in ...: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.introducing_keys +#. quantities = {'apple': 1, 'cat': 10} +#. print(quantities.keys()) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.introducing_keys.text +#. quantities = {'apple': 1, 'cat': 10} +#. print(quantities) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.keys_are_iterable +#. quantities = {'apple': 1, 'cat': 10} +#. for key in quantities.keys(): +#. print(key) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.keys_are_iterable2 +#. quantities = {'apple': 1, 'cat': 10} +#. for key in quantities: +#. print(key) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1.text +#. def total_cost(cart, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. result += price +#. return result +#. assert_equal( +#. total_cost( +#. ['apple', 'box', 'cat'], +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 107, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1.text +#. prices = {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100} +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4.text +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. quantity = ... +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. ['dog', 'box'], +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +msgid "code_bits.'cat'" +msgstr "'cat'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.double_subscripting_exercise +#. strings = ['abc', 'de', 'fghi', 'jklmn', 'o'] +#. print(strings[-2][-1]) +msgid "code_bits.'de'" +msgstr "'de'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.string_list_exercise +#. strings = ['abc', 'def', 'ghi'] +#. string = strings[1] +#. print(string[0]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_longest_strings_exercise +#. strings = ['abcqwe', 'def', 'ghiq'] +#. lengths = [] +#. for string in strings: +#. lengths.append(len(string)) +#. length = max(lengths) +#. for i in range(length): +#. line = "" +#. for string in strings: +#. if i >= len(string): +#. line += " " +#. else: +#. line += string[i] +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_strings_list_exercise +#. strings = ['abc', 'def', 'ghi'] +#. for i in range(len(strings[0])): +#. line = "" +#. for string in strings: +#. line += string[i] +#. print(line) +msgid "code_bits.'def'" +msgstr "'def'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.text +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in ...: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1.text +#. def total_cost(cart, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. result += price +#. return result +#. assert_equal( +#. total_cost( +#. ['apple', 'box', 'cat'], +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 107, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1.text +#. prices = {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100} +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4.text +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. quantity = ... +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. ['dog', 'box'], +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +msgid "code_bits.'dog'" +msgstr "'dog'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.double_subscripting_exercise +#. strings = ['abc', 'de', 'fghi', 'jklmn', 'o'] +#. print(strings[-2][-1]) +msgid "code_bits.'fghi'" +msgstr "'fghi'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.string_list_exercise +#. strings = ['abc', 'def', 'ghi'] +#. string = strings[1] +#. print(string[0]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_strings_list_exercise +#. strings = ['abc', 'def', 'ghi'] +#. for i in range(len(strings[0])): +#. line = "" +#. for string in strings: +#. line += string[i] +#. print(line) +msgid "code_bits.'ghi'" +msgstr "'ghi'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_longest_strings_exercise +#. strings = ['abcqwe', 'def', 'ghiq'] +#. lengths = [] +#. for string in strings: +#. lengths.append(len(string)) +#. length = max(lengths) +#. for i in range(length): +#. line = "" +#. for string in strings: +#. if i >= len(string): +#. line += " " +#. else: +#. line += string[i] +#. print(line) +msgid "code_bits.'ghiq'" +msgstr "'ghiq'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'are' +#. present = False +#. for sublist in strings: +#. for string in sublist: +#. if word in string: +#. present = True +#. print(present) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'hello' +#. for sublist in strings: +#. for string in sublist: +#. if word in string: +#. print(string) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'goodbye' +#. for sublist in strings: +#. present = False +#. for string in sublist: +#. if word in string: +#. present = True +#. print(present) +msgid "code_bits.'goodbye world'" +msgstr "'goodbye world'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'goodbye' +#. for sublist in strings: +#. present = False +#. for string in sublist: +#. if word in string: +#. present = True +#. print(present) +msgid "code_bits.'goodbye'" +msgstr "'goodbye'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.AddingStrings.steps.final_text.text +#. 'hello ' + 'world' +#. 'hello' + ' world' +#. 'hello' + ' ' + 'world' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.AddingStrings.steps.hello_world_space +#. 'hello ' + 'world' +msgid "code_bits.'hello '" +msgstr "'hello '" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'are' +#. present = False +#. for sublist in strings: +#. for string in sublist: +#. if word in string: +#. present = True +#. print(present) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'hello' +#. for sublist in strings: +#. for string in sublist: +#. if word in string: +#. print(string) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'goodbye' +#. for sublist in strings: +#. present = False +#. for string in sublist: +#. if word in string: +#. present = True +#. print(present) +msgid "code_bits.'hello there'" +msgstr "'hello there'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'are' +#. present = False +#. for sublist in strings: +#. for string in sublist: +#. if word in string: +#. present = True +#. print(present) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'hello' +#. for sublist in strings: +#. for string in sublist: +#. if word in string: +#. print(string) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'goodbye' +#. for sublist in strings: +#. present = False +#. for string in sublist: +#. if word in string: +#. present = True +#. print(present) +msgid "code_bits.'hello world'" +msgstr "'hello world'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.AddingStrings.steps.final_text.text +#. 'hello ' + 'world' +#. 'hello' + ' world' +#. 'hello' + ' ' + 'world' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.AddingStrings.steps.hello_world_concat +#. 'hello' + 'world' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.triple_subscripting +#. strings = [['hello', 'there'], ['how', 'are', 'you']] +#. print(strings[1][2][0]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingStrings.steps.hello_string +#. 'hello' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'hello' +#. for sublist in strings: +#. for string in sublist: +#. if word in string: +#. print(string) +msgid "code_bits.'hello'" +msgstr "'hello'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'are' +#. present = False +#. for sublist in strings: +#. for string in sublist: +#. if word in string: +#. present = True +#. print(present) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'hello' +#. for sublist in strings: +#. for string in sublist: +#. if word in string: +#. print(string) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'goodbye' +#. for sublist in strings: +#. present = False +#. for string in sublist: +#. if word in string: +#. present = True +#. print(present) +msgid "code_bits.'how are you'" +msgstr "'how are you'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.triple_subscripting +#. strings = [['hello', 'there'], ['how', 'are', 'you']] +#. print(strings[1][2][0]) +msgid "code_bits.'how'" +msgstr "'how'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum +#. words = ['This', 'is', 'a', 'list'] +#. total = '' +#. for word in words: +#. total += word +#. print(total) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +#. words = ['This', 'is', 'a', 'list'] +#. separator = ' - ' +#. total = '' +#. not_first = False +#. for word in words: +#. if not_first: +#. total += separator +#. total += word +#. not_first = True +#. print(total) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.list_contains_exercise +#. things = ['This', 'is', 'a', 'list'] +#. thing_to_find = 'is' +#. found = False +#. for thing in things: +#. if thing == thing_to_find: +#. found = True +#. print(found) +msgid "code_bits.'is'" +msgstr "'is'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.double_subscripting_exercise +#. strings = ['abc', 'de', 'fghi', 'jklmn', 'o'] +#. print(strings[-2][-1]) +msgid "code_bits.'jklmn'" +msgstr "'jklmn'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german.text +#. def print_words(french, german): +#. ... +#. print_words( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.nested_dictionaries +#. def print_words(words): +#. for word in words: +#. translations = words[word] +#. print(f"English: {word}") +#. for language in translations: +#. print(f"{language}: {translations[language]}") +#. print(f"---") +#. print_words({ +#. 'apple': { +#. 'French': 'pomme', +#. 'German': 'apfel', +#. }, +#. 'box': { +#. 'French': 'boite', +#. 'German': 'kasten', +#. }, +#. }) +msgid "code_bits.'kasten'" +msgstr "'kasten'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheEqualityOperator.steps.if_equals_replacing_characters +#. name = 'kesha' +#. new_name = '' +#. for c in name: +#. if c == 's': +#. c = '$' +#. new_name += c +#. print(new_name) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheEqualityOperator.steps.if_equals_replacing_characters_exercise +#. name = 'kesha' +#. new_name = '' +#. for c in name: +#. if c == 'e': +#. c = '3' +#. if c == 's': +#. c = '$' +#. if c == 'a': +#. c = '@' +#. new_name += c +#. print(new_name) +msgid "code_bits.'kesha'" +msgstr "'kesha'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum +#. words = ['This', 'is', 'a', 'list'] +#. total = '' +#. for word in words: +#. total += word +#. print(total) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +#. words = ['This', 'is', 'a', 'list'] +#. separator = ' - ' +#. total = '' +#. not_first = False +#. for word in words: +#. if not_first: +#. total += separator +#. total += word +#. not_first = True +#. print(total) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.list_contains_exercise +#. things = ['This', 'is', 'a', 'list'] +#. thing_to_find = 'is' +#. found = False +#. for thing in things: +#. if thing == thing_to_find: +#. found = True +#. print(found) +msgid "code_bits.'list'" +msgstr "'list'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.index_exercise +#. things = ['on', 'the', 'way', 'to', 'the', 'store'] +#. to_find = 'the' +#. for i in range(len(things)): +#. if to_find == things[i]: +#. print(i) +#. break +msgid "code_bits.'on'" +msgstr "'on'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_french.text +#. def print_words(french): +#. ... +#. print_words({'apple': 'pomme', 'box': 'boite'}) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german.text +#. def print_words(french, german): +#. ... +#. print_words( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.nested_dictionaries +#. def print_words(words): +#. for word in words: +#. translations = words[word] +#. print(f"English: {word}") +#. for language in translations: +#. print(f"{language}: {translations[language]}") +#. print(f"---") +#. print_words({ +#. 'apple': { +#. 'French': 'pomme', +#. 'German': 'apfel', +#. }, +#. 'box': { +#. 'French': 'boite', +#. 'German': 'kasten', +#. }, +#. }) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingDictionaries.steps.dict_access4 +#. french['pomme'] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingDictionaries.steps.first_dict +#. french = {'apple': 'pomme', 'box': 'boite'} +msgid "code_bits.'pomme'" +msgstr "'pomme'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.index_exercise +#. things = ['on', 'the', 'way', 'to', 'the', 'store'] +#. to_find = 'the' +#. for i in range(len(things)): +#. if to_find == things[i]: +#. print(i) +#. break +msgid "code_bits.'store'" +msgstr "'store'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.index_exercise +#. things = ['on', 'the', 'way', 'to', 'the', 'store'] +#. to_find = 'the' +#. for i in range(len(things)): +#. if to_find == things[i]: +#. print(i) +#. break +msgid "code_bits.'the'" +msgstr "'the'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.triple_subscripting +#. strings = [['hello', 'there'], ['how', 'are', 'you']] +#. print(strings[1][2][0]) +msgid "code_bits.'there'" +msgstr "'there'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.index_exercise +#. things = ['on', 'the', 'way', 'to', 'the', 'store'] +#. to_find = 'the' +#. for i in range(len(things)): +#. if to_find == things[i]: +#. print(i) +#. break +msgid "code_bits.'to'" +msgstr "'to'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.index_exercise +#. things = ['on', 'the', 'way', 'to', 'the', 'store'] +#. to_find = 'the' +#. for i in range(len(things)): +#. if to_find == things[i]: +#. print(i) +#. break +msgid "code_bits.'way'" +msgstr "'way'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingVariables.steps.word_string_check +#. 'word' +msgid "code_bits.'word'" +msgstr "'word'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.AddingStrings.steps.final_text.text +#. 'hello ' + 'world' +#. 'hello' + ' world' +#. 'hello' + ' ' + 'world' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.AddingStrings.steps.hello_world_concat +#. 'hello' + 'world' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.AddingStrings.steps.hello_world_space +#. 'hello ' + 'world' +msgid "code_bits.'world'" +msgstr "'world'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StringMethodsUnderstandingMutation.steps.final_text.text +#. if word.lower() == 'yes': +msgid "code_bits.'yes'" +msgstr "'yes'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.triple_subscripting +#. strings = [['hello', 'there'], ['how', 'are', 'you']] +#. print(strings[1][2][0]) +msgid "code_bits.'you'" +msgstr "'you'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.print_twice_exercise.text +#. Hello +#. Hello +msgid "code_bits.Hello" +msgstr "Hello" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.keys_are_iterable.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.nested_dictionaries.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.EqualsVsIs.steps.two_separate_lists.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.append_vs_concatenate.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.printing_the_range.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.using_len_first_time.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Indentation.steps.one_indented_line.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Indentation.steps.two_indented_lines.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.first_input.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingBirdseye.steps.birdseye_loop_example.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingBirdseye.steps.first_birdseye_example.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingDictionaries.steps.first_dict.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingElif.steps.dna_example.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.concatenate_string_number.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotTrueOrTrue.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.InputAliceBob.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.naive_make_board.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ModifyingWhileIterating.steps.run_broken_with_python_tutor.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.cannot_return_multiple_values.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.double_return_in_one_function.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.return_ends_whole_function.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MultiLineExpressions.steps.valid_multiline.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.modify_list_in_function.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_two_lines.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.introducing_newline.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.invalid_multi_line_string.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.one_way_to_print_board.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.brokn_kyboard.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_equals_word_plus_name.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StringMethodsUnderstandingMutation.steps.mutation_string_append.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StringMethodsUnderstandingMutation.steps.string_count_index.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StringMethodsUnderstandingMutation.steps.string_in_step.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StringMethodsUnderstandingMutation.steps.string_lower_upper.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheEqualityOperator.steps.if_equals_replacing_characters.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.different_types_look_same.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.five_different_types.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.less_than_has_two_meanings.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.less_than_sorting_strings.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.plus_has_two_meanings.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithPythonTutor.steps.run_with_python_tutor.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_tail.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part1.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.first_print.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.word_assign_goodbye.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.word_plus_name.text +#. __program_indented__ +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.WritingPrograms.steps.editor_hello_world.text +#. __program_indented__ +msgid "code_bits.__program_indented__" +msgstr "__program_indented__" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.introducing_assert_equal.text +#. def assert_equal(actual, expected): +#. if actual == expected: +#. print("OK") +#. else: +#. print(f"Error! {repr(actual)} != {repr(expected)}") +msgid "code_bits.actual" +msgstr "actual" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.basic_f_string_exercise +#. name = "Alice" +#. age = 20 +#. print(f'Hello {name}. You are {age} years old.') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.concatenate_string_number +#. name = "Alice" +#. age = 20 +#. print("Hello " + name + ". You are " + age + " years old.") +msgid "code_bits.age" +msgstr "age" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +#. def surround(string, sides): +#. return sides + string + sides +#. def alert(string, level): +#. string = surround(string, ' ') +#. for _ in range(level): +#. string = surround(string, '!') +#. return string +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise.text +#. assert_equal(alert("Warning", 2), "!! Warning !!") +#. assert_equal(alert("DANGER", 4), "!!!! DANGER !!!!") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise.text +#. def alert(string, level): +msgid "code_bits.alert" +msgstr "alert" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.final_text.text +#. diagonal1 = all_equal([board[0][0], board[1][1], board[2][2]]) +#. diagonal2 = all_equal([board[2][0], board[1][1], board[0][2]]) +#. return diagonal1 or diagonal2 +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.TicTacToeWinningRow +#. def all_equal(row): +#. return row[0] == row[1] and row[0] == row[2] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.TicTacToeWinningRow.text +#. def all_equal(row): +#. ... +#. assert_equal(all_equal(["X", "X", "X"]), True) +#. assert_equal(all_equal(["O", "O", "O"]), True) +#. assert_equal(all_equal(["X", "O", "X"]), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.final_text.text +#. def all_equal(row): +#. return row[0] == row[1] and row[0] == row[2] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner +#. def column_winner(board): +#. for col in range(len(board[0])): +#. all_equal = True +#. piece = board[0][col] +#. for row in board: +#. if row[col] == ' ' or row[col] != piece: +#. all_equal = False +#. break +#. if all_equal: +#. return True +#. return False +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner +#. def row_winner(board): +#. for row in board: +#. all_equal = True +#. piece = row[0] +#. for entry in row: +#. if entry == ' ' or piece != entry: +#. all_equal = False +#. break +#. if all_equal: +#. return True +#. return False +msgid "code_bits.all_equal" +msgstr "all_equal" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner +#. def diagonal_winner(board): +#. all_equal1 = True +#. all_equal2 = True +#. topleft = board[0][0] +#. topright = board[0][-1] +#. for i in range(len(board)): +#. if board[i][i] == ' ' or board[i][i] != topleft: +#. all_equal1 = False +#. if board[i][-i - 1] == ' ' or board[i][-i - 1] != topright: +#. all_equal2 = False +#. return all_equal1 or all_equal2 +msgid "code_bits.all_equal1" +msgstr "all_equal1" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner +#. def diagonal_winner(board): +#. all_equal1 = True +#. all_equal2 = True +#. topleft = board[0][0] +#. topright = board[0][-1] +#. for i in range(len(board)): +#. if board[i][i] == ' ' or board[i][i] != topleft: +#. all_equal1 = False +#. if board[i][-i - 1] == ' ' or board[i][-i - 1] != topright: +#. all_equal2 = False +#. return all_equal1 or all_equal2 +msgid "code_bits.all_equal2" +msgstr "all_equal2" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithPythonTutor.steps.run_with_python_tutor +#. all_numbers = [2, 4, 8, 1, 9, 7] +#. small_numbers = [] +#. big_numbers = [] +#. for number in all_numbers: +#. if number <= 5: +#. small_numbers.append(number) +#. else: +#. big_numbers.append(number) +#. print(small_numbers) +#. print(big_numbers) +msgid "code_bits.all_numbers" +msgstr "all_numbers" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.AndHasHigherPriority.text +#. def diagonal_winner(board): +#. ... +#. assert_equal( +#. diagonal_winner( +#. [ +#. ['X', 'O', 'X'], +#. ['X', 'X', 'O'], +#. ['O', 'O', 'X'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. diagonal_winner( +#. [ +#. ['X', 'X', 'O'], +#. ['X', 'O', 'O'], +#. ['O', 'X', 'X'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. diagonal_winner( +#. [ +#. ['O', 'X', 'O'], +#. ['X', 'X', 'X'], +#. ['O', 'O', 'X'] +#. ] +#. ), +#. False +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.text +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in ...: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.AndExercise.text +#. def is_valid_percentage(x): +#. if x < 0 or x > 100: +#. return False +#. else: +#. return True +#. assert_equal(is_valid_percentage(-1), False) +#. assert_equal(is_valid_percentage(0), True) +#. assert_equal(is_valid_percentage(50), True) +#. assert_equal(is_valid_percentage(100), True) +#. assert_equal(is_valid_percentage(101), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.TicTacToeWinningRow.text +#. def all_equal(row): +#. ... +#. assert_equal(all_equal(["X", "X", "X"]), True) +#. assert_equal(all_equal(["O", "O", "O"]), True) +#. assert_equal(all_equal(["X", "O", "X"]), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.hints.0.text +#. def valid_image(filename): +#. if filename.endswith(".png") or filename.endswith(".jpg"): +#. return True +#. else: +#. return False +#. assert_equal(valid_image("dog.png"), True) +#. assert_equal(valid_image("cat.jpg"), True) +#. assert_equal(valid_image("invoice.pdf"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.text +#. def invalid_image(filename): +#. if filename.endswith(".png") or filename.endswith(".jpg"): +#. return False +#. else: +#. return True +#. assert_equal(invalid_image("dog.png"), False) +#. assert_equal(invalid_image("cat.jpg"), False) +#. assert_equal(invalid_image("invoice.pdf"), True) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ACommonMistake +#. def is_friend(name): +#. return name == "Alice" or "Bob" +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise.text +#. assert_equal(is_valid_percentage(-1), False) +#. assert_equal(is_valid_percentage(0), True) +#. assert_equal(is_valid_percentage(50), True) +#. assert_equal(is_valid_percentage(100), True) +#. assert_equal(is_valid_percentage(101), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.FurtherImprovement +#. def is_friend(name): +#. return name == "Alice" or name == "Bob" +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ImprovingWithOr +#. def is_friend(name): +#. if name == "Alice" or name == "Bob": +#. return True +#. else: +#. return False +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.InputAliceBob +#. def is_friend(name): +#. if name == "Alice": +#. return True +#. elif name == "Bob": +#. return True +#. else: +#. return False +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.InspectWithBirdseye +#. def is_friend(name): +#. return name == "Alice" or "Bob" +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner.text +#. def column_winner(board): +#. ... +#. assert_equal( +#. column_winner( +#. [ +#. ['X', 'O', ' '], +#. ['X', 'O', ' '], +#. ['O', 'X', ' '] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. column_winner( +#. [ +#. ['X', 'O', ' ', 'X'], +#. [' ', 'O', 'X', 'O'], +#. ['O', 'O', 'X', 'X'], +#. ['O', 'O', 'X', ' '] +#. ] +#. ), +#. True +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner.text +#. def diagonal_winner(board): +#. ... +#. assert_equal( +#. diagonal_winner( +#. [ +#. ['O', 'X', 'O', 'X'], +#. [' ', 'O', 'X', ' '], +#. ['X', 'X', ' ', 'X'], +#. ['X', ' ', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. diagonal_winner( +#. [ +#. ['X', 'X', ' '], +#. ['X', ' ', 'O'], +#. [' ', 'O', 'O'] +#. ] +#. ), +#. False +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner.text +#. def row_winner(board): +#. ... +#. assert_equal( +#. row_winner( +#. [ +#. ['A', 'A', 'B', 'A'], +#. [' ', ' ', ' ', ' '], +#. ['A', ' ', ' ', 'A'], +#. ['B', ' ', 'B', 'A'] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. row_winner( +#. [ +#. ['X', ' ', 'X'], +#. ['O', 'X', 'X'], +#. ['O', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner.text +#. def winner(board): +#. ... +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i-1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. assert_equal( +#. winner( +#. [ +#. ['X', 'X', 'X', ' '], +#. ['X', 'X', ' ', ' '], +#. ['X', ' ', 'O', 'X'], +#. [' ', ' ', 'O', 'X'] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' ', 'X'], +#. ['O', 'X', 'O'], +#. ['O', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' '], +#. ['X', 'O'] +#. ] +#. ), +#. True +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.naive_make_board +#. def make_board(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board = [] +#. for _ in range(size): +#. board.append(row) +#. return board +#. def test(): +#. board = make_board(3) +#. assert_equal(board, [ +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ]) +#. board[0][0] = 'X' +#. assert_equal(board, [ +#. ['X', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ]) +#. test() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.cannot_return_multiple_values +#. def double_numbers(numbers): +#. for x in numbers: +#. return x * 2 +#. assert_equal(double_numbers([1, 2, 3]), [2, 4, 6]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.return_ends_whole_function.text +#. def double_numbers(numbers): +#. doubles = [] +#. for x in numbers: +#. doubles.append(x * 2) +#. return doubles +#. assert_equal(double_numbers([1, 2, 3]), [2, 4, 6]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.text +#. def format_board(board): +#. ... +#. assert_equal( +#. format_board([ +#. ['X', 'O', 'X'], +#. ['O', ' ', ' '], +#. [' ', 'X', 'O'] +#. ]), +#. 'X|O|X\n-+-+-\nO| | \n-+-+-\n |X|O' +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_simple.text +#. def format_board(board): +#. ... +#. assert_equal( +#. format_board([ +#. ['X', 'O', 'X'], +#. ['O', ' ', ' '], +#. [' ', 'X', 'O'] +#. ]), +#. 'XOX\nO \n XO' +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.invalid_multi_line_string.text +#. assert_equal(print_board([...]), "...") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.invalid_multi_line_string.text +#. def format_board(board): +#. ... +#. return ... +#. assert_equal(format_board([...]), "...") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise.text +#. assert_equal(alert("Warning", 2), "!! Warning !!") +#. assert_equal(alert("DANGER", 4), "!!!! DANGER !!!!") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.complete_quadruple_tests +#. def double(x): +#. return x * 2 +#. def quadruple(x): +#. return double(double(x)) +#. assert_equal(quadruple(2), 8) +#. assert_equal(quadruple(5), 20) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.complete_quadruple_tests.text +#. def double(x): +#. return x * 2 +#. def quadruple(x): +#. return double(double(x)) +#. assert_equal(quadruple(2)) +#. assert_equal(quadruple(5)) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.introducing_assert_equal +#. def double(x): +#. return x * 2 +#. assert_equal(double(2), 4) +#. assert_equal(double(5), 10) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.introducing_assert_equal.text +#. def assert_equal(actual, expected): +#. if actual == expected: +#. print("OK") +#. else: +#. print(f"Error! {repr(actual)} != {repr(expected)}") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.make_tests_fail +#. def double(x): +#. return x * 3 +#. assert_equal(double(2), 4) +#. assert_equal(double(5), 10) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.surround_exercise.text +#. assert_equal(surround("more", "++"), "++more++") +#. assert_equal(surround("the same", "="), "=the same=") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.format_board_with_numbers.text +#. def format_board(board): +#. ... +#. assert_equal( +#. format_board([ +#. ['X', 'O', 'X'], +#. ['O', ' ', ' '], +#. [' ', 'X', 'O'] +#. ]), +#. ' 123\n1XOX\n2O \n3 XO' +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part1 +#. def substitute(string): +#. result = '' +#. for char in string: +#. if char == 'A': +#. char = 'T' +#. elif char == 'T': +#. char = 'A' +#. elif char == 'G': +#. char = 'C' +#. elif char == 'C': +#. char = 'G' +#. result += char +#. return result +#. original = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. expected = 'TCATCGCAGGAATCAATGTCCTACCGAATA' +#. assert_equal(substitute(original), expected) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part2.text +#. def substitute(string, d): +#. ... +#. original = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. expected = 'TCATCGCAGGAATCAATGTCCTACCGAATA' +#. assert_equal(substitute(original, {'A': 'T', 'T': 'A', 'C': 'G', 'G': +#. 'C'}), expected) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1.text +#. def total_cost(cart, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. result += price +#. return result +#. assert_equal( +#. total_cost( +#. ['apple', 'box', 'cat'], +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 107, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4.text +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. quantity = ... +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. ['dog', 'box'], +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +msgid "code_bits.assert_equal" +msgstr "assert_equal" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.filter_numbers +#. numbers = [3, 1, 4, 1, 5, 9, 2, 6, 5] +#. big_numbers = [] +#. for number in numbers: +#. if number > 5: +#. big_numbers.append(number) +#. print(big_numbers) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ModifyingWhileIterating.steps.make_copy2 +#. numbers = [10, 7, 8, 3, 12, 15] +#. big_numbers = numbers.copy() +#. for number in numbers: +#. if number <= 10: +#. big_numbers.remove(number) +#. print(big_numbers) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ModifyingWhileIterating.steps.make_new_list +#. numbers = [10, 7, 8, 3, 12, 15] +#. big_numbers = [] +#. for number in numbers: +#. if number > 10: +#. big_numbers.append(number) +#. print(big_numbers) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithPythonTutor.steps.run_with_python_tutor +#. all_numbers = [2, 4, 8, 1, 9, 7] +#. small_numbers = [] +#. big_numbers = [] +#. for number in all_numbers: +#. if number <= 5: +#. small_numbers.append(number) +#. else: +#. big_numbers.append(number) +#. print(small_numbers) +#. print(big_numbers) +msgid "code_bits.big_numbers" +msgstr "big_numbers" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.AndHasHigherPriority +#. def diagonal_winner(board): +#. middle = board[1][1] +#. return ( +#. (middle == board[0][0] and middle == board[2][2]) or +#. (middle == board[0][2] and middle == board[2][0]) +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.AndHasHigherPriority.text +#. board = [ +#. ['X', 'O', 'X'], +#. ['X', 'X', 'O'], +#. ['O', 'O', 'X'] +#. ] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.AndHasHigherPriority.text +#. def diagonal_winner(board): +#. ... +#. assert_equal( +#. diagonal_winner( +#. [ +#. ['X', 'O', 'X'], +#. ['X', 'X', 'O'], +#. ['O', 'O', 'X'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. diagonal_winner( +#. [ +#. ['X', 'X', 'O'], +#. ['X', 'O', 'O'], +#. ['O', 'X', 'X'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. diagonal_winner( +#. [ +#. ['O', 'X', 'O'], +#. ['X', 'X', 'X'], +#. ['O', 'O', 'X'] +#. ] +#. ), +#. False +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.final_text.text +#. diagonal1 = all_equal([board[0][0], board[1][1], board[2][2]]) +#. diagonal2 = all_equal([board[2][0], board[1][1], board[0][2]]) +#. return diagonal1 or diagonal2 +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.final_text.text +#. def diagonal_winner(board): +#. middle = board[1][1] +#. return ( +#. (middle == board[0][0] and middle == board[2][2]) or +#. (middle == board[0][2] and middle == board[2][0]) +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner +#. def column_winner(board): +#. for col in range(len(board[0])): +#. all_equal = True +#. piece = board[0][col] +#. for row in board: +#. if row[col] == ' ' or row[col] != piece: +#. all_equal = False +#. break +#. if all_equal: +#. return True +#. return False +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner.text +#. def column_winner(board): +#. ... +#. assert_equal( +#. column_winner( +#. [ +#. ['X', 'O', ' '], +#. ['X', 'O', ' '], +#. ['O', 'X', ' '] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. column_winner( +#. [ +#. ['X', 'O', ' ', 'X'], +#. [' ', 'O', 'X', 'O'], +#. ['O', 'O', 'X', 'X'], +#. ['O', 'O', 'X', ' '] +#. ] +#. ), +#. True +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner +#. def diagonal_winner(board): +#. all_equal1 = True +#. all_equal2 = True +#. topleft = board[0][0] +#. topright = board[0][-1] +#. for i in range(len(board)): +#. if board[i][i] == ' ' or board[i][i] != topleft: +#. all_equal1 = False +#. if board[i][-i - 1] == ' ' or board[i][-i - 1] != topright: +#. all_equal2 = False +#. return all_equal1 or all_equal2 +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner.text +#. def diagonal_winner(board): +#. ... +#. assert_equal( +#. diagonal_winner( +#. [ +#. ['O', 'X', 'O', 'X'], +#. [' ', 'O', 'X', ' '], +#. ['X', 'X', ' ', 'X'], +#. ['X', ' ', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. diagonal_winner( +#. [ +#. ['X', 'X', ' '], +#. ['X', ' ', 'O'], +#. [' ', 'O', 'O'] +#. ] +#. ), +#. False +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner.text +#. def diagonal_winner(board): +#. middle = board[1][1] +#. return ( +#. (middle == board[0][0] and middle == board[2][2]) or +#. (middle == board[0][2] and middle == board[2][0]) +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner +#. def row_winner(board): +#. for row in board: +#. all_equal = True +#. piece = row[0] +#. for entry in row: +#. if entry == ' ' or piece != entry: +#. all_equal = False +#. break +#. if all_equal: +#. return True +#. return False +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner.text +#. board = [ +#. ['A', 'B', 'A', 'A'], +#. ['B', ' ', ' ', 'A'], +#. [' ', 'A', 'B', 'B'], +#. [' ', 'A', 'B', ' '] +#. ] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner.text +#. board = [ +#. ['X', 'O', 'X'], +#. ['O', ' ', ' '], +#. [' ', 'X', 'O'] +#. ] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner.text +#. def row_winner(board): +#. ... +#. assert_equal( +#. row_winner( +#. [ +#. ['A', 'A', 'B', 'A'], +#. [' ', ' ', ' ', ' '], +#. ['A', ' ', ' ', 'A'], +#. ['B', ' ', 'B', 'A'] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. row_winner( +#. [ +#. ['X', ' ', 'X'], +#. ['O', 'X', 'X'], +#. ['O', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i - 1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner.text +#. def winner(board): +#. ... +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i-1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. assert_equal( +#. winner( +#. [ +#. ['X', 'X', 'X', ' '], +#. ['X', 'X', ' ', ' '], +#. ['X', ' ', 'O', 'X'], +#. [' ', ' ', 'O', 'X'] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' ', 'X'], +#. ['O', 'X', 'O'], +#. ['O', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' '], +#. ['X', 'O'] +#. ] +#. ), +#. True +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.final_text.text +#. board.append(row.copy()) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.final_text.text +#. def make_board(size): +#. board = [] +#. for _ in range(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board.append(row) +#. return board +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.final_text.text +#. def make_board(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board = [] +#. for _ in range(size): +#. board.append(row.copy()) +#. return board +#. def make_cube(size): +#. cube = [] +#. board = make_board(size) +#. for _ in range(size): +#. cube.append(board.copy()) +#. return cube +#. def test(): +#. cube = make_cube(2) +#. print(cube) +#. cube[0][0][0] = 'X' +#. print(cube) +#. print(cube[0] is cube[1]) +#. print(cube[0][0] is cube[0][1]) +#. print(cube[0][0] is cube[1][0]) +#. test() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.fix_make_board +#. def make_board(size): +#. board = [] +#. for _ in range(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board.append(row) +#. return board +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.fix_make_board.text +#. board = [row, row, row] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.fix_make_board.text +#. board[0][0] = 'X' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.fix_make_board.text +#. board[0][0] = 'X' +#. board[1][0] = 'X' +#. board[2][0] = 'X' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.fix_make_board.text +#. board[1][0] = 'X' +#. board[2][0] = 'X' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.naive_make_board +#. def make_board(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board = [] +#. for _ in range(size): +#. board.append(row) +#. return board +#. def test(): +#. board = make_board(3) +#. assert_equal(board, [ +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ]) +#. board[0][0] = 'X' +#. assert_equal(board, [ +#. ['X', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ]) +#. test() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.modify_list_in_function +#. def play_move(board, player): +#. board[1] = player +#. def play_game(): +#. game_board = [" ", " ", " "] +#. play_move(game_board, "X") +#. print(game_board) +#. play_game() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input +#. def play_move(board, player): +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input.text +#. board[1][0] = player +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input.text +#. def format_board(board): +#. first_row = ' ' +#. for i in range(len(board)): +#. first_row += str(i + 1) +#. joined_rows = [first_row] +#. for i in range(len(board)): +#. joined_row = str(i + 1) + ''.join(board[i]) +#. joined_rows.append(joined_row) +#. return "\n".join(joined_rows) +#. def play_game(): +#. board = [ +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ] +#. print(format_board(board)) +#. print('\nX to play:\n') +#. play_move(board, 'X') +#. print(format_board(board)) +#. print('\nO to play:\n') +#. play_move(board, 'O') +#. print(format_board(board)) +#. def play_move(board, player): +#. ... +#. play_game() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input.text +#. row = board[1] +#. row[0] = player +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_two_lines +#. def play_move(board, player): +#. row = board[1] +#. row[0] = player +#. def play_game(): +#. board = [ +#. [" ", " ", " "], +#. [" ", " ", " "], +#. [" ", " ", " "], +#. ] +#. play_move(board, "X") +#. print(board) +#. play_game() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge +#. def format_board(board): +#. joined_rows = [] +#. for row in board: +#. joined_rows.append("|".join(row)) +#. lines = [] +#. for _ in board[0]: +#. lines.append("-") +#. line = f'\n{"+".join(lines)}\n' +#. return line.join(joined_rows) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.text +#. board = [ +#. ['X', 'O', 'X'], +#. [' ', 'O', 'O'], +#. [' ', 'X', ' '] +#. ] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.text +#. def format_board(board): +#. ... +#. assert_equal( +#. format_board([ +#. ['X', 'O', 'X'], +#. ['O', ' ', ' '], +#. [' ', 'X', 'O'] +#. ]), +#. 'X|O|X\n-+-+-\nO| | \n-+-+-\n |X|O' +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.text +#. def format_board(board): +#. joined_rows = [] +#. for row in board: +#. joined_rows.append("".join(row)) +#. return "\n".join(joined_rows) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.text +#. def format_board(board): +#. result = '' +#. for i in range(len(board)): +#. for char in board[i]: +#. result += char +#. if i != len(board) - 1: +#. result += '\n' +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_simple +#. def format_board(board): +#. result = '' +#. for i in range(len(board)): +#. for char in board[i]: +#. result += char +#. if i != len(board) - 1: +#. result += '\n' +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_simple.text +#. def format_board(board): +#. ... +#. assert_equal( +#. format_board([ +#. ['X', 'O', 'X'], +#. ['O', ' ', ' '], +#. [' ', 'X', 'O'] +#. ]), +#. 'XOX\nO \n XO' +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.invalid_multi_line_string.text +#. def format_board(board): +#. ... +#. return ... +#. assert_equal(format_board([...]), "...") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.one_way_to_print_board +#. def print_board(board): +#. for row in board: +#. print("".join(row)) +#. print_board([ +#. ['X', 'O', 'X'], +#. [' ', 'O', 'O'], +#. [' ', 'X', ' '] +#. ]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.format_board_with_numbers +#. def format_board(board): +#. first_row = ' ' +#. for i in range(len(board)): +#. first_row += str(i + 1) +#. joined_rows = [first_row] +#. for i in range(len(board)): +#. joined_row = str(i + 1) + ''.join(board[i]) +#. joined_rows.append(joined_row) +#. return "\n".join(joined_rows) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.format_board_with_numbers.text +#. def format_board(board): +#. ... +#. assert_equal( +#. format_board([ +#. ['X', 'O', 'X'], +#. ['O', ' ', ' '], +#. [' ', 'X', 'O'] +#. ]), +#. ' 123\n1XOX\n2O \n3 XO' +#. ) +msgid "code_bits.board" +msgstr "board" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.board_size" +msgstr "board_size" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.crack_password_exercise +#. letters = 'AB' +#. for c1 in letters: +#. for c2 in letters: +#. for c3 in letters: +#. for c4 in letters: +#. print(c1 + c2 + c3 + c4) +msgid "code_bits.c1" +msgstr "c1" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.crack_password_exercise +#. letters = 'AB' +#. for c1 in letters: +#. for c2 in letters: +#. for c3 in letters: +#. for c4 in letters: +#. print(c1 + c2 + c3 + c4) +msgid "code_bits.c2" +msgstr "c2" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.crack_password_exercise +#. letters = 'AB' +#. for c1 in letters: +#. for c2 in letters: +#. for c3 in letters: +#. for c4 in letters: +#. print(c1 + c2 + c3 + c4) +msgid "code_bits.c3" +msgstr "c3" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.crack_password_exercise +#. letters = 'AB' +#. for c1 in letters: +#. for c2 in letters: +#. for c3 in letters: +#. for c4 in letters: +#. print(c1 + c2 + c3 + c4) +msgid "code_bits.c4" +msgstr "c4" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1 +#. def total_cost(cart, prices): +#. result = 0 +#. for item in cart: +#. price = prices[item] +#. result += price +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1.text +#. def total_cost(cart, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. result += price +#. return result +#. assert_equal( +#. total_cost( +#. ['apple', 'box', 'cat'], +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 107, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4 +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4.text +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. quantity = ... +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. ['dog', 'box'], +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +msgid "code_bits.cart" +msgstr "cart" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle +#. name = 'World' +#. line = '-' +#. for char in name: +#. line = line + char +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle_empty_string +#. name = 'World' +#. line = '' +#. for char in name: +#. line = line + char +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle_missing_last_line +#. name = 'World' +#. line = '-' +#. for char in name: +#. print(line) +#. line = line + char +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.diagonal_name_bonus_challenge +#. name = 'World' +#. spaces = '' +#. for char in name: +#. print(spaces + char) +#. spaces += ' ' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_box_2 +#. name = 'World' +#. line = '+' + name + '+' +#. spaces = '' +#. for _ in name: +#. spaces += ' ' +#. print(line) +#. for char in name: +#. print(char + spaces + char) +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_triangle_backwards +#. name = 'World' +#. line = '' +#. for char in name: +#. line = char + line +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_triangle_spaced +#. name = 'World' +#. line = '' +#. for char in name: +#. line = line + char + ' ' +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_triangle_spaced.text +#. name = 'World' +#. line = '' +#. for char in name: +#. line = line + char +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_underlined.text +#. line += char +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_underlined.text +#. line = line + char +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningCompoundStatements.steps.final_text.text +#. sentence = 'Hello World' +#. excited = True +#. new_sentence = '' +#. for char in sentence: +#. new_sentence += char +#. if excited: +#. new_sentence += '!' +#. sentence = new_sentence +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningCompoundStatements.steps.for_inside_if +#. sentence = 'Hello World' +#. excited = True +#. if excited: +#. new_sentence = '' +#. for char in sentence: +#. new_sentence += char + '!' +#. sentence = new_sentence +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.capitalise +#. sentence = 'HELLO THERE' +#. upper = True +#. new_sentence = '' +#. for char in sentence: +#. if upper: +#. char = char.upper() +#. else: +#. char = char.lower() +#. new_sentence += char +#. upper = False +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.else_full_stop +#. sentence = 'Hello there' +#. excited = True +#. if excited: +#. char = '!' +#. else: +#. char = '.' +#. sentence += char +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.spongebob +#. sentence = 'One more exercise, and then you can relax.' +#. upper = True +#. new_sentence = '' +#. for char in sentence: +#. if upper: +#. char = char.upper() +#. upper = False +#. else: +#. char = char.lower() +#. upper = True +#. new_sentence += char +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.undefined_char +#. sentence = 'Hello World' +#. excited = False +#. if excited: +#. char = '!' +#. sentence += char +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.undefined_char.text +#. sentence = 'Hello World' +#. excited = True +#. if excited: +#. char = '!' +#. sentence += char +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingElif.steps.dna_example +#. dna = 'AGTAGCGTC' +#. opposite_dna = '' +#. for char in dna: +#. if char == 'A': +#. char = 'T' +#. if char == 'T': +#. char = 'A' +#. if char == 'G': +#. char = 'C' +#. if char == 'C': +#. char = 'G' +#. opposite_dna += char +#. print(opposite_dna) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingElif.steps.dna_example_with_elif +#. dna = 'AGTAGCGTC' +#. opposite_dna = '' +#. for char in dna: +#. if char == 'A': +#. char = 'T' +#. elif char == 'T': +#. char = 'A' +#. elif char == 'G': +#. char = 'C' +#. elif char == 'C': +#. char = 'G' +#. opposite_dna += char +#. print(opposite_dna) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingElif.steps.dna_example_with_elif.text +#. if char == 'A': +#. char = 'T' +#. elif char == 'T': +#. char = 'A' +#. elif char == 'G': +#. char = 'C' +#. elif char == 'C': +#. char = 'G' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingElif.steps.dna_example_with_else +#. dna = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. opposite_dna = '' +#. for char in dna: +#. if char == 'A': +#. char = 'T' +#. else: +#. if char == 'T': +#. char = 'A' +#. if char == 'G': +#. char = 'C' +#. else: +#. if char == 'C': +#. char = 'G' +#. opposite_dna += char +#. print(opposite_dna) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingElif.steps.dna_example_with_else.hints.0.text +#. if char == 'A': +#. char = 'T' +#. if char == 'T': +#. char = 'A' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingElif.steps.dna_example_with_else.text +#. if char == 'A': +#. char = 'T' +#. else: +#. if char == 'T': +#. char = 'A' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.text +#. def format_board(board): +#. result = '' +#. for i in range(len(board)): +#. for char in board[i]: +#. result += char +#. if i != len(board) - 1: +#. result += '\n' +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_simple +#. def format_board(board): +#. result = '' +#. for i in range(len(board)): +#. for char in board[i]: +#. result += char +#. if i != len(board) - 1: +#. result += '\n' +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_first_character +#. sentence = 'Hello there' +#. include = True +#. new_sentence = '' +#. for char in sentence: +#. if include: +#. new_sentence += char +#. include = False +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_tail +#. sentence = 'Hello World' +#. include = False +#. new_sentence = '' +#. for char in sentence: +#. if include: +#. new_sentence += char +#. include = True +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_tail_snoop +#. sentence = 'Hello World' +#. include = False +#. new_sentence = '' +#. for char in sentence: +#. if include: +#. new_sentence += char +#. include = True +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part1 +#. def substitute(string): +#. result = '' +#. for char in string: +#. if char == 'A': +#. char = 'T' +#. elif char == 'T': +#. char = 'A' +#. elif char == 'G': +#. char = 'C' +#. elif char == 'C': +#. char = 'G' +#. result += char +#. return result +#. original = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. expected = 'TCATCGCAGGAATCAATGTCCTACCGAATA' +#. assert_equal(substitute(original), expected) +msgid "code_bits.char" +msgstr "char" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_exercise +#. string1 = 'Hello' +#. string2 = 'World' +#. for i in range(len(string1)): +#. char1 = string1[i] +#. char2 = string2[i] +#. print(char1 + ' ' + char2) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise +#. string1 = 'Goodbye' +#. string2 = 'World' +#. length1 = len(string1) +#. length2 = len(string2) +#. if length1 > length2: +#. length = length1 +#. else: +#. length = length2 +#. for i in range(length): +#. if i < len(string1): +#. char1 = string1[i] +#. else: +#. char1 = ' ' +#. if i < len(string2): +#. char2 = string2[i] +#. else: +#. char2 = ' ' +#. print(char1 + ' ' + char2) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise.hints.1.text +#. for i in range(...): +#. ... +#. print(char1 + ' ' + char2) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise.text +#. for i in range(len(string1)): +#. char1 = string1[i] +#. char2 = string2[i] +#. print(char1 + ' ' + char2) +msgid "code_bits.char1" +msgstr "char1" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_exercise +#. string1 = 'Hello' +#. string2 = 'World' +#. for i in range(len(string1)): +#. char1 = string1[i] +#. char2 = string2[i] +#. print(char1 + ' ' + char2) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise +#. string1 = 'Goodbye' +#. string2 = 'World' +#. length1 = len(string1) +#. length2 = len(string2) +#. if length1 > length2: +#. length = length1 +#. else: +#. length = length2 +#. for i in range(length): +#. if i < len(string1): +#. char1 = string1[i] +#. else: +#. char1 = ' ' +#. if i < len(string2): +#. char2 = string2[i] +#. else: +#. char2 = ' ' +#. print(char1 + ' ' + char2) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise.hints.1.text +#. for i in range(...): +#. ... +#. print(char1 + ' ' + char2) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise.text +#. for i in range(len(string1)): +#. char1 = string1[i] +#. char2 = string2[i] +#. print(char1 + ' ' + char2) +msgid "code_bits.char2" +msgstr "char2" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BasicForLoopExercises.steps.loop_exercise_1 +#. name = 'World' +#. for character in name: +#. print('---' + character) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BasicForLoopExercises.steps.loop_exercise_1.text +#. name = 'World' +#. for character in name: +#. print(character) +#. print('---') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Indentation.steps.missing_indentation.text +#. for character in name: +#. print(character) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Indentation.steps.missing_indentation.text +#. for character in name: print(character) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Indentation.steps.one_indented_line +#. name = 'World' +#. for character in name: +#. print(character) +#. print('---') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Indentation.steps.two_indented_lines +#. name = 'World' +#. for character in name: +#. print(character) +#. print('---') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingForLoops.steps.first_for_loop +#. name = 'World' +#. for character in name: print(character) +msgid "code_bits.character" +msgstr "character" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner +#. def column_winner(board): +#. for col in range(len(board[0])): +#. all_equal = True +#. piece = board[0][col] +#. for row in board: +#. if row[col] == ' ' or row[col] != piece: +#. all_equal = False +#. break +#. if all_equal: +#. return True +#. return False +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i - 1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner.text +#. def winner(board): +#. ... +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i-1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. assert_equal( +#. winner( +#. [ +#. ['X', 'X', 'X', ' '], +#. ['X', 'X', ' ', ' '], +#. ['X', ' ', 'O', 'X'], +#. [' ', ' ', 'O', 'X'] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' ', 'X'], +#. ['O', 'X', 'O'], +#. ['O', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' '], +#. ['X', 'O'] +#. ] +#. ), +#. True +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input +#. def play_move(board, player): +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.col" +msgstr "col" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i - 1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner.text +#. def winner(board): +#. ... +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i-1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. assert_equal( +#. winner( +#. [ +#. ['X', 'X', 'X', ' '], +#. ['X', 'X', ' ', ' '], +#. ['X', ' ', 'O', 'X'], +#. [' ', ' ', 'O', 'X'] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' ', 'X'], +#. ['O', 'X', 'O'], +#. ['O', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' '], +#. ['X', 'O'] +#. ] +#. ), +#. True +#. ) +msgid "code_bits.column" +msgstr "column" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner +#. def column_winner(board): +#. for col in range(len(board[0])): +#. all_equal = True +#. piece = board[0][col] +#. for row in board: +#. if row[col] == ' ' or row[col] != piece: +#. all_equal = False +#. break +#. if all_equal: +#. return True +#. return False +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner.text +#. def column_winner(board): +#. ... +#. assert_equal( +#. column_winner( +#. [ +#. ['X', 'O', ' '], +#. ['X', 'O', ' '], +#. ['O', 'X', ' '] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. column_winner( +#. [ +#. ['X', 'O', ' ', 'X'], +#. [' ', 'O', 'X', 'O'], +#. ['O', 'O', 'X', 'X'], +#. ['O', 'O', 'X', ' '] +#. ] +#. ), +#. True +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i - 1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner.text +#. def winner(board): +#. ... +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i-1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. assert_equal( +#. winner( +#. [ +#. ['X', 'X', 'X', ' '], +#. ['X', 'X', ' ', ' '], +#. ['X', ' ', 'O', 'X'], +#. [' ', ' ', 'O', 'X'] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' ', 'X'], +#. ['O', 'X', 'O'], +#. ['O', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' '], +#. ['X', 'O'] +#. ] +#. ), +#. True +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.column_winner" +msgstr "column_winner" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.first_if_else +#. condition = True +#. if condition: +#. print('Yes') +#. else: +#. print('No') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.first_if_else_false +#. condition = False +#. if condition: +#. print('Yes') +#. else: +#. print('No') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.introducing_booleans +#. condition = True +#. print(condition) +#. condition = False +#. print(condition) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.cannot_return_multiple_values.text +#. if condition: +#. return value1 +#. else: +#. return value2 +msgid "code_bits.condition" +msgstr "condition" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.excited_confused_exercise +#. sentence = 'Hello' +#. excited = True +#. confused = True +#. if excited: +#. sentence += '!' +#. if confused: +#. sentence += '?' +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.excited_confused_exercise.text +#. sentence = 'Hello World' +#. excited = False +#. confused = True +msgid "code_bits.confused" +msgstr "confused" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingBirdseye.steps.birdseye_loop_example +#. word = 'Amazing' +#. vowels = [] +#. consonants = [] +#. for letter in word: +#. if letter.lower() in 'aeiou': +#. vowels.append(letter) +#. else: +#. consonants.append(letter) +#. print(vowels) +#. print(consonants) +msgid "code_bits.consonants" +msgstr "consonants" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.final_text.text +#. def make_board(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board = [] +#. for _ in range(size): +#. board.append(row.copy()) +#. return board +#. def make_cube(size): +#. cube = [] +#. board = make_board(size) +#. for _ in range(size): +#. cube.append(board.copy()) +#. return cube +#. def test(): +#. cube = make_cube(2) +#. print(cube) +#. cube[0][0][0] = 'X' +#. print(cube) +#. print(cube[0] is cube[1]) +#. print(cube[0][0] is cube[0][1]) +#. print(cube[0][0] is cube[1][0]) +#. test() +msgid "code_bits.cube" +msgstr "cube" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.final_text.text +#. diagonal1 = all_equal([board[0][0], board[1][1], board[2][2]]) +#. diagonal2 = all_equal([board[2][0], board[1][1], board[0][2]]) +#. return diagonal1 or diagonal2 +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i - 1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner.text +#. def winner(board): +#. ... +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i-1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. assert_equal( +#. winner( +#. [ +#. ['X', 'X', 'X', ' '], +#. ['X', 'X', ' ', ' '], +#. ['X', ' ', 'O', 'X'], +#. [' ', ' ', 'O', 'X'] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' ', 'X'], +#. ['O', 'X', 'O'], +#. ['O', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' '], +#. ['X', 'O'] +#. ] +#. ), +#. True +#. ) +msgid "code_bits.diagonal1" +msgstr "diagonal1" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.final_text.text +#. diagonal1 = all_equal([board[0][0], board[1][1], board[2][2]]) +#. diagonal2 = all_equal([board[2][0], board[1][1], board[0][2]]) +#. return diagonal1 or diagonal2 +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i - 1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner.text +#. def winner(board): +#. ... +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i-1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. assert_equal( +#. winner( +#. [ +#. ['X', 'X', 'X', ' '], +#. ['X', 'X', ' ', ' '], +#. ['X', ' ', 'O', 'X'], +#. [' ', ' ', 'O', 'X'] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' ', 'X'], +#. ['O', 'X', 'O'], +#. ['O', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' '], +#. ['X', 'O'] +#. ] +#. ), +#. True +#. ) +msgid "code_bits.diagonal2" +msgstr "diagonal2" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.AndHasHigherPriority +#. def diagonal_winner(board): +#. middle = board[1][1] +#. return ( +#. (middle == board[0][0] and middle == board[2][2]) or +#. (middle == board[0][2] and middle == board[2][0]) +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.AndHasHigherPriority.text +#. def diagonal_winner(board): +#. ... +#. assert_equal( +#. diagonal_winner( +#. [ +#. ['X', 'O', 'X'], +#. ['X', 'X', 'O'], +#. ['O', 'O', 'X'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. diagonal_winner( +#. [ +#. ['X', 'X', 'O'], +#. ['X', 'O', 'O'], +#. ['O', 'X', 'X'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. diagonal_winner( +#. [ +#. ['O', 'X', 'O'], +#. ['X', 'X', 'X'], +#. ['O', 'O', 'X'] +#. ] +#. ), +#. False +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.final_text.text +#. def diagonal_winner(board): +#. middle = board[1][1] +#. return ( +#. (middle == board[0][0] and middle == board[2][2]) or +#. (middle == board[0][2] and middle == board[2][0]) +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner +#. def diagonal_winner(board): +#. all_equal1 = True +#. all_equal2 = True +#. topleft = board[0][0] +#. topright = board[0][-1] +#. for i in range(len(board)): +#. if board[i][i] == ' ' or board[i][i] != topleft: +#. all_equal1 = False +#. if board[i][-i - 1] == ' ' or board[i][-i - 1] != topright: +#. all_equal2 = False +#. return all_equal1 or all_equal2 +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner.text +#. def diagonal_winner(board): +#. ... +#. assert_equal( +#. diagonal_winner( +#. [ +#. ['O', 'X', 'O', 'X'], +#. [' ', 'O', 'X', ' '], +#. ['X', 'X', ' ', 'X'], +#. ['X', ' ', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. diagonal_winner( +#. [ +#. ['X', 'X', ' '], +#. ['X', ' ', 'O'], +#. [' ', 'O', 'O'] +#. ] +#. ), +#. False +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner.text +#. def diagonal_winner(board): +#. middle = board[1][1] +#. return ( +#. (middle == board[0][0] and middle == board[2][2]) or +#. (middle == board[0][2] and middle == board[2][0]) +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i - 1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner.text +#. def winner(board): +#. ... +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i-1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. assert_equal( +#. winner( +#. [ +#. ['X', 'X', 'X', ' '], +#. ['X', 'X', ' ', ' '], +#. ['X', ' ', 'O', 'X'], +#. [' ', ' ', 'O', 'X'] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' ', 'X'], +#. ['O', 'X', 'O'], +#. ['O', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' '], +#. ['X', 'O'] +#. ] +#. ), +#. True +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.diagonal_winner" +msgstr "diagonal_winner" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingElif.steps.dna_example +#. dna = 'AGTAGCGTC' +#. opposite_dna = '' +#. for char in dna: +#. if char == 'A': +#. char = 'T' +#. if char == 'T': +#. char = 'A' +#. if char == 'G': +#. char = 'C' +#. if char == 'C': +#. char = 'G' +#. opposite_dna += char +#. print(opposite_dna) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingElif.steps.dna_example_with_elif +#. dna = 'AGTAGCGTC' +#. opposite_dna = '' +#. for char in dna: +#. if char == 'A': +#. char = 'T' +#. elif char == 'T': +#. char = 'A' +#. elif char == 'G': +#. char = 'C' +#. elif char == 'C': +#. char = 'G' +#. opposite_dna += char +#. print(opposite_dna) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingElif.steps.dna_example_with_else +#. dna = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. opposite_dna = '' +#. for char in dna: +#. if char == 'A': +#. char = 'T' +#. else: +#. if char == 'T': +#. char = 'A' +#. if char == 'G': +#. char = 'C' +#. else: +#. if char == 'C': +#. char = 'G' +#. opposite_dna += char +#. print(opposite_dna) +msgid "code_bits.dna" +msgstr "dna" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.double_numbers +#. numbers = [3, 1, 4, 1, 5, 9, 2, 6, 5] +#. double = [] +#. for number in numbers: +#. double += [number * 2] +#. print(double) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.final_text.text +#. def quadruple(x): +#. x = double(x) +#. x = double(x) +#. return x +#. def quadruple(x): +#. return double(double(x)) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.first_return +#. def double(x): +#. return x * 2 +#. number = 5 +#. twice = double(number) +#. print(number) +#. print(twice) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.losing_return_value +#. def double(x): +#. return x * 2 +#. number = 5 +#. double(number) +#. print(number) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.quadruple_exercise +#. def double(x): +#. return x * 2 +#. def quadruple(x): +#. return double(double(x)) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.complete_quadruple_tests +#. def double(x): +#. return x * 2 +#. def quadruple(x): +#. return double(double(x)) +#. assert_equal(quadruple(2), 8) +#. assert_equal(quadruple(5), 20) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.complete_quadruple_tests.text +#. def double(x): +#. return x * 2 +#. def quadruple(x): +#. return double(double(x)) +#. assert_equal(quadruple(2)) +#. assert_equal(quadruple(5)) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.introducing_assert_equal +#. def double(x): +#. return x * 2 +#. assert_equal(double(2), 4) +#. assert_equal(double(5), 10) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.make_tests_fail +#. def double(x): +#. return x * 3 +#. assert_equal(double(2), 4) +#. assert_equal(double(5), 10) +msgid "code_bits.double" +msgstr "double" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.cannot_return_multiple_values +#. def double_numbers(numbers): +#. for x in numbers: +#. return x * 2 +#. assert_equal(double_numbers([1, 2, 3]), [2, 4, 6]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.return_ends_whole_function.text +#. def double_numbers(numbers): +#. doubles = [] +#. for x in numbers: +#. doubles.append(x * 2) +#. return doubles +#. assert_equal(double_numbers([1, 2, 3]), [2, 4, 6]) +msgid "code_bits.double_numbers" +msgstr "double_numbers" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.return_ends_whole_function.text +#. def double_numbers(numbers): +#. doubles = [] +#. for x in numbers: +#. doubles.append(x * 2) +#. return doubles +#. assert_equal(double_numbers([1, 2, 3]), [2, 4, 6]) +msgid "code_bits.doubles" +msgstr "doubles" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.filter_numbers.text +#. some_list += [element] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.filter_numbers.text +#. some_list.append(element) +msgid "code_bits.element" +msgstr "element" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner +#. def row_winner(board): +#. for row in board: +#. all_equal = True +#. piece = row[0] +#. for entry in row: +#. if entry == ' ' or piece != entry: +#. all_equal = False +#. break +#. if all_equal: +#. return True +#. return False +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i - 1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner.text +#. def winner(board): +#. ... +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i-1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. assert_equal( +#. winner( +#. [ +#. ['X', 'X', 'X', ' '], +#. ['X', 'X', ' ', ' '], +#. ['X', ' ', 'O', 'X'], +#. [' ', ' ', 'O', 'X'] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' ', 'X'], +#. ['O', 'X', 'O'], +#. ['O', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' '], +#. ['X', 'O'] +#. ] +#. ), +#. True +#. ) +msgid "code_bits.entry" +msgstr "entry" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningCompoundStatements.steps.final_text.text +#. sentence = 'Hello World' +#. excited = True +#. new_sentence = '' +#. for char in sentence: +#. new_sentence += char +#. if excited: +#. new_sentence += '!' +#. sentence = new_sentence +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningCompoundStatements.steps.for_inside_if +#. sentence = 'Hello World' +#. excited = True +#. if excited: +#. new_sentence = '' +#. for char in sentence: +#. new_sentence += char + '!' +#. sentence = new_sentence +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.else_full_stop +#. sentence = 'Hello there' +#. excited = True +#. if excited: +#. char = '!' +#. else: +#. char = '.' +#. sentence += char +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.if_upper_else_lower +#. sentence = 'Hello World' +#. excited = True +#. if excited: +#. sentence = sentence.upper() +#. else: +#. sentence = sentence.lower() +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.if_upper_else_lower_false +#. sentence = 'Hello World' +#. excited = False +#. if excited: +#. sentence = sentence.upper() +#. else: +#. sentence = sentence.lower() +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.undefined_char +#. sentence = 'Hello World' +#. excited = False +#. if excited: +#. char = '!' +#. sentence += char +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.undefined_char.text +#. sentence = 'Hello World' +#. excited = True +#. if excited: +#. char = '!' +#. sentence += char +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.excited_confused_exercise +#. sentence = 'Hello' +#. excited = True +#. confused = True +#. if excited: +#. sentence += '!' +#. if confused: +#. sentence += '?' +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.excited_confused_exercise.text +#. sentence = 'Hello World' +#. excited = False +#. confused = True +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.excited_example +#. sentence = 'Hello World' +#. excited = True +#. if excited: +#. sentence += '!' +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.excited_false_example +#. sentence = 'Hello World' +#. excited = False +#. if excited: +#. sentence += '!' +#. print(sentence) +msgid "code_bits.excited" +msgstr "excited" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.introducing_assert_equal.text +#. def assert_equal(actual, expected): +#. if actual == expected: +#. print("OK") +#. else: +#. print(f"Error! {repr(actual)} != {repr(expected)}") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part1 +#. def substitute(string): +#. result = '' +#. for char in string: +#. if char == 'A': +#. char = 'T' +#. elif char == 'T': +#. char = 'A' +#. elif char == 'G': +#. char = 'C' +#. elif char == 'C': +#. char = 'G' +#. result += char +#. return result +#. original = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. expected = 'TCATCGCAGGAATCAATGTCCTACCGAATA' +#. assert_equal(substitute(original), expected) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part2.text +#. def substitute(string, d): +#. ... +#. original = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. expected = 'TCATCGCAGGAATCAATGTCCTACCGAATA' +#. assert_equal(substitute(original, {'A': 'T', 'T': 'A', 'C': 'G', 'G': +#. 'C'}), expected) +msgid "code_bits.expected" +msgstr "expected" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.nested_dictionaries +#. def print_words(words): +#. for word in words: +#. translations = words[word] +#. print(f"English: {word}") +#. for language in translations: +#. print(f"{language}: {translations[language]}") +#. print(f"---") +#. print_words({ +#. 'apple': { +#. 'French': 'pomme', +#. 'German': 'apfel', +#. }, +#. 'box': { +#. 'French': 'boite', +#. 'German': 'kasten', +#. }, +#. }) +msgid "code_bits.f\"---\"" +msgstr "f\"---\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.eval_expr_inside_f_string +#. f"2 * 3 + 4 is equal to {2 * 3 + 4}" +msgid "code_bits.f\"2 * 3 + 4 is equal to {2 * 3 + 4}\"" +msgstr "f\"2 * 3 + 4 is equal to {2 * 3 + 4}\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.nested_dictionaries +#. def print_words(words): +#. for word in words: +#. translations = words[word] +#. print(f"English: {word}") +#. for language in translations: +#. print(f"{language}: {translations[language]}") +#. print(f"---") +#. print_words({ +#. 'apple': { +#. 'French': 'pomme', +#. 'German': 'apfel', +#. }, +#. 'box': { +#. 'French': 'boite', +#. 'German': 'kasten', +#. }, +#. }) +msgid "code_bits.f\"English: {word}\"" +msgstr "f\"English: {word}\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.introducing_assert_equal.text +#. def assert_equal(actual, expected): +#. if actual == expected: +#. print("OK") +#. else: +#. print(f"Error! {repr(actual)} != {repr(expected)}") +msgid "code_bits.f\"Error! {repr(actual)} != {repr(expected)}\"" +msgstr "f\"Error! {repr(actual)} != {repr(expected)}\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_function_name +#. def say_hello(name): +#. print(f"Hello {name}!") +#. print("How are you?") +#. say_hello("Alice") +#. say_hello("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_function_name.text +#. name = "Alice" +#. print(f"Hello {name}!") +#. print("How are you?") +#. name = "Bob" +#. print(f"Hello {name}!") +#. print("How are you?") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.define_greet +#. def greet(name): +#. print(f"Hello {name}!") +#. greet("Alice") +#. greet("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.how_are_you +#. def greet(name): +#. print(f"Hello {name}!") +#. print("How are you?") +#. greet("Alice") +#. greet("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.how_are_you.text +#. def greet(name): +#. print(f"Hello {name}!") +#. print("How are you?") +msgid "code_bits.f\"Hello {name}!\"" +msgstr "f\"Hello {name}!\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_parameter_name +#. def say_hello(person_name): +#. print(f"Hello {person_name}!") +#. print("How are you?") +#. say_hello("Alice") +#. say_hello("Bob") +msgid "code_bits.f\"Hello {person_name}!\"" +msgstr "f\"Hello {person_name}!\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.fix_broken_program +#. people = ['Alice', 'Bob', 'Charlie'] +#. print(f"There are {len(people)} people waiting, the first one's name is +#. {people[0]}.") +msgid "" +"code_bits.f\"There are {len(people)} people waiting, the first one's name is" +" {people[0]}.\"" +msgstr "" +"f\"There are {len(people)} people waiting, the first one's name is " +"{people[0]}.\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.nested_dictionaries +#. def print_words(words): +#. for word in words: +#. translations = words[word] +#. print(f"English: {word}") +#. for language in translations: +#. print(f"{language}: {translations[language]}") +#. print(f"---") +#. print_words({ +#. 'apple': { +#. 'French': 'pomme', +#. 'German': 'apfel', +#. }, +#. 'box': { +#. 'French': 'boite', +#. 'German': 'kasten', +#. }, +#. }) +msgid "code_bits.f\"{language}: {translations[language]}\"" +msgstr "f\"{language}: {translations[language]}\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.break_vs_return +#. def foo(): +#. for letter in 'abc': +#. for number in range(3): +#. print(f"{letter} {number}") +#. if letter == 'b': +#. break +#. foo() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.return_ends_whole_function +#. def foo(): +#. for letter in 'abc': +#. for number in range(3): +#. print(f"{letter} {number}") +#. if letter == 'b': +#. return letter +#. foo() +msgid "code_bits.f\"{letter} {number}\"" +msgstr "f\"{letter} {number}\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings +#. name = "Alice" +#. friend = 'Bob' +#. meal = "lunch" +#. print(f"{name} went to {meal} with {friend}.") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings.requirements +#. f"{name} went to {meal} with {friend}." +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings.text +#. print(f"{name} went to {meal} with {friend}.") +msgid "code_bits.f\"{name} went to {meal} with {friend}.\"" +msgstr "f\"{name} went to {meal} with {friend}.\"" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "" +"code_bits.f' {\" \".join(str(i + 1) for i in " +"range(size))}\\n{line.join(rows)}'" +msgstr "f' {\" \".join(str(i + 1) for i in range(size))}\\n{line.join(rows)}'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.first_input +#. print('Type your name, then press Enter:') +#. name = input() +#. print(f'Hello {name}!') +msgid "code_bits.f'Hello {name}!'" +msgstr "f'Hello {name}!'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.basic_f_string_exercise +#. name = "Alice" +#. age = 20 +#. print(f'Hello {name}. You are {age} years old.') +msgid "code_bits.f'Hello {name}. You are {age} years old.'" +msgstr "f'Hello {name}. You are {age} years old.'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.f'\\n {\"+\".join(\"-\" * size)}\\n'" +msgstr "f'\\n {\"+\".join(\"-\" * size)}\\n'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge +#. def format_board(board): +#. joined_rows = [] +#. for row in board: +#. joined_rows.append("|".join(row)) +#. lines = [] +#. for _ in board[0]: +#. lines.append("-") +#. line = f'\n{"+".join(lines)}\n' +#. return line.join(joined_rows) +msgid "code_bits.f'\\n{\"+\".join(lines)}\\n'" +msgstr "f'\\n{\"+\".join(lines)}\\n'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.f'{i + 1} {\"|\".join(row)}'" +msgstr "f'{i + 1} {\"|\".join(row)}'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.times_table_exercise +#. for left in range(12): +#. left += 1 +#. for right in range(12): +#. right += 1 +#. print(f'{left} x {right} = {left * right}') +#. print('---') +msgid "code_bits.f'{left} x {right} = {left * right}'" +msgstr "f'{left} x {right} = {left * right}'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.first_nested_loop +#. for letter in "ABC": +#. print(letter) +#. for number in range(4): +#. print(f'{letter} {number}') +#. print('---') +msgid "code_bits.f'{letter} {number}'" +msgstr "f'{letter} {number}'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_exercise +#. players = ['Alice', 'Bob', 'Charlie'] +#. for player1 in players: +#. for player2 in players: +#. if player1 != player2: +#. print(f'{player1} vs {player2}') +msgid "code_bits.f'{player1} vs {player2}'" +msgstr "f'{player1} vs {player2}'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.final_text.text +#. players = ['Charlie', 'Alice', 'Dylan', 'Bob'] +#. for i in range(len(players)): +#. for j in range(len(players)): +#. if i < j: +#. print(f'{players[i]} vs {players[j]}') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus +#. players = ['Alice', 'Bob', 'Charlie'] +#. for i in range(len(players)): +#. for j in range(len(players)): +#. if i < j: +#. print(f'{players[i]} vs {players[j]}') +msgid "code_bits.f'{players[i]} vs {players[j]}'" +msgstr "f'{players[i]} vs {players[j]}'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.f'{player} to play:'" +msgstr "f'{player} to play:'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.f'{player} wins!'" +msgstr "f'{player} wins!'" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority +#. def invalid_image(filename): +#. return not (filename.endswith(".png") or filename.endswith(".jpg")) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.hints.0.text +#. def valid_image(filename): +#. if filename.endswith(".png") or filename.endswith(".jpg"): +#. return True +#. else: +#. return False +#. assert_equal(valid_image("dog.png"), True) +#. assert_equal(valid_image("cat.jpg"), True) +#. assert_equal(valid_image("invoice.pdf"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.hints.3.text +#. def valid_image(filename): +#. return filename.endswith(".png") or filename.endswith(".jpg") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.text +#. def invalid_image(filename): +#. if filename.endswith(".png") or filename.endswith(".jpg"): +#. return False +#. else: +#. return True +#. assert_equal(invalid_image("dog.png"), False) +#. assert_equal(invalid_image("cat.jpg"), False) +#. assert_equal(invalid_image("invoice.pdf"), True) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.text +#. if invalid_image(filename): +#. print("I can't process " + filename) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.final_text.text +#. def invalid_image(filename): +#. return not (filename.endswith(".png") or filename.endswith(".jpg")) +#. def invalid_image(filename): +#. return not filename.endswith(".png") and not +#. filename.endswith(".jpg") +msgid "code_bits.filename" +msgstr "filename" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.final_text.text +#. first = x1 +#. if x2 < first: +#. first = x2 +#. if x3 < first: +#. first = x3 +#. print(first) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.final_text.text +#. if x1 < x2: +#. if x1 < x3: +#. first = x1 +#. else: +#. first = x3 +#. else: +#. if x2 < x3: +#. first = x2 +#. else: +#. first = x3 +#. print(first) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.min_three_exercise +#. x1 = 1 +#. x2 = 2 +#. x3 = 3 +#. if x1 < x2: +#. if x1 < x3: +#. first = x1 +#. else: +#. first = x3 +#. else: +#. if x2 < x3: +#. first = x2 +#. else: +#. first = x3 +#. print(first) +msgid "code_bits.first" +msgstr "first" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input.text +#. def format_board(board): +#. first_row = ' ' +#. for i in range(len(board)): +#. first_row += str(i + 1) +#. joined_rows = [first_row] +#. for i in range(len(board)): +#. joined_row = str(i + 1) + ''.join(board[i]) +#. joined_rows.append(joined_row) +#. return "\n".join(joined_rows) +#. def play_game(): +#. board = [ +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ] +#. print(format_board(board)) +#. print('\nX to play:\n') +#. play_move(board, 'X') +#. print(format_board(board)) +#. print('\nO to play:\n') +#. play_move(board, 'O') +#. print(format_board(board)) +#. def play_move(board, player): +#. ... +#. play_game() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.format_board_with_numbers +#. def format_board(board): +#. first_row = ' ' +#. for i in range(len(board)): +#. first_row += str(i + 1) +#. joined_rows = [first_row] +#. for i in range(len(board)): +#. joined_row = str(i + 1) + ''.join(board[i]) +#. joined_rows.append(joined_row) +#. return "\n".join(joined_rows) +msgid "code_bits.first_row" +msgstr "first_row" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.break_vs_return +#. def foo(): +#. for letter in 'abc': +#. for number in range(3): +#. print(f"{letter} {number}") +#. if letter == 'b': +#. break +#. foo() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.double_return_in_one_function +#. def foo(): +#. return 1 +#. return 2 +#. print(foo()) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.return_ends_whole_function +#. def foo(): +#. for letter in 'abc': +#. for number in range(3): +#. print(f"{letter} {number}") +#. if letter == 'b': +#. return letter +#. foo() +msgid "code_bits.foo" +msgstr "foo" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input.text +#. def format_board(board): +#. first_row = ' ' +#. for i in range(len(board)): +#. first_row += str(i + 1) +#. joined_rows = [first_row] +#. for i in range(len(board)): +#. joined_row = str(i + 1) + ''.join(board[i]) +#. joined_rows.append(joined_row) +#. return "\n".join(joined_rows) +#. def play_game(): +#. board = [ +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ] +#. print(format_board(board)) +#. print('\nX to play:\n') +#. play_move(board, 'X') +#. print(format_board(board)) +#. print('\nO to play:\n') +#. play_move(board, 'O') +#. print(format_board(board)) +#. def play_move(board, player): +#. ... +#. play_game() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge +#. def format_board(board): +#. joined_rows = [] +#. for row in board: +#. joined_rows.append("|".join(row)) +#. lines = [] +#. for _ in board[0]: +#. lines.append("-") +#. line = f'\n{"+".join(lines)}\n' +#. return line.join(joined_rows) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.text +#. def format_board(board): +#. ... +#. assert_equal( +#. format_board([ +#. ['X', 'O', 'X'], +#. ['O', ' ', ' '], +#. [' ', 'X', 'O'] +#. ]), +#. 'X|O|X\n-+-+-\nO| | \n-+-+-\n |X|O' +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.text +#. def format_board(board): +#. joined_rows = [] +#. for row in board: +#. joined_rows.append("".join(row)) +#. return "\n".join(joined_rows) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.text +#. def format_board(board): +#. result = '' +#. for i in range(len(board)): +#. for char in board[i]: +#. result += char +#. if i != len(board) - 1: +#. result += '\n' +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_simple +#. def format_board(board): +#. result = '' +#. for i in range(len(board)): +#. for char in board[i]: +#. result += char +#. if i != len(board) - 1: +#. result += '\n' +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_simple.text +#. def format_board(board): +#. ... +#. assert_equal( +#. format_board([ +#. ['X', 'O', 'X'], +#. ['O', ' ', ' '], +#. [' ', 'X', 'O'] +#. ]), +#. 'XOX\nO \n XO' +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.invalid_multi_line_string.text +#. def format_board(board): +#. ... +#. return ... +#. assert_equal(format_board([...]), "...") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.format_board_with_numbers +#. def format_board(board): +#. first_row = ' ' +#. for i in range(len(board)): +#. first_row += str(i + 1) +#. joined_rows = [first_row] +#. for i in range(len(board)): +#. joined_row = str(i + 1) + ''.join(board[i]) +#. joined_rows.append(joined_row) +#. return "\n".join(joined_rows) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.format_board_with_numbers.text +#. def format_board(board): +#. ... +#. assert_equal( +#. format_board([ +#. ['X', 'O', 'X'], +#. ['O', ' ', ' '], +#. [' ', 'X', 'O'] +#. ]), +#. ' 123\n1XOX\n2O \n3 XO' +#. ) +msgid "code_bits.format_board" +msgstr "format_board" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.final_text.text +#. for thing in things: +#. if thing == thing_to_find: +#. found = True +#. break +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.final_text.text +#. found = False +#. for thing in things: +#. if thing == thing_to_find: +#. found = True +#. print(found) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.list_contains_exercise +#. things = ['This', 'is', 'a', 'list'] +#. thing_to_find = 'is' +#. found = False +#. for thing in things: +#. if thing == thing_to_find: +#. found = True +#. print(found) +msgid "code_bits.found" +msgstr "found" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_french +#. def print_words(french): +#. for word in french: +#. print("English: " + word) +#. print("French: " + french[word]) +#. print("---") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_french.text +#. def print_words(french): +#. ... +#. print_words({'apple': 'pomme', 'box': 'boite'}) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german +#. def print_words(french, german): +#. for word in french: +#. print("English: " + word) +#. print("French: " + french[word]) +#. print("German: " + german[word]) +#. print("---") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german.text +#. def print_words(french, german): +#. ... +#. print_words( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingDictionaries.steps.dict_access +#. french[0] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingDictionaries.steps.dict_access2 +#. french['apple'] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingDictionaries.steps.dict_access3 +#. french['box'] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingDictionaries.steps.dict_access4 +#. french['pomme'] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingDictionaries.steps.first_dict +#. french = {'apple': 'pomme', 'box': 'boite'} +msgid "code_bits.french" +msgstr "french" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings +#. name = "Alice" +#. friend = 'Bob' +#. meal = "lunch" +#. print(f"{name} went to {meal} with {friend}.") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings.requirements +#. name + " went to " + meal + " with " + friend + '.' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings.text +#. name = "Alice" +#. friend = 'Bob' +#. meal = "lunch" +#. print(name + " went to " + meal + " with " + friend + '.') +msgid "code_bits.friend" +msgstr "friend" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.modify_list_in_function +#. def play_move(board, player): +#. board[1] = player +#. def play_game(): +#. game_board = [" ", " ", " "] +#. play_move(game_board, "X") +#. print(game_board) +#. play_game() +msgid "code_bits.game_board" +msgstr "game_board" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german +#. def print_words(french, german): +#. for word in french: +#. print("English: " + word) +#. print("French: " + french[word]) +#. print("German: " + german[word]) +#. print("---") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german.text +#. def print_words(french, german): +#. ... +#. print_words( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +msgid "code_bits.german" +msgstr "german" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.grades_example +#. percentage = 73 +#. if percentage < 40: +#. grade = 'F' +#. elif percentage < 60: +#. grade = 'C' +#. elif percentage < 80: +#. grade = 'B' +#. else: +#. grade = 'A' +#. print(grade) +msgid "code_bits.grade" +msgstr "grade" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.define_greet +#. def greet(name): +#. print(f"Hello {name}!") +#. greet("Alice") +#. greet("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.how_are_you +#. def greet(name): +#. print(f"Hello {name}!") +#. print("How are you?") +#. greet("Alice") +#. greet("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.how_are_you.text +#. def greet(name): +#. print(f"Hello {name}!") +#. print("How are you?") +msgid "code_bits.greet" +msgstr "greet" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.convert_input_to_int +#. super_secret_number = 7 +#. print("What number am I thinking of?") +#. guess = input() +#. if int(guess) == super_secret_number: +#. print("Amazing! Are you psychic?") +#. else: +#. print("Nope!") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.convert_input_to_int.text +#. super_secret_number = 7 +#. print("What number am I thinking of?") +#. guess = input() +#. if guess == super_secret_number: +#. print("Amazing! Are you psychic?") +#. else: +#. print("Nope!") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.final_text.text +#. if guess == str(super_secret_number): +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.final_text.text +#. if int(guess) == super_secret_number: +msgid "code_bits.guess" +msgstr "guess" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.hello_plus_equals +#. hello = 'Hello' +#. print(hello) +#. hello = hello + '!' +#. print(hello) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle.text +#. temp = hello +#. hello = temp + '!' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle.text +#. temp = hello + '!' +#. hello = temp +msgid "code_bits.hello" +msgstr "hello" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_first_character +#. sentence = 'Hello there' +#. include = True +#. new_sentence = '' +#. for char in sentence: +#. if include: +#. new_sentence += char +#. include = False +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_tail +#. sentence = 'Hello World' +#. include = False +#. new_sentence = '' +#. for char in sentence: +#. if include: +#. new_sentence += char +#. include = True +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_tail_snoop +#. sentence = 'Hello World' +#. include = False +#. new_sentence = '' +#. for char in sentence: +#. if include: +#. new_sentence += char +#. include = True +#. print(new_sentence) +msgid "code_bits.include" +msgstr "include" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.pop_predict_exercise.text +#. some_list.pop(index) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.subscript_assignment_predict.text +#. some_list[index] = new_value +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.print_indices_and_words +#. words = ['Python'] +#. for index in range(len(words)): +#. print(index) +#. print(words[index]) +msgid "code_bits.index" +msgstr "index" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.indices_out_of_bounds +#. indices[4] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.printing_the_range +#. indices = range(4) +#. print(indices[0]) +#. print(indices[1]) +#. print(indices[2]) +#. print(indices[3]) +msgid "code_bits.indices" +msgstr "indices" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.negative_index_concatenation_exercise.text +#. x = ['a', 'b', 'c'] +#. y = (insert_one_line_from_above) +#. print(y) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.pop_remove_index_subscript_assignment.text +#. x = ['a', 'b', 'c'] +#. (insert_one_line_from_above) +#. print(x) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.subscript_assignment_exercise.text +#. x = ['a', 'b', 'c'] +#. (insert_one_line_from_above) +#. print(x) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.average_exercise.text +#. x = [15, 12, -6, 3] +#. y = (insert_one_line_from_above) +#. print(y) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.second_smallest_in_list_exercise.text +#. x = [12, -6, 2, -1, 3] +#. y = (insert_one_line_from_above) +#. print(y) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.sum_range_exercise.text +#. x = 100 +#. y = (insert_one_line_from_above) +#. print(y) +msgid "code_bits.insert_one_line_from_above" +msgstr "insert_one_line_from_above" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority +#. def invalid_image(filename): +#. return not (filename.endswith(".png") or filename.endswith(".jpg")) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.text +#. def invalid_image(filename): +#. if filename.endswith(".png") or filename.endswith(".jpg"): +#. return False +#. else: +#. return True +#. assert_equal(invalid_image("dog.png"), False) +#. assert_equal(invalid_image("cat.jpg"), False) +#. assert_equal(invalid_image("invoice.pdf"), True) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.text +#. if invalid_image(filename): +#. print("I can't process " + filename) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.final_text.text +#. def invalid_image(filename): +#. return not (filename.endswith(".png") or filename.endswith(".jpg")) +#. def invalid_image(filename): +#. return not filename.endswith(".png") and not +#. filename.endswith(".jpg") +msgid "code_bits.invalid_image" +msgstr "invalid_image" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ACommonMistake +#. def is_friend(name): +#. return name == "Alice" or "Bob" +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.FurtherImprovement +#. def is_friend(name): +#. return name == "Alice" or name == "Bob" +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ImprovingWithOr +#. def is_friend(name): +#. if name == "Alice" or name == "Bob": +#. return True +#. else: +#. return False +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.InputAliceBob +#. def is_friend(name): +#. if name == "Alice": +#. return True +#. elif name == "Bob": +#. return True +#. else: +#. return False +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.InspectWithBirdseye +#. def is_friend(name): +#. return name == "Alice" or "Bob" +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MultiLineExpressions.steps.valid_multiline +#. name = "Bob" +#. is_friend = name == "Alice" or \ +#. name == "Bob" +#. print(is_friend) +#. is_friend = (name == "Alice" or +#. name == "Bob") +#. print(is_friend) +#. is_friend = [name == "Alice", +#. name == "Bob"] +#. print(is_friend) +#. print(name == "Alice" or +#. name == "Bob") +msgid "code_bits.is_friend" +msgstr "is_friend" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.AndExercise +#. def is_valid_percentage(x): +#. if 0 <= x and x <= 100: +#. return True +#. else: +#. return False +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.AndExercise.text +#. def is_valid_percentage(x): +#. if x < 0 or x > 100: +#. return False +#. else: +#. return True +#. assert_equal(is_valid_percentage(-1), False) +#. assert_equal(is_valid_percentage(0), True) +#. assert_equal(is_valid_percentage(50), True) +#. assert_equal(is_valid_percentage(100), True) +#. assert_equal(is_valid_percentage(101), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.TicTacToeWinningRow.text +#. def is_valid_percentage(x): +#. if 0 <= x and x <= 100: +#. return True +#. else: +#. return False +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.TicTacToeWinningRow.text +#. def is_valid_percentage(x): +#. return 0 <= x <= 100 +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.TicTacToeWinningRow.text +#. def is_valid_percentage(x): +#. return 0 <= x and x <= 100 +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise +#. def is_valid_percentage(x): +#. if x < 0 or x > 100: +#. return False +#. else: +#. return True +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise.text +#. assert_equal(is_valid_percentage(-1), False) +#. assert_equal(is_valid_percentage(0), True) +#. assert_equal(is_valid_percentage(50), True) +#. assert_equal(is_valid_percentage(100), True) +#. assert_equal(is_valid_percentage(101), False) +msgid "code_bits.is_valid_percentage" +msgstr "is_valid_percentage" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in quantities: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.text +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in ...: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1 +#. def total_cost(cart, prices): +#. result = 0 +#. for item in cart: +#. price = prices[item] +#. result += price +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1.text +#. def total_cost(cart, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. result += price +#. return result +#. assert_equal( +#. total_cost( +#. ['apple', 'box', 'cat'], +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 107, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4 +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4.text +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. quantity = ... +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. ['dog', 'box'], +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +msgid "code_bits.item" +msgstr "item" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input.text +#. def format_board(board): +#. first_row = ' ' +#. for i in range(len(board)): +#. first_row += str(i + 1) +#. joined_rows = [first_row] +#. for i in range(len(board)): +#. joined_row = str(i + 1) + ''.join(board[i]) +#. joined_rows.append(joined_row) +#. return "\n".join(joined_rows) +#. def play_game(): +#. board = [ +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ] +#. print(format_board(board)) +#. print('\nX to play:\n') +#. play_move(board, 'X') +#. print(format_board(board)) +#. print('\nO to play:\n') +#. play_move(board, 'O') +#. print(format_board(board)) +#. def play_move(board, player): +#. ... +#. play_game() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.format_board_with_numbers +#. def format_board(board): +#. first_row = ' ' +#. for i in range(len(board)): +#. first_row += str(i + 1) +#. joined_rows = [first_row] +#. for i in range(len(board)): +#. joined_row = str(i + 1) + ''.join(board[i]) +#. joined_rows.append(joined_row) +#. return "\n".join(joined_rows) +msgid "code_bits.joined_row" +msgstr "joined_row" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input.text +#. def format_board(board): +#. first_row = ' ' +#. for i in range(len(board)): +#. first_row += str(i + 1) +#. joined_rows = [first_row] +#. for i in range(len(board)): +#. joined_row = str(i + 1) + ''.join(board[i]) +#. joined_rows.append(joined_row) +#. return "\n".join(joined_rows) +#. def play_game(): +#. board = [ +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ] +#. print(format_board(board)) +#. print('\nX to play:\n') +#. play_move(board, 'X') +#. print(format_board(board)) +#. print('\nO to play:\n') +#. play_move(board, 'O') +#. print(format_board(board)) +#. def play_move(board, player): +#. ... +#. play_game() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge +#. def format_board(board): +#. joined_rows = [] +#. for row in board: +#. joined_rows.append("|".join(row)) +#. lines = [] +#. for _ in board[0]: +#. lines.append("-") +#. line = f'\n{"+".join(lines)}\n' +#. return line.join(joined_rows) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.text +#. def format_board(board): +#. joined_rows = [] +#. for row in board: +#. joined_rows.append("".join(row)) +#. return "\n".join(joined_rows) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.format_board_with_numbers +#. def format_board(board): +#. first_row = ' ' +#. for i in range(len(board)): +#. first_row += str(i + 1) +#. joined_rows = [first_row] +#. for i in range(len(board)): +#. joined_row = str(i + 1) + ''.join(board[i]) +#. joined_rows.append(joined_row) +#. return "\n".join(joined_rows) +msgid "code_bits.joined_rows" +msgstr "joined_rows" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.keys_are_iterable +#. quantities = {'apple': 1, 'cat': 10} +#. for key in quantities.keys(): +#. print(key) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.keys_are_iterable2 +#. quantities = {'apple': 1, 'cat': 10} +#. for key in quantities: +#. print(key) +msgid "code_bits.key" +msgstr "key" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.nested_dictionaries +#. def print_words(words): +#. for word in words: +#. translations = words[word] +#. print(f"English: {word}") +#. for language in translations: +#. print(f"{language}: {translations[language]}") +#. print(f"---") +#. print_words({ +#. 'apple': { +#. 'French': 'pomme', +#. 'German': 'apfel', +#. }, +#. 'box': { +#. 'French': 'boite', +#. 'German': 'kasten', +#. }, +#. }) +msgid "code_bits.language" +msgstr "language" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.times_table_exercise +#. for left in range(12): +#. left += 1 +#. for right in range(12): +#. right += 1 +#. print(f'{left} x {right} = {left * right}') +#. print('---') +msgid "code_bits.left" +msgstr "left" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsTerminology.steps.len_of_none +#. things = print([1, 2, 3]) +#. length = len(things) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsTerminology.steps.print_returns_none +#. things = [1, 2, 3] +#. length = len(things) +#. printed = print(length) +#. print(printed) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise +#. string1 = 'Goodbye' +#. string2 = 'World' +#. length1 = len(string1) +#. length2 = len(string2) +#. if length1 > length2: +#. length = length1 +#. else: +#. length = length2 +#. for i in range(length): +#. if i < len(string1): +#. char1 = string1[i] +#. else: +#. char1 = ' ' +#. if i < len(string2): +#. char2 = string2[i] +#. else: +#. char2 = ' ' +#. print(char1 + ' ' + char2) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise +#. size = 3 +#. for i in range(size): +#. length = size - i +#. line = '' +#. for _ in range(length): +#. line += '+' +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_longest_strings_exercise +#. strings = ['abcqwe', 'def', 'ghiq'] +#. lengths = [] +#. for string in strings: +#. lengths.append(len(string)) +#. length = max(lengths) +#. for i in range(length): +#. line = "" +#. for string in strings: +#. if i >= len(string): +#. line += " " +#. else: +#. line += string[i] +#. print(line) +msgid "code_bits.length" +msgstr "length" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise +#. string1 = 'Goodbye' +#. string2 = 'World' +#. length1 = len(string1) +#. length2 = len(string2) +#. if length1 > length2: +#. length = length1 +#. else: +#. length = length2 +#. for i in range(length): +#. if i < len(string1): +#. char1 = string1[i] +#. else: +#. char1 = ' ' +#. if i < len(string2): +#. char2 = string2[i] +#. else: +#. char2 = ' ' +#. print(char1 + ' ' + char2) +msgid "code_bits.length1" +msgstr "length1" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise +#. string1 = 'Goodbye' +#. string2 = 'World' +#. length1 = len(string1) +#. length2 = len(string2) +#. if length1 > length2: +#. length = length1 +#. else: +#. length = length2 +#. for i in range(length): +#. if i < len(string1): +#. char1 = string1[i] +#. else: +#. char1 = ' ' +#. if i < len(string2): +#. char2 = string2[i] +#. else: +#. char2 = ' ' +#. print(char1 + ' ' + char2) +msgid "code_bits.length2" +msgstr "length2" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_longest_strings_exercise +#. strings = ['abcqwe', 'def', 'ghiq'] +#. lengths = [] +#. for string in strings: +#. lengths.append(len(string)) +#. length = max(lengths) +#. for i in range(length): +#. line = "" +#. for string in strings: +#. if i >= len(string): +#. line += " " +#. else: +#. line += string[i] +#. print(line) +msgid "code_bits.lengths" +msgstr "lengths" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingBirdseye.steps.birdseye_loop_example +#. word = 'Amazing' +#. vowels = [] +#. consonants = [] +#. for letter in word: +#. if letter.lower() in 'aeiou': +#. vowels.append(letter) +#. else: +#. consonants.append(letter) +#. print(vowels) +#. print(consonants) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.first_nested_loop +#. for letter in "ABC": +#. print(letter) +#. for number in range(4): +#. print(f'{letter} {number}') +#. print('---') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.break_vs_return +#. def foo(): +#. for letter in 'abc': +#. for number in range(3): +#. print(f"{letter} {number}") +#. if letter == 'b': +#. break +#. foo() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.return_ends_whole_function +#. def foo(): +#. for letter in 'abc': +#. for number in range(3): +#. print(f"{letter} {number}") +#. if letter == 'b': +#. return letter +#. foo() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part2 +#. def substitute(string, d): +#. result = "" +#. for letter in string: +#. result += d[letter] +#. return result +msgid "code_bits.letter" +msgstr "letter" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.crack_password_exercise +#. letters = 'AB' +#. for c1 in letters: +#. for c2 in letters: +#. for c3 in letters: +#. for c4 in letters: +#. print(c1 + c2 + c3 + c4) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.crack_password_exercise.text +#. letters = "ABCD" +msgid "code_bits.letters" +msgstr "letters" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +#. def surround(string, sides): +#. return sides + string + sides +#. def alert(string, level): +#. string = surround(string, ' ') +#. for _ in range(level): +#. string = surround(string, '!') +#. return string +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise.text +#. def alert(string, level): +msgid "code_bits.level" +msgstr "level" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle +#. name = 'World' +#. line = '-' +#. for char in name: +#. line = line + char +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle_empty_string +#. name = 'World' +#. line = '' +#. for char in name: +#. line = line + char +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle_missing_last_line +#. name = 'World' +#. line = '-' +#. for char in name: +#. print(line) +#. line = line + char +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_box +#. name = 'World' +#. line = '' +#. for _ in name: +#. line += '-' +#. line = '+' + line + '+' +#. print(line) +#. print('|' + name + '|') +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_box_2 +#. name = 'World' +#. line = '+' + name + '+' +#. spaces = '' +#. for _ in name: +#. spaces += ' ' +#. print(line) +#. for char in name: +#. print(char + spaces + char) +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_triangle_backwards +#. name = 'World' +#. line = '' +#. for char in name: +#. line = char + line +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_triangle_spaced +#. name = 'World' +#. line = '' +#. for char in name: +#. line = line + char + ' ' +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_triangle_spaced.text +#. name = 'World' +#. line = '' +#. for char in name: +#. line = line + char +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_underlined +#. name = 'World' +#. line = '' +#. for _ in name: +#. line += '-' +#. print(name) +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_underlined.text +#. line += char +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_underlined.text +#. line = line + char +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise +#. size = 3 +#. for i in range(size): +#. length = size - i +#. line = '' +#. for _ in range(length): +#. line += '+' +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_longest_strings_exercise +#. strings = ['abcqwe', 'def', 'ghiq'] +#. lengths = [] +#. for string in strings: +#. lengths.append(len(string)) +#. length = max(lengths) +#. for i in range(length): +#. line = "" +#. for string in strings: +#. if i >= len(string): +#. line += " " +#. else: +#. line += string[i] +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_strings_list_exercise +#. strings = ['abc', 'def', 'ghi'] +#. for i in range(len(strings[0])): +#. line = "" +#. for string in strings: +#. line += string[i] +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge +#. def format_board(board): +#. joined_rows = [] +#. for row in board: +#. joined_rows.append("|".join(row)) +#. lines = [] +#. for _ in board[0]: +#. lines.append("-") +#. line = f'\n{"+".join(lines)}\n' +#. return line.join(joined_rows) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.line" +msgstr "line" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge +#. def format_board(board): +#. joined_rows = [] +#. for row in board: +#. joined_rows.append("|".join(row)) +#. lines = [] +#. for _ in board[0]: +#. lines.append("-") +#. line = f'\n{"+".join(lines)}\n' +#. return line.join(joined_rows) +msgid "code_bits.lines" +msgstr "lines" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.EqualsVsIs.steps.final_text.text +#. list2 = list1.copy() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.EqualsVsIs.steps.same_list +#. list1 = [1, 2, 3] +#. list2 = list1 +#. print(list1) +#. print(list2) +#. print(list1 == list2) +#. print(list1 is list2) +#. list1.append(4) +#. print(list1) +#. print(list2) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.EqualsVsIs.steps.two_separate_lists +#. list1 = [1, 2, 3] +#. list2 = [1, 2, 3] +#. print(list1) +#. print(list2) +#. print(list1 == list2) +#. print(list1 is list2) +#. list1.append(4) +#. print(list1) +#. print(list2) +msgid "code_bits.list1" +msgstr "list1" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.EqualsVsIs.steps.final_text.text +#. list2 = list1.copy() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.EqualsVsIs.steps.same_list +#. list1 = [1, 2, 3] +#. list2 = list1 +#. print(list1) +#. print(list2) +#. print(list1 == list2) +#. print(list1 is list2) +#. list1.append(4) +#. print(list1) +#. print(list2) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.EqualsVsIs.steps.two_separate_lists +#. list1 = [1, 2, 3] +#. list2 = [1, 2, 3] +#. print(list1) +#. print(list2) +#. print(list1 == list2) +#. print(list1 is list2) +#. list1.append(4) +#. print(list1) +#. print(list2) +msgid "code_bits.list2" +msgstr "list2" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.main_diagonal_winner" +msgstr "main_diagonal_winner" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.final_text.text +#. def make_board(size): +#. board = [] +#. for _ in range(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board.append(row) +#. return board +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.final_text.text +#. def make_board(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board = [] +#. for _ in range(size): +#. board.append(row.copy()) +#. return board +#. def make_cube(size): +#. cube = [] +#. board = make_board(size) +#. for _ in range(size): +#. cube.append(board.copy()) +#. return cube +#. def test(): +#. cube = make_cube(2) +#. print(cube) +#. cube[0][0][0] = 'X' +#. print(cube) +#. print(cube[0] is cube[1]) +#. print(cube[0][0] is cube[0][1]) +#. print(cube[0][0] is cube[1][0]) +#. test() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.fix_make_board +#. def make_board(size): +#. board = [] +#. for _ in range(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board.append(row) +#. return board +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.naive_make_board +#. def make_board(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board = [] +#. for _ in range(size): +#. board.append(row) +#. return board +#. def test(): +#. board = make_board(3) +#. assert_equal(board, [ +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ]) +#. board[0][0] = 'X' +#. assert_equal(board, [ +#. ['X', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ]) +#. test() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.make_board" +msgstr "make_board" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.final_text.text +#. def make_board(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board = [] +#. for _ in range(size): +#. board.append(row.copy()) +#. return board +#. def make_cube(size): +#. cube = [] +#. board = make_board(size) +#. for _ in range(size): +#. cube.append(board.copy()) +#. return cube +#. def test(): +#. cube = make_cube(2) +#. print(cube) +#. cube[0][0][0] = 'X' +#. print(cube) +#. print(cube[0] is cube[1]) +#. print(cube[0][0] is cube[0][1]) +#. print(cube[0][0] is cube[1][0]) +#. test() +msgid "code_bits.make_cube" +msgstr "make_cube" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings +#. name = "Alice" +#. friend = 'Bob' +#. meal = "lunch" +#. print(f"{name} went to {meal} with {friend}.") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings.requirements +#. name + " went to " + meal + " with " + friend + '.' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings.text +#. name = "Alice" +#. friend = 'Bob' +#. meal = "lunch" +#. print(name + " went to " + meal + " with " + friend + '.') +msgid "code_bits.meal" +msgstr "meal" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.AndHasHigherPriority +#. def diagonal_winner(board): +#. middle = board[1][1] +#. return ( +#. (middle == board[0][0] and middle == board[2][2]) or +#. (middle == board[0][2] and middle == board[2][0]) +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningAndAndOr.steps.final_text.text +#. def diagonal_winner(board): +#. middle = board[1][1] +#. return ( +#. (middle == board[0][0] and middle == board[2][2]) or +#. (middle == board[0][2] and middle == board[2][0]) +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner.text +#. def diagonal_winner(board): +#. middle = board[1][1] +#. return ( +#. (middle == board[0][0] and middle == board[2][2]) or +#. (middle == board[0][2] and middle == board[2][0]) +#. ) +msgid "code_bits.middle" +msgstr "middle" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BasicForLoopExercises.steps.loop_exercise_1 +#. name = 'World' +#. for character in name: +#. print('---' + character) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BasicForLoopExercises.steps.loop_exercise_1.text +#. name = 'World' +#. for character in name: +#. print(character) +#. print('---') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BasicForLoopExercises.steps.loop_exercise_2 +#. name = 'World' +#. for _ in name: +#. print(name) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle +#. name = 'World' +#. line = '-' +#. for char in name: +#. line = line + char +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle_empty_string +#. name = 'World' +#. line = '' +#. for char in name: +#. line = line + char +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle_missing_last_line +#. name = 'World' +#. line = '-' +#. for char in name: +#. print(line) +#. line = line + char +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.diagonal_name_bonus_challenge +#. name = 'World' +#. spaces = '' +#. for char in name: +#. print(spaces + char) +#. spaces += ' ' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_box +#. name = 'World' +#. line = '' +#. for _ in name: +#. line += '-' +#. line = '+' + line + '+' +#. print(line) +#. print('|' + name + '|') +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_box_2 +#. name = 'World' +#. line = '+' + name + '+' +#. spaces = '' +#. for _ in name: +#. spaces += ' ' +#. print(line) +#. for char in name: +#. print(char + spaces + char) +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_triangle_backwards +#. name = 'World' +#. line = '' +#. for char in name: +#. line = char + line +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_triangle_spaced +#. name = 'World' +#. line = '' +#. for char in name: +#. line = line + char + ' ' +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_triangle_spaced.text +#. name = 'World' +#. line = '' +#. for char in name: +#. line = line + char +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_underlined +#. name = 'World' +#. line = '' +#. for _ in name: +#. line += '-' +#. print(name) +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_function_name +#. def say_hello(name): +#. print(f"Hello {name}!") +#. print("How are you?") +#. say_hello("Alice") +#. say_hello("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_function_name.text +#. name = "Alice" +#. print(f"Hello {name}!") +#. print("How are you?") +#. name = "Bob" +#. print(f"Hello {name}!") +#. print("How are you?") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.define_greet +#. def greet(name): +#. print(f"Hello {name}!") +#. greet("Alice") +#. greet("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.how_are_you +#. def greet(name): +#. print(f"Hello {name}!") +#. print("How are you?") +#. greet("Alice") +#. greet("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.how_are_you.text +#. def greet(name): +#. print(f"Hello {name}!") +#. print("How are you?") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Indentation.steps.missing_indentation.text +#. for character in name: +#. print(character) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Indentation.steps.missing_indentation.text +#. for character in name: print(character) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Indentation.steps.one_indented_line +#. name = 'World' +#. for character in name: +#. print(character) +#. print('---') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Indentation.steps.two_indented_lines +#. name = 'World' +#. for character in name: +#. print(character) +#. print('---') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.first_input +#. print('Type your name, then press Enter:') +#. name = input() +#. print(f'Hello {name}!') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingForLoops.steps.first_for_loop +#. name = 'World' +#. for character in name: print(character) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.basic_f_string_exercise +#. name = "Alice" +#. age = 20 +#. print(f'Hello {name}. You are {age} years old.') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.concatenate_string_number +#. name = "Alice" +#. age = 20 +#. print("Hello " + name + ". You are " + age + " years old.") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings +#. name = "Alice" +#. friend = 'Bob' +#. meal = "lunch" +#. print(f"{name} went to {meal} with {friend}.") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings.requirements +#. name + " went to " + meal + " with " + friend + '.' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.introduce_f_strings.text +#. name = "Alice" +#. friend = 'Bob' +#. meal = "lunch" +#. print(name + " went to " + meal + " with " + friend + '.') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ACommonMistake +#. def is_friend(name): +#. return name == "Alice" or "Bob" +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ACommonMistake.requirements +#. return name == "Alice" or "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ACommonMistake.requirements +#. return name == "Alice" or name == "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ACommonMistake.text +#. return name == "Alice" or "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ACommonMistake.text +#. return name == "Alice" or name == "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise.text +#. (name == "Alice") or ("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise.text +#. name == "Alice" or "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise.text +#. name == ("Alice" or "Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.AnExercise.text +#. return name in ["Alice", "Bob", "Charlie"] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.FurtherImprovement +#. def is_friend(name): +#. return name == "Alice" or name == "Bob" +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.FurtherImprovement.requirements +#. if name == "Alice" or name == "Bob": +#. return True +#. else: +#. return False +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.FurtherImprovement.requirements +#. return name == "Alice" or name == "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.FurtherImprovement.text +#. name == "Alice" or name == "Bob" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ImprovingWithOr +#. def is_friend(name): +#. if name == "Alice" or name == "Bob": +#. return True +#. else: +#. return False +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ImprovingWithOr.text +#. if name == "Alice" or name == "Bob": +#. return True +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.ImprovingWithOr.text +#. if name == "Alice": +#. return True +#. elif name == "Bob": +#. return True +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.InputAliceBob +#. def is_friend(name): +#. if name == "Alice": +#. return True +#. elif name == "Bob": +#. return True +#. else: +#. return False +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingOr.steps.InspectWithBirdseye +#. def is_friend(name): +#. return name == "Alice" or "Bob" +#. assert_equal(is_friend("Alice"), True) +#. assert_equal(is_friend("Bob"), True) +#. assert_equal(is_friend("Charlie"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MultiLineExpressions.steps.valid_multiline +#. name = "Bob" +#. is_friend = name == "Alice" or \ +#. name == "Bob" +#. print(is_friend) +#. is_friend = (name == "Alice" or +#. name == "Bob") +#. print(is_friend) +#. is_friend = [name == "Alice", +#. name == "Bob"] +#. print(is_friend) +#. print(name == "Alice" or +#. name == "Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.SingleAndDoubleQuotesInStrings.steps.single_quotes_apostrophe.text +#. name = 'Alice' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_doesnt_change +#. word = 'Hello' +#. name = 'World' +#. sentence = word + ' ' + name +#. print(sentence) +#. word = 'Goodbye' +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_equals_word_plus_name +#. word = 'Hello' +#. name = 'World' +#. sentence = word + ' ' + name +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheEqualityOperator.steps.if_equals_replacing_characters +#. name = 'kesha' +#. new_name = '' +#. for c in name: +#. if c == 's': +#. c = '$' +#. new_name += c +#. print(new_name) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheEqualityOperator.steps.if_equals_replacing_characters_exercise +#. name = 'kesha' +#. new_name = '' +#. for c in name: +#. if c == 'e': +#. c = '3' +#. if c == 's': +#. c = '$' +#. if c == 'a': +#. c = '@' +#. new_name += c +#. print(new_name) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.WritingPrograms.steps.editor_hello_world +#. word = 'Hello' +#. name = 'World' +#. print(word + ' ' + name) +#. word = 'Goodbye' +#. print(word + ' ' + name) +msgid "code_bits.name" +msgstr "name" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheEqualityOperator.steps.if_equals_replacing_characters +#. name = 'kesha' +#. new_name = '' +#. for c in name: +#. if c == 's': +#. c = '$' +#. new_name += c +#. print(new_name) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheEqualityOperator.steps.if_equals_replacing_characters_exercise +#. name = 'kesha' +#. new_name = '' +#. for c in name: +#. if c == 'e': +#. c = '3' +#. if c == 's': +#. c = '$' +#. if c == 'a': +#. c = '@' +#. new_name += c +#. print(new_name) +msgid "code_bits.new_name" +msgstr "new_name" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.double_numbers.text +#. numbers = [1, 2] + [3, 4] +#. print(numbers) +#. new_numbers = [] +#. new_numbers += numbers +#. new_numbers += [5] +#. print(new_numbers) +msgid "code_bits.new_numbers" +msgstr "new_numbers" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.append_vs_concatenate +#. nums = [1, 2, 3] +#. new_nums = nums + [4, 5] +#. print(new_nums) +#. print(nums) +#. nums.append(4) +#. print(nums) +msgid "code_bits.new_nums" +msgstr "new_nums" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningCompoundStatements.steps.final_text.text +#. sentence = 'Hello World' +#. excited = True +#. new_sentence = '' +#. for char in sentence: +#. new_sentence += char +#. if excited: +#. new_sentence += '!' +#. sentence = new_sentence +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningCompoundStatements.steps.for_inside_if +#. sentence = 'Hello World' +#. excited = True +#. if excited: +#. new_sentence = '' +#. for char in sentence: +#. new_sentence += char + '!' +#. sentence = new_sentence +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.capitalise +#. sentence = 'HELLO THERE' +#. upper = True +#. new_sentence = '' +#. for char in sentence: +#. if upper: +#. char = char.upper() +#. else: +#. char = char.lower() +#. new_sentence += char +#. upper = False +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.spongebob +#. sentence = 'One more exercise, and then you can relax.' +#. upper = True +#. new_sentence = '' +#. for char in sentence: +#. if upper: +#. char = char.upper() +#. upper = False +#. else: +#. char = char.lower() +#. upper = True +#. new_sentence += char +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.brokn_kyboard +#. sentence = 'The e key on my keyboard is broken' +#. new_sentence = '' +#. for c in sentence: +#. if c != 'e': +#. new_sentence += c +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StringMethodsUnderstandingMutation.steps.string_lower_upper +#. sentence = "Python rocks!" +#. new_sentence = sentence.upper() +#. print(sentence) +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_first_character +#. sentence = 'Hello there' +#. include = True +#. new_sentence = '' +#. for char in sentence: +#. if include: +#. new_sentence += char +#. include = False +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_tail +#. sentence = 'Hello World' +#. include = False +#. new_sentence = '' +#. for char in sentence: +#. if include: +#. new_sentence += char +#. include = True +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_tail_snoop +#. sentence = 'Hello World' +#. include = False +#. new_sentence = '' +#. for char in sentence: +#. if include: +#. new_sentence += char +#. include = True +#. print(new_sentence) +msgid "code_bits.new_sentence" +msgstr "new_sentence" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.subscript_assignment_predict.text +#. some_list[index] = new_value +msgid "code_bits.new_value" +msgstr "new_value" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +#. words = ['This', 'is', 'a', 'list'] +#. separator = ' - ' +#. total = '' +#. not_first = False +#. for word in words: +#. if not_first: +#. total += separator +#. total += word +#. not_first = True +#. print(total) +msgid "code_bits.not_first" +msgstr "not_first" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.nested_list_loop_python_tutor +#. numbers = [[1, 2, 3], [4, 5], [6], []] +#. for sublist in numbers: +#. for num in sublist: +#. print(num) +#. print('---') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.nested_list_nested_loop_example +#. numbers = [[1, 2, 3], [4, 5], [6], []] +#. for sublist in numbers: +#. for num in sublist: +#. print(num) +#. print('---') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.nested_list_nested_loop_example.text +#. for sublist in numbers: +#. for num in sublist: +#. print(num) +#. print('---') +msgid "code_bits.num" +msgstr "num" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.double_numbers +#. numbers = [3, 1, 4, 1, 5, 9, 2, 6, 5] +#. double = [] +#. for number in numbers: +#. double += [number * 2] +#. print(double) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.filter_numbers +#. numbers = [3, 1, 4, 1, 5, 9, 2, 6, 5] +#. big_numbers = [] +#. for number in numbers: +#. if number > 5: +#. big_numbers.append(number) +#. print(big_numbers) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.numbers_sum +#. numbers = [3, 1, 4, 1, 5, 9] +#. total = 0 +#. for number in numbers: +#. total += number +#. print(total) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.first_nested_loop +#. for letter in "ABC": +#. print(letter) +#. for number in range(4): +#. print(f'{letter} {number}') +#. print('---') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ModifyingWhileIterating.steps.make_copy +#. numbers = [10, 7, 8, 3, 12, 15] +#. for number in numbers.copy(): +#. if number <= 10: +#. numbers.remove(number) +#. print(numbers) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ModifyingWhileIterating.steps.make_copy.requirements +#. for number in numbers.copy(): +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ModifyingWhileIterating.steps.make_copy.requirements +#. for number in numbers: +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ModifyingWhileIterating.steps.make_copy.text +#. for number in numbers.copy(): +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ModifyingWhileIterating.steps.make_copy2 +#. numbers = [10, 7, 8, 3, 12, 15] +#. big_numbers = numbers.copy() +#. for number in numbers: +#. if number <= 10: +#. big_numbers.remove(number) +#. print(big_numbers) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ModifyingWhileIterating.steps.make_new_list +#. numbers = [10, 7, 8, 3, 12, 15] +#. big_numbers = [] +#. for number in numbers: +#. if number > 10: +#. big_numbers.append(number) +#. print(big_numbers) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ModifyingWhileIterating.steps.remove_instead_of_pop +#. numbers = [10, 7, 8, 3, 12, 15] +#. for number in numbers: +#. if number <= 10: +#. numbers.remove(number) +#. print(numbers) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ModifyingWhileIterating.steps.run_broken_with_python_tutor +#. numbers = [10, 7, 8, 3, 12, 15] +#. for i in range(len(numbers)): +#. number = numbers[i] +#. if number <= 10: +#. numbers.pop(i) +#. print(numbers) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.break_vs_return +#. def foo(): +#. for letter in 'abc': +#. for number in range(3): +#. print(f"{letter} {number}") +#. if letter == 'b': +#. break +#. foo() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.return_ends_whole_function +#. def foo(): +#. for letter in 'abc': +#. for number in range(3): +#. print(f"{letter} {number}") +#. if letter == 'b': +#. return letter +#. foo() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.first_return +#. def double(x): +#. return x * 2 +#. number = 5 +#. twice = double(number) +#. print(number) +#. print(twice) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.losing_return_value +#. def double(x): +#. return x * 2 +#. number = 5 +#. double(number) +#. print(number) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.fixing_type_errors_with_conversion +#. number = '1' +#. for i in range(int(number)): +#. print('Starting... ' + str(i + 1)) +#. print('Go!') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.Types.steps.fixing_type_errors_with_conversion.text +#. number = '3' +#. for i in range(number): +#. print('Starting... ' + i + 1) +#. print('Go!') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithPythonTutor.steps.run_with_python_tutor +#. all_numbers = [2, 4, 8, 1, 9, 7] +#. small_numbers = [] +#. big_numbers = [] +#. for number in all_numbers: +#. if number <= 5: +#. small_numbers.append(number) +#. else: +#. big_numbers.append(number) +#. print(small_numbers) +#. print(big_numbers) +msgid "code_bits.number" +msgstr "number" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.double_numbers +#. numbers = [3, 1, 4, 1, 5, 9, 2, 6, 5] +#. double = [] +#. for number in numbers: +#. double += [number * 2] +#. print(double) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.double_numbers.text +#. numbers = [1, 2] + [3, 4] +#. print(numbers) +#. new_numbers = [] +#. new_numbers += numbers +#. new_numbers += [5] +#. print(new_numbers) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.double_numbers.text +#. numbers = [3, 1, 4, 1, 5, 9, 2, 6, 5] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.filter_numbers +#. numbers = [3, 1, 4, 1, 5, 9, 2, 6, 5] +#. big_numbers = [] +#. for number in numbers: +#. if number > 5: +#. big_numbers.append(number) +#. print(big_numbers) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.filter_numbers.text +#. numbers = [3, 1, 4, 1, 5, 9, 2, 6, 5] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.numbers_sum +#. numbers = [3, 1, 4, 1, 5, 9] +#. total = 0 +#. for number in numbers: +#. total += number +#. print(total) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.nested_list_loop_python_tutor +#. numbers = [[1, 2, 3], [4, 5], [6], []] +#. for sublist in numbers: +#. for num in sublist: +#. print(num) +#. print('---') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.nested_list_nested_loop_example +#. numbers = [[1, 2, 3], [4, 5], [6], []] +#. for sublist in numbers: +#. for num in sublist: +#. print(num) +#. print('---') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.nested_list_nested_loop_example.text +#. for sublist in numbers: +#. for num in sublist: +#. print(num) +#. print('---') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.nested_list_nested_loop_example.text +#. numbers = [[1, 2, 3], [4, 5], [6], []] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ModifyingWhileIterating.steps.make_copy +#. numbers = [10, 7, 8, 3, 12, 15] +#. for number in numbers.copy(): +#. if number <= 10: +#. numbers.remove(number) +#. print(numbers) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ModifyingWhileIterating.steps.make_copy.requirements +#. for number in numbers.copy(): +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ModifyingWhileIterating.steps.make_copy.requirements +#. for number in numbers: +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ModifyingWhileIterating.steps.make_copy.text +#. for number in numbers.copy(): +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ModifyingWhileIterating.steps.make_copy2 +#. numbers = [10, 7, 8, 3, 12, 15] +#. big_numbers = numbers.copy() +#. for number in numbers: +#. if number <= 10: +#. big_numbers.remove(number) +#. print(big_numbers) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ModifyingWhileIterating.steps.make_new_list +#. numbers = [10, 7, 8, 3, 12, 15] +#. big_numbers = [] +#. for number in numbers: +#. if number > 10: +#. big_numbers.append(number) +#. print(big_numbers) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ModifyingWhileIterating.steps.remove_instead_of_pop +#. numbers = [10, 7, 8, 3, 12, 15] +#. for number in numbers: +#. if number <= 10: +#. numbers.remove(number) +#. print(numbers) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ModifyingWhileIterating.steps.run_broken_with_python_tutor +#. numbers = [10, 7, 8, 3, 12, 15] +#. for i in range(len(numbers)): +#. number = numbers[i] +#. if number <= 10: +#. numbers.pop(i) +#. print(numbers) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.cannot_return_multiple_values +#. def double_numbers(numbers): +#. for x in numbers: +#. return x * 2 +#. assert_equal(double_numbers([1, 2, 3]), [2, 4, 6]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.return_ends_whole_function.text +#. def double_numbers(numbers): +#. doubles = [] +#. for x in numbers: +#. doubles.append(x * 2) +#. return doubles +#. assert_equal(double_numbers([1, 2, 3]), [2, 4, 6]) +msgid "code_bits.numbers" +msgstr "numbers" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.append_vs_concatenate +#. nums = [1, 2, 3] +#. new_nums = nums + [4, 5] +#. print(new_nums) +#. print(nums) +#. nums.append(4) +#. print(nums) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.pop_predict_exercise +#. nums = [1, 2, 3] +#. print(nums.pop(1)) +#. print(nums) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.remove_predict_exercise +#. nums = [1, 2, 3] +#. nums.remove(1) +#. print(nums) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.subscript_assignment_predict +#. nums = [1, 2, 3] +#. nums[1] = 9 +#. print(nums) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.HowToFindInformationWithGoogleAndMore.steps.list_insert +#. nums = [1, 2, 3, 4, 5] +#. nums.insert(2, 9) +#. print(nums) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.HowToFindInformationWithGoogleAndMore.steps.list_insert.text +#. nums = [1, 2, 3, 4, 5] +#. nums.append(9) +#. print(nums) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.in_predict_exercise +#. nums = [2, 9, 1, 8, 5, 64] +#. print(7 in nums) +#. print(2 in nums) +msgid "code_bits.nums" +msgstr "nums" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingElif.steps.dna_example +#. dna = 'AGTAGCGTC' +#. opposite_dna = '' +#. for char in dna: +#. if char == 'A': +#. char = 'T' +#. if char == 'T': +#. char = 'A' +#. if char == 'G': +#. char = 'C' +#. if char == 'C': +#. char = 'G' +#. opposite_dna += char +#. print(opposite_dna) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingElif.steps.dna_example_with_elif +#. dna = 'AGTAGCGTC' +#. opposite_dna = '' +#. for char in dna: +#. if char == 'A': +#. char = 'T' +#. elif char == 'T': +#. char = 'A' +#. elif char == 'G': +#. char = 'C' +#. elif char == 'C': +#. char = 'G' +#. opposite_dna += char +#. print(opposite_dna) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingElif.steps.dna_example_with_else +#. dna = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. opposite_dna = '' +#. for char in dna: +#. if char == 'A': +#. char = 'T' +#. else: +#. if char == 'T': +#. char = 'A' +#. if char == 'G': +#. char = 'C' +#. else: +#. if char == 'C': +#. char = 'G' +#. opposite_dna += char +#. print(opposite_dna) +msgid "code_bits.opposite_dna" +msgstr "opposite_dna" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part1 +#. def substitute(string): +#. result = '' +#. for char in string: +#. if char == 'A': +#. char = 'T' +#. elif char == 'T': +#. char = 'A' +#. elif char == 'G': +#. char = 'C' +#. elif char == 'C': +#. char = 'G' +#. result += char +#. return result +#. original = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. expected = 'TCATCGCAGGAATCAATGTCCTACCGAATA' +#. assert_equal(substitute(original), expected) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part2.text +#. def substitute(string, d): +#. ... +#. original = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. expected = 'TCATCGCAGGAATCAATGTCCTACCGAATA' +#. assert_equal(substitute(original, {'A': 'T', 'T': 'A', 'C': 'G', 'G': +#. 'C'}), expected) +msgid "code_bits.original" +msgstr "original" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingFstrings.steps.fix_broken_program +#. people = ['Alice', 'Bob', 'Charlie'] +#. print(f"There are {len(people)} people waiting, the first one's name is +#. {people[0]}.") +msgid "code_bits.people" +msgstr "people" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.grades_example +#. percentage = 73 +#. if percentage < 40: +#. grade = 'F' +#. elif percentage < 60: +#. grade = 'C' +#. elif percentage < 80: +#. grade = 'B' +#. else: +#. grade = 'A' +#. print(grade) +msgid "code_bits.percentage" +msgstr "percentage" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_parameter_name +#. def say_hello(person_name): +#. print(f"Hello {person_name}!") +#. print("How are you?") +#. say_hello("Alice") +#. say_hello("Bob") +msgid "code_bits.person_name" +msgstr "person_name" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner +#. def column_winner(board): +#. for col in range(len(board[0])): +#. all_equal = True +#. piece = board[0][col] +#. for row in board: +#. if row[col] == ' ' or row[col] != piece: +#. all_equal = False +#. break +#. if all_equal: +#. return True +#. return False +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner +#. def row_winner(board): +#. for row in board: +#. all_equal = True +#. piece = row[0] +#. for entry in row: +#. if entry == ' ' or piece != entry: +#. all_equal = False +#. break +#. if all_equal: +#. return True +#. return False +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i - 1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner.text +#. def winner(board): +#. ... +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i-1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. assert_equal( +#. winner( +#. [ +#. ['X', 'X', 'X', ' '], +#. ['X', 'X', ' ', ' '], +#. ['X', ' ', 'O', 'X'], +#. [' ', ' ', 'O', 'X'] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' ', 'X'], +#. ['O', 'X', 'O'], +#. ['O', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' '], +#. ['X', 'O'] +#. ] +#. ), +#. True +#. ) +msgid "code_bits.piece" +msgstr "piece" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.modify_list_in_function +#. def play_move(board, player): +#. board[1] = player +#. def play_game(): +#. game_board = [" ", " ", " "] +#. play_move(game_board, "X") +#. print(game_board) +#. play_game() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input.text +#. def format_board(board): +#. first_row = ' ' +#. for i in range(len(board)): +#. first_row += str(i + 1) +#. joined_rows = [first_row] +#. for i in range(len(board)): +#. joined_row = str(i + 1) + ''.join(board[i]) +#. joined_rows.append(joined_row) +#. return "\n".join(joined_rows) +#. def play_game(): +#. board = [ +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ] +#. print(format_board(board)) +#. print('\nX to play:\n') +#. play_move(board, 'X') +#. print(format_board(board)) +#. print('\nO to play:\n') +#. play_move(board, 'O') +#. print(format_board(board)) +#. def play_move(board, player): +#. ... +#. play_game() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_two_lines +#. def play_move(board, player): +#. row = board[1] +#. row[0] = player +#. def play_game(): +#. board = [ +#. [" ", " ", " "], +#. [" ", " ", " "], +#. [" ", " ", " "], +#. ] +#. play_move(board, "X") +#. print(board) +#. play_game() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.play_game" +msgstr "play_game" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.modify_list_in_function +#. def play_move(board, player): +#. board[1] = player +#. def play_game(): +#. game_board = [" ", " ", " "] +#. play_move(game_board, "X") +#. print(game_board) +#. play_game() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input +#. def play_move(board, player): +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input.text +#. def format_board(board): +#. first_row = ' ' +#. for i in range(len(board)): +#. first_row += str(i + 1) +#. joined_rows = [first_row] +#. for i in range(len(board)): +#. joined_row = str(i + 1) + ''.join(board[i]) +#. joined_rows.append(joined_row) +#. return "\n".join(joined_rows) +#. def play_game(): +#. board = [ +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ] +#. print(format_board(board)) +#. print('\nX to play:\n') +#. play_move(board, 'X') +#. print(format_board(board)) +#. print('\nO to play:\n') +#. play_move(board, 'O') +#. print(format_board(board)) +#. def play_move(board, player): +#. ... +#. play_game() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_two_lines +#. def play_move(board, player): +#. row = board[1] +#. row[0] = player +#. def play_game(): +#. board = [ +#. [" ", " ", " "], +#. [" ", " ", " "], +#. [" ", " ", " "], +#. ] +#. play_move(board, "X") +#. print(board) +#. play_game() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.play_move" +msgstr "play_move" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.modify_list_in_function +#. def play_move(board, player): +#. board[1] = player +#. def play_game(): +#. game_board = [" ", " ", " "] +#. play_move(game_board, "X") +#. print(game_board) +#. play_game() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input +#. def play_move(board, player): +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input.text +#. board[1][0] = player +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input.text +#. def format_board(board): +#. first_row = ' ' +#. for i in range(len(board)): +#. first_row += str(i + 1) +#. joined_rows = [first_row] +#. for i in range(len(board)): +#. joined_row = str(i + 1) + ''.join(board[i]) +#. joined_rows.append(joined_row) +#. return "\n".join(joined_rows) +#. def play_game(): +#. board = [ +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ] +#. print(format_board(board)) +#. print('\nX to play:\n') +#. play_move(board, 'X') +#. print(format_board(board)) +#. print('\nO to play:\n') +#. play_move(board, 'O') +#. print(format_board(board)) +#. def play_move(board, player): +#. ... +#. play_game() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input.text +#. row = board[1] +#. row[0] = player +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_two_lines +#. def play_move(board, player): +#. row = board[1] +#. row[0] = player +#. def play_game(): +#. board = [ +#. [" ", " ", " "], +#. [" ", " ", " "], +#. [" ", " ", " "], +#. ] +#. play_move(board, "X") +#. print(board) +#. play_game() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.player" +msgstr "player" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_exercise +#. players = ['Alice', 'Bob', 'Charlie'] +#. for player1 in players: +#. for player2 in players: +#. if player1 != player2: +#. print(f'{player1} vs {player2}') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.player1" +msgstr "player1" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_exercise +#. players = ['Alice', 'Bob', 'Charlie'] +#. for player1 in players: +#. for player2 in players: +#. if player1 != player2: +#. print(f'{player1} vs {player2}') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.player2" +msgstr "player2" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.final_text.text +#. players = ['Charlie', 'Alice', 'Dylan', 'Bob'] +#. for i in range(len(players)): +#. for j in range(len(players)): +#. if i < j: +#. print(f'{players[i]} vs {players[j]}') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus +#. players = ['Alice', 'Bob', 'Charlie'] +#. for i in range(len(players)): +#. for j in range(len(players)): +#. if i < j: +#. print(f'{players[i]} vs {players[j]}') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_bonus.text +#. players = ['Charlie', 'Alice', 'Dylan', 'Bob'] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_exercise +#. players = ['Alice', 'Bob', 'Charlie'] +#. for player1 in players: +#. for player2 in players: +#. if player1 != player2: +#. print(f'{player1} vs {player2}') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.player_vs_player_exercise.text +#. players = ["Alice", "Bob", "Charlie"] +msgid "code_bits.players" +msgstr "players" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'are' +#. present = False +#. for sublist in strings: +#. for string in sublist: +#. if word in string: +#. present = True +#. print(present) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'goodbye' +#. for sublist in strings: +#. present = False +#. for string in sublist: +#. if word in string: +#. present = True +#. print(present) +msgid "code_bits.present" +msgstr "present" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in quantities: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.text +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in ...: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1 +#. def total_cost(cart, prices): +#. result = 0 +#. for item in cart: +#. price = prices[item] +#. result += price +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1.text +#. def total_cost(cart, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. result += price +#. return result +#. assert_equal( +#. total_cost( +#. ['apple', 'box', 'cat'], +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 107, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4 +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4.text +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. quantity = ... +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. ['dog', 'box'], +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +msgid "code_bits.price" +msgstr "price" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in quantities: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.text +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in ...: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1 +#. def total_cost(cart, prices): +#. result = 0 +#. for item in cart: +#. price = prices[item] +#. result += price +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1.text +#. def total_cost(cart, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. result += price +#. return result +#. assert_equal( +#. total_cost( +#. ['apple', 'box', 'cat'], +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 107, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1.text +#. prices = {'apple': 2, 'apple': 3} +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1.text +#. prices = {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100} +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4 +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4.text +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. quantity = ... +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. ['dog', 'box'], +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +msgid "code_bits.prices" +msgstr "prices" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.invalid_multi_line_string.text +#. assert_equal(print_board([...]), "...") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.one_way_to_print_board +#. def print_board(board): +#. for row in board: +#. print("".join(row)) +#. print_board([ +#. ['X', 'O', 'X'], +#. [' ', 'O', 'O'], +#. [' ', 'X', ' '] +#. ]) +msgid "code_bits.print_board" +msgstr "print_board" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.print_draw" +msgstr "print_draw" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsWithinFunctions.steps.print_twice_call_print_many +#. def print_many(n, thing): +#. for _ in range(n): +#. print(thing) +#. def print_twice(x): +#. print_many(2, x) +#. print_twice("Hello") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsWithinFunctions.steps.see_stack_in_birdseye +#. def print_many(n, thing): +#. for _ in range(n): +#. print(thing) +#. def print_twice(x): +#. print_many(2, x) +#. print_twice("Hello") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsWithinFunctions.steps.see_stack_in_pythontutor +#. def print_many(n, thing): +#. for _ in range(n): +#. print(thing) +#. def print_twice(x): +#. print_many(2, x) +#. print_twice("Hello") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsWithinFunctions.steps.see_stack_in_snoop +#. def print_many(n, thing): +#. for _ in range(n): +#. print(thing) +#. def print_twice(x): +#. print_many(2, x) +#. print_twice("Hello") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.print_many +#. def print_many(thing, n): +#. for _ in range(n): +#. print(thing) +#. print_many("Hello", 3) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.swap_parameters +#. def print_many(n, thing): +#. for _ in range(n): +#. print(thing) +#. print_many(3, "Hello") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.swap_parameters.text +#. def print_many(n, thing): +msgid "code_bits.print_many" +msgstr "print_many" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsWithinFunctions.steps.print_twice_call_print_many +#. def print_many(n, thing): +#. for _ in range(n): +#. print(thing) +#. def print_twice(x): +#. print_many(2, x) +#. print_twice("Hello") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsWithinFunctions.steps.see_stack_in_birdseye +#. def print_many(n, thing): +#. for _ in range(n): +#. print(thing) +#. def print_twice(x): +#. print_many(2, x) +#. print_twice("Hello") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsWithinFunctions.steps.see_stack_in_pythontutor +#. def print_many(n, thing): +#. for _ in range(n): +#. print(thing) +#. def print_twice(x): +#. print_many(2, x) +#. print_twice("Hello") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsWithinFunctions.steps.see_stack_in_snoop +#. def print_many(n, thing): +#. for _ in range(n): +#. print(thing) +#. def print_twice(x): +#. print_many(2, x) +#. print_twice("Hello") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.print_twice_exercise +#. def print_twice(x): +#. print(x) +#. print(x) +msgid "code_bits.print_twice" +msgstr "print_twice" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.print_winner" +msgstr "print_winner" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_french +#. def print_words(french): +#. for word in french: +#. print("English: " + word) +#. print("French: " + french[word]) +#. print("---") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_french.text +#. def print_words(french): +#. ... +#. print_words({'apple': 'pomme', 'box': 'boite'}) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german +#. def print_words(french, german): +#. for word in french: +#. print("English: " + word) +#. print("French: " + french[word]) +#. print("German: " + german[word]) +#. print("---") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german.text +#. def print_words(french, german): +#. ... +#. print_words( +#. {'apple': 'pomme', 'box': 'boite'}, +#. {'apple': 'apfel', 'box': 'kasten'}, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.nested_dictionaries +#. def print_words(words): +#. for word in words: +#. translations = words[word] +#. print(f"English: {word}") +#. for language in translations: +#. print(f"{language}: {translations[language]}") +#. print(f"---") +#. print_words({ +#. 'apple': { +#. 'French': 'pomme', +#. 'German': 'apfel', +#. }, +#. 'box': { +#. 'French': 'boite', +#. 'German': 'kasten', +#. }, +#. }) +msgid "code_bits.print_words" +msgstr "print_words" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsTerminology.steps.print_returns_none +#. things = [1, 2, 3] +#. length = len(things) +#. printed = print(length) +#. print(printed) +msgid "code_bits.printed" +msgstr "printed" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.final_text.text +#. def quadruple(x): +#. x = double(x) +#. x = double(x) +#. return x +#. def quadruple(x): +#. return double(double(x)) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.quadruple_exercise +#. def double(x): +#. return x * 2 +#. def quadruple(x): +#. return double(double(x)) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.complete_quadruple_tests +#. def double(x): +#. return x * 2 +#. def quadruple(x): +#. return double(double(x)) +#. assert_equal(quadruple(2), 8) +#. assert_equal(quadruple(5), 20) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.complete_quadruple_tests.text +#. def double(x): +#. return x * 2 +#. def quadruple(x): +#. return double(double(x)) +#. assert_equal(quadruple(2)) +#. assert_equal(quadruple(5)) +msgid "code_bits.quadruple" +msgstr "quadruple" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in quantities: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.text +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in ...: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.introducing_keys +#. quantities = {'apple': 1, 'cat': 10} +#. print(quantities.keys()) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.introducing_keys.text +#. quantities = {'apple': 1, 'cat': 10} +#. print(quantities) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.keys_are_iterable +#. quantities = {'apple': 1, 'cat': 10} +#. for key in quantities.keys(): +#. print(key) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.keys_are_iterable2 +#. quantities = {'apple': 1, 'cat': 10} +#. for key in quantities: +#. print(key) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4 +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4.text +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. quantity = ... +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. ['dog', 'box'], +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +msgid "code_bits.quantities" +msgstr "quantities" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in quantities: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.text +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in ...: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4 +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4.text +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. quantity = ... +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. ['dog', 'box'], +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +msgid "code_bits.quantity" +msgstr "quantity" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in quantities: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.text +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in ...: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.text +#. def format_board(board): +#. result = '' +#. for i in range(len(board)): +#. for char in board[i]: +#. result += char +#. if i != len(board) - 1: +#. result += '\n' +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_simple +#. def format_board(board): +#. result = '' +#. for i in range(len(board)): +#. for char in board[i]: +#. result += char +#. if i != len(board) - 1: +#. result += '\n' +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part1 +#. def substitute(string): +#. result = '' +#. for char in string: +#. if char == 'A': +#. char = 'T' +#. elif char == 'T': +#. char = 'A' +#. elif char == 'G': +#. char = 'C' +#. elif char == 'C': +#. char = 'G' +#. result += char +#. return result +#. original = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. expected = 'TCATCGCAGGAATCAATGTCCTACCGAATA' +#. assert_equal(substitute(original), expected) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part2 +#. def substitute(string, d): +#. result = "" +#. for letter in string: +#. result += d[letter] +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1 +#. def total_cost(cart, prices): +#. result = 0 +#. for item in cart: +#. price = prices[item] +#. result += price +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1.text +#. def total_cost(cart, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. result += price +#. return result +#. assert_equal( +#. total_cost( +#. ['apple', 'box', 'cat'], +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 107, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4 +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4.text +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. quantity = ... +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. ['dog', 'box'], +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +msgid "code_bits.result" +msgstr "result" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.times_table_exercise +#. for left in range(12): +#. left += 1 +#. for right in range(12): +#. right += 1 +#. print(f'{left} x {right} = {left * right}') +#. print('---') +msgid "code_bits.right" +msgstr "right" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.TicTacToeWinningRow +#. def all_equal(row): +#. return row[0] == row[1] and row[0] == row[2] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.TicTacToeWinningRow.text +#. def all_equal(row): +#. ... +#. assert_equal(all_equal(["X", "X", "X"]), True) +#. assert_equal(all_equal(["O", "O", "O"]), True) +#. assert_equal(all_equal(["X", "O", "X"]), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.final_text.text +#. return row == [row[0], row[0], row[0]] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.final_text.text +#. return row[0] == row[1] == row[2] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingAnd.steps.final_text.text +#. def all_equal(row): +#. return row[0] == row[1] and row[0] == row[2] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.column_winner +#. def column_winner(board): +#. for col in range(len(board[0])): +#. all_equal = True +#. piece = board[0][col] +#. for row in board: +#. if row[col] == ' ' or row[col] != piece: +#. all_equal = False +#. break +#. if all_equal: +#. return True +#. return False +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner +#. def row_winner(board): +#. for row in board: +#. all_equal = True +#. piece = row[0] +#. for entry in row: +#. if entry == ' ' or piece != entry: +#. all_equal = False +#. break +#. if all_equal: +#. return True +#. return False +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i - 1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner.text +#. def winner(board): +#. ... +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i-1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. assert_equal( +#. winner( +#. [ +#. ['X', 'X', 'X', ' '], +#. ['X', 'X', ' ', ' '], +#. ['X', ' ', 'O', 'X'], +#. [' ', ' ', 'O', 'X'] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' ', 'X'], +#. ['O', 'X', 'O'], +#. ['O', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' '], +#. ['X', 'O'] +#. ] +#. ), +#. True +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.final_text.text +#. board.append(row.copy()) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.final_text.text +#. def make_board(size): +#. board = [] +#. for _ in range(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board.append(row) +#. return board +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.final_text.text +#. def make_board(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board = [] +#. for _ in range(size): +#. board.append(row.copy()) +#. return board +#. def make_cube(size): +#. cube = [] +#. board = make_board(size) +#. for _ in range(size): +#. cube.append(board.copy()) +#. return cube +#. def test(): +#. cube = make_cube(2) +#. print(cube) +#. cube[0][0][0] = 'X' +#. print(cube) +#. print(cube[0] is cube[1]) +#. print(cube[0][0] is cube[0][1]) +#. print(cube[0][0] is cube[1][0]) +#. test() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.fix_make_board +#. def make_board(size): +#. board = [] +#. for _ in range(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board.append(row) +#. return board +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.fix_make_board.text +#. board = [row, row, row] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.fix_make_board.text +#. row[0] = 'X' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.naive_make_board +#. def make_board(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board = [] +#. for _ in range(size): +#. board.append(row) +#. return board +#. def test(): +#. board = make_board(3) +#. assert_equal(board, [ +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ]) +#. board[0][0] = 'X' +#. assert_equal(board, [ +#. ['X', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ]) +#. test() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input +#. def play_move(board, player): +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_input.text +#. row = board[1] +#. row[0] = player +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NestedListAssignment.steps.nested_assignment_two_lines +#. def play_move(board, player): +#. row = board[1] +#. row[0] = player +#. def play_game(): +#. board = [ +#. [" ", " ", " "], +#. [" ", " ", " "], +#. [" ", " ", " "], +#. ] +#. play_move(board, "X") +#. print(board) +#. play_game() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge +#. def format_board(board): +#. joined_rows = [] +#. for row in board: +#. joined_rows.append("|".join(row)) +#. lines = [] +#. for _ in board[0]: +#. lines.append("-") +#. line = f'\n{"+".join(lines)}\n' +#. return line.join(joined_rows) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.format_board_bonus_challenge.text +#. def format_board(board): +#. joined_rows = [] +#. for row in board: +#. joined_rows.append("".join(row)) +#. return "\n".join(joined_rows) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.one_way_to_print_board +#. def print_board(board): +#. for row in board: +#. print("".join(row)) +#. print_board([ +#. ['X', 'O', 'X'], +#. [' ', 'O', 'O'], +#. [' ', 'X', ' '] +#. ]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.row" +msgstr "row" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner +#. def row_winner(board): +#. for row in board: +#. all_equal = True +#. piece = row[0] +#. for entry in row: +#. if entry == ' ' or piece != entry: +#. all_equal = False +#. break +#. if all_equal: +#. return True +#. return False +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.intro_row_winner.text +#. def row_winner(board): +#. ... +#. assert_equal( +#. row_winner( +#. [ +#. ['A', 'A', 'B', 'A'], +#. [' ', ' ', ' ', ' '], +#. ['A', ' ', ' ', 'A'], +#. ['B', ' ', 'B', 'A'] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. row_winner( +#. [ +#. ['X', ' ', 'X'], +#. ['O', 'X', 'X'], +#. ['O', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i - 1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner.text +#. def winner(board): +#. ... +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i-1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. assert_equal( +#. winner( +#. [ +#. ['X', 'X', 'X', ' '], +#. ['X', 'X', ' ', ' '], +#. ['X', ' ', 'O', 'X'], +#. [' ', ' ', 'O', 'X'] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' ', 'X'], +#. ['O', 'X', 'O'], +#. ['O', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' '], +#. ['X', 'O'] +#. ] +#. ), +#. True +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.row_winner" +msgstr "row_winner" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.rows" +msgstr "rows" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_function_name +#. def say_hello(name): +#. print(f"Hello {name}!") +#. print("How are you?") +#. say_hello("Alice") +#. say_hello("Bob") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.change_parameter_name +#. def say_hello(person_name): +#. print(f"Hello {person_name}!") +#. print("How are you?") +#. say_hello("Alice") +#. say_hello("Bob") +msgid "code_bits.say_hello" +msgstr "say_hello" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningCompoundStatements.steps.final_text.text +#. sentence = 'Hello World' +#. excited = True +#. new_sentence = '' +#. for char in sentence: +#. new_sentence += char +#. if excited: +#. new_sentence += '!' +#. sentence = new_sentence +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CombiningCompoundStatements.steps.for_inside_if +#. sentence = 'Hello World' +#. excited = True +#. if excited: +#. new_sentence = '' +#. for char in sentence: +#. new_sentence += char + '!' +#. sentence = new_sentence +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.capitalise +#. sentence = 'HELLO THERE' +#. upper = True +#. new_sentence = '' +#. for char in sentence: +#. if upper: +#. char = char.upper() +#. else: +#. char = char.lower() +#. new_sentence += char +#. upper = False +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.else_full_stop +#. sentence = 'Hello there' +#. excited = True +#. if excited: +#. char = '!' +#. else: +#. char = '.' +#. sentence += char +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.if_upper_else_lower +#. sentence = 'Hello World' +#. excited = True +#. if excited: +#. sentence = sentence.upper() +#. else: +#. sentence = sentence.lower() +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.if_upper_else_lower_false +#. sentence = 'Hello World' +#. excited = False +#. if excited: +#. sentence = sentence.upper() +#. else: +#. sentence = sentence.lower() +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.spongebob +#. sentence = 'One more exercise, and then you can relax.' +#. upper = True +#. new_sentence = '' +#. for char in sentence: +#. if upper: +#. char = char.upper() +#. upper = False +#. else: +#. char = char.lower() +#. upper = True +#. new_sentence += char +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.undefined_char +#. sentence = 'Hello World' +#. excited = False +#. if excited: +#. char = '!' +#. sentence += char +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.undefined_char.text +#. sentence = 'Hello World' +#. excited = True +#. if excited: +#. char = '!' +#. sentence += char +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.excited_confused_exercise +#. sentence = 'Hello' +#. excited = True +#. confused = True +#. if excited: +#. sentence += '!' +#. if confused: +#. sentence += '?' +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.excited_confused_exercise.text +#. sentence = 'Hello World' +#. excited = False +#. confused = True +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.excited_example +#. sentence = 'Hello World' +#. excited = True +#. if excited: +#. sentence += '!' +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingIfStatements.steps.excited_false_example +#. sentence = 'Hello World' +#. excited = False +#. if excited: +#. sentence += '!' +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.brokn_kyboard +#. sentence = 'The e key on my keyboard is broken' +#. new_sentence = '' +#. for c in sentence: +#. if c != 'e': +#. new_sentence += c +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_doesnt_change +#. word = 'Hello' +#. name = 'World' +#. sentence = word + ' ' + name +#. print(sentence) +#. word = 'Goodbye' +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_doesnt_change.text +#. word = 'Goodbye' +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_equals_word_plus_name +#. word = 'Hello' +#. name = 'World' +#. sentence = word + ' ' + name +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StringMethodsUnderstandingMutation.steps.string_lower_upper +#. sentence = "Python rocks!" +#. new_sentence = sentence.upper() +#. print(sentence) +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_first_character +#. sentence = 'Hello there' +#. include = True +#. new_sentence = '' +#. for char in sentence: +#. if include: +#. new_sentence += char +#. include = False +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_tail +#. sentence = 'Hello World' +#. include = False +#. new_sentence = '' +#. for char in sentence: +#. if include: +#. new_sentence += char +#. include = True +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithSnoop.steps.print_tail_snoop +#. sentence = 'Hello World' +#. include = False +#. new_sentence = '' +#. for char in sentence: +#. if include: +#. new_sentence += char +#. include = True +#. print(new_sentence) +msgid "code_bits.sentence" +msgstr "sentence" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +#. words = ['This', 'is', 'a', 'list'] +#. separator = ' - ' +#. total = '' +#. not_first = False +#. for word in words: +#. if not_first: +#. total += separator +#. total += word +#. not_first = True +#. print(total) +msgid "code_bits.separator" +msgstr "separator" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +#. def surround(string, sides): +#. return sides + string + sides +#. def alert(string, level): +#. string = surround(string, ' ') +#. for _ in range(level): +#. string = surround(string, '!') +#. return string +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.surround_exercise +#. def surround(string, sides): +#. return sides + string + sides +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.surround_exercise.text +#. def surround(string, sides): +msgid "code_bits.sides" +msgstr "sides" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise +#. size = 3 +#. for i in range(size): +#. length = size - i +#. line = '' +#. for _ in range(length): +#. line += '+' +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLoops.steps.upside_down_triangle_exercise.text +#. size = 5 +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.final_text.text +#. def make_board(size): +#. board = [] +#. for _ in range(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board.append(row) +#. return board +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.final_text.text +#. def make_board(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board = [] +#. for _ in range(size): +#. board.append(row.copy()) +#. return board +#. def make_cube(size): +#. cube = [] +#. board = make_board(size) +#. for _ in range(size): +#. cube.append(board.copy()) +#. return cube +#. def test(): +#. cube = make_cube(2) +#. print(cube) +#. cube[0][0][0] = 'X' +#. print(cube) +#. print(cube[0] is cube[1]) +#. print(cube[0][0] is cube[0][1]) +#. print(cube[0][0] is cube[1][0]) +#. test() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.fix_make_board +#. def make_board(size): +#. board = [] +#. for _ in range(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board.append(row) +#. return board +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.naive_make_board +#. def make_board(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board = [] +#. for _ in range(size): +#. board.append(row) +#. return board +#. def test(): +#. board = make_board(3) +#. assert_equal(board, [ +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ]) +#. board[0][0] = 'X' +#. assert_equal(board, [ +#. ['X', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ]) +#. test() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.size" +msgstr "size" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UnderstandingProgramsWithPythonTutor.steps.run_with_python_tutor +#. all_numbers = [2, 4, 8, 1, 9, 7] +#. small_numbers = [] +#. big_numbers = [] +#. for number in all_numbers: +#. if number <= 5: +#. small_numbers.append(number) +#. else: +#. big_numbers.append(number) +#. print(small_numbers) +#. print(big_numbers) +msgid "code_bits.small_numbers" +msgstr "small_numbers" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.filter_numbers.text +#. some_list += [element] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingNewLists.steps.filter_numbers.text +#. some_list.append(element) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.index_predict_exercise.text +#. some_list.index(value) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.pop_predict_exercise.text +#. some_list.pop(index) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.remove_predict_exercise.text +#. some_list.remove(value) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.subscript_assignment_predict.text +#. some_list[index] = new_value +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.count_predict_exercise.text +#. some_list.count(value) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.in_predict_exercise.text +#. value in some_list +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.sorted_predict_exercise.text +#. sorted(some_list) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.sum_predict_exercise.text +#. sum(some_list) +msgid "code_bits.some_list" +msgstr "some_list" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.diagonal_name_bonus_challenge +#. name = 'World' +#. spaces = '' +#. for char in name: +#. print(spaces + char) +#. spaces += ' ' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStringsExercises.steps.name_box_2 +#. name = 'World' +#. line = '+' + name + '+' +#. spaces = '' +#. for _ in name: +#. spaces += ' ' +#. print(line) +#. for char in name: +#. print(char + spaces + char) +#. print(line) +msgid "code_bits.spaces" +msgstr "spaces" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.double_subscripting.text +#. string = strings[1] +#. print(string[0]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.string_list_exercise +#. strings = ['abc', 'def', 'ghi'] +#. string = strings[1] +#. print(string[0]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'are' +#. present = False +#. for sublist in strings: +#. for string in sublist: +#. if word in string: +#. present = True +#. print(present) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'hello' +#. for sublist in strings: +#. for string in sublist: +#. if word in string: +#. print(string) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'goodbye' +#. for sublist in strings: +#. present = False +#. for string in sublist: +#. if word in string: +#. present = True +#. print(present) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_longest_strings_exercise +#. strings = ['abcqwe', 'def', 'ghiq'] +#. lengths = [] +#. for string in strings: +#. lengths.append(len(string)) +#. length = max(lengths) +#. for i in range(length): +#. line = "" +#. for string in strings: +#. if i >= len(string): +#. line += " " +#. else: +#. line += string[i] +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_strings_list_exercise +#. strings = ['abc', 'def', 'ghi'] +#. for i in range(len(strings[0])): +#. line = "" +#. for string in strings: +#. line += string[i] +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.NewlinesAndFormatBoard.steps.discovering_newline +#. string +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +#. def surround(string, sides): +#. return sides + string + sides +#. def alert(string, level): +#. string = surround(string, ' ') +#. for _ in range(level): +#. string = surround(string, '!') +#. return string +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise.text +#. def alert(string, level): +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.surround_exercise +#. def surround(string, sides): +#. return sides + string + sides +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.surround_exercise.text +#. def surround(string, sides): +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part1 +#. def substitute(string): +#. result = '' +#. for char in string: +#. if char == 'A': +#. char = 'T' +#. elif char == 'T': +#. char = 'A' +#. elif char == 'G': +#. char = 'C' +#. elif char == 'C': +#. char = 'G' +#. result += char +#. return result +#. original = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. expected = 'TCATCGCAGGAATCAATGTCCTACCGAATA' +#. assert_equal(substitute(original), expected) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part2 +#. def substitute(string, d): +#. result = "" +#. for letter in string: +#. result += d[letter] +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part2.text +#. def substitute(string, d): +#. ... +#. original = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. expected = 'TCATCGCAGGAATCAATGTCCTACCGAATA' +#. assert_equal(substitute(original, {'A': 'T', 'T': 'A', 'C': 'G', 'G': +#. 'C'}), expected) +msgid "code_bits.string" +msgstr "string" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_exercise +#. string1 = 'Hello' +#. string2 = 'World' +#. for i in range(len(string1)): +#. char1 = string1[i] +#. char2 = string2[i] +#. print(char1 + ' ' + char2) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise +#. string1 = 'Goodbye' +#. string2 = 'World' +#. length1 = len(string1) +#. length2 = len(string2) +#. if length1 > length2: +#. length = length1 +#. else: +#. length = length2 +#. for i in range(length): +#. if i < len(string1): +#. char1 = string1[i] +#. else: +#. char1 = ' ' +#. if i < len(string2): +#. char2 = string2[i] +#. else: +#. char2 = ' ' +#. print(char1 + ' ' + char2) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise.text +#. for i in range(len(string1)): +#. char1 = string1[i] +#. char2 = string2[i] +#. print(char1 + ' ' + char2) +msgid "code_bits.string1" +msgstr "string1" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_exercise +#. string1 = 'Hello' +#. string2 = 'World' +#. for i in range(len(string1)): +#. char1 = string1[i] +#. char2 = string2[i] +#. print(char1 + ' ' + char2) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise +#. string1 = 'Goodbye' +#. string2 = 'World' +#. length1 = len(string1) +#. length2 = len(string2) +#. if length1 > length2: +#. length = length1 +#. else: +#. length = length2 +#. for i in range(length): +#. if i < len(string1): +#. char1 = string1[i] +#. else: +#. char1 = ' ' +#. if i < len(string2): +#. char2 = string2[i] +#. else: +#. char2 = ' ' +#. print(char1 + ' ' + char2) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.zip_longest_exercise.text +#. for i in range(len(string1)): +#. char1 = string1[i] +#. char2 = string2[i] +#. print(char1 + ' ' + char2) +msgid "code_bits.string2" +msgstr "string2" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.double_subscripting +#. strings = ["abc", "def", "ghi"] +#. print(strings[1][0]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.double_subscripting.text +#. print(strings[1][0]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.double_subscripting.text +#. string = strings[1] +#. print(string[0]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.double_subscripting_exercise +#. strings = ['abc', 'de', 'fghi', 'jklmn', 'o'] +#. print(strings[-2][-1]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.final_text.text +#. strings[1].append("today?") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.string_list_exercise +#. strings = ['abc', 'def', 'ghi'] +#. string = strings[1] +#. print(string[0]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.string_list_exercise.text +#. strings = ["abc", "def", "ghi"] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNestedLists.steps.triple_subscripting +#. strings = [['hello', 'there'], ['how', 'are', 'you']] +#. print(strings[1][2][0]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i - 1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner.text +#. def winner(board): +#. ... +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i-1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. assert_equal( +#. winner( +#. [ +#. ['X', 'X', 'X', ' '], +#. ['X', 'X', ' ', ' '], +#. ['X', ' ', 'O', 'X'], +#. [' ', ' ', 'O', 'X'] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' ', 'X'], +#. ['O', 'X', 'O'], +#. ['O', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' '], +#. ['X', 'O'] +#. ] +#. ), +#. True +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'are' +#. present = False +#. for sublist in strings: +#. for string in sublist: +#. if word in string: +#. present = True +#. print(present) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "Python" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'hello' +#. for sublist in strings: +#. for string in sublist: +#. if word in string: +#. print(string) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "hello" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'goodbye' +#. for sublist in strings: +#. present = False +#. for string in sublist: +#. if word in string: +#. present = True +#. print(present) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "goodbye" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_longest_strings_exercise +#. strings = ['abcqwe', 'def', 'ghiq'] +#. lengths = [] +#. for string in strings: +#. lengths.append(len(string)) +#. length = max(lengths) +#. for i in range(length): +#. line = "" +#. for string in strings: +#. if i >= len(string): +#. line += " " +#. else: +#. line += string[i] +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_strings_list_exercise +#. strings = ['abc', 'def', 'ghi'] +#. for i in range(len(strings[0])): +#. line = "" +#. for string in strings: +#. line += string[i] +#. print(line) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.zip_strings_list_exercise.text +#. strings = ["abc", "def", "ghi"] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.strings" +msgstr "strings" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'are' +#. present = False +#. for sublist in strings: +#. for string in sublist: +#. if word in string: +#. present = True +#. print(present) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.nested_list_loop_python_tutor +#. numbers = [[1, 2, 3], [4, 5], [6], []] +#. for sublist in numbers: +#. for num in sublist: +#. print(num) +#. print('---') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.nested_list_nested_loop_example +#. numbers = [[1, 2, 3], [4, 5], [6], []] +#. for sublist in numbers: +#. for num in sublist: +#. print(num) +#. print('---') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.nested_list_nested_loop_example.text +#. for sublist in numbers: +#. for num in sublist: +#. print(num) +#. print('---') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'hello' +#. for sublist in strings: +#. for string in sublist: +#. if word in string: +#. print(string) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'goodbye' +#. for sublist in strings: +#. present = False +#. for string in sublist: +#. if word in string: +#. present = True +#. print(present) +msgid "code_bits.sublist" +msgstr "sublist" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part1 +#. def substitute(string): +#. result = '' +#. for char in string: +#. if char == 'A': +#. char = 'T' +#. elif char == 'T': +#. char = 'A' +#. elif char == 'G': +#. char = 'C' +#. elif char == 'C': +#. char = 'G' +#. result += char +#. return result +#. original = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. expected = 'TCATCGCAGGAATCAATGTCCTACCGAATA' +#. assert_equal(substitute(original), expected) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part2 +#. def substitute(string, d): +#. result = "" +#. for letter in string: +#. result += d[letter] +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.dna_part2.text +#. def substitute(string, d): +#. ... +#. original = 'AGTAGCGTCCTTAGTTACAGGATGGCTTAT' +#. expected = 'TCATCGCAGGAATCAATGTCCTACCGAATA' +#. assert_equal(substitute(original, {'A': 'T', 'T': 'A', 'C': 'G', 'G': +#. 'C'}), expected) +msgid "code_bits.substitute" +msgstr "substitute" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingVariables.steps.sunshine_undefined_check +#. sunshine +msgid "code_bits.sunshine" +msgstr "sunshine" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.convert_input_to_int +#. super_secret_number = 7 +#. print("What number am I thinking of?") +#. guess = input() +#. if int(guess) == super_secret_number: +#. print("Amazing! Are you psychic?") +#. else: +#. print("Nope!") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.convert_input_to_int.text +#. super_secret_number = 7 +#. print("What number am I thinking of?") +#. guess = input() +#. if guess == super_secret_number: +#. print("Amazing! Are you psychic?") +#. else: +#. print("Nope!") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.final_text.text +#. if guess == str(super_secret_number): +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.InteractiveProgramsWithInput.steps.final_text.text +#. if int(guess) == super_secret_number: +msgid "code_bits.super_secret_number" +msgstr "super_secret_number" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.alert_exercise +#. def surround(string, sides): +#. return sides + string + sides +#. def alert(string, level): +#. string = surround(string, ' ') +#. for _ in range(level): +#. string = surround(string, '!') +#. return string +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.surround_exercise +#. def surround(string, sides): +#. return sides + string + sides +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.surround_exercise.text +#. assert_equal(surround("more", "++"), "++more++") +#. assert_equal(surround("the same", "="), "=the same=") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TestingFunctions.steps.surround_exercise.text +#. def surround(string, sides): +msgid "code_bits.surround" +msgstr "surround" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle.text +#. temp = hello +#. hello = temp + '!' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.BuildingUpStrings.steps.name_triangle.text +#. temp = hello + '!' +#. hello = temp +msgid "code_bits.temp" +msgstr "temp" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.final_text.text +#. def make_board(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board = [] +#. for _ in range(size): +#. board.append(row.copy()) +#. return board +#. def make_cube(size): +#. cube = [] +#. board = make_board(size) +#. for _ in range(size): +#. cube.append(board.copy()) +#. return cube +#. def test(): +#. cube = make_cube(2) +#. print(cube) +#. cube[0][0][0] = 'X' +#. print(cube) +#. print(cube[0] is cube[1]) +#. print(cube[0][0] is cube[0][1]) +#. print(cube[0][0] is cube[1][0]) +#. test() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MakingTheBoard.steps.naive_make_board +#. def make_board(size): +#. row = [] +#. for _ in range(size): +#. row.append(' ') +#. board = [] +#. for _ in range(size): +#. board.append(row) +#. return board +#. def test(): +#. board = make_board(3) +#. assert_equal(board, [ +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ]) +#. board[0][0] = 'X' +#. assert_equal(board, [ +#. ['X', ' ', ' '], +#. [' ', ' ', ' '], +#. [' ', ' ', ' '], +#. ]) +#. test() +msgid "code_bits.test" +msgstr "test" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsWithinFunctions.steps.print_twice_call_print_many +#. def print_many(n, thing): +#. for _ in range(n): +#. print(thing) +#. def print_twice(x): +#. print_many(2, x) +#. print_twice("Hello") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsWithinFunctions.steps.see_stack_in_birdseye +#. def print_many(n, thing): +#. for _ in range(n): +#. print(thing) +#. def print_twice(x): +#. print_many(2, x) +#. print_twice("Hello") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsWithinFunctions.steps.see_stack_in_pythontutor +#. def print_many(n, thing): +#. for _ in range(n): +#. print(thing) +#. def print_twice(x): +#. print_many(2, x) +#. print_twice("Hello") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsWithinFunctions.steps.see_stack_in_snoop +#. def print_many(n, thing): +#. for _ in range(n): +#. print(thing) +#. def print_twice(x): +#. print_many(2, x) +#. print_twice("Hello") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.print_many +#. def print_many(thing, n): +#. for _ in range(n): +#. print(thing) +#. print_many("Hello", 3) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.swap_parameters +#. def print_many(n, thing): +#. for _ in range(n): +#. print(thing) +#. print_many(3, "Hello") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.swap_parameters.text +#. def print_many(n, thing): +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DefiningFunctions.steps.swap_parameters.text +#. thing = "Hello" +#. n = 3 +#. for _ in range(n): +#. print(thing) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.final_text.text +#. for thing in things: +#. if thing == thing_to_find: +#. found = True +#. break +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.final_text.text +#. found = False +#. for thing in things: +#. if thing == thing_to_find: +#. found = True +#. print(found) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.list_contains_exercise +#. things = ['This', 'is', 'a', 'list'] +#. thing_to_find = 'is' +#. found = False +#. for thing in things: +#. if thing == thing_to_find: +#. found = True +#. print(found) +msgid "code_bits.thing" +msgstr "thing" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.final_text.text +#. for thing in things: +#. if thing == thing_to_find: +#. found = True +#. break +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.final_text.text +#. found = False +#. for thing in things: +#. if thing == thing_to_find: +#. found = True +#. print(found) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.list_contains_exercise +#. things = ['This', 'is', 'a', 'list'] +#. thing_to_find = 'is' +#. found = False +#. for thing in things: +#. if thing == thing_to_find: +#. found = True +#. print(found) +msgid "code_bits.thing_to_find" +msgstr "thing_to_find" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsTerminology.steps.len_of_none +#. things = print([1, 2, 3]) +#. length = len(things) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsTerminology.steps.print_returns_none +#. things = [1, 2, 3] +#. length = len(things) +#. printed = print(length) +#. print(printed) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.index_exercise +#. things = ['on', 'the', 'way', 'to', 'the', 'store'] +#. to_find = 'the' +#. for i in range(len(things)): +#. if to_find == things[i]: +#. print(i) +#. break +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.can_contain_anything +#. x = 1 +#. things = ['Hello', x, x + 3] +#. print(things) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.final_text.text +#. for thing in things: +#. if thing == thing_to_find: +#. found = True +#. break +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.final_text.text +#. found = False +#. for thing in things: +#. if thing == thing_to_find: +#. found = True +#. print(found) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingBreak.steps.list_contains_exercise +#. things = ['This', 'is', 'a', 'list'] +#. thing_to_find = 'is' +#. found = False +#. for thing in things: +#. if thing == thing_to_find: +#. found = True +#. print(found) +msgid "code_bits.things" +msgstr "things" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPositionExercises.steps.index_exercise +#. things = ['on', 'the', 'way', 'to', 'the', 'store'] +#. to_find = 'the' +#. for i in range(len(things)): +#. if to_find == things[i]: +#. print(i) +#. break +msgid "code_bits.to_find" +msgstr "to_find" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner +#. def diagonal_winner(board): +#. all_equal1 = True +#. all_equal2 = True +#. topleft = board[0][0] +#. topright = board[0][-1] +#. for i in range(len(board)): +#. if board[i][i] == ' ' or board[i][i] != topleft: +#. all_equal1 = False +#. if board[i][-i - 1] == ' ' or board[i][-i - 1] != topright: +#. all_equal2 = False +#. return all_equal1 or all_equal2 +msgid "code_bits.topleft" +msgstr "topleft" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.diagonal_winner +#. def diagonal_winner(board): +#. all_equal1 = True +#. all_equal2 = True +#. topleft = board[0][0] +#. topright = board[0][-1] +#. for i in range(len(board)): +#. if board[i][i] == ' ' or board[i][i] != topleft: +#. all_equal1 = False +#. if board[i][-i - 1] == ' ' or board[i][-i - 1] != topright: +#. all_equal2 = False +#. return all_equal1 or all_equal2 +msgid "code_bits.topright" +msgstr "topright" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.numbers_sum +#. numbers = [3, 1, 4, 1, 5, 9] +#. total = 0 +#. for number in numbers: +#. total += number +#. print(total) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum +#. words = ['This', 'is', 'a', 'list'] +#. total = '' +#. for word in words: +#. total += word +#. print(total) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +#. words = ['This', 'is', 'a', 'list'] +#. separator = ' - ' +#. total = '' +#. not_first = False +#. for word in words: +#. if not_first: +#. total += separator +#. total += word +#. not_first = True +#. print(total) +msgid "code_bits.total" +msgstr "total" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in quantities: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.cleanup_shopping_cart.text +#. def total_cost(quantities, prices): +#. result = 0 +#. for item in ...: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1 +#. def total_cost(cart, prices): +#. result = 0 +#. for item in cart: +#. price = prices[item] +#. result += price +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart1.text +#. def total_cost(cart, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. result += price +#. return result +#. assert_equal( +#. total_cost( +#. ['apple', 'box', 'cat'], +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 107, +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4 +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = prices[item] +#. quantity = quantities[item] +#. result += price * quantity +#. return result +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingDictionaries.steps.shopping_cart4.text +#. def total_cost(cart, quantities, prices): +#. result = 0 +#. for item in cart: +#. price = ... +#. quantity = ... +#. result += price * quantity +#. return result +#. assert_equal( +#. total_cost( +#. ['dog', 'box'], +#. {'dog': 5000000, 'box': 2}, +#. {'apple': 2, 'box': 5, 'cat': 100, 'dog': 100}, +#. ), +#. 500000010, +#. ) +msgid "code_bits.total_cost" +msgstr "total_cost" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.nested_dictionaries +#. def print_words(words): +#. for word in words: +#. translations = words[word] +#. print(f"English: {word}") +#. for language in translations: +#. print(f"{language}: {translations[language]}") +#. print(f"---") +#. print_words({ +#. 'apple': { +#. 'French': 'pomme', +#. 'German': 'apfel', +#. }, +#. 'box': { +#. 'French': 'boite', +#. 'German': 'kasten', +#. }, +#. }) +msgid "code_bits.translations" +msgstr "translations" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.ReturningValuesFromFunctions.steps.first_return +#. def double(x): +#. return x * 2 +#. number = 5 +#. twice = double(number) +#. print(number) +#. print(twice) +msgid "code_bits.twice" +msgstr "twice" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.capitalise +#. sentence = 'HELLO THERE' +#. upper = True +#. new_sentence = '' +#. for char in sentence: +#. if upper: +#. char = char.upper() +#. else: +#. char = char.lower() +#. new_sentence += char +#. upper = False +#. print(new_sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IfAndElse.steps.spongebob +#. sentence = 'One more exercise, and then you can relax.' +#. upper = True +#. new_sentence = '' +#. for char in sentence: +#. if upper: +#. char = char.upper() +#. upper = False +#. else: +#. char = char.lower() +#. upper = True +#. new_sentence += char +#. print(new_sentence) +msgid "code_bits.upper" +msgstr "upper" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.hints.0.text +#. def valid_image(filename): +#. if filename.endswith(".png") or filename.endswith(".jpg"): +#. return True +#. else: +#. return False +#. assert_equal(valid_image("dog.png"), True) +#. assert_equal(valid_image("cat.jpg"), True) +#. assert_equal(valid_image("invoice.pdf"), False) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingNotPage.steps.NotPriority.hints.3.text +#. def valid_image(filename): +#. return filename.endswith(".png") or filename.endswith(".jpg") +msgid "code_bits.valid_image" +msgstr "valid_image" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.index_predict_exercise.text +#. some_list.index(value) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.FunctionsAndMethodsForLists.steps.remove_predict_exercise.text +#. some_list.remove(value) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.count_predict_exercise.text +#. some_list.count(value) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreListFunctionsAndMethods.steps.in_predict_exercise.text +#. value in some_list +msgid "code_bits.value" +msgstr "value" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.cannot_return_multiple_values.text +#. if condition: +#. return value1 +#. else: +#. return value2 +msgid "code_bits.value1" +msgstr "value1" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.MoreOnReturn.steps.cannot_return_multiple_values.text +#. if condition: +#. return value1 +#. else: +#. return value2 +msgid "code_bits.value2" +msgstr "value2" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingBirdseye.steps.birdseye_loop_example +#. word = 'Amazing' +#. vowels = [] +#. consonants = [] +#. for letter in word: +#. if letter.lower() in 'aeiou': +#. vowels.append(letter) +#. else: +#. consonants.append(letter) +#. print(vowels) +#. print(consonants) +msgid "code_bits.vowels" +msgstr "vowels" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i - 1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner.text +#. def winner(board): +#. ... +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i-1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. assert_equal( +#. winner( +#. [ +#. ['X', 'X', 'X', ' '], +#. ['X', 'X', ' ', ' '], +#. ['X', ' ', 'O', 'X'], +#. [' ', ' ', 'O', 'X'] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' ', 'X'], +#. ['O', 'X', 'O'], +#. ['O', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' '], +#. ['X', 'O'] +#. ] +#. ), +#. True +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.winner" +msgstr "winner" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i - 1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingTicTacToe.steps.winner.text +#. def winner(board): +#. ... +#. def winning_line(strings): +#. piece = strings[0] +#. if piece == ' ': +#. return False +#. for entry in strings: +#. if piece != entry: +#. return False +#. return True +#. def row_winner(board): +#. for row in board: +#. if winning_line(row): +#. return True +#. return False +#. def column_winner(board): +#. for col in range(len(board[0])): +#. column = [] +#. for row in board: +#. column.append(row[col]) +#. if winning_line(column): +#. return True +#. return False +#. def diagonal_winner(board): +#. diagonal1 = [] +#. diagonal2 = [] +#. for i in range(len(board)): +#. diagonal1.append(board[i][i]) +#. diagonal2.append(board[i][-i-1]) +#. return winning_line(diagonal1) or winning_line(diagonal2) +#. assert_equal( +#. winner( +#. [ +#. ['X', 'X', 'X', ' '], +#. ['X', 'X', ' ', ' '], +#. ['X', ' ', 'O', 'X'], +#. [' ', ' ', 'O', 'X'] +#. ] +#. ), +#. False +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' ', 'X'], +#. ['O', 'X', 'O'], +#. ['O', 'O', 'O'] +#. ] +#. ), +#. True +#. ) +#. assert_equal( +#. winner( +#. [ +#. ['X', ' '], +#. ['X', 'O'] +#. ] +#. ), +#. True +#. ) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. player = player1 +#. for _ in range(board_size * board_size): +#. play_move(board, player) +#. if winner(board): +#. print_winner(player) +#. return +#. if player == player1: +#. player = player2 +#. else: +#. player = player1 +#. print_draw() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.TheFullTicTacToeGame.steps.the_full_game.text +#. def winning_line(strings): +#. strings = set(strings) +#. return len(strings) == 1 and ' ' not in strings +#. def row_winner(board): +#. return any(winning_line(row) for row in board) +#. def column_winner(board): +#. return row_winner(zip(*board)) +#. def main_diagonal_winner(board): +#. return winning_line(row[i] for i, row in enumerate(board)) +#. def diagonal_winner(board): +#. return main_diagonal_winner(board) or +#. main_diagonal_winner(reversed(board)) +#. def winner(board): +#. return row_winner(board) or column_winner(board) or +#. diagonal_winner(board) +#. def format_board(board): +#. size = len(board) +#. line = f'\n {"+".join("-" * size)}\n' +#. rows = [f'{i + 1} {"|".join(row)}' for i, row in enumerate(board)] +#. return f' {" ".join(str(i + 1) for i in +#. range(size))}\n{line.join(rows)}' +#. def play_move(board, player): +#. print(f'{player} to play:') +#. row = int(input()) - 1 +#. col = int(input()) - 1 +#. board[row][col] = player +#. print(format_board(board)) +#. def make_board(size): +#. return [[' '] * size for _ in range(size)] +#. def print_winner(player): +#. print(f'{player} wins!') +#. def print_draw(): +#. print("It's a draw!") +#. def play_game(board_size, player1, player2): +#. board = make_board(board_size) +#. print(format_board(board)) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_move(board, player1) +#. play_move(board, player2) +#. play_game(3, 'X', 'O') +msgid "code_bits.winning_line" +msgstr "winning_line" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsTerminology.steps.methods_of_str +#. word = 'Hello' +#. print(word.upper) +#. print(word.upper()) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.CallingFunctionsTerminology.steps.no_append_for_str +#. word = 'Hello' +#. word.append('!') +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_french +#. def print_words(french): +#. for word in french: +#. print("English: " + word) +#. print("French: " + french[word]) +#. print("---") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.english_to_german +#. def print_words(french, german): +#. for word in french: +#. print("English: " + word) +#. print("French: " + french[word]) +#. print("German: " + german[word]) +#. print("---") +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.nested_dictionaries +#. def print_words(words): +#. for word in words: +#. translations = words[word] +#. print(f"English: {word}") +#. for language in translations: +#. print(f"{language}: {translations[language]}") +#. print(f"---") +#. print_words({ +#. 'apple': { +#. 'French': 'pomme', +#. 'German': 'apfel', +#. }, +#. 'box': { +#. 'French': 'boite', +#. 'German': 'kasten', +#. }, +#. }) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingBirdseye.steps.birdseye_loop_example +#. word = 'Amazing' +#. vowels = [] +#. consonants = [] +#. for letter in word: +#. if letter.lower() in 'aeiou': +#. vowels.append(letter) +#. else: +#. consonants.append(letter) +#. print(vowels) +#. print(consonants) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum +#. words = ['This', 'is', 'a', 'list'] +#. total = '' +#. for word in words: +#. total += word +#. print(total) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +#. words = ['This', 'is', 'a', 'list'] +#. separator = ' - ' +#. total = '' +#. not_first = False +#. for word in words: +#. if not_first: +#. total += separator +#. total += word +#. not_first = True +#. print(total) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingVariables.steps.word_assign +#. word = 'Hello' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingVariables.steps.word_check +#. word +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'are' +#. present = False +#. for sublist in strings: +#. for string in sublist: +#. if word in string: +#. present = True +#. print(present) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.list_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "Python" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'hello' +#. for sublist in strings: +#. for string in sublist: +#. if word in string: +#. print(string) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.string_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "hello" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise +#. strings = [['hello there', 'how are you'], ['goodbye world', 'hello +#. world']] +#. word = 'goodbye' +#. for sublist in strings: +#. present = False +#. for string in sublist: +#. if word in string: +#. present = True +#. print(present) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.LoopingOverNestedLists.steps.sublist_contains_word_exercise.text +#. strings = [ +#. [ +#. "hello there", +#. "how are you", +#. ], +#. [ +#. "goodbye world", +#. "hello world", +#. ] +#. ] +#. word = "goodbye" +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_doesnt_change +#. word = 'Hello' +#. name = 'World' +#. sentence = word + ' ' + name +#. print(sentence) +#. word = 'Goodbye' +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_doesnt_change.text +#. word = 'Goodbye' +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StoringCalculationsInVariables.steps.sentence_equals_word_plus_name +#. word = 'Hello' +#. name = 'World' +#. sentence = word + ' ' + name +#. print(sentence) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StringMethodsUnderstandingMutation.steps.final_text.text +#. if word.lower() == 'yes': +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.StringMethodsUnderstandingMutation.steps.string_lower_upper.text +#. word.lower() +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.first_print +#. print(word + ' ' + your_name) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.goodbye_plus_name +#. word + ' ' + your_name +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.name_assign.text +#. word = 'Hello' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.word_assign_goodbye +#. word = 'Goodbye' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.word_plus_name +#. word + your_name +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.word_plus_name_with_space +#. word + ' ' + your_name +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.WritingPrograms.steps.editor_hello_world +#. word = 'Hello' +#. name = 'World' +#. print(word + ' ' + name) +#. word = 'Goodbye' +#. print(word + ' ' + name) +msgid "code_bits.word" +msgstr "word" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.DictionaryKeysAndValues.steps.nested_dictionaries +#. def print_words(words): +#. for word in words: +#. translations = words[word] +#. print(f"English: {word}") +#. for language in translations: +#. print(f"{language}: {translations[language]}") +#. print(f"---") +#. print_words({ +#. 'apple': { +#. 'French': 'pomme', +#. 'German': 'apfel', +#. }, +#. 'box': { +#. 'French': 'boite', +#. 'German': 'kasten', +#. }, +#. }) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.print_indices_and_words +#. words = ['Python'] +#. for index in range(len(words)): +#. print(index) +#. print(words[index]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.print_indices_and_words.text +#. [0, 1, 2, ..., len(words) - 2, len(words) - 1] +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.GettingElementsAtPosition.steps.print_last_element +#. words = ['Python'] +#. print(words[len(words) - 1]) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum +#. words = ['This', 'is', 'a', 'list'] +#. total = '' +#. for word in words: +#. total += word +#. print(total) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.IntroducingLists.steps.strings_sum_bonus +#. words = ['This', 'is', 'a', 'list'] +#. separator = ' - ' +#. total = '' +#. not_first = False +#. for word in words: +#. if not_first: +#. total += separator +#. total += word +#. not_first = True +#. print(total) +msgid "code_bits.words" +msgstr "words" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.final_text.text +#. first = x1 +#. if x2 < first: +#. first = x2 +#. if x3 < first: +#. first = x3 +#. print(first) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.final_text.text +#. if x1 < x2: +#. if x1 < x3: +#. first = x1 +#. else: +#. first = x3 +#. else: +#. if x2 < x3: +#. first = x2 +#. else: +#. first = x3 +#. print(first) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.final_text.text +#. x1 = 'Charlie' +#. x2 = 'Alice' +#. x3 = 'Bob' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.min_three_exercise +#. x1 = 1 +#. x2 = 2 +#. x3 = 3 +#. if x1 < x2: +#. if x1 < x3: +#. first = x1 +#. else: +#. first = x3 +#. else: +#. if x2 < x3: +#. first = x2 +#. else: +#. first = x3 +#. print(first) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.min_three_exercise.text +#. x1 = 30 +#. x2 = 10 +#. x3 = 20 +msgid "code_bits.x1" +msgstr "x1" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.final_text.text +#. first = x1 +#. if x2 < first: +#. first = x2 +#. if x3 < first: +#. first = x3 +#. print(first) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.final_text.text +#. if x1 < x2: +#. if x1 < x3: +#. first = x1 +#. else: +#. first = x3 +#. else: +#. if x2 < x3: +#. first = x2 +#. else: +#. first = x3 +#. print(first) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.final_text.text +#. x1 = 'Charlie' +#. x2 = 'Alice' +#. x3 = 'Bob' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.min_three_exercise +#. x1 = 1 +#. x2 = 2 +#. x3 = 3 +#. if x1 < x2: +#. if x1 < x3: +#. first = x1 +#. else: +#. first = x3 +#. else: +#. if x2 < x3: +#. first = x2 +#. else: +#. first = x3 +#. print(first) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.min_three_exercise.text +#. x1 = 30 +#. x2 = 10 +#. x3 = 20 +msgid "code_bits.x2" +msgstr "x2" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.final_text.text +#. first = x1 +#. if x2 < first: +#. first = x2 +#. if x3 < first: +#. first = x3 +#. print(first) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.final_text.text +#. if x1 < x2: +#. if x1 < x3: +#. first = x1 +#. else: +#. first = x3 +#. else: +#. if x2 < x3: +#. first = x2 +#. else: +#. first = x3 +#. print(first) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.final_text.text +#. x1 = 'Charlie' +#. x2 = 'Alice' +#. x3 = 'Bob' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.min_three_exercise +#. x1 = 1 +#. x2 = 2 +#. x3 = 3 +#. if x1 < x2: +#. if x1 < x3: +#. first = x1 +#. else: +#. first = x3 +#. else: +#. if x2 < x3: +#. first = x2 +#. else: +#. first = x3 +#. print(first) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.OtherComparisonOperators.steps.min_three_exercise.text +#. x1 = 30 +#. x2 = 10 +#. x3 = 20 +msgid "code_bits.x3" +msgstr "x3" + +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.first_print +#. print(word + ' ' + your_name) +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.goodbye_plus_name +#. word + ' ' + your_name +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.hello_plus_name +#. 'Hello ' + your_name +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.name_assign +#. your_name = 'Alex' +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.word_plus_name +#. word + your_name +#. ------ +#. https://poeditor.com/projects/view_terms?id=490053&search=pages.UsingVariables.steps.word_plus_name_with_space +#. word + ' ' + your_name +msgid "code_bits.your_name" +msgstr "your_name" + +msgid "frontend.are_you_sure" +msgstr "你确定吗？" + +msgid "frontend.ask_for_help" +msgstr "请求帮助" + +msgid "frontend.assessment" +msgstr "评估" + +msgid "frontend.assessment_description" +msgstr "当你运行的代码没有通过当前步骤时，这部分有时会解释出错的原因。" + +msgid "frontend.assessment_lint" +msgstr "在你的代码中发现以下通用问题：" + +msgid "frontend.assessment_passed_tests" +msgstr "好消息是，你的代码通过了 ${num} 个测试！" + +msgid "frontend.cancel" +msgstr "取消" + +msgid "frontend.chat_on_discord" +msgstr "在 Discord 上聊天" + +msgid "frontend.click_for_error_details" +msgstr "点击查看错误详情" + +msgid "frontend.click_to_expand" +msgstr "点击展开" + +msgid "frontend.contact_directly" +msgstr "另外，你可以直接联系我们：" + +msgid "frontend.copy_warning" +msgstr "" +"**停止！**\n" +"\n" +"尽量避免复制粘贴代码。如果你自己输入代码，你会学得更好、记得更牢。\n" +"\n" +"当复制是合适的时，会有一个按钮可以点击来简化操作。如果没有按钮，试着自己输入。\n" +"\n" +"话虽如此，我们不会强迫你。如果你真的想复制，可以去做。" + +msgid "frontend.copying_solution_not_allowed" +msgstr "不允许从提示/解决方案区域复制！" + +msgid "frontend.current_page" +msgstr "（当前）" + +msgid "frontend.description" +msgstr "描述" + +msgid "frontend.developer_mode" +msgstr "开发者模式" + +msgid "frontend.developer_mode_description" +msgstr "启用“反向步骤”和“跳过步骤”按钮。" + +msgid "frontend.did_you_mean" +msgstr "你是想说..." + +msgid "frontend.error_has_been_reported" +msgstr "错误已被报告。" + +msgid "frontend.error_traceback" +msgstr "错误追踪：" + +msgid "frontend.exercise_requirement" +msgstr "这一步是一个练习。你需要找出什么代码会产生正确的结果。可能有许多不同的正确答案。" + +msgid "frontend.exercise_stdin" +msgstr "你的程序需要通过 `input()` 函数接收用户输入。当测试正确性时，会模拟不同的用户输入。" + +msgid "frontend.feedback" +msgstr "反馈" + +msgid "frontend.feedback_email_placeholder" +msgstr "邮箱（可选）" + +msgid "frontend.function_exercise" +msgstr "" +"定义一个函数，开头像这样：\n" +"\n" +"${header}\n" +"\n" +"然后用你的实现填充缩进的主体。\n" +"\n" +"这个函数会用不同的参数调用，以测试它是否通用。你也可以在工作时自己调用这个函数进行测试，但这不会影响评估。" + +msgid "frontend.function_exercise_goal" +msgstr "你的函数需要 `${print_or_return}` 正确的结果。" + +msgid "frontend.get_another_hint" +msgstr "获取另一个提示" + +msgid "frontend.get_hint" +msgstr "获取提示" + +msgid "frontend.give_feedback" +msgstr "提供反馈" + +msgid "frontend.give_feedback_from_menu" +msgstr "从左上角菜单提供反馈。" + +msgid "frontend.give_feedback_instructions" +msgstr "" +"告诉我们你喜欢什么或不喜欢什么！如果你在报告一个错误，请详细描述问题：\n" +"\n" +"- 你在问题发生前做了什么？\n" +"- 有哪些步骤可以重现这个问题？\n" +"- 你观察到发生了什么，以及你期望发生什么？" + +msgid "frontend.hidden_solution_instructions" +msgstr "" +"上面是一个示例解决方案，但它是隐藏的。多次点击“显示”按钮，可以逐步显示解决方案。尽量在你认为已经显示足够并且可以自己填补剩余空白时停止。然后在编辑器中输入解决方案并运行。你的解决方案不必与上面的相同。" + +msgid "frontend.hints_and_solution" +msgstr "提示和解决方案" + +msgid "frontend.hints_progress" +msgstr "显示了 ${numHints} 个中的 ${totalHints} 个提示" + +msgid "frontend.internal_error_start" +msgstr "哎呀，出了点问题！ ${maybeErrorReported} 你可以做以下事情：" + +msgid "frontend.loading_wait" +msgstr "加载中..." + +msgid "frontend.login_or_sign_up" +msgstr "登录 / 注册" + +msgid "frontend.new" +msgstr "新建" + +msgid "frontend.next" +msgstr "下一步" + +msgid "frontend.no" +msgstr "不" + +msgid "frontend.no_hints_available" +msgstr "这一步没有任何提示。尝试再次阅读说明和要求。如果你真的卡住了，仍然可以查看解决方案。" + +msgid "frontend.no_input_variables" +msgstr "这个练习没有输入变量。" + +msgid "frontend.non_function_exercise" +msgstr "" +"你的代码 *必须* 以给输入变量赋值开始，例如：\n" +"\n" +"${inputs}\n" +"\n" +"这些值只是示例，你可以选择不同的值。你的代码将自动使用不同的值进行测试，以检查它是否通用。" + +msgid "frontend.ok" +msgstr "好的" + +msgid "frontend.open_github_issue" +msgstr "在 GitHub 上打开一个问题" + +msgid "frontend.output_prediction_correct" +msgstr "正确！" + +msgid "frontend.output_prediction_error_choice" +msgstr "错误" + +msgid "frontend.output_prediction_question" +msgstr "你认为结果会是什么？" + +msgid "frontend.output_prediction_wrong_once" +msgstr "哎呀，那不对。你可以再试一次！" + +msgid "frontend.output_prediction_wrong_twice" +msgstr "对不起，答案错误。下次再试吧！" + +msgid "frontend.parsons_solution_instructions" +msgstr "" +"上面是一个示例解决方案，行的顺序是错的。你可以拖动它们来重新排序。找到正确的顺序由你来决定，我们不会告诉你是否正确。在编辑器中实验并运行部分解决方案可能会帮助你找出正确的顺序。你仍然需要在编辑器中输入一个正确的解决方案并运行它，以便继续。" + +msgid "frontend.previous" +msgstr "上一页" + +msgid "frontend.program_in_text" +msgstr "你需要运行的确切代码在上面的文本中显示，完整无缺。" + +msgid "frontend.question_wizard" +msgstr "问题向导" + +msgid "frontend.question_wizard_expected_output" +msgstr "" +"好的，现在在下面输入你期望/想要的程序输出。如果它正常工作，它会显示什么？如果不应该输出任何内容，那么在你的代码中添加一些 `print()` 调用，以便输出一些有用的内容。\n" +"\n" +"完成后，再次点击“运行”以生成你的问题。" + +msgid "frontend.question_wizard_intro" +msgstr "" +"如果你需要帮助，有很多网站，比如 [Stack Overflow](https://stackoverflow.com/) 和 [reddit](https://www.reddit.com/r/learnpython/)，你可以在上面提问。这是一个帮助你写出高质量问题的工具，能够获得答案的可能性更大。\n" +"\n" +"在右侧输入并运行你的代码。如果你没有任何代码，因为你不知道从哪里开始，我恐怕这个工具无法帮助你。你仍然可以寻求帮助，但最好先阅读 [我应该避免问什么类型的问题？](https://stackoverflow.com/help/dont-ask)\n" +"\n" +"如果你的问题与服务器（例如 Django 或 Flask）、网络请求、数据库或无法在此处导入的包有关，那么这个工具将无法工作。但是，仅仅因为你当前的代码 *涉及* 这些内容，并不意味着你的问题 *就是* 关于这些内容。如果你遇到一般的 Python/编程/逻辑问题，那么请从其他内容中提取出那个问题。使用 Django 的 Python 仍然是 Python。如果你无法做到这一点，请在提问之前阅读 [如何创建一个最小的、可重复的示例](https://stackoverflow.com/help/minimal-reproducible-example)。" + +msgid "frontend.refresh_and_try_again" +msgstr "重新加载/刷新页面并重试。" + +msgid "frontend.repeated_frames_description" +msgstr "${name} 在第 ${lineno} 行 (${count} 次)" + +msgid "frontend.requirements" +msgstr "要求" + +msgid "frontend.requirements_description" +msgstr "你需要根据上面的说明运行一些代码。如果这些说明不够清晰，这里有一些额外的说明：" + +msgid "frontend.reveal" +msgstr "显示" + +msgid "frontend.reverse_step" +msgstr "反向步骤" + +msgid "frontend.run" +msgstr "运行" + +msgid "frontend.send_email_to" +msgstr "发送邮件" + +msgid "frontend.settings" +msgstr "设置" + +msgid "frontend.show_shuffled_solution" +msgstr "显示打乱的解决方案" + +msgid "frontend.show_solution" +msgstr "显示解决方案" + +msgid "frontend.show_unscrambled_solution" +msgstr "显示未打乱的解决方案" + +msgid "frontend.sign_out" +msgstr "登出" + +msgid "frontend.similar_frames_skipped" +msgstr "跳过的相似帧：" + +msgid "frontend.skip_step" +msgstr "跳过步骤" + +msgid "frontend.stop" +msgstr "停止" + +msgid "frontend.submit" +msgstr "提交" + +msgid "frontend.table_of_contents" +msgstr "目录" + +msgid "frontend.title" +msgstr "标题" + +msgid "frontend.toc_instructions" +msgstr "" +"下面是课程不同页面的链接。你可以从任何地方开始，按任意顺序进行。每个页面的进度都将被记录。\n" +"\n" +"如果你完全是编程新手，或者有疑问，可以从头开始，每完成一个页面就点击“下一步”。" + +msgid "frontend.try_running_code_again" +msgstr "尝试再次运行代码。" + +msgid "frontend.try_using_different_browser" +msgstr "尝试使用不同的浏览器。" + +msgid "frontend.verbatim" +msgstr "" +"这个步骤只有一个正确答案。你必须运行完全正确的代码，所以请仔细检查你的拼写。只有少数几种细节（例如某些地方的空格）会被忽略，因为它们对程序没有任何影响。" + +msgid "frontend.yes" +msgstr "是的" + +msgid "chapters.a_bit_more_about_strings.title" +msgstr "关于字符串的更多内容" + +msgid "chapters.boolean operators.title" +msgstr "布尔运算符" + +msgid "chapters.dictionaries.title" +msgstr "字典" + +msgid "chapters.for_loops.title" +msgstr "for 循环" + +msgid "chapters.functions.title" +msgstr "函数" + +msgid "chapters.if_statements.title" +msgstr "if 语句" + +msgid "chapters.lists.title" +msgstr "列表" + +msgid "chapters.nested_loops.title" +msgstr "嵌套循环" + +msgid "chapters.string_basics.title" +msgstr "字符串基础" + +msgid "chapters.the_shell.title" +msgstr "Shell" + +msgid "chapters.tic_tac_toe_project.title" +msgstr "井字棋项目" + +msgid "chapters.variables.title" +msgstr "变量" + +msgid "linting_messages.pyflakes.ImportShadowedByLoopVar.message_format" +msgstr "" +"**导入 `{0}` 被循环变量覆盖**\n" +"\n" +"循环变量 `{0}` 的名称应该更改，因为它重新定义了之前导入的 `{0}` 模块。\n" +"选择一个不同的循环变量以避免此错误。" + +msgid "linting_messages.pyflakes.ImportStarNotPermitted.message_format" +msgstr "" +"**使用 `*` 导入不允许**\n" +"\n" +"`from {0} import *` 将模块 `{0}` 中的所有内容导入到当前命名空间。\n" +"这会创建一堆不可见的未知变量。\n" +"这使得阅读和理解代码变得困难，并且很难看出事物的来源。\n" +"\n" +"避免这种导入，而是明确导入你需要的名称。" + +msgid "linting_messages.pyflakes.IsLiteral.message_format" +msgstr "" +"**`is` 与字面量比较**\n" +"\n" +"你使用了 `is`/`is not` 运算符与字面量（例如字符串或数字）进行比较。\n" +"你应该使用 `==` / `!=` 运算符。\n" +"\n" +"`is` 运算符检查两个表达式是否引用同一个对象。\n" +"你很少想要使用它们，当然不适用于像字符串和数字这样的基本数据类型。\n" +"在这些情况下，它们有时会看起来有效（例如对于小数字），但在其他情况下又神秘地\n" +"失败。" + +msgid "linting_messages.pyflakes.MultiValueRepeatedKeyLiteral.message_format" +msgstr "" +"**字典键 `{0}` 重复且值不同**\n" +"\n" +"字典不能有相同键的多个条目。\n" +"请再次检查你的代码，并将重复的键更改为唯一的。" + +msgid "linting_messages.pyflakes.RedefinedWhileUnused.message_format" +msgstr "" +"**未使用时重新定义 `{0}`**\n" +"\n" +"你在第 `{1}` 行定义了 `{0}`，但在使用之前就重新定义了它，\n" +"覆盖了原始定义。\n" +"\n" +"通常情况下，你的函数和类应该有不同的名称。\n" +"确保你使用了你定义的所有内容，例如你调用了你的函数。" + +msgid "linting_messages.pyflakes.UnusedImport.message_format" +msgstr "" +"**未使用的导入 `{0}`**\n" +"\n" +"你导入了 `{0}` 但从未使用过。你是否忘记使用它？\n" +"也许你在其位置使用了错误的变量？如果你不需要这个导入，直接将其完全删除。" + +msgid "linting_messages.pyflakes.UnusedVariable.message_format" +msgstr "" +"**未使用的变量 `{0}`**\n" +"\n" +"你定义了一个变量 `{0}` 但从未使用过。你是否忘记使用它？\n" +"也许你在其位置使用了错误的变量？如果你不需要它，直接将其完全删除。" + +msgid "misc_terms.blank_result" +msgstr "" + +msgid "misc_terms.case_sensitive" +msgstr "" +"Python 是区分大小写的！这意味着小写字母和大写字母很重要，改变它们会改变程序的含义。字符串 `'hello'` 和 `'Hello'` " +"是不同的，变量名 `word` 和 `Word` 也是。" + +msgid "misc_terms.code_should_start_like" +msgstr "" +"你的代码应该像这样开始：\n" +"\n" +"{expected_start}" + +msgid "misc_terms.copy_button" +msgstr "复制" + +msgid "misc_terms.disallowed_default_label" +msgstr "超过 {max_count} {label}" + +msgid "misc_terms.disallowed_default_message" +msgstr "做得好，你找到了一个解决方案！但是，对于这个练习和你的学习，你不允许使用 {label}。" + +msgid "misc_terms.expected_mode_birdseye" +msgstr "在编辑器中输入你的代码，点击 `birdseye` 按钮。" + +msgid "misc_terms.expected_mode_pythontutor" +msgstr "在编辑器中输入你的代码，点击 Python Tutor 按钮。" + +msgid "misc_terms.expected_mode_shell" +msgstr "在 `>>>` 后直接在 shell 中输入你的代码并按 Enter。" + +msgid "misc_terms.expected_mode_snoop" +msgstr "在编辑器中输入你的代码，点击 `snoop` 按钮。" + +msgid "misc_terms.incorrect_mode" +msgstr "代码是正确的，但你没有按照指示运行它。" + +msgid "misc_terms.invalid_inputs" +msgstr "你输入变量的值无效，请尝试使用像示例中的值。" + +msgid "misc_terms.must_define_function" +msgstr "你必须定义一个函数 `{function_name}`" + +msgid "misc_terms.no_more_test_inputs" +msgstr "没有更多的测试输入 - 解决方案应该已经完成了" + +msgid "misc_terms.not_a_function" +msgstr "`{function_name}` 不是一个函数。" + +msgid "misc_terms.q_wiz_debugger" +msgstr "很高兴你在使用调试器！自己解决问题是理想的。如果你不能，使用“运行”按钮生成问题。" + +msgid "misc_terms.q_wiz_final_message" +msgstr "" +"太好了！这里有一些最后的提示：\n" +"\n" +"- 确保输出显示的是你遇到的问题，而不是其他内容。\n" +"- 将你的代码简化为一个 **最小化** 示例。删除与问题无关的任何代码。\n" +"- 通过 `snoop`、`birdseye` 和 Python Tutor 调试器运行你的代码，以了解它的工作原理。\n" +"- 在线搜索你的问题。\n" +"- 阅读 [如何提出一个好问题？](https://stackoverflow.com/help/how-to-ask)\n" +"\n" +"如果你真的准备好了，将以下内容复制并粘贴到问题网站，\n" +"并用问题的描述替换第一行。\n" +"\n" +"你仍然可以更改你的代码或期望输出，并再次点击运行以重新生成问题。\n" +"\n" +" __copyable__\n" +" *解释你正在尝试做什么以及为什么*\n" +"\n" +" 这是我的代码：\n" +"\n" +"{}\n" +"\n" +" 这是结果：\n" +"\n" +"{}\n" +"\n" +" 期望的输出是：\n" +"\n" +"{}" + +msgid "misc_terms.q_wiz_input_and_add" +msgstr "" +"并添加\n" +"\n" +" {list_line}\n" +"\n" +"到你的代码顶部。" + +msgid "misc_terms.q_wiz_input_message_start" +msgstr "" +"`input()` 使得询问和回答关于代码的问题变得更加困难。用字符串替换 input 的调用，以便每个人都可以立即运行代码并获得相同的结果。" + +msgid "misc_terms.q_wiz_input_replace_with" +msgstr "" +"替换：\n" +"\n" +"{original_lines}\n" +"\n" +"为\n" +"\n" +"{replaced_lines}" + +msgid "misc_terms.q_wiz_no_output" +msgstr "你的代码没有输出任何内容。添加一些 `print()` 调用，以便至少输出 *一些* 内容。使用代码向读者准确显示问题所在。" + +msgid "misc_terms.q_wiz_same_as_expected_output" +msgstr "" +"你的输出与期望的输出相同！如果你的问题仍然存在，请调整你的代码和/或期望的输出，以便两个输出不匹配。明确说明如果代码按你希望的方式工作，结果会有什么不同。" + +msgid "misc_terms.signature_should_be" +msgstr "" +"签名应该是：\n" +"\n" +" def {function_name}{needed_signature}:\n" +"\n" +"而不是：\n" +"\n" +" def {function_name}{actual_signature}:" + +msgid "misc_terms.string_spaces_differ" +msgstr "检查你的代码中的字符串是否有正确的空格。例如，`'Hello'` 与 `'Hello '` 是不同的，因为后面有一个空格。" + +msgid "misc_terms.syntax_error_at_line" +msgstr "在第" + +msgid "misc_terms.when_it_should_output" +msgstr "当它应该输出时：" + +msgid "misc_terms.which_is_correct" +msgstr "哪个是正确的！" + +msgid "misc_terms.your_code_outputs" +msgstr "你的代码输出：" + +msgid "misc_terms.your_code_outputs_given_values" +msgstr "" +"给定这些值：\n" +"\n" +"{given_values}\n" +"\n" +"你的代码输出：" + +#. Special choice at the end of all output prediction multiple choice +#. questions +msgid "output_predictions.Error" +msgstr "错误" diff --git a/translations/locales/zh/index.html b/translations/locales/zh/index.html new file mode 100644 index 00000000..00c9a2b1 --- /dev/null +++ b/translations/locales/zh/index.html @@ -0,0 +1,576 @@ + + + + + + + + futurecoder：从零开始学习 Python + + + + + + + + + + + + + +
    +
    + +
    + +
    +
    +
    +
    + +
    +
    + + English + + + Español + + + Français + + + Polski + + + தமிழ் + + + + + + Github + +
    +
    +
    +
    +
    +
    +
    +
    +
    +

    + futurecoder +

    +

    + 从零开始学习 Python。 +

    + + +
    +
    +
    +
    +
    +
    + + + + + + + + + +
    +

    重新定义互动学习

    +
    + +
    +
    +
    +
    +
    +
    + + + + + + + + + + + +
    +

    100% 免费且开源

    +
    + +
    +
    +
    +
    +
    +
    + + + + + + + +
    +

    为初学者精心设计

    +
    + +
    +
    +
    +
    + + + + +
    +
    +
    + +
    +
    +
    +
    + +
    +
    +
    + +
    +
    + +
    +
    +
    + +
    + + +
    +
    +

    听听别人怎么说

    +
    +
    + +
    + + r/LearnProgramming +
    +
    + 1786 + 36 + 118 +
    +     +
    +
    + +
    + + r/InternetIsBeautiful +
    +
    + 560 + 6 + 37 +
    +     +
    +
    + +
    + + GitHub +
    +
    + 1300+ +
    +     +
    +
    + + 我用过 w3schools 和其他应用，但 + + 这是目前我能找到的最好的互动应用 + + 。非常感谢你制作了它。 + +
    +
    + + 这太棒了！我喜欢它！ + 原来可以是这样 + 一种如此简单的学习方式 + ，我几乎为没有早一点遇到它而感到沮丧。 + +
    +
    + + Futurecoder 是 + 我遇到过的最好的互动（或非互动）编程教程 + 。节奏很好，UI/UX 完美。 + +
    +
    + + 我比 Codecademy 更喜欢这个。 + 在做练习时，你 99% 都在主动学习。 + 更多的课程需要以这种方式教学！我爱它！ + +
    +
    + + 惊人的资源。 + 这做得非常好。 + 很多课程都可以使用这种处理方式。 + +
    +
    + + 毫无疑问，这是我有过的最好的学习体验。 + 使用鼓励的、朴实的语言和没有填鸭式的教学方式完全适合我。 + +
    +
    + + 这是帮助我更好地思考的最好工具。 + 我一直在饥渴地学习着内容。 + 当别人无法吸引我的注意力时，我发现它如此有趣。 + +
    +
    + + 它的目的是 + 尽可能简单和快速。 + 我在一周内学会了 Python 的基础知识。 + 我将我现在的水平归功于这个网站。 + +
    +
    + + 老实说，我从来没有对编码感兴趣，但你的课程 + 真的很容易使用 + ，所以我每天都在学习编程。 + +
    +
    +
    +
    + +
    +
    +
    +

    来看下实际的体验吧！

    +
    +
    + +
    +
    +
    + +
    +
    +
    +
    +

    完全互动

    +
    +

    + 用户必须在提供的编辑器或 shell 中运行代码并回答问题以推进。 +

    +
    +
    + +
    +
    +
    +

    轻松调试

    +
    +
    +
    +

    + 只需单击一下，用户就可以运行强大的调试器来可视化执行并找到问题。 + 有三个调试器，每个都有自己的优势： + Python Tutor，Snoop，和 + Bird's Eye（如图）。 +

    +
    +
    + +
    +
    + +
    +
    + +
    +
    +
    +
    +

    增强的错误消息

    +
    +

    + 正常的 Python 回溯对初学者来说很吓人。 + futurecoder 消除了恐惧并使它们变得有用。 +

    +
    +
    + +
    +
    +
    +

    帕森斯问题

    +
    +
    +

    + 如果学生在尝试解决练习时卡住，并且他们已经用尽了所有提示， + 他们可以尝试将打乱的解决方案按正确顺序排列。 + 这确保他们仍然运用思维，同时减少挫败感。 +

    +
    +
    + +
    +
    + +
    +
    + +
    +
    +
    +
    +

    解决方案路径导航

    +
    +

    + 作为最后手段，学生可以逐渐揭示解决方案，直到他们有足够的信息来自己填写剩余的空白。 +

    +
    +
    + +

    + 这只是功能的冰山一角。 +
    更多信息，请观看下面的视频 或 + 立即开始！ +

    +
    + +
    +
    + +
    +
    +
    +

    观看功能和好处的演示：

    + +
    + +
    +
    +
    +
    + +
    +
    +
    +

    想接收 futurecoder 的更新吗？

    +
    +
    + + + +
    +
    +
    + +
    +
    +
    + +
    +
    +

    关于

    +

    + futurecoder 是一个免费开源平台和课程，供完全初学者自学 Python 编程。 +

    +
    futurecoder 的长期目标雄心勃勃：
    +
      +
    • 革新计算机教育。我们相信学编程平台可以做得更好。
      • +
    • 制作最好的学习资源，让每个人都可以贡献和改进
      • +
    • 允许任何人独立学习编程，无论背景或天赋如何
      • +
    +
    我们计划通过以下方式实现这些目标：
    +
      +
    • 让学生在学习编写真实代码时保持参与和兴趣
      • +
    • 提供易于使用的强大工具以防止挫败感
      • +
    • 教授 Python，一个被广泛认为应是第一个学习的语言 + 以及真实应用中最受欢迎的语言。
      • +
    • 使用开源代码库持续迭代
      • +
    +
    +
    +
    + +
    +
    +
    +

    + 这是一个永无止境的项目。 + 要使这个网站更大更好，还有很多工作要做。 + 需要各种帮助，我们会非常感激！ +

    +
    +
    + + +

    有兴趣贡献代码或课程内容吗？

    +
    + +    查看 GitHub 上的贡献指南 + +
    +
    + +
    +
    + +
    +
    +
    +
    +

    联系我们

    +

    +    + + 在 Discord 上聊天 + +

    +

    +    + + 在 GitHub 上打开问题 + +

    +

    +

    +    + + hello@futurecoder.io + +

    +
    +
    +
    + + +
    + + +
    + + + + + + + diff --git a/translations/translate_futurecoder.py b/translations/translate_futurecoder.py new file mode 100644 index 00000000..382914ae --- /dev/null +++ b/translations/translate_futurecoder.py @@ -0,0 +1,983 @@ +import polib +import json +import os +from pathlib import Path +from typing import List, Dict, Any, Optional +import requests +from dataclasses import dataclass +import time +from concurrent.futures import ThreadPoolExecutor +import re +import argparse +from enum import Enum +from collections import defaultdict +import logging +import sys +import glob +from concurrent.futures import as_completed +import subprocess +import shutil + +# Configure logging +logging.basicConfig( + level=logging.DEBUG, + format='%(asctime)s - %(name)s - %(levelname)s - %(message)s', + handlers=[ + logging.StreamHandler(sys.stdout) + ] +) +logger = logging.getLogger(__name__) + +@dataclass +class TranslationRules: + """Translation rules for a specific language""" + language_name: str + language_code: str + plural_forms: str + context: str + +@dataclass +class TranslationConfig: + """Configuration for translation service""" + api_key: str + base_url: str + model: str + +# Base teaching context that applies to all languages +BASE_TEACHING_CONTEXT = """You are a friendly and patient high school Python teacher translating from English to {language_name}. +Your goal is to make Python programming accessible and engaging for young students. + +Follow these translation rules: +1. Use clear, simple language that high school students can understand +2. Keep explanations friendly and encouraging +3. Maintain a teaching tone that guides students through concepts +4. Keep all code, variables, and technical terms in English +5. Preserve all markdown formatting, code blocks, and special markers +6. Maintain all HTML tags and their attributes +7. Keep all placeholders (e.g., {{variable}}, %s, etc.) unchanged +8. Preserve all newlines and spacing +9. Keep all numbers and units unchanged +10. Maintain all punctuation style +11. Keep all URLs and email addresses unchanged +12. Preserve all special characters and emojis +13. IMPORTANT: Never translate or modify special strings that start with double underscores (e.g., __copyable__, __code0__, __program__) +14. Keep all special strings exactly as they appear in the original text + +Remember to: +- Use age-appropriate analogies and examples +- Break down complex concepts into simpler terms +- Maintain an encouraging and supportive tone +- Keep technical explanations clear but not oversimplified""" + +class Language(Enum): + """Supported languages and their translation rules""" + ZH = TranslationRules( + language_name="Chinese", + language_code="zh", + plural_forms="nplurals=1; plural=0;", + context=BASE_TEACHING_CONTEXT.format(language_name="Chinese (Simplified)") + ) + FR = TranslationRules( + language_name="French", + language_code="fr", + plural_forms="nplurals=2; plural=(n > 1);", + context=BASE_TEACHING_CONTEXT.format(language_name="French") + ) + # Example of how to add a new language: + # ES = TranslationRules( + # language_name="Spanish", + # language_code="es", + # plural_forms="nplurals=2; plural=(n != 1);", + # context=BASE_TEACHING_CONTEXT.format(language_name="Spanish") + # ) + + @classmethod + def get_rules(cls, language_code: str) -> TranslationRules: + """Get translation rules for a language code.""" + try: + return cls[language_code.upper()].value + except KeyError: + raise ValueError(f"Unsupported language code: {language_code}") + + @classmethod + def add_language(cls, language_code: str, language_name: str, plural_forms: str) -> None: + """Add a new language to the supported languages. + + Args: + language_code: Two-letter language code (e.g., 'es' for Spanish) + language_name: Full name of the language + plural_forms: Plural forms expression for the language + """ + # Create new TranslationRules instance + rules = TranslationRules( + language_name=language_name, + language_code=language_code, + plural_forms=plural_forms, + context=BASE_TEACHING_CONTEXT.format(language_name=language_name) + ) + + # Add to enum + cls._member_map_[language_code.upper()] = rules + cls._member_names_.append(language_code.upper()) + cls._value2member_map_[rules] = rules + +class POFileSplitter: + def __init__(self, input_file: str, base_output_dir: str, chunk_size: int): + """Initialize the PO file splitter. + + Args: + input_file: Path to the input PO file + base_output_dir: Base directory for chunks (will create chunks/en/ subdirectory) + chunk_size: Maximum number of entries per chunk (for large chapters) + """ + self.input_file = input_file + self.base_output_dir = Path(base_output_dir) + self.en_chunks_dir = self.base_output_dir / "chunks" / "en" + self.chunk_size = chunk_size + self.logger = logging.getLogger(__name__) + self.logger.info(f"Initializing POFileSplitter with input: {input_file}, output: {self.en_chunks_dir}, max chunk size: {chunk_size}") + + def extract_chapter_name(self, msgid: str) -> str: + """Extract chapter name from msgid.""" + # Handle different msgid patterns + if msgid.startswith('pages.'): + # Extract chapter from patterns like: pages.IntroducingNestedLoops.steps.crack_password_exercise.hints.0.text + parts = msgid.split('.') + if len(parts) >= 2: + return parts[1] # IntroducingNestedLoops + elif msgid.startswith('frontend.'): + # Frontend UI elements + return 'frontend_ui' + elif 'hint' in msgid.lower(): + # Hint-related entries + return 'hints' + elif 'code_bits.' in msgid: + # Code bits + return 'code_bits' + elif any(marker in msgid for marker in ['__program__', '__code', '__copyable__']): + # Special markers + return 'special_markers' + else: + # General/uncategorized entries + return 'general' + + def split_entries(self) -> None: + """Split the PO file into chunks organized by chapters and save to chunks/en/.""" + try: + # Load the PO file + self.logger.info(f"Loading PO file: {self.input_file}") + po_file = polib.pofile(self.input_file) + total_entries = len(po_file) + self.logger.info(f"Found {total_entries} entries to split") + + # Group entries by chapter + chapters = defaultdict(list) + for entry in po_file: + chapter_name = self.extract_chapter_name(entry.msgid) + chapters[chapter_name].append(entry) + + self.logger.info(f"Organized entries into {len(chapters)} chapters:") + for chapter, entries in chapters.items(): + self.logger.info(f" - {chapter}: {len(entries)} entries") + + # Create English chunks directory + self.en_chunks_dir.mkdir(parents=True, exist_ok=True) + self.logger.info(f"Created English chunks directory: {self.en_chunks_dir}") + + # Save each chapter as one or more chunks to en/ directory + chunk_count = 0 + for chapter_name, entries in chapters.items(): + # If chapter has too many entries, split into multiple chunks + if len(entries) <= self.chunk_size: + # Single chunk for this chapter + chunk_count += 1 + chunk_file = self.en_chunks_dir / f"{chapter_name}.po" + self.save_chunk(entries, chunk_file, po_file.metadata) + self.logger.info(f"Saved chapter '{chapter_name}' to {chunk_file}") + else: + # Split large chapter into multiple chunks + num_chunks = (len(entries) + self.chunk_size - 1) // self.chunk_size + for i in range(num_chunks): + start_idx = i * self.chunk_size + end_idx = min((i + 1) * self.chunk_size, len(entries)) + chunk_entries = entries[start_idx:end_idx] + + chunk_count += 1 + chunk_file = self.en_chunks_dir / f"{chapter_name}_part{i+1:02d}.po" + self.save_chunk(chunk_entries, chunk_file, po_file.metadata) + self.logger.info(f"Saved chapter '{chapter_name}' part {i+1}/{num_chunks} to {chunk_file}") + + self.logger.info(f"Successfully split PO file into {chunk_count} chapter-based chunks in {self.en_chunks_dir}") + + except Exception as e: + self.logger.error(f"Error splitting PO file: {str(e)}") + raise + + def save_chunk(self, entries: List[polib.POEntry], chunk_file: Path, metadata: dict): + """Save a chunk of entries to a PO file.""" + chunk_po = polib.POFile() + chunk_po.metadata = metadata.copy() + chunk_po.extend(entries) + chunk_po.save(str(chunk_file)) + +class Translator: + def __init__(self, config: TranslationConfig, language_code: str): + """Initialize the translator. + + Args: + config: Translation configuration + language_code: Language code to translate to + """ + self.config = config + self.language_code = language_code + self.rules = Language.get_rules(language_code) + self.logger = logging.getLogger(__name__) + self.logger.info(f"Initialized translator for {self.rules.language_name}") + + # Initialize HTTP session + self.session = requests.Session() + self.session.headers.update({ + "Authorization": f"Bearer {config.api_key}", + "Content-Type": "application/json" + }) + + def is_chunk_translated(self, chunk_file: str) -> bool: + """Check if a chunk file is already translated.""" + try: + chunk = polib.pofile(chunk_file) + total_entries = len(chunk) + translated_entries = 0 + + for entry in chunk: + if entry.msgstr and entry.msgstr.strip(): + translated_entries += 1 + elif entry.msgstr_plural: + # Check if any plural form is translated + if any(msgstr.strip() for msgstr in entry.msgstr_plural.values()): + translated_entries += 1 + + # Consider chunk translated if at least 80% of entries are translated + translation_percentage = (translated_entries / total_entries) * 100 if total_entries > 0 else 0 + is_translated = translation_percentage >= 80 + + self.logger.debug(f"Chunk {os.path.basename(chunk_file)}: {translated_entries}/{total_entries} entries translated ({translation_percentage:.1f}%)") + + return is_translated + + except Exception as e: + self.logger.error(f"Error checking translation status of {chunk_file}: {str(e)}") + return False + + def prepare_translation_request(self, chunk: polib.POFile) -> Dict: + """Prepare the translation request payload.""" + # Convert PO entries to text format + entries_text = [] + for entry in chunk: + # Add special markers to help preserve special strings and formatting + entry_text = f"msgid: {entry.msgid}\n" + if entry.msgstr: + # Mark special strings with a unique marker + msgstr = entry.msgstr + + # Special handling for misc terms + if entry.msgid.startswith("misc_terms."): + # For misc terms, preserve all newlines and formatting exactly + msgstr = msgstr.replace('\n', '') + # Also preserve markdown formatting + msgstr = msgstr.replace('*', '') + msgstr = msgstr.replace('**', '') + msgstr = msgstr.replace('`', '') + msgstr = msgstr.replace('[', '') + msgstr = msgstr.replace(']', '') + msgstr = msgstr.replace('(', '') + msgstr = msgstr.replace(')', '') + else: + # For regular entries, just preserve newlines + msgstr = msgstr.replace('\n', '') + + # Mark special strings + msgstr = re.sub(r'(__\w+__)', r'\1', msgstr) + entry_text += f"msgstr: {msgstr}\n" + if entry.msgid_plural: + entry_text += f"msgid_plural: {entry.msgid_plural}\n" + for i, msgstr in enumerate(entry.msgstr_plural.values()): + # Mark newlines and special strings in plural forms too + msgstr = msgstr.replace('\n', '') + msgstr = re.sub(r'(__\w+__)', r'\1', msgstr) + entry_text += f"msgstr[{i}]: {msgstr}\n" + entries_text.append(entry_text) + + # Combine all entries + text_to_translate = "\n\n".join(entries_text) + self.logger.debug(f"Prepared text to translate (first 100 chars): {text_to_translate[:100]}") + + # Prepare the system message with rules + system_message = f"""You are a professional translator. Your task is to translate the following PO file entries from English to {self.rules.language_name}. + +{self.rules.context} + +The input will be in PO file format with msgid (English) and msgstr (translation) pairs. +Only translate the text in the msgstr fields, keeping all other formatting, markers, and structure exactly as is. + +Special formatting rules: +1. Special strings marked with tags must be preserved exactly as they are +2. Newlines marked with must be preserved exactly as they are, including their position and count +3. For misc_terms entries (starting with "misc_terms."): + - Preserve all newlines exactly as they appear in the original + - Preserve all markdown formatting: + * for italics (*) + * for bold (**) + * for code blocks (`) + * and for links ([ and ]) + * and for URLs (( and )) + - Keep all URLs and links unchanged + - Maintain the exact same number of newlines as the original + +Return the translated text in the same PO file format.""" + + return { + "model": self.config.model, + "messages": [ + {"role": "system", "content": system_message}, + {"role": "user", "content": text_to_translate} + ], + "temperature": 0.3 + } + + def translate_chunk(self, en_chunk_file: str, target_chunk_file: str) -> Optional[polib.POFile]: + """Translate a chunk from English to target language.""" + try: + # Check if target chunk already exists and is translated + if os.path.exists(target_chunk_file) and self.is_chunk_translated(target_chunk_file): + self.logger.info(f"Skipping already translated chunk: {os.path.basename(target_chunk_file)}") + return polib.pofile(target_chunk_file) + + self.logger.info(f"Translating {os.path.basename(en_chunk_file)} → {os.path.basename(target_chunk_file)}") + + # Load the English chunk + self.logger.debug(f"Loading English chunk: {en_chunk_file}") + chunk = polib.pofile(en_chunk_file) + self.logger.debug(f"Loaded chunk with {len(chunk)} entries") + + # Prepare translation request + payload = self.prepare_translation_request(chunk) + self.logger.debug("Prepared translation request") + + # Make API call + self.logger.debug(f"Making API call to {self.config.base_url}") + response = self.session.post(self.config.base_url, json=payload) + + if response.status_code == 200: + result = response.json() + translated_text = result['choices'][0]['message']['content'] + self.logger.debug(f"Received translation (first 100 chars): {translated_text[:100]}") + + # Parse the translated text and update the chunk + updated_chunk = self.parse_translated_text(translated_text, chunk) + + if updated_chunk: + # Ensure target directory exists + os.makedirs(os.path.dirname(target_chunk_file), exist_ok=True) + # Save to target language directory + updated_chunk.save(target_chunk_file) + self.logger.info(f"Successfully translated and saved: {os.path.basename(target_chunk_file)}") + return updated_chunk + else: + self.logger.error(f"Failed to parse translated text for {en_chunk_file}") + return None + else: + self.logger.error(f"API error {response.status_code}: {response.text}") + return None + + except Exception as e: + self.logger.error(f"Error translating chunk {en_chunk_file}: {str(e)}") + return None + + def parse_translated_text(self, translated_text: str, original_chunk: polib.POFile) -> Optional[polib.POFile]: + """Parse the translated text and update the original chunk with translations.""" + try: + self.logger.debug("Parsing translated text") + translated_lines = translated_text.split('\n') + current_entry = None + current_key = None + + for line in translated_lines: + line = line.strip() + if not line: + continue + + if line.startswith('msgid: '): + current_key = 'msgid' + msgid = line[7:].strip() + # Find the entry in the original chunk + current_entry = original_chunk.find(msgid) + if current_entry: + self.logger.debug(f"Found entry for msgid: {msgid[:50]}...") + else: + self.logger.warning(f"Could not find entry for msgid: {msgid[:50]}...") + + elif line.startswith('msgid_plural: '): + current_key = 'msgid_plural' + msgid_plural = line[14:].strip() + if current_entry and current_entry.msgid_plural == msgid_plural: + self.logger.debug(f"Found entry for msgid_plural: {msgid_plural[:50]}...") + + elif line.startswith('msgstr: '): + if current_entry and current_key == 'msgid': + translation = line[8:].strip() + + # Special handling for misc terms + if current_entry.msgid.startswith("misc_terms."): + # Restore markdown formatting + translation = translation.replace('', '*') + translation = translation.replace('', '**') + translation = translation.replace('', '`') + translation = translation.replace('', '[') + translation = translation.replace('', ']') + translation = translation.replace('', '(') + translation = translation.replace('', ')') + + # Restore newlines and special strings + translation = translation.replace('', '\n') + translation = re.sub(r'(__\w+__)', r'\1', translation) + + if translation and translation != current_entry.msgid: # Only update if actually translated + current_entry.msgstr = translation + self.logger.debug(f"Updated msgstr for entry: {current_entry.msgid[:50]}...") + + elif line.startswith('msgstr[0]: '): + if current_entry and current_key == 'msgid_plural': + translation = line[11:].strip() + # Restore newlines and special strings + translation = translation.replace('', '\n') + translation = re.sub(r'(__\w+__)', r'\1', translation) + if translation: + current_entry.msgstr_plural[0] = translation + self.logger.debug(f"Updated msgstr[0] for plural entry") + + elif line.startswith('msgstr[1]: '): + if current_entry and current_key == 'msgid_plural': + translation = line[11:].strip() + # Restore newlines and special strings + translation = translation.replace('', '\n') + translation = re.sub(r'(__\w+__)', r'\1', translation) + if translation: + current_entry.msgstr_plural[1] = translation + self.logger.debug(f"Updated msgstr[1] for plural entry") + + self.logger.debug(f"Successfully parsed translated text") + return original_chunk + + except Exception as e: + self.logger.error(f"Error parsing translated text: {str(e)}") + return None + +class TranslationMerger: + def __init__(self, chunks_dir: str, output_file: str, language_code: str): + self.chunks_dir = chunks_dir + self.output_file = output_file + self.language_code = language_code + self.logger = logging.getLogger(__name__) + # Define the locales directory path + self.locales_dir = Path(os.path.dirname(output_file)) / "locales" / language_code / "LC_MESSAGES" + self.locales_dir.mkdir(parents=True, exist_ok=True) + # Load English PO file for reference + self.english_po = polib.pofile(os.path.join(os.path.dirname(output_file), "english.po")) + + def validate_special_strings(self, entry: polib.POEntry, original_entry: polib.POEntry) -> bool: + """Validate that all special strings from the original entry are preserved in the translation.""" + try: + # Extract special strings from original entry with their positions + original_special_strings = [] + for match in re.finditer(r'(__\w+__)', original_entry.msgstr): + original_special_strings.append((match.group(1), match.start())) + + # Extract special strings from translated entry with their positions + translated_special_strings = [] + for match in re.finditer(r'(__\w+__)', entry.msgstr): + translated_special_strings.append((match.group(1), match.start())) + + # Check if we have the same number of special strings + if len(original_special_strings) != len(translated_special_strings): + self.logger.warning(f"Mismatched special strings count for {entry.msgid[:50]}...") + self.logger.warning(f"Original has {len(original_special_strings)} special strings: {[s[0] for s in original_special_strings]}") + self.logger.warning(f"Translation has {len(translated_special_strings)} special strings: {[s[0] for s in translated_special_strings]}") + return False + + # Check if each special string matches and is in a similar relative position + for (orig_str, orig_pos), (trans_str, trans_pos) in zip(original_special_strings, translated_special_strings): + if orig_str != trans_str: + self.logger.warning(f"Mismatched special string in {entry.msgid[:50]}...") + self.logger.warning(f"Original: {orig_str} at position {orig_pos}") + self.logger.warning(f"Translation: {trans_str} at position {trans_pos}") + return False + + # Calculate relative positions (as percentage of total length) + orig_rel_pos = orig_pos / len(original_entry.msgstr) + trans_rel_pos = trans_pos / len(entry.msgstr) + + # Allow some flexibility in position (within 20% of the text length) + if abs(orig_rel_pos - trans_rel_pos) > 0.2: + self.logger.warning(f"Special string {orig_str} is too far from expected position in {entry.msgid[:50]}...") + self.logger.warning(f"Original relative position: {orig_rel_pos:.2f}") + self.logger.warning(f"Translation relative position: {trans_rel_pos:.2f}") + return False + + return True + + except Exception as e: + self.logger.error(f"Error validating special strings: {str(e)}") + return False + + def fix_special_strings(self, entry: polib.POEntry, original_entry: polib.POEntry) -> polib.POEntry: + """Fix missing or misplaced special strings in the translation by copying them from the original entry.""" + try: + # Extract special strings from original entry with their context + original_special_strings = [] + original_text = original_entry.msgstr + translated_text = entry.msgstr + + # Find all special strings and their surrounding context + for match in re.finditer(r'(__\w+__)', original_text): + special_str = match.group(1) + start = max(0, match.start() - 20) # Get 20 chars before + end = min(len(original_text), match.end() + 20) # Get 20 chars after + context = original_text[start:end] + original_special_strings.append((special_str, context, match.start())) + + # For each special string in the original, ensure it exists in the translation + fixed_text = translated_text + for special_str, context, orig_pos in original_special_strings: + # Check if the special string exists in the translation + if special_str not in fixed_text: + # Find a good position to insert the special string + # Try to find similar context in the translation + context_words = set(re.findall(r'\w+', context)) + best_pos = 0 + best_match = 0 + + # Look for similar context in the translation + for i in range(len(fixed_text) - len(context) + 1): + trans_context = fixed_text[i:i + len(context)] + trans_words = set(re.findall(r'\w+', trans_context)) + common_words = len(context_words & trans_words) + if common_words > best_match: + best_match = common_words + best_pos = i + + # Insert the special string at the best position + if best_match > 0: + fixed_text = fixed_text[:best_pos] + special_str + fixed_text[best_pos:] + else: + # If no good context found, append at the end + fixed_text += f"\n{special_str}\n" + + self.logger.info(f"Added missing special string {special_str} to translation") + + # Create a new entry with the fixed translation + fixed_entry = polib.POEntry( + msgid=entry.msgid, + msgstr=fixed_text, + msgid_plural=entry.msgid_plural, + msgstr_plural=entry.msgstr_plural, + comment=entry.comment, + tcomment=entry.tcomment, + occurrences=entry.occurrences, + flags=entry.flags, + previous_msgid=entry.previous_msgid, + previous_msgid_plural=entry.previous_msgid_plural, + encoding=entry.encoding + ) + + # Validate the fix + if not self.validate_special_strings(fixed_entry, original_entry): + self.logger.warning(f"Failed to fix special strings for {entry.msgid[:50]}...") + # If validation fails, return the original entry's msgstr + fixed_entry.msgstr = original_entry.msgstr + self.logger.info(f"Using original English text for {entry.msgid[:50]}...") + + return fixed_entry + + except Exception as e: + self.logger.error(f"Error fixing special strings: {str(e)}") + return entry + + def normalize_po_file(self, po_file: str) -> bool: + """Normalize line endings and validate PO file format.""" + try: + # Read the PO file + with open(po_file, 'r', encoding='utf-8') as f: + content = f.read() + + # Normalize line endings to \n + content = content.replace('\r\n', '\n').replace('\r', '\n') + + # Parse the PO file using polib first to get proper structure + po = polib.pofile(po_file) + + # Create a new PO file with normalized entries + normalized_po = polib.POFile() + normalized_po.metadata = po.metadata.copy() + + for entry in po: + # Create a new entry + new_entry = polib.POEntry( + msgid=entry.msgid.strip(), + msgstr=entry.msgstr.strip(), + msgid_plural=entry.msgid_plural.strip() if entry.msgid_plural else None, + msgstr_plural=entry.msgstr_plural if entry.msgstr_plural else None, + comment=entry.comment, + tcomment=entry.tcomment, + occurrences=entry.occurrences, + flags=entry.flags, + previous_msgid=entry.previous_msgid, + previous_msgid_plural=entry.previous_msgid_plural, + encoding=entry.encoding + ) + normalized_po.append(new_entry) + + # Write back the normalized content + normalized_po.save(po_file) + + # Validate the normalized file + try: + polib.pofile(po_file) + self.logger.info(f"Successfully normalized and validated {po_file}") + return True + except Exception as e: + self.logger.error(f"PO file validation failed: {str(e)}") + return False + + except Exception as e: + self.logger.error(f"Error normalizing PO file: {str(e)}") + return False + + def compile_mo_file(self, po_file: str) -> bool: + """Compile PO file to MO file using msgfmt.""" + try: + # First normalize the PO file + if not self.normalize_po_file(po_file): + self.logger.error(f"Failed to normalize {po_file}") + return False + + # Always use futurecoder.mo as the output filename + mo_file = self.locales_dir / "futurecoder.mo" + + # Use msgfmt to compile the PO file to MO + result = subprocess.run( + ["msgfmt", "-o", str(mo_file), po_file], + capture_output=True, + text=True + ) + + if result.returncode == 0: + self.logger.info(f"Successfully compiled {po_file} to {mo_file}") + return True + else: + self.logger.error(f"Failed to compile {po_file}: {result.stderr}") + return False + + except Exception as e: + self.logger.error(f"Error compiling MO file: {str(e)}") + return False + + def merge_translations(self) -> None: + """Merge translated chunks into a single PO file and compile to MO.""" + self.logger.info(f"Starting merge process for {self.language_code}") + self.logger.info(f"Looking for chunks in: {self.chunks_dir}") + + # Create output directory if it doesn't exist + os.makedirs(os.path.dirname(os.path.abspath(self.output_file)), exist_ok=True) + + # Get all chunk files + chunk_files = sorted(glob.glob(os.path.join(self.chunks_dir, "*.po"))) + if not chunk_files: + self.logger.error(f"No chunk files found in {self.chunks_dir}") + all_files = glob.glob(os.path.join(self.chunks_dir, "*")) + self.logger.info(f"All files found: {all_files}") + raise FileNotFoundError(f"No chunk files found in {self.chunks_dir}") + + self.logger.info(f"Found {len(chunk_files)} chapter-based chunk files to merge") + for f in chunk_files: + self.logger.info(f" - {os.path.basename(f)}") + + # Create new PO file with metadata from english.po + try: + merged_po = polib.POFile() + merged_po.metadata = self.english_po.metadata.copy() + merged_po.metadata['Language'] = self.language_code + + # Get language rules for plural forms + language_rules = Language.get_rules(self.language_code) + merged_po.metadata['Plural-Forms'] = language_rules.plural_forms + except Exception as e: + self.logger.error(f"Failed to read english.po: {str(e)}") + raise + + # Track statistics + total_entries = 0 + translated_entries = 0 + skipped_entries = 0 + code_bits_kept = 0 + program_entries_kept = 0 + prediction_choices_kept = 0 + + # Process each translated chunk + for chunk_file in chunk_files: + self.logger.info(f"Processing translated chunk: {chunk_file}") + try: + chunk_po = polib.pofile(chunk_file) + total_entries += len(chunk_po) + + for entry in chunk_po: + if entry.msgstr and entry.msgstr.strip(): # Only include translated entries + # Find the corresponding English entry + original_entry = self.english_po.find(entry.msgid) + if original_entry: + # For Chinese and Tamil, keep certain entries in English + if self.language_code in ["zh", "ta"] and ( + entry.msgid.startswith("code_bits.") or + entry.msgid.endswith(".program") or + "output_prediction_choices" in entry.msgid + ): + entry.msgstr = original_entry.msgstr # Use English version + if entry.msgid.startswith("code_bits."): + code_bits_kept += 1 + self.logger.info(f"Keeping English code bit: {entry.msgid[:50]}...") + elif entry.msgid.endswith(".program"): + program_entries_kept += 1 + self.logger.info(f"Keeping English program entry: {entry.msgid[:50]}...") + else: + prediction_choices_kept += 1 + self.logger.info(f"Keeping English prediction choice: {entry.msgid[:50]}...") + + # Create a new entry with stripped content + new_entry = polib.POEntry( + msgid=entry.msgid.strip(), + msgstr=entry.msgstr.strip(), + msgid_plural=entry.msgid_plural.strip() if entry.msgid_plural else None, + msgstr_plural=entry.msgstr_plural if entry.msgstr_plural else None, + comment=entry.comment, + tcomment=entry.tcomment, + occurrences=entry.occurrences, + flags=entry.flags, + previous_msgid=entry.previous_msgid, + previous_msgid_plural=entry.previous_msgid_plural, + encoding=entry.encoding + ) + merged_po.append(new_entry) + translated_entries += 1 + else: + self.logger.warning(f"Skipping untranslated entry in {chunk_file}: {entry.msgid[:50]}...") + skipped_entries += 1 + + except Exception as e: + self.logger.error(f"Error processing chunk {chunk_file}: {str(e)}") + raise + + # Save the merged PO file + try: + # Save with proper formatting + merged_po.save(self.output_file) + self.logger.info(f"Successfully merged translations to {self.output_file}") + + # Normalize and compile the merged PO file to MO + if self.compile_mo_file(self.output_file): + self.logger.info(f"Successfully compiled MO file to {self.locales_dir}") + else: + self.logger.error("Failed to compile MO file") + + self.logger.info(f"Statistics:") + self.logger.info(f" Total entries: {total_entries}") + self.logger.info(f" Translated entries: {translated_entries}") + if self.language_code in ["zh", "ta"]: + self.logger.info(f" Code bits kept in English: {code_bits_kept}") + self.logger.info(f" Program entries kept in English: {program_entries_kept}") + self.logger.info(f" Prediction choices kept in English: {prediction_choices_kept}") + self.logger.info(f" Skipped entries: {skipped_entries}") + if total_entries > 0: + self.logger.info(f" Translation coverage: {(translated_entries/total_entries)*100:.1f}%") + except Exception as e: + self.logger.error(f"Failed to save merged file: {str(e)}") + raise + +def validate_language_code(language_code: str) -> bool: + """Validate if the language code is supported""" + try: + Language(language_code) + return True + except ValueError: + return False + +def translate_all_chunks(translator: Translator, base_chunks_dir: str, language_code: str, max_workers: int = 3): + """Translate all chunks from chunks/en/ to chunks/{lang}/, skipping already translated ones.""" + logger = logging.getLogger(__name__) + + en_chunks_dir = os.path.join(base_chunks_dir, "chunks", "en") + target_chunks_dir = os.path.join(base_chunks_dir, "chunks", language_code) + + # Get all English chunk files + en_chunk_files = sorted(glob.glob(os.path.join(en_chunks_dir, "*.po"))) + if not en_chunk_files: + logger.error(f"No English chunk files found in {en_chunks_dir}") + return + + logger.info(f"Found {len(en_chunk_files)} English chunk files in {en_chunks_dir}") + logger.info(f"Will translate to {target_chunks_dir}") + + # Create target directory + os.makedirs(target_chunks_dir, exist_ok=True) + + # Check which chunks need translation + chunks_to_translate = [] + already_translated = [] + + for en_chunk_file in en_chunk_files: + chunk_name = os.path.basename(en_chunk_file) + target_chunk_file = os.path.join(target_chunks_dir, chunk_name) + + if os.path.exists(target_chunk_file) and translator.is_chunk_translated(target_chunk_file): + already_translated.append((en_chunk_file, target_chunk_file)) + else: + chunks_to_translate.append((en_chunk_file, target_chunk_file)) + + logger.info(f"Translation status:") + logger.info(f" - Already translated: {len(already_translated)} chunks") + logger.info(f" - Need translation: {len(chunks_to_translate)} chunks") + + if already_translated: + logger.info("Already translated chunks:") + for en_file, target_file in already_translated: + logger.info(f" ✓ {os.path.basename(target_file)}") + + if not chunks_to_translate: + logger.info("All chunks are already translated! Skipping translation phase.") + return + + logger.info("Chunks to translate:") + for en_file, target_file in chunks_to_translate: + logger.info(f" → {os.path.basename(en_file)} → {os.path.basename(target_file)}") + + # Translate only the chunks that need translation + logger.info(f"Starting translation of {len(chunks_to_translate)} chunks using {max_workers} workers...") + + with ThreadPoolExecutor(max_workers=max_workers) as executor: + # Submit translation tasks + future_to_chunk = { + executor.submit(translator.translate_chunk, en_file, target_file): (en_file, target_file) + for en_file, target_file in chunks_to_translate + } + + completed = 0 + failed = 0 + + # Process completed tasks + for future in as_completed(future_to_chunk): + en_file, target_file = future_to_chunk[future] + try: + result = future.result() + if result is not None: + completed += 1 + logger.info(f"Progress: {completed + failed}/{len(chunks_to_translate)} - Completed: {os.path.basename(target_file)}") + else: + failed += 1 + logger.error(f"Progress: {completed + failed}/{len(chunks_to_translate)} - Failed: {os.path.basename(target_file)}") + except Exception as e: + failed += 1 + logger.error(f"Progress: {completed + failed}/{len(chunks_to_translate)} - Error: {str(e)}") + + logger.info(f"Translation completed: {completed} successful, {failed} failed") + +def main(): + parser = argparse.ArgumentParser(description="Translate Futurecoder PO files") + parser.add_argument("-l", "--language", required=True, help="Language code (e.g., zh, fr, es)") + parser.add_argument("-k", "--api-key", required=True, help="API key for translation service") + parser.add_argument("--base-url", default="https://api.openai.com/v1/chat/completions", + help="Base URL for the translation API") + parser.add_argument("-m", "--model", default="gpt-3.5-turbo", + help="Model to use for translation") + parser.add_argument("-i", "--input", default="./english.po", + help="Input PO file to translate") + parser.add_argument("-o", "--output-dir", default="./", + help="Output directory for translated files") + parser.add_argument("--max-workers", type=int, default=5, + help="Maximum number of parallel workers") + parser.add_argument("--chunk-size", type=int, default=50, + help="Number of entries per chunk") + parser.add_argument("--skip-mo", action="http://github.com/store_true", + help="Skip MO file compilation") + args = parser.parse_args() + + # Configure logging + logging.basicConfig( + level=logging.INFO, + format='%(asctime)s - %(name)s - %(levelname)s - %(message)s', + handlers=[ + logging.FileHandler(f"translation_{args.language}.log"), + logging.StreamHandler(sys.stdout) + ] + ) + logger = logging.getLogger(__name__) + + try: + # Validate language code + try: + rules = Language.get_rules(args.language) + logger.info(f"Using translation rules for {rules.language_name}") + except ValueError as e: + logger.error(str(e)) + logger.info("Supported languages: " + ", ".join(lang.value.language_name for lang in Language)) + sys.exit(1) + + # Create base chunks directory structure + base_chunks_dir = args.output_dir + en_chunks_dir = os.path.join(base_chunks_dir, "chunks", "en") + target_chunks_dir = os.path.join(base_chunks_dir, "chunks", args.language) + + logger.info(f"Directory structure:") + logger.info(f" - English chunks: {en_chunks_dir}") + logger.info(f" - Target chunks: {target_chunks_dir}") + + # Initialize components + config = TranslationConfig( + api_key=args.api_key, + base_url=args.base_url, + model=args.model + ) + + # Initialize splitter with base output directory + splitter = POFileSplitter( + input_file=args.input, + base_output_dir=base_chunks_dir, + chunk_size=args.chunk_size + ) + translator = Translator(config, args.language) + merger = TranslationMerger( + chunks_dir=target_chunks_dir, + output_file=os.path.join(args.output_dir, f"{args.language}.po"), + language_code=args.language + ) + + # Split the file into English chunks + logger.info(f"Splitting PO file from: {args.input}") + splitter.split_entries() + + # Translate chunks from en/ to {lang}/ + logger.info("Starting translation of chunks...") + translate_all_chunks(translator, base_chunks_dir, args.language, args.max_workers) + + # Merge translations and compile MO file + logger.info(f"Merging translated chunks to: {merger.output_file}") + merger.merge_translations() + + logger.info("Translation process completed successfully!") + logger.info(f"Final output files:") + logger.info(f" - PO file: {os.path.abspath(merger.output_file)}") + logger.info(f" - MO file: {os.path.abspath(merger.locales_dir / 'futurecoder.mo')}") + + except Exception as e: + logger.error(f"Translation process failed: {str(e)}", exc_info=True) + sys.exit(1) + +if __name__ == "__main__": + main() \ No newline at end of file