Why is Google Calendar unable to process my CSV file?

This usually happens when the file is too big . Google Calendar works with files that are one megabyte (1MB) or smaller. If your file is too big, export a shorter date range from the original application. You can also separate the file into smaller files if you're comfortable manually editing CSV or ICAL code.

How do I fix my Google Calendar on my computer?

Table of contents Update your browser. Check your Internet connection. Check your extensions. Clear cache and cookies. Fix your DNS. Oct 27, 2020

How do I manage multiple calendars?

A: The most effective way to manage multiple calendars is to share them all with one master calendar to create a central location for viewing and management .

How do I add a calendar date picker in qualtrics?

Choose Qualtrics Library - Survey Library - Demographics - Calendar & Date Questions. Choose the second question in the list: "Enter a date:", and import . Even though it looks like a text entry question from the design screen, there is code in there so when you preview and take the survey, it shows up as a calendar!

How do I format a CSV file in Google Calendar?

You can import with ICS and CSV files on a computer. Open Google Calendar. In the top right, click Settings. Settings. In the menu on the left, click Import & Export. Click Select file from your computer and select the file you exported. ... Choose which calendar to add the imported events to. ... Click Import. If you have a .

Why is import CSV not working?

One of the most common CSV import errors is that the file is simply too large . That can be caused by too many fields or records in the file, too many columns, or too many rows. The import error can be caused by limits set by the program using the file or the amount of available memory on the system.

How do I remove malware from my Google Calendar?

Go to Settings > Calendar > Accounts . Look for any account that you don't recognize and delete it . The calendar virus account name might be something like “Calendar Events”, “Events Calendar” “Calendar Events Viewer” or something similar. Remove any calendar accounts you don't recognize.

Where is Google Calendar settings?

Set up your calendar On your computer, open Google Calendar. In the top right, click Settings. Settings. Make your changes. All changes are automatically saved.

How do I clean my Google Calendar?

To clear all events from your primary calendar: On your computer, open Google Calendar. On the bottom left, hover over the primary calendar. Click Options. Settings and sharing. Under “Settings for my calendars,” click Remove calendar. Under “Remove calendar,” click Delete.

How many calendars does Google Calendar allow you to manage?

Do not create more than 60 calendars in a short period . To prevent spamming, Calendar limits the number of invitations a user can send to external guests. If a user sends 10,000 invites to people outside of their primary or secondary domain in a short period, their ability to send external invitations is throttled.

How do I combine all my calendars into one?

How to Merge Multiple Google Calendars (Step by Step) Step 1: Click on the settings gear icon in Google Calendar, and then select Settings. Step 2: Under the General tab, click on Import and Export as seen below. Step 3: Click on Export, and your calendar file will be downloaded locally to your computer. More items... May 14, 2023

How do I handle multiple Google calendars?

Log into your Google account. The first thing you must do is open your web browser and go to calendar.google.com. ... Open Settings. ... Expand the Add Calendar menu. ... Create the new calendar. ... Configure the new calendar. Mar 22, 2023

How do I set the date in a calendar object?

Example 1 import java.util.*; public class JavaCalendarsetTimeExample1 extends GregorianCalendar { public static void main(String[] args) { // create a calendar. Calendar mycal = new GregorianCalendar(1996, 10, 23); System.out.println(" Date :" + mycal.getTime() ); Date date = new Date(18, 10, 10); mycal.setTime(date); More items...

How do I create a calendar date selection in Excel?

In the Data type box, click Date and Time (dateTime). Click Format. In the Date and Time Format dialog box, in the Display the time like this list, click the option that you want, and then click OK. In the Date Picker Properties dialog box, under Default Value, click Insert Formula .

What is the difference between CSV and ICS?

A CSV is a text file that uses commas to separate data in tables . It is used for spreadsheets and databases where interchangeability and portability between different software and operating systems is important. An ICS file is also a text file, and it uses an iCalendar specification to format calendar events.

Calendario para ${t} (2023)

\norte

\n\n

Scratch ActiveCode

\norte

(Video) ¡CREA un Calendario 📆 con SÓLO 3 LÍNEAS de CSS! 🎨

\norte

Utilice esta área para escribir código o tomar notas.

\n\n

\norte

(Video) HAZ TU PROPIO CALENDARIO SIN IMPRIMIR NADA | PAPELERÍA CASERA | NatyGloss

\norte

`;\n var el = $(html);\n $(\"body\").append(el);\n el.on(\"shown.bs.modal show.bs.modal\", function () {\n el.find(\".CodeMirror\").each(function (i, e) {\n e.CodeMirror.refresh();\n e.CodeMirror.focus();\n });\n });\n }\n static toggleScratchActivecode() {\n if (!eBookConfig.enableScratchAC) return;\n var divid = \"ac_modal_\" + eBookConfig.scratchDiv;\n var div = $(\"#\" + divid);\n $(`#${eBookConfig.scratchDiv}`).removeClass(\"ac_section\");\n div.modal(\"toggle\");\n }\n}\n\n//\n// Page Initialization\n//\n\n$(document).on(\"runestone:login-complete\", function () {\n ACFactory.createScratchActivecode();\n $(\"[data-component=activecode]\").each(function () {\n if ($(this).closest(\"[data-component=timedAssessment]\").length == 0) {\n // If this element exists within a timed component, don't render it here\n try {\n window.componentMap[this.id] = ACFactory.createActiveCode(\n this,\n $(this).find(\"textarea\").data(\"lang\")\n );\n } catch (err) {\n console.log(`Error rendering Activecode Problem ${this.id}\n Details: ${err}`);\n }\n }\n });\n if (loggedout) {\n for (let k in window.componentMap) {\n window.componentMap[k].disableSaveLoad();\n }\n } else {\n for (let k in window.componentMap) {\n window.componentMap[k].enableSaveLoad();\n }\n }\n});\n\nif (typeof window.component_factory === \"undefined\") {\n window.component_factory = {};\n}\n\nwindow.component_factory.activecode = ACFactory.createActiveCodeFromOpts;\n\n// This is the easiest way to expose this outside the module.\nwindow.ACFactory = ACFactory;\n\n// This seems a bit hacky and possibly brittle, but its hard to know how long it will take to\n// figure out the login/logout status of the user. Sometimes its immediate, and sometimes its\n// long. So to be safe we'll do it both ways..\nvar loggedout;\n$(document).on(\"runestone:logout\", function () {\n loggedout = true;\n});\n$(document).on(\"runestone:logout\", function () {\n for (let k in window.componentMap) {\n if (\n window.componentMap.hasOwnProperty(k) &&\n window.componentMap.attributes[\"data-component\"] == \"activecode\"\n ) {\n window.componentMap[k].disableSaveLoad();\n }\n }\n});\n","/*\nThe TimedActivecode classes are a great example of where multiple inheritance would be useful\nBut since Javascript does not support multiple inheritance we use the mixin pattern.\n\n*/\nimport LiveCode from \"./livecode\";\nimport { ActiveCode } from \"./activecode\";\nimport JSActiveCode from \"./activecode_js\";\nimport HTMLActiveCode from \"./activecode_html\";\nimport SQLActiveCode from \"./activecode_sql\";\n\nvar TimedActiveCodeMixin = {\n timedInit: async function (opts) {\n this.isTimed = true;\n this.hideButtons();\n this.needsReinitialization = true; // the run button click listener needs to be reinitialized\n this.containerDiv.classList.add(\"timedComponent\");\n window.componentMap[this.divid] = this;\n return true;\n },\n\n hideButtons: function () {\n var buttonList = [\n this.saveButton,\n this.loadButton,\n this.gradeButton,\n this.showHideButt,\n this.coachButton,\n this.atButton,\n ];\n for (var i = 0; i < buttonList.length; i++) {\n if (buttonList[i] !== undefined && buttonList[i] !== null)\n $(buttonList[i]).hide();\n }\n },\n\n // bje - not needed anymore\n renderTimedIcon: function (component) {\n // renders the clock icon on timed components. The component parameter\n // is the element that the icon should be appended to.\n var timeIconDiv = document.createElement(\"div\");\n var timeIcon = document.createElement(\"img\");\n $(timeIcon).attr({\n src: \"../_static/clock.png\",\n style: \"width:15px;height:15px\",\n });\n timeIconDiv.className = \"timeTip\";\n timeIconDiv.title = \"\";\n timeIconDiv.appendChild(timeIcon);\n $(component).prepend(timeIconDiv);\n },\n\n checkCorrectTimed: function () {\n // pct_correct is set by the unittest/gui.py module in skulpt.\n // it relies on finding this object in the edList\n if (this.isAnswered) {\n if (this.pct_correct >= 100.0) {\n return \"T\";\n } else {\n return \"F\";\n }\n } else {\n return \"I\"; // we ignore this in the grading if no unittests\n }\n },\n\n hideFeedback: function () {\n $(this.output).css(\"visibility\", \"hidden\");\n },\n\n reinitializeListeners: function (taken) {\n if (!this.runButton.onclick) {\n console.log(\"reattaching runbuttonhandler\");\n this.runButton.onclick = this.runButtonHander.bind(this);\n }\n $(this.codeDiv).show();\n this.runButton.disabled = false;\n $(this.codeDiv).removeClass(\"ac-disabled\");\n this.editor.refresh();\n if (this.historyScrubber !== null) {\n $(this.historyScrubber).slider({\n max: this.history.length - 1,\n value: this.history.length - 1,\n slide: this.slideit.bind(this),\n change: this.slideit.bind(this),\n });\n }\n if (taken) {\n $(`#${this.divid}_unit_results`).show();\n }\n },\n};\n\nexport class TimedLiveCode extends LiveCode {\n constructor(opts) {\n super(opts);\n this.timedInit(opts);\n }\n}\n\nObject.assign(TimedLiveCode.prototype, TimedActiveCodeMixin);\n\nexport class TimedActiveCode extends ActiveCode {\n constructor(opts) {\n super(opts);\n this.timedInitComplete = this.timedInit(opts);\n }\n\n // for timed exams we need to call runProg and tell it that there is\n // no GUI for sliders or other things.\n // the answers.\n async checkCurrentAnswer() {\n let noUI = true;\n const result = await this.timedInitComplete;\n if (this.isAnswered) {\n await this.runProg(noUI, false);\n }\n }\n}\n\nObject.assign(TimedActiveCode.prototype, TimedActiveCodeMixin);\n\nexport class TimedJSActiveCode extends JSActiveCode {\n constructor(opts) {\n super(opts);\n this.timedInit(opts);\n }\n}\nObject.assign(TimedJSActiveCode.prototype, TimedActiveCodeMixin);\n\nexport class TimedHTMLActiveCode extends HTMLActiveCode {\n constructor(opts) {\n super(opts);\n this.timedInit(opts);\n }\n}\nObject.assign(TimedHTMLActiveCode.prototype, TimedActiveCodeMixin);\n\nexport class TimedSQLActiveCode extends SQLActiveCode {\n constructor(opts) {\n super(opts);\n this.timedInit(opts);\n }\n}\nObject.assign(TimedSQLActiveCode.prototype, TimedActiveCodeMixin);\n","$.i18n().load({\n en: {\n msg_activecode_load_history: \"Load History\",\n msg_activecode_audio_tour: \"Audio Tour\",\n msg_activecode_loaded_code: \"Loaded your saved code.\",\n msg_activecode_no_saved_code: \"No saved code.\",\n msg_activecode_run_code: \"Run\",\n msg_activecode_show_feedback: \"Show Feedback\",\n msg_activecode_show_code: \"Show Code\",\n msg_activecode_hide_code: \"Hide Code\",\n msg_activecode_show_codelens: \"Show CodeLens\",\n msg_activecode_show_in_codelens: \"Show in CodeLens\",\n msg_activecode_hide_codelens: \"Hide Codelens\",\n\n msg_activecode_parse_error:\n \"A parse error means that Python does not understand the syntax on the line the error message points out. Common examples are forgetting commas beteween arguments or forgetting a : on a for statement\",\n msg_activecode_parse_error_fix:\n \"To fix a parse error you just need to look carefully at the line with the error and possibly the line before it. Make sure it conforms to all of Python's rules.\",\n msg_activecode_type_error:\n \"Type errors most often occur when an expression tries to combine two objects with types that should not be combined. Like raising a string to a power\",\n msg_activecode_type_error_fix:\n \"To fix a type error you will most likely need to trace through your code and make sure the variables have the types you expect them to have. It may be helpful to print out each variable along the way to be sure its value is what you think it should be.\",\n msg_activecode_name_error:\n \"A name error almost always means that you have used a variable before it has a value. Often this may be a simple typo, so check the spelling carefully.\",\n msg_activecode_name_error_fix:\n \"Check the right hand side of assignment statements and your function calls, this is the most likely place for a NameError to be found.\",\n msg_activecode_value_error:\n \"A ValueError most often occurs when you pass a parameter to a function and the function is expecting one type and you pass another.\",\n msg_activecode_value_error_fix:\n \"The error message gives you a pretty good hint about the name of the function as well as the value that is incorrect. Look at the error message closely and then trace back to the variable containing the problematic value.\",\n msg_activecode_attribute_error:\n \"This error message is telling you that the object on the left hand side of the dot, does not have the attribute or method on the right hand side.\",\n msg_activecode_attribute_error_fix:\n \"The most common variant of this message is that the object undefined does not have attribute X. This tells you that the object on the left hand side of the dot is not what you think. Trace the variable back and print it out in various places until you discover where it becomes undefined. Otherwise check the attribute on the right hand side of the dot for a typo.\",\n msg_activecode_token_error:\n \"Most of the time this error indicates that you have forgotten a right parenthesis or have forgotten to close a pair of quotes.\",\n msg_activecode_token_error_fix:\n \"Check each line of your program and make sure that your parenthesis are balanced.\",\n msg_activecode_time_limit_error:\n \"Your program is running too long. Most programs in this book should run in less than 10 seconds easily. This probably indicates your program is in an infinite loop.\",\n msg_activecode_time_limit_error_fix:\n \"Add some print statements to figure out if your program is in an infinte loop. If it is not you can increase the run time with sys.setExecutionLimit(msecs)\",\n msg_activecode_general_error:\n \"Your program is running for too long. Most programs in this book should run in less than 30 seconds easily. This probably indicates your program is in an infinite loop.\",\n msg_activecode_general_error_fix:\n \"Add some print statements to figure out if your program is in an infinte loop. If it is not you can increase the run time with sys.setExecutionLimit(msecs)\",\n msg_activecode_syntax_error:\n \"This message indicates that Python can't figure out the syntax of a particular statement. Some examples are assigning to a literal, or a function call\",\n msg_activecode_syntax_error_fix:\n \"Check your assignment statements and make sure that the left hand side of the assignment is a variable, not a literal or a function.\",\n msg_activecode_key_error:\n \"This message indicates that you are trying to access an element of a dictionary, but the dictionary does not have that the key you are using.\",\n msg_activecode_key_error_fix:\n \"You may have a typo in the name of your key. It is also good practice to check if the key exists using a statement like if key in mydict. You can also use mydict.get(key,defaultvalue) so that if the key is not in the dictionary you get the default value instead of an error.\",\n msg_activecode_index_error:\n \"This message means that you are trying to index past the end of a string or a list. For example if your list has 3 things in it and you try to access the item at position 3 or more.\",\n msg_activecode_index_error_fix:\n \"Remember that the first item in a list or string is at index position 0, quite often this message comes about because you are off by one. Remember in a list of length 3 the last legal index is 2\",\n msg_activecode_uri_error: \"\",\n msg_activecode_uri_error_fix: \"\",\n msg_activecode_import_error:\n \"This error message indicates that you are trying to import a module that does not exist\",\n msg_activecode_import_error_fix:\n \"One problem may simply be that you have a typo. It may also be that you are trying to import a module that exists in 'real' Python, but does not exist in this book. If this is the case, please submit a feature request to have the module added.\",\n msg_activecode_reference_error:\n \"This is most likely an internal error, particularly if the message references the console.\",\n msg_activecode_reference_error_fix:\n \"Try refreshing the webpage, and if the error continues, submit a bug report along with your code\",\n msg_activecode_zero_division_error:\n \"This tells you that you are trying to divide by 0. Typically this is because the value of the variable in the denominator of a division expression has the value 0\",\n msg_activecode_zero_division_error_fix:\n \"You may need to protect against dividing by 0 with an if statment, or you may need to rexamine your assumptions about the legal values of variables, it could be an earlier statment that is unexpectedly assigning a value of zero to the variable in question.\",\n msg_activecode_range_error:\n \"This message almost always shows up in the form of Maximum call stack size exceeded.\",\n msg_activecode_range_error_fix:\n \"This always occurs when a function calls itself. Its pretty likely that you are not doing this on purpose. Except in the chapter on recursion. If you are in that chapter then its likely you haven't identified a good base case.\",\n msg_activecode_internal_error:\n \"An Internal error may mean that you've triggered a bug in our Python\",\n msg_activecode_internal_error_fix:\n \"Report this error, along with your code as a bug.\",\n msg_activecode_indentation_error:\n \"This error occurs when you have not indented your code properly. This is most likely to happen as part of an if, for, while or def statement.\",\n msg_activecode_indentation_error_fix:\n \"Check your if, def, for, and while statements to be sure the lines are properly indented beneath them. Another source of this error comes from copying and pasting code where you have accidentally left some bits of code lying around that don't belong there anymore.\",\n msg_activecode_not_implemented_error:\n \"This error occurs when you try to use a builtin function of Python that has not been implemented in this in-browser version of Python.\",\n msg_activecode_not_implemented_error_fix:\n \"For now the only way to fix this is to not use the function. There may be workarounds. If you really need this builtin function then file a bug report and tell us how you are trying to use the function.\",\n\n msg_activecode_file_not_found: \"File not found: '$1'\",\n msg_activecode_no_file_or_dir:\n \"[Errno 2] No such file or directory: '$1'\",\n msg_activecode_starting: \"Click the play button to begin the $1\",\n msg_activecode_playing: \"Playing the $1\",\n msg_activecode_loading_audio:\n \"Loading audio. Please wait. If the tour doesn't start soon click on the leftmost control button (Play first audio in tour)\",\n msg_activecode_pause_current_audio: \"Pause current audio\",\n msg_activecode_pause_audio: \"Pause audio\",\n msg_activecode_play_paused_audio: \"Play paused audio\",\n msg_activecode_audio_paused:\n \"The $1 has been paused. Click on the play button to resume the tour.\",\n msg_activecode_input_prg: \"Input for Program\",\n msg_activecode_were_compiling_err:\n \"There were errors compiling your code. See below.\",\n msg_activecode_time_limit_exc: \"Time Limit Exceeded on your program\",\n msg_activecode_server_err: \"A server error occurred: $1 $2\",\n msg_activecode_compiling_running:\n \"Compiling and Running your Code Now...\",\n msg_activecode_server_comm_err: \"Error communicating with the server.\",\n msg_activecode_save_run: \"Save & Run\",\n msg_activecode_render: \"Save & Render\",\n msg_activecode_assertion_error:\n \"An assertion error happens when python encounters an assertion statement. Python evaluates the expression to the right of the word assert; if that expression is True everything is fine and the program continues. If the expression is False Python raises an error and stops.\",\n msg_activecode_assertion_error_fix:\n \"Check the expression to the right of assert. The expression is False and you will need to determine why that is. You may want to simply print out the individual parts of the expression to understand why it is evaluating to False.\",\n msg_activecode_load_db: \"Loading DB...\",\n msg_activecode_code_coach: \"Code Coach\",\n },\n});\n","$.i18n().load({\n \"pt-br\": {\n msg_activecode_load_history: \"Carregar histórico\",\n msg_activecode_audio_tour: \"Tour de áudio\",\n msg_activecode_loaded_code: \"Código salvo carregado.\",\n msg_activecode_no_saved_code: \"Não há código salvo.\",\n msg_activecode_run_code: \"Executar\",\n msg_activecode_show_feedback: \"Exibir Feedbacks\",\n msg_activecode_show_code: \"Mostrar Código\",\n msg_activecode_hide_code: \"Ocultar Código\",\n msg_activecode_show_codelens: \"Mostrar CodeLens\",\n msg_activecode_show_in_codelens: \"Mostrar em CodeLens\",\n msg_activecode_hide_codelens: \"Ocultar Codelens\",\n\n msg_activecode_parse_error:\n \"Um erro de Parse significa que Python não entende a sintaxe da linha que a mensagem de erro aponta. Exemplos comuns são esquecer vírgulas entre argumentos ou esquecer ':' em um comando for.\",\n msg_activecode_parse_error_fix:\n \"Para corrigir um erro de Parse, você só precisa olhar cuidadosamente a linha com o erro e possivelmente a linha antes dela. Tenha certeza que estão de acordo com todas as regras de Python.\",\n msg_activecode_type_error:\n \"Erros de tipagem ocorrem mais frequentemente quando uma expressão tenta combinar dois objetos com tipos que não deveriam ser combinados. Como elevar uma String a uma potência.\",\n msg_activecode_type_error_fix:\n \"Para corrigir um erro de tipagem você provavelmente precisará percorrer seu código e ter certeza de que as variáveis possuem os tipos que você espera que elas tenham. Pode ser útil imprimir cada variável ao longo do caminho para checar se elas possuem o valor que você acha que deveriam ter.\",\n msg_activecode_name_error:\n \"Um erro de nome quase sempre significa que você usou uma variável antes dela ter um valor. Frequentemente isso pode ser um erro de digitação, então cheque a ortografia cuidadosamente.\",\n msg_activecode_name_error_fix:\n \"Cheque o lado direito das atribuições e suas chamadas de funções, são os lugares mais prováveis de encontrar um erro de nome.\",\n msg_activecode_value_error:\n \"Um erro de valor ocorre mais frequentemente quando uma função está esperando um tipo mas você passa um parâmetro de outro tipo.\",\n msg_activecode_value_error_fix:\n \"A mensagem de erro te dá uma boa dica sobre o nome da função e o valor incorreto. Leia atentamente a mensagem de erro e volte à variável que contém o valor problemático.\",\n msg_activecode_attribute_error:\n \"Essa mensagem de erro está te dizendo que o objeto do lado esquerdo do ponto não tem o atributo ou método do seu lado direito.\",\n msg_activecode_attribute_error_fix:\n \"A variante mais comum dessa mensagem é que o objeto indefinido não tem o atributo X. Isso diz que o objeto do lado esquerdo do ponto não é o que você pensa. Rastreie essa variável e imprima-a em vários lugares até descobrir onde ela se torna indefinida. Caso contrário, cheque se há erro de digitação no atributo do lado direito do ponto.\",\n msg_activecode_token_error:\n \"Na maioria das vezes este erro indica que você esqueceu de fechar um parênteses ou aspas.\",\n msg_activecode_token_error_fix:\n \"Cheque cada linha do seu programa e certifique-se de que todos os parênteses estão fechados.\",\n msg_activecode_time_limit_error:\n \"Seu programa está demorando muito. Os programas deste livro deveriam rodar em menos de 10 segundos. Isso provavelmente indica que seu programa está em um loop infinito.\",\n msg_activecode_time_limit_error_fix:\n \"Imprima mensagens em algumas linhas para descobrir se seu programa está em um loop infinito. Caso não esteja, você pode aumentar o tempo limite de execução com o comando sys.setExecutionLimit(ms)\",\n msg_activecode_general_error:\n \"Seu programa está demorando muito. Os programas deste livro deveriam rodar em menos de 30 segundos. Isso provavelmente indica que seu programa está em um loop infinito.\",\n msg_activecode_general_error_fix:\n \"Imprima mensagens em algumas linhas para descobrir se seu programa está em um loop infinito. Caso não esteja, você pode aumentar o tempo limite de execução com o comando sys.setExecutionLimit(ms)\",\n msg_activecode_syntax_error:\n \"Esta mensagem indica que Python não entendeu a sintaxe de um comando. Alguns exemplos são atribuição de um literal, ou uma chamada de função\",\n msg_activecode_syntax_error_fix:\n \"Cheque as atribuições de seu programa e certifique-se de que o lado esquerdo é uma variável, e não um literal ou função.\",\n msg_activecode_key_error:\n \"Esta mensagem indica que você está tentando acessar um elemento cuja chave não existe no dicionário.\",\n msg_activecode_key_error_fix:\n \"Você pode ter um erro de digitação no nome da sua chave. É uma boa prática checar se a chave existe usando um comando 'if (chave) in meu_dicionario'. Você também pode usar o comando 'meu_dicionario.get(chave, valorPadrão)' para obter o valor padrão ao invés de um erro caso a chave não exista.\",\n msg_activecode_index_error:\n \"Você está tentando acessar um índice além do final de uma string ou lista. Por exemplo, se sua lista possui 3 elementos nela e você tenta acessar o item na posição 3 ou mais.\",\n msg_activecode_index_error_fix:\n \"Lembre-se que o primeiro elemento de uma lista ou string está no índice 0, normalmente esta mensagem é exibida porque você errou o índice por 1. Em uma lista de tamanho 3, o último índice válido é 2\",\n msg_activecode_uri_error: \"\",\n msg_activecode_uri_error_fix: \"\",\n msg_activecode_import_error:\n \"Esta mensagem indica que você está tentando importar um módulo que não existe\",\n msg_activecode_import_error_fix:\n \"Um problema pode ser apenas um erro de digitação. Também pode ser que você está tentando importar um módulo que existe em Python 'real', mas não existe neste livro. Se este é o caso, por favor envie um pedido para ter esse módulo adicionado.\",\n msg_activecode_reference_error:\n \"Isso parece ser um erro interno, especialmente se a mensagem faz referência ao console.\",\n msg_activecode_reference_error_fix:\n \"Tente atualizar a página. Se o erro persistir, envie um relatório de bug junto com seu código\",\n msg_activecode_zero_division_error:\n \"Isso diz que você está tentando dividir por 0. Normalmente é porque o valor da variável no denominador de uma divisão tem o valor 0\",\n msg_activecode_zero_division_error_fix:\n \"Você pode proteger contra dividir por 0 com um comando 'if', ou você pode precisar reavaliar suas suposições sobre os valores das variáveis, pois um comando anterior pode ter inesperadamente atribuído o valor 0 a essa variável.\",\n msg_activecode_range_error:\n \"Esta mensagem quase sempre aparece na forma de 'Tamanho máximo da pilha de chamadas excedido'.\",\n msg_activecode_range_error_fix:\n \"Isso sempre ocorre quando uma função chama ela mesma. Provavelmente você não está fazendo isso de propósito, exceto no capítulo sobre recursão. Se você está nesse capítulo, então provavelmente ainda não identificou um bom caso base.\",\n msg_activecode_internal_error:\n \"Um erro interno pode significar que você desencadeou um bug no nosso Python\",\n msg_activecode_internal_error_fix:\n \"Reporte este erro como um bug, juntamente com seu código\",\n msg_activecode_indentation_error:\n \"Este erro ocorre quando você não indentou seu código devidamente. Isso é mais provável de ocorrer como parte de um comando if, for, while ou def.\",\n msg_activecode_indentation_error_fix:\n \"Cheque seus comandos if, def, for e while para ter certeza de que as linhas estão devidamente indentadas abaixo delas. Outra fonte deste erro é copiar e colar código em que você acidentalmente deixou restos de código que não pertencem mais ali.\",\n msg_activecode_not_implemented_error:\n \"Este erro ocorre quando você tenta usar uma função embutida de Python que não foi implementada nesta versão browser de Python.\",\n msg_activecode_not_implemented_error_fix:\n \"Por enquanto a única maneira de consertar isso é não usando a função. Podem haver soluções alternativas. Se você realmente precisa desta função embutida, envie-nos um relatório de bug e digac omo está tentando usar a função.\",\n\n msg_activecode_file_not_found: \"Arquivo não encontrado: '$1'\",\n msg_activecode_no_file_or_dir:\n \"[Erro nº 2] Arquivo ou diretório inexistente: '$1'\",\n msg_activecode_starting: \"Clique no botão de execução para começar $1\",\n msg_activecode_playing: \"Executando $1\",\n msg_activecode_loading_audio:\n \"Carregando áudio. Por favor, espere. Se o tour não começar logo, clique em 'Stop Tour' e tente novamente.\",\n msg_activecode_pause_current_audio: \"Pausar áudio atual\",\n msg_activecode_pause_audio: \"Pausar áudio\",\n msg_activecode_play_paused_audio: \"Reproduzir áudio pausado\",\n msg_activecode_audio_paused:\n \"$1 foi pausado. Clique no botão de execução para retomar o tour.\",\n msg_activecode_input_prg: \"Entrada para o programa\",\n msg_activecode_were_compiling_err:\n \"Houveram erros ao compilar seu código. Veja abaixo.\",\n msg_activecode_time_limit_exc: \"Limite de tempo excedido no seu programa\",\n msg_activecode_server_err: \"Um erro de servidor ocorreu: $1 $2\",\n msg_activecode_compiling_running:\n \"Compilando e executando seu código...\",\n msg_activecode_server_comm_err: \"Erro ao comunicar com o servidor.\",\n msg_activecode_save_run: \"Salvar & Executar\",\n msg_activecode_render: \"Salvar & Renderizar\",\n msg_activecode_assertion_error:\n \"Um erro de asserção ocorre quando python encontra um comando 'assert'. Python avalia a expressão do lado direito; se é verdadeira, o programa continua normalmente. Se é falsa, python gera um erro e para a execução.\" ,\n msg_activecode_assertion_error_fix:\n \"Cheque a expressão do lado direito de 'assert'. Essa expressão é falsa e é preciso verificar o motivo. Você pode querer imprimir cada parte da expressão e entender porque é falsa.\",\n msg_activecode_load_db: \"Carregando banco de dados...\",\n },\n});\n","$.i18n().load({\n \"sr-Cyrl\": {\n msg_activecode_load_history: \"Учитај историју\",\n msg_activecode_audio_tour: \"Аудио тура\",\n msg_activecode_loaded_code: \"Ваш изворни код је учитан.\",\n msg_activecode_no_saved_code: \"Не постоји снимљен код.\",\n msg_activecode_run_code: \"Покрени програм\",\n msg_activecode_show_feedback: \"Прикажи резултат\",\n msg_activecode_show_code: \"Прикажи код\",\n msg_activecode_hide_code: \"Затвори код\",\n msg_activecode_show_codelens: \"Корак по корак\",\n msg_activecode_show_in_codelens: \"Корак по корак\",\n msg_activecode_hide_codelens: \"Затвори корак по корак\",\n\n msg_sctivecode_parse_error:\n \"Синтаксна грешка (parse error) значи да Пајтон не разуме синтаксу у линији кога на коју порука о грешци указује. Типични примери овакве грешке су заборавлјена двотачка код 'if' или 'for' исказа или заборављена запета између аргумената код позива функције\",\n msg_sctivecode_parse_error_fix:\n \"Да бисте исправили синтаксну грешку треба пажњиво да погледате линију изворног кода на коју указује поруга о грешци и можда претходну линину изворног кода. Проверите да ли су поштована сва синтаксна правила Пајтона.\",\n },\n});\n","import RunestoneBase from \"../../common/js/runestonebase.js\";\n\n// function to display the audio tours\nexport default class AudioTour extends RunestoneBase {\n constructor(divid, code, bnum, audio_text) {\n // Bug Fix: If a class extends another class, this is undefined UNTIL super is called\n super();\n this.audio_tour = null;\n this.audio_code = null;\n this.windowcode = null;\n this.first_audio = null;\n this.prev_audio = null;\n this.pause_audio = null;\n this.next_audio = null;\n this.last_audio = null;\n this.status = null;\n this.stop_button = null;\n this.tourButtons = [];\n this.elem = null; // current audio element playing\n this.currIndex = null; // current index\n this.len = null; // current length of audio files for tour\n this.buttonCount = null; // number of audio tour buttons\n this.aname = null; // the audio file name\n this.ahash = null; // hash of the audio file name to the lines to highlight\n this.theDivid = null; // div id\n this.afile = null; // file name for audio\n this.playing = false; // flag to say if playing or not\n this.tourName = \"\";\n // Replacing has been done here to make sure special characters in the code are displayed correctly\n code = code.replaceAll(\"*doubleq*\", '\"');\n code = code.replaceAll(\"*singleq*\", \"'\");\n code = code.replaceAll(\"*open*\", \"(\");\n code = code.replaceAll(\"*close*\", \")\");\n code = code.replaceAll(\"*nline*\", \"
\");\n var codeArray = code.split(\"\\n\");\n var audio_hash = [];\n var bval = [];\n var atype = audio_text.replaceAll(\"* doubleq*\", '\"');\n var audio_type = atype.split(\"*atype*\");\n for (let i = 0; i < audio_type.length - 1; i++) {\ n audio_hash[i] = audio_type[i];\n var aword = audio_type[i].split(\";\");\n bval.push(aword[0]);\n }\n var first = \n\"

\"+\n\"1. \" +\n códigoArray[0] +\n \"
\";\n var num_lines = codeArray.length;\n for (let i = 1; i < num_lines; i++) {\n if (i < 9) {\n first =\n first +\n \"\"+\n (i+1) +\n\". \" +\n códigoArray[i] +\n \"
\";\n } else if (i < 99) {\n primero =\n primero +\n \"\"+\n (i+1) +\n\". \" +\n códigoArray[i] +\n \"
\";\n } else {\n primero =\n primero +\n \"\"+\n (i+1) +\n\". \" +\n códigoArray[i] +\n \"
\";\n }\n }\n primero = primero + \"

\";\n //disposición del contenido HTML\n var bcount = 0;\n for (var i = 0; i < audio_type.length - 1; i++) {\n var newButton = document.createElement(\" button\");\n newButton.className = \"btn btn-success\";\n newButton.innerHTML = bval[i].replace(/\\\"/g, \"\");\n esto .tourButtons.push(newButton);\n bcount++;\n }\n this.audio_tour = document.createElement(\"div\");\n this.audio_tour.align = \"center\";\n this. audio_code = document.createElement(\"p\");\n this.windowcode = document.createElement(\"div\");\n this.windowcode.align = \"left\";\n $(this. código de ventana).html(primero);\n this.first_audio = documento.createElement(\"botón\");\n this.prev_audio = documento.createElement(\"botón\");\n this.pause_audio = documento. createElement(\"botón\");\n this.next_audio = documento.createElement(\"button\");\n this.last_audio = documento.createElement(\"button\");\n this.first_audio.className =\n \"btn-default glyphicon glyphicon-fast-backward\";\n this.prev_audio.className =\n \"btn-default glyphicon glyphicon-step-backward\";\n this.pause_audio.className = \ "btn-default glyphicon glyphicon-pause\";\n this.next_audio.className =\n \"btn-default glyphicon glyphicon-step-forward\";\n this.last_audio.className =\n \"btn-default glyphicon glyphicon-fast-forward\";\n this.first_audio.setAttribute(\n \"style\",\n \"height: 22px; ancho: 25px; borde-radio: 4px; margin-right:2px;\"\n );\n this.prev_audio.setAttribute(\n \"style\",\n \"height: 22px; width: 25px; border-radius: 4px; margin-right: 2px;\"\n );\n this.pause_audio.setAttribute(\n \"style\",\n \"height: 22px; width: 25px; border-radius: 4px; margin-right:2px;\" \n);\n this.next_audio.setAttribute(\n \"estilo\",\n \"alto: 22px; ancho: 25px; border-radius: 4px; margin-right:2px;\"\n ); \n this.last_audio.setAttribute(\n \"style\",\n \"height: 22px; width: 25px; border-radius: 4px; margin-right:2px;\"\n );\n this. first_audio.name = \"first_audio\";\n this.prev_audio.name = \"prev_audio\";\n this.pause_audio.name = \"pause_audio\";\n this.next_audio.name = \"next_audio\ ";\n this.last_audio.name = \"last_audio\";\n this.first_audio.title = \"Reproducir el primer audio del recorrido\";\n this.prev_audio.title = \"Reproducir el audio anterior del recorrido\ ";\n this.pause_audio.title = \"Pausar el audio actual\";\n this.next_audio.title = \"Reproducir el siguiente audio en la gira\";\n this.last_audio.title = \"Reproducir el último audio en gira\";\n this.first_audio.setAttribute(\"aria-label\", \"Reproducir el primer audio de la gira\");\n this.prev_audio.setAttribute(\n \"aria-label\",\ n \"Reproducir audio anterior en gira\"\n );\n this.pause_audio.setAttribute(\"aria-label\", \"Pause audio\");\n this.next_audio.setAttribute(\"aria- label\", \"Reproducir el siguiente audio del recorrido\");\n this.last_audio.setAttribute(\"aria-label\", \"Reproducir el último audio del recorrido\");\n this.first_audio.disabled = true;\n this.prev_audio.disabled = true;\n this.pause_audio.disabled = true;\n this.next_audio.disabled = true;\n this.last_audio.disabled = true;\n this.status = documento. createElement(\"div\");\n this.status.className = \"alert alert-info\";\n this.status.setAttribute(\"style\", \"display: none;\"); \n this.stop_button = document.createElement(\"button\");\n this.stop_button.className = \"btn btn-default\";\n this.stop_button.innerHTML = \"Detener recorrido\";\ n $(this.audio_tour).append(\n this.audio_code,\n this.windowcode,\n document.createElement(\"br\"),\n this.first_audio,\n this.prev_audio,\n this .pause_audio,\n this.next_audio,\n this.last_audio,\n document.createElement(\"br\"),\n this.status,\n document.createElement(\"br\"),\n this .tourButtons,\n this.stop_button\n );\n $(\"#\" + dividir + \" .ac_code_div\").append(this.audio_tour);\n $(\"#\" + dividir + \" .ac_code_div\").css(\"ancho\", \"100%\");\n $(\"#\" + divide + \" .CodeMirror.cm-s-default.ui- redimensionable\").hide();\n $(\"#\" + divide + \" .ac_opt.btn.btn-default:last-child\").hide();\n $(this.stop_button ).click(\n function () {\n if (this.playing) {\n this.elem.pause();\n }\n //log change to db\n this.logBookEvent({\n evento : \"Audio\",\n acto: \"cerrarVentana\",\n div_id: dividir,\n });\n $(this.audio_tour).remove();\n $(\n \"# \" + dividir + \" .CodeMirror.cm-s-default.ui-redimensionable\"\n ).show();\n $(\"#\" + dividir + \" .ac_opt.btn.btn- predeterminado:último hijo\").show();\n $(\"#\" + dividir + \" .ac_code_div\").css(\"ancho\", \"\");\n } .bind(this)\n );\n $(this.tourButtons[0]).click(\n function () {\n this.tour(divid, audio_hash[0], bcount);\n }.bind (este)\n);\n $(this.tourButtons[1]).click(\n function () {\n this.tour(divid, audio_hash[1], bcount);\n }.bind(this )\n);\n $(this.tourButtons[2]).click(\n function () {\n this.tour(divid, audio_hash[2], bcount);\n }.bind(this)\ n );\n $(this.tourButtons[3]).click(\n function () {\n this.tour(divid, audio_hash[3], bcount);\n }.bind(this)\n ) ;\n $(this.tourButtons[4]).click(\n function () {\n this.tour(divid, audio_hash[4], bcount);\n }.bind(this)\n );\ n // manejar el clic para ir al siguiente audio\n $(this.first_audio).click(\n function () {\n this.firstAudio();\n }.bind(this)\n );\ n // manejar el clic para ir al siguiente audio\n $(this.prev_audio).click(\n function () {\n this.prevAudio();\n }.bind(this)\n );\ n // manejar el clic para pausar o reproducir el audio\n $(this.pause_audio).click(\n function () {\n this.pauseAndPlayAudio(divid);\n }.bind(this)\n ); \n // manejar el clic para ir al siguiente audio\n $(this.next_audio).click(\n function () {\n this.nextAudio();\n }.bind(this)\n ); \n // manejar el clic para ir al siguiente audio\n $(this.last_audio).click(\n function () {\n this.lastAudio();\n }.bind(this)\n ); \n // hacer que los botones de imagen se vean desactivados\n $(this.first_audio).css(\"opacity\", 0.25);\n $(this.prev_audio).css(\"opacity\", 0.25); \n $(this.pause_audio).css(\"opacity\", 0.25);\n $(this.next_audio).css(\"opacity\", 0.25);\n $(this.last_audio).css (\"opacidad\", 0.25);\n }\n tour(divid, audio_type, bcount) {\n // establecer globales\n this.buttonCount = bcount;\n this.theDivid = dividir;\n this. status.setAttribute(\n \"estilo\",\n \"display: inline-block; margen superior: 7px; margin-bottom: 3px;\"\n );\n // habilitar los botones anterior, pausa/reproducir y siguiente y hacer visible\n $(this.first_audio).removeAttr(\"disabled\");\n $( this.prev_audio).removeAttr(\"disabled\");\n $(this.pause_audio).removeAttr(\"disabled\");\n $(this.next_audio).removeAttr(\"disabled\"); \n $(this.last_audio).removeAttr(\"disabled\");\n $(this.first_audio).css(\"opacity\", 1.0);\n $(this.prev_audio).css(\ "opacidad\", 1.0);\n $(este.pausar_audio).css(\"opacidad\", 1.0);\n $(este.próximo_audio).css(\"opacidad\", 1.0);\n $(this.last_audio).css(\"opacity\", 1.0);\n // deshabilita los botones de recorrido\n para (var i = 0; i < bcount; i++)\n $(this.tourButtons[i] ).attr(\"deshabilitado\", \"deshabilitado\");\n var atype = audio_type.split(\";\");\n var name = atype[0].replaceAll('\"', \" \");\n this.tourName = nombre;\n $(this.status).html($.i18n(\"msg_activecode_starting\", name));\n //registrar el tipo de recorrido en db\n this.logBookEvent({ evento: \"Audio\", acto: nombre, div_id: dividir });\n var max = atype.length;\n var str = \"\";\n this.ahash = [] ;\n este.aname = [];\n for (i = 1; i < máx - 1; i++) {\n var temp = atype[i].split(\":\");\n var temp_line = temp[0];\n var temp_aname = temp[1];\n var akey = temp_aname.substring (1, temp_aname.length);\n var lnums = temp_line.substring(1, temp_line.length);\n //alert(\"akey:\"+akey+\"lnum:\"+lnums);\n // cadena+=\"

\";\n //var dir =\n // \"http://media.interactivepython.org/\" +\n // eBookConfig.basecourse.toLowerCase() +\n // \"/audio/ \";\n var dir = \"../_static/audio/\"\n str += \"

\";\n this.ahash[akey] = lnums;\n this.aname.push(akey);\n }\n $(this.audio_code).html(str);\n this.len = this.aname.length; // set the number of audio file in the tour\n this.currIndex = 0;\n this.playCurrIndexAudio();\n }\n handlePlaying() {\n this.elem.pause();\n // unbind current ended\n $(\"#\" + this.afile).unbind(\"ended\");\n // unhighlight the prev lines\n this.unhighlightLines(\n this.theDivid,\n this.ahash[this.aname[this.currIndex]]\n );\n }\n firstAudio() {\n // if audio is this.playing handle it\n this.handlePlaying();\n //log change to db\n this.logBookEvent({\n event: \"Audio\",\n act: \"first\",\n div_id: this.theDivid,\n });\n // move to the first audio\n this.currIndex = 0;\n // start at the first audio\n this.playCurrIndexAudio();\n }\n prevAudio() {\n // if there is a previous audio\n if (this.currIndex > 0) {\n // if audio is this.playing handle it\n this.handlePlaying();\n //log change to db\n this.logBookEvent({\n event: \"Audio\",\n act: \"prev\",\n div_id: this.theDivid,\n });\n // move to previous to the current (but the current index has moved to the next)\n this.currIndex = this.currIndex - 1;\n // start at the prev audio\n this.playCurrIndexAudio();\n }\n }\n nextAudio() {\n // if audio is this.playing handle it\n this.handlePlaying();\n //log change to db\n this.logBookEvent({\n event: \"Audio\",\n act: \"next\",\n div_id: this.theDivid,\n });\n // if not at the end\n if (this.currIndex < this.len - 1) {\n // start at the next audio\n this.currIndex = this.currIndex + 1;\n this.playCurrIndexAudio();\n } else if (this.currIndex == this.len - 1) {\n this.handleTourEnd();\n }\n }\n lastAudio() {\n // if audio is this.playing handle it\n this.handlePlaying();\n //log change to db\n this.logBookEvent({\n event: \"Audio\",\n act: \"last\",\n div_id: this.theDivid,\n });\n // move to the last audio\n this.currIndex = this.len - 1;\n // start at last\n this.playCurrIndexAudio();\n }\n // play the audio at the current index\n playCurrIndexAudio() {\n // set this.playing to false\n this.playing = false;\n // play the current audio and highlight the lines\n this.playaudio(this.currIndex, this.aname, this.theDivid, this.ahash);\n }\n // handle the end of the tour\n handleTourEnd() {\n $(this.status).html(\"The \" + this.tourName + \" has ended.\");\n this.pause_audio.className = \"btn-default glyphicon glyphicon-pause\";\n this.pause_audio.title = \"Pause audio\";\n this.pause_audio.setAttribute(\"aria-label\", \"Pause audio\");\n $(this.first_audio).attr(\"disabled\", \"disabled\");\n $(this.prev_audio).attr(\"disabled\", \"disabled\");\n $(this.pause_audio).attr(\"disabled\", \"disabled\");\n $(this.next_audio).attr(\"disabled\", \"disabled\");\n $(this.last_audio).attr(\"disabled\", \"disabled\");\n $(this.first_audio).css(\"opacity\", 0.25);\n $(this.prev_audio).css(\"opacity\", 0.25);\n $(this.pause_audio).css(\"opacity\", 0.25);\n $(this.next_audio).css(\"opacity\", 0.25);\n $(this.last_audio).css(\"opacity\", 0.25);\n // enable the tour buttons\n for (var j = 0; j < this.buttonCount; j++)\n $(this.tourButtons[j]).removeAttr(\"disabled\");\n }\n // only call this one after the first time\n outerAudio() {\n // unbind ended\n $(\"#\" + this.afile).unbind(\"ended\");\n // set this.playing to false\n this.playing = false;\n // unhighlight previous lines from the last audio\n this.unhighlightLines(\n this.theDivid,\n this.ahash[this.aname[this.currIndex]]\n );\n // increment the this.currIndex to point to the next one\n this.currIndex++;\n // if the end of the tour reset the buttons\n if (this.currIndex == this.len) {\n this.handleTourEnd();\n }\n // else not done yet so play the next audio\n else {\n // play the audio at the current index\n this.playCurrIndexAudio();\n }\n }\n // play the audio now that it is ready\n playWhenReady(afile, divid, ahash) {\n // unbind current\n $(\"#\" + afile).unbind(\"canplaythrough\");\n this.elem.currentTime = 0;\n this.playing = true;\n //console.log(\"in playWhenReady \" + elem.duration);\n this.highlightLines(divid, ahash[afile]);\n if (\n this.pause_audio.className ===\n \"btn-default glyphicon glyphicon-pause\"\n ) {\n $(this.status).html(\n $.i18n(\"msg_activecode_playing\", this.tourName)\n );\n $(\"#\" + afile).bind(\n \"ended\",\n function () {\n this.outerAudio();\n }.bind(this)\n );\n this.elem.play();\n } else {\n $(\"#\" + afile).bind(\n \"ended\",\n function () {\n this.outerAudio();\n }.bind(this)\n );\n }\n }\n // play the audio at the specified index i and set the duration and highlight the lines\n playaudio(i, aname, divid, ahash) {\n this.afile = aname[i];\n this.elem = document.getElementById(this.afile);\n // if this isn't ready to play yet - no duration yet then wait\n //console.log(\"in playaudio \" + elem.duration);\n if (isNaN(this.elem.duration) || this.elem.duration == 0) {\n // set the status\n $(this.status).html($.i18n(\"msg_activecode_loading_audio\"));\n $(\"#\" + this.afile).bind(\n \"canplaythrough\",\n function () {\n this.playWhenReady(this.afile, divid, ahash);\n }.bind(this)\n );\n }\n // otherwise it is ready so play it\n else {\n this.playWhenReady(this.afile, divid, ahash);\n }\n }\n // pause if this.playing and play if paused\n pauseAndPlayAudio(divid) {\n var btn = this.pause_audio;\n // if paused and clicked then continue from current\n if (this.elem.paused) {\n // calcualte the time left to play in milliseconds\n let counter = (this.elem.duration - this.elem.currentTime) * 1000;\n this.elem.play(); // start the audio from current spot\n this.pause_audio.className =\n \"btn-default glyphicon glyphicon-pause\";\n this.pause_audio.title = $.i18n(\n \"msg_activecode_pause_current_audio\"\n );\n this.pause_audio.setAttribute(\n \"aria-label\",\n $.i18n(\"msg_activecode_pause_audio\")\n );\n $(this.status).html(\n $.i18n(\"msg_activecode_playing\", this.tourName)\n );\n //log change to db\n this.logBookEvent({\n event: \"Audio\",\n act: \"play\",\n div_id: this.theDivid,\n });\n }\n // if audio was this.playing pause it\n else if (this.playing) {\n this.elem.pause(); // pause the audio\n this.pause_audio.className = \"btn-default glyphicon glyphicon-play\";\n this.pause_audio.title = $.i18n(\"msg_activecode_play_paused_audio\");\n this.pause_audio.setAttribute(\n \"aria-label\",\n $.i18n(\"msg_activecode_play_paused_audio\")\n );\n $(this.status).html(\n $.i18n(\"msg_activecode_audio_paused\", this.tourName)\n );\n //log change to db\n this.logBookEvent({\n event: \"Audio\",\n act: \"pause\",\n div_id: this.theDivid,\n });\n }\n }\n // process the lines\n processLines(divid, lnum, color) {\n var comma = lnum.split(\",\");\n if (comma.length > 1) {\n for (let i = 0; i < comma.length; i++) {\n this.setBackgroundForLines(divid, comma[i], color);\n }\n } else {\n this.setBackgroundForLines(divid, lnum, color);\n }\n }\n // unhighlight the lines - set the background back to transparent\n unhighlightLines(divid, lnum) {\n this.processLines(divid, lnum, \"transparent\");\n }\n // highlight the lines - set the background to a yellow color\n highlightLines(divid, lnum) {\n this.processLines(divid, lnum, \"#ffff99\");\n }\n // set the background to the passed color\n setBackgroundForLines(divid, lnum, color) {\n var hyphen = lnum.split(\"-\");\n var str;\n // if a range of lines\n if (hyphen.length > 1) {\n var start = parseInt(hyphen[0]);\n var end = parseInt(hyphen[1]) + 1;\n for (var k = start; k < end; k++) {\n //alert(k);\n str = \"#\" + divid + \"_l\" + k;\n if ($(str).text() != \"\") {\n $(str).css(\"background-color\", color);\n }\n //$(str).effect(\"highlight\",{},(dur*1000)+4500);\n }\n } else {\n //alert(lnum);\n str = \"#\" + divid + \"_l\" + lnum;\n $(str).css(\"background-color\", color);\n //$(str).effect(\"highlight\",{},(dur*1000)+4500);\n }\n }\n}\n","$.i18n().load({\n en: {\n msd_pyflakes_coach_line: \"Line\",\n },\n});\n\nexport default class PyflakesCoach {\n async check(code) {\n let promise = new Promise(function (resolve, reject) {\n fetch('/ns/coach/python_check', {\n method: 'POST',\n body: code\n })\n .then((response) => {\n return response.json();\n })\n .then((data) => {\n if(data.trim() !== '') {\n let message = \"\";\n //clean up returned text\n let errorLines = data.split(\"\\n\");\n let codeLines = code.split(\"\\n\");\n for(let line of errorLines) {\n if(line.indexOf(\".py:\") != -1) {\n //old pyflakes returns \"file:line:col error\"\n //new pyflakes returns \"file:line:col: error\"\n //handle either\n const cleaner = /[^.]*.py:(\\d+):(\\d+):? (.*)/i;\n let lineParts = line.match(cleaner); //[1]: line, [2]: col, [3]: error\n \n //for now, filter messages about star imports\n if(!lineParts[3].includes(\"defined from star imports\") \n && !lineParts[3].includes(\"*' used; unable to detect undefined names\"))\n {\n message += $.i18n(\"msd_pyflakes_coach_line\") + lineParts[1] + \": \" + lineParts[3] + \"\\n\";\n message += codeLines[lineParts[1] - 1] + \"\\n\";\n message += \" \".repeat(lineParts[2] - 1) + \"^\\n\";\n }\n } else {\n message += line + \"\\n\";\n }\n }\n message = message.slice(0,-1); //remove trailing newline\n resolve(message);\n }\n resolve(null);\n })\n .catch(err => {\n reject(\"Error in Pyflakes Coach: \" + err);\n })\n });\n return promise;\n }\n}\n\n","/**\n *\n * Created by bmiller on 3/19/15.\n */\n/* Define global variables for ESLint */\n/* global Sk */\n\n\"use strict\";\n\nimport RunestoneBase from \"../../common/js/runestonebase.js\";\nimport AudioTour from \"./audiotour.js\";\nimport \"./activecode-i18n.en.js\";\nimport \"./activecode-i18n.pt-br.js\";\nimport \"./activecode-i18n.sr-Cyrl.js\";\nimport CodeMirror from \"codemirror\";\nimport \"codemirror/mode/python/python.js\";\nimport \"codemirror/mode/css/css.js\";\nimport \"codemirror/mode/htmlmixed/htmlmixed.js\";\nimport \"codemirror/mode/xml/xml.js\";\nimport \"codemirror/mode/javascript/javascript.js\";\nimport \"codemirror/mode/sql/sql.js\";\nimport \"codemirror/mode/clike/clike.js\";\nimport \"codemirror/mode/octave/octave.js\";\nimport \"./../css/activecode.css\";\nimport \"codemirror/lib/codemirror.css\";\nimport \"codemirror/addon/hint/show-hint.js\";\nimport \"codemirror/addon/hint/show-hint.css\";\nimport \"codemirror/addon/hint/sql-hint.js\";\nimport \"codemirror/addon/hint/anyword-hint.js\";\nimport \"codemirror/addon/edit/matchbrackets.js\";\nimport \"./skulpt.min.js\";\nimport \"./skulpt-stdlib.js\";\nimport PyflakesCoach from \"./coach-python-pyflakes.js\";\n// Used by Skulpt.\nimport embed from \"vega-embed\";\n// Adapt for use outside webpack -- see https://github.com/vega/vega-embed.\nwindow.vegaEmbed = embed;\n\nvar isMouseDown = false;\nvar stopExecution = false;\n\ndocument.onmousedown = function () {\n isMouseDown = true;\n};\n\ndocument.onmouseup = function () {\n isMouseDown = false;\n};\nwindow.componentMap = {};\n\nvar socket, connection, doc;\nvar chatcodesServer = \"chat.codes\";\n\nCodeMirror.commands.autocomplete = function (cm) {\n cm.showHint({ hint: CodeMirror.hint.anyword });\n};\n\n// separate into constructor and init\nexport class ActiveCode extends RunestoneBase {\n constructor(opts) {\n super(opts);\n var suffStart;\n var orig = $(opts.orig).find(\"textarea\")[0];\n this.containerDiv = opts.orig;\n this.useRunestoneServices = opts.useRunestoneServices;\n this.python3 = true;\n this.origElem = orig;\n this.origText = this.origElem.textContent;\n this.codeCoachList = []; //list of CodeCoaches that will be used to provide feedback\n this.divid = opts.orig.id;\n this.code = $(orig).text() || \"\\n\\n\\n\\n\\n\";\n this.language = $(orig).data(\"lang\");\n this.timelimit = $(orig).data(\"timelimit\");\n this.includes = $(orig).data(\"include\");\n this.hidecode = $(orig).data(\"hidecode\");\n this.chatcodes = $(orig).data(\"chatcodes\");\n this.hidehistory = $(orig).data(\"hidehistory\");\n this.question = $(opts.orig).find(`#${this.divid}_question`)[0];\n this.tie = $(orig).data(\"tie\");\n this.dburl = $(orig).data(\"dburl\");\n this.runButton = null;\n this.enabledownload = $(orig).data(\"enabledownload\");\n this.downloadButton = null;\n this.saveButton = null;\n this.loadButton = null;\n this.outerDiv = null;\n this.partner = \"\";\n this.runCount = 0;\n this.logResults = true;\n if (!eBookConfig.allow_pairs || $(orig).data(\"nopair\")) {\n this.enablePartner = false;\n } else {\n this.enablePartner = true;\n }\n this.output = null; // create pre for output\n this.graphics = null; // create div for turtle graphics\n this.codecoach = null; // div for Code Coaches\n this.codelens = null;\n this.controlDiv = null;\n this.historyScrubber = null;\n this.timestamps = [\"Original\"];\n this.autorun = $(orig).data(\"autorun\");\n this.outputLineCount = 0;\n if (this.chatcodes && eBookConfig.enable_chatcodes) {\n if (!socket) {\n socket = new WebSocket(\"wss://\" + chatcodesServer);\n }\n if (!connection) {\n connection = new window.sharedb.Connection(socket);\n }\n if (!doc) {\n doc = connection.get(\"chatcodes\", \"channels\");\n }\n }\n if (this.graderactive || this.isTimed) {\n this.hidecode = false;\n }\n if (this.includes) {\n this.includes = this.includes.split(/\\s+/);\n }\n let prefixEnd = this.code.indexOf(\"^^^^\");\n if (prefixEnd > -1) {\n this.prefix = this.code.substring(0, prefixEnd);\n this.code = this.code.substring(prefixEnd + 5);\n }\n suffStart = this.code.indexOf(\"====\");\n if (suffStart > -1) {\n // The +5 gets past the ====\\n\n this.suffix = this.code.substring(suffStart + 5);\n this.code = this.code.substring(0, suffStart);\n }\n this.history = [this.code];\n this.createEditor();\n this.createOutput();\n this.createControls();\n if ($(orig).data(\"caption\")) {\n this.caption = $(orig).data(\"caption\");\n } else {\n this.caption = \"ActiveCode\";\n }\n this.addCaption(\"runestone\");\n\n //Setup CodeCoaches - add based on language\n if (this.language == \"python\" || this.language == \"python3\") {\n this.codeCoachList.push(new PyflakesCoach());\n }\n\n setTimeout(\n function () {\n this.editor.refresh();\n }.bind(this),\n 1000\n );\n if (this.autorun) {\n // Simulate pressing the run button, since this will also prevent the user from clicking it until the initial run is complete, and also help the user understand why they're waiting.\n $(this.runButtonHandler.bind(this));\n }\n this.indicate_component_ready();\n if (typeof Prism !== \"undefined\") {\n Prism.highlightAllUnder(this.containerDiv);\n }\n }\n\n createEditor(index) {\n this.outerDiv = document.createElement(\"div\");\n var linkdiv = document.createElement(\"div\");\n linkdiv.id = this.divid.replace(/_/g, \"-\").toLowerCase(); // :ref: changes _ to - so add this as a target\n var codeDiv = document.createElement(\"div\");\n $(codeDiv).addClass(\"ac_code_div\");\n this.codeDiv = codeDiv;\n this.outerDiv.lang = this.language;\n $(this.origElem).replaceWith(this.outerDiv);\n if (linkdiv.id !== this.divid) {\n // Don't want the 'extra' target if they match.\n this.outerDiv.appendChild(linkdiv);\n }\n this.outerDiv.appendChild(codeDiv);\n var edmode = this.outerDiv.lang;\n if (edmode === \"sql\") {\n edmode = \"text/x-sql\";\n } else if (edmode === \"java\") {\n edmode = \"text/x-java\";\n } else if (edmode === \"cpp\") {\n edmode = \"text/x-c++src\";\n } else if (edmode === \"c\") {\n edmode = \"text/x-csrc\";\n } else if (edmode === \"python3\") {\n edmode = \"python\";\n } else if (edmode === \"octave\" || edmode === \"MATLAB\") {\n edmode = \"text/x-octave\";\n }\n var editor = CodeMirror(codeDiv, {\n value: this.code,\n lineNumbers: true,\n mode: edmode,\n indentUnit: 4,\n matchBrackets: true,\n autoMatchParens: true,\n extraKeys: {\n Tab: \"indentMore\",\n \"Shift-Tab\": \"indentLess\",\n \"Ctrl-Space\": \"autocomplete\",\n },\n });\n // Make the editor resizable\n $(editor.getWrapperElement()).resizable({\n resize: function () {\n editor.setSize($(this).width(), $(this).height());\n editor.refresh();\n },\n });\n // give the user a visual cue that they have changed but not saved\n editor.on(\n \"change\",\n function (ev) {\n if (\n editor.acEditEvent == false ||\n editor.acEditEvent === undefined\n ) {\n // change events can come before any real changes for various reasons, some unknown\n // this avoids unneccsary log events and updates to the activity counter\n // offsetParent === null means that the element is not on the screen and so can't change\n // this.controlDiv.offsetParent\n if (\n this.origText === editor.getValue() ||\n this.addingScrubber\n ) {\n console.log(\"Fake change event, skipping the log\");\n return;\n }\n $(editor.getWrapperElement()).css(\n \"border-top\",\n \"2px solid #b43232\"\n );\n $(editor.getWrapperElement()).css(\n \"border-bottom\",\n \"2px solid #b43232\"\n );\n this.isAnswered = true;\n // the first time the student types in the write-code box\n this.logBookEvent({\n event: \"activecode\",\n act: \"edit\",\n div_id: this.divid,\n });\n }\n editor.acEditEvent = true;\n }.bind(this)\n ); // use bind to preserve *this* inside the on handler.\n //Solving Keyboard Trap of ActiveCode: If user use tab for navigation outside of ActiveCode, then change tab behavior in ActiveCode to enable tab user to tab out of the textarea\n $(window).keydown(function (e) {\n var code = e.keyCode ? e.keyCode : e.which;\n if (code == 9 && $(\"textarea:focus\").length === 0) {\n editor.setOption(\"extraKeys\", {\n Tab: function (cm) {\n $(document.activeElement)\n .closest(\".tab-content\")\n .nextSibling.focus();\n },\n \"Shift-Tab\": function (cm) {\n $(document.activeElement)\n .closest(\".tab-content\")\n .previousSibling.focus();\n },\n });\n }\n });\n this.editor = editor;\n if (this.hidecode) {\n $(this.codeDiv).css(\"display\", \"none\");\n }\n }\n\n async runButtonHandler() {\n // Disable the run button until the run is finished.\n this.runButton.disabled = true;\n try {\n await this.runProg();\n } catch (e) {\n console.log(`there was an error ${e} running the code`);\n }\n if (this.logResults) {\n this.logCurrentAnswer();\n }\n this.runCoaches();\n this.renderFeedback();\n // The run is finished; re-enable the button.\n this.runButton.disabled = false;\n this.runCount += 1;\n this.toggleAlert();\n }\n\n createControls() {\n var ctrlDiv = document.createElement(\"div\");\n var butt;\n $(ctrlDiv).addClass(\"ac_actions\");\n // Run\n butt = document.createElement(\"button\");\n $(butt).text($.i18n(\"msg_activecode_run_code\"));\n $(butt).addClass(\"btn btn-success run-button\");\n ctrlDiv.appendChild(butt);\n this.runButton = butt;\n // console.log(\"adding click function for run\");\n this.runButton.onclick = this.runButtonHandler.bind(this);\n $(butt).attr(\"type\", \"button\");\n\n if (this.enabledownload || eBookConfig.downloadsEnabled) {\n this.addDownloadButton(ctrlDiv);\n }\n if (!this.hidecode && !this.hidehistory) {\n this.addHistoryScrubber(true);\n }\n if ($(this.origElem).data(\"gradebutton\") && !this.graderactive) {\n this.addFeedbackButton(ctrlDiv);\n }\n // Show/Hide Code\n if (this.hidecode) {\n this.enableHideShow(ctrlDiv);\n }\n // CodeLens\n if ($(this.origElem).data(\"codelens\") && !this.graderactive) {\n this.enableCodeLens(ctrlDiv);\n }\n // Audio Tour\n if ($(this.origElem).data(\"audio\")) {\n this.enableAudioTours(ctrlDiv);\n }\n if (eBookConfig.isInstructor) {\n this.enableInstructorSharing(ctrlDiv);\n }\n if (this.enablePartner) {\n this.setupPartner(ctrlDiv);\n }\n if (this.chatcodes && eBookConfig.enable_chatcodes) {\n this.enableChatCodes(ctrlDiv);\n }\n\n $(this.outerDiv).prepend(ctrlDiv);\n if (this.question) {\n if ($(this.question).html().match(/^\\s+$/)) {\n $(this.question).remove();\n } else {\n $(this.outerDiv).prepend(this.question);\n }\n }\n this.controlDiv = ctrlDiv;\n }\n\n addFeedbackButton(ctrlDiv) {\n let butt = document.createElement(\"button\");\n $(butt).addClass(\"ac_opt btn btn-default\");\n $(butt).text($.i18n(\"msg_activecode_show_feedback\"));\n $(butt).css(\"margin-left\", \"10px\");\n $(butt).attr(\"type\", \"button\");\n this.gradeButton = butt;\n ctrlDiv.appendChild(butt);\n $(butt).click(this.createGradeSummary.bind(this));\n }\n\n addDownloadButton(ctrlDiv) {\n let butt = document.createElement(\"button\");\n $(butt).text(\"Download\");\n $(butt).addClass(\"btn save-button\");\n ctrlDiv.appendChild(butt);\n this.downloadButton = butt;\n $(butt).click(this.downloadFile.bind(this, this.language));\n $(butt).attr(\"type\", \"button\");\n }\n\n enableHideShow(ctrlDiv) {\n $(this.runButton).attr(\"disabled\", \"disabled\");\n let butt = document.createElement(\"button\");\n $(butt).addClass(\"ac_opt btn btn-default\");\n $(butt).text($.i18n(\"msg_activecode_show_code\"));\n $(butt).css(\"margin-left\", \"10px\");\n $(butt).attr(\"type\", \"button\");\n this.showHideButt = butt;\n ctrlDiv.appendChild(butt);\n $(butt).click(\n function () {\n $(this.codeDiv).toggle();\n if (this.historyScrubber == null) {\n this.addHistoryScrubber(true);\n } else {\n $(this.historyScrubber.parentElement).toggle();\n }\n if (\n $(this.showHideButt).text() ==\n $.i18n(\"msg_activecode_show_code\")\n ) {\n $(this.showHideButt).text(\n $.i18n(\"msg_activecode_hide_code\")\n );\n } else {\n $(this.showHideButt).text(\n $.i18n(\"msg_activecode_show_code\")\n );\n }\n if ($(this.runButton).attr(\"disabled\")) {\n $(this.runButton).removeAttr(\"disabled\");\n } else {\n $(this.runButton).attr(\"disabled\", \"disabled\");\n }\n }.bind(this)\n );\n }\n\n enableCodeLens(ctrlDiv) {\n let butt = document.createElement(\"button\");\n $(butt).addClass(\"ac_opt btn btn-default\");\n $(butt).text($.i18n(\"msg_activecode_show_codelens\"));\n $(butt).css(\"margin-left\", \"10px\");\n this.clButton = butt;\n ctrlDiv.appendChild(butt);\n $(butt).click(this.showCodelens.bind(this));\n }\n\n enableAudioTours(ctrlDiv) {\n let butt = document.createElement(\"button\");\n $(butt).addClass(\"ac_opt btn btn-default\");\n $(butt).text($.i18n(\"msg_activecode_audio_tour\"));\n $(butt).css(\"margin-left\", \"10px\");\n this.atButton = butt;\n ctrlDiv.appendChild(butt);\n $(butt).click(\n function () {\n new AudioTour(\n this.divid,\n this.code,\n 1,\n $(this.origElem).data(\"audio\")\n );\n }.bind(this)\n );\n }\n\n enableInstructorSharing(ctrlDiv) {\n let butt = document.createElement(\"button\");\n $(butt).addClass(\"btn btn-info\");\n $(butt).text(\"Share Code\");\n $(butt).css(\"margin-left\", \"10px\");\n this.shareButt = butt;\n ctrlDiv.appendChild(butt);\n $(butt).click(\n async function () {\n if (\n !confirm(\n \"You are about to share this code with ALL of your students. Are you sure you want to continue?\"\n )\n ) {\n return;\n }\n let data = {\n divid: this.divid,\n code: this.editor.getValue(),\n lang: this.language,\n };\n let request = new Request(\n eBookConfig.ajaxURL + \"broadcast_code.json\",\n {\n method: \"POST\",\n headers: this.jsonHeaders,\n body: JSON.stringify(data),\n }\n );\n let post_promise = await fetch(request);\n let status = await post_promise.json();\n if (status.mess === \"success\") {\n alert(`Shared Code with ${status.share_count} students`);\n } else {\n alert(\"Sharing Failed\");\n }\n }.bind(this)\n );\n }\n\n setupPartner(ctrlDiv) {\n var checkPartner = document.createElement(\"input\");\n checkPartner.type = \"checkbox\";\n checkPartner.id = `${this.divid}_part`;\n ctrlDiv.appendChild(checkPartner);\n var plabel = document.createElement(\"label\");\n plabel.for = `${this.divid}_part`;\n $(plabel).text(\"Pair?\");\n ctrlDiv.appendChild(plabel);\n $(checkPartner).click(\n function () {\n if (this.partner) {\n this.partner = false;\n $(partnerTextBox).hide();\n this.partner = \"\";\n partnerTextBox.value = \"\";\n $(plabel).text(\"Pair?\");\n } else {\n let didAgree = localStorage.getItem(\"partnerAgree\");\n if (!didAgree) {\n didAgree = confirm(\n \"Pair Programming should only be used with the consent of your instructor.\" +\n \"Your partner must be a registered member of the class and have agreed to pair with you.\" +\n \"By clicking OK you certify that both of these conditions have been met.\"\n );\n if (didAgree) {\n localStorage.setItem(\"partnerAgree\", \"true\");\n } else {\n return;\n }\n }\n this.partner = true;\n $(plabel).text(\"with: \");\n $(partnerTextBox).show();\n }\n }.bind(this)\n );\n var partnerTextBox = document.createElement(\"input\");\n partnerTextBox.type = \"text\";\n ctrlDiv.appendChild(partnerTextBox);\n $(partnerTextBox).hide();\n $(partnerTextBox).change(\n function () {\n this.partner = partnerTextBox.value;\n }.bind(this)\n );\n }\n\n // This is probably obsolete. Not sure if anyone at Michigan will come back\n // to working on this again.\n enableChatCodes(ctrlDiv) {\n var chatBar = document.createElement(\"div\");\n var channels = document.createElement(\"span\");\n var topic = window.location.host + \"-\" + this.divid;\n ctrlDiv.appendChild(chatBar);\n $(chatBar).text(\"Chat: \");\n $(chatBar).append(channels);\n let butt = document.createElement(\"a\");\n $(butt).addClass(\"ac_opt btn btn-default\");\n $(butt).text(\"Create Channel\");\n $(butt).css(\"margin-left\", \"10px\");\n $(butt).attr(\"type\", \"button\");\n $(butt).attr(\"target\", \"_blank\");\n $(butt).attr(\n \"href\",\n \"http://\" +\n chatcodesServer +\n \"/new?\" +\n $.param({\n topic: window.location.host + \"-\" + this.divid,\n code: this.editor.getValue(),\n lang: \"Python\",\n })\n );\n this.chatButton = butt;\n chatBar.appendChild(butt);\n var updateChatCodesChannels = function () {\n var data = doc.data;\n var i = 1;\n $(channels).html(\"\");\n data[\"channels\"].forEach(function (channel) {\n if (!channel.archived && topic === channel.topic) {\n var link = $(\"\");\n var href =\n \"http://\" + chatcodesServer + \"/\" + channel.channelName;\n link.attr({\n href: href,\n target: \ "_blank\",\n });\n link.text(\" \" + channel.channelName + \"(\" + i + \") \");\n $(channels).append(link );\n i++;\n }\n });\n if (i === 1) {\n $(canales).text(\"(no hay conversaciones activas sobre este problema)\");\n }\n };\n doc.subscribe(actualizarChatCodesChannels);\n doc.on(\"op\", actualizarChatCodesChannels);\n }\n\n enableSaveLoad() {\n $(this.runButton).text ($.i18n(\"msg_activecode_save_run\"));\n }\n\n // _`addHistoryScrubber`\n // -------------------- -\n // Código activo: si el código no ha cambiado con respecto al valor de posición del depurador, no guarde el código ni cambie la posición del depurador\n // -- siga llamando a runlog, pero agregue un parámetro para no guardar el código\ n // agregar un botón de historial de carga inicial\n // si no hay edición, entonces no hay agregar para_guardar (Verdadero/Falso)\n async addHistoryScrubber(pos_last) {\n this.addingScrubber = true;\n let response; \n var reqData = {\n acid: this.divid,\n };\n if (this.sid !== undefined) {\n reqData[\"sid\"] = this.sid;\n }\ n console.log(\"antes de obtener el historial\");\n if (\n eBookConfig.practice_mode ||\n !eBookConfig.isLoggedIn ||\n (this.isTimed && !this.assessmentToken)\n ) {\ n // Si esto está cronometrado y ya se tomó, debemos restaurar la información del historial\n this.renderScrubber();\n } else {\n let request = new Request(\n `${eBookConfig.new_server_prefix}/assessment/gethist` ,\n {\n método: \"POST\",\n encabezados: this.jsonHeaders,\n cuerpo: JSON.stringify(reqData),\n }\n );\n probar {\n respuesta = esperar a buscar (solicitud);\n let data = esperar respuesta.json();\n if (!response.ok) {\n throw new Error(\n `Failed to get the history data: ${data.detail}`\ n );\n }\n data = data.detail;\n if (data.history !== undefined) {\n this.history = this.history.concat(data.history);\n for (let t en data.timestamps) {\n this.timestamps.push(\n new Date(data.timestamps[t]).toLocaleString()\n );\n }\n }\n } catch (e) {\n console.log(`no se pudo obtener el historial: ${e}`);\n }\n this.renderScrubber(pos_last);\n }\n this.addingScrubber = false;\n devuelve \"éxito\";\ n }\n\n renderScrubber(pos_last) {\n console.log(\"haciendo un nuevo depurador\");\n var scrubberDiv = document.createElement(\"div\");\n $(scrubberDiv). css(\"pantalla\", \"bloque en línea\");\n $(scrubberDiv).css(\"margen izquierdo\", \"10px\");\n $(scrubberDiv).css( \"margin-right\", \"10px\");\n $(scrubberDiv).css({\n \"min-width\": \"200px\",\n \"max-width\" : \"300px\",\n });\n var scrubber = document.createElement(\"div\");\n this.timestampP = document.createElement(\"span\");\n this.slideit = function (ev, el) {\n this.editor.setValue(this.history[$(scrubber).slider(\"value\")]);\n var curVal = this.timestamps[$(scrubber). slider(\"value\")];\n let pos = $(scrubber).slider(\"value\");\n let outOf = this.history.length;\n $(this.timestampP).text (`${curVal} - ${pos + 1} de ${outOf}`);\n // una diapositiva también resultará en un evento de cambio de diapositiva que no queremos duplicar\n // registrar estos eventos. Por lo tanto, no registre la diapositiva hasta que se detenga y cree el\n modificado if (ev !== null && ev.type != \"slide\") {\n this.logBookEvent({\n event: \"activecode\ ",\n act: \"slide:\" + curVal,\n div_id: this.divid,\n });\n }\n };\n $(scrubber).slider({\n max: this .history.length - 1,\n valor: this.history.length - 1,\n });\n $(scrubber).css(\"margen\", \"10px\");\n $( depurador).on(\"slide\", this.slideit.bind(this));\n $(scrubber).on(\"slidechange\", this.slideit.bind(this));\n scrubberDiv. appendChild(scrubber);\n scrubberDiv.appendChild(this.timestampP);\n // Si hay una fecha límite establecida, coloque el depurador en el último envío\n // antes de la fecha límite\n if (this.deadline) {\n let i = 0;\n let done = false;\n while (i < this.history.length && !done) {\n if (new Date(this.timestamps[i]) > this.deadline) {\n done = true;\n } else {\n i += 1;\n }\n }\n i = i - 1;\n scrubber.value = Math.max(i, 0);\n this. editor.setValue(este.historia[depurador.valor]);\n $(depurador).slider(\"valor\", depurador.valor);\n } else if (pos_last) {\n depurador.valor = esto .history.length - 1;\n this.editor.setValue(this.history[scrubber.value]);\n } else {\n scrubber.value = 0;\n }\n let pos = $(scrubber) .slider(\"valor\");\n let outOf = this.history.length;\n let ts = this.timestamps[$(scrubber).slider(\"value\")];\n $(this .timestampP).text(`${ts} - ${pos + 1} of ${outOf}`);\n this.historyScrubber = Scrubber;\n $(scrubberDiv).insertAfter(this.runButton);\n } // finaliza la definición de helper\n\n createOutput() {\n // Crea un div principal con dos elementos: pre para la salida estándar y un div\n // para contener la salida de gráficos de tortuga. Usamos un div en caso de que la tortuga cambie de\n // usar un lienzo a usar algún otro elemento como svg en el futuro.\n var outDiv = document.createElement(\"div\");\n $(outDiv) .addClass(\"ac_output\");\n this.outDiv = outDiv;\n this.output = document.createElement(\"pre\");\n this.output.id = this.divid + \"_stdout \";\n $(esta.salida).css(\"visibilidad\", \"oculto\");\n $(esta.salida).css(\"altura máxima\", \"400px\ ");\n $(this.output).css(\"overflow\", \"auto\");\n this.graphics = document.createElement(\"div\");\n this.graphics. id = this.divid + \"_graphics\";\n $(this.graphics\).addClass(\"ac-canvas\");\n // Este poco de magia agrega un evento que espera a que un niño del lienzo ser creado en nuestro\n // div recién creado. Cuando se agrega un lienzo secundario, agregamos una nueva clase para que el lienzo visible\n // se pueda diseñar en CSS. Lo que en este momento significa simplemente agregar un borde.\n $(this.graphics).on(\n \"DOMNodeInserted\",\n \"canvas\",\n function () {\n $(this.graphics ).addClass(\"visible-ac-canvas\");\n }.bind(this)\n );\n\n var coachDiv = document.createElement(\"div\");\n coachDiv.classList .add(\"alerta\", \"alerta-advertencia\", \"codecoach\");\n $(coachDiv).css(\"display\", \"none\");\n let coachHead = coachDiv.appendChild(document.createElement(\"h3\"));\n coachHead.textContent = $.i18n(\"msg_activecode_code_coach\");\n this.outerDiv.appendChild(coachDiv);\n this.codecoach = coachDiv;\n\n outDiv.appendChild(this.output);\n outDiv.appendChild(this.graphics);\n this.outerDiv.appendChild(outDiv);\n var lensDiv = document.createElement(\"div \");\n lensDiv.classList.add(\"codelens\");\n lensDiv.id = `${this.divid}_codelens`;\n $(lensDiv).css(\"display\", \"ninguno\");\n this.codelens = lensDiv;\n this.outerDiv.appendChild(lensDiv);\n }\n\n disabledSaveLoad() {\n $(this.saveButton).addClass(\" disabled\");\n $(this.saveButton).attr(\"title\", \"Inicia sesión para guardar tu código\");\n $(this.loadButton).addClass(\"disabled\") ;\n $(this.loadButton).attr(\"title\", \"Inicie sesión para cargar su código\");\n }\n\n downloadFile(lang) {\n var fnb = this.divid; \n var d = new Date();\n var fileName =\n fnb +\n \"_\" +\n d\n .toJSON()\n .substring(0, 10) // formato de fecha inverso\ n .split(\"-\")\n .join(\"\") +\n \".\" +\n languageExtensions[lang];\n var code = this.editor.getValue();\ n if (\"Blob\" en la ventana) {\n var textToWrite = code.replace(/\\n/g, \"\\r\\n\");\n var textFileAsBlob = new Blob([textToWrite ], {\n escriba: \"text/plain\",\n });\n if (\"msSaveOrOpenBlob\" en el navegador) {\n navigator.msSaveOrOpenBlob(textFileAsBlob, fileName);\n } else {\ n var downloadLink = document.createElement(\"a\");\n downloadLink.download = fileName;\n downloadLink.innerHTML = \"Descargar archivo\";\n downloadLink.href = ventana.URL.createObjectURL(textFileAsBlob) ;\n downloadLink.style.display = \"ninguno\";\n document.body.appendChild(downloadLink);\n downloadLink.click();\n }\n } else {\n alert(\"Tu navegador no es compatible con HTML5 Blob.\");\n }\n }\n\n async createGradeSummary() {\n // obtener la calificación y los comentarios de esta tarea\n // obtener un resumen de todas las calificaciones de este estudiante\ n // muestra las calificaciones en la ventana modal\n var data = {\n div_id: this.divid,\n };\n let request = new Request(eBookConfig.ajaxURL + \"getassignmentgrade\", {\n method: \ "POST\",\n encabezados: this.jsonHeaders,\n cuerpo: JSON.stringify(datos),\n });\n dejar respuesta = esperar búsqueda (solicitud);\n dejar informe = esperar respuesta.json( );\n cuerpo var;\n // buscar informe['mensaje']\n if (informe) {\n if (informe[\"version\"] == 2) {\n // nueva versión; sería mejor incrustar esto en HTML para el código activo\n body =\n \"

Informe de calificación

\"+\n\"

Esta pregunta: \" +\n informe[\"grado\"];\n si (informe[\"lanzado\"]) {\n cuerpo += \"fuera de \" + informe[\"máximo\" ];\n }\n cuerpo += \"

\";\n if (informe[\"publicado\"] == falso) {\n cuerpo += \"Comentarios preliminares: \";\n }\n cuerpo += informe[\"comentario\"] + \"

\";\n } else {\n cuerpo =\n \"

Informe de calificación

\"+\n\"

Esta tarea: \" +\n informe[\"calificación\"] +\n \"

\"+\n\"

\" +\n informe[\"comentario\"] +\n \"

\"+\n\"

Número de tareas calificadas: \" +\n report[\"count\"] +\n \"

(Video) ⭐Calendario de Siembra 2023 Que sembrar en JUNIO para Huerto de Verano e Invierno

\"+\n\"

Puntuación media: \" +\n informe[\"avg\"] +\n \"

\";\n }\n } else {\n cuerpo = \"

El servidor no devolvió ninguna información de calificación.

\";\n }\n var html = `

\norte

\n\n

Comentarios sobre la tarea

\norte

(Video) VUELVE EL FITCAMP | + CALENDARIO JUNIO

\norte

\n ${cuerpo}\n

\norte

`;\n var el = $(html);\n el.modal();\n\n respuesta de retorno;\n }\n\n async showCodelens() {\n if (this.codelens.style.display == \"ninguno\") {\n this.codelens.style.display = \"block\";\n this.clButton.innerText = $.i18n(\"msg_activecode_hide_codelens\");\n } else {\ n this.codelens.style.display = \"none\";\n this.clButton.innerText = $.i18n(\"msg_activecode_show_in_codelens\");\n return;\n }\n var cl = this.codelens. firstChild;\n if (cl) {\n this.codelens.removeChild(cl);\n }\n var code = esperar esto.buildProg(false);\n var myVars = {};\n myVars.code = código;\n myVars.origin = \"opt-frontend.js\";\n myVars.cumulative = false;\n myVars.heapPrimitives = false;\n myVars.drawParentPointers = false;\n myVars.textReferences = false; \n myVars.showOnlyOutputs = false;\n myVars.rawInputLstJSON = JSON.stringify([]);\n if (this.language == \"python\") {\n if (this.python3) {\n myVars .py = 3;\n } else {\n myVars.py = 2;\n }\n } else if (this.langauge == \"javascript\") {\n myVars.py = \"js\" ;\n } else {\n myVars.py = este.idioma;\n }\n myVars.curInstr = 0;\n myVars.codeDivWidth = 350;\n myVars.codeDivHeight = 400;\n var srcURL = \" https://pythontutor.com/iframe-embed.html\";\n var srcVars = $.param(myVars);\n var embedUrlStr = `${srcURL}#${srcVars}`;\n var myIframe = document.createElement(\"iframe\");\n myIframe.setAttribute(\"id\", this.divid + \"_codelens\");\n myIframe.setAttribute(\"ancho\", \"100% \");\n myIframe.setAttribute(\"height\", \"500\");\n myIframe.setAttribute(\"style\", \"display:block\");\n myIframe.style. background = \"#fff\";\n //myIframe.setAttribute(\"src\",srcURL)\n myIframe.src = embedUrlStr;\n this.codelens.appendChild(myIframe);\n this.logBookEvent( {\n evento: \"codelens\",\n acto: \"ver\",\n div_id: this.divid,\n });\n }\n\n toggleEditorVisibility() {}\n\n addErrorMessage(err) {\n // Agrega el mensaje de error\n this.errLastRun = true;\n var errHead = $(\"

\").html(\"Error\");\n this.eContainer = this.outerDiv.appendChild(\n document.createElement(\"div\")\n );\n this.eContainer.className = \ "alerta de error alerta-peligro\";\n this.eContainer.id = this.divid + \"_errinfo\";\n this.eContainer.appendChild(errHead[0]);\n var errText = this.eContainer. appendChild(\n document.createElement(\"pre\")\n );\n // Pero, ajuste los números de línea. Si el número de línea es <= pretextLines entonces está en el código incluido\n // si es mayor que el número de líneas incluidas pero menor que el pretexto + editor actual, entonces está en el código del estudiante.\n // ajusta el número de línea que mostramos eliminando el código pre-incluido.\n if (err.traceback && err .traceback.length >= 1) {\n var errorLine = err.traceback[0].lineno;\n if (errorLine <= this.pretextLines) {\n errText.innerHTML =\n \"Ocurrió un error en el oculto, código incluido. Lo sentimos, no podemos brindarle un mensaje de error más útil\";\n return;\n } else if (errorLine > this.progLines + this.pretextLines) {\n errText.innerHTML = `Ocurrió un error después del final de su código.\nUna posible razón es que tiene un paréntesis o una cadena sin cerrar.\nOtra posibilidad es que haya un error en el código de prueba oculto.\nOtra más es que haya un error interno. El mensaje de error interno es: $ {err.message}`;\n return;\n } else {\n if (this.pretextLines > 0) {\n err.traceback[0].lineno =\n err.traceback[0].lineno - this .pretextLines + 1;\n }\n }\n }\n var errString = err.toString();\n var to = errString.indexOf(\":\");\n var errName = errString.substring( 0, a);\n errText.innerHTML = errString;\n $(este.eContainer).append(\"

Descripción

\");\n var errDesc = this.eContainer.appendChild(document.createElement(\"p\"));\n errDesc.innerHTML = errorText[errName];\n $(this.eContainer).append(\ "

Arreglar

\");\n var errFix = this.eContainer.appendChild(document.createElement(\"p\"));\n errFix.innerHTML = errorText[errName + \"Fix\"];\n var moreInfo = \ "../ErrorHelp/\" + errName.toLowerCase() + \".html\";\n //console.log(\"Error de tiempo de ejecución: \" + err.toString());\n }\n setTimeLimit(timer) {\n var timelimit = this.timelimit;\n if (timer !== undefined) {\n timelimit = timer;\n }\n // establecer execLimit en milisegundos -- para proyectos de estudiantes establecer esto en \n // 25 segundos, justo menos que el propio temporizador de Chrome.\n if (\n this.code.indexOf(\"ontimer\") > -1 ||\n this.code.indexOf(\"onclick\ ") > -1 ||\n this.code.indexOf(\"onkey\") > -1 ||\n this.code.indexOf(\"setDelay\") > -1\n ) {\n Sk .execLimit = null;\n } else {\n if (timelimit === \"off\") {\n Sk.execLimit = null;\n } else if (timelimit) {\n Sk.execLimit = timelimit; \n } else {\n Sk.execLimit = 25000;\n }\n }\n }\n builtinRead(x) {\n if (\n Sk.builtinFiles === undefined ||\n Sk.builtinFiles[ \"archivos\"][x] === indefinido\n )\n throw $.i18n(\"msg_activecode_file_not_found\", x);\n return Sk.builtinFiles[\"files\"][x];\ n }\n fileReader(divid) {\n // Al principio, los archivos eran solo preetiquetas y usamos la división como nombre de archivo\n let elem = document.getElementById(divid);\n // En PreTeXt movimos eso a @data-filename\n if (elem === null) {\n elem = document.querySelector(`[data-filename=\"${divid}\"]`);\n }\n let data = \"\";\n let result = \"\";\n if (elem == null && Sk.builtinFiles.files.hasOwnProperty(divid)) {\n return Sk.builtinFiles[\"files\"] [divid];\n } else {\n // prueba el archivo remoto a menos que termine con .js o .py; de lo contrario, le pediremos al servidor todos\n // tipos de módulos que estamos tratando de importar\ n if (!(divid.termina con(\".js\") || divide.endsWith(\".py\"))) {\n $.ajax({\n async: false,\n url: `/runestone/ajax/get_datafile?course_id=${eBookConfig.course}&acid=$ {divid}`,\n éxito: función (datos) {\n resultado = JSON.parse(datos).datos;\n },\n error: función (err) {\n resultado = nulo;\n }, \n });\n if (resultado) {\n devuelve resultado;\n }\n }\n }\n if (elem == nulo && resultado === nulo) {\n lanzar nuevo Sk.builtin. IOError(\n $.i18n(\"msg_activecode_no_file_or_dir\", divid)\n );\n } else {\n // para compatibilidad con versiones anteriores: al principio teníamos un área de texto con la división.\n // pero más tarde esto cambió a un envoltorio de piedra rúnica. Entonces, ¿debemos buscar un pre\n // o un área de texto?\n if (elem.nodeName.toLowerCase() == \"textarea\") {\n data = elem.value;\n } else { \n let pre = elem.querySelector(\"pre\");\n if (pre) {\n data = pre.textContent;\n } else {\n data = elem.textContent;\n }\n } \n }\n devolver datos;\n }\n outputfun(texto) {\n // bnm python 3\n if (this.outputLineCount > 1000) return;\n $(this.output).css(\" visibilidad\", \"visible\");\n texto = texto\n .replace(//g, \">\")\n .replace(/\\n/g, \"
\");\n // todo: intente hacer que esto use el mecanismo de suspensión en skulpt\n devuelva new Sk.misceval.promiseToSuspension(\n new Promise(\n function (resolve) {\n setTimeout(\n function ( ) {\n if (this.outputLineCount < 1000) {\n $(this.output).append(text);\n this.outputLineCount += 1;\n resolve(Sk.builtin.none.none$); \n } else {\n if (this.outputLineCount == 1000) {\n $(this.output).append(\"Demasiada salida\");\n this.outputLineCount += 1;\n stopExecution = true;\n resolve(Sk.builtin.none.none$);\n }\n }\n }.bind(this),\n 1\n );\n }.bind(this)\n )\ n );\n }\n\n filewriter(fobj, bytes) {\n let filecomponent = document.getElementById(fobj.name);\n if (!filecomponent) {\n let contenedor = document.createElement(\" div\");\n $(contenedor).addClass(\"piedra rúnica\");\n let tab = document.createElement(\"div\");\n $(tab).addClass(\"datafile_caption\ ");\n tab.innerHTML = `Archivo de datos:${fobj.nombre}`;\n filecomponent = document.createElement(\"textarea\");\n filecomponent.rows = 10;\n filecomponent.cols = 50;\n filecomponent.id = fobj.name;\n $(filecomponent). css(\"margin-bottom\", \"5px\");\n $(filecomponent).addClass(\"ac_output\");\n container.appendChild(tab);\n container.appendChild(filecomponent) ;\n this.outerDiv.appendChild(contenedor);\n } else {\n if (fobj.pos$ == 0) {\n $(componente de archivo).val(\"\");\n }\n }\n let actual = $(componente de archivo).val();\n actual = actual + bytes.v;\n $(componente de archivo).val(actual);\n $(componente de archivo).css(\"display\ ", \"bloque\");\n fobj.pos$ = longitud.actual;\n return longitud.actual;\n }\n\n asíncrono getIncludedCode(divid) {\n if (window.componentMap[divid] ) {\n return window.componentMap[divid].editor.getValue();\n } else {\n let request = new Request(\n `/runestone/ajax/get_datafile?course_id=${eBookConfig.course}&acid =${divid}`,\n {\n método: \"GET\",\n encabezados: this.jsonHeaders,\n }\n );\n let wresult = await fetch(request);\n let obj = esperar wresult.json();\n devolver obj.data;\n }\n }\n\n async buildProg(useSuffix) {\n // ensamblar código a partir de prefijo, sufijo y editor para ejecutar.\n var pretexto;\n var prog = este.editor.getValue() + \"\\n\";\n if (este.prefijo) {\n prog = este.prefijo + prog;\n }\n este.pretexto = \"\";\n this.pretextLines = 0;\n this.progLines = prog.match(/\\n/g).length + 1;\n if (this.includes) {\n // iterar sobre los include, en orden precediendo a prog\n pretext = \"\";\n for (var x = 0; x < esto.incluye.longitud; x++) {\n let iCode = esperar esto.getIncludedCode(this.includes[x]);\n pretexto = pretexto + iCode + \"\\n\";\n }\n este.pretexto = pretexto;\n if (este.pretexto) {\n this.pretextLines = (this.pretext.match(/\\n/g) || \"\").length;\n }\n prog = pretexto + prog;\n }\n if (useSuffix && this.suffix) {\n prog = prog + this.suffix;\n }\n return Promise.resolve(prog);\n }\n\n async manage_scrubber(saveCode) {\n if (this.historyScrubber === null && !this.autorun) {\n esperar this.addHistoryScrubber();\n }\n if (\n this.historyScrubber &&\n this.history[$(this.historyScrubber) .slider(\"value\")] !=\n this.editor.getValue()\n ) {\n saveCode = \"True\";\n this.history.push(this.editor.getValue() );\n this.timestamps.push(new Date().toLocaleString());\n $(this.historyScrubber).slider(\n \"option\",\n \"max\",\n this .history.length - 1\n );\n $(this.historyScrubber).slider(\n \"option\",\n \"value\",\n this.history.length - 1\n ); \n this.slideit(null);\n } else {\n saveCode = \"False\";\n }\n if (this.historyScrubber == null) {\n saveCode = \"False\";\ n }\n return saveCode;\n }\n\n async checkCurrentAnswer() {\n try {\n await this.runProg();\n } catch (e) {\n console.log(`error al ejecutar el código ${e}`);\n }\n }\n\n // el parámetro sid es opcional y se usa para envíos grupales\n async logCurrentAnswer(sid) {\n let data = {\n div_id: this. divide,\n código: este.editor.getValue(),\n idioma: este.idioma,\n errinfo: este.errinfo || \"\",\n para_guardar: this.saveCode || \"F\",\n prefijo: este.pretexto,\n sufijo: este.sufijo,\n socio: este.socio,\n }; // Registrar el evento de ejecución\n if (typeof sid !== \"undefined\") {\n data.sid = sid;\n }\n await this.logRunEvent(data);\n // If unit testing fueron ejecutados habrá un unit_results\n if (this.unit_results) {\n let unitData = {\n act: this.unit_results,\n div_id: this.divid,\n event: \"unittest\",\n };\n if (typeof sid !== \"undefined\") {\n unitData.sid = sid;\n }\n await this.logBookEvent(unitData);\n }\n }\n\n asíncrono runCoaches() {\n //Ejecuta todos los coaches de código disponibles y actualiza el div de coach de código\n\n //borra cualquier cosa después del encabezado en el div de codecoach y lo oculta\n $(this.codecoach).children().slice(1 ).remove();\n $(this.codecoach).css(\"display\", \"none\");\n\n //obtener código, ejecutar coaches\n let code = esperar esto.buildProg (false);\n let results = [];\n for (let coach de this.codeCoachList) {\n results.push(coach.check(code));\n }\n\n //una vez que todos los entrenadores hecho, actualice div\n Promise.allSettled(resultados).then((promesas) => {\n for (let p of promises) {\n if (\n p.status === \"cumplido\" && \n p.value !== null &&\n p.value.trim() !== \"\"\n ) {\n let checkDiv = document.createElement(\"div\");\n checkDiv. classList.add(\"python_check_results\");\n let checkPre = checkDiv.appendChild(\n document.createElement(\"pre\")\n );\n checkPre.textContent = p.value;\n this. codecoach.append(checkDiv);\n $(this.codecoach).css(\"display\", \"block\");\n }\n }\n });\n }\n\n renderFeedback () {\n // El código de prueba de unidad de python crea la tabla mientras ejecuta las pruebas\n // En el uso \"normal\", esto se muestra inmediatamente.\n // Sin embargo, en el modo de examen creamos un div que está fuera de pantalla\n if (this.unit_results_divid) {\n if (this.unit_results_divid.indexOf(\"_offscreen_\") > 0) {\n let urDivid = `${this.divid}_offscreen_unit_results`;\n let unitFeedback = document.getElementById(urDivid);\n let tmp = document.body.removeChild(unitFeedback);\n if ($(this.outerDiv).find(`#${urDivid}`).length > 0) {\ n tmp = $(this.outerDiv).find(`#${urDivid}`)[0];\n } else {\n this.outerDiv.appendChild(tmp);\n }\n $(tmp). show();\n } else {\n let urDivid = this.divid + \"_unit_results\";\n if (\n $(this.outerDiv).find(`#${urDivid}`).length = = 0 &&\n $(this.outerDiv).find(`#${urDivid}_offscreen_unit_results`)\n .length == 0\n ) {\n let urResults = document.getElementById(urDivid);\n esto. externalDiv.appendChild(urResults);\n }\n }\n }\n }\n\n toggleAlert() {\n if (this.is_toggle && this.runCount == 3) {\n if (\n this .errinfo != \"éxito\" ||\n this.unit_results.substring(8, 11) != 100.0\n ) {\n setTimeout(function () {\n alert(\n \"La ayuda está disponible usando el selector de preguntas de alternar! Puede probar primero con la pregunta mixta.\"\n );\n }, 500);\n this.logBookEvent({\n event: \"togglealert\",\n act: \"Help is Available using the Toggle Question Selector\",\n div_id: this.divid,\n });\n }\n }\n }\n\n /* runProg tiene varios elementos asíncronos.\n * 1. Skulpt se ejecuta el programa python de forma asíncrona\n * 2. El historial se restaura de forma asíncrona\n * 3. El registro es asíncrono\n *\n * Este método devuelve la promesa de skulpt y, por lo tanto, la promesa se resolverá cuando finalice skulpt.\n * cuando finalice this.unit_results contendrá los resultados de cualquier prueba unitaria que se haya ejecutado.\n * La tabla de resultados se construye y agrega al DOM mediante el módulo python unittest.gui en skulpt.\n *\n */\n async runProg(noUI, logResults) {\n console.log(\"starting runProg\");\n stopExecution = false;\n this.outputLineCount = 0;\n if (typeof logResults === \"undefined\") {\n this.logResults = true;\n } else {\n this.logResults = logResults;\n }\n if (typeof noUI !== \"boolean\") {\n noUI = false;\n } \n var prog = esperar this.buildProg(true);\n this.saveCode = \"True\";\n $(this.output).text(\"\");\n\n while ($( `#${this.divid}_errinfo`).length > 0) {\n $(`#${this.divid}_errinfo`).remove();\n }\n //$(this.eContainer) .remove();\n if (this.codelens) {\n this.codelens.style.display = \"none\";\n }\n if (this.clButton) {\n this.clButton.innerText = $.i18n(\"msg_activecode_show_in_codelens\");\n }\n Sk.configure({\n salida: this.outputfun.bind(this),\n read: this.fileReader,\n filewrite: this.filewriter. bind(this),\n __future__: Sk.python3,\n killableWhile: true,\n killableFor: true,\n nonreadopen: true,\n // python3: this.python3,\n imageProxy: \"http:/ /image.runestone.academy:8080/320x\",\n inputfunTakesPrompt: true,\n jsonpSites: [\"https://itunes.apple.com\"],\n });\n Sk.divid = this.divid;\n Sk.logResults = logResults;\n if (this.graderactive && this.outerDiv.closest(\".loading\")) {\n Sk.gradeContainer = this.outerDiv.closest(\". loading\").id;\n } else {\n Sk.gradeContainer = this.divid;\n }\n this.setTimeLimit();\n (Sk.TurtleGraphics || (Sk.TurtleGraphics = {})).target = this.graphics;\n Sk.canvas = this.graphics.id; //todo: deshacerse de esto aquí y en la imagen\n if (!noUI) {\n this.saveCode = esperar this.manage_scrubber(this.saveCode);\n $(this.runButton).attr(\"disabled \", \"deshabilitado\");\n $(this.historyScrubber).off(\"slidechange\");\n $(this.historyScrubber).slider(\"disable\");\n $( this.outDiv).show({\n duración: 700,\n cola: false,\n });\n }\n try {\n await Sk.misceval.asyncToPromise(\n function () {\n return Sk.importMainWithBody(\"\", false, prog, true);\n },\n {\n // manejadores de suspensión\n \"*\": () => {\n if (stopExecution) {\n console.log(\ "stopExecution is true\");\n throw new Error(`El programa fue interrumpido`);\n }\n },\n }\n );\n if (!noUI) {\n if (this. slideit) {\n $(this.historyScrubber).on(\n \"slidechange\",\n this.slideit.bind(this)\n );\n }\n $(this.historyScrubber).slider( \"habilitar\");\n }\n this.errLastRun = false;\n this.errinfo = \"success\";\n } catch (err) {\n if (!noUI) {\n $( this.historyScrubber).on(\n \"slidechange\",\n this.slideit.bind(this)\n );\n $(this.historyScrubber).slider(\"habilitar\");\n } \n this.errinfo = err.toString();\n this.addErrorMessage(err);\n } finalmente {\n $(this.runButton).removeAttr(\"disabled\");\n if (tipo de ventana .allVisualizers != \"indefinido\") {\n $.each(window.allVisualizers, function (i, e) {\n e.redrawConnectors();\n });\n }\n }\n } \n\n disabledInteraction() {\n $(this.runButton).hide();\n $(this.codeDiv).addClass(\"ac-disabled\");\n }\n}\n\ nvar languageExtensions = {\n python: \"py\",\n html: \"html\",\n javascript: \"js\",\n java: \"java\",\n python2: \" py\",\n python3: \"py\",\n cpp: \"cpp\",\n c: \"c\",\n sql: \"sql\",\n octava: \"m \",\n};\n\nvar errorText = {};\n\nerrorText.ParseError = $.i18n(\"msg_sctivecode_parse_error\");\nerrorText.ParseErrorFix = $.i18n(\"msg_sctivecode_parse_error_fix\"); \nerrorText.TypeError = $.i18n(\"msg_activecode_type_error\");\nerrorText.TypeErrorFix = $.i18n(\"msg_activecode_type_error_fix\");\nerrorText.NameError = $.i18n(\"msg_activecode_name_error\");\nerrorText .NameErrorFix = $.i18n(\"msg_activecode_name_error_fix\");\nerrorText.ValueError = $.i18n(\"msg_activecode_value_error\");\nerrorText.ValueErrorFix = $.i18n(\"msg_activecode_value_error_fix\");\nerrorText.AttributeError = $.i18n(\"msg_activecode_attribute_error\");\nerrorText.AttributeErrorFix = $.i18n(\"msg_activecode_attribute_error_fix\");\nerrorText.TokenError = $.i18n(\"msg_activecode_token_error\");\nerrorText.TokenErrorFix = $ .i18n(\"msg_activecode_token_error_fix\");\nerrorText.TimeLimitError = $.i18n(\"msg_activecode_time_limit_error\");\nerrorText.TimeLimitErrorFix = $.i18n(\"msg_activecode_time_limit_error_fix\");\nerrorText.Error = $.i18n (\"msg_activecode_general_error\");\nerrorText.ErrorFix = $.i18n(\"msg_activecode_general_error_fix\");\nerrorText.SyntaxError = $.i18n(\"msg_activecode_syntax_error\");\nerrorText.SyntaxErrorFix = $.i18n(\ "msg_activecode_syntax_error_fix\");\nerrorText.IndexError = $.i18n(\"msg_activecode_index_error\");\nerrorText.IndexErrorFix = $.i18n(\"msg_activecode_index_error_fix\");\nerrorText.URIError = $.i18n(\"msg_activecode_uri_error \");\nerrorText.URIErrorFix = $.i18n(\"msg_activecode_uri_error_fix\");\nerrorText.ImportError = $.i18n(\"msg_activecode_import_error\");\nerrorText.ImportErrorFix = $.i18n(\"msg_activecode_import_error_fix\" );\nerrorText.ReferenceError = $.i18n(\"msg_activecode_reference_error\");\nerrorText.ReferenceErrorFix = $.i18n(\"msg_activecode_reference_error_fix\");\nerrorText.ZeroDivisionError = $.i18n(\"msg_activecode_zero_division_error\"); \nerrorText.ZeroDivisionErrorFix = $.i18n(\n \"msg_activecode_zero_division_error_fix\"\n);\nerrorText.RangeError = $.i18n(\"msg_activecode_range_error\");\nerrorText.RangeErrorFix = $.i18n(\"msg_activecode_range_error_fix\" );\nerrorText.InternalError = $.i18n(\"msg_activecode_internal_error\");\nerrorText.InternalErrorFix = $.i18n(\"msg_activecode_internal_error_fix\");\nerrorText.IndentationError = $.i18n(\"msg_activecode_indentation_error\"); \nerrorText.IndentationErrorFix = $.i18n(\"msg_activecode_indentation_error_fix\");\nerrorText.NotImplementedError = $.i18n(\"msg_activecode_not_implemented_error\");\nerrorText.NotImplementedErrorFix = $.i18n(\n \"msg_activecode_not_implemented_ error_fix\"\n );\nerrorText.KeyError = $.i18n(\"msg_activecode_key_error\");\nerrorText.KeyErrorFix = $.i18n(\"msg_activecode_key_error_fix\");\nerrorText.AssertionError = $.i18n(\"msg_activecode_assertion_error\"); \nerrorText.AssertionErrorFix = $.i18n(\"msg_activecode_assertion_error_fix\");\n\nString.prototype.replaceAll = función (objetivo, reemplazo) {\n devolver esto.split(objetivo).join(reemplazo);\n} ;\n","importar { ActiveCode } de \"./activecode.js\";\n\nexport clase predeterminada JSActiveCode extiende ActiveCode {\n constructor(opts) {\n super(opts);\n }\n salidafun(a) {\n $(esta.salida).css(\"visibilidad\", \"visible\");\n var str = \"[\";\n if (tipo de a == \" objeto\" && a.longitud) {\n for (var i = 0; i < a.longitud; i++)\n if (tipo de a[i] == \"objeto\" && a[i].longitud) {\n str += (i == 0 ? \"\" : \" \") + \ "[\";\n for (var j = 0; j < a[i].length; j++)\n str +=\n a[i][j] +\n (j == a[i]. longitud - 1\n ? \"]\" + (i == a.longitud - 1 ? \"]\" : \",\") + \"\\n\"\n : \", \" );\n } else str += a[i] + (i == a.length - 1 ? \"]\" : \", \");\n } else {\n probar {\n str = JSON.stringify(a);\n } catch (e) {\n str = a;\n }\n }\n return str;\n }\n async runProg() {\n var _this = this;\ n var prog = esperar this.buildProg(true);\n var saveCode = \"True\";\n var write = function (str) {\n _this.output.innerHTML += _this.outputfun(str);\ n };\n var writeln = function (str) {\n if (!str) str = \"\";\n _this.output.innerHTML += _this.outputfun(str) + \"
\";\n };\n this.saveCode = esperar this.manage_scrubber(saveCode);\n $(this.eContainer).remove();\n $(this.output).text(\"\") ;\n $(this.outDiv).show({ duración: 700, cola: false });\n try {\n eval(prog);\n this.errinfo = \"success\";\n } catch (e) {\n this.addErrorMessage(e);\n this.errinfo = e;\n }\n }\n\n addErrorMessage(err) {\n // Agrega el mensaje de error\n this.errLastRun = verdadero;\n var errHead = $(\"

\").html(\"Error\");\n this.eContainer = this.outerDiv.appendChild(\n document.createElement(\"div\")\n );\n this.eContainer.className = \ "alerta de error alerta-peligro\";\n this.eContainer.id = this.divid + \"_errinfo\";\n this.eContainer.appendChild(errHead[0]);\n var errText = this.eContainer. appendChild(\n document.createElement(\"pre\")\n );\n var errString = err.toString();\n errText.innerHTML = errString;\n console.log(\"Error en tiempo de ejecución: \" + err.toString());\n }\n}\n","var testString = `Comenzando pruebas\nEsperado: Respuesta Real: Mensaje de respuesta: Comprobación del método printAnswer() Aprobado: verdadero\nEsperado: 6 línea(s) de texto Real: 0 línea(s) de texto Mensaje: Comprobación del método principal Aprobado: falso\nHola mundo\nEsperado: Cadena Cadena Real: Cadena Cadena Mensaje: Comprobación de instancia Tipo(s) de variable Aprobado: verdadero\nEsperado: Pregunta Real: Pregunta Mensaje: Verificación del método printQuestion() Aprobado: verdadero\nResultado de depuración\nMás resultados de depuración\nEsperado: 2 Privado Real: 2 Mensaje privado: Verificación de variable(s) de instancia privada Aprobado: verdadero\nEsperado: aprobado Real: aprobado Mensaje: Comprobando constructor con parámetros Aprobado: verdadero\nEsperado: fallido Real: fallido Mensaje: Comprobando el constructor predeterminado Aprobado: verdadero\nTerminando las pruebas\nObtuviste 6 de 7 correctos. 85.71%`;\n\nexport clase predeterminada JUnitTestParser {\n constructor(salida, parentId) {\n let patt = new RegExp(\n \"Esperado:\\\\s+(.?)Actual:\\\ \s+(.?)Mensaje:\\\\s+(.?)Aprobado:\\\\s+(verdadero|falso)\",\n \"g\"\n );\n this.textResults = \"\";\n let coincidencias = salida.matchAll(patt);\n let parent = document.createElement(\"div\");\n parent.classList.add(\"unittest-results\") ;\n let tbl = document.createElement(\"table\");\n tbl.classList.add(\"ac-feedback\");\n parent.appendChild(tbl);\n parent.setAttribute(\ "id\", `${parentId}_unit_results`);\n let tr = document.createElement(\"tr\");\n tr.innerHTML =\n 'ResultadoEsperadoActualnotas';\n tbl.appendChild(tr);\n for (coincidencia constante de coincidencias) {\n let tr = document.createElement(\"tr\");\n let td = document.createElement(\"td\ ");\n td.classList.add(\"ac-feedback\");\n if (match[match.length - 1] == \"true\") {\n td.innerHTML = \"Pass \";\n td.style =\n \"background-color: rgb(131, 211, 130); text-align: center;\";\n } else {\n td.innerHTML = \"Error\ ";\n td.style =\n \"background-color: rgb(222, 142, 150); text-align: center;\";\n }\n tr.appendChild(td);\n tbl. appendChild(tr);\n for (let i = 1; i < match.length - 1; i++) {\n let td = document.createElement(\"td\");\n td.innerHTML = match[i ];\n td.classList.add(\"ac-feedback\");\n tr.appendChild(td);\n }\n tbl.appendChild(tr);\n this.table = parent;\n this.textResults += match[0] + \"\\n\";\n output = output.replace(match[0], \"\");\n }\n let match = output.match(\ n /Obtuviste \\s+(\\d+) de (\\d+) correcto.\\s+(\\d+\\.\\d+)%/\n );\n si (coincidencia) {\n salida = salida.reemplazar(coincidencia[0], \"\");\n let pctString = document.createElement(\"span\");\n pctString.innerHTML = coincidencia[0];\n this.pctString = pctString;\n this.pct = match[3];\n this.passed = match[1];\n this.failed = match[2] - match[1];\n }\n output = output.replace (\"Iniciando pruebas\", \"\");\n salida = salida.reemplazar(\"Finalizando pruebas\", \"\");\n salida = salida.reemplazar(/\\n/g, \"
\");\n salida = salida.reemplazar(/(
)+/g, \"
\");\n salida = salida.replaceAll(\"-1) {\n if (archivo) {\n if (archivo.toDataURL) {\n base64 = archivo.toDataURL(\"image/\" + fileExtension);\n base64 = base64.substring(base64.indexOf( \",\") + 1);\n } else {\n base64 = archivo.src.substring(\n archivo.src.indexOf(\",\") + 1\n );\n }\n } else {\n base64 = content;\n }\n files.push({ name: fileName, content: base64 });\n } else {\n // si no hay className o className no reconocido, se trata como un archivo individual\n // esto podría ser cualquier tipo de archivo, .txt, .java, .csv, etc\n archivos.push({ nombre: nombre de archivo, contenido: contenido });\n }\n }\n } \n // Si estamos ejecutando pruebas unitarias, necesitamos sustituir el controlador de prueba por el código del estudiante\n // y enviar el código del estudiante como un archivo. Lo haremos aquí.\n this.junitDriverCode = `\n import org.junit.runner.JUnitCore;\n import org.junit.runner.Result;\n import org.junit.runner.notification.Failure;\ n\n public class TestRunner {\n public static void main(String[] args) {\n CodeTestHelper.resetFinalResults();\n Resultado resultado = JUnitCore.runClasses(${testdrivername.replace(\n \".java\ ",\n \".class\"\n )});\n System.out.println(CodeTestHelper.getFinalResults());\n\n int total = resultado.getRunCount();\n int fail = resultado .getFailureCount();\n int corr = total - falla;\n System.out.println(\"Obtuviste \" + corr + \" de \" + total + \" correcto. \" + String.format (\"%.2f\", (100.0 corr / total)) + \"%\");\n }\n }\n `;\n if (este.sufijo && este.idioma == \" java\") {\n archivos.push({ nombre: nombre del archivo fuente, contenido: fuente });\n archivos.push({ nombre: nombre del controlador de prueba, contenido: este.sufijo });\n fuente = este.junitDriverCode;\ n if (paramobj.compileargs) {\n paramobj.compileargs.push(nombre del archivo de origen);\n } else {\n paramobj.compileags = [nombre del archivo de origen];\n }\n }\n let runspec = {\n language_id: este.idioma,\n código fuente: fuente,\n parámetros: paramobj,\n nombre del archivo fuente: este.archivofuente,\n };\n\n if (stdin) {\n runspec.input = stdin;\n }\n if (files.length === 0) {\n this.json_runspec = JSON.stringify({ run_spec: runspec });\n file_checkp = Promise.resolve(\"ready\");\n } else {\n runspec[\"file_list\"] = [];\n var promesas = [];\n var instancia = esto;\n\n for (let i = 0; i < archivos.longitud; i++) {\n var nombre_archivo = archivos[i].nombre;\n var contenido_archivo = archivos[i].contenido;\n instancia.div2id[nombre_archivo] =\n \"piedra rúnica\" + MD5(nombre_archivo + contenido_archivo) = > {\n instancia.checkFile(archivos[i], resolver, rechazar);\n })\n );\n }\n this.json_runspec = JSON.stringify({ run_spec: runspec });\n this. div2id = instancia.div2id;\n file_checkp = Promise.all(promises).catch(function (err) {\n console.log(\"Error: \" + err);\n });\n }\n return file_checkp;\n }\n\n /* Envíe el trabajo ensamblado al servidor JOBE y espere los resultados.\n \n /\n async submitToJobe() {\n var data = this.json_runspec;\n let host = this.JOBE_SERVER + this.resource;\n $(this.runButton).attr(\"disabled\", \"disabled\");\n $(this.outDiv).show({ duración: 700 , cola: false });\n $(this.errDiv).remove();\n $(this.output).css(\"visibility\", \"visible\");\n\n let headers = nuevos encabezados ({\n \"Tipo de contenido\": \"aplicación/json; charset=utf-8\",\n Aceptar: \"aplicación/json\",\n \"X-API-KEY\": this.API_KEY,\n });\n let request = new Request(host , {\n método: \"POST\",\n encabezados: encabezados,\n cuerpo: datos,\n });\n return fetch(solicitud);\n\n ///$(\"#\ " + divide + \"_errinfo\").remove();\n }\n\n processJobeResponse(resultado) {\n var logresult;\n var odiv = this.output;\n this.parsedOutput = {}; \n $(this.runButton).removeAttr(\"disabled\");\n if (result.outcome === 15) {\n logresult = \"success\";\n } else {\n logresult = result.outcome;\n }\n this.errinfo = logresult;\n switch (result.outcome) {\n case 15: {\n this.parsedOutput = new JUnitTestParser(\n result.stdout,\n this.divid \n);\n $(odiv).html(this.parsedOutput.stdout);\n if (this.suffix) {\n if (this.parsedOutput.pct === undefined) {\n this.parsedOutput. pct =\n this.parsedOutput.passed =\n this.parsedOutput.failed =\n 0;\n }\n this.unit_results = `percent:${this.parsedOutput.pct}:passed:${this.parsedOutput .aprobado}:fallido:${this.parsedOutput.failed}`;\n }\n break;\n }\n caso 11: // error del compilador\n $(odiv).html($.i18n(\" msg_activecode_were_compiling_err\"));\n this.addJobeErrorMessage(result.cmpinfo);\n break;\n case 12: // error de tiempo de ejecución\n $(odiv).html(result.stdout.replace(/\\n /g, \"
\"));\n if (result.stderr) {\n this.addJobeErrorMessage(result.stderr);\n }\n break;\n case 13: // límite de tiempo\n $(odiv).html( resultado.stdout.replace(/\\n/g, \"
\"));\n this.addJobeErrorMessage(\n $.i18n(\"msg_activecode_time_limit_exc\")\n );\n break;\n default:\n if (result.stderr) {\n $(odiv) .html(resultado.stderr.replace(/\\n/g, \"
\"));\n } else {\n this.addJobeErrorMessage(\n $.i18n(\"msg_activecode_server_err\")\n );\n }\n }\n // tarea pendiente: manejar el servidor ocupado y los errores de tiempo de espera también\n }\n\n renderFeedback() {\n let rdiv = document.getElementById(`${this.divid}_unit_results`);\n if (rdiv) {\n rdiv.remove();\n } \n if (this.parsedOutput && this.parsedOutput.table) {\n this.outDiv.appendChild(this.parsedOutput.table);\n }\n rdiv = document.getElementById(`${this.divid}_unit_results` );\n if (rdiv) {\n rdiv.appendChild(this.parsedOutput.pctString);\n }\n }\n\n addJobeErrorMessage(err) {\n var errHead = $(\"

\").html(\"Error\");\n var eContainer = this.outerDiv.appendChild(\n document.createElement(\"div\")\n );\n this.errDiv = eContainer;\n eContainer.className = \"error alert alert-danger\";\n eContainer.id = this.divid + \"_errinfo\";\n eContainer.appendChild(errHead[0]);\n var errText = eContainer.appendChild(document.createElement(\"pre\"));\n errText.innerHTML = err;\n }\n /**\n * Checks to see if file is on server\n * Places it on server if it is not on server\n * @param {object{name, contents}} file File to place on server\n * @param {function} resolve promise resolve function\n * @param {function} reject promise reject function\n */\n checkFile(file, resolve, reject) {\n var file_id = this.div2id[file.name];\n var resource = this.jobeCheckFiles + file_id;\n var host = this.JOBE_SERVER + resource;\n var xhr = new XMLHttpRequest();\n xhr.open(\"HEAD\", host, true);\n xhr.setRequestHeader(\"Content-type\", \"application/json\");\n xhr.setRequestHeader(\"Accept\", \"text/plain\");\n xhr.setRequestHeader(\"X-API-KEY\", this.API_KEY);\n xhr.onerror = function () {\n // console.log(\"error sending file\" + xhr.responseText);\n };\n xhr.onload = function () {\n switch (xhr.status) {\n case 208:\n case 404:\n // console.log(\"File not on Server\");\n this.pushDataFile(file, resolve, reject);\n break;\n case 400:\n // console.log(\"Bad Request\");\n reject();\n break;\n case 204:\n // console.log(\"File already on Server\");\n resolve();\n break;\n default:\n //console.log(\"This case should never happen\");\n reject();\n }\n }.bind(this);\n xhr.send();\n }\n /**\n * Places a file on a server\n */\n pushDataFile(file, resolve, reject) {\n var fileName = file.name;\n var extension = fileName.substring(fileName.indexOf(\".\") + 1);\n var file_id = this.div2id[fileName];\n var contents = file.content;\n // File types being uploaded that come in already in base64 format\n var extensions = [\"jar\", \"zip\", \"png\", \"jpg\", \"jpeg\"];\n var contentsb64;\n if (extensions.indexOf(extension) === -1) {\n contentsb64 = btoa(contents);\n } else {\n contentsb64 = contents;\n }\n var data = JSON.stringify({ file_contents: contentsb64 });\n var resource = this.jobePutFiles + file_id;\n var host = this.JOBE_SERVER + resource;\n var xhr = new XMLHttpRequest();\n xhr.open(\"PUT\", host, true);\n xhr.setRequestHeader(\"Content-type\", \"application/json\");\n xhr.setRequestHeader(\"Accept\", \"text/plain\");\n xhr.setRequestHeader(\"X-API-KEY\", this.API_KEY);\n xhr.onload = function () {\n switch (xhr.status) {\n case 403:\n // console.log(\"Forbidden\");\n reject();\n break;\n case 400:\n // console.log(\"Bad Request\");\n reject();\n break;\n case 204:\n //console.log(\"successfully sent file \" + xhr.responseText);\n //console.log(\"File \" + fileName +\", \" + file_id +\" placed on server\");\n resolve();\n break;\n default:\n // console.log(\"This case should never happen\");\n reject();\n }\n }.bind(this);\n xhr.onerror = function () {\n // console.log(\"error sending file\" + xhr.responseText);\n reject();\n };\n xhr.send(data);\n }\n\n async showCodelens() {\n let clMess = \"\";\n if (this.codelens.style.display == \"none\") {\n this.codelens.style.display = \"block\";\n clMess = \"Building your visualization\";\n this.codelens.innerHTML = clMess;\n this.clButton.innerText = $.i18n(\"msg_activecode_hide_codelens\");\n } else {\n this.codelens.style.display = \"none\";\n this.clButton.innerText = $.i18n(\"msg_activecode_show_in_codelens\");\n return;\n }\n var cl = this.codelens.firstChild;\n if (cl) {\n this.codelens.removeChild(cl);\n this.codelens.innerHTML = clMess;\n }\n var code = await this.buildProg(false);\n if (code.match(/System.exit/)) {\n alert(\n \"Sorry... System.exit breaks the visualizer temporarily removing\"\n );\n code = code.replace(/System.exit\$\\d+\$;/, \"\");\n }\n var myVars = {};\n myVars.code = code;\n myVars.lang = this.language;\n if (this.stdin) {\n myVars.stdin = $(this.stdin_el).val();\n }\n var targetDiv = this.codelens.id;\n\n let request = new Request(\"/runestone/proxy/pytutor_trace\", {\n method: \"POST\",\n body: JSON.stringify(myVars),\n headers: this.jsonHeaders,\n });\n try {\n let response = await fetch(request);\n let data = await response.json();\n let vis = addVisualizerToPage(data, targetDiv, {\n startingInstruction: 0,\n editCodeBaseURL: null,\n hideCode: false,\n lang: myVars.lang,\n });\n } catch (error) {\n let targetDivError = document.getElementById(targetDiv);\n targetDivError.innerHTML =\n \"Sorry, an error occurred while creating your visualization.\";\n console.log(\"Get Trace Failed -- \");\n console.log(error);\n }\n\n this.logBookEvent({\n event: \"codelens\",\n act: \"view\",\n div_id: this.divid,\n });\n }\n\n /**\n * Seperates text into multiple .java files\n * @param {String} text String with muliple java classes needed to be seperated\n * @return {array of objects} .name gives the name of the java file with .java extension\n * .content gives the contents of the file\n /\n parseJavaClasses(text) {\n text = text.trim();\n var found = false;\n var stack = 0;\n var startIndex = 0;\n var classes = [];\n var importIndex = 0;\n var endOfLastCommentBeforeClassBegins = 0;\n for (var i = 0; i < text.length; i++) {\n var char = text.charAt(i);\n if (char === \"/\") {\n i++;\n if (text.charAt(i) === \"/\") {\n i++;\n while (text.charAt(i) !== \"\\n\" && i < text.length) {\n i++;\n }\n if (!found) {\n endOfLastCommentBeforeClassBegins = i;\n }\n } else if (text.charAt(i) == \"\") {\n i++;\n while (\n (text.charAt(i) !== \"*\" ||\n text.charAt(i + 1) !== \"/\") &&\n i + 1 < text.length\n ) {\n i++;\n }\n if (!found) {\n endOfLastCommentBeforeClassBegins = i;\n }\n }\n } else if (char === '\"') {\n i++;\n while (text.charAt(i) !== '\"' && i < text.length) {\n i++;\n }\n } else if (char === \"'\") {\n while (text.charAt(i) !== \"'\" && i < text.length) {\n i++;\n }\n } else if (char === \"(\") {\n var pCount = 1;\n i++;\n while (pCount > 0 && i < text.length) {\n if (text.charAt(i) === \"(\") {\n pCount++;\n } else if (text.charAt(i) === \")\") {\n pCount--;\n }\n i++;\n }\n }\n if (!found && text.charAt(i) === \"{\") {\n startIndex = i;\n found = true;\n stack = 1;\n } else if (found) {\n if (text.charAt(i) === \"{\") {\n stack++;\n }\n if (text.charAt(i) === \"}\") {\n stack--;\n }\n }\n if (found && stack === 0) {\n let endIndex = i + 1;\n var words = text\n .substring(endOfLastCommentBeforeClassBegins, startIndex)\n .trim()\n .split(\" \");\n var className = \"\";\n for (var w = 0; w < words.length; w++) {\n className = words[w];\n if (words[w] === \"extends\" || words[w] === \"implements\") {\n className = words[w - 1];\n w = words.length;\n }\n }\n className = className.trim() + \".java\";\n classes.push({\n name: className,\n content: text.substring(importIndex, endIndex),\n });\n found = false;\n importIndex = endIndex;\n endOfLastCommentBeforeClassBegins = endIndex;\n }\n }\n return classes;\n }\n}\nfunction unescapeHtml(safe) {\n if (safe) {\n return safe\n .replace(/&/g, \"&\")\n .replace(//g, \">\")\n .replace(/"/g, '\"')\n .replace(/'/g, \"'\");\n }\n}\n","/**\n \n MD5 (Message-Digest Algorithm)\n * http://www.webtoolkit.info/\n *\n **/\n\nexport default function MD5(string) {\n function RotateLeft(lValue, iShiftBits) {\n return (lValue << iShiftBits) | (lValue >>> (32 - iShiftBits));\n }\n\n function AddUnsigned(lX, lY) {\n var lX4, lY4, lX8, lY8, lResult;\n lX8 = lX & 0x80000000;\n lY8 = lY & 0x80000000;\n lX4 = lX & 0x40000000;\n lY4 = lY & 0x40000000;\n lResult = (lX & 0x3fffffff) + (lY & 0x3fffffff);\n if (lX4 & lY4) {\n return lResult ^ 0x80000000 ^ lX8 ^ lY8;\n }\n if (lX4 | lY4) {\n if (lResult & 0x40000000) {\n return lResult ^ 0xc0000000 ^ lX8 ^ lY8;\n } else {\n return lResult ^ 0x40000000 ^ lX8 ^ lY8;\n }\n } else {\n return lResult ^ lX8 ^ lY8;\n }\n }\n\n function F(x, y, z) {\n return (x & y) | (~x & z);\n }\n\n function G(x, y, z) {\n return (x & z) | (y & ~z);\n }\n\n function H(x, y, z) {\n return x ^ y ^ z;\n }\n\n function I(x, y, z) {\n return y ^ (x | ~z);\n }\n\n function FF(a, b, c, d, x, s, ac) {\n a = AddUnsigned(a, AddUnsigned(AddUnsigned(F(b, c, d), x), ac));\n return AddUnsigned(RotateLeft(a, s), b);\n }\n\n function GG(a, b, c, d, x, s, ac) {\n a = AddUnsigned(a, AddUnsigned(AddUnsigned(G(b, c, d), x), ac));\n return AddUnsigned(RotateLeft(a, s), b);\n }\n\n function HH(a, b, c, d, x, s, ac) {\n a = AddUnsigned(a, AddUnsigned(AddUnsigned(H(b, c, d), x), ac));\n return AddUnsigned(RotateLeft(a, s), b);\n }\n\n function II(a, b, c, d, x, s, ac) {\n a = AddUnsigned(a, AddUnsigned(AddUnsigned(I(b, c, d), x), ac));\n return AddUnsigned(RotateLeft(a, s), b);\n }\n\n function ConvertToWordArray(string) {\n var lWordCount;\n var lMessageLength = string.length;\n var lNumberOfWords_temp1 = lMessageLength + 8;\n var lNumberOfWords_temp2 =\n (lNumberOfWords_temp1 - (lNumberOfWords_temp1 % 64)) / 64;\n var lNumberOfWords = (lNumberOfWords_temp2 + 1) * 16;\n var lWordArray = Array(lNumberOfWords - 1);\n var lBytePosition = 0;\n var lByteCount = 0;\n while (lByteCount < lMessageLength) {\n lWordCount = (lByteCount - (lByteCount % 4)) / 4;\n lBytePosition = (lByteCount % 4) * 8;\n lWordArray[lWordCount] =\n lWordArray[lWordCount] |\n (string.charCodeAt(lByteCount) << lBytePosition);\n lByteCount++;\n }\n lWordCount = (lByteCount - (lByteCount % 4)) / 4;\n lBytePosition = (lByteCount % 4) * 8;\n lWordArray[lWordCount] =\n lWordArray[lWordCount] | (0x80 << lBytePosition);\n lWordArray[lNumberOfWords - 2] = lMessageLength << 3;\n lWordArray[lNumberOfWords - 1] = lMessageLength >>> 29;\n return lWordArray;\n }\n\n function WordToHex(lValue) {\n var WordToHexValue = \"\",\n WordToHexValue_temp = \"\",\n lByte,\n lCount;\n for (lCount = 0; lCount <= 3; lCount++) {\n lByte = (lValue >>> (lCount * 8)) & 255;\n WordToHexValue_temp = \"0\" + lByte.toString(16);\n WordToHexValue =\n WordToHexValue +\n WordToHexValue_temp.substr(WordToHexValue_temp.length - 2, 2);\n }\n return WordToHexValue;\n }\n\n function Utf8Encode(string) {\n string = string.replace(/\\r\\n/g, \"\\n\");\n var utftext = \"\";\n\n for (var n = 0; n < string.length; n++) {\n var c = string.charCodeAt(n);\n\n if (c < 128) {\n utftext += String.fromCharCode(c);\n } else if (c > 127 && c < 2048) {\n utftext += String.fromCharCode((c >> 6) | 192);\n utftext += String.fromCharCode((c & 63) | 128);\n } else {\n utftext += String.fromCharCode((c >> 12) | 224);\n utftext += String.fromCharCode(((c >> 6) & 63) | 128);\n utftext += String.fromCharCode((c & 63) | 128);\n }\n }\n\n return utftext;\n }\n\n var x = Array();\n var k, AA, BB, CC, DD, a, b, c, d;\n var S11 = 7,\n S12 = 12,\n S13 = 17,\n S14 = 22;\n var S21 = 5,\n S22 = 9,\n S23 = 14,\n S24 = 20;\n var S31 = 4,\n S32 = 11,\n S33 = 16,\n S34 = 23;\n var S41 = 6,\n S42 = 10,\n S43 = 15,\n S44 = 21;\n\n string = Utf8Encode(string);\n\n x = ConvertToWordArray(string);\n\n a = 0x67452301;\n b = 0xefcdab89;\n c = 0x98badcfe;\n d = 0x10325476;\n\n for (k = 0; k < x.length; k += 16) {\n AA = a;\n BB = b;\n CC = c;\n DD = d;\n a = FF(a, b, c, d, x[k + 0], S11, 0xd76aa478);\n d = FF(d, a, b, c, x[k + 1], S12, 0xe8c7b756);\n c = FF(c, d, a, b, x[k + 2], S13, 0x242070db);\n b = FF(b, c, d, a, x[k + 3], S14, 0xc1bdceee);\n a = FF(a, b, c, d, x[k + 4], S11, 0xf57c0faf);\n d = FF(d, a, b, c, x[k + 5], S12, 0x4787c62a);\n c = FF(c, d, a, b, x[k + 6], S13, 0xa8304613);\n b = FF(b, c, d, a, x[k + 7], S14, 0xfd469501);\n a = FF(a, b, c, d, x[k + 8], S11, 0x698098d8);\n d = FF(d, a, b, c, x[k + 9], S12, 0x8b44f7af);\n c = FF(c, d, a, b, x[k + 10], S13, 0xffff5bb1);\n b = FF(b, c, d, a, x[k + 11], S14, 0x895cd7be);\n a = FF(a, b, c, d, x[k + 12], S11, 0x6b901122);\n d = FF(d, a, b, c, x[k + 13], S12, 0xfd987193);\n c = FF(c, d, a, b, x[k + 14], S13, 0xa679438e);\n b = FF(b, c, d, a, x[k + 15], S14, 0x49b40821);\n a = GG(a, b, c, d, x[k + 1], S21, 0xf61e2562);\n d = GG(d, a, b, c, x[k + 6], S22, 0xc040b340);\n c = GG(c, d, a, b, x[k + 11], S23, 0x265e5a51);\n b = GG(b, c, d, a, x[k + 0], S24, 0xe9b6c7aa);\n a = GG(a, b, c, d, x[k + 5], S21, 0xd62f105d);\n d = GG(d, a, b, c, x[k + 10], S22, 0x2441453);\n c = GG(c, d, a, b, x[k + 15], S23, 0xd8a1e681);\n b = GG(b, c, d, a, x[k + 4], S24, 0xe7d3fbc8);\n a = GG(a, b, c, d, x[k + 9], S21, 0x21e1cde6);\n d = GG(d, a, b, c, x[k + 14], S22, 0xc33707d6);\n c = GG(c, d, a, b, x[k + 3], S23, 0xf4d50d87);\n b = GG(b, c, d, a, x[k + 8], S24, 0x455a14ed);\n a = GG(a, b, c, d, x[k + 13], S21, 0xa9e3e905);\n d = GG(d, a, b, c, x[k + 2], S22, 0xfcefa3f8);\n c = GG(c, d, a, b, x[k + 7], S23, 0x676f02d9);\n b = GG(b, c, d, a, x[k + 12], S24, 0x8d2a4c8a);\n a = HH(a, b, c, d, x[k + 5], S31, 0xfffa3942);\n d = HH(d, a, b, c, x[k + 8], S32, 0x8771f681);\n c = HH(c, d, a, b, x[k + 11], S33, 0x6d9d6122);\n b = HH(b, c, d, a, x[k + 14], S34, 0xfde5380c);\n a = HH(a, b, c, d, x[k + 1], S31, 0xa4beea44);\n d = HH(d, a, b, c, x[k + 4], S32, 0x4bdecfa9);\n c = HH(c, d, a, b, x[k + 7], S33, 0xf6bb4b60);\n b = HH(b, c, d, a, x[k + 10], S34, 0xbebfbc70);\n a = HH(a, b, c, d, x[k + 13], S31, 0x289b7ec6);\n d = HH(d, a, b, c, x[k + 0], S32, 0xeaa127fa);\n c = HH(c, d, a, b, x[k + 3], S33, 0xd4ef3085);\n b = HH(b, c, d, a, x[k + 6], S34, 0x4881d05);\n a = HH(a, b, c, d, x[k + 9], S31, 0xd9d4d039);\n d = HH(d, a, b, c, x[k + 12], S32, 0xe6db99e5);\n c = HH(c, d, a, b, x[k + 15], S33, 0x1fa27cf8);\n b = HH(b, c, d, a, x[k + 2], S34, 0xc4ac5665);\n a = II(a, b, c, d, x[k + 0], S41, 0xf4292244);\n d = II(d, a, b, c, x[k + 7], S42, 0x432aff97);\n c = II(c, d, a, b, x[k + 14], S43, 0xab9423a7);\n b = II(b, c, d, a, x[k + 5], S44, 0xfc93a039);\n a = II(a, b, c, d, x[k + 12], S41, 0x655b59c3);\n d = II(d, a, b, c, x[k + 3], S42, 0x8f0ccc92);\n c = II(c, d, a, b, x[k + 10], S43, 0xffeff47d);\n b = II(b, c, d, a, x[k + 1], S44, 0x85845dd1);\n a = II(a, b, c, d, x[k + 8], S41, 0x6fa87e4f);\n d = II(d, a, b, c, x[k + 15], S42, 0xfe2ce6e0);\n c = II(c, d, a, b, x[k + 6], S43, 0xa3014314);\n b = II(b, c, d, a, x[k + 13], S44, 0x4e0811a1);\n a = II(a, b, c, d, x[k + 4], S41, 0xf7537e82);\n d = II(d, a, b, c, x[k + 11], S42, 0xbd3af235);\n c = II(c, d, a, b, x[k + 2], S43, 0x2ad7d2bb);\n b = II(b, c, d, a, x[k + 9], S44, 0xeb86d391);\n a = AddUnsigned(a, AA);\n b = AddUnsigned(b, BB);\n c = AddUnsigned(c, CC);\n d = AddUnsigned(d, DD);\n }\n\n var temp = WordToHex(a) + WordToHex(b) + WordToHex(c) + WordToHex(d);\n\n return temp.toLowerCase();\n}\n","Sk.builtinFiles={\"files\":{\"src/builtin/this.py\":\"s = \\\"\\\"\\\"Gur Mra bs Clguba, ol Gvz Crgref\\n\\nOrnhgvshy vf orggre guna htyl.\\nRkcyvpvg vf orggre guna vzcyvpvg.\\nFvzcyr vf orggre guna pbzcyrk.\\nPbzcyrk vf orggre guna pbzcyvpngrq.\\nSyng vf orggre guna arfgrq.\\nFcnefr vf orggre guna qrafr.\\nErnqnovyvgl pbhagf.\\nFcrpvny pnfrf nera'g fcrpvny rabhtu gb oernx gur ehyrf.\\nNygubhtu cenpgvpnyvgl orngf chevgl.\\nReebef fubhyq arire cnff fvyragyl.\\nHayrff rkcyvpvgyl fvyraprq.\\nVa gur snpr bs nzovthvgl, ershfr gur grzcgngvba gb thrff.\\nGurer fubhyq or bar-- naq cersrenoyl bayl bar --boivbhf jnl gb qb vg.\\nNygubhtu gung jnl znl abg or boivbhf ng svefg hayrff lbh'er Qhgpu.\\nAbj vf orggre guna arire.\\nNygubhtu arire vf bsgra orggre guna evtug abj.\\nVs gur vzcyrzragngvba vf uneq gb rkcynva, vg'f n onq vqrn.\\nVs gur vzcyrzragngvba vf rnfl gb rkcynva, vg znl or n tbbq vqrn.\\nAnzrfcnprf ner bar ubaxvat terng vqrn -- yrg'f qb zber bs gubfr!\\\"\\\"\\\"\\n\\nd = {}\\nfor c in (65, 97):\\n for i in range(26):\\n d[chr(i+c)] = chr((i+13) % 26 + c)\\n\\nprint(\\\"\\\".join([d.get(c, c) for c in s]))\\n\",\"src/lib/BaseHTTPServer.py\":\"import _sk_fail; _sk_fail._(\\\"BaseHTTPServer\\\")\\n\",\"src/lib/Bastion.py\":\"import _sk_fail; _sk_fail._(\\\"Bastion\\\")\\n\",\"src/lib/CGIHTTPServer.py\":\"import _sk_fail; _sk_fail._(\\\"CGIHTTPServer\\\")\\n\",\"src/lib/ConfigParser.py\":\"import _sk_fail; _sk_fail._(\\\"ConfigParser\\\")\\n\",\"src/lib/Cookie.py\":\"import _sk_fail; _sk_fail._(\\\"Cookie\\\")\\n\",\"src/lib/DocXMLRPCServer.py\":\"import _sk_fail; _sk_fail._(\\\"DocXMLRPCServer\\\")\\n\",\"src/lib/HTMLParser.py\":\"import _sk_fail; _sk_fail._(\\\"HTMLParser\\\")\\n\",\"src/lib/MimeWriter.py\":\"import _sk_fail; _sk_fail._(\\\"MimeWriter\\\")\\n\",\"src/lib/Queue.py\":\"import _sk_fail; _sk_fail._(\\\"Queue\\\")\\n\",\"src/lib/SimpleHTTPServer.py\":\"import _sk_fail; _sk_fail._(\\\"SimpleHTTPServer\\\")\\n\",\"src/lib/SimpleXMLRPCServer.py\":\"import _sk_fail; _sk_fail._(\\\"SimpleXMLRPCServer\\\")\\n\",\"src/lib/SocketServer.py\":\"import _sk_fail; _sk_fail._(\\\"SocketServer\\\")\\n\",\"src/lib/StringIO.py\":\"r\\\"\\\"\\\"File-like objects that read from or write to a string buffer.\\n\\nThis implements (nearly) all stdio methods.\\n\\nf = StringIO() # ready for writing\\nf = StringIO(buf) # ready for reading\\nf.close() # explicitly release resources held\\nflag = f.isatty() # always false\\npos = f.tell() # get current position\\nf.seek(pos) # set current position\\nf.seek(pos, mode) # mode 0: absolute; 1: relative; 2: relative to EOF\\nbuf = f.read() # read until EOF\\nbuf = f.read(n) # read up to n bytes\\nbuf = f.readline() # read until end of line ('\\\\n') or EOF\\nlist = f.readlines()# list of f.readline() results until EOF\\nf.truncate([size]) # truncate file at to at most size (default: current pos)\\nf.write(buf) # write at current position\\nf.writelines(list) # for line in list: f.write(line)\\nf.getvalue() # return whole file's contents as a string\\n\\nNotes:\\n- Using a real file is often faster (but less convenient).\\n- There's also a much faster implementation in C, called cStringIO, but\\n it's not subclassable.\\n- fileno() is left unimplemented so that code which uses it triggers\\n an exception early.\\n- Seeking far beyond EOF and then writing will insert real null\\n bytes that occupy space in the buffer.\\n- There's a simple test set (see end of this file).\\n\\\"\\\"\\\"\\n\\nall = [\\\"StringIO\\\"]\\n\\ndef _complain_ifclosed(closed):\\n if closed:\\n raise ValueError(\\\"I/O operation on closed file\\\")\\n\\nclass StringIO:\\n \\\"\\\"\\\"class StringIO([buffer])\\n\\n When a StringIO object is created, it can be initialized to an existing\\n string by passing the string to the constructor. If no string is given,\\n the StringIO will start empty.\\n\\n The StringIO object can accept either Unicode or 8-bit strings, but\\n mixing the two may take some care. If both are used, 8-bit strings that\\n cannot be interpreted as 7-bit ASCII (that use the 8th bit) will cause\\n a UnicodeError to be raised when getvalue() is called.\\n \\\"\\\"\\\"\\n def init(self, buf = ''):\\n # Force self.buf to be a string or unicode\\n if not isinstance(buf, str):\\n buf = str(buf)\\n self.buf = buf\\n self.len = len(buf)\\n self.buflist = []\\n self.pos = 0\\n self.closed = False\\n self.softspace = 0\\n\\n def iter(self):\\n return self\\n\\n def next(self):\\n \\\"\\\"\\\"A file object is its own iterator, for example iter(f) returns f\\n (unless f is closed). When a file is used as an iterator, typically\\n in a for loop (for example, for line in f: print line), the next()\\n method is called repeatedly. This method returns the next input line,\\n or raises StopIteration when EOF is hit.\\n \\\"\\\"\\\"\\n _complain_ifclosed(self.closed)\\n r = self.readline()\\n if not r:\\n raise StopIteration\\n return r\\n\\n def close(self):\\n \\\"\\\"\\\"Free the memory buffer.\\n \\\"\\\"\\\"\\n if not self.closed:\\n self.closed = True\\n self.buf = None\\n self.pos = None\\n\\n def isatty(self):\\n \\\"\\\"\\\"Returns False because StringIO objects are not connected to a\\n tty-like device.\\n \\\"\\\"\\\"\\n _complain_ifclosed(self.closed)\\n return False\\n\\n def seek(self, pos, mode = 0):\\n \\\"\\\"\\\"Set the file's current position.\\n\\n The mode argument is optional and defaults to 0 (absolute file\\n positioning); other values are 1 (seek relative to the current\\n position) and 2 (seek relative to the file's end).\\n\\n There is no return value.\\n \\\"\\\"\\\"\\n _complain_ifclosed(self.closed)\\n if self.buflist:\\n self.buf += ''.join(self.buflist)\\n self.buflist = []\\n if mode == 1:\\n pos += self.pos\\n elif mode == 2:\\n pos += self.len\\n self.pos = max(0, pos)\\n\\n def tell(self):\\n \\\"\\\"\\\"Return the file's current position.\\\"\\\"\\\"\\n _complain_ifclosed(self.closed)\\n return self.pos\\n\\n def read(self, n = -1):\\n \\\"\\\"\\\"Read at most size bytes from the file\\n (less if the read hits EOF before obtaining size bytes).\\n\\n If the size argument is negative or omitted, read all data until EOF\\n is reached. The bytes are returned as a string object. An empty\\n string is returned when EOF is encountered immediately.\\n \\\"\\\"\\\"\\n _complain_ifclosed(self.closed)\\n if self.buflist:\\n self.buf += ''.join(self.buflist)\\n self.buflist = []\\n if n is None or n < 0:\\n newpos = self.len\\n else:\\n newpos = min(self.pos+n, self.len)\\n r = self.buf[self.pos:newpos]\\n self.pos = newpos\\n return r\\n\\n def readline(self, length=None):\\n r\\\"\\\"\\\"Read one entire line from the file.\\n\\n A trailing newline character is kept in the string (but may be absent\\n when a file ends with an incomplete line). If the size argument is\\n present and non-negative, it is a maximum byte count (including the\\n trailing newline) and an incomplete line may be returned.\\n\\n An empty string is returned only when EOF is encountered immediately.\\n\\n Note: Unlike stdio's fgets(), the returned string contains null\\n characters ('\\\\0') if they occurred in the input.\\n \\\"\\\"\\\"\\n _complain_ifclosed(self.closed)\\n if self.buflist:\\n self.buf += ''.join(self.buflist)\\n self.buflist = []\\n i = self.buf.find('\\\\n', self.pos)\\n if i < 0:\\n newpos = self.len\\n else:\\n newpos = i+1\\n if length is not None and length >= 0:\\n if self.pos + length < newpos:\\n newpos = self.pos + length\\n r = self.buf[self.pos:newpos]\\n self.pos = newpos\\n return r\\n\\n def readlines(self, sizehint = 0):\\n \\\"\\\"\\\"Read until EOF using readline() and return a list containing the\\n lines thus read.\\n\\n If the optional sizehint argument is present, instead of reading up\\n to EOF, whole lines totalling approximately sizehint bytes (or more\\n to accommodate a final whole line).\\n \\\"\\\"\\\"\\n total = 0\\n lines = []\\n line = self.readline()\\n while line:\\n lines.append(line)\\n total += len(line)\\n if 0 < sizehint <= total:\\n break\\n line = self.readline()\\n return lines\\n\\n def truncate(self, size=None):\\n \\\"\\\"\\\"Truncate the file's size.\\n\\n If the optional size argument is present, the file is truncated to\\n (at most) that size. The size defaults to the current position.\\n The current file position is not changed unless the position\\n is beyond the new file size.\\n\\n If the specified size exceeds the file's current size, the\\n file remains unchanged.\\n \\\"\\\"\\\"\\n _complain_ifclosed(self.closed)\\n if size is None:\\n size = self.pos\\n elif size < 0:\\n raise IOError(22, \\\"Negative size not allowed\\\")\\n elif size < self.pos:\\n self.pos = size\\n self.buf = self.getvalue()[:size]\\n self.len = size\\n\\n def write(self, s):\\n \\\"\\\"\\\"Write a string to the file.\\n\\n There is no return value.\\n \\\"\\\"\\\"\\n _complain_ifclosed(self.closed)\\n if not s: return\\n # Force s to be a string or unicode\\n if not isinstance(s, str):\\n s = str(s)\\n spos = self.pos\\n slen = self.len\\n if spos == slen:\\n self.buflist.append(s)\\n self.len = self.pos = spos + len(s)\\n return\\n if spos > slen:\\n self.buflist.append('\\\\0'(spos - slen))\\n slen = spos\\n newpos = spos + len(s)\\n if spos < slen:\\n if self.buflist:\\n self.buf += ''.join(self.buflist)\\n self.buflist = [self.buf[:spos], s, self.buf[newpos:]]\\n self.buf = ''\\n if newpos > slen:\\n slen = newpos\\n else:\\n self.buflist.append(s)\\n slen = newpos\\n self.len = slen\\n self.pos = newpos\\n\\n def writelines(self, iterable):\\n \\\"\\\"\\\"Write a sequence of strings to the file. The sequence can be any\\n iterable object producing strings, typically a list of strings. There\\n is no return value.\\n\\n (The name is intended to match readlines(); writelines() does not add\\n line separators.)\\n \\\"\\\"\\\"\\n write = self.write\\n for line in iterable:\\n write(line)\\n\\n def flush(self):\\n \\\"\\\"\\\"Flush the internal buffer\\n \\\"\\\"\\\"\\n _complain_ifclosed(self.closed)\\n\\n def getvalue(self):\\n \\\"\\\"\\\"\\n Retrieve the entire contents of the \\\"file\\\" at any time before\\n the StringIO object's close() method is called.\\n\\n The StringIO object can accept either Unicode or 8-bit strings,\\n but mixing the two may take some care. If both are used, 8-bit\\n strings that cannot be interpreted as 7-bit ASCII (that use the\\n 8th bit) will cause a UnicodeError to be raised when getvalue()\\n is called.\\n \\\"\\\"\\\"\\n _complain_ifclosed(self.closed)\\n if self.buflist:\\n self.buf += ''.join(self.buflist)\\n self.buflist = []\\n return self.buf\\n\",\"src/lib/UserDict.py\":\"import _sk_fail; _sk_fail._(\\\"UserDict\\\")\\n\",\"src/lib/UserList.py\":\"import _sk_fail; _sk_fail._(\\\"UserList\\\")\\n\",\"src/lib/UserString.py\":\"import _sk_fail; _sk_fail._(\\\"UserString\\\")\\n\",\"src/lib/_LWPCookieJar.py\":\"import _sk_fail; _sk_fail._(\\\"_LWPCookieJar\\\")\\n\",\"src/lib/_MozillaCookieJar.py\":\"import _sk_fail; _sk_fail._(\\\"_MozillaCookieJar\\\")\\n\",\"src/lib/future.py\":\"import _sk_fail;_sk_fail._(\\\"future\\\")\\n\",\"src/lib/phello.foo.py\":\"import _sk_fail; _sk_fail._(\\\"phello.foo\\\")\\n\",\"src/lib/_abcoll.py\":\"import _sk_fail; _sk_fail._(\\\"_abcoll\\\")\\n\",\"src/lib/_sk_fail.py\":\"class NotImplementedImportError(ImportError, NotImplementedError): pass\\n\\ndef _(name):\\n msg = \\\"{} is not yet implemented in Skulpt\\\".format(name)\\n raise NotImplementedImportError(msg, name=name)\\n\",\"src/lib/_threading_local.py\":\"import _sk_fail; _sk_fail._(\\\"_threading_local\\\")\\n\",\"src/lib/abc.py\":\"import _sk_fail; _sk_fail._(\\\"abc\\\")\\n\",\"src/lib/aifc.py\":\"import _sk_fail; _sk_fail._(\\\"aifc\\\")\\n\",\"src/lib/altair/init.py\":\"import random\\n\\ntry:\\n from vega_caller import render_graph\\nexcept:\\n print(\\\"Mock render\\\")\\n\\n def render_graph(js):\\n print(js)\\n\\n\\nclass Chart:\\n # TODO allow data to be specified as a URL to a CSV or DB or json\\n def init(self, data, title=None):\\n self.title = title\\n self.data_id = random.randrange(1000000, 5000000)\\n self.dsname = \\\"data-{}\\\".format(self.data_id)\\n if isinstance(data, dict):\\n self.data = Data(data)\\n else:\\n self.data = data\\n\\n self.json = {}\\n self.json[\\\"$schema\\\"] = \\\"https://vega.github.io/schema/vega-lite/v2.5.json\\\"\\n self.json[\\\"data\\\"] = {}\\n if self.title:\\n self.json[\\\"title\\\"] = self.title\\n\\n self.json[\\\"data\\\"] = {\\\"values\\\": self.data.vals}\\n self.is_composite = False\\n\\n # mark can be a simple string or a dictionary\\n # \\\"mark\\\": {\\\"color\\\": \\\"green\\\", \\\"opacity\\\": 0.2, \\\"type\\\": \\\"rect\\\"}\\n\\n def mark_json(self, mark_type, kwargs):\\n if kwargs:\\n self.json[\\\"mark\\\"] = {}\\n self.json[\\\"mark\\\"][\\\"type\\\"] = mark_type\\n self.json[\\\"mark\\\"].update(kwargs)\\n else:\\n self.json[\\\"mark\\\"] = mark_type\\n\\n return self\\n\\n def mark_bar(self, kwargs):\\n return self.mark_json(\\\"bar\\\", kwargs)\\n\\n def mark_point(self, kwargs):\\n return self.mark_json(\\\"point\\\", kwargs)\\n\\n def mark_line(self, kwargs):\\n return self.mark_json(\\\"line\\\", kwargs)\\n\\n def mark_rect(self, kwargs):\\n return self.mark_json(\\\"rect\\\", kwargs)\\n\\n def mark_area(self, kwargs):\\n return self.mark_json(\\\"area\\\", kwargs)\\n\\n def mark_tick(self, kwargs):\\n return self.mark_json(\\\"tick\\\", kwargs)\\n\\n def encode(self, x=\\\"\\\", y=\\\"\\\", color=\\\"\\\", size=\\\"\\\", tooltip=\\\"\\\"):\\n self.encoding = {}\\n if x:\\n if isinstance(x, Axis):\\n self.encoding[\\\"x\\\"] = x.toJson()\\n else:\\n self.encoding[\\\"x\\\"] = Axis(x).toJson()\\n if y:\\n if isinstance(y, Axis):\\n self.encoding[\\\"y\\\"] = y.toJson()\\n else:\\n self.encoding[\\\"y\\\"] = Axis(y).toJson()\\n\\n # \\\"color\\\": {\\\"type\\\": \\\"nominal\\\", \\\"field\\\": \\\"species\\\"}\\n if color:\\n field, tp = _get_name_type(color)\\n self.encoding[\\\"color\\\"] = dict(type=tp, field=field)\\n\\n # \\\"size\\\": {\\\"type\\\": \\\"quantitative\\\", \\\"field\\\": \\\"Acceleration\\\"}\\n if size:\\n field, tp = _get_name_type(size)\\n self.encoding[\\\"size\\\"] = dict(type=tp, field=field)\\n\\n if tooltip:\\n field, tp = _get_name_type(tooltip)\\n self.encoding[\\\"tooltip\\\"] = dict(type=tp, field=field)\\n\\n self.json[\\\"encoding\\\"] = self.encoding\\n return self\\n\\n def interactive(self):\\n iconfig = {\\n \\\"selector002\\\": {\\n \\\"type\\\": \\\"interval\\\",\\n \\\"bind\\\": \\\"scales\\\",\\n \\\"encodings\\\": [\\\"x\\\", \\\"y\\\"],\\n \\\"on\\\": \\\"[mousedown, window:mouseup] > window:mousemove!\\\",\\n \\\"translate\\\": \\\"[mousedown, window:mouseup] > window:mousemove!\\\",\\n \\\"zoom\\\": \\\"wheel!\\\",\\n \\\"mark\\\": {\\\"fill\\\": \\\"#333\\\", \\\"fillOpacity\\\": 0.125, \\\"stroke\\\": \\\"white\\\"},\\n \\\"resolve\\\": \\\"global\\\",\\n }\\n }\\n self.json[\\\"selection\\\"] = iconfig\\n return self\\n\\n def display(self):\\n render_graph(self.json)\\n\\n def add(self, other):\\n return self.add_layer(other, \\\"layer\\\")\\n\\n def and(self, other):\\n return self.add_layer(other, \\\"vconcat\\\")\\n\\n def or(self, other):\\n return self.add_layer(other, \\\"hconcat\\\")\\n\\n def add_layer(self, other, lname):\\n # multle layers are added by concatenating the new element to the\\n # existing layer. If the layer does not exist then initialize\\n # it from self.\\n if lname not in self.json:\\n self.json[lname] = []\\n self.json[\\\"datasets\\\"] = {}\\n temp = {}\\n temp[\\\"data\\\"] = {\\\"name\\\": self.dsname}\\n self.json[\\\"datasets\\\"][self.dsname] = self.json[\\\"data\\\"][\\\"values\\\"]\\n del self.json[\\\"data\\\"]\\n temp[\\\"encoding\\\"] = self.json[\\\"encoding\\\"]\\n del self.json[\\\"encoding\\\"]\\n temp[\\\"mark\\\"] = self.json[\\\"mark\\\"]\\n del self.json[\\\"mark\\\"]\\n self.json[lname].append(temp)\\n temp = {}\\n self.json[\\\"datasets\\\"][other.dsname] = other.json[\\\"data\\\"][\\\"values\\\"]\\n temp[\\\"data\\\"] = {\\\"name\\\": other.dsname}\\n temp[\\\"encoding\\\"] = other.json[\\\"encoding\\\"]\\n temp[\\\"mark\\\"] = other.json[\\\"mark\\\"]\\n self.json[lname].append(temp)\\n return self\\n\\n\\n# \\\"datasets\\\": {\\n# \\\"data-e56e43354d9b8f2ab0d1e90cf27cd47f\\\": [\\n# {\\\"a\\\": 4, \\\"b\\\": 1, \\\"c\\\": \\\"r\\\"},\\n# {\\\"a\\\": 5, \\\"b\\\": 2, \\\"c\\\": \\\"g\\\"},\\n# {\\\"a\\\": 6, \\\"b\\\": 3, \\\"c\\\": \\\"b\\\"}\\n# ],\\n# \\\"data-a4c3047a15bf9380c2e615cf87648369\\\": [\\n# {\\\"a\\\": 1, \\\"b\\\": 4, \\\"c\\\": \\\"r\\\"},\\n# {\\\"a\\\": 2, \\\"b\\\": 5, \\\"c\\\": \\\"g\\\"},\\n# {\\\"a\\\": 3, \\\"b\\\": 6, \\\"c\\\": \\\"b\\\"}\\n# ]\\n# }\\n\\n# TODO: add a rect mark type for a heat map\\n\\n\\ndef _get_name_type(name):\\n typed = {\\\"Q\\\": \\\"quantitative\\\", \\\"O\\\": \\\"ordinal\\\", \\\"N\\\": \\\"nominal\\\", \\\"T\\\": \\\"temporal\\\"}\\n nt = name.split(\\\":\\\")\\n tstring = \\\"quantitative\\\"\\n if len(nt) == 2:\\n tstring = typed[nt[1]]\\n return nt[0], tstring\\n\\n\\nclass Axis:\\n def init(self, name, bin=False):\\n self.aggregate = None\\n self.name, self.type = _get_name_type(name)\\n if \\\"()\\\" in self.name: # aggregate function\\n self.aggregate = self.name.replace(\\\"()\\\", \\\"\\\")\\n self.name = None\\n self.bin = bin\\n\\n def toJson(self):\\n json = {}\\n if self.name:\\n json[\\\"field\\\"] = self.name\\n if self.type:\\n json[\\\"type\\\"] = self.type\\n if self.bin:\\n json[\\\"bin\\\"] = True\\n if self.aggregate:\\n json[\\\"aggregate\\\"] = self.aggregate\\n\\n return json\\n\\n\\nclass X(Axis):\\n pass\\n\\n\\nclass Y(Axis):\\n pass\\n\\n\\nclass Data:\\n def init(self, kwargs):\\n \\\"\\\"\\\"\\n input can be the form of a series of keyword args where\\n the keyword is the column name, or a single keyword data\\n that is a list of json style records as rows.\\n could also accept a csv file? or keywords columns and rows\\n This accepts a lot more options that \\\"real altair\\\" to make it easier\\n to work with non-DataFrame data sets. Internally:\\n self.keys contains the list of column names\\n self.vals is a list of dictionaries of the form [{col1:val1, col2:val2, ... coln:valn},\\n {col1:val3, col2:val4, ... coln:valn},\\n {col1:val5, col2:val6, ... coln:valn}]\\n \\\"\\\"\\\"\\n # todo: accept a URL as the argument to read a CSV or JSON file\\n if len(kwargs) == 1 and \\\"data\\\" in kwargs:\\n self.data = kwargs[\\\"data\\\"]\\n self.keys = self.data[0].keys()\\n self.vals = self.data\\n elif len(kwargs) == 2 and (\\\"columns\\\" in kwargs) and (\\\"rows\\\" in kwargs):\\n self.keys = kwargs[\\\"columns\\\"]\\n self.vals = []\\n for r in kwargs[\\\"rows\\\"]:\\n self.vals.append(dict(zip(self.keys, r)))\\n else:\\n keys = kwargs.keys()\\n vals = []\\n primary_key = list(keys)[0]\\n for ix in range(len(kwargs[primary_key])):\\n d = {}\\n for key in keys:\\n d[key] = kwargs[key][ix]\\n vals.append(d)\\n self.vals = vals\\n self.keys = keys\\n\\n def str(self):\\n # header = \\\"\\\\t\\\".join(self.keys) + \\\"\\\\n\\\"\\n header = \\\"\\\"\\n for key in self.keys:\\n header += key.center(10) + \\\" \\\"\\n header += \\\"\\\\n\\\"\\n template = \\\"\\\"\\n for key in self.keys:\\n template += \\\"{\\\" + key + \\\": <10} \\\"\\n template += \\\"\\\\n\\\"\\n res = \\\"\\\"\\n for row in self.vals:\\n res += template.format(row)\\n\\n return header + res\\n\\n\\nif name == \\\"main\\\":\\n d = Data(a=[3, 4, 5], b=[1, 2, 3], c=[\\\"r\\\", \\\"g\\\", \\\"b\\\"])\\n print(d)\\n print(\\n type(\\n Chart({\\\"a\\\": list(\\\"abc\\\"), \\\"b\\\": [1, 2, 3]}).mark_bar().encode(x=\\\"a:N\\\", y=\\\"b\\\")\\n )\\n )\\n aa = (\\n Chart(Data(a=[3, 4, 5], b=[1, 2, 3], c=[\\\"r\\\", \\\"g\\\", \\\"b\\\"]))\\n .mark_point(color=\\\"red\\\")\\n .encode(x=\\\"b\\\", y=\\\"a\\\", color=\\\"c:O\\\")\\n )\\n print(\\\"aa = \\\", aa)\\n aa.display()\\n\\n bb = (\\n Chart(Data(a=[1, 2, 3], b=[4, 5, 6], c=[\\\"r\\\", \\\"g\\\", \\\"b\\\"]))\\n .mark_line()\\n .encode(x=\\\"b\\\", y=\\\"a\\\", color=\\\"c:O\\\")\\n )\\n print(\\\"bb = \\\", bb)\\n bb.display()\\n print(\\\"aa+bb\\\", (aa + bb).display())\\n # Chart(Data(a=[1,2,3,2,2,4,5,5,6,7,8,8,8,8,8,9,0,0])).mark_bar().encode(Axis('a:Q', bin=True),y='count()')\\n\\n\\n# todo: see if I can work with the repr of an object to get the behavior that altair gets in notebooks\\n# todo: implement a Bin object to specifiy maxbins\\n\",\"src/lib/antigravity.py\":\"import webbrowser\\n\\nwebbrowser.open(\\\"https://xkcd.com/353/\\\")\\n\",\"src/lib/anydbm.py\":\"import _sk_fail; _sk_fail._(\\\"anydbm\\\")\\n\",\"src/lib/ast.py\":\"import _sk_fail; _sk_fail._(\\\"ast\\\")\\n\",\"src/lib/asynchat.py\":\"import _sk_fail; _sk_fail._(\\\"asynchat\\\")\\n\",\"src/lib/asyncore.py\":\"import _sk_fail; _sk_fail._(\\\"asyncore\\\")\\n\",\"src/lib/atexit.py\":\"import _sk_fail; _sk_fail._(\\\"atexit\\\")\\n\",\"src/lib/audiodev.py\":\"import _sk_fail; _sk_fail._(\\\"audiodev\\\")\\n\",\"src/lib/base64.py\":\"import _sk_fail; _sk_fail._(\\\"base64\\\")\\n\",\"src/lib/bdb.py\":\"import _sk_fail; _sk_fail._(\\\"bdb\\\")\\n\",\"src/lib/binhex.py\":\"import _sk_fail; _sk_fail._(\\\"binhex\\\")\\n\",\"src/lib/bisect.py\":\"\\\"\\\"\\\"Bisection algorithms.\\\"\\\"\\\"\\n\\ndef insort_right(a, x, lo=0, hi=None):\\n \\\"\\\"\\\"Insert item x in list a, and keep it sorted assuming a is sorted.\\n\\n If x is already in a, insert it to the right of the rightmost x.\\n\\n Optional args lo (default 0) and hi (default len(a)) bound the\\n slice of a to be searched.\\n \\\"\\\"\\\"\\n\\n if lo < 0:\\n raise ValueError('lo must be non-negative')\\n if hi is None:\\n hi = len(a)\\n while lo < hi:\\n mid = (lo+hi)//2\\n if x < a[mid]: hi = mid\\n else: lo = mid+1\\n a.insert(lo, x)\\n\\ndef bisect_right(a, x, lo=0, hi=None):\\n \\\"\\\"\\\"Return the index where to insert item x in list a, assuming a is sorted.\\n\\n The return value i is such that all e in a[:i] have e <= x, and all e in\\n a[i:] have e > x. So if x already appears in the list, a.insert(x) will\\n insert just after the rightmost x already there.\\n\\n Optional args lo (default 0) and hi (default len(a)) bound the\\n slice of a to be searched.\\n \\\"\\\"\\\"\\n\\n if lo < 0:\\n raise ValueError('lo must be non-negative')\\n if hi is None:\\n hi = len(a)\\n while lo < hi:\\n mid = (lo+hi)//2\\n if x < a[mid]: hi = mid\\n else: lo = mid+1\\n return lo\\n\\ndef insort_left(a, x, lo=0, hi=None):\\n \\\"\\\"\\\"Insert item x in list a, and keep it sorted assuming a is sorted.\\n\\n If x is already in a, insert it to the left of the leftmost x.\\n\\n Optional args lo (default 0) and hi (default len(a)) bound the\\n slice of a to be searched.\\n \\\"\\\"\\\"\\n\\n if lo < 0:\\n raise ValueError('lo must be non-negative')\\n if hi is None:\\n hi = len(a)\\n while lo < hi:\\n mid = (lo+hi)//2\\n if a[mid] < x: lo = mid+1\\n else: hi = mid\\n a.insert(lo, x)\\n\\n\\ndef bisect_left(a, x, lo=0, hi=None):\\n \\\"\\\"\\\"Return the index where to insert item x in list a, assuming a is sorted.\\n\\n The return value i is such that all e in a[:i] have e < x, and all e in\\n a[i:] have e >= x. So if x already appears in the list, a.insert(x) will\\n insert just before the leftmost x already there.\\n\\n Optional args lo (default 0) and hi (default len(a)) bound the\\n slice of a to be searched.\\n \\\"\\\"\\\"\\n\\n if lo < 0:\\n raise ValueError('lo must be non-negative')\\n if hi is None:\\n hi = len(a)\\n while lo < hi:\\n mid = (lo+hi)//2\\n if a[mid] < x: lo = mid+1\\n else: hi = mid\\n return lo\\n\\n# Overwrite above definitions with a fast C implementation\\ntry:\\n from _bisect import \\nexcept ImportError:\\n pass\\n\\n# Create aliases\\nbisect = bisect_right\\ninsort = insort_right\\n\",\"src/lib/bsddb/init.py\":\"import _sk_fail; _sk_fail._(\\\"bsddb\\\")\\n\",\"src/lib/cProfile.py\":\"import _sk_fail; _sk_fail._(\\\"cProfile\\\")\\n\",\"src/lib/cgi.py\":\"import _sk_fail; _sk_fail._(\\\"cgi\\\")\\n\",\"src/lib/cgitb.py\":\"import _sk_fail; _sk_fail._(\\\"cgitb\\\")\\n\",\"src/lib/chunk.py\":\"import _sk_fail; _sk_fail._(\\\"chunk\\\")\\n\",\"src/lib/cmd.py\":\"import _sk_fail; _sk_fail._(\\\"cmd\\\")\\n\",\"src/lib/code.py\":\"import _sk_fail; _sk_fail._(\\\"code\\\")\\n\",\"src/lib/codecs.py\":\"import _sk_fail; _sk_fail._(\\\"codecs\\\")\\n\",\"src/lib/codeop.py\":\"import _sk_fail; _sk_fail._(\\\"codeop\\\")\\n\",\"src/lib/colorsys.py\":\"import _sk_fail; _sk_fail._(\\\"colorsys\\\")\\n\",\"src/lib/commands.py\":\"import _sk_fail; _sk_fail._(\\\"commands\\\")\\n\",\"src/lib/compileall.py\":\"import _sk_fail; _sk_fail._(\\\"compileall\\\")\\n\",\"src/lib/compiler/init.py\":\"import _sk_fail; _sk_fail._(\\\"compiler\\\")\\n\",\"src/lib/config/init.py\":\"import _sk_fail; _sk_fail._(\\\"config\\\")\\n\",\"src/lib/contextlib.py\":\"import _sk_fail; _sk_fail._(\\\"contextlib\\\")\\n\",\"src/lib/cookielib.py\":\"import _sk_fail; _sk_fail._(\\\"cookielib\\\")\\n\",\"src/lib/copy.py\":\"\\\"\\\"\\\"\\nThis file was modified from CPython.\\nCopyright (c) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,\\n2011, 2012, 2013, 2014, 2015 Python Software Foundation; All Rights Reserved\\n\\\"\\\"\\\"\\nimport types\\nclass Error(Exception):\\n pass\\nerror = Error \\nclass _EmptyClass:\\n pass\\ntry:\\n long\\nexcept NameError:\\n long = int\\ntry:\\n bytes\\nexcept NameError:\\n bytes = str\\n\\ndef check_notimplemented_state(x):\\n getstate = getattr(x, \\\"getstate\\\", None)\\n setstate = getattr(x, \\\"setstate\\\", None)\\n initargs = getattr(x, \\\"getinitargs\\\", None)\\n if getstate or setstate or initargs:\\n raise NotImplementedError(\\\"Skulpt does not yet support copying with user-defined getstate, setstate or getinitargs()\\\")\\n\\n\\ndef copy(x):\\n cls = type(x)\\n if callable(x):\\n return x\\n copier = getattr(cls, \\\"copy\\\", None)\\n if copier:\\n return copier(x)\\n if cls in (type(None), int, float, bool, str, bytes, tuple, type, frozenset, long):\\n return x\\n if (cls == list) or (cls == dict) or (cls == set) or (cls == slice):\\n return cls(x)\\n reductor = getattr(x, \\\"__reduce_ex\\\", None)\\n if reductor:\\n rv = reductor(4)\\n else:\\n reductor = getattr(x, \\\"reduce__\\\", None)\\n if reductor:\\n rv = reductor()\\n elif str(cls)[1:6] == \\\"class\\\":\\n check_notimplemented_state(x)\\n copier = _copy_inst\\n return copier(x)\\n else:\\n raise Error(\\\"un(shallow)copyable object of type %s\\\" % cls)\\n if isinstance(rv, str):\\n return x\\n return _reconstruct(x, rv, 0)\\n\\ndef _copy_inst(x):\\n if hasattr(x, 'copy'):\\n return x.copy()\\n if hasattr(x, 'getinitargs'):\\n args = x.getinitargs()\\n y = x.class(args)\\n else:\\n y = _EmptyClass()\\n y.class = x.class\\n if hasattr(x, 'getstate'):\\n state = x.getstate()\\n else:\\n state = x.dict\\n if hasattr(y, 'setstate'):\\n y.setstate(state)\\n else:\\n y.dict.update(state)\\n return y\\n\\nd = _deepcopy_dispatch = {}\\n\\ndef deepcopy(x, memo=None, _nil=[]):\\n \\\"\\\"\\\"Deep copy operation on arbitrary Python objects.\\n See the module's doc string for more info.\\n \\\"\\\"\\\"\\n if memo is None:\\n memo = {}\\n idx = id(x)\\n y = memo.get(idx, _nil)\\n if y is not _nil:\\n return y\\n cls = type(x)\\n copier = _deepcopy_dispatch.get(cls)\\n if copier:\\n y = copier(x, memo)\\n else:\\n try:\\n issc = issubclass(cls, type)\\n except TypeError: # cls is not a class (old Boost; see SF #502085)\\n issc = 0\\n if issc:\\n y = _deepcopy_atomic(x, memo)\\n else:\\n copier = getattr(x, \\\"deepcopy\\\", None)\\n if copier:\\n y = copier(memo)\\n else:\\n reductor = getattr(x, \\\"__reduce_ex\\\", None)\\n if reductor:\\n rv = reductor(2)\\n else:\\n rv = None\\n reductor = getattr(x, \\\"reduce__\\\", None)\\n if reductor:\\n rv = reductor()\\n elif str(cls)[1:6] == \\\"class\\\":\\n check_notimplemented_state(x)\\n copier = _deepcopy_dispatch[\\\"InstanceType\\\"]\\n y = copier(x, memo)\\n else:\\n raise Error(\\n \\\"un(deep)copyable object of type %s\\\" % cls)\\n if rv is not None:\\n y = _reconstruct(x, rv, 1, memo)\\n memo[idx] = y\\n _keep_alive(x, memo) # Make sure x lives at least as long as d\\n return y\\n\\ndef _deepcopy_atomic(x, memo):\\n return x\\nd[type(None)] = _deepcopy_atomic\\n# d[type(Ellipsis)] = _deepcopy_atomic\\nd[type(NotImplemented)] = _deepcopy_atomic\\nd[int] = _deepcopy_atomic\\nd[float] = _deepcopy_atomic\\nd[bool] = _deepcopy_atomic\\nd[complex] = _deepcopy_atomic\\nd[bytes] = _deepcopy_atomic\\nd[str] = _deepcopy_atomic\\n# try:\\n# d[types.CodeType] = _deepcopy_atomic\\n# except AttributeError:\\n# pass\\nd[type] = _deepcopy_atomic\\n# d[types.BuiltinFunctionType] = _deepcopy_atomic\\nd[types.FunctionType] = _deepcopy_atomic\\n# d[weakref.ref] = _deepcopy_atomic\\n\\ndef _deepcopy_list(x, memo):\\n y = []\\n memo[id(x)] = y\\n for a in x:\\n y.append(deepcopy(a, memo))\\n return y\\nd[list] = _deepcopy_list\\n\\ndef _deepcopy_set(x, memo):\\n result = set([]) # make empty set\\n memo[id(x)] = result # register this set in the memo for loop checking\\n for a in x: # go through elements of set\\n result.add(deepcopy(a, memo)) # add the copied elements into the new set\\n return result # return the new set\\nd[set] = _deepcopy_set\\n\\ndef _deepcopy_frozenset(x, memo):\\n result = frozenset(_deepcopy_set(x,memo)) \\n memo[id(x)] = result \\n return result\\nd[frozenset] = _deepcopy_frozenset\\n\\ndef _deepcopy_tuple(x, memo):\\n y = [deepcopy(a, memo) for a in x]\\n # We're not going to put the tuple in the memo, but it's still important we\\n # check for it, in case the tuple contains recursive mutable structures.\\n try:\\n return memo[id(x)]\\n except KeyError:\\n pass\\n for k, j in zip(x, y):\\n if k is not j:\\n y = tuple(y)\\n break\\n else:\\n y = x\\n return y\\nd[tuple] = _deepcopy_tuple\\n\\ndef _deepcopy_dict(x, memo):\\n y = {}\\n memo[id(x)] = y\\n for key, value in x.items():\\n y[deepcopy(key, memo)] = deepcopy(value, memo)\\n return y\\nd[dict] = _deepcopy_dict\\n\\n# def _deepcopy_method(x, memo): # Copy instance methods\\n# y = type(x)(x.im_func, deepcopy(x.im_self, memo), x.im_class);\\n# return y\\nd[types.MethodType] = _deepcopy_atomic\\n\\ndef _deepcopy_inst(x, memo):\\n if hasattr(x, 'deepcopy'):\\n return x.deepcopy(memo)\\n if hasattr(x, 'getinitargs'):\\n args = x.getinitargs()\\n args = deepcopy(args, memo)\\n y = x.class(args)\\n else:\\n y = _EmptyClass()\\n y.class = x.class\\n memo[id(x)] = y\\n if hasattr(x, 'getstate'):\\n state = x.getstate()\\n else:\\n state = x.dict\\n state = deepcopy(state, memo)\\n if hasattr(y, 'setstate'):\\n y.setstate(state)\\n else:\\n y.dict.update(state)\\n return y\\nd[\\\"InstanceType\\\"] = _deepcopy_inst\\n\\ndef _keep_alive(x, memo):\\n \\\"\\\"\\\"Keeps a reference to the object x in the memo.\\n Because we remember objects by their id, we have\\n to assure that possibly temporary objects are kept\\n alive by referencing them.\\n We store a reference at the id of the memo, which should\\n normally not be used unless someone tries to deepcopy\\n the memo itself...\\n \\\"\\\"\\\"\\n try:\\n memo[id(memo)].append(x)\\n except KeyError:\\n # aha, this is the first one :-)\\n memo[id(memo)]=[x]\\n\\ndef _reconstruct(x, info, deep, memo=None):\\n if isinstance(info, str):\\n return x\\n assert isinstance(info, tuple)\\n if memo is None:\\n memo = {}\\n n = len(info)\\n assert n in (2, 3, 4, 5)\\n callable, args = info[:2]\\n if n > 2:\\n state = info[2]\\n else:\\n state = None\\n if n > 3:\\n listiter = info[3]\\n else:\\n listiter = None\\n if n > 4:\\n dictiter = info[4]\\n else:\\n dictiter = None\\n if deep:\\n args = deepcopy(args, memo)\\n y = callable(args)\\n memo[id(x)] = y\\n\\n if state is not None:\\n if deep:\\n state = deepcopy(state, memo)\\n if hasattr(y, 'setstate'):\\n y.setstate(state)\\n else:\\n if isinstance(state, tuple) and len(state) == 2:\\n state, slotstate = state\\n else:\\n slotstate = None\\n if state is not None:\\n y.dict.update(state)\\n if slotstate is not None:\\n for key, value in slotstate.items():\\n setattr(y, key, value)\\n\\n if listiter is not None:\\n for item in listiter:\\n if deep:\\n item = deepcopy(item, memo)\\n y.append(item)\\n if dictiter is not None:\\n for key, value in dictiter:\\n if deep:\\n key = deepcopy(key, memo)\\n value = deepcopy(value, memo)\\n y[key] = value\\n return y\\n\\ndel d\\n\\ndel types\\n\\n# Helper for instance creation without calling init\\nclass _EmptyClass:\\n pass\",\"src/lib/copy_reg.py\":\"import _sk_fail; _sk_fail._(\\\"copy_reg\\\")\\n\",\"src/lib/csv.py\":\"import _sk_fail; _sk_fail._(\\\"csv\\\")\\n\",\"src/lib/ctypes/init.py\":\"import _sk_fail; _sk_fail._(\\\"ctypes\\\")\\n\",\"src/lib/ctypes/macholib/init.py\":\"import _sk_fail; _sk_fail._(\\\"macholib\\\")\\n\",\"src/lib/curses/init.py\":\"import _sk_fail; _sk_fail._(\\\"curses\\\")\\n\",\"src/lib/dbhash.py\":\"import _sk_fail; _sk_fail._(\\\"dbhash\\\")\\n\",\"src/lib/decimal.py\":\"import _sk_fail; _sk_fail._(\\\"decimal\\\")\\n\",\"src/lib/difflib.py\":\"import _sk_fail; _sk_fail._(\\\"difflib\\\")\\n\",\"src/lib/dircache.py\":\"import _sk_fail; _sk_fail._(\\\"dircache\\\")\\n\",\"src/lib/dis.py\":\"import _sk_fail; _sk_fail._(\\\"dis\\\")\\n\",\"src/lib/distutils/init.py\":\"import _sk_fail; _sk_fail._(\\\"distutils\\\")\\n\",\"src/lib/distutils/command/init.py\":\"import _sk_fail; _sk_fail._(\\\"command\\\")\\n\",\"src/lib/distutils/tests/init.py\":\"import _sk_fail; _sk_fail._(\\\"tests\\\")\\n\",\"src/lib/doctest.py\":\"import _sk_fail; _sk_fail._(\\\"doctest\\\")\\n\",\"src/lib/dumbdbm.py\":\"import _sk_fail; _sk_fail._(\\\"dumbdbm\\\")\\n\",\"src/lib/dummy_thread.py\":\"import _sk_fail; _sk_fail._(\\\"dummy_thread\\\")\\n\",\"src/lib/dummy_threading.py\":\"import _sk_fail; _sk_fail._(\\\"dummy_threading\\\")\\n\",\"src/lib/email/init.py\":\"import _sk_fail; _sk_fail._(\\\"email\\\")\\n\",\"src/lib/email/mime/init.py\":\"import _sk_fail; _sk_fail._(\\\"mime\\\")\\n\",\"src/lib/email/test/data/init.py\":\"import _sk_fail; _sk_fail._(\\\"data\\\")\\n\",\"src/lib/encodings/init.py\":\"import _sk_fail; _sk_fail._(\\\"encodings\\\")\\n\",\"src/lib/filecmp.py\":\"import _sk_fail; _sk_fail._(\\\"filecmp\\\")\\n\",\"src/lib/fileinput.py\":\"import _sk_fail; _sk_fail._(\\\"fileinput\\\")\\n\",\"src/lib/fnmatch.py\":\"import _sk_fail; _sk_fail._(\\\"fnmatch\\\")\\n\",\"src/lib/formatter.py\":\"import _sk_fail; _sk_fail._(\\\"formatter\\\")\\n\",\"src/lib/fpformat.py\":\"import _sk_fail; _sk_fail._(\\\"fpformat\\\")\\n\",\"src/lib/fractions.py\":\"import _sk_fail; _sk_fail._(\\\"fractions\\\")\\n\",\"src/lib/ftplib.py\":\"import _sk_fail; _sk_fail._(\\\"ftplib\\\")\\n\",\"src/lib/genericpath.py\":\"import _sk_fail; _sk_fail._(\\\"genericpath\\\")\\n\",\"src/lib/getopt.py\":\"import _sk_fail; _sk_fail._(\\\"getopt\\\")\\n\",\"src/lib/getpass.py\":\"import _sk_fail; _sk_fail._(\\\"getpass\\\")\\n\",\"src/lib/gettext.py\":\"import _sk_fail; _sk_fail._(\\\"gettext\\\")\\n\",\"src/lib/glob.py\":\"import _sk_fail; _sk_fail._(\\\"glob\\\")\\n\",\"src/lib/gzip.py\":\"import _sk_fail; _sk_fail._(\\\"gzip\\\")\\n\",\"src/lib/hashlib.py\":\"import _sk_fail; _sk_fail._(\\\"hashlib\\\")\\n\",\"src/lib/heapq.py\":\"\\\"\\\"\\\"Heap queue algorithm (a.k.a. priority queue).\\n\\nHeaps are arrays for which a[k] <= a[2k+1] and a[k] <= a[2k+2] for\\nall k, counting elements from 0. For the sake of comparison,\\nnon-existing elements are considered to be infinite. The interesting\\nproperty of a heap is that a[0] is always its smallest element.\\n\\nUsage:\\n\\nheap = [] # creates an empty heap\\nheappush(heap, item) # pushes a new item on the heap\\nitem = heappop(heap) # pops the smallest item from the heap\\nitem = heap[0] # smallest item on the heap without popping it\\nheapify(x) # transforms list into a heap, in-place, in linear time\\nitem = heapreplace(heap, item) # pops and returns smallest item, and adds\\n # new item; the heap size is unchanged\\n\\nOur API differs from textbook heap algorithms as follows:\\n\\n- We use 0-based indexing. This makes the relationship between the\\n index for a node and the indexes for its children slightly less\\n obvious, but is more suitable since Python uses 0-based indexing.\\n\\n- Our heappop() method returns the smallest item, not the largest.\\n\\nThese two make it possible to view the heap as a regular Python list\\nwithout surprises: heap[0] is the smallest item, and heap.sort()\\nmaintains the heap invariant!\\n\\\"\\\"\\\"\\n\\n# Original code by Kevin O'Connor, augmented by Tim Peters and Raymond Hettinger\\n\\nabout = \\\"\\\"\\\"Heap queues\\n\\n[explanation by François Pinard]\\n\\nHeaps are arrays for which a[k] <= a[2k+1] and a[k] <= a[2k+2] for\\nall k, counting elements from 0. For the sake of comparison,\\nnon-existing elements are considered to be infinite. The interesting\\nproperty of a heap is that a[0] is always its smallest element.\\n\\nThe strange invariant above is meant to be an efficient memory\\nrepresentation for a tournament. The numbers below are `k', not a[k]:\\n\\n 0\\n\\n 1 2\\n\\n 3 4 5 6\\n\\n 7 8 9 10 11 12 13 14\\n\\n 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30\\n\\n\\nIn the tree above, each cell `k' is topping `2k+1' and `2k+2'. In\\na usual binary tournament we see in sports, each cell is the winner\\nover the two cells it tops, and we can trace the winner down the tree\\nto see all opponents s/he had. However, in many computer applications\\nof such tournaments, we do not need to trace the history of a winner.\\nTo be more memory efficient, when a winner is promoted, we try to\\nreplace it by something else at a lower level, and the rule becomes\\nthat a cell and the two cells it tops contain three different items,\\nbut the top cell \\\"wins\\\" over the two topped cells.\\n\\nIf this heap invariant is protected at all time, index 0 is clearly\\nthe overall winner. The simplest algorithmic way to remove it and\\nfind the \\\"next\\\" winner is to move some loser (let's say cell 30 in the\\ndiagram above) into the 0 position, and then percolate this new 0 down\\nthe tree, exchanging values, until the invariant is re-established.\\nThis is clearly logarithmic on the total number of items in the tree.\\nBy iterating over all items, you get an O(n ln n) sort.\\n\\nA nice feature of this sort is that you can efficiently insert new\\nitems while the sort is going on, provided that the inserted items are\\nnot \\\"better\\\" than the last 0'th element you extracted. This is\\nespecially useful in simulation contexts, where the tree holds all\\nincoming events, and the \\\"win\\\" condition means the smallest scheduled\\ntime. When an event schedule other events for execution, they are\\nscheduled into the future, so they can easily go into the heap. So, a\\nheap is a good structure for implementing schedulers (this is what I\\nused for my MIDI sequencer :-).\\n\\nVarious structures for implementing schedulers have been extensively\\nstudied, and heaps are good for this, as they are reasonably speedy,\\nthe speed is almost constant, and the worst case is not much different\\nthan the average case. However, there are other representations which\\nare more efficient overall, yet the worst cases might be terrible.\\n\\nHeaps are also very useful in big disk sorts. You most probably all\\nknow that a big sort implies producing \\\"runs\\\" (which are pre-sorted\\nsequences, which size is usually related to the amount of CPU memory),\\nfollowed by a merging passes for these runs, which merging is often\\nvery cleverly organised[1]. It is very important that the initial\\nsort produces the longest runs possible. Tournaments are a good way\\nto that. If, using all the memory available to hold a tournament, you\\nreplace and percolate items that happen to fit the current run, you'll\\nproduce runs which are twice the size of the memory for random input,\\nand much better for input fuzzily ordered.\\n\\nMoreover, if you output the 0'th item on disk and get an input which\\nmay not fit in the current tournament (because the value \\\"wins\\\" over\\nthe last output value), it cannot fit in the heap, so the size of the\\nheap decreases. The freed memory could be cleverly reused immediately\\nfor progressively building a second heap, which grows at exactly the\\nsame rate the first heap is melting. When the first heap completely\\nvanishes, you switch heaps and start a new run. Clever and quite\\neffective!\\n\\nIn a word, heaps are useful memory structures to know. I use them in\\na few applications, and I think it is good to keep a `heap' module\\naround. :-)\\n\\n--------------------\\n[1] The disk balancing algorithms which are current, nowadays, are\\nmore annoying than clever, and this is a consequence of the seeking\\ncapabilities of the disks. On devices which cannot seek, like big\\ntape drives, the story was quite different, and one had to be very\\nclever to ensure (far in advance) that each tape movement will be the\\nmost effective possible (that is, will best participate at\\n\\\"progressing\\\" the merge). Some tapes were even able to read\\nbackwards, and this was also used to avoid the rewinding time.\\nBelieve me, real good tape sorts were quite spectacular to watch!\\nFrom all times, sorting has always been a Great Art! :-)\\n\\\"\\\"\\\"\\n\\nall = ['heappush', 'heappop', 'heapify', 'heapreplace',\\n 'nlargest', 'nsmallest', 'heappushpop']\\n\\n\\ndef heappush(heap, item):\\n \\\"\\\"\\\"Push item onto heap, maintaining the heap invariant.\\\"\\\"\\\"\\n heap.append(item)\\n _siftdown(heap, 0, len(heap) - 1)\\n\\n\\ndef heappop(heap):\\n \\\"\\\"\\\"Pop the smallest item off the heap, maintaining the heap invariant.\\\"\\\"\\\"\\n lastelt = heap.pop() # raises appropriate IndexError if heap is empty\\n if heap:\\n returnitem = heap[0]\\n heap[0] = lastelt\\n _siftup(heap, 0)\\n return returnitem\\n return lastelt\\n\\n\\ndef heapreplace(heap, item):\\n \\\"\\\"\\\"Pop and return the current smallest value, and add the new item.\\n\\n This is more efficient than heappop() followed by heappush(), and can be\\n more appropriate when using a fixed-size heap. Note that the value\\n returned may be larger than item! That constrains reasonable uses of\\n this routine unless written as part of a conditional replacement:\\n\\n if item > heap[0]:\\n item = heapreplace(heap, item)\\n \\\"\\\"\\\"\\n returnitem = heap[0] # raises appropriate IndexError if heap is empty\\n heap[0] = item\\n _siftup(heap, 0)\\n return returnitem\\n\\n\\ndef heappushpop(heap, item):\\n \\\"\\\"\\\"Fast version of a heappush followed by a heappop.\\\"\\\"\\\"\\n if heap and heap[0] < item:\\n item, heap[0] = heap[0], item\\n _siftup(heap, 0)\\n return item\\n\\n\\ndef heapify(x):\\n \\\"\\\"\\\"Transform list into a heap, in-place, in O(len(x)) time.\\\"\\\"\\\"\\n n = len(x)\\n # Transform bottom-up. The largest index there's any point to looking at\\n # is the largest with a child index in-range, so must have 2i + 1 < n,\\n # or i < (n-1)/2. If n is even = 2j, this is (2j-1)/2 = j-1/2 so\\n # j-1 is the largest, which is n//2 - 1. If n is odd = 2j+1, this is\\n # (2j+1-1)/2 = j so j-1 is the largest, and that's again n//2-1.\\n for i in reversed(range(n // 2)):\\n _siftup(x, i)\\n\\n\\ndef _heappop_max(heap):\\n \\\"\\\"\\\"Maxheap version of a heappop.\\\"\\\"\\\"\\n lastelt = heap.pop() # raises appropriate IndexError if heap is empty\\n if heap:\\n returnitem = heap[0]\\n heap[0] = lastelt\\n _siftup_max(heap, 0)\\n return returnitem\\n return lastelt\\n\\n\\ndef _heapreplace_max(heap, item):\\n \\\"\\\"\\\"Maxheap version of a heappop followed by a heappush.\\\"\\\"\\\"\\n returnitem = heap[0] # raises appropriate IndexError if heap is empty\\n heap[0] = item\\n _siftup_max(heap, 0)\\n return returnitem\\n\\n\\ndef _heapify_max(x):\\n \\\"\\\"\\\"Transform list into a maxheap, in-place, in O(len(x)) time.\\\"\\\"\\\"\\n n = len(x)\\n for i in reversed(range(n // 2)):\\n _siftup_max(x, i)\\n\\n# 'heap' is a heap at all indices >= startpos, except possibly for pos. pos\\n# is the index of a leaf with a possibly out-of-order value. Restore the\\n# heap invariant.\\n\\n\\ndef _siftdown(heap, startpos, pos):\\n newitem = heap[pos]\\n # Follow the path to the root, moving parents down until finding a place\\n # newitem fits.\\n while pos > startpos:\\n parentpos = (pos - 1) >> 1\\n parent = heap[parentpos]\\n if newitem < parent:\\n heap[pos] = parent\\n pos = parentpos\\n continue\\n break\\n heap[pos] = newitem\\n\\n# The child indices of heap index pos are already heaps, and we want to make\\n# a heap at index pos too. We do this by bubbling the smaller child of\\n# pos up (and so on with that child's children, etc) until hitting a leaf,\\n# then using _siftdown to move the oddball originally at index pos into place.\\n#\\n# We could break out of the loop as soon as we find a pos where newitem <=\\n# both its children, but turns out that's not a good idea, and despite that\\n# many books write the algorithm that way. During a heap pop, the last array\\n# element is sifted in, and that tends to be large, so that comparing it\\n# against values starting from the root usually doesn't pay (= usually doesn't\\n# get us out of the loop early). See Knuth, Volume 3, where this is\\n# explained and quantified in an exercise.\\n#\\n# Cutting the # of comparisons is important, since these routines have no\\n# way to extract \\\"the priority\\\" from an array element, so that intelligence\\n# is likely to be hiding in custom comparison methods, or in array elements\\n# storing (priority, record) tuples. Comparisons are thus potentially\\n# expensive.\\n#\\n# On random arrays of length 1000, making this change cut the number of\\n# comparisons made by heapify() a little, and those made by exhaustive\\n# heappop() a lot, in accord with theory. Here are typical results from 3\\n# runs (3 just to demonstrate how small the variance is):\\n#\\n# Compares needed by heapify Compares needed by 1000 heappops\\n# -------------------------- --------------------------------\\n# 1837 cut to 1663 14996 cut to 8680\\n# 1855 cut to 1659 14966 cut to 8678\\n# 1847 cut to 1660 15024 cut to 8703\\n#\\n# Building the heap by using heappush() 1000 times instead required\\n# 2198, 2148, and 2219 compares: heapify() is more efficient, when\\n# you can use it.\\n#\\n# The total compares needed by list.sort() on the same lists were 8627,\\n# 8627, and 8632 (this should be compared to the sum of heapify() and\\n# heappop() compares): list.sort() is (unsurprisingly!) more efficient\\n# for sorting.\\n\\n\\ndef _siftup(heap, pos):\\n endpos = len(heap)\\n startpos = pos\\n newitem = heap[pos]\\n # Bubble up the smaller child until hitting a leaf.\\n childpos = 2 * pos + 1 # leftmost child position\\n while childpos < endpos:\\n # Set childpos to index of smaller child.\\n rightpos = childpos + 1\\n if rightpos < endpos and not heap[childpos] < heap[rightpos]:\\n childpos = rightpos\\n # Move the smaller child up.\\n heap[pos] = heap[childpos]\\n pos = childpos\\n childpos = 2 * pos + 1\\n # The leaf at pos is empty now. Put newitem there, and bubble it up\\n # to its final resting place (by sifting its parents down).\\n heap[pos] = newitem\\n _siftdown(heap, startpos, pos)\\n\\n\\ndef _siftdown_max(heap, startpos, pos):\\n 'Maxheap variant of _siftdown'\\n newitem = heap[pos]\\n # Follow the path to the root, moving parents down until finding a place\\n # newitem fits.\\n while pos > startpos:\\n parentpos = (pos - 1) >> 1\\n parent = heap[parentpos]\\n if parent < newitem:\\n heap[pos] = parent\\n pos = parentpos\\n continue\\n break\\n heap[pos] = newitem\\n\\n\\ndef _siftup_max(heap, pos):\\n 'Maxheap variant of _siftup'\\n endpos = len(heap)\\n startpos = pos\\n newitem = heap[pos]\\n # Bubble up the larger child until hitting a leaf.\\n childpos = 2 * pos + 1 # leftmost child position\\n while childpos < endpos:\\n # Set childpos to index of larger child.\\n rightpos = childpos + 1\\n if rightpos < endpos and not heap[rightpos] < heap[childpos]:\\n childpos = rightpos\\n # Move the larger child up.\\n heap[pos] = heap[childpos]\\n pos = childpos\\n childpos = 2 * pos + 1\\n # The leaf at pos is empty now. Put newitem there, and bubble it up\\n # to its final resting place (by sifting its parents down).\\n heap[pos] = newitem\\n _siftdown_max(heap, startpos, pos)\\n\\n\\n# Algorithm notes for nlargest() and nsmallest()\\n# ==============================================\\n#\\n# Make a single pass over the data while keeping the k most extreme values\\n# in a heap. Memory consumption is limited to keeping k values in a list.\\n#\\n# Measured performance for random inputs:\\n#\\n# number of comparisons\\n# n inputs k-extreme values (average of 5 trials) % more than min()\\n# ------------- ---------------- --------------------- -----------------\\n# 1,000 100 3,317 231.7%\\n# 10,000 100 14,046 40.5%\\n# 100,000 100 105,749 5.7%\\n# 1,000,000 100 1,007,751 0.8%\\n# 10,000,000 100 10,009,401 0.1%\\n#\\n# Theoretical number of comparisons for k smallest of n random inputs:\\n#\\n# Step Comparisons Action\\n# ---- -------------------------- ---------------------------\\n# 1 1.66 * k heapify the first k-inputs\\n# 2 n - k compare remaining elements to top of heap\\n# 3 k * (1 + lg2(k)) * ln(n/k) replace the topmost value on the heap\\n# 4 k * lg2(k) - (k/2) final sort of the k most extreme values\\n#\\n# Combining and simplifying for a rough estimate gives:\\n#\\n# comparisons = n + k * (log(k, 2) * log(n/k) + log(k, 2) + log(n/k))\\n#\\n# Computing the number of comparisons for step 3:\\n# -----------------------------------------------\\n# * For the i-th new value from the iterable, the probability of being in the\\n# k most extreme values is k/i. For example, the probability of the 101st\\n# value seen being in the 100 most extreme values is 100/101.\\n# * If the value is a new extreme value, the cost of inserting it into the\\n# heap is 1 + log(k, 2).\\n# * The probability times the cost gives:\\n# (k/i) * (1 + log(k, 2))\\n# * Summing across the remaining n-k elements gives:\\n# sum((k/i) * (1 + log(k, 2)) for i in range(k+1, n+1))\\n# * This reduces to:\\n# (H(n) - H(k)) * k * (1 + log(k, 2))\\n# * Where H(n) is the n-th harmonic number estimated by:\\n# gamma = 0.5772156649\\n# H(n) = log(n, e) + gamma + 1 / (2 * n)\\n# http://en.wikipedia.org/wiki/Harmonic_series_(mathematics)#Rate_of_divergence\\n# * Substituting the H(n) formula:\\n# comparisons = k * (1 + log(k, 2)) * (log(n/k, e) + (1/n - 1/k) / 2)\\n#\\n# Worst-case for step 3:\\n# ----------------------\\n# In the worst case, the input data is reversed sorted so that every new element\\n# must be inserted in the heap:\\n#\\n# comparisons = 1.66 * k + log(k, 2) * (n - k)\\n#\\n# Alternative Algorithms\\n# ----------------------\\n# Other algorithms were not used because they:\\n# 1) Took much more auxiliary memory,\\n# 2) Made multiple passes over the data.\\n# 3) Made more comparisons in common cases (small k, large n, semi-random input).\\n# See the more detailed comparison of approach at:\\n# http://code.activestate.com/recipes/577573-compare-algorithms-for-heapqsmallest\\n\\ndef nsmallest(n, iterable, key=None):\\n \\\"\\\"\\\"Find the n smallest elements in a dataset.\\n\\n Equivalent to: sorted(iterable, key=key)[:n]\\n \\\"\\\"\\\"\\n\\n # Short-cut for n==1 is to use min()\\n if n == 1:\\n it = iter(iterable)\\n sentinel = object()\\n result = min(it, default=sentinel, key=key)\\n return [] if result is sentinel else [result]\\n\\n # When n>=size, it's faster to use sorted()\\n try:\\n size = len(iterable)\\n except (TypeError, AttributeError):\\n pass\\n else:\\n if n >= size:\\n return sorted(iterable, key=key)[:n]\\n\\n # When key is none, use simpler decoration\\n if key is None:\\n it = iter(iterable)\\n # put the range(n) first so that zip() doesn't\\n # consume one too many elements from the iterator\\n result = [(elem, i) for i, elem in zip(range(n), it)]\\n if not result:\\n return result\\n _heapify_max(result)\\n top = result[0][0]\\n order = n\\n _heapreplace = _heapreplace_max\\n for elem in it:\\n if elem < top:\\n _heapreplace(result, (elem, order))\\n top, _order = result[0]\\n order += 1\\n result.sort()\\n return [elem for (elem, order) in result]\\n\\n # General case, slowest method\\n it = iter(iterable)\\n result = [(key(elem), i, elem) for i, elem in zip(range(n), it)]\\n if not result:\\n return result\\n _heapify_max(result)\\n top = result[0][0]\\n order = n\\n _heapreplace = _heapreplace_max\\n for elem in it:\\n k = key(elem)\\n if k < top:\\n _heapreplace(result, (k, order, elem))\\n top, _order, _elem = result[0]\\n order += 1\\n result.sort()\\n return [elem for (k, order, elem) in result]\\n\\n\\ndef nlargest(n, iterable, key=None):\\n \\\"\\\"\\\"Find the n largest elements in a dataset.\\n\\n Equivalent to: sorted(iterable, key=key, reverse=True)[:n]\\n \\\"\\\"\\\"\\n\\n # Short-cut for n==1 is to use max()\\n if n == 1:\\n it = iter(iterable)\\n sentinel = object()\\n result = max(it, default=sentinel, key=key)\\n return [] if result is sentinel else [result]\\n\\n # When n>=size, it's faster to use sorted()\\n try:\\n size = len(iterable)\\n except (TypeError, AttributeError):\\n pass\\n else:\\n if n >= size:\\n return sorted(iterable, key=key, reverse=True)[:n]\\n\\n # When key is none, use simpler decoration\\n if key is None:\\n it = iter(iterable)\\n result = [(elem, i) for i, elem in zip(range(0, -n, -1), it)]\\n if not result:\\n return result\\n heapify(result)\\n top = result[0][0]\\n order = -n\\n _heapreplace = heapreplace\\n for elem in it:\\n if top < elem:\\n _heapreplace(result, (elem, order))\\n top, _order = result[0]\\n order -= 1\\n result.sort(reverse=True)\\n return [elem for (elem, order) in result]\\n\\n # General case, slowest method\\n it = iter(iterable)\\n result = [(key(elem), i, elem) for i, elem in zip(range(0, -n, -1), it)]\\n if not result:\\n return result\\n heapify(result)\\n top = result[0][0]\\n order = -n\\n _heapreplace = heapreplace\\n for elem in it:\\n k = key(elem)\\n if top < k:\\n _heapreplace(result, (k, order, elem))\\n top, _order, _elem = result[0]\\n order -= 1\\n result.sort(reverse=True)\\n return [elem for (k, order, elem) in result]\\n\\n\\n# If available, use C implementation\\ntry:\\n from _heapq import \\nexcept ImportError:\\n pass\\ntry:\\n from _heapq import _heapreplace_max\\nexcept ImportError:\\n pass\\ntry:\\n from _heapq import _heapify_max\\nexcept ImportError:\\n pass\\ntry:\\n from _heapq import _heappop_max\\nexcept ImportError:\\n pass\\n\\n\\nif name == \\\"main\\\":\\n\\n import doctest # pragma: no cover\\n print(doctest.testmod()) # pragma: no cover\\n\",\"src/lib/hmac.py\":\"import _sk_fail; _sk_fail._(\\\"hmac\\\")\\n\",\"src/lib/hotshot/init.py\":\"import _sk_fail; _sk_fail._(\\\"hotshot\\\")\\n\",\"src/lib/htmlentitydefs.py\":\"import _sk_fail; _sk_fail._(\\\"htmlentitydefs\\\")\\n\",\"src/lib/htmllib.py\":\"import _sk_fail; _sk_fail._(\\\"htmllib\\\")\\n\",\"src/lib/httplib.py\":\"import _sk_fail; _sk_fail._(\\\"httplib\\\")\\n\",\"src/lib/idlelib/Icons/init.py\":\"import _sk_fail; _sk_fail._(\\\"Icons\\\")\\n\",\"src/lib/idlelib/init.py\":\"import _sk_fail; _sk_fail._(\\\"idlelib\\\")\\n\",\"src/lib/ihooks.py\":\"import _sk_fail; _sk_fail._(\\\"ihooks\\\")\\n\",\"src/lib/imaplib.py\":\"import _sk_fail; _sk_fail._(\\\"imaplib\\\")\\n\",\"src/lib/imghdr.py\":\"import _sk_fail; _sk_fail._(\\\"imghdr\\\")\\n\",\"src/lib/imputil.py\":\"import _sk_fail; _sk_fail._(\\\"imputil\\\")\\n\",\"src/lib/io.py\":\"import _sk_fail; _sk_fail._(\\\"io\\\")\\n\",\"src/lib/json/tests/init.py\":\"import _sk_fail; _sk_fail._(\\\"tests\\\")\\n\",\"src/lib/lib-dynload/init.py\":\"import _sk_fail; _sk_fail._(\\\"lib-dynload\\\")\\n\",\"src/lib/lib-tk/init.py\":\"import _sk_fail; _sk_fail._(\\\"lib-tk\\\")\\n\",\"src/lib/lib2to3/init.py\":\"import _sk_fail; _sk_fail._(\\\"lib2to3\\\")\\n\",\"src/lib/lib2to3/fixes/init.py\":\"import _sk_fail; _sk_fail._(\\\"fixes\\\")\\n\",\"src/lib/lib2to3/pgen2/init.py\":\"import _sk_fail; _sk_fail._(\\\"pgen2\\\")\\n\",\"src/lib/lib2to3/tests/init.py\":\"import _sk_fail; _sk_fail._(\\\"tests\\\")\\n\",\"src/lib/linecache.py\":\"import _sk_fail; _sk_fail._(\\\"linecache\\\")\\n\",\"src/lib/locale.py\":\"import _sk_fail; _sk_fail._(\\\"locale\\\")\\n\",\"src/lib/logging/init.py\":\"import _sk_fail; _sk_fail._(\\\"logging\\\")\\n\",\"src/lib/macpath.py\":\"import _sk_fail; _sk_fail._(\\\"macpath\\\")\\n\",\"src/lib/macurl2path.py\":\"import _sk_fail; _sk_fail._(\\\"macurl2path\\\")\\n\",\"src/lib/mailbox.py\":\"import _sk_fail; _sk_fail._(\\\"mailbox\\\")\\n\",\"src/lib/mailcap.py\":\"import _sk_fail; _sk_fail._(\\\"mailcap\\\")\\n\",\"src/lib/markupbase.py\":\"import _sk_fail; _sk_fail._(\\\"markupbase\\\")\\n\",\"src/lib/md5.py\":\"import _sk_fail; _sk_fail._(\\\"md5\\\")\\n\",\"src/lib/mhlib.py\":\"import _sk_fail; _sk_fail._(\\\"mhlib\\\")\\n\",\"src/lib/mimetools.py\":\"import _sk_fail; _sk_fail._(\\\"mimetools\\\")\\n\",\"src/lib/mimetypes.py\":\"import _sk_fail; _sk_fail._(\\\"mimetypes\\\")\\n\",\"src/lib/mimify.py\":\"import _sk_fail; _sk_fail._(\\\"mimify\\\")\\n\",\"src/lib/modulefinder.py\":\"import _sk_fail; _sk_fail._(\\\"modulefinder\\\")\\n\",\"src/lib/multifile.py\":\"import _sk_fail; _sk_fail._(\\\"multifile\\\")\\n\",\"src/lib/multiprocessing/init.py\":\"import _sk_fail; _sk_fail._(\\\"multiprocessing\\\")\\n\",\"src/lib/multiprocessing/dummy/init.py\":\"import _sk_fail; _sk_fail._(\\\"dummy\\\")\\n\",\"src/lib/mutex.py\":\"import _sk_fail; _sk_fail._(\\\"mutex\\\")\\n\",\"src/lib/netrc.py\":\"import _sk_fail; _sk_fail._(\\\"netrc\\\")\\n\",\"src/lib/new.py\":\"import _sk_fail; _sk_fail._(\\\"new\\\")\\n\",\"src/lib/nntplib.py\":\"import _sk_fail; _sk_fail._(\\\"nntplib\\\")\\n\",\"src/lib/ntpath.py\":\"import _sk_fail; _sk_fail._(\\\"ntpath\\\")\\n\",\"src/lib/nturl2path.py\":\"import _sk_fail; _sk_fail._(\\\"nturl2path\\\")\\n\",\"src/lib/numbers.py\":\"Number = (int, float, complex)\\nIntegral = int\\nComplex = complex\\n\",\"src/lib/opcode.py\":\"import _sk_fail; _sk_fail._(\\\"opcode\\\")\\n\",\"src/lib/optparse.py\":\"import _sk_fail; _sk_fail._(\\\"optparse\\\")\\n\",\"src/lib/os.py\":\"import _sk_fail; _sk_fail._(\\\"os\\\")\\n\",\"src/lib/os2emxpath.py\":\"import _sk_fail; _sk_fail._(\\\"os2emxpath\\\")\\n\",\"src/lib/pdb.py\":\"import _sk_fail; _sk_fail._(\\\"pdb\\\")\\n\",\"src/lib/pickle.py\":\"import _sk_fail; _sk_fail._(\\\"pickle\\\")\\n\",\"src/lib/pickletools.py\":\"import _sk_fail; _sk_fail._(\\\"pickletools\\\")\\n\",\"src/lib/pipes.py\":\"import _sk_fail; _sk_fail._(\\\"pipes\\\")\\n\",\"src/lib/pkgutil.py\":\"import _sk_fail; _sk_fail._(\\\"pkgutil\\\")\\n\",\"src/lib/platform.py\":\"import _sk_fail; _sk_fail._(\\\"platform\\\")\\n\",\"src/lib/plistlib.py\":\"import _sk_fail; _sk_fail._(\\\"plistlib\\\")\\n\",\"src/lib/popen2.py\":\"import _sk_fail; _sk_fail._(\\\"popen2\\\")\\n\",\"src/lib/poplib.py\":\"import _sk_fail; _sk_fail._(\\\"poplib\\\")\\n\",\"src/lib/posixfile.py\":\"import _sk_fail; _sk_fail._(\\\"posixfile\\\")\\n\",\"src/lib/posixpath.py\":\"import _sk_fail; _sk_fail._(\\\"posixpath\\\")\\n\",\"src/lib/pprint.py\":\"import _sk_fail; _sk_fail._(\\\"pprint\\\")\\n\",\"src/lib/profile.py\":\"import _sk_fail; _sk_fail._(\\\"profile\\\")\\n\",\"src/lib/pstats.py\":\"import _sk_fail; _sk_fail._(\\\"pstats\\\")\\n\",\"src/lib/pty.py\":\"import _sk_fail; _sk_fail._(\\\"pty\\\")\\n\",\"src/lib/py_compile.py\":\"import _sk_fail; _sk_fail._(\\\"py_compile\\\")\\n\",\"src/lib/pyclbr.py\":\"import _sk_fail; _sk_fail._(\\\"pyclbr\\\")\\n\",\"src/lib/pydoc.py\":\"import _sk_fail; _sk_fail._(\\\"pydoc\\\")\\n\",\"src/lib/pydoc_topics.py\":\"import _sk_fail; _sk_fail._(\\\"pydoc_topics\\\")\\n\",\"src/lib/pythonds/init.py\":\"\",\"src/lib/pythonds/basic/init.py\":\"\\n#all = [\\\"stack\\\"]\\n\\n\\nfrom .stack import Stack\\nfrom .queue import Queue\\nfrom .deque import Deque\\n\\n\\n\",\"src/lib/pythonds/basic/deque.py\":\"# Bradley N. Miller, David L. Ranum\\n# Introduction to Data Structures and Algorithms in Python\\n# Copyright 2005\\n#\\n# deque.py\\n\\n\\nclass Deque:\\n def init(self):\\n self.items = []\\n\\n def isEmpty(self):\\n return self.items == []\\n\\n def addFront(self, item):\\n self.items.append(item)\\n\\n def addRear(self, item):\\n self.items.insert(0, item)\\n\\n def removeFront(self):\\n return self.items.pop()\\n\\n def removeRear(self):\\n return self.items.pop(0)\\n\\n def size(self):\\n return len(self.items)\\n\",\"src/lib/pythonds/basic/queue.py\":\"# Bradley N. Miller, David L. Ranum\\n# Introduction to Data Structures and Algorithms in Python\\n# Copyright 2005\\n#\\n# queue.py\\n\\n\\nclass Queue:\\n def init(self):\\n self.items = []\\n\\n def isEmpty(self):\\n return self.items == []\\n\\n def enqueue(self, item):\\n self.items.insert(0, item)\\n\\n def dequeue(self):\\n return self.items.pop()\\n\\n def size(self):\\n return len(self.items)\\n\",\"src/lib/pythonds/basic/stack.py\":\"# Bradley N. Miller, David L. Ranum\\n# Introduction to Data Structures and Algorithms in Python\\n# Copyright 2005\\n#\\n# stack.py\\n\\n\\nclass Stack:\\n def init(self):\\n self.items = []\\n\\n def isEmpty(self):\\n return self.items == []\\n\\n def push(self, item):\\n self.items.append(item)\\n\\n def pop(self):\\n return self.items.pop()\\n\\n def peek(self):\\n return self.items[len(self.items) - 1]\\n\\n def size(self):\\n return len(self.items)\\n\",\"src/lib/pythonds/graphs/init.py\":\"\\n\\nfrom .adjGraph import Graph\\nfrom .adjGraph import Vertex\\nfrom .priorityQueue import PriorityQueue\\n\",\"src/lib/pythonds/graphs/adjGraph.py\":\"#\\n# adjGraph\\n#\\n# Created by Brad Miller on 2005-02-24.\\n# Copyright (c) 2005 Brad Miller, David Ranum, Luther College. All rights reserved.\\n#\\n\\nimport sys\\nimport os\\nimport unittest\\n\\nclass Graph:\\n def init(self):\\n self.vertices = {}\\n self.numVertices = 0\\n \\n def addVertex(self,key):\\n self.numVertices = self.numVertices + 1\\n newVertex = Vertex(key)\\n self.vertices[key] = newVertex\\n return newVertex\\n \\n def getVertex(self,n):\\n if n in self.vertices:\\n return self.vertices[n]\\n else:\\n return None\\n\\n def contains(self,n):\\n return n in self.vertices\\n \\n def addEdge(self,f,t,cost=0):\\n if f not in self.vertices:\\n nv = self.addVertex(f)\\n if t not in self.vertices:\\n nv = self.addVertex(t)\\n self.vertices[f].addNeighbor(self.vertices[t],cost)\\n \\n def getVertices(self):\\n return list(self.vertices.keys())\\n \\n def iter(self):\\n return iter(self.vertices.values())\\n \\nclass Vertex:\\n def init(self,num):\\n self.id = num\\n self.connectedTo = {}\\n self.color = 'white'\\n self.dist = sys.maxsize\\n self.pred = None\\n self.disc = 0\\n self.fin = 0\\n\\n # def lt(self,o):\\n # return self.id < o.id\\n \\n def addNeighbor(self,nbr,weight=0):\\n self.connectedTo[nbr] = weight\\n \\n def setColor(self,color):\\n self.color = color\\n \\n def setDistance(self,d):\\n self.dist = d\\n\\n def setPred(self,p):\\n self.pred = p\\n\\n def setDiscovery(self,dtime):\\n self.disc = dtime\\n \\n def setFinish(self,ftime):\\n self.fin = ftime\\n \\n def getFinish(self):\\n return self.fin\\n \\n def getDiscovery(self):\\n return self.disc\\n \\n def getPred(self):\\n return self.pred\\n \\n def getDistance(self):\\n return self.dist\\n \\n def getColor(self):\\n return self.color\\n \\n def getConnections(self):\\n return self.connectedTo.keys()\\n \\n def getWeight(self,nbr):\\n return self.connectedTo[nbr]\\n \\n def str(self):\\n return str(self.id) + \\\":color \\\" + self.color + \\\":disc \\\" + str(self.disc) + \\\":fin \\\" + str(self.fin) + \\\":dist \\\" + str(self.dist) + \\\":pred \\\\n\\\\t[\\\" + str(self.pred)+ \\\"]\\\\n\\\"\\n \\n def getId(self):\\n return self.id\\n\\nclass adjGraphTests(unittest.TestCase):\\n def setUp(self):\\n self.tGraph = Graph()\\n \\n def testMakeGraph(self):\\n gFile = open(\\\"test.dat\\\")\\n for line in gFile:\\n fVertex, tVertex = line.split('|')\\n fVertex = int(fVertex)\\n tVertex = int(tVertex)\\n self.tGraph.addEdge(fVertex,tVertex)\\n for i in self.tGraph:\\n adj = i.getAdj()\\n for k in adj:\\n print(i, k)\\n\\n \\nif name == 'main':\\n unittest.main()\\n \\n\",\"src/lib/pythonds/graphs/priorityQueue.py\":\"# Bradley N. Miller, David L. Ranum\\n# Introduction to Data Structures and Algorithms in Python\\n# Copyright 2005\\n# \\nimport unittest\\n\\n# this implementation of binary heap takes key value pairs,\\n# we will assume that the keys are all comparable\\n\\nclass PriorityQueue:\\n def init(self):\\n self.heapArray = [(0,0)]\\n self.currentSize = 0\\n\\n def buildHeap(self,alist):\\n self.currentSize = len(alist)\\n self.heapArray = [(0,0)]\\n for i in alist:\\n self.heapArray.append(i)\\n i = len(alist) // 2 \\n while (i > 0):\\n self.percDown(i)\\n i = i - 1\\n \\n def percDown(self,i):\\n while (i 2) <= self.currentSize:\\n mc = self.minChild(i)\\n if self.heapArray[i][0] > self.heapArray[mc][0]:\\n tmp = self.heapArray[i]\\n self.heapArray[i] = self.heapArray[mc]\\n self.heapArray[mc] = tmp\\n i = mc\\n \\n def minChild(self,i):\\n if i2 > self.currentSize:\\n return -1\\n else:\\n if i2 + 1 > self.currentSize:\\n return i2\\n else:\\n if self.heapArray[i2][0] < self.heapArray[i2+1][0]:\\n return i2\\n else:\\n return i2+1\\n\\n def percUp(self,i):\\n while i // 2 > 0:\\n if self.heapArray[i][0] < self.heapArray[i//2][0]:\\n tmp = self.heapArray[i//2]\\n self.heapArray[i//2] = self.heapArray[i]\\n self.heapArray[i] = tmp\\n i = i//2\\n \\n def add(self,k):\\n self.heapArray.append(k)\\n self.currentSize = self.currentSize + 1\\n self.percUp(self.currentSize)\\n\\n def delMin(self):\\n retval = self.heapArray[1][1]\\n self.heapArray[1] = self.heapArray[self.currentSize]\\n self.currentSize = self.currentSize - 1\\n self.heapArray.pop()\\n self.percDown(1)\\n return retval\\n \\n def isEmpty(self):\\n if self.currentSize == 0:\\n return True\\n else:\\n return False\\n\\n def decreaseKey(self,val,amt):\\n # this is a little wierd, but we need to find the heap thing to decrease by\\n # looking at its value\\n done = False\\n i = 1\\n myKey = 0\\n while not done and i <= self.currentSize:\\n if self.heapArray[i][1] == val:\\n done = True\\n myKey = i\\n else:\\n i = i + 1\\n if myKey > 0:\\n self.heapArray[myKey] = (amt,self.heapArray[myKey][1])\\n self.percUp(myKey)\\n \\n def contains(self,vtx):\\n for pair in self.heapArray:\\n if pair[1] == vtx:\\n return True\\n return False\\n \\nclass TestBinHeap(unittest.TestCase):\\n def setUp(self):\\n self.theHeap = PriorityQueue()\\n self.theHeap.add((2,'x'))\\n self.theHeap.add((3,'y'))\\n self.theHeap.add((5,'z'))\\n self.theHeap.add((6,'a'))\\n self.theHeap.add((4,'d'))\\n\\n\\n def testInsert(self):\\n assert self.theHeap.currentSize == 5\\n\\n def testDelmin(self):\\n assert self.theHeap.delMin() == 'x'\\n assert self.theHeap.delMin() == 'y'\\n \\n def testDecKey(self):\\n self.theHeap.decreaseKey('d',1)\\n assert self.theHeap.delMin() == 'd'\\n \\nif name == 'main':\\n unittest.main()\\n\",\"src/lib/pythonds/trees/init.py\":\"\\nfrom .binaryTree import BinaryTree\\nfrom .balance import AVLTree\\nfrom .bst import BinarySearchTree\\nfrom .binheap import BinHeap\\n\\n\\n\",\"src/lib/pythonds/trees/balance.py\":\"#!/bin/env python3.1\\n# Bradley N. Miller, David L. Ranum\\n# Introduction to Data Structures and Algorithms in Python\\n# Copyright 2005, 2010\\n# \\n\\nfrom .bst import BinarySearchTree, TreeNode\\n\\nclass AVLTree(BinarySearchTree):\\n '''\\n Author: Brad Miller\\n Date: 1/15/2005\\n Description: Imlement a binary search tree with the following interface\\n functions: \\n contains(y) <==> y in x\\n getitem(y) <==> x[y]\\n init()\\n len() <==> len(x)\\n setitem(k,v) <==> x[k] = v\\n clear()\\n get(k)\\n has_key(k)\\n items() \\n keys() \\n values()\\n put(k,v)\\n '''\\n\\n\\n def _put(self,key,val,currentNode):\\n if key < currentNode.key:\\n if currentNode.hasLeftChild():\\n self._put(key,val,currentNode.leftChild)\\n else:\\n currentNode.leftChild = TreeNode(key,val,parent=currentNode)\\n self.updateBalance(currentNode.leftChild)\\n else:\\n if currentNode.hasRightChild():\\n self._put(key,val,currentNode.rightChild)\\n else:\\n currentNode.rightChild = TreeNode(key,val,parent=currentNode)\\n self.updateBalance(currentNode.rightChild) \\n\\n def updateBalance(self,node):\\n if node.balanceFactor > 1 or node.balanceFactor < -1:\\n self.rebalance(node)\\n return\\n if node.parent != None:\\n if node.isLeftChild():\\n node.parent.balanceFactor += 1\\n elif node.isRightChild():\\n node.parent.balanceFactor -= 1\\n\\n if node.parent.balanceFactor != 0:\\n self.updateBalance(node.parent)\\n\\n def rebalance(self,node):\\n if node.balanceFactor < 0:\\n if node.rightChild.balanceFactor > 0:\\n # Do an LR Rotation\\n self.rotateRight(node.rightChild)\\n self.rotateLeft(node)\\n else:\\n # single left\\n self.rotateLeft(node)\\n elif node.balanceFactor > 0:\\n if node.leftChild.balanceFactor < 0:\\n # Do an RL Rotation\\n self.rotateLeft(node.leftChild)\\n self.rotateRight(node)\\n else:\\n # single right\\n self.rotateRight(node)\\n\\n def rotateLeft(self,rotRoot):\\n newRoot = rotRoot.rightChild\\n rotRoot.rightChild = newRoot.leftChild\\n if newRoot.leftChild != None:\\n newRoot.leftChild.parent = rotRoot\\n newRoot.parent = rotRoot.parent\\n if rotRoot.isRoot():\\n self.root = newRoot\\n else:\\n if rotRoot.isLeftChild():\\n rotRoot.parent.leftChild = newRoot\\n else:\\n rotRoot.parent.rightChild = newRoot\\n newRoot.leftChild = rotRoot\\n rotRoot.parent = newRoot\\n rotRoot.balanceFactor = rotRoot.balanceFactor + 1 - min(newRoot.balanceFactor, 0)\\n newRoot.balanceFactor = newRoot.balanceFactor + 1 + max(rotRoot.balanceFactor, 0)\\n\\n\\n def rotateRight(self,rotRoot):\\n newRoot = rotRoot.leftChild\\n rotRoot.leftChild = newRoot.rightChild\\n if newRoot.rightChild != None:\\n newRoot.rightChild.parent = rotRoot\\n newRoot.parent = rotRoot.parent\\n if rotRoot.isRoot():\\n self.root = newRoot\\n else:\\n if rotRoot.isRightChild():\\n rotRoot.parent.rightChild = newRoot\\n else:\\n rotRoot.parent.leftChild = newRoot\\n newRoot.rightChild = rotRoot\\n rotRoot.parent = newRoot\\n rotRoot.balanceFactor = rotRoot.balanceFactor - 1 - max(newRoot.balanceFactor, 0)\\n newRoot.balanceFactor = newRoot.balanceFactor - 1 + min(rotRoot.balanceFactor, 0)\\n \\n\",\"src/lib/pythonds/trees/binaryTree.py\":\"# Bradley N. Miller, David L. Ranum\\n# Introduction to Data Structures and Algorithms in Python\\n# Copyright 2005\\n# \\n\\nclass BinaryTree:\\n \\\"\\\"\\\"\\n A recursive implementation of Binary Tree\\n Using links and Nodes approach.\\n \\\"\\\"\\\" \\n def init(self,rootObj):\\n self.key = rootObj\\n self.leftChild = None\\n self.rightChild = None\\n\\n def insertLeft(self,newNode):\\n if self.leftChild == None:\\n self.leftChild = BinaryTree(newNode)\\n else:\\n t = BinaryTree(newNode)\\n t.left = self.leftChild\\n self.leftChild = t\\n \\n def insertRight(self,newNode):\\n if self.rightChild == None:\\n self.rightChild = BinaryTree(newNode)\\n else:\\n t = BinaryTree(newNode)\\n t.right = self.rightChild\\n self.rightChild = t\\n\\n def isLeaf(self):\\n return ((not self.leftChild) and (not self.rightChild))\\n\\n def getRightChild(self):\\n return self.rightChild\\n\\n def getLeftChild(self):\\n return self.leftChild\\n\\n def setRootVal(self,obj):\\n self.key = obj\\n\\n def getRootVal(self,):\\n return self.key\\n\\n def inorder(self):\\n if self.leftChild:\\n self.leftChild.inorder()\\n print(self.key)\\n if self.rightChild:\\n self.rightChild.inorder()\\n\\n def postorder(self):\\n if self.leftChild:\\n self.leftChild.postorder()\\n if self.rightChild:\\n self.rightChild.postorder()\\n print(self.key)\\n\\n\\n def preorder(self):\\n print(self.key)\\n if self.leftChild:\\n self.leftChild.preorder()\\n if self.rightChild:\\n self.rightChild.preorder()\\n\\n def printexp(self):\\n if self.leftChild:\\n print('(')\\n self.leftChild.printexp()\\n print(self.key)\\n if self.rightChild:\\n self.rightChild.printexp()\\n print(')')\\n\\n def postordereval(self):\\n opers = {'+':operator.add, '-':operator.sub, '':operator.mul, '/':operator.truediv}\\n res1 = None\\n res2 = None\\n if self.leftChild:\\n res1 = self.leftChild.postordereval() #// \\\\label{peleft}\\n if self.rightChild:\\n res2 = self.rightChild.postordereval() #// \\\\label{peright}\\n if res1 and res2:\\n return opers[self.key](res1,res2) #// \\\\label{peeval}\\n else:\\n return self.key\\n\\ndef inorder(tree):\\n if tree != None:\\n inorder(tree.getLeftChild())\\n print(tree.getRootVal())\\n inorder(tree.getRightChild())\\n\\ndef printexp(tree):\\n if tree.leftChild:\\n print('(')\\n printexp(tree.getLeftChild())\\n print(tree.getRootVal())\\n if tree.rightChild:\\n printexp(tree.getRightChild())\\n print(')') \\n\\ndef printexp(tree):\\n sVal = \\\"\\\"\\n if tree:\\n sVal = '(' + printexp(tree.getLeftChild())\\n sVal = sVal + str(tree.getRootVal())\\n sVal = sVal + printexp(tree.getRightChild()) + ')'\\n return sVal\\n\\ndef postordereval(tree):\\n opers = {'+':operator.add, '-':operator.sub, '':operator.mul, '/':operator.truediv}\\n res1 = None\\n res2 = None\\n if tree:\\n res1 = postordereval(tree.getLeftChild()) #// \\\\label{peleft}\\n res2 = postordereval(tree.getRightChild()) #// \\\\label{peright}\\n if res1 and res2:\\n return opers[tree.getRootVal()](res1,res2) #// \\\\label{peeval}\\n else:\\n return tree.getRootVal()\\n\\ndef height(tree):\\n if tree == None:\\n return -1\\n else:\\n return 1 + max(height(tree.leftChild),height(tree.rightChild))\\n\\n# t = BinaryTree(7)\\n# t.insertLeft(3)\\n# t.insertRight(9)\\n# inorder(t)\\n# import operator\\n# x = BinaryTree('')\\n# x.insertLeft('+')\\n# l = x.getLeftChild()\\n# l.insertLeft(4)\\n# l.insertRight(5)\\n# x.insertRight(7)\\n# print(printexp(x))\\n# print(postordereval(x))\\n# print(height(x))\\n\",\"src/lib/pythonds/trees/binheap.py\":\"# Bradley N. Miller, David L. Ranum\\n# Introduction to Data Structures and Algorithms in Python\\n# Copyright 2005\\n# \\n\\n# this heap takes key value pairs, we will assume that the keys are integers\\nclass BinHeap:\\n def init(self):\\n self.heapList = [0]\\n self.currentSize = 0\\n\\n\\n def buildHeap(self,alist):\\n i = len(alist) // 2\\n self.currentSize = len(alist)\\n self.heapList = [0] + alist[:]\\n print(len(self.heapList), i)\\n while (i > 0):\\n print(self.heapList, i)\\n self.percDown(i)\\n i = i - 1\\n print(self.heapList,i)\\n \\n def percDown(self,i):\\n while (i * 2) <= self.currentSize:\\n mc = self.minChild(i)\\n if self.heapList[i] > self.heapList[mc]:\\n tmp = self.heapList[i]\\n self.heapList[i] = self.heapList[mc]\\n self.heapList[mc] = tmp\\n i = mc\\n \\n def minChild(self,i):\\n if i * 2 + 1 > self.currentSize:\\n return i * 2\\n else:\\n if self.heapList[i * 2] < self.heapList[i * 2 + 1]:\\n return i * 2\\n else:\\n return i * 2 + 1\\n\\n def percUp(self,i):\\n while i // 2 > 0:\\n if self.heapList[i] < self.heapList[i//2]:\\n tmp = self.heapList[i // 2]\\n self.heapList[i // 2] = self.heapList[i]\\n self.heapList[i] = tmp\\n i = i // 2\\n \\n def insert(self,k):\\n self.heapList.append(k)\\n self.currentSize = self.currentSize + 1\\n self.percUp(self.currentSize)\\n\\n def delMin(self):\\n retval = self.heapList[1]\\n self.heapList[1] = self.heapList[self.currentSize]\\n self.currentSize = self.currentSize - 1\\n self.heapList.pop()\\n self.percDown(1)\\n return retval\\n \\n def isEmpty(self):\\n if currentSize == 0:\\n return True\\n else:\\n return False\\n\",\"src/lib/pythonds/trees/bst.py\":\"#!/bin/env python3.1\\n# Bradley N. Miller, David L. Ranum\\n# Introduction to Data Structures and Algorithms in Python\\n# Copyright 2005, 2010\\n# \\n\\nclass BinarySearchTree:\\n '''\\n Author: Brad Miller\\n Date: 1/15/2005\\n Description: Imlement a binary search tree with the following interface\\n functions: \\n contains(y) <==> y in x\\n getitem(y) <==> x[y]\\n init()\\n len() <==> len(x)\\n setitem(k,v) <==> x[k] = v\\n clear()\\n get(k)\\n items() \\n keys() \\n values()\\n put(k,v)\\n in\\n del <==> \\n '''\\n\\n def init(self):\\n self.root = None\\n self.size = 0\\n \\n def put(self,key,val):\\n if self.root:\\n self._put(key,val,self.root)\\n else:\\n self.root = TreeNode(key,val)\\n self.size = self.size + 1\\n\\n def _put(self,key,val,currentNode):\\n if key < currentNode.key:\\n if currentNode.hasLeftChild():\\n self._put(key,val,currentNode.leftChild)\\n else:\\n currentNode.leftChild = TreeNode(key,val,parent=currentNode)\\n else:\\n if currentNode.hasRightChild():\\n self._put(key,val,currentNode.rightChild)\\n else:\\n currentNode.rightChild = TreeNode(key,val,parent=currentNode)\\n \\n def setitem(self,k,v):\\n self.put(k,v)\\n\\n def get(self,key):\\n if self.root:\\n res = self._get(key,self.root)\\n if res:\\n return res.payload\\n else:\\n return None\\n else:\\n return None\\n \\n def _get(self,key,currentNode):\\n if not currentNode:\\n return None\\n elif currentNode.key == key:\\n return currentNode\\n elif key < currentNode.key:\\n return self._get(key,currentNode.leftChild)\\n else:\\n return self._get(key,currentNode.rightChild)\\n \\n \\n def getitem(self,key):\\n res = self.get(key)\\n if res:\\n return res\\n else:\\n raise KeyError('Error, key not in tree')\\n \\n\\n def contains(self,key):\\n if self._get(key,self.root):\\n return True\\n else:\\n return False\\n \\n def length(self):\\n return self.size\\n\\n def len(self):\\n return self.size\\n\\n def iter(self):\\n return self.root.iter()\\n \\n def delete(self,key):\\n if self.size > 1:\\n nodeToRemove = self._get(key,self.root)\\n if nodeToRemove:\\n self.remove(nodeToRemove)\\n self.size = self.size-1\\n else:\\n raise KeyError('Error, key not in tree')\\n elif self.size == 1 and self.root.key == key:\\n self.root = None\\n self.size = self.size - 1\\n else:\\n raise KeyError('Error, key not in tree')\\n\\n def delitem(self,key):\\n self.delete(key)\\n \\n def remove(self,currentNode):\\n if currentNode.isLeaf(): #leaf\\n if currentNode == currentNode.parent.leftChild:\\n currentNode.parent.leftChild = None\\n else:\\n currentNode.parent.rightChild = None\\n elif currentNode.hasBothChildren(): #interior\\n succ = currentNode.findSuccessor()\\n succ.spliceOut()\\n currentNode.key = succ.key\\n currentNode.payload = succ.payload\\n else: # this node has one child\\n if currentNode.hasLeftChild():\\n if currentNode.isLeftChild():\\n currentNode.leftChild.parent = currentNode.parent\\n currentNode.parent.leftChild = currentNode.leftChild\\n elif currentNode.isRightChild():\\n currentNode.leftChild.parent = currentNode.parent\\n currentNode.parent.rightChild = currentNode.leftChild\\n else:\\n currentNode.replaceNodeData(currentNode.leftChild.key,\\n currentNode.leftChild.payload,\\n currentNode.leftChild.leftChild,\\n currentNode.leftChild.rightChild)\\n else:\\n if currentNode.isLeftChild():\\n currentNode.rightChild.parent = currentNode.parent\\n currentNode.parent.leftChild = currentNode.rightChild\\n elif currentNode.isRightChild():\\n currentNode.rightChild.parent = currentNode.parent\\n currentNode.parent.rightChild = currentNode.rightChild\\n else:\\n currentNode.replaceNodeData(currentNode.rightChild.key,\\n currentNode.rightChild.payload,\\n currentNode.rightChild.leftChild,\\n currentNode.rightChild.rightChild)\\n\\n def inorder(self):\\n self._inorder(self.root)\\n\\n def _inorder(self,tree):\\n if tree != None:\\n self._inorder(tree.leftChild)\\n print(tree.key)\\n self._inorder(tree.rightChild)\\n\\n def postorder(self):\\n self._postorder(self.root)\\n\\n def _postorder(self, tree):\\n if tree:\\n self._postorder(tree.rightChild)\\n self._postorder(tree.leftChild)\\n print(tree.key) \\n\\n def preorder(self):\\n self._preorder(self,self.root)\\n\\n def _preorder(self,tree):\\n if tree:\\n print(tree.key) \\n self._preorder(tree.leftChild)\\n self._preorder(tree.rightChild)\\n\\n \\nclass TreeNode:\\n def init(self,key,val,left=None,right=None,parent=None):\\n self.key = key\\n self.payload = val\\n self.leftChild = left\\n self.rightChild = right\\n self.parent = parent\\n self.balanceFactor = 0\\n \\n def hasLeftChild(self):\\n return self.leftChild\\n\\n def hasRightChild(self):\\n return self.rightChild\\n \\n def isLeftChild(self):\\n return self.parent and self.parent.leftChild == self\\n\\n def isRightChild(self):\\n return self.parent and self.parent.rightChild == self\\n\\n def isRoot(self):\\n return not self.parent\\n\\n def isLeaf(self):\\n return not (self.rightChild or self.leftChild)\\n\\n def hasAnyChildren(self):\\n return self.rightChild or self.leftChild\\n\\n def hasBothChildren(self):\\n return self.rightChild and self.leftChild\\n \\n def replaceNodeData(self,key,value,lc,rc):\\n self.key = key\\n self.payload = value\\n self.leftChild = lc\\n self.rightChild = rc\\n if self.hasLeftChild():\\n self.leftChild.parent = self\\n if self.hasRightChild():\\n self.rightChild.parent = self\\n \\n def findSuccessor(self):\\n succ = None\\n if self.hasRightChild():\\n succ = self.rightChild.findMin()\\n else:\\n if self.parent:\\n if self.isLeftChild():\\n succ = self.parent\\n else:\\n self.parent.rightChild = None\\n succ = self.parent.findSuccessor()\\n self.parent.rightChild = self\\n return succ\\n\\n\\n def spliceOut(self):\\n if self.isLeaf():\\n if self.isLeftChild():\\n self.parent.leftChild = None\\n else:\\n self.parent.rightChild = None\\n elif self.hasAnyChildren():\\n if self.hasLeftChild():\\n if self.isLeftChild():\\n self.parent.leftChild = self.leftChild\\n else:\\n self.parent.rightChild = self.leftChild\\n self.leftChild.parent = self.parent\\n else:\\n if self.isLeftChild():\\n self.parent.leftChild = self.rightChild\\n else:\\n self.parent.rightChild = self.rightChild\\n self.rightChild.parent = self.parent\\n\\n def findMin(self):\\n current = self\\n while current.hasLeftChild():\\n current = current.leftChild\\n return current\\n\\n def iter(self):\\n \\\"\\\"\\\"The standard inorder traversal of a binary tree.\\\"\\\"\\\"\\n if self:\\n if self.hasLeftChild():\\n for elem in self.leftChild:\\n yield elem\\n yield self.key\\n if self.hasRightChild():\\n for elem in self.rightChild:\\n yield elem\\n\\n \\n\",\"src/lib/pythonds3/init.py\":\"#!/usr/bin/env python3\\n\\\"\\\"\\\"\\npythonds3 import statement\\n\\\"\\\"\\\"\\n\\nfrom pythonds3.basic import Stack, Queue, Deque\\nfrom pythonds3.graphs import Graph, Vertex\\nfrom pythonds3.searching import HashTable\\nfrom pythonds3.trees import (\\n BinaryTree,\\n AVLTree,\\n BinarySearchTree,\\n BinaryHeap,\\n PriorityQueue,\\n)\\n\\nall = [\\n \\\"Stack\\\",\\n \\\"Queue\\\",\\n \\\"Deque\\\",\\n \\\"Graph\\\",\\n \\\"Vertex\\\",\\n \\\"HashTable\\\",\\n \\\"BinaryTree\\\",\\n \\\"AVLTree\\\",\\n \\\"BinarySearchTree\\\",\\n \\\"BinaryHeap\\\",\\n \\\"BinaryTree\\\",\\n \\\"PriorityQueue\\\",\\n]\\n\",\"src/lib/pythonds3/basic/init.py\":\"#!/usr/bin/env python3\\n\\\"\\\"\\\"\\npythonds3.basic import statement\\n\\\"\\\"\\\"\\nfrom pythonds3.basic.stack import Stack\\nfrom pythonds3.basic.queue import Queue\\nfrom pythonds3.basic.deque import Deque\\nfrom pythonds3.basic.linked_list import OrderedList\\nfrom pythonds3.basic.linked_list import UnorderedList\\n\\nall = [\\\"Stack\\\", \\\"Queue\\\", \\\"Deque\\\", \\\"OrderedList\\\", \\\"UnorderedList\\\"]\\n\",\"src/lib/pythonds3/basic/deque.py\":\"#!/usr/bin/env python3\\n\\\"\\\"\\\"\\nBradley N. Miller, David L. Ranum\\nProblem Solving with Algorithms and Data Structures using Python\\nCopyright 2005\\nUpdated by Roman Yasinovskyy, 2017\\n\\\"\\\"\\\"\\n\\n\\nclass Deque:\\n \\\"\\\"\\\"Queue implementation as a list\\\"\\\"\\\"\\n\\n def init(self):\\n \\\"\\\"\\\"Create new deque\\\"\\\"\\\"\\n self._items = []\\n\\n def is_empty(self):\\n \\\"\\\"\\\"Check if the deque is empty\\\"\\\"\\\"\\n return not bool(self._items)\\n\\n def add_front(self, item):\\n \\\"\\\"\\\"Add an item to the front of the deque\\\"\\\"\\\"\\n self._items.append(item)\\n\\n def add_rear(self, item):\\n \\\"\\\"\\\"Add an item to the rear of the deque\\\"\\\"\\\"\\n self._items.insert(0, item)\\n\\n def remove_front(self):\\n \\\"\\\"\\\"Remove an item from the front of the deque\\\"\\\"\\\"\\n return self._items.pop()\\n\\n def remove_rear(self):\\n \\\"\\\"\\\"Remove an item from the rear of the deque\\\"\\\"\\\"\\n return self._items.pop(0)\\n\\n def size(self):\\n \\\"\\\"\\\"Get the number of items in the deque\\\"\\\"\\\"\\n return len(self._items)\\n\",\"src/lib/pythonds3/basic/linked_list.py\":\"#!/usr/bin/env python3\\n\\\"\\\"\\\"\\nBradley N. Miller, David L. Ranum\\nProblem Solving with Algorithms and Data Structures using Python\\nCopyright 2005\\nUpdated by Roman Yasinovskyy, 2017\\n\\\"\\\"\\\"\\n\\n\\nclass LinkedListNode:\\n \\\"\\\"\\\"A node of a linked list\\\"\\\"\\\"\\n\\n def init(self, node_data):\\n self._data = node_data\\n self._next = None\\n\\n def get_data(self):\\n \\\"\\\"\\\"Get node data\\\"\\\"\\\"\\n return self._data\\n\\n def set_data(self, node_data):\\n \\\"\\\"\\\"Set node data\\\"\\\"\\\"\\n self._data = node_data\\n\\n data = property(get_data, set_data)\\n\\n def get_next(self):\\n \\\"\\\"\\\"Get next node\\\"\\\"\\\"\\n return self._next\\n\\n def set_next(self, node_next):\\n \\\"\\\"\\\"Set next node\\\"\\\"\\\"\\n self._next = node_next\\n\\n next = property(get_next, set_next)\\n\\n def str(self):\\n \\\"\\\"\\\"String\\\"\\\"\\\"\\n return str(self._data)\\n\\n\\nclass LinkedList:\\n \\\"\\\"\\\"Linked List class implementation\\\"\\\"\\\"\\n\\n def init(self):\\n \\\"\\\"\\\"Create a linked list\\\"\\\"\\\"\\n self._head = None\\n self._count = 0\\n\\n def is_empty(self):\\n \\\"\\\"\\\"Is the list empty\\\"\\\"\\\"\\n return self._head is None\\n\\n def size(self):\\n \\\"\\\"\\\"Size of the list\\\"\\\"\\\"\\n return self._count\\n\\n def len(self):\\n \\\"\\\"\\\"Size of the list\\\"\\\"\\\"\\n return self._count\\n\\n def str(self):\\n \\\"\\\"\\\"List as a string\\\"\\\"\\\"\\n list_str = \\\"[\\\"\\n current = self._head\\n\\n while current:\\n list_str += str(current)\\n if current.next:\\n list_str += \\\", \\\"\\n current = current.next\\n list_str += \\\"]\\\"\\n return list_str\\n\\n def add(self, value):\\n \\\"\\\"\\\"Add a new node\\\"\\\"\\\"\\n pass\\n\\n def remove(self, value):\\n \\\"\\\"\\\"Remove a node with a specific value\\\"\\\"\\\"\\n pass\\n\\n def search(self, value):\\n \\\"\\\"\\\"Search for a node with a specific value\\\"\\\"\\\"\\n pass\\n\\n\\nclass UnorderedList(LinkedList):\\n \\\"\\\"\\\"Unordered linked list implementation\\\"\\\"\\\"\\n\\n def init(self):\\n \\\"\\\"\\\"Create an unordered linked list\\\"\\\"\\\"\\n LinkedList.init(self)\\n\\n def add(self, value):\\n \\\"\\\"\\\"Add a new node\\\"\\\"\\\"\\n new_node = LinkedListNode(value)\\n new_node.set_next(self._head)\\n self._head = new_node\\n self._count = self._count + 1\\n\\n def remove(self, value):\\n \\\"\\\"\\\"Remove a node with a specific value\\\"\\\"\\\"\\n current = self._head\\n prev = None\\n\\n while current:\\n if current.data == value:\\n if prev is None:\\n self._head = current.next\\n else:\\n prev.next = current.next\\n self._count = self._count - 1\\n return\\n prev = current\\n current = current.next\\n raise ValueError(\\\"{} is not in the list\\\".format(value))\\n\\n def search(self, value):\\n \\\"\\\"\\\"Search for a node with a specific value\\\"\\\"\\\"\\n current = self._head\\n\\n while current:\\n if current.data == value:\\n return True\\n current = current.next\\n return False\\n\\n\\nclass OrderedList(LinkedList):\\n \\\"\\\"\\\"Ordered linked list implementation\\\"\\\"\\\"\\n\\n def init(self):\\n \\\"\\\"\\\"Create an Ordered linked list\\\"\\\"\\\"\\n LinkedList.init(self)\\n\\n def add(self, value):\\n \\\"\\\"\\\"Add a new node\\\"\\\"\\\"\\n current = self._head\\n prev = None\\n new_node = LinkedListNode(value)\\n\\n while current and current.data < value:\\n prev = current\\n current = current.next\\n\\n if prev is None:\\n new_node.next = self._head\\n self._head = new_node\\n else:\\n new_node.next = current\\n prev.next = new_node\\n self._count = self._count + 1\\n\\n def remove(self, value):\\n \\\"\\\"\\\"Remove a node with a specific value\\\"\\\"\\\"\\n # This is an exercise\\n pass\\n\\n def search(self, value):\\n \\\"\\\"\\\"Search for a node with a specific value\\\"\\\"\\\"\\n # This is an exercise\\n pass\\n\",\"src/lib/pythonds3/basic/queue.py\":\"#!/usr/bin/env python3\\n\\\"\\\"\\\"\\nBradley N. Miller, David L. Ranum\\nProblem Solving with Algorithms and Data Structures using Python\\nCopyright 2005\\nUpdated by Roman Yasinovskyy, 2017\\n\\\"\\\"\\\"\\n\\n\\nclass Queue:\\n \\\"\\\"\\\"Queue implementation as a list\\\"\\\"\\\"\\n\\n def init(self):\\n \\\"\\\"\\\"Create new queue\\\"\\\"\\\"\\n self._items = []\\n\\n def is_empty(self):\\n \\\"\\\"\\\"Check if the queue is empty\\\"\\\"\\\"\\n return not bool(self._items)\\n\\n def enqueue(self, item):\\n \\\"\\\"\\\"Add an item to the queue\\\"\\\"\\\"\\n self._items.insert(0, item)\\n\\n def dequeue(self):\\n \\\"\\\"\\\"Remove an item from the queue\\\"\\\"\\\"\\n return self._items.pop()\\n\\n def size(self):\\n \\\"\\\"\\\"Get the number of items in the queue\\\"\\\"\\\"\\n return len(self._items)\\n\",\"src/lib/pythonds3/basic/stack.py\":\"#!/usr/bin/env python3\\n\\\"\\\"\\\"\\nBradley N. Miller, David L. Ranum\\nProblem Solving with Algorithms and Data Structures using Python\\nCopyright 2005\\nUpdated by Roman Yasinovskyy, 2017\\n\\\"\\\"\\\"\\n\\n\\nclass Stack:\\n \\\"\\\"\\\"Stack implementation as a list\\\"\\\"\\\"\\n\\n def init(self):\\n \\\"\\\"\\\"Create new stack\\\"\\\"\\\"\\n self._items = []\\n\\n def is_empty(self):\\n \\\"\\\"\\\"Check if the stack is empty\\\"\\\"\\\"\\n return not bool(self._items)\\n\\n def push(self, item):\\n \\\"\\\"\\\"Add an item to the stack\\\"\\\"\\\"\\n self._items.append(item)\\n\\n def pop(self):\\n \\\"\\\"\\\"Remove an item from the stack\\\"\\\"\\\"\\n return self._items.pop()\\n\\n def peek(self):\\n \\\"\\\"\\\"Get the value of the top item in the stack\\\"\\\"\\\"\\n return self._items[-1]\\n\\n def size(self):\\n \\\"\\\"\\\"Get the number of items in the stack\\\"\\\"\\\"\\n return len(self._items)\\n\",\"src/lib/pythonds3/graphs/init.py\":\"#!/usr/bin/env python3\\n\\\"\\\"\\\"\\npythonds3.graphs import statement\\n\\\"\\\"\\\"\\nfrom pythonds3.graphs.adjacency_graph import Graph\\nfrom pythonds3.graphs.adjacency_graph import Vertex\\n\\nall = [\\\"Graph\\\"]\\n\",\"src/lib/pythonds3/graphs/adjacency_graph.py\":\"#!/usr/bin/env python3\\n\\\"\\\"\\\"\\nBradley N. Miller, David L. Ranum\\nProblem Solving with Algorithms and Data Structures using Python\\nCopyright 2005\\nUpdated by Roman Yasinovskyy, 2017\\n\\\"\\\"\\\"\\n\\nimport heapq\\nimport sys\\n\\n\\nclass Vertex:\\n \\\"\\\"\\\"Graph vertex class\\\"\\\"\\\"\\n\\n def init(self, key):\\n \\\"\\\"\\\"Create new vertex\\\"\\\"\\\"\\n self._key = key\\n self._neighbors = {}\\n self._color = \\\"white\\\"\\n self._distance = sys.maxsize\\n self._previous = None\\n self._discovery_time = 0\\n self._closing_time = 0\\n\\n def lt(self, other):\\n \\\"\\\"\\\"Less than operator required for heapify\\\"\\\"\\\"\\n return self.key < other.key\\n\\n def get_key(self):\\n \\\"\\\"\\\"Get vertex key\\\"\\\"\\\"\\n return self._key\\n\\n key = property(get_key)\\n\\n def get_neighbor(self, other):\\n \\\"\\\"\\\"Get the distance (edge weight) to an adjacent node (neighbor)\\\"\\\"\\\"\\n return self._neighbors.get(other, None)\\n\\n def set_neighbor(self, other, weight=0):\\n \\\"\\\"\\\"Set the distance (add an edge) to an adjacent node (neighbor)\\\"\\\"\\\"\\n self._neighbors[other] = weight\\n\\n def get_neighbors(self):\\n \\\"\\\"\\\"Get all adjacent nodes (neighbors)\\\"\\\"\\\"\\n return self._neighbors.keys()\\n\\n def get_color(self):\\n \\\"\\\"\\\"Get vertex color\\\"\\\"\\\"\\n return self._color\\n\\n def set_color(self, color):\\n \\\"\\\"\\\"Set vertex color\\\"\\\"\\\"\\n self._color = color\\n\\n color = property(get_color, set_color)\\n\\n def get_distance(self):\\n \\\"\\\"\\\"Get distance\\\"\\\"\\\"\\n return self._distance\\n\\n def set_distance(self, distance):\\n \\\"\\\"\\\"Set distance\\\"\\\"\\\"\\n self._distance = distance\\n\\n distance = property(get_distance, set_distance)\\n\\n def get_previous(self):\\n \\\"\\\"\\\"Get previous\\\"\\\"\\\"\\n return self._previous\\n\\n def set_previous(self, previous):\\n \\\"\\\"\\\"Set previous\\\"\\\"\\\"\\n self._previous = previous\\n\\n previous = property(get_previous, set_previous)\\n\\n def get_discovery_time(self):\\n \\\"\\\"\\\"Get discovery time\\\"\\\"\\\"\\n return self._discovery_time\\n\\n def set_discovery_time(self, discovery_time):\\n \\\"\\\"\\\"Set discovery time\\\"\\\"\\\"\\n self._discovery_time = discovery_time\\n\\n discovery_time = property(get_discovery_time, set_discovery_time)\\n\\n def get_closing_time(self):\\n \\\"\\\"\\\"Get closing time\\\"\\\"\\\"\\n return self._closing_time\\n\\n def set_closing_time(self, closing_time):\\n \\\"\\\"\\\"Set closing time\\\"\\\"\\\"\\n self._closing_time = closing_time\\n\\n closing_time = property(get_closing_time, set_closing_time)\\n\\n def str(self):\\n return \\\"{:^8}|{:^8}|{:^8}|{:^8}|{:^8}| {}\\\".format(\\n self._key,\\n self._color,\\n self._distance,\\n self._discovery_time,\\n self._closing_time,\\n self._previous,\\n )\\n\\n\\nclass Graph:\\n \\\"\\\"\\\"Graph as an adjacency matrix\\\"\\\"\\\"\\n\\n def init(self):\\n self._vertices = {}\\n self._edges = {}\\n self._time = 0\\n\\n def iter(self):\\n \\\"\\\"\\\"Iterator\\\"\\\"\\\"\\n return iter(self._vertices.values())\\n\\n def size(self):\\n \\\"\\\"\\\"Graph's size\\\"\\\"\\\"\\n return len(self._vertices)\\n\\n def len(self):\\n \\\"\\\"\\\"Graph's size\\\"\\\"\\\"\\n return len(self._vertices)\\n\\n def contains(self, key):\\n \\\"\\\"\\\"in operator override\\\"\\\"\\\"\\n return key in self._vertices\\n\\n def get_vertex(self, key):\\n \\\"\\\"\\\"Find the vertex in the graph named vert_key\\\"\\\"\\\"\\n return self._vertices.get(key, None)\\n\\n def set_vertex(self, key):\\n \\\"\\\"\\\"Add an instance of Vertex to the graph\\\"\\\"\\\"\\n self._vertices[key] = Vertex(key)\\n\\n def add_edge(self, from_vertex, to_vertex, weight=0):\\n \\\"\\\"\\\"Add a weighted and directed edge to the graph\\\"\\\"\\\"\\n if from_vertex not in self._vertices:\\n self.set_vertex(from_vertex)\\n if to_vertex not in self._vertices:\\n self.set_vertex(to_vertex)\\n self._vertices[from_vertex].set_neighbor(self._vertices[to_vertex], weight)\\n self._edges[(from_vertex, to_vertex)] = weight\\n\\n def get_vertices(self):\\n \\\"\\\"\\\"Return the list of all vertices in the graph\\\"\\\"\\\"\\n return self._vertices.keys()\\n\\n def get_edges(self):\\n \\\"\\\"\\\"Return the list of all edges in the graph\\\"\\\"\\\"\\n return self._edges.keys()\\n\\n def reset_distances(self, default_distance=sys.maxsize):\\n \\\"\\\"\\\"Reset distances to test Dijkstra's\\\"\\\"\\\"\\n for vertex in self:\\n vertex.distance = default_distance\\n\\n def bfs(self, start):\\n \\\"\\\"\\\"Breadth First Search\\\"\\\"\\\"\\n start.distance = 0\\n start.previous = None\\n vert_queue = [start]\\n while vert_queue:\\n current_vert = vert_queue.pop(0)\\n for neigh in current_vert.get_neighbors():\\n if neigh.color == \\\"white\\\":\\n neigh.color = \\\"gray\\\"\\n neigh.distance = current_vert.distance + 1\\n neigh.previous = current_vert\\n vert_queue.append(neigh)\\n current_vert.color = \\\"black\\\"\\n\\n def dfs(self):\\n \\\"\\\"\\\"Depth First search\\\"\\\"\\\"\\n for vertex in self:\\n if vertex.color == \\\"white\\\":\\n self.dfs_visit(vertex)\\n\\n def dfs_visit(self, start):\\n \\\"\\\"\\\"DFS helper function\\\"\\\"\\\"\\n start.color = \\\"gray\\\"\\n self._time = self._time + 1\\n start.discovery_time = self._time\\n for next_vertex in start.get_neighbors():\\n if next_vertex.color == \\\"white\\\":\\n next_vertex.set_previous(start)\\n self.dfs_visit(next_vertex)\\n start.color = \\\"black\\\"\\n self._time = self._time + 1\\n start.closing_time = self._time\\n\\n def traverse(self, src, dst):\\n \\\"\\\"\\\"Traverse a graph\\\"\\\"\\\"\\n path = []\\n current = self.get_vertex(dst)\\n while current:\\n path.append(current)\\n current = current.previous\\n print(\\n \\\"Path from {} to {} ({}): {}\\\".format(\\n self.get_vertex(src).key,\\n self.get_vertex(dst).key,\\n self.get_vertex(dst).distance,\\n \\\" \\\".join(vertex.key for vertex in reversed(path)),\\n )\\n )\\n\\n def dijkstra(self, start):\\n \\\"\\\"\\\"Dijkstra's shortest path algorithm\\\"\\\"\\\"\\n start.distance = 0\\n not_yet_visited = [[start.distance, start]]\\n heapq.heapify(not_yet_visited)\\n while not_yet_visited:\\n current_vertex = heapq.heappop(not_yet_visited)[1]\\n for next_vertex in current_vertex.get_neighbors():\\n new_distance = current_vertex.distance + current_vertex.get_neighbor(\\n next_vertex\\n )\\n if new_distance < next_vertex.distance:\\n next_vertex.distance = new_distance\\n next_vertex.previous = current_vertex\\n found = False\\n for vertex in not_yet_visited:\\n if vertex[1].key == next_vertex.key:\\n vertex[0] = next_vertex.distance\\n heapq.heapify(not_yet_visited)\\n found = True\\n if not found:\\n heapq.heappush(\\n not_yet_visited, [next_vertex.distance, next_vertex]\\n )\\n\\n def bellman_ford(self, start):\\n \\\"\\\"\\\"Bellman-Ford shortest path algorithm\\\"\\\"\\\"\\n start.distance = 0\\n for _ in range(len(self._vertices)):\\n for edge in self._edges:\\n if (\\n self.get_vertex(edge[0]).distance + self._edges[edge]\\n < self.get_vertex(edge[1]).distance\\n ):\\n self.get_vertex(edge[1]).distance = (\\n self.get_vertex(edge[0]).distance + self._edges[edge]\\n )\\n self.get_vertex(edge[1]).previous = self.get_vertex(edge[0])\\n for edge in self._edges:\\n if (\\n self.get_vertex(edge[0]).distance + self._edges[edge]\\n < self.get_vertex(edge[1]).distance\\n ):\\n raise ValueError(\\\"Graph contains a negative-weight cycle\\\")\\n\\n def prim(self, start):\\n \\\"\\\"\\\"Prim's spanning tree algorithm\\\"\\\"\\\"\\n start.distance = 0\\n not_in_a_tree = [[vertex.distance, vertex] for vertex in self]\\n heapq.heapify(not_in_a_tree)\\n while not_in_a_tree:\\n current_vertex = heapq.heappop(not_in_a_tree)[1]\\n for next_vertex in current_vertex.get_neighbors():\\n new_distance = current_vertex.get_neighbor(next_vertex)\\n if (\\n any(item[1] == next_vertex for item in not_in_a_tree)\\n and new_distance < next_vertex.distance\\n ):\\n next_vertex.previous = current_vertex\\n next_vertex.distance = new_distance\\n for item in not_in_a_tree:\\n if item[1] == next_vertex:\\n item[0] = new_distance\\n heapq.heapify(not_in_a_tree)\\n break\\n\",\"src/lib/pythonds3/intro/init.py\":\"#!/usr/bin/env python3\\n\\\"\\\"\\\"\\npythonds3.intro import statement\\n\\\"\\\"\\\"\\nfrom pythonds3.intro.oop import Fraction\\n\\nall = [\\\"Fraction\\\"]\\n\",\"src/lib/pythonds3/intro/oop.py\":\"#!/usr/bin/env python3\\n\\\"\\\"\\\"\\nBradley N. Miller, David L. Ranum\\nProblem Solving with Algorithms and Data Structures using Python\\nCopyright 2005\\nUpdated by Roman Yasinovskyy, 2017\\n\\\"\\\"\\\"\\n\\n\\ndef gcd(number1, number2):\\n \\\"\\\"\\\"Helper function to simplify fractions\\\"\\\"\\\"\\n if not isinstance(number1, int) or not isinstance(number2, int):\\n raise TypeError(\\\"Numerator and denominator must be integers\\\")\\n while number1 % number2:\\n number1, number2 = number2, number1 % number2\\n return number2\\n\\n\\nclass Fraction:\\n \\\"\\\"\\\"Fraction class\\\"\\\"\\\"\\n\\n def init(self, new_numer, new_denom):\\n try:\\n common = gcd(new_numer, new_denom)\\n except TypeError:\\n raise\\n self._numer = new_numer // common\\n self._denom = new_denom // common\\n\\n @property\\n def numer(self):\\n \\\"\\\"\\\"Get numerator\\\"\\\"\\\"\\n return self._numer\\n\\n @numer.setter\\n def set_numer(self, new_numer):\\n \\\"\\\"\\\"Set numerator\\\"\\\"\\\"\\n self._numer = new_numer\\n\\n def get_denom(self):\\n \\\"\\\"\\\"Get deniminator\\\"\\\"\\\"\\n return self._denom\\n\\n def set_denom(self, new_denom):\\n \\\"\\\"\\\"Set deniminator\\\"\\\"\\\"\\n self._denom = new_denom\\n\\n # Another way to create an attribute\\n denom = property(get_denom, set_denom)\\n\\n def str(self):\\n \\\"\\\"\\\"Get the string value\\\"\\\"\\\"\\n if self._numer > self._denom:\\n return \\\"{} {}/{}\\\".format(\\n self._numer // self._denom, self._numer % self._denom, self._denom\\n )\\n return \\\"{}/{}\\\".format(self._numer, self._denom)\\n\\n def repr(self):\\n \\\"\\\"\\\"Fraction representation\\\"\\\"\\\"\\n return \\\"Fraction({}, {})\\\".format(self._numer, self._denom)\\n\\n def eq(self, other):\\n \\\"\\\"\\\"Equality comparison\\\"\\\"\\\"\\n return self._numer * other.denom == other.numer * self._denom\\n\\n def add(self, other):\\n \\\"\\\"\\\"Add two fractions\\\"\\\"\\\"\\n new_numer = self._numer * other.denom + self._denom * other.numer\\n new_denom = self._denom * other.denom\\n return Fraction(new_numer, new_denom)\\n\",\"src/lib/pythonds3/searching/init.py\":\"#!/usr/bin/env python3\\n\\\"\\\"\\\"\\npythonds3.search import statement\\n\\\"\\\"\\\"\\nfrom pythonds3.searching.hash_table import HashTable\\n\\nall = [\\\"HashTable\\\"]\\n\",\"src/lib/pythonds3/searching/hash_table.py\":\"#!/usr/bin/env python3\\n\\\"\\\"\\\"\\nBradley N. Miller, David L. Ranum\\nProblem Solving with Algorithms and Data Structures using Python\\nCopyright 2005\\nUpdated by Roman Yasinovskyy, 2017\\n\\\"\\\"\\\"\\n\\n\\nclass HashTable:\\n \\\"\\\"\\\"Hash Table implementation\\\"\\\"\\\"\\n\\n def init(self, size=16):\\n \\\"\\\"\\\"Create a hash table\\\"\\\"\\\"\\n self._size = size\\n self._slots = [None] * self._size\\n self._data = [None] * self._size\\n\\n def getitem(self, key):\\n \\\"\\\"\\\"Magic get\\\"\\\"\\\"\\n return self.get(key)\\n\\n def setitem(self, key, data):\\n \\\"\\\"\\\"Magic set\\\"\\\"\\\"\\n self.put(key, data)\\n\\n def len(self):\\n \\\"\\\"\\\"Magic len\\\"\\\"\\\"\\n return self._size - self._slots.count(None)\\n\\n def contains(self, key):\\n \\\"\\\"\\\"Magin in\\\"\\\"\\\"\\n return key in self._slots\\n\\n def _hash_function(self, key, size):\\n \\\"\\\"\\\"Simple hash function\\\"\\\"\\\"\\n return key % size\\n\\n def _rehash(self, old_hash, size, step=1):\\n \\\"\\\"\\\"Simple rehash function\\\"\\\"\\\"\\n return (old_hash + step) % size\\n\\n def is_empty(self):\\n \\\"\\\"\\\"Check if the table is empty\\\"\\\"\\\"\\n return self._size == self._slots.count(None)\\n\\n def size(self):\\n \\\"\\\"\\\"Get number of items in the table\\\"\\\"\\\"\\n return self._size - self._slots.count(None)\\n\\n def put(self, key, data):\\n \\\"\\\"\\\"Add an item to the table\\\"\\\"\\\"\\n hash_value = self._hash_function(key, len(self._slots))\\n\\n if self._slots[hash_value] is None:\\n self._slots[hash_value] = key\\n self._data[hash_value] = data\\n else:\\n if self._slots[hash_value] == key:\\n self._data[hash_value] = data # replace\\n else:\\n j = 0\\n next_slot = self._rehash(hash_value, len(self._slots), j)\\n while (\\n self._slots[next_slot] is not None\\n and self._slots[next_slot] != key\\n and j < self._size\\n ):\\n j = j + 1\\n next_slot = self._rehash(hash_value, len(self._slots), j)\\n\\n if self._slots[next_slot] is None:\\n self._slots[next_slot] = key\\n self._data[next_slot] = data\\n elif j == self._size:\\n raise Exception(\\\"Hash Table is full\\\")\\n else:\\n self._data[next_slot] = data # replace\\n\\n def get(self, key):\\n \\\"\\\"\\\"Get an item from the table\\\"\\\"\\\"\\n start_slot = self._hash_function(key, len(self._slots))\\n position = start_slot\\n j = 0\\n\\n while self._slots[position] is not None and j < self._size:\\n if self._slots[position] == key:\\n return self._data[position]\\n j = j + 1\\n position = self._rehash(start_slot, len(self._slots), j)\\n\\n raise KeyError(\\\"{} is not in the table\\\".format(key))\\n\",\"src/lib/pythonds3/sorting/init.py\":\"#!/usr/bin/env python3\\n\\\"\\\"\\\"\\npythonds3.sorting import statement\\n\\\"\\\"\\\"\\nfrom pythonds3.sorting.sorting_algorithms import bubble_sort\\nfrom pythonds3.sorting.sorting_algorithms import select_sort\\nfrom pythonds3.sorting.sorting_algorithms import insert_sort\\nfrom pythonds3.sorting.sorting_algorithms import shell_sort\\nfrom pythonds3.sorting.sorting_algorithms import merge_sort\\nfrom pythonds3.sorting.sorting_algorithms import quick_sort\\nfrom pythonds3.sorting.sorting_algorithms import heap_sort\\n\",\"src/lib/pythonds3/sorting/sorting_algorithms.py\":\"#!/usr/bin/env python3\\n\\\"\\\"\\\"\\nBradley N. Miller, David L. Ranum\\nProblem Solving with Algorithms and Data Structures using Python\\nCopyright 2005\\nUpdated by Roman Yasinovskyy, 2017\\n\\\"\\\"\\\"\\n\\nimport heapq\\n\\n\\ndef bubble_sort(lst):\\n \\\"\\\"\\\"Bubble sort\\\"\\\"\\\"\\n for i in range(len(lst) - 1, 0, -1):\\n exchanges = False\\n for j in range(i):\\n if lst[j] > lst[j + 1]:\\n exchanges = True\\n lst[j], lst[j + 1] = lst[j + 1], lst[j]\\n if not exchanges:\\n break\\n\\n\\ndef select_sort(lst):\\n \\\"\\\"\\\"Selection sort\\\"\\\"\\\"\\n for i, item in enumerate(lst):\\n min_idx = len(lst) - 1\\n for j in range(i, len(lst)):\\n if lst[j] < lst[min_idx]:\\n min_idx = j\\n if min_idx != i:\\n lst[min_idx], lst[i] = lst[i], lst[min_idx]\\n\\n\\ndef insert_sort(lst):\\n \\\"\\\"\\\"Insertion sort\\\"\\\"\\\"\\n for i in range(1, len(lst)):\\n cur_val = lst[i]\\n cur_pos = i\\n\\n while cur_pos > 0 and lst[cur_pos - 1] > cur_val:\\n lst[cur_pos] = lst[cur_pos - 1]\\n cur_pos = cur_pos - 1\\n lst[cur_pos] = cur_val\\n\\n\\ndef shell_sort(lst):\\n \\\"\\\"\\\"Shell sort\\\"\\\"\\\"\\n sublist_count = len(lst) // 3\\n while sublist_count > 0:\\n for pos_start in range(sublist_count):\\n _gap_insert_sort(lst, pos_start, sublist_count)\\n sublist_count = sublist_count // 2\\n\\n\\ndef _gap_insert_sort(lst, start, gap):\\n \\\"\\\"\\\"Shell sort helper function\\\"\\\"\\\"\\n for i in range(start + gap, len(lst), gap):\\n cur_val = lst[i]\\n cur_pos = i\\n while cur_pos >= gap and lst[cur_pos - gap] > cur_val:\\n lst[cur_pos] = lst[cur_pos - gap]\\n cur_pos = cur_pos - gap\\n lst[cur_pos] = cur_val\\n\\n\\ndef merge_sort(lst):\\n \\\"\\\"\\\"Merge sort\\\"\\\"\\\"\\n if len(lst) > 1:\\n mid = len(lst) // 2\\n left_half = lst[:mid]\\n right_half = lst[mid:]\\n\\n merge_sort(left_half)\\n merge_sort(right_half)\\n\\n i, j, k = 0, 0, 0\\n while i < len(left_half) and j < len(right_half):\\n if left_half[i] <= right_half[j]:\\n lst[k] = left_half[i]\\n i = i + 1\\n else:\\n lst[k] = right_half[j]\\n j = j + 1\\n k = k + 1\\n\\n while i < len(left_half):\\n lst[k] = left_half[i]\\n i = i + 1\\n k = k + 1\\n\\n while j < len(right_half):\\n lst[k] = right_half[j]\\n j = j + 1\\n k = k + 1\\n\\n\\ndef quick_sort(lst):\\n \\\"\\\"\\\"Quick sort\\\"\\\"\\\"\\n _quick_sort_help(lst, 0, len(lst) - 1)\\n\\n\\ndef _quick_sort_help(lst, mark_l, mark_r):\\n \\\"\\\"\\\"Quick sort helper\\\"\\\"\\\"\\n if mark_l < mark_r:\\n split = _quick_sort_part(lst, mark_l, mark_r)\\n _quick_sort_help(lst, mark_l, split - 1)\\n _quick_sort_help(lst, split + 1, mark_r)\\n\\n\\ndef _quick_sort_part(lst, mark_l, mark_r):\\n \\\"\\\"\\\"Quick sort partition\\\"\\\"\\\"\\n pivot_val = lst[mark_l]\\n mark_l_cur = mark_l + 1\\n mark_r_cur = mark_r\\n done = False\\n\\n while not done:\\n while mark_l_cur <= mark_r_cur and lst[mark_l_cur] <= pivot_val:\\n mark_l_cur = mark_l_cur + 1\\n while mark_l_cur <= mark_r_cur and lst[mark_r_cur] >= pivot_val:\\n mark_r_cur = mark_r_cur - 1\\n if mark_r_cur < mark_l_cur:\\n done = True\\n else:\\n lst[mark_l_cur], lst[mark_r_cur] = lst[mark_r_cur], lst[mark_l_cur]\\n lst[mark_l], lst[mark_r_cur] = lst[mark_r_cur], lst[mark_l]\\n\\n return mark_r_cur\\n\\n\\ndef heap_sort(lst):\\n \\\"\\\"\\\"Heap sort\\\"\\\"\\\"\\n res = []\\n heapq.heapify(lst)\\n while lst:\\n res.append(heapq.heappop(lst))\\n for i in res:\\n lst.append(i)\\n\",\"src/lib/pythonds3/trees/init.py\":\"#!/usr/bin/env python3\\n\\\"\\\"\\\"\\npythonds3.trees import statement\\n\\\"\\\"\\\"\\nfrom pythonds3.trees.avl_tree import AVLTree\\nfrom pythonds3.trees.binary_search_tree import BinarySearchTree\\nfrom pythonds3.trees.binary_heap import BinaryHeap\\nfrom pythonds3.trees.binary_tree import BinaryTree\\nfrom pythonds3.trees.priority_queue import PriorityQueue\\n\\nall = [\\\"BinaryTree\\\", \\\"BinaryHeap\\\", \\\"BinarySearchTree\\\", \\\"AVLTree\\\", \\\"PriorityQueue\\\"]\\n\",\"src/lib/pythonds3/trees/avl_tree.py\":\"#!/usr/bin/env python3\\n\\\"\\\"\\\"\\nBradley N. Miller, David L. Ranum\\nProblem Solving with Algorithms and Data Structures using Python\\nCopyright 2005, 2010\\nUpdated by Roman Yasinovskyy, 2017\\n\\\"\\\"\\\"\\n\\nfrom pythonds3.trees.binary_search_tree import BinarySearchTree\\nfrom pythonds3.trees.binary_search_tree import BinaryTreeNode\\n\\n\\nclass AVLTreeNode(BinaryTreeNode):\\n \\\"\\\"\\\"AVL Tree Node\\\"\\\"\\\"\\n\\n def init(self, key, val, balance_factor, left=None, right=None, parent=None):\\n \\\"\\\"\\\"Create an AVL tree node\\\"\\\"\\\"\\n BinaryTreeNode.init(self, key, val, left, right, parent)\\n self._balance_factor = balance_factor\\n\\n def get_balance_factor(self):\\n \\\"\\\"\\\"Get the node balance factor\\\"\\\"\\\"\\n return self._balance_factor\\n\\n def set_balance_factor(self, value):\\n \\\"\\\"\\\"Set the node balance factor\\\"\\\"\\\"\\n self._balance_factor = value\\n\\n balance_factor = property(get_balance_factor, set_balance_factor)\\n\\n\\nclass AVLTree(BinarySearchTree):\\n \\\"\\\"\\\"AVL tree implementation\\\"\\\"\\\"\\n\\n def init(self):\\n \\\"\\\"\\\"Create a new AVL tree\\\"\\\"\\\"\\n BinarySearchTree.init(self)\\n\\n def put(self, key, value):\\n \\\"\\\"\\\"Add new node\\\"\\\"\\\"\\n if self._root:\\n self._put(key, value, self._root)\\n else:\\n self._root = AVLTreeNode(key, value, 0)\\n self._size = self._size + 1\\n\\n def _put(self, key, value, current_node):\\n \\\"\\\"\\\"Add a new node to the tree (helper function)\\\"\\\"\\\"\\n if key < current_node.key:\\n if current_node.get_child_left():\\n self._put(key, value, current_node.child_left)\\n else:\\n current_node.child_left = AVLTreeNode(\\n key, value, 0, parent=current_node\\n )\\n self.update_balance(current_node.child_left)\\n else:\\n if current_node.get_child_right():\\n self._put(key, value, current_node.child_right)\\n else:\\n current_node.child_right = AVLTreeNode(\\n key, value, 0, parent=current_node\\n )\\n self.update_balance(current_node.child_right)\\n\\n def update_balance(self, node):\\n \\\"\\\"\\\"Update the tree balance\\\"\\\"\\\"\\n if node.balance_factor > 1 or node.balance_factor < -1:\\n self.rebalance(node)\\n return\\n if node.parent:\\n if node.is_child_left():\\n node.parent.balance_factor += 1\\n elif node.is_child_right():\\n node.parent.balance_factor -= 1\\n\\n if node.parent.balance_factor != 0:\\n self.update_balance(node.parent)\\n\\n def rebalance(self, node):\\n \\\"\\\"\\\"Rebalance the tree\\\"\\\"\\\"\\n if node.balance_factor < 0:\\n if node.child_right.balance_factor > 0:\\n # Do an LR Rotation\\n self.rotate_right(node.child_right)\\n self.rotate_left(node)\\n else:\\n # single left\\n self.rotate_left(node)\\n elif node.balance_factor > 0:\\n if node.child_left.balance_factor < 0:\\n # Do an RL Rotation\\n self.rotate_left(node.child_left)\\n self.rotate_right(node)\\n else:\\n # single right\\n self.rotate_right(node)\\n\\n def rotate_left(self, rotation_root):\\n \\\"\\\"\\\"Left rotation\\\"\\\"\\\"\\n new_root = rotation_root.child_right\\n rotation_root.child_right = new_root.child_left\\n if new_root.child_left:\\n new_root.child_left.parent = rotation_root\\n new_root.parent = rotation_root.parent\\n if rotation_root.is_root():\\n self._root = new_root\\n else:\\n if rotation_root.is_child_left():\\n rotation_root.parent.child_left = new_root\\n else:\\n rotation_root.parent.child_right = new_root\\n new_root.child_left = rotation_root\\n rotation_root.parent = new_root\\n rotation_root.balance_factor = (\\n rotation_root.balance_factor + 1 - min(new_root.balance_factor, 0)\\n )\\n new_root.balance_factor = (\\n new_root.balance_factor + 1 + max(rotation_root.balance_factor, 0)\\n )\\n\\n def rotate_right(self, rotation_root):\\n \\\"\\\"\\\"Right rotation\\\"\\\"\\\"\\n new_root = rotation_root.child_left\\n rotation_root.child_left = new_root.child_right\\n if new_root.child_right:\\n new_root.child_right.parent = rotation_root\\n new_root.parent = rotation_root.parent\\n if rotation_root.is_root():\\n self._root = new_root\\n else:\\n if rotation_root.is_child_right():\\n rotation_root.parent.child_right = new_root\\n else:\\n rotation_root.parent.child_left = new_root\\n new_root.child_right = rotation_root\\n rotation_root.parent = new_root\\n rotation_root.balance_factor = (\\n rotation_root.balance_factor - 1 - max(new_root.balance_factor, 0)\\n )\\n new_root.balance_factor = (\\n new_root.balance_factor - 1 + min(rotation_root.balance_factor, 0)\\n )\\n\",\"src/lib/pythonds3/trees/binary_heap.py\":\"#!/usr/bin/env python3\\n\\\"\\\"\\\"\\nBradley N. Miller, David L. Ranum\\nProblem Solving with Algorithms and Data Structures using Python\\nCopyright 2005\\nUpdated by Roman Yasinovskyy, 2017\\n\\\"\\\"\\\"\\n\\n\\nclass BinaryHeap:\\n \\\"\\\"\\\"Minimal Binary Heap\\\"\\\"\\\"\\n\\n def init(self):\\n \\\"\\\"\\\"Create a heap\\\"\\\"\\\"\\n self._heap = []\\n\\n def _perc_up(self, cur_idx):\\n \\\"\\\"\\\"Move a node up\\\"\\\"\\\"\\n while (cur_idx - 1) // 2 >= 0:\\n parent_idx = (cur_idx - 1) // 2\\n if self._heap[cur_idx] < self._heap[parent_idx]:\\n self._heap[cur_idx], self._heap[parent_idx] = (\\n self._heap[parent_idx],\\n self._heap[cur_idx],\\n )\\n cur_idx = parent_idx\\n\\n def _perc_down(self, cur_idx):\\n \\\"\\\"\\\"Move a node down\\\"\\\"\\\"\\n while 2 * cur_idx + 1 < len(self._heap):\\n min_child_idx = self._get_min_child(cur_idx)\\n if self._heap[cur_idx] > self._heap[min_child_idx]:\\n self._heap[cur_idx], self._heap[min_child_idx] = (\\n self._heap[min_child_idx],\\n self._heap[cur_idx],\\n )\\n else:\\n return\\n cur_idx = min_child_idx\\n\\n def _get_min_child(self, parent_idx):\\n \\\"\\\"\\\"Get a smaller child\\\"\\\"\\\"\\n if 2 * parent_idx + 2 > len(self._heap) - 1:\\n return 2 * parent_idx + 1\\n if self._heap[2 * parent_idx + 1] < self._heap[2 * parent_idx + 2]:\\n return 2 * parent_idx + 1\\n return 2 * parent_idx + 2\\n\\n def heapify(self, not_a_heap, show_details=False):\\n \\\"\\\"\\\"Build a heap from any list\\\"\\\"\\\"\\n self._heap = not_a_heap[:]\\n cur_idx = len(self._heap) // 2 - 1\\n while cur_idx >= 0:\\n self._perc_down(cur_idx)\\n cur_idx = cur_idx - 1\\n if show_details:\\n print(self._heap)\\n\\n def insert(self, item):\\n \\\"\\\"\\\"Add a new item\\\"\\\"\\\"\\n self._heap.append(item)\\n self._perc_up(len(self._heap) - 1)\\n\\n def delete(self):\\n \\\"\\\"\\\"Remove an item\\\"\\\"\\\"\\n self._heap[0], self._heap[-1] = self._heap[-1], self._heap[0]\\n result = self._heap.pop()\\n self._perc_down(0)\\n return result\\n\\n def is_empty(self):\\n \\\"\\\"\\\"Check if the heap is empty\\\"\\\"\\\"\\n return not bool(self._heap)\\n\\n def len(self):\\n \\\"\\\"\\\"Get heap size\\\"\\\"\\\"\\n return len(self._heap)\\n\\n def str(self):\\n \\\"\\\"\\\"Heap as a string\\\"\\\"\\\"\\n return str(self._heap)\\n\\n def contains(self, item):\\n \\\"\\\"\\\"containsin method override\\\"\\\"\\\"\\n return item in self._heap\\n\",\"src/lib/pythonds3/trees/binary_search_tree.py\":\"#!/usr/bin/env python3\\n\\\"\\\"\\\"\\nBradley N. Miller, David L. Ranum\\nProblem Solving with Algorithms and Data Structures using Python\\nCopyright 2005, 2010\\nUpdated by Roman Yasinovskyy, 2017\\n\\\"\\\"\\\"\\n\\n\\nclass BinaryTreeNode:\\n \\\"\\\"\\\"Binary Tree Node class\\\"\\\"\\\"\\n\\n def init(self, key, value, left=None, right=None, parent=None):\\n \\\"\\\"\\\"Create new Tree Node\\\"\\\"\\\"\\n self._key = key\\n self._value = value\\n self._child_left = left\\n self._child_right = right\\n self._parent = parent\\n\\n def get_child_left(self):\\n \\\"\\\"\\\"Return the node's left child\\\"\\\"\\\"\\n return self._child_left\\n\\n def set_child_left(self, node):\\n \\\"\\\"\\\"Assign the node's left child\\\"\\\"\\\"\\n self._child_left = node\\n\\n child_left = property(get_child_left, set_child_left)\\n\\n def get_child_right(self):\\n \\\"\\\"\\\"Return the node's right child\\\"\\\"\\\"\\n return self._child_right\\n\\n def set_child_right(self, node):\\n \\\"\\\"\\\"Assign the node's right child\\\"\\\"\\\"\\n self._child_right = node\\n\\n child_right = property(get_child_right, set_child_right)\\n\\n def get_parent(self):\\n \\\"\\\"\\\"Return the node's parent\\\"\\\"\\\"\\n return self._parent\\n\\n def set_parent(self, node):\\n \\\"\\\"\\\"Assign the node's parent\\\"\\\"\\\"\\n self._parent = node\\n\\n parent = property(get_parent, set_parent)\\n\\n def is_child_left(self):\\n \\\"\\\"\\\"Check if the node is a left child\\\"\\\"\\\"\\n return self._parent and self._parent.child_left == self\\n\\n def is_child_right(self):\\n \\\"\\\"\\\"Check if the node is a right child\\\"\\\"\\\"\\n return self._parent and self._parent.child_right == self\\n\\n def is_root(self):\\n \\\"\\\"\\\"Check if the node is a tree root\\\"\\\"\\\"\\n return not self._parent\\n\\n def is_leaf(self):\\n \\\"\\\"\\\"Check if the node is a leaf\\\"\\\"\\\"\\n return not (self._child_right or self._child_left)\\n\\n def has_a_child(self):\\n \\\"\\\"\\\"Check if the node has any child\\\"\\\"\\\"\\n return self._child_right or self._child_left\\n\\n def has_children(self):\\n \\\"\\\"\\\"Check if the node has both children\\\"\\\"\\\"\\n return self._child_right and self._child_left\\n\\n def get_key(self):\\n \\\"\\\"\\\"Get node key\\\"\\\"\\\"\\n return self._key\\n\\n def set_key(self, key):\\n \\\"\\\"\\\"Set node key\\\"\\\"\\\"\\n self._key = key\\n\\n key = property(get_key, set_key)\\n\\n def get_value(self):\\n \\\"\\\"\\\"Get node value\\\"\\\"\\\"\\n return self._value\\n\\n def set_value(self, value):\\n \\\"\\\"\\\"Set node value\\\"\\\"\\\"\\n self._value = value\\n\\n value = property(get_value, set_value)\\n\\n def replace_payload(self, key, value, left, right):\\n \\\"\\\"\\\"Change node payload\\\"\\\"\\\"\\n self._key = key\\n self._value = value\\n self._child_left = left\\n self._child_right = right\\n if self.child_left:\\n self._child_left.parent = self\\n if self.child_right:\\n self._child_right.parent = self\\n\\n def find_successor(self):\\n \\\"\\\"\\\"Find the node's successor\\\"\\\"\\\"\\n successor = None\\n if self._child_right:\\n successor = self._child_right.find_min()\\n else:\\n if self._parent:\\n if self.is_child_left():\\n successor = self._parent\\n else:\\n self._parent.child_right = None\\n successor = self._parent.find_successor()\\n self._parent.child_right = self\\n return successor\\n\\n def find_min(self):\\n \\\"\\\"\\\"Find the smallest node in the right subtree\\\"\\\"\\\"\\n current = self\\n while current.child_left:\\n current = current.child_left\\n return current\\n\\n def splice_out(self):\\n \\\"\\\"\\\"Splice out\\\"\\\"\\\"\\n if self.is_leaf():\\n if self.is_child_left():\\n self._parent.child_left = None\\n else:\\n self._parent.child_right = None\\n elif self.has_a_child():\\n if self.child_left:\\n if self.is_child_left():\\n self._parent.child_left = self._child_left\\n else:\\n self._parent.child_right = self._child_left\\n self._child_left.parent = self._parent\\n else:\\n if self.is_child_left():\\n self._parent.child_left = self._child_right\\n else:\\n self._parent.child_right = self._child_right\\n self._child_right.parent = self._parent\\n\\n def iter(self):\\n \\\"\\\"\\\"The standard inorder traversal of a binary tree\\\"\\\"\\\"\\n if self:\\n if self._child_left:\\n for elem in self._child_left:\\n yield elem\\n yield self._key\\n if self._child_right:\\n for elem in self._child_right:\\n yield elem\\n\\n\\nclass BinarySearchTree:\\n \\\"\\\"\\\"Binary search tree implementation\\\"\\\"\\\"\\n\\n def init(self):\\n self._root = None\\n self._size = 0\\n\\n def len(self):\\n \\\"\\\"\\\"Tree size\\\"\\\"\\\"\\n return self._size\\n\\n def size(self):\\n \\\"\\\"\\\"Tree size\\\"\\\"\\\"\\n return self._size\\n\\n def iter(self):\\n \\\"\\\"\\\"Iterator\\\"\\\"\\\"\\n return self._root.iter()\\n\\n def getitem(self, key):\\n \\\"\\\"\\\"[] getter operator override\\\"\\\"\\\"\\n result = self.get(key)\\n if result:\\n return result\\n raise KeyError(\\\"Error, key not in tree\\\")\\n\\n def get_root(self):\\n \\\"\\\"\\\"Get tree root\\\"\\\"\\\"\\n return self._root\\n\\n def set_root(self, node):\\n \\\"\\\"\\\"Set tree root\\\"\\\"\\\"\\n self._root = node\\n\\n root = property(get_root, set_root)\\n\\n def get(self, key):\\n \\\"\\\"\\\"Retrieve a value by the key\\\"\\\"\\\"\\n if self._root:\\n result = self._get(key, self._root)\\n if result:\\n return result.value\\n return None\\n else:\\n return None\\n\\n def _get(self, key, current_node):\\n \\\"\\\"\\\"Retrieve a value by the key (helper function)\\\"\\\"\\\"\\n if not current_node:\\n return None\\n if current_node.key == key:\\n return current_node\\n elif key < current_node.key:\\n return self._get(key, current_node.child_left)\\n else:\\n return self._get(key, current_node.child_right)\\n\\n def setitem(self, key, value):\\n \\\"\\\"\\\"[] setter operator override\\\"\\\"\\\"\\n self.put(key, value)\\n\\n def put(self, key, value):\\n \\\"\\\"\\\"Add new node\\\"\\\"\\\"\\n if self._root:\\n self._put(key, value, self._root)\\n else:\\n self._root = BinaryTreeNode(key, value)\\n self._size = self._size + 1\\n\\n def _put(self, key, value, current_node):\\n \\\"\\\"\\\"Add new node (helper function)\\\"\\\"\\\"\\n if key < current_node.key:\\n if current_node.child_left:\\n self._put(key, value, current_node.child_left)\\n else:\\n current_node.child_left = BinaryTreeNode(\\n key, value, parent=current_node\\n )\\n else:\\n if current_node.child_right:\\n self._put(key, value, current_node.child_right)\\n else:\\n current_node.child_right = BinaryTreeNode(\\n key, value, parent=current_node\\n )\\n\\n def contains(self, key):\\n \\\"\\\"\\\"in operator override\\\"\\\"\\\"\\n return bool(self._get(key, self._root))\\n\\n def delitem(self, key):\\n \\\"\\\"\\\"del operator override\\\"\\\"\\\"\\n self.delete(key)\\n\\n def delete(self, key):\\n \\\"\\\"\\\"Remove a node by its key\\\"\\\"\\\"\\n if self._size > 1:\\n node_to_remove = self._get(key, self._root)\\n if node_to_remove:\\n self._delete(node_to_remove)\\n self._size = self._size - 1\\n else:\\n raise KeyError(\\\"Error, key not in tree\\\")\\n elif self._size == 1 and self._root.key == key:\\n self._root = None\\n self._size = self._size - 1\\n else:\\n raise KeyError(\\\"Error, key not in tree\\\")\\n\\n def _delete(self, current_node):\\n \\\"\\\"\\\"Remove a node by its key (helper function)\\\"\\\"\\\"\\n if current_node.is_leaf(): # removing a leaf\\n if current_node == current_node.parent.child_left:\\n current_node.parent.child_left = None\\n else:\\n current_node.parent.child_right = None\\n elif current_node.has_children(): # removing a node with two children\\n successor = current_node.find_successor()\\n successor.splice_out()\\n current_node.key = successor.key\\n current_node.value = successor.value\\n else: # removing a node with one child\\n if current_node.get_child_left():\\n if current_node.is_child_left():\\n current_node.child_left.parent = current_node.parent\\n current_node.parent.child_left = current_node.child_left\\n elif current_node.is_child_right():\\n current_node.child_left.parent = current_node.parent\\n current_node.parent.child_right = current_node.child_left\\n else:\\n current_node.replace_payload(\\n current_node.child_left.key,\\n current_node.child_left.value,\\n current_node.child_left.child_left,\\n current_node.child_left.child_right,\\n )\\n else:\\n if current_node.is_child_left():\\n current_node.child_right.parent = current_node.parent\\n current_node.parent.child_left = current_node.child_right\\n elif current_node.is_child_right():\\n current_node.child_right.parent = current_node.parent\\n current_node.parent.child_right = current_node.child_right\\n else:\\n current_node.replace_payload(\\n current_node.child_right.key,\\n current_node.child_right.value,\\n current_node.child_right.child_left,\\n current_node.child_right.child_right,\\n )\\n\\n def inorder(self):\\n \\\"\\\"\\\"In-order tree traversal\\\"\\\"\\\"\\n self._inorder(self._root)\\n\\n def _inorder(self, tree):\\n \\\"\\\"\\\"In-order tree traversal (helper function)\\\"\\\"\\\"\\n if tree:\\n self._inorder(tree.child_left)\\n print(tree.key, end=\\\" \\\")\\n self._inorder(tree.child_right)\\n\\n def postorder(self):\\n \\\"\\\"\\\"Post-order tree traversal\\\"\\\"\\\"\\n self._postorder(self._root)\\n\\n def _postorder(self, tree):\\n \\\"\\\"\\\"Post-order tree traversal (helper function)\\\"\\\"\\\"\\n if tree:\\n self._postorder(tree.child_left)\\n self._postorder(tree.child_right)\\n print(tree.key, end=\\\" \\\")\\n\\n def preorder(self):\\n \\\"\\\"\\\"Pre-order tree traversal\\\"\\\"\\\"\\n self._preorder(self._root)\\n\\n def _preorder(self, tree):\\n \\\"\\\"\\\"Pre-order tree traversal (helper function)\\\"\\\"\\\"\\n if tree:\\n print(tree.key, end=\\\" \\\")\\n self._preorder(tree.child_left)\\n self._preorder(tree.child_right)\\n\\n def clear(self):\\n \\\"\\\"\\\"Remove all nodes\\\"\\\"\\\"\\n while self._root:\\n self.delete(self._root.key)\\n\",\"src/lib/pythonds3/trees/binary_tree.py\":\"#!/usr/bin/env python3\\n\\\"\\\"\\\"\\nBradley N. Miller, David L. Ranum\\nProblem Solving with Algorithms and Data Structures using Python\\nCopyright 2005\\nUpdated by Roman Yasinovskyy, 2017\\n\\\"\\\"\\\"\\n\\nimport operator\\n\\n\\nclass BinaryTree:\\n \\\"\\\"\\\"\\n A recursive implementation of Binary Tree\\n Using links and Nodes approach.\\n\\n Modified to allow for trees to be constructed from other trees\\n rather than always creating a new tree in the insert_feft or insert_right\\n \\\"\\\"\\\"\\n\\n def init(self, key):\\n \\\"\\\"\\\"Create new tree\\\"\\\"\\\"\\n self._key = key\\n self._child_left = None\\n self._child_right = None\\n\\n def get_root_val(self):\\n \\\"\\\"\\\"Get root key value\\\"\\\"\\\"\\n return self._key\\n\\n def set_root_val(self, key):\\n \\\"\\\"\\\"Set root key value\\\"\\\"\\\"\\n self._key = key\\n\\n root = property(get_root_val, set_root_val)\\n\\n def get_child_left(self):\\n \\\"\\\"\\\"Get left child\\\"\\\"\\\"\\n return self._child_left\\n\\n def set_child_left(self, node):\\n \\\"\\\"\\\"Set left child\\\"\\\"\\\"\\n self._child_left = node\\n\\n child_left = property(get_child_left, set_child_left)\\n\\n def get_child_right(self):\\n \\\"\\\"\\\"Get right child\\\"\\\"\\\"\\n return self._child_right\\n\\n def set_child_right(self, node):\\n \\\"\\\"\\\"Set right child\\\"\\\"\\\"\\n self._child_right = node\\n\\n child_right = property(get_child_right, set_child_right)\\n\\n def is_leaf(self):\\n \\\"\\\"\\\"Check if a node is leaf\\\"\\\"\\\"\\n return (not self._child_left) and (not self._child_right)\\n\\n def insert_left(self, new_node):\\n \\\"\\\"\\\"Insert left subtree\\\"\\\"\\\"\\n if isinstance(new_node, BinaryTree):\\n new_subtree = new_node\\n else:\\n new_subtree = BinaryTree(new_node)\\n\\n if self._child_left:\\n new_subtree.set_child_left(self._child_left)\\n\\n self._child_left = new_subtree\\n\\n def insert_right(self, new_node):\\n \\\"\\\"\\\"Insert right subtree\\\"\\\"\\\"\\n if isinstance(new_node, BinaryTree):\\n new_subtree = new_node\\n else:\\n new_subtree = BinaryTree(new_node)\\n\\n if self._child_right:\\n new_subtree.set_child_right(self._child_right)\\n self._child_right = new_subtree\\n\\n def preorder(self):\\n \\\"\\\"\\\"Pre-order tree traversal\\\"\\\"\\\"\\n print(self._key, end=\\\" \\\")\\n if self._child_left:\\n self._child_left.preorder()\\n if self._child_right:\\n self._child_right.preorder()\\n\\n def inorder(self):\\n \\\"\\\"\\\"In-order tree traversal\\\"\\\"\\\"\\n if self._child_left:\\n self._child_left.inorder()\\n print(self._key, end=\\\" \\\")\\n if self._child_right:\\n self._child_right.inorder()\\n\\n def postorder(self):\\n \\\"\\\"\\\"Post-order tree traversal\\\"\\\"\\\"\\n if self._child_left:\\n self._child_left.postorder()\\n if self._child_right:\\n self._child_right.postorder()\\n print(self._key, end=\\\" \\\")\\n\\n def print_exp(self):\\n \\\"\\\"\\\"Print an expression\\\"\\\"\\\"\\n if self._child_left:\\n print(\\\"(\\\", end=\\\" \\\")\\n self._child_left.print_exp()\\n print(self._key, end=\\\" \\\")\\n if self._child_right:\\n self._child_right.print_exp()\\n print(\\\")\\\", end=\\\" \\\")\\n\\n def postorder_eval(self):\\n \\\"\\\"\\\"Postorder evaluation\\\"\\\"\\\"\\n operations = {\\n \\\"+\\\": operator.add,\\n \\\"-\\\": operator.sub,\\n \\\"\\\": operator.mul,\\n \\\"/\\\": operator.truediv,\\n }\\n result_1 = None\\n result_2 = None\\n if self._child_left:\\n result_1 = self._child_left.postorder_eval()\\n if self._child_right:\\n result_2 = self._child_right.postorder_eval()\\n if result_1 and result_2:\\n return operations[self._key](result_1, result_2)\\n return self._key\\n\\n def height(self):\\n \\\"\\\"\\\"Height of a tree\\\"\\\"\\\"\\n if not self._key:\\n return -1\\n if self._child_left:\\n height_left = self._child_left.height()\\n else:\\n height_left = -1\\n\\n if self._child_right:\\n height_right = self._child_right.height()\\n else:\\n height_right = -1\\n\\n return 1 + max(height_left, height_right)\\n\\n def len(self):\\n \\\"\\\"\\\"Size of a tree\\\"\\\"\\\"\\n return self.size()\\n\\n def size(self):\\n \\\"\\\"\\\"Count nodes in a tree\\\"\\\"\\\"\\n if not self._key:\\n return 0\\n if self._child_left:\\n children_left = self._child_left.size()\\n else:\\n children_left = 0\\n\\n if self._child_right:\\n children_right = self._child_right.size()\\n else:\\n children_right = 0\\n\\n return 1 + children_left + children_right\\n\",\"src/lib/pythonds3/trees/priority_queue.py\":\"#!/usr/bin/env python3\\n\\\"\\\"\\\"\\nBradley N. Miller, David L. Ranum\\nProblem Solving with Algorithms and Data Structures using Python\\nCopyright 2005\\nUpdated by Roman Yasinovskyy, 2017\\n\\\"\\\"\\\"\\n\\nfrom pythonds3.trees.binary_heap import BinaryHeap\\n\\n\\nclass PriorityQueue(BinaryHeap):\\n \\\"\\\"\\\"\\n This implementation of binary heap takes (key, value) pairs where key signifies priority\\n We will assume that the keys are all comparable.\\n \\\"\\\"\\\"\\n\\n def change_priority(self, new_priority, value):\\n \\\"\\\"\\\"Change the priority\\\"\\\"\\\"\\n key_to_move = 0\\n for i in range(len(self._heap)):\\n if self._heap[i][1] == value:\\n key_to_move = i\\n break\\n if key_to_move > -1:\\n self._heap[key_to_move] = (new_priority, self._heap[key_to_move][1])\\n self._perc_up(key_to_move)\\n\",\"src/lib/pythoned/init.py\":\"\",\"src/lib/pythoned/arboles/init.py\":\"\\n\\n\\nfrom .avl import ArbolAVL\\nfrom .abb import ArbolBinarioBusqueda\\nfrom .monticuloBinario import MonticuloBinario\\n\\n\\n\",\"src/lib/pythoned/arboles/abb.py\":\"# Bradley N. Miller, David L. Ranum\\n# Solución de problemas con algoritmos y estructuras de datos usando Python\\n# Copyright 2014\\n#\\n#abb.py\\n\\nclass ArbolBinarioBusqueda:\\n\\n def init(self):\\n self.raiz = None\\n self.tamano = 0\\n\\n def agregar(self,clave,valor):\\n if self.raiz:\\n self._agregar(clave,valor,self.raiz)\\n else:\\n self.raiz = NodoArbol(clave,valor)\\n self.tamano = self.tamano + 1\\n\\n def _agregar(self,clave,valor,nodoActual):\\n if clave < nodoActual.clave:\\n if nodoActual.tieneHijoIzquierdo():\\n self._agregar(clave,valor,nodoActual.hijoIzquierdo)\\n else:\\n nodoActual.hijoIzquierdo = NodoArbol(clave,valor,padre=nodoActual)\\n else:\\n if nodoActual.tieneHijoDerecho():\\n self._agregar(clave,valor,nodoActual.hijoDerecho)\\n else:\\n nodoActual.hijoDerecho = NodoArbol(clave,valor,padre=nodoActual)\\n \\n def setitem(self,c,v):\\n self.agregar(c,v)\\n\\n def obtener(self,clave):\\n if self.raiz:\\n res = self._obtener(clave,self.raiz)\\n if res:\\n return res.cargaUtil\\n else:\\n return None\\n else:\\n return None\\n\\n def _obtener(self,clave,nodoActual):\\n \\tif not nodoActual:\\n \\t return None\\n \\telif nodoActual.clave == clave:\\n \\t return nodoActual\\n \\telif clave < nodoActual.clave:\\n \\t return self._obtener(clave,nodoActual.hijoIzquierdo)\\n \\telse:\\n \\t return self._obtener(clave,nodoActual.hijoDerecho) \\n\\n def getitem(self,clave):\\n res = self.obtener(clave) \\n if res:\\n return res\\n else:\\n raise KeyError('Error, la clave no está en el árbol')\\n\\n def contains(self,clave):\\n \\tif self._obtener(clave,self.raiz):\\n \\t return True\\n \\telse:\\n \\t return False\\n \\n def longitud(self):\\n return self.tamano\\n\\n def len(self):\\n return self.tamano\\n\\n def iter(self):\\n return self.raiz.iter()\\n\\n def eliminar(self,clave):\\n if self.tamano > 1:\\n nodoAEliminar = self._obtener(clave,self.raiz)\\n \\t if nodoAEliminar:\\n \\t self.remover(nodoAEliminar)\\n \\t self.tamano = self.tamano-1\\n \\t else:\\n \\t raise KeyError('Error, la clave no está en el árbol')\\n elif self.tamano == 1 and self.raiz.clave == clave:\\n \\t self.raiz = None\\n \\t self.tamano = self.tamano - 1\\n else:\\n \\t raise KeyError('Error, la clave no está en el árbol')\\n\\n def delitem(self,clave):\\n self.eliminar(clave)\\n\\n def remover(self,nodoActual):\\n if nodoActual.esHoja(): #hoja\\n if nodoActual == nodoActual.padre.hijoIzquierdo:\\n nodoActual.padre.hijoIzquierdo = None\\n else:\\n nodoActual.padre.hijoDerecho = None\\n elif nodoActual.tieneAmbosHijos(): #interior\\n suc = nodoActual.encontrarSucesor()\\n suc.empalmar()\\n nodoActual.clave = suc.clave\\n nodoActual.cargaUtil = suc.cargaUtil\\n\\n else: # este nodo tiene un (1) hijo\\n if nodoActual.tieneHijoIzquierdo():\\n if nodoActual.esHijoIzquierdo():\\n nodoActual.hijoIzquierdo.padre = nodoActual.padre\\n nodoActual.padre.hijoIzquierdo = nodoActual.hijoIzquierdo\\n elif nodoActual.esHijoDerecho():\\n nodoActual.hijoIzquierdo.padre = nodoActual.padre\\n nodoActual.padre.hijoDerecho = nodoActual.hijoIzquierdo\\n else:\\n nodoActual.reemplazarDatoDeNodo(nodoActual.hijoIzquierdo.clave, nodoActual.hijoIzquierdo.cargaUtil, nodoActual.hijoIzquierdo.hijoIzquierdo, nodoActual.hijoIzquierdo.hijoDerecho)\\n else:\\n if nodoActual.esHijoIzquierdo():\\n nodoActual.hijoDerecho.padre = nodoActual.padre\\n nodoActual.padre.hijoIzquierdo = nodoActual.hijoDerecho\\n elif nodoActual.esHijoDerecho():\\n nodoActual.hijoDerecho.padre = nodoActual.padre\\n nodoActual.padre.hijoDerecho = nodoActual.hijoDerecho\\n else:\\n nodoActual.reemplazarDatoDeNodo(nodoActual.hijoDerecho.clave, nodoActual.hijoDerecho.cargaUtil, nodoActual.hijoDerecho.hijoIzquierdo, nodoActual.hijoDerecho.hijoDerecho)\\n\\n def inorden(self):\\n self._inorden(self.raiz)\\n\\n def _inorden(self,arbol):\\n if arbol != None:\\n self._inorden(arbol.hijoIzquierdo)\\n print(arbol.clave)\\n self._inorden(arbol.hijoDerecho)\\n\\n def postorden(self):\\n self._postorden(self.raiz)\\n\\n def _postorden(self, arbol):\\n if arbol:\\n self._postorden(arbol.hijoDerecho)\\n self._postorden(arbol.hijoIzquierdo)\\n print(arbol.clave) \\n\\n def preorden(self):\\n self._preorden(self,self.raiz)\\n\\n def _preorden(self,arbol):\\n if arbol:\\n print(arbol.clave) \\n self._preorden(arbol.hijoIzquierdo)\\n self._preorden(arbol.hijoDerecho)\\n\\n\\nclass NodoArbol:\\n def init(self,clave,valor,izquierdo=None,derecho=None,padre=None):\\n self.clave = clave\\n self.cargaUtil = valor\\n self.hijoIzquierdo = izquierdo\\n self.hijoDerecho = derecho\\n self.padre = padre\\n self.factorEquilibrio = 0\\n\\n def tieneHijoIzquierdo(self):\\n return self.hijoIzquierdo\\n \\n def tieneHijoDerecho(self):\\n return self.hijoDerecho\\n\\n def esHijoIzquierdo(self):\\n return self.padre and self.padre.hijoIzquierdo == self\\n \\n def esHijoDerecho(self):\\n return self.padre and self.padre.hijoDerecho == self\\n\\n def esRaiz(self):\\n return not self.padre\\n\\n def esHoja(self):\\n return not (self.hijoDerecho or self.hijoIzquierdo)\\n\\n def tieneAlgunHijo(self):\\n return self.hijoDerecho or self.hijoIzquierdo\\n\\n def tieneAmbosHijos(self):\\n return self.hijoDerecho and self.hijoIzquierdo\\n\\n def reemplazarDatoDeNodo(self,clave,valor,hizq,hder):\\n self.clave = clave\\n self.cargaUtil = valor\\n self.hijoIzquierdo = hizq\\n self.hijoDerecho = hder\\n if self.tieneHijoIzquierdo():\\n self.hijoIzquierdo.padre = self\\n if self.tieneHijoDerecho():\\n self.hijoDerecho.padre = self \\n\\n def encontrarSucesor(self):\\n suc = None\\n if self.tieneHijoDerecho():\\n suc = self.hijoDerecho.encontrarMin()\\n else:\\n if self.padre:\\n if self.esHijoIzquierdo():\\n suc = self.padre\\n else:\\n self.padre.hijoDerecho = None\\n suc = self.padre.encontrarSucesor()\\n self.padre.hijoDerecho = self\\n return suc\\n\\n def empalmar(self):\\n if self.esHoja():\\n if self.esHijoIzquierdo():\\n self.padre.hijoIzquierdo = None\\n else:\\n self.padre.hijoDerecho = None\\n elif self.tieneAlgunHijo():\\n if self.tieneHijoIzquierdo():\\n if self.esHijoIzquierdo():\\n self.padre.hijoIzquierdo = self.hijoIzquierdo\\n else:\\n self.padre.hijoDerecho = self.hijoIzquierdo\\n self.hijoIzquierdo.padre = self.padre\\n else:\\n if self.esHijoIzquierdo():\\n self.padre.hijoIzquierdo = self.hijoDerecho\\n else:\\n self.padre.hijoDerecho = self.hijoDerecho\\n self.hijoDerecho.padre = self.padre\\n\\n def encontrarMin(self):\\n actual = self\\n while actual.tieneHijoIzquierdo():\\n actual = actual.hijoIzquierdo\\n return actual\\n\\n def iter(self):\\n if self:\\n \\t if self.tieneHijoIzquierdo():\\n \\t for elem in self.hijoIzquierdo:\\n \\t\\t yield elem\\n yield self.clave\\n \\t if self.tieneHijoDerecho():\\n for elem in self.hijoDerecho:\\n \\t\\t yield elem\\n\",\"src/lib/pythoned/arboles/arbolBinario.py\":\"# Bradley N. Miller, David L. Ranum\\n# Solución de problemas con algoritmos y estructuras de datos usando Python\\n# Copyright 2014\\n# \\n#arbolBinario.py\\n\\nclass ArbolBinario:\\n def init(self,objetoRaiz):\\n self.clave = objetoRaiz\\n self.hijoIzquierdo = None\\n self.hijoDerecho = None\\n \\n def insertarIzquierdo(self,nuevoNodo):\\n if self.hijoIzquierdo == None:\\n self.hijoIzquierdo = ArbolBinario(nuevoNodo)\\n else: \\n t = ArbolBinario(nuevoNodo)\\n t.hijoIzquierdo = self.hijoIzquierdo\\n self.hijoIzquierdo = t\\n\\n def insertarDerecho(self,nuevoNodo):\\n if self.hijoDerecho == None:\\n self.hijoDerecho = ArbolBinario(nuevoNodo)\\n else:\\n t = ArbolBinario(nuevoNodo)\\n t.hijoDerecho = self.hijoDerecho\\n self.hijoDerecho = t\\n\\n def esHoja(self):\\n return ((not self.hijoIzquierdo) and (not self.hijoDerecho))\\n\\n def obtenerHijoDerecho(self):\\n return self.hijoDerecho\\n \\n def obtenerHijoIzquierdo(self):\\n return self.hijoIzquierdo\\n \\n def asignarValorRaiz(self,obj):\\n self.clave = obj\\n\\n def obtenerValorRaiz(self):\\n return self.clave\\n\\n def inorden(self):\\n if self.hijoIzquierdo:\\n self.hijoIzquierdo.inorden()\\n print(self.clave)\\n if self.hijoDerecho:\\n self.hijoDerecho.inorden()\\n\\n def postorden(self):\\n if self.hijoIzquierdo:\\n self.hijoIzquierdo.postorden()\\n if self.hijoDerecho:\\n self.hijoDerecho.postorden()\\n print(self.clave)\\n\\n def preorden(self):\\n print(self.clave)\\n if self.hijoIzquierdo:\\n self.hijoIzquierdo.preorden()\\n if self.hijoDerecho:\\n self.hijoDerecho.preorden()\\n\\n def imprimirExpresion(self):\\n if self.hijoIzquierdo:\\n print('(', end=' ')\\n self.hijoIzquierdo.imprimirExpresion()\\n print(self.clave, end=' ')\\n if self.hijoDerecho:\\n self.hijoDerecho.imprimirExpresion()\\n print(')', end=' ')\\n\\n def evalPostorden(self):\\n opers = {'+':operator.add, '-':operator.sub, '':operator.mul, '/':operator.truediv}\\n res1 = None\\n res2 = None\\n if self.hijoIzquierdo:\\n res1 = self.hijoIzquierdo.evalPostorden() #// \\\\label{peleft}\\n if self.hijoDerecho:\\n res2 = self.hijoDerecho.evalPostorden() #// \\\\label{peright}\\n if res1 and res2:\\n return opers[self.clave](res1,res2) #// \\\\label{peeval}\\n else:\\n return self.clave\\n\\ndef inorden(arbol):\\n if arbol != None:\\n inorden(arbol.obtenerHijoIzquierdo())\\n print(arbol.obtenerValorRaiz())\\n inorden(arbol.obtenerHijoDerecho())\\n\\ndef imprimirExpresion(arbol):\\n if arbol.hijoIzquierdo:\\n print('(', end=' ')\\n imprimirExpresion(arbol.obtenerHijoIzquierdo())\\n print(arbol.obtenerValorRaiz(), end=' ')\\n if arbol.hijoDerecho:\\n imprimirExpresion(arbol.obtenerHijoDerecho())\\n print(')', end=' ') \\n\\ndef imprimirExpresion(arbol):\\n valorCadena = \