{"version":3,"sources":["webpack:///webpack/bootstrap","webpack:///./gen/astnodes.js","webpack:///./gen/parse_tables.js","webpack:///./node_modules/fastestsmallesttextencoderdecoder/EncoderDecoderTogether.min.js","webpack:///./node_modules/jsbi/dist/jsbi-umd.js","webpack:///./node_modules/process/browser.js","webpack:///./node_modules/setimmediate/setImmediate.js","webpack:///./node_modules/strftime/strftime.js","webpack:///(webpack)/buildin/global.js","webpack:///./src/abstract.js","webpack:///./src/assert-dev.js","webpack:///./src/ast.js","webpack:///./src/bool.js","webpack:///./src/builtin.js","webpack:///./src/builtindict.js","webpack:///./src/bytes.js","webpack:///./src/check.js","webpack:///./src/compile.js","webpack:///./src/complex.js","webpack:///./src/constants.js","webpack:///./src/descr.js","webpack:///./src/dict.js","webpack:///./src/dictviews.js","webpack:///./src/enumerate.js","webpack:///./src/env.js","webpack:///./src/errors.js","webpack:///./src/ffi.js","webpack:///./src/file.js","webpack:///./src/filter.js","webpack:///./src/float.js","webpack:///./src/formatting.js","webpack:///./src/function.js","webpack:///./src/generator.js","webpack:///./src/generic.js","webpack:///./src/generic_alias.js","webpack:///./src/import.js","webpack:///./src/int.js","webpack:///./src/internalpython.js","webpack:///./src/list.js","webpack:///./src/main.js","webpack:///./src/map.js","webpack:///./src/mappingproxy.js","webpack:///./src/method.js","webpack:///./src/misceval.js","webpack:///./src/module.js","webpack:///./src/nonetype.js","webpack:///./src/object.js","webpack:///./src/parser.js","webpack:///./src/print.js","webpack:///./src/property_class_static.js","webpack:///./src/range.js","webpack:///./src/reversed.js","webpack:///./src/set.js","webpack:///./src/simple_iterators.js","webpack:///./src/sk_method.js","webpack:///./src/slice.js","webpack:///./src/slotdefs.js","webpack:///./src/str.js","webpack:///./src/structseq.js","webpack:///./src/super.js","webpack:///./src/symtable.js","webpack:///./src/timsort.js","webpack:///./src/token.js","webpack:///./src/tokenize.js","webpack:///./src/tuple.js","webpack:///./src/type.js","webpack:///./src/util.js","webpack:///./src/zip.js","webpack:///./support/polyfills/JSBI.js","webpack:///./support/polyfills/Unicode.js","webpack:///./support/polyfills/es6.js"],"names":[],"mappings":";QAAA;QACA;;QAEA;QACA;;QAEA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;;QAEA;QACA;;QAEA;QACA;;QAEA;QACA;QACA;;;QAGA;QACA;;QAEA;QACA;;QAEA;QACA;QACA;QACA,0CAA0C,gCAAgC;QAC1E;QACA;;QAEA;QACA;QACA;QACA,wDAAwD,kBAAkB;QAC1E;QACA,iDAAiD,cAAc;QAC/D;;QAEA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA,yCAAyC,iCAAiC;QAC1E,gHAAgH,mBAAmB,EAAE;QACrI;QACA;;QAEA;QACA;QACA;QACA,2BAA2B,0BAA0B,EAAE;QACvD,iCAAiC,eAAe;QAChD;QACA;QACA;;QAEA;QACA,sDAAsD,+DAA+D;;QAErH;QACA;;;QAGA;QACA;;;;;;;;;;;;AClFA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;AAQA;AACA;AACA;;;;;;AAMA;AACA,yCAAyC,WAAW,cAAc,OAAO;AACzE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,mDAAmD,WAAW;AAC9D;AACA;AACA;AACA;;AAEA;AACA,iDAAiD,QAAQ;AACzD;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,WAAW;AAClD;AACA;AACA;AACA;;AAEA;AACA,mDAAmD,WAAW;AAC9D,qDAAqD,cAAc;AACnE,qDAAqD,WAAW;AAChE,qDAAqD,WAAW;AAChE;AACA,qDAAqD,QAAQ;AAC7D,qDAAqD,OAAO;AAC5D,qDAAqD,IAAI,gBAAgB;AACzE,uEAAuE,IAAI;AAC3E,oEAAoE,IAAI;AACxE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,6DAA6D,WAAW;AACxE;AACA,+DAA+D;AAC/D;AACA,+DAA+D,WAAW;AAC1E;AACA,+DAA+D,WAAW;AAC1E;AACA,kEAAkE,QAAQ;AAC1E;AACA,+DAA+D,OAAO;AACtE;AACA,+DAA+D,IAAI;AACnE,kEAAkE,IAAI;AACtE;AACA,+DAA+D,IAAI;AACnE;AACA,+DAA+D,IAAI;AACnE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,6CAA6C,WAAW,cAAc;AACtE,gDAAgD,eAAe,WAAW;AAC1E,4DAA4D,WAAW;AACvE,wDAAwD,WAAW;AACnE,kEAAkE,OAAO;AACzE,6DAA6D,IAAI;AACjE,+CAA+C,IAAI,oBAAoB,IAAI;AAC3E,8DAA8D,IAAI;AAClE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,yCAAyC,QAAQ,eAAe,IAAI;AACpE,8CAA8C,IAAI,oBAAoB,IAAI;AAC1E,0DAA0D,IAAI;AAC9D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,yCAAyC,WAAW,iBAAiB,IAAI;AACzE,sDAAsD,IAAI;AAC1D,2CAA2C,IAAI,oBAAoB,IAAI;AACvE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,yCAAyC,WAAW,iBAAiB;AACrE,wDAAwD,IAAI;AAC5D,2CAA2C,IAAI,oBAAoB,IAAI;AACvE,0DAA0D,IAAI;AAC9D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,+CAA+C,QAAQ;AACvD,iDAAiD,YAAY;AAC7D,iDAAiD,QAAQ,eAAe,IAAI;AAC5E,4DAA4D,IAAI;AAChE,oDAAoD,IAAI;AACxD,iDAAiD,IAAI;AACrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,+CAA+C,QAAQ,gBAAgB;AACvE,mEAAmE,QAAQ;AAC3E,2DAA2D,IAAI;AAC/D,iDAAiD,IAAI,gBAAgB,IAAI;AACzE,gEAAgE,IAAI;AACpE,gEAAgE,IAAI;AACpE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,mCAAmC,QAAQ,gBAAgB,QAAQ;AACnE,qCAAqC,WAAW,cAAc,WAAW;AACzE,gDAAgD,IAAI,gBAAgB,IAAI;AACxE,oDAAoD,IAAI;AACxD,qCAAqC,IAAI;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,6CAA6C,QAAQ,gBAAgB;AACrE,2DAA2D,WAAW;AACtE,kDAAkD,WAAW;AAC7D,+CAA+C,IAAI,gBAAgB,IAAI;AACvE,8DAA8D,IAAI;AAClE,8DAA8D,IAAI;AAClE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,QAAQ,cAAc,WAAW;AACxE,kDAAkD,WAAW;AAC7D,yCAAyC,IAAI,gBAAgB,IAAI;AACjE,wDAAwD,IAAI;AAC5D,yCAAyC,IAAI;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,iCAAiC,QAAQ,cAAc,WAAW;AAClE,mCAAmC,WAAW,gBAAgB,IAAI;AAClE,sCAAsC,IAAI,oBAAoB,IAAI;AAClE,kDAAkD,IAAI;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,qCAAqC,WAAW,eAAe,WAAW;AAC1E,gDAAgD,IAAI,gBAAgB,IAAI;AACxE,sDAAsD,IAAI;AAC1D,uCAAuC,IAAI;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,+CAA+C,WAAW;AAC1D,iDAAiD,WAAW,cAAc;AAC1E,+DAA+D,IAAI;AACnE,gEAAgE,IAAI;AACpE,gEAAgE,IAAI;AACpE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,QAAQ,aAAa,QAAQ;AACpE,4CAA4C,QAAQ,cAAc,QAAQ;AAC1E,mDAAmD,IAAI,gBAAgB,IAAI;AAC3E,wDAAwD,IAAI;AAC5D,yCAAyC,IAAI;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,mCAAmC,WAAW,cAAc,WAAW;AACvE,kDAAkD,WAAW;AAC7D,qCAAqC,WAAW,mBAAmB,IAAI;AACvE,gDAAgD,IAAI,oBAAoB,IAAI;AAC5E,oDAAoD,IAAI;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,yCAAyC,QAAQ,cAAc,QAAQ;AACvE,8CAA8C,IAAI,gBAAgB,IAAI;AACtE,0DAA0D,IAAI;AAC9D,8CAA8C,IAAI;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,yCAAyC,WAAW,eAAe,IAAI;AACvE,sDAAsD,IAAI;AAC1D,2CAA2C,IAAI,oBAAoB,IAAI;AACvE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,iDAAiD,WAAW;AAC5D,mDAAmD,WAAW;AAC9D,mDAAmD,IAAI,eAAe,IAAI;AAC1E,8DAA8D,IAAI;AAClE,kEAAkE,IAAI;AACtE,kEAAkE,IAAI;AACtE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,yCAAyC,WAAW,eAAe,IAAI;AACvE,sDAAsD,IAAI;AAC1D,2CAA2C,IAAI,oBAAoB,IAAI;AACvE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,6CAA6C,WAAW,eAAe,IAAI;AAC3E,0DAA0D,IAAI;AAC9D,kDAAkD,IAAI,oBAAoB;AAC1E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,qCAAqC,QAAQ,eAAe,IAAI;AAChE,uCAAuC,IAAI,oBAAoB,IAAI;AACnE,sDAAsD,IAAI;AAC1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,qCAAqC,IAAI,gBAAgB,IAAI;AAC7D,uCAAuC,IAAI,oBAAoB,IAAI;AACnE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,IAAI,gBAAgB,IAAI;AAC/D,4CAA4C,IAAI,oBAAoB,IAAI;AACxE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,6CAA6C,IAAI,gBAAgB,IAAI;AACrE,8DAA8D,IAAI;AAClE,8DAA8D,IAAI;AAClE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,QAAQ,cAAc,WAAW;AACxE,oDAAoD,IAAI,YAAY,IAAI;AACxE,oDAAoD,IAAI;AACxD,yCAAyC,IAAI,oBAAoB,IAAI;AACrE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,6CAA6C,IAAI,gBAAgB,IAAI;AACrE,8DAA8D,IAAI;AAClE,8DAA8D,IAAI;AAClE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,yCAAyC,UAAU,YAAY,WAAW;AAC1E,sDAAsD,IAAI,gBAAgB;AAC1E,6DAA6D,IAAI;AACjE,0DAA0D,IAAI;AAC9D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,QAAQ,cAAc,YAAY;AACzE,gDAAgD,QAAQ,eAAe,IAAI;AAC3E,oDAAoD,IAAI;AACxD,yCAAyC,IAAI,oBAAoB,IAAI;AACrE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,2CAA2C,WAAW,YAAY,QAAQ;AAC1E,yDAAyD,IAAI;AAC7D,6CAA6C,IAAI,oBAAoB,IAAI;AACzE,4DAA4D,IAAI;AAChE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,yCAAyC,cAAc,cAAc;AACrE,uDAAuD,IAAI,gBAAgB;AAC3E,6DAA6D,IAAI;AACjE,0DAA0D,IAAI;AAC9D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,QAAQ,cAAc,QAAQ;AACrE,4CAA4C,QAAQ,gBAAgB,IAAI;AACxE,oDAAoD,IAAI;AACxD,yCAAyC,IAAI,oBAAoB,IAAI;AACrE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,qCAAqC,WAAW,cAAc,WAAW;AACzE,kDAAkD,IAAI,gBAAgB,IAAI;AAC1E,sDAAsD,IAAI;AAC1D,uCAAuC,IAAI;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,mCAAmC,WAAW,cAAc,IAAI;AAChE,qCAAqC,IAAI,oBAAoB,IAAI;AACjE,oDAAoD,IAAI;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,6CAA6C,QAAQ,aAAa;AAClE,iEAAiE,IAAI;AACrE,0DAA0D,IAAI;AAC9D,kDAAkD,IAAI,oBAAoB;AAC1E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,2CAA2C,QAAQ,aAAa,WAAW;AAC3E,4DAA4D,IAAI;AAChE,6CAA6C,IAAI,oBAAoB,IAAI;AACzE,4DAA4D,IAAI;AAChE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,6CAA6C,QAAQ,aAAa,QAAQ;AAC1E,yDAAyD,WAAW;AACpE,8DAA8D,IAAI;AAClE,kDAAkD,IAAI,oBAAoB;AAC1E,iEAAiE,IAAI;AACrE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,qDAAqD,QAAQ;AAC7D,uDAAuD,WAAW;AAClE,sEAAsE,IAAI;AAC1E,kEAAkE,IAAI;AACtE,sEAAsE,IAAI;AAC1E,sEAAsE,IAAI;AAC1E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,QAAQ,eAAe,IAAI;AAClE,4CAA4C,IAAI,oBAAoB,IAAI;AACxE,wDAAwD,IAAI;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,QAAQ,eAAe,IAAI;AAClE,4CAA4C,IAAI,oBAAoB,IAAI;AACxE,wDAAwD,IAAI;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,+CAA+C,QAAQ,eAAe,IAAI;AAC1E,4DAA4D,IAAI;AAChE,oDAAoD,IAAI;AACxD,iDAAiD,IAAI;AACrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,2CAA2C,QAAQ,cAAc;AACjE,8CAA8C,aAAa,WAAW;AACtE,6DAA6D,IAAI;AACjE,6CAA6C,IAAI,oBAAoB,IAAI;AACzE,4DAA4D,IAAI;AAChE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,qCAAqC,QAAQ,cAAc,WAAW;AACtE,0CAA0C,WAAW,kBAAkB,IAAI;AAC3E,kDAAkD,IAAI,oBAAoB;AAC1E,yDAAyD,IAAI;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,mCAAmC,OAAO,WAAW,IAAI,gBAAgB;AACzE,uDAAuD,IAAI;AAC3D,qCAAqC,IAAI;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,mCAAmC,OAAO,WAAW,IAAI,gBAAgB;AACzE,uDAAuD,IAAI;AAC3D,qCAAqC,IAAI;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,yDAAyD,QAAQ;AACjE,2DAA2D,IAAI;AAC/D,8DAA8D,QAAQ;AACtE,2EAA2E;AAC3E,yEAAyE;AACzE;AACA,2DAA2D,IAAI;AAC/D,8DAA8D,IAAI;AAClE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,+CAA+C,WAAW,gBAAgB;AAC1E,+DAA+D,IAAI;AACnE,gEAAgE,IAAI;AACpE,gEAAgE,IAAI;AACpE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,MAAM,WAAW,IAAI;AAC5D,yCAAyC,IAAI,oBAAoB,IAAI;AACrE,wDAAwD,IAAI;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,qDAAqD,UAAU;AAC/D,uDAAuD,IAAI,gBAAgB;AAC3E,yEAAyE;AACzE,yEAAyE;AACzE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,6CAA6C,IAAI,gBAAgB,IAAI;AACrE,8DAA8D,IAAI;AAClE,8DAA8D,IAAI;AAClE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,6CAA6C,SAAS,eAAe,IAAI;AACzE,0DAA0D,IAAI;AAC9D,kDAAkD,IAAI,oBAAoB;AAC1E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,+CAA+C,QAAQ;AACvD,iDAAiD,WAAW;AAC5D,iDAAiD,gBAAgB;AACjE,iDAAiD,IAAI,gBAAgB,IAAI;AACzE,gEAAgE,IAAI;AACpE,gEAAgE,IAAI;AACpE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,+CAA+C,QAAQ,eAAe;AACtE,8DAA8D;AAC9D,4DAA4D,IAAI;AAChE,iDAAiD,IAAI,oBAAoB;AACzE,mEAAmE,IAAI;AACvE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,2CAA2C,QAAQ;AACnD,6CAA6C,gBAAgB,aAAa;AAC1E,2DAA2D,IAAI;AAC/D,gDAAgD,IAAI,oBAAoB,IAAI;AAC5E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,qCAAqC,WAAW,YAAY,gBAAgB;AAC5E,+CAA+C,IAAI,gBAAgB,IAAI;AACvE,sDAAsD,IAAI;AAC1D,uCAAuC,IAAI;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,qCAAqC,WAAW,cAAc;AAC9D,kDAAkD,IAAI,gBAAgB,IAAI;AAC1E,sDAAsD,IAAI;AAC1D,uCAAuC,IAAI;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,WAAW;AAClD,yCAAyC,gBAAgB,aAAa,IAAI;AAC1E,oDAAoD,IAAI;AACxD,yCAAyC,IAAI,oBAAoB,IAAI;AACrE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,QAAQ,eAAe,QAAQ;AACtE,mDAAmD,QAAQ;AAC3D;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,6CAA6C,WAAW;AACxD;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,QAAQ;AAC/C;AACA;AACA;AACA;;AAEA;AACA,uDAAuD,QAAQ;AAC/D,yDAAyD,QAAQ;AACjE,yDAAyD,WAAW;AACpE,yDAAyD,IAAI;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,uDAAuD,QAAQ;AAC/D,yDAAyD,WAAW;AACpE,4DAA4D,WAAW;AACvE,kEAAkE,IAAI;AACtE,oEAAoE,IAAI;AACxE,wEAAwE,IAAI;AAC5E,wEAAwE,IAAI;AAC5E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,iDAAiD,WAAW;AAC5D,mDAAmD,OAAO;AAC1D,mDAAmD,WAAW;AAC9D,sDAAsD,WAAW;AACjE,mEAAmE,OAAO;AAC1E,6DAA6D,WAAW;AACxE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,mCAAmC,WAAW,aAAa,QAAQ;AACnE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,2CAA2C,WAAW,aAAa,QAAQ;AAC3E;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,WAAW,cAAc,WAAW;AAC3E;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,6CAA6C,QAAQ;AACrD,+CAA+C,QAAQ;AACvD;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA,yBAAyB,eAAe,EAAE;AAC1C,8BAA8B,oBAAoB;AAClD;AACA;AACA;AACA,yBAAyB,eAAe;AACxC;AACA;AACA;AACA,yBAAyB,eAAe;AACxC;AACA;AACA;AACA,yBAAyB,eAAe;AACxC;AACA;AACA;AACA,yBAAyB,eAAe,EAAE;AAC1C,yBAAyB,eAAe,EAAE;AAC1C,yBAAyB,eAAe,EAAE;AAC1C,mCAAmC,yBAAyB,EAAE;AAC9D,4BAA4B,kBAAkB,EAAE;AAChD,8BAA8B,oBAAoB;AAClD;AACA;AACA;AACA,yBAAyB,eAAe,EAAE;AAC1C,yBAAyB,eAAe,EAAE;AAC1C,yBAAyB,eAAe,EAAE;AAC1C,mCAAmC,yBAAyB,EAAE;AAC9D,4BAA4B,kBAAkB,EAAE;AAChD,8BAA8B,oBAAoB;AAClD;AACA;AACA;AACA,yBAAyB,eAAe,EAAE;AAC1C,0BAA0B,gBAAgB,EAAE;AAC5C,6BAA6B,mBAAmB,EAAE;AAClD,yBAAyB,eAAe,EAAE;AAC1C,mCAAmC,yBAAyB,EAAE;AAC9D,8BAA8B,oBAAoB;AAClD;AACA;AACA;AACA,0BAA0B,gBAAgB;AAC1C;AACA;AACA;AACA,4BAA4B,kBAAkB;AAC9C;AACA;AACA;AACA,4BAA4B,kBAAkB,EAAE;AAChD,0BAA0B,gBAAgB;AAC1C;AACA;AACA;AACA,2BAA2B,iBAAiB,EAAE;AAC9C,uBAAuB,aAAa,EAAE;AACtC,0BAA0B,gBAAgB;AAC1C;AACA;AACA;AACA,2BAA2B,iBAAiB,EAAE;AAC9C,+BAA+B,qBAAqB,EAAE;AACtD,0BAA0B,gBAAgB,EAAE;AAC5C,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA,2BAA2B,iBAAiB,EAAE;AAC9C,yBAAyB,eAAe,EAAE;AAC1C,yBAAyB,eAAe,EAAE;AAC1C,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA,2BAA2B,iBAAiB,EAAE;AAC9C,yBAAyB,eAAe,EAAE;AAC1C,yBAAyB,eAAe,EAAE;AAC1C,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA,yBAAyB,eAAe,EAAE;AAC1C,yBAAyB,eAAe,EAAE;AAC1C,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA,yBAAyB,eAAe,EAAE;AAC1C,yBAAyB,eAAe,EAAE;AAC1C,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA,0BAA0B,gBAAgB,EAAE;AAC5C,yBAAyB,eAAe;AACxC;AACA;AACA;AACA,0BAA0B,gBAAgB,EAAE;AAC5C,yBAAyB,eAAe;AACxC;AACA;AACA;AACA,wBAAwB,cAAc,EAAE;AACxC,0BAA0B,gBAAgB,EAAE;AAC5C,yBAAyB,eAAe,EAAE;AAC1C,0BAA0B,gBAAgB;AAC1C;AACA;AACA;AACA,yBAAyB,eAAe,EAAE;AAC1C,6BAA6B,mBAAmB,EAAE;AAClD,2BAA2B,iBAAiB,EAAE;AAC9C,8BAA8B,oBAAoB;AAClD;AACA;AACA;AACA,yBAAyB,eAAe,EAAE;AAC1C,wBAAwB,cAAc;AACtC;AACA;AACA;AACA,0BAA0B,gBAAgB;AAC1C;AACA;AACA;AACA,2BAA2B,iBAAiB,EAAE;AAC9C,0BAA0B,gBAAgB,EAAE;AAC5C,0BAA0B,gBAAgB;AAC1C;AACA;AACA;AACA,0BAA0B,gBAAgB;AAC1C;AACA;AACA;AACA,0BAA0B,gBAAgB;AAC1C;AACA;AACA;AACA,0BAA0B,gBAAgB;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB,eAAe,EAAE;AAC1C,2BAA2B,iBAAiB,EAAE;AAC9C,uBAAuB,aAAa;AACpC;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,aAAa,EAAE;AACtC,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA,yBAAyB,eAAe,EAAE;AAC1C,uBAAuB,aAAa,EAAE;AACtC,0BAA0B,gBAAgB;AAC1C;AACA;AACA;AACA,uBAAuB,aAAa,EAAE;AACtC,4BAA4B,kBAAkB;AAC9C;AACA;AACA;AACA,yBAAyB,eAAe,EAAE;AAC1C,yBAAyB,eAAe;AACxC;AACA;AACA;AACA,yBAAyB,eAAe,EAAE;AAC1C,yBAAyB,eAAe,EAAE;AAC1C,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA,yBAAyB,eAAe,EAAE;AAC1C,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA,yBAAyB,eAAe;AACxC;AACA;AACA;AACA,wBAAwB,cAAc,EAAE;AACxC,+BAA+B,qBAAqB;AACpD;AACA;AACA;AACA,wBAAwB,cAAc,EAAE;AACxC,+BAA+B,qBAAqB;AACpD;AACA;AACA;AACA,wBAAwB,cAAc,EAAE;AACxC,0BAA0B,gBAAgB,EAAE;AAC5C,+BAA+B,qBAAqB;AACpD;AACA;AACA;AACA,wBAAwB,cAAc,EAAE;AACxC,+BAA+B,qBAAqB;AACpD;AACA;AACA;AACA,0BAA0B,gBAAgB;AAC1C;AACA;AACA;AACA,0BAA0B,gBAAgB;AAC1C;AACA;AACA;AACA,0BAA0B,gBAAgB;AAC1C;AACA;AACA;AACA,yBAAyB,eAAe,EAAE;AAC1C,wBAAwB,cAAc,EAAE;AACxC,gCAAgC,sBAAsB;AACtD;AACA;AACA;AACA,yBAAyB,eAAe,EAAE;AAC1C,yBAAyB,eAAe,EAAE;AAC1C,6BAA6B,mBAAmB;AAChD;AACA;AACA;AACA,sBAAsB,YAAY;AAClC;AACA;AACA;AACA,sBAAsB,YAAY;AAClC;AACA;AACA;AACA,0BAA0B,gBAAgB,EAAE;AAC5C,+BAA+B,qBAAqB,EAAE;AACtD,gCAAgC,sBAAsB;AACtD;AACA;AACA;AACA,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA,sBAAsB,YAAY;AAClC;AACA;AACA;AACA,0BAA0B,gBAAgB;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,gBAAgB;AAC1C;AACA;AACA;AACA,0BAA0B,gBAAgB,EAAE;AAC5C,yBAAyB,eAAe,EAAE;AAC1C,wBAAwB,cAAc;AACtC;AACA;AACA;AACA,0BAA0B,gBAAgB,EAAE;AAC5C,0BAA0B,gBAAgB,EAAE;AAC5C,wBAAwB,cAAc;AACtC;AACA;AACA;AACA,0BAA0B,gBAAgB,EAAE;AAC5C,wBAAwB,cAAc;AACtC;AACA;AACA;AACA,uBAAuB,aAAa,EAAE;AACtC,wBAAwB,cAAc;AACtC;AACA;AACA;AACA,yBAAyB,eAAe,EAAE;AAC1C,wBAAwB,cAAc;AACtC;AACA;AACA;AACA,yBAAyB,eAAe,EAAE;AAC1C,wBAAwB,cAAc;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,gBAAgB,EAAE;AAC5C,0BAA0B,gBAAgB,EAAE;AAC5C,yBAAyB,eAAe;AACxC;AACA;AACA;AACA,yBAAyB,eAAe;AACxC;AACA;AACA;AACA,0BAA0B,gBAAgB;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,iBAAiB,EAAE;AAC9C,yBAAyB,eAAe,EAAE;AAC1C,wBAAwB,cAAc,EAAE;AACxC,6BAA6B,mBAAmB;AAChD;AACA;AACA;AACA,yBAAyB,eAAe,EAAE;AAC1C,yBAAyB,eAAe,EAAE;AAC1C,yBAAyB,eAAe;AACxC;AACA;AACA;AACA,yBAAyB,eAAe,EAAE;AAC1C,2BAA2B,iBAAiB,EAAE;AAC9C,+BAA+B,qBAAqB,EAAE;AACtD,gCAAgC,sBAAsB,EAAE;AACxD,0BAA0B,gBAAgB,EAAE;AAC5C,6BAA6B,mBAAmB;AAChD;AACA;AACA;AACA,wBAAwB,cAAc,EAAE;AACxC,+BAA+B,qBAAqB;AACpD;AACA;AACA;AACA,wBAAwB,cAAc,EAAE;AACxC,0BAA0B,gBAAgB;AAC1C;AACA;AACA;AACA,yBAAyB,eAAe,EAAE;AAC1C,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA,iCAAiC,uBAAuB,EAAE;AAC1D,kCAAkC,wBAAwB;AAC1D;;AAEA;;;;;;;;;;;;AChzDA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE;AACF,EAAE;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB;AACnB;AACA,CAAC;AACD,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA,QAAQ,MAAM;AACd;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA,QAAQ,MAAM;AACd,0CAA0C,MAAM;AAChD,4DAA4D,MAAM;AAClE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,kEAAkE;AAC1E;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,+BAA+B,MAAM;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,MAAM;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,aAAa;AACrB,6DAA6D,MAAM;AACnE,wCAAwC,oBAAoB;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,6DAA6D;AACrE;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,6DAA6D;AACrE,+BAA+B,MAAM;AACrC,+BAA+B,MAAM;AACrC,8DAA8D,MAAM;AACpE;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,MAAM;AACd,0CAA0C,MAAM;AAChD,0CAA0C,MAAM;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,+DAA+D,MAAM;AACrE,yCAAyC,MAAM;AAC/C,yCAAyC,MAAM;AAC/C,+BAA+B,MAAM;AACrC;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA,QAAQ,OAAO;AACf;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;AACf;AACA,QAAQ,iCAAiC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,MAAM;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,KAAK;AACb,mDAAmD,MAAM;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,MAAM;AACd,8DAA8D,MAAM;AACpE,6DAA6D,MAAM;AACnE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,MAAM;AACd,2CAA2C,MAAM;AACjD,0CAA0C,aAAa;AACvD;AACA,QAAQ,MAAM;AACd;AACA,QAAQ,MAAM;AACd,mDAAmD,MAAM;AACzD;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,+DAA+D,MAAM;AACrE,+BAA+B,MAAM;AACrC;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,MAAM;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,KAAK;AACb,mDAAmD,MAAM;AACzD;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,kDAAkD,MAAM;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,0CAA0C,MAAM;AAChD;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,6DAA6D,MAAM;AACnE;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,qBAAqB;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,MAAM;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,oBAAoB;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,oBAAoB;AAC5B,+BAA+B,MAAM;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,MAAM;AACd;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA,QAAQ,MAAM;AACd;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,mDAAmD,MAAM;AACzD,+BAA+B,MAAM,EAAE;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;;;;;;;;;;;;;AC/wDA,8CAAa,aAAa,cAAc,cAAc,8BAA8B,kHAAkH,uBAAuB,uBAAuB,cAAc,gDAAgD,+BAA+B,UAAU,gBAAgB;AAC3W,mBAAmB,gEAAgE,IAAI,EAAE,oBAAoB,IAAI,iBAAiB,WAAW,aAAa,yBAAyB,oBAAoB,QAAQ,MAAM,gBAAgB,IAAI,MAAM,iFAAiF;AAChU,gEAAgE,eAAe,SAAS,+BAA+B,WAAW,4LAA4L,4BAA4B,QAAQ,oDAAoD,sBAAsB,KAAK,KAAK,UAAU,qBAAqB,qBAAqB;AAC1e,iCAAiC,QAAQ,IAAI,iBAAiB,wBAAwB,iBAAiB,KAAK,yBAAyB,KAAK,GAAG,yBAAyB,8BAA8B,uBAAuB,uBAAuB,YAAY,eAAe,wBAAwB,uBAAuB,oBAAoB,SAAS,QAAQ,QAAQ,yBAAyB,2DAA2D,eAAe,uBAAuB,qBAAqB;AACxf,8BAA8B,qCAAqC,oEAAoE;AACvI;;;;;;;;;;;;;ACLA,eAAe,KAAoD,oBAAoB,SAAsE,CAAC,kBAAkB,aAAa,gEAAgE,sBAAsB,iBAAiB,8FAA8F,iBAAiB,sBAAsB,uBAAuB,2BAA2B,0EAA0E,uHAAuH,yBAAyB,uBAAuB,0BAA0B,sEAAsE,SAAS,kEAAkE,uBAAuB,8BAA8B,2BAA2B,mBAAmB,wDAAwD,gBAAgB,oBAAoB,4DAA4D,8BAA8B,eAAe,wFAAwF,wGAAwG,mBAAmB,iBAAiB,kBAAkB,UAAU,6BAA6B,mBAAmB,+CAA+C,sCAAsC,oBAAoB,YAAY,oBAAoB,QAAQ,aAAa,6BAA6B,8DAA8D,SAAS,oDAAoD,oCAAoC,8GAA8G,6BAA6B,4GAA4G,qBAAqB,yBAAyB,mBAAmB,wBAAwB,qBAAqB,sEAAsE,yBAAyB,4DAA4D,0CAA0C,yBAAyB,uFAAuF,qDAAqD,2BAA2B,kBAAkB,gEAAgE,mCAAmC,mDAAmD,uBAAuB,gBAAgB,6BAA6B,eAAe,0BAA0B,MAAM,mEAAmE,SAAS,qBAAqB,yBAAyB,yBAAyB,wBAAwB,mCAAmC,iCAAiC,uBAAuB,YAAY,WAAW,+CAA+C,kBAAkB,mBAAmB,yDAAyD,gDAAgD,+CAA+C,MAAM,2BAA2B,6CAA6C,iCAAiC,uCAAuC,2BAA2B,sBAAsB,yDAAyD,uCAAuC,6BAA6B,2BAA2B,2BAA2B,kCAAkC,+CAA+C,wCAAwC,gCAAgC,gBAAgB,eAAe,oHAAoH,qBAAqB,eAAe,oHAAoH,sBAAsB,sGAAsG,6BAA6B,sGAAsG,4BAA4B,0DAA0D,kBAAkB,qBAAqB,kCAAkC,4BAA4B,mCAAmC,wBAAwB,kCAAkC,+BAA+B,mCAAmC,kBAAkB,4BAA4B,gCAAgC,YAAY,WAAW,4CAA4C,SAAS,qBAAqB,oBAAoB,uBAAuB,yDAAyD,mBAAmB,+BAA+B,8BAA8B,8BAA8B,mEAAmE,kFAAkF,uBAAuB,yDAAyD,mBAAmB,+EAA+E,uCAAuC,+BAA+B,sBAAsB,8BAA8B,oEAAoE,sBAAsB,6BAA6B,wDAAwD,mBAAmB,8BAA8B,8BAA8B,oEAAoE,sBAAsB,8BAA8B,uEAAuE,mBAAmB,yBAAyB,yFAAyF,2BAA2B,kCAAkC,oBAAoB,uBAAuB,6CAA6C,8BAA8B,gDAAgD,2DAA2D,eAAe,cAAc,KAAK,wEAAwE,sDAAsD,gDAAgD,oBAAoB,yBAAyB,yFAAyF,2BAA2B,WAAW,+DAA+D,gDAAgD,kCAAkC,oBAAoB,uBAAuB,aAAa,gBAAgB,kBAAkB,uBAAuB,qBAAqB,gCAAgC,gBAAgB,+GAA+G,4CAA4C,4FAA4F,qDAAqD,mFAAmF,eAAe,0BAA0B,eAAe,0BAA0B,eAAe,0BAA0B,eAAe,0BAA0B,eAAe,MAAM,EAAE,iEAAiE,uBAAuB,iDAAiD,kCAAkC,qBAAqB,4BAA4B,qEAAqE,kCAAkC,qBAAqB,6BAA6B,kDAAkD,kCAAkC,qBAAqB,4BAA4B,4BAA4B,kCAAkC,qBAAqB,4BAA4B,qDAAqD,qBAAqB,kBAAkB,eAAe,iBAAiB,gBAAgB,mBAAmB,uBAAuB,mBAAmB,2BAA2B,SAAS,qCAAqC,YAAY,cAAc,iBAAiB,SAAS,SAAS,8BAA8B,KAAK,MAAM,4BAA4B,kCAAkC,qBAAqB,YAAY,cAAc,cAAc,iCAAiC,gBAAgB,MAAM,cAAc,KAAK,kBAAkB,wBAAwB,WAAW,qBAAqB,0BAA0B,KAAK,IAAI,kCAAkC,SAAS,uBAAuB,8BAA8B,iFAAiF,4EAA4E,kBAAkB,UAAU,SAAS,YAAY,wCAAwC,gCAAgC,KAAK,YAAY,kCAAkC,oBAAoB,cAAc,KAAK,mEAAmE,kBAAkB,yBAAyB,0IAA0I,2BAA2B,QAAQ,iBAAiB,QAAQ,2BAA2B,sBAAsB,KAAK,oBAAoB,EAAE,6BAA6B,kBAAkB,WAAW,uBAAuB,sBAAsB,gBAAgB,uBAAuB,uBAAuB,UAAU,gBAAgB,6BAA6B,sCAAsC,4BAA4B,kBAAkB,yBAAyB,2BAA2B,kBAAkB,wBAAwB,2BAA2B,oBAAoB,wBAAwB,6BAA6B,sCAAsC,uBAAuB,mBAAmB,4BAA4B,KAAK,OAAO,EAAE,6BAA6B,kBAAkB,YAAY,iEAAiE,8BAA8B,6FAA6F,eAAe,+BAA+B,gBAAgB,SAAS,GAAG,YAAY,MAAM,EAAE,MAAM,qBAAqB,oCAAoC,KAAK,KAAK,MAAM,0BAA0B,KAAK,MAAM,kCAAkC,oBAAoB,UAAU,yBAAyB,KAAK,uBAAuB,aAAa,GAAG,YAAY,MAAM,EAAE,MAAM,qBAAqB,oCAAoC,KAAK,KAAK,MAAM,YAAY,sBAAsB,4BAA4B,KAAK,MAAM,kBAAkB,uCAAuC,kDAAkD,8BAA8B,UAAU,UAAU,oCAAoC,QAAQ,IAAI,0DAA0D,+BAA+B,8BAA8B,gBAAgB,qBAAqB,KAAK,KAAK,oBAAoB,yGAAyG,UAAU,qDAAqD,oBAAoB,KAAK,WAAW,sBAAsB,qCAAqC,iBAAiB,UAAU,4DAA4D,gDAAgD,uBAAuB,8DAA8D,iBAAiB,kBAAkB,YAAY,MAAM,KAAK,kCAAkC,+BAA+B,YAAY,mBAAmB,KAAK,8CAA8C,mBAAmB,6CAA6C,MAAM,yCAAyC,oEAAoE,kBAAkB,gCAAgC,iBAAiB,kBAAkB,UAAU,uCAAuC,kCAAkC,sEAAsE,wCAAwC,eAAe,uEAAuE,QAAQ,6BAA6B,2BAA2B,4CAA4C,QAAQ,uBAAuB,KAAK,KAAK,+BAA+B,kCAAkC,gBAAgB,KAAK,wCAAwC,aAAa,6BAA6B,8BAA8B,WAAW,kCAAkC,KAAK,WAAW,SAAS,oCAAoC,wBAAwB,cAAc,4BAA4B,cAAc,yBAAyB,cAAc,8BAA8B,eAAe,wCAAwC,iCAAiC,4DAA4D,8BAA8B,yBAAyB,qBAAqB,mCAAmC,iBAAiB,2CAA2C,kBAAkB,4CAA4C,oCAAoC,4DAA4D,gCAAgC,8BAA8B,kBAAkB,oBAAoB,0BAA0B,eAAe,qCAAqC,4EAA4E,yBAAyB,8BAA8B,4CAA4C,oEAAoE,eAAe,qCAAqC,iBAAiB,qBAAqB,oCAAoC,kCAAkC,qCAAqC,4EAA4E,kBAAkB,0DAA0D,UAAU,SAAS,YAAY,wCAAwC,gCAAgC,KAAK,YAAY,kCAAkC,mDAAmD,kCAAkC,cAAc,KAAK,KAAK,6CAA6C,6BAA6B,qCAAqC,kCAAkC,iBAAiB,+CAA+C,2BAA2B,SAAS,4BAA4B,oIAAoI,qCAAqC,wDAAwD,wBAAwB,8FAA8F,kBAAkB,mBAAmB,kBAAkB,oBAAoB,mIAAmI,mIAAmI,0DAA0D,iFAAiF,4DAA4D,8DAA8D,4DAA4D,mFAAmF,4DAA4D,wDAAwD,WAAW,8CAA8C,4BAA4B,mDAAmD,yBAAyB,oDAAoD,eAAe,+DAA+D,mBAAmB,YAAY,KAAK,WAAW,KAAK,oCAAoC,sCAAsC,KAAK,WAAW,KAAK,uBAAuB,sCAAsC,gDAAgD,4BAA4B,yBAAyB,oDAAoD,0BAA0B,YAAY,KAAK,WAAW,KAAK,oCAAoC,wCAAwC,KAAK,WAAW,KAAK,uBAAuB,wCAAwC,kBAAkB,oCAAoC,iBAAiB,+BAA+B,QAAQ,YAAY,IAAI,KAAK,uBAAuB,sCAAsC,qCAAqC,6BAA6B,iBAAiB,OAAO,oBAAoB,QAAQ,YAAY,IAAI,KAAK,uBAAuB,wCAAwC,8CAA8C,YAAY,IAAI,sBAAsB,SAAS,iCAAiC,8BAA8B,QAAQ,IAAI,cAAc,gBAAgB,QAAQ,kCAAkC,QAAQ,KAAK,IAAI,8CAA8C,KAAK,IAAI,sBAAsB,SAAS,oCAAoC,4BAA4B,QAAQ,WAAW,QAAQ,kCAAkC,QAAQ,KAAK,IAAI,+CAA+C,KAAK,IAAI,iCAAiC,KAAK,IAAI,sBAAsB,SAAS,gCAAgC,8BAA8B,QAAQ,IAAI,cAAc,gBAAgB,QAAQ,kCAAkC,QAAQ,KAAK,IAAI,8CAA8C,KAAK,IAAI,iCAAiC,KAAK,IAAI,sBAAsB,SAAS,iCAAiC,8BAA8B,QAAQ,IAAI,cAAc,gBAAgB,QAAQ,kCAAkC,QAAQ,KAAK,IAAI,8CAA8C,KAAK,IAAI,iCAAiC,KAAK,IAAI,sBAAsB,SAAS,8BAA8B,0BAA0B,iBAAiB,iBAAiB,KAAK,kCAAkC,KAAK,4DAA4D,qCAAqC,gBAAgB,yBAAyB,YAAY,cAAc,WAAW,SAAS,eAAe,wGAAwG,gIAAgI,KAAK,YAAY,KAAK,mBAAmB,kDAAkD,wCAAwC,YAAY,YAAY,IAAI,KAAK,wFAAwF,+CAA+C,wCAAwC,WAAW,qBAAqB,sDAAsD,4BAA4B,+BAA+B,yBAAyB,YAAY,YAAY,IAAI,KAAK,2GAA2G,YAAY,0HAA0H,qDAAqD,sCAAsC,iCAAiC,QAAQ,yBAAyB,KAAK,MAAM,+BAA+B,cAAc,yCAAyC,cAAc,oCAAoC,SAAS,+BAA+B,QAAQ,uBAAuB,KAAK,KAAK,qCAAqC,QAAQ,SAAS,mCAAmC,mEAAmE,WAAW,gDAAgD,0BAA0B,uBAAuB,sCAAsC,qCAAqC,yDAAyD,QAAQ,cAAc,KAAK,KAAK,QAAQ,2BAA2B,UAAU,yCAAyC,QAAQ,YAAY,kDAAkD,KAAK,uDAAuD,GAAG,mCAAmC,8BAA8B,+HAA+H,wCAAwC,uBAAuB,GAAG,cAAc,+BAA+B,kBAAkB,uBAAuB,oBAAoB,QAAQ,YAAY,IAAI,KAAK,iDAAiD,0CAA0C,SAAS,oBAAoB,QAAQ,QAAQ,MAAM,oCAAoC,KAAK,UAAU,KAAK,4CAA4C,8GAA8G,4CAA4C,sDAAsD,4DAA4D,qHAAqH,KAAK,MAAM,QAAQ,KAAK,aAAa,KAAK,iEAAiE,WAAW,4BAA4B,sDAAsD,iEAAiE,WAAW,QAAQ,wFAAwF,SAAS,uBAAuB,gBAAgB,0BAA0B,sBAAsB,YAAY,IAAI,KAAK,0BAA0B,gDAAgD,qBAAqB,iCAAiC,iCAAiC,UAAU,YAAY,IAAI,iCAAiC,gCAAgC,QAAQ,YAAY,IAAI,KAAK,qBAAqB,6CAA6C,gCAAgC,kCAAkC,6BAA6B,8CAA8C,mGAAmG,UAAU,QAAQ,KAAK,IAAI,sBAAsB,KAAK,IAAI,mCAAmC,KAAK,QAAQ,YAAY,IAAI,sBAAsB,YAAY,IAAI,KAAK,qBAAqB,+CAA+C,yBAAyB,oDAAoD,kBAAkB,mCAAmC,iDAAiD,yCAAyC,sBAAsB,UAAU,0CAA0C,SAAS,MAAM,mCAAmC,iBAAiB,IAAI,yBAAyB,KAAK,OAAO,aAAa,uBAAuB,WAAW,iBAAiB,UAAU,oBAAoB,YAAY,IAAI,mCAAmC,KAAK,uBAAuB,cAAc,YAAY,IAAI,KAAK,yBAAyB,6CAA6C,kBAAkB,oDAAoD,gCAAgC,uCAAuC,0BAA0B,uBAAuB,6BAA6B,iCAAiC,oCAAoC,+BAA+B,8BAA8B,oEAAoE,8BAA8B,MAAM,aAAa,+BAA+B,iEAAiE,kBAAkB,MAAM,kBAAkB,+BAA+B,mBAAmB,MAAM,kBAAkB,+BAA+B,gEAAgE,sBAAsB,4BAA4B,qBAAqB,sDAAsD,8BAA8B,4CAA4C,YAAY,IAAI,iCAAiC,mBAAmB,YAAY,gBAAgB,WAAW,oCAAoC,6CAA6C,eAAe,iCAAiC,QAAQ,YAAY,QAAQ,0BAA0B,IAAI,KAAK,yBAAyB,wCAAwC,KAAK,IAAI,oCAAoC,gCAAgC,aAAa,MAAM,8BAA8B,KAAK,aAAa,WAAW,gBAAgB,eAAe,oCAAoC,WAAW,eAAe,mBAAmB,mBAAmB,gBAAgB,YAAY,oBAAoB,YAAY,oBAAoB,oBAAoB,kDAAkD,eAAe,oCAAoC,oBAAoB,yEAAyE,qBAAqB,uBAAuB,QAAQ,KAAK,IAAI,yBAAyB,SAAS,0BAA0B,0BAA0B,6qBAA6qB,cAAc,aAAa,0BAA0B,oCAAoC,2BAA2B,aAAa,GAAG;AACxn1B;;;;;;;;;;;;ACDA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;;;AAIA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,uBAAuB,sBAAsB;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,qCAAqC;;AAErC;AACA;AACA;;AAEA,2BAA2B;AAC3B;AACA;AACA;AACA,4BAA4B,UAAU;;;;;;;;;;;;ACvLtC;AACA;;AAEA;AACA;AACA;;AAEA,uBAAuB;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,iBAAiB;AACtC;AACA;AACA;AACA,kBAAkB;AAClB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,0CAA0C,sBAAsB,EAAE;AAClE;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,SAAS;AACT;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,yCAAyC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,UAAU;AACV;AACA;;AAEA,KAAK;AACL;AACA;;AAEA,KAAK;AACL;AACA;;AAEA,KAAK;AACL;AACA;;AAEA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA,CAAC;;;;;;;;;;;;;ACzLD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC,kCAAkC,EAAE;AACtE;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,2BAA2B,YAAY;;AAEvC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,kCAAkC;;AAElC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,kCAAkC;;AAElC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,+CAA+C,wBAAwB;AACvE;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,CAAC;;;;;;;;;;;;ACp1BD;;AAEA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;;AAEA;AACA;AACA,4CAA4C;;AAE5C;;;;;;;;;;;;ACnBA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,aAAa,kBAAkB;AAC/B,cAAc,oCAAoC;;;AAGlD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,OAAO;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;AACA;AACA,2DAA2D,iBAAiB;AAC5E;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;AACA;AACA,2DAA2D,iBAAiB;AAC5E;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,WAAW,EAAE;AACb,WAAW,EAAE;AACb,WAAW,EAAE;AACb,WAAW,EAAE;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA,mBAAmB,oBAAoB;AACvC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,mBAAmB;AAC9B,WAAW,MAAM;AACjB,WAAW,gBAAgB;AAC3B,WAAW,OAAO;AAClB,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,yBAAyB;;AAEzB,mBAAmB,mBAAmB;AACtC,+BAA+B;AAC/B;AACA;AACA;AACA,oCAAoC;AACpC;;AAEA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,+BAA+B,QAAQ;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,gBAAgB;AAC3B,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,MAAM;AACjB,WAAW,iBAAiB;AAC5B;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,MAAM;AACjB,WAAW,iBAAiB;AAC5B,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,MAAM;AACjB,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,qEAAqE;AACrE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,SAAS;AACpB;AACA,aAAa,OAAO;AACpB,YAAY,oBAAoB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB,WAAW,UAAU;AACrB,WAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,eAAe;AAC1B,WAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB;AACA,YAAY,qBAAqB;AACjC,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA,aAAa,mBAAmB;AAChC;AACA,WAAW,SAAS;AACpB,WAAW,eAAe;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,YAAY,EAAE;AACd,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,iCAAiC;AACrC;AACA;AACA,WAAW,OAAO;AAClB,WAAW,oBAAoB;AAC/B,WAAW,qBAAqB;AAChC,WAAW,qBAAqB;AAChC;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,+BAA+B;AACnD,kBAAkB,6BAA6B;AAC/C,kBAAkB,iCAAiC;AACnD,kBAAkB,8BAA8B;AAChD,KAAK;AACL;;;AAGA;AACA,+BAA+B;AAC/B,QAAQ;AACR;AACA,YAAY,oBAAoB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA,sDAAsD,8BAA8B;AACpF,kEAAkE,+BAA+B;AACjG;AACA;AACA,kDAAkD,8BAA8B;AAChF;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,0BAA0B,4BAA4B;AACtD,mBAAmB,6BAA6B;AAChD,iBAAiB,6BAA6B;AAC9C,KAAK;AACL;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,KAAK;AACL;AACA;AACA,WAAW,oBAAoB;AAC/B,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,sDAAsD,8BAA8B;AACpF;;AAEA;AACA;AACA,WAAW,oBAAoB;AAC/B,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,sDAAsD,8BAA8B;AACpF;;AAEA;AACA;AACA,WAAW,oBAAoB;AAC/B,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,2DAA2D,8BAA8B;AACzF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+CAA+C;AAC/C;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,KAAK;AACL;;AAEA;AACA;AACA,WAAW,oBAAoB;AAC/B,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;;AAEL;AACA;AACA;AACA,sDAAsD,6BAA6B;AACnF;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,aAAa;AACb;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,6B;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;;AAEA,8CAA8C,8BAA8B;AAC5E;;AAEA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,uBAAuB;AACvB,uBAAuB;AACvB;AACA;AACA,+BAA+B,yEAAyE;AACxG,+BAA+B,6CAA6C;AAC5E,yCAAyC,yEAAyE;AAClH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,cAAc,oBAAoB;AAClC;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA,mBAAmB,qCAAqC;AACxD,qBAAqB,uCAAuC;AAC5D,qBAAqB,uCAAuC;AAC5D,0BAA0B,4CAA4C;AACtE,KAAK;;AAEL,+CAA+C,qBAAqB,uBAAuB;AAC3F;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA,SAAS,E;AACT,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO,4BAA4B,0CAA0C;AACxF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uCAAuC;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD,aAAa;AACb;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,2DAA2D;AAC3D;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA,YAAY,EAAE;AACd,YAAY,OAAO;AACnB,YAAY,KAAK;AACjB,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACn3CA,cAAc;;AAEd;AACA;AACA;AACA,WAAW,EAAE;AACb,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AClCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,aAAa,OAAO;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,uBAAuB,YAAY;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C,iCAAiC;AAC3E;AACA;AACA;AACA,aAAa;AACb;AACA,2BAA2B,gBAAgB;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,mBAAmB,cAAc;AACjC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,YAAY;AAC3B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,SAAS,UAAU;AACtC;AACA;AACA,KAAK;AACL,mBAAmB,gBAAgB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,2BAA2B,aAAa;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA,mBAAmB,aAAa;AAChC;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,YAAY;AAC3B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB;AACvB;AACA,KAAK,yBAAyB;AAC9B;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,YAAY;AAC3B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA,eAAe,gBAAgB;AAC/B;AACA;AACA;;AAEA;;AAEA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,mBAAmB,WAAW;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,YAAY;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,YAAY;AAC3B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA,+BAA+B,YAAY;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,YAAY;AAC/B;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA,qBAAqB,cAAc;AACnC;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,uBAAuB,YAAY;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,eAAe,YAAY;AAC3B;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,cAAc;AACd,kBAAkB;AAClB,qBAAqB;AACrB,eAAe,YAAY;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA,2BAA2B,eAAe;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,uBAAuB,YAAY;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,mBAAmB;AAC1C;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;;AAEd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;;AAEA;AACA;AACA;AACA;AACA,UAAU;AACV,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA,uBAAuB;AACvB;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC;AACrC;AACA,2BAA2B;AAC3B;AACA;AACA,iBAAiB;AACjB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA,sBAAsB;AACtB;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,2CAA2C;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,eAAe,WAAW;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,UAAU;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,eAAe,YAAY;AAC3B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,uBAAuB,WAAW;AAClC;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,0BAA0B,WAAW;AACrC;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA,gBAAgB;AAChB,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA,gBAAgB;AAChB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,eAAe,YAAY;AAC3B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,UAAU;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,SAAS;AACT;AACA;;AAEA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,mBAAmB,gBAAgB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,SAAS;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,yBAAyB,YAAY;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,sDAAsD;AACtD,gDAAgD;;AAEhD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA,yCAAyC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA,gFAAgF;;AAEhF;;AAEA,UAAU,SAAS;AACnB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,SAAS,+BAA+B;AACxC;AACA,SAAS;AACT,kCAAkC;AAClC;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT,+CAA+C;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qDAAqD;AACrD;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,uCAAuC;AACvC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,8BAA8B;AAC9B,iDAAiD;AACjD;AACA,uBAAuB,GAAG,GAAG,QAAQ;AACrC,qEAAqE;AACrE;AACA,yCAAyC,MAAM;AAC/C;AACA;AACA;;;AAGA;AACA,iCAAiC;AACjC;AACA;AACA;AACA,sCAAsC;AACtC;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,uDAAuD;AAChE;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,mBAAmB,YAAY;AAC/B;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;;AAEA;AACA,kCAAkC;;AAElC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,kCAAkC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,8BAA8B;AACzC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA,eAAe,YAAY;AAC3B;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,uBAAuB,SAAS;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,YAAY;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA,+BAA+B,YAAY;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC;AACrC;;AAEA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,YAAY;AACtC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,gBAAgB;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA,+BAA+B,SAAS;AACxC;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC;AAClC;AACA,kCAAkC;AAClC;AACA,kCAAkC;AAClC;AACA;;AAEA;AACA,+BAA+B,QAAQ;AACvC;AACA;AACA,mBAAmB,OAAO;AAC1B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA,uBAAuB,yBAAyB,UAAU;AAC1D,oCAAoC;AACpC,8CAA8C;AAC9C;AACA;AACA;AACA;AACA,uBAAuB,mBAAmB;AAC1C;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,uBAAuB,iBAAiB;AACxC;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;;;;;ACn1GA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,YAAY,wBAAwB;AACpC,YAAY,gBAAgB;AAC5B;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gDAAgD;AAChD,SAAS;AACT;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,CAAC;AACD;;AAEA;AACA;AACA,UAAU;AACV,YAAY;AACZ;AACA,mCAAmC,gBAAgB;AACnD,QAAQ,2BAA2B;AACnC,CAAC;;AAED;AACA;AACA,UAAU;AACV,YAAY;AACZ;AACA,oCAAoC,gBAAgB;AACpD,QAAQ,2BAA2B;AACnC,CAAC;;;;;;;;;;;;AC5FD,cAAc,kBAAkB;;AAEhC;AACA;AACA;AACA,QAAQ;AACR;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,YAAY,OAAO;AACnB,YAAY,oCAAoC;AAChD;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,SAAS;AACT;;AAEA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,SAAS;AACT;;AAEA;AACA;AACA;AACA,SAAS;AACT;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,eAAe,sBAAsB;AACrC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,sBAAsB;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,iBAAiB,gBAAgB;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc,gBAAgB;AAC9B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,aAAa;AACb;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,oBAAoB;AACpB,KAAK;AACL,oBAAoB;AACpB;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,mBAAmB,mBAAmB;AACtC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,iCAAiC;AACjC;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT,KAAK;AACL,CAAC;;;AAGD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,mBAAmB,sBAAsB;AACzC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,uBAAuB,sBAAsB;AAC7C;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,iBAAiB;AACjB;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC,oBAAoB;AACvD;AACA;;AAEA;AACA;;AAEA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,GAAG;AACd,WAAW,GAAG;AACd,WAAW,GAAG;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;;AAEA,mEAAmE,oBAAoB;AACvF;AACA;AACA,SAAS;AACT;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oCAAoC;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,iBAAiB;AACpC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA,sDAAsD,iBAAiB;AACvE;AACA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,uDAAuD,iBAAiB;AACxE;AACA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACrxCA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA,QAAQ;;AAER;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA,4VAA4V;AAC5V,KAAK;;AAEL;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;;AAEL;AACA;AACA,qBAAqB;AACrB;AACA;AACA,QAAQ;;AAER;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA,uEAAuE;AACvE,KAAK;;AAEL;AACA;AACA,iBAAiB,sBAAsB;AACvC;AACA,omBAAomB;AACpmB,KAAK;;AAEL;AACA;AACA,iBAAiB,uBAAuB;AACxC;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,uBAAuB;AACxC;AACA;AACA,kUAAkU;AAClU,KAAK;;AAEL;AACA;AACA,iBAAiB,uBAAuB;AACxC;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT,iBAAiB,uBAAuB;AACxC;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT,iBAAiB,sBAAsB;AACvC;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,uBAAuB;AACxC;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,uBAAuB;AACxC;AACA;AACA,+FAA+F,2HAA2H;AAC1N,KAAK;;AAEL;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,uBAAuB;AACxC;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,uBAAuB;AACxC;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,uBAAuB;AACxC;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,uBAAuB;AACxC;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,uBAAuB;AACxC;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,eAAe;AAChC;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,eAAe;AAChC;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,iBAAiB,uBAAuB;AACxC;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,uBAAuB;AACxC;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,eAAe;AAChC;AACA;AACA,iNAAiN;AACjN,KAAK;;AAEL;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,uBAAuB;AACxC;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,iBAAiB,uBAAuB;AACxC;AACA;AACA,KAAK;AACL,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB,eAAe;AACxC;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,yBAAyB,uBAAuB;AAChD,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB,uBAAuB;AAChD,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB,yBAAyB;AAClD,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;;ACpoBA,mBAAO,CAAC,yHAAmC;;AAE3C;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,yCAAyC;AACpD,YAAY;AACZ,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,2BAA2B,SAAS;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT,oFAAoF,cAAc,KAAK,OAAO;AAC9G;AACA,KAAK;AACL,sBAAsB,2BAA2B;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,kBAAkB,mBAAmB;AACrC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA,2BAA2B,mBAAmB;AAC9C;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,aAAa;AACpC;AACA,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,mBAAmB;AAC1C;AACA;AACA,2BAA2B,oBAAoB;AAC/C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,+BAA+B,mBAAmB;AAClD;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,2BAA2B,mBAAmB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,yGAAyG,QAAQ;AACjH;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,mCAAmC,kCAAkC;AACrE;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B,SAAS;AACxC;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,kBAAkB,aAAa;AAC/B;AACA;AACA,uCAAuC,SAAS;AAChD;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA,uCAAuC,UAAU;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,oCAAoC;AACzD;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,yHAAyH,OAAO;AAChI;AACA;AACA,+BAA+B,mBAAmB;AAClD;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,wCAAwC;AAC7D;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,+BAA+B,mBAAmB;AAClD;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA,aAAa;AACb,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,+BAA+B,mBAAmB;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,yBAAyB;AAC9C;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC,UAAU;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,mBAAmB;AAC1C;AACA;AACA;AACA,aAAa;AACb,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA,aAAa;AACb,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,kBAAkB,gBAAgB;;AAElC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,wEAAwE;AAC7F;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,yBAAyB;AAC9C;AACA;AACA,SAAS;AACT;AACA;AACA,kBAAkB,gBAAgB;;AAElC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,wEAAwE;AAC7F;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wDAAwD;AACxD;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,6CAA6C;AAClE;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,+BAA+B,SAAS;AACxC;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,gBAAgB;AAChB,wBAAwB,eAAe;AACvC;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6CAA6C,WAAW;AACxD;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yDAAyD,EAAE;AAC3D;AACA;AACA;AACA,uCAAuC,UAAU;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL,CAAC;;AAED;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,YAAY;AACZ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,8BAA8B;AAC9B;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA,mBAAmB,mBAAmB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM,mBAAmB;AACzB;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,UAAU,aAAa;AACvB;AACA;AACA;AACA;;AAEA;AACA,6EAA6E,oBAAoB;AACjG;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU,aAAa;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,kBAAkB;AACzC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,uBAAuB,WAAW;AAClC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,YAAY;AACZ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,uBAAuB,mBAAmB;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,uBAAuB,mBAAmB;AAC1C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,iBAAiB;AAC5B;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL,YAAY,4BAA4B;AACxC,CAAC;;AAED;;;;;;;;;;;;ACzwCA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB;AACA,WAAW,SAAS;AACpB;AACA,WAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB;AACA,WAAW,SAAS;AACpB;AACA,WAAW,SAAS;AACpB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,EAAE;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,gEAAgE,oBAAoB;AACpF;AACA;AACA,eAAe,OAAO;AACtB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,EAAE;AACb;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,iCAAiC,sBAAsB,KAAK;AAC5D;AACA,WAAW,EAAE;AACb;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,EAAE;AACb;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,8BAA8B;AAC9B,WAAW,EAAE;AACb;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,8BAA8B;AAC9B,WAAW,EAAE;AACb;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,8BAA8B;AAC9B,WAAW,EAAE;AACb;AACA;AACA;AACA;;;AAGA;AACA,8BAA8B;AAC9B,WAAW,EAAE;AACb;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,8BAA8B;AAC9B,WAAW,EAAE;AACb;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,EAAE;AACb;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,+BAA+B,qBAAqB,KAAK;AACzD,WAAW,EAAE;AACb;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,E;;;;;;;;;;;AChQA,YAAY,KAAK;AACjB;;AAEA;;AAEA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,YAAY;AACvB,WAAW,OAAO;AAClB,WAAW,SAAS;AACpB,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,uBAAuB,sBAAsB;AAC7C;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4CAA4C,4BAA4B;AACxE;AACA;AACA;AACA,0CAA0C;AAC1C,wCAAwC,8CAA8C;AACtF,wFAAwF,OAAO,IAAI,WAAW,YAAY,YAAY,KAAK,QAAQ,GAAG;AACtJ;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,mDAAmD;;;AAGnD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,WAAW,KAAK;AAChB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,eAAe,sBAAsB;AACrC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,WAAW,OAAO;AAClB,WAAW,KAAK;AAChB;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,sBAAsB;AACrC;AACA;AACA,UAAU;AACV;AACA;;AAEA;AACA;AACA;AACA;AACA,sDAAsD;AACtD;AACA;AACA,6CAA6C;AAC7C,wJAAwJ;AACxJ;AACA,qHAAqH;AACrH,sEAAsE;AACtE,0DAA0D;AAC1D;AACA;AACA,qEAAqE;AACrE,uGAAuG;AACvG,yCAAyC;AACzC,6CAA6C;AAC7C,oCAAoC;AACpC,wBAAwB;AACxB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,wBAAwB,iCAAiC,UAAU;AACnE;;AAEA;AACA,oCAAoC,iBAAiB,UAAU;AAC/D;;AAEA;AACA,oCAAoC,iBAAiB,UAAU;AAC/D;;AAEA;AACA;AACA,wBAAwB,iCAAiC,UAAU;AACnE;;AAEA;AACA;AACA,8BAA8B;AAC9B;AACA;AACA;;AAEA;AACA,WAAW,QAAQ;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,kBAAkB;;AAElB,8CAA8C,4FAA4F,EAAE;;AAE5I;AACA;;AAEA,KAAK;AACL,8CAA8C,yDAAyD,EAAE;AACzG;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,uDAAuD;AACvD,aAAa;AACb,yGAAyG,mBAAmB,EAAE,EAAE;AAChI;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,eAAe,mBAAmB;AAClC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,iCAAiC,mBAAmB;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6GAA6G;AAC7G;AACA;;AAEA,mBAAmB,mBAAmB;AACtC;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,uBAAuB,mBAAmB;AAC1C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa;AACb,2BAA2B,kBAAkB;AAC7C;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,uBAAuB,mBAAmB;AAC1C;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,uBAAuB,SAAS;AAChC;AACA,4C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,mBAAmB,KAAK;AACxB;AACA;AACA;AACA;AACA;AACA,gEAAgE;AAChE;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mEAAmE;AACnE;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,wDAAwD;AACxD;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,gEAAgE;AAChE;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,oDAAoD;;AAEpD;;AAEA;AACA,mCAAmC,SAAS;AAC5C;;AAEA;AACA,eAAe,OAAO;AACtB;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,qEAAqE;AACrE,SAAS;AACT,gDAAgD,GAAG;AACnD,SAAS;AACT,kEAAkE;AAClE;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6DAA6D;AAC7D;AACA,+BAA+B;AAC/B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8CAA8C;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wCAAwC;AACxC,0BAA0B;AAC1B;AACA;AACA,oHAAoH;AACpH,sEAAsE;AACtE,UAAU,OAAO;AACjB,6DAA6D;AAC7D;AACA;AACA;AACA,4BAA4B;AAC5B,+HAA+H;AAC/H,+BAA+B;AAC/B,iEAAiE;AACjE,0DAA0D;AAC1D;AACA;AACA,+EAA+E,uBAAuB,EAAE;AACxG,8CAA8C;AAC9C,sBAAsB,OAAO,SAAS,EAAE;AACxC,kBAAkB;AAClB,eAAe;AACf,UAAU;AACV;AACA,uBAAuB;AACvB;AACA,uCAAuC;AACvC,4DAA4D;AAC5D,mCAAmC,SAAS;AAC5C,UAAU;AACV,gEAAgE;AAChE;AACA,+BAA+B;AAC/B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,eAAe,OAAO;AACtB;AACA,+GAA+G;AAC/G;AACA,0CAA0C;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB;;AAEpB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gIAAgI;AAChI;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,8FAA8F,gEAAgE;AAC9J,kEAAkE,gEAAgE;AAClI;AACA;AACA,oMAAoM;;AAEpM;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,0GAA0G,SAAS;AACnH;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,iBAAiB;AAChC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sDAAsD;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,uEAAuE;AACvE;AACA;AACA,KAAK;AACL,kFAAkF;AAClF;AACA,KAAK;AACL,0DAA0D;AAC1D,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA,mCAAmC;AACnC;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT,oDAAoD;AACpD;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,mBAAmB,cAAc;AACjC;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB;AACA,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B,gBAAgB;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2EAA2E;AAC3E;AACA,oDAAoD;AACpD,oJAAoJ;AACpJ,6BAA6B;AAC7B;AACA;AACA,wEAAwE;AACxE;AACA,oDAAoD;AACpD,iJAAiJ;AACjJ,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;AACA,0CAA0C;AAC1C,oDAAoD;AACpD,sFAAsF;AACtF,0BAA0B;AAC1B;AACA;AACA;AACA,mFAAmF;AACnF;AACA;AACA;AACA,mFAAmF;AACnF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yFAAyF;AACzF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,wCAAwC;AACxC,oDAAoD;AACpD;AACA,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,WAAW,eAAe;AAC1B,WAAW,gBAAgB;AAC3B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,eAAe,kBAAkB;AACjC;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,+BAA+B,8CAA8C;AAC7E;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,6BAA6B;AAC7B;AACA;;AAEA;AACA,oBAAoB;AACpB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,2CAA2C;AAC1D;AACA;AACA;AACA;AACA;AACA,eAAe,4BAA4B;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,qCAAqC;AACrC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,eAAe,yBAAyB;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA,iFAAiF;AACjF,qDAAqD;AACrD,6DAA6D,sDAAsD;AACnH,wBAAwB,gBAAgB,gBAAgB,gBAAgB,gBAAgB,gCAAgC;AACxH,kCAAkC,uBAAuB,yBAAyB,wBAAwB;AAC1G,wHAAwH;AACxH,qCAAqC;;AAErC,eAAe,yBAAyB;AACxC;AACA,6CAA6C;AAC7C;;AAEA,qBAAqB;AACrB,kCAAkC;AAClC;AACA;AACA,UAAU;;AAEV,eAAe,yBAAyB;AACxC;AACA;AACA;;AAEA,qCAAqC,QAAQ,OAAO,iBAAiB,sBAAsB,EAAE,GAAG;AAChG,4FAA4F;AAC5F,mDAAmD,mBAAmB;AACtE,0HAA0H,gCAAgC,EAAE;AAC5J,gCAAgC,8CAA8C,2EAA2E,GAAG;AAC5J,qCAAqC,eAAe,eAAe,eAAe,eAAe,eAAe,+BAA+B;AAC/I,kCAAkC,qBAAqB,mBAAmB,oBAAoB;AAC9F,2CAA2C;AAC3C,qCAAqC;AACrC,uBAAuB,iCAAiC;AACxD,qBAAqB;AACrB,WAAW;;AAEX;AACA;;AAEA;AACA,iCAAiC,QAAQ,sBAAsB,EAAE;AACjE;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,0BAA0B;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,mBAAmB;AACtC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,qBAAqB;AACrB,oDAAoD;AACpD;AACA;AACA,iBAAiB;AACjB;AACA,qGAAqG;AACrG;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,qGAAqG;AACrG,8CAA8C,OAAO,yBAAyB,wBAAwB,kFAAkF;AACxL,iDAAiD;AACjD,uCAAuC;AACvC,8BAA8B;AAC9B,kBAAkB;AAClB;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,gDAAgD;AAChD,KAAK;AACL;AACA,sCAAsC;AACtC;;AAEA;;AAEA;;AAEA;AACA,0FAA0F;;AAE1F;;AAEA;AACA,oCAAoC,SAAS;AAC7C;;AAEA;AACA;AACA;AACA,iGAAiG;AACjG,0CAA0C,OAAO,yBAAyB,wBAAwB,kFAAkF;AACpL,6CAA6C;AAC7C,mCAAmC;AACnC,0BAA0B;AAC1B,cAAc;AACd;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,gEAAgE;AAChE,4DAA4D;AAC5D,kBAAkB;AAClB,kFAAkF;AAClF,SAAS;AACT,gEAAgE;AAChE;AACA;AACA,wBAAwB;;AAExB;;AAEA;;AAEA;AACA;AACA,kCAAkC;AAClC,iEAAiE,eAAe,OAAO,8EAA8E;AACrK,KAAK;AACL;AACA,kCAAkC;AAClC,wBAAwB;AACxB;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,2CAA2C,8BAA8B,+BAA+B,EAAE,OAAO,6BAA6B,wBAAwB,UAAU,EAAE,EAAE;AACpL,KAAK;;AAEL;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA,2CAA2C;AAC3C;AACA,qGAAqG;;AAErG,wCAAwC,SAAS;AACjD,cAAc,OAAO;AACrB,yCAAyC,uBAAuB,SAAS;AACzE,cAAc;AACd,cAAc;AACd;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,eAAe,OAAO;AACtB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA,oBAAoB;;AAEpB;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,4CAA4C;AAC5C;;AAEA;AACA;AACA;AACA;AACA;AACA,4DAA4D,sCAAsC;;AAElG;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA,qEAAqE;AACrE;AACA;AACA;;AAEA;AACA,sEAAsE;AACtE;AACA,wEAAwE;AACxE;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,8HAA8H;AAC9H;AACA;AACA,oBAAoB;;AAEpB;AACA;AACA;AACA;;AAEA;AACA,sJAAsJ;AACtJ;AACA;;AAEA;;AAEA;;AAEA;AACA;;AAEA;AACA,YAAY;AACZ;AACA;AACA;;AAEA;AACA;AACA;AACA,YAAY;AACZ;AACA,mFAAmF;AACnF;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB;AACA,uIAAuI;;AAEvI;;AAEA;;AAEA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB;AACA;AACA,yGAAyG;;AAEzG;;AAEA,gDAAgD;AAChD,gCAAgC,UAAU,EAAE;AAC5C;AACA,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA,qDAAqD;AACrD;AACA;;AAEA,uFAAuF;AACvF;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,eAAe;AAC1B,WAAW,MAAM;AACjB,WAAW,uBAAuB;AAClC,WAAW,SAAS;AACpB,WAAW,gBAAgB;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,mBAAmB,8BAA8B;AACjD;AACA;AACA,mBAAmB,uDAAuD;AAC1E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA,4BAA4B;;AAE5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,0TAA0T;AAC1T;AACA,yDAAyD;AACzD;AACA;AACA,yDAAyD;AACzD;;AAEA;AACA;AACA;AACA;AACA,8CAA8C,mDAAmD,uBAAuB,cAAc,EAAE,OAAO;;AAE/I;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,uBAAuB,qBAAqB;AAC5C;AACA;AACA,iCAAiC;AACjC;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,qBAAqB;AACxC;AACA,0HAA0H;AAC1H;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,8BAA8B;AAC7C;AACA;AACA;AACA,0EAA0E;AAC1E;AACA;AACA,eAAe,uDAAuD;AACtE;AACA;AACA;AACA,0EAA0E;AAC1E;AACA;AACA;AACA;AACA,sEAAsE;AACtE;;AAEA;AACA;AACA;AACA;AACA;AACA,6EAA6E;AAC7E;AACA;AACA,0EAA0E;AAC1E;AACA;;AAEA;AACA,uBAAuB;AACvB;AACA,6BAA6B;;AAE7B;AACA;AACA,6EAA6E;AAC7E;;AAEA;AACA,kDAAkD,SAAS,IAAI,EAAE,6BAA6B,GAAG;;AAEjG;AACA;AACA;AACA,yCAAyC,aAAa;AACtD,6BAA6B,QAAQ,EAAE;;AAEvC;AACA,qCAAqC,IAAI;AACzC;AACA,uCAAuC;AACvC,0BAA0B;AAC1B,2BAA2B,EAAE;;AAE7B;AACA;AACA,iFAAiF;AACjF;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,8DAA8D;AAC9D;AACA;AACA,4DAA4D;AAC5D,wEAAwE;AACxE,+DAA+D;AAC/D;;AAEA;AACA,6DAA6D;AAC7D;;AAEA;AACA;AACA;AACA;AACA;AACA,uEAAuE;AACvE,KAAK;AACL,wCAAwC;AACxC;;AAEA;AACA;AACA;AACA;AACA;AACA,iEAAiE;;AAEjE;AACA;AACA;AACA;AACA,qCAAqC;AACrC;AACA;AACA,sCAAsC;AACtC;AACA;AACA,uCAAuC;AACvC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8EAA8E,oDAAoD;AAClI;AACA,+BAA+B,gFAAgF;AAC/G,SAAS;AACT,8EAA8E;AAC9E,sDAAsD,yEAAyE;AAC/H;AACA,KAAK;AACL;AACA;AACA,qFAAqF;AACrF;AACA,sFAAsF;AACtF;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,mEAAmE;AACnE;;AAEA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA,0BAA0B,QAAQ;AAClC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,mBAAmB,iBAAiB;AACpC;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,iDAAiD;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,gDAAgD,sBAAsB;AACtE;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C,GAAG;AAC7C,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,wCAAwC;AACxC;;AAEA;AACA,0CAA0C;AAC1C;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,oDAAoD;AACpD;AACA;AACA;;AAEA;;AAEA;AACA,0FAA0F;;AAE1F;;AAEA;AACA,gCAAgC,SAAS;AACzC;;AAEA;AACA,eAAe,OAAO;AACtB;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,6DAA6D;AAC7D;AACA;;AAEA;;AAEA;;AAEA;AACA,0CAA0C;AAC1C;AACA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA,uEAAuE;AACvE;AACA;AACA,wFAAwF;AACxF;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;;AAEA,+GAA+G,8CAA8C;AAC7J,sEAAsE;AACtE,+IAA+I,sBAAsB;;AAErK;AACA,uDAAuD;AACvD;AACA;AACA,uDAAuD;AACvD;;AAEA,sCAAsC,IAAI;AAC1C;AACA,uCAAuC;AACvC,0BAA0B;AAC1B,8BAA8B,WAAW,8CAA8C;AACvF,mCAAmC;AACnC,UAAU,kDAAkD;AAC5D,kDAAkD;AAClD,UAAU,qBAAqB,0EAA0E,EAAE;AAC3G,6BAA6B,YAAY,iBAAiB,UAAU,EAAE,OAAO,WAAW,IAAI,GAAG;AAC/F,2BAA2B,qBAAqB,EAAE;;AAElD;;AAEA;AACA,gBAAgB;;AAEhB;;AAEA;;AAEA;;AAEA,YAAY;AACZ,yGAAyG;;AAEzG;;AAEA;AACA,+EAA+E;AAC/E;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA,2BAA2B,wCAAwC;AACnE,KAAK;AACL;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,2BAA2B,wCAAwC;AACnE,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,gBAAgB;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,iGAAiG;AACjG,0CAA0C,OAAO,iBAAiB,wBAAwB,kFAAkF;AAC5K,6CAA6C;AAC7C,mCAAmC;AACnC,0BAA0B;AAC1B,cAAc;AACd;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iEAAiE;AACjE;AACA,sCAAsC;AACtC;AACA,sCAAsC;AACtC,aAAa;AACb,mCAAmC,qBAAqB;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,OAAO;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,eAAe,kBAAkB;AACjC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,WAAW,eAAe;AAC1B,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA,2BAA2B;AAC3B;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,iFAAiF;AACjF,6DAA6D,6GAA6G,EAAE;AAC5K,2DAA2D,wBAAwB;AACnF;AACA;AACA,qDAAqD;AACrD;AACA;AACA,8CAA8C;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qIAAqI;AACrI;AACA,qDAAqD;AACrD;AACA;AACA,8CAA8C;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mEAAmE;AACnE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qEAAqE;AACrE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,WAAW,eAAe;AAC1B,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,SAAS;AACpB,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;AAEA,qCAAqC,QAAQ;AAC7C;AACA;AACA;AACA;AACA,gDAAgD;AAChD;AACA;AACA,uGAAuG;AACvG;AACA;AACA;AACA;AACA,4EAA4E;AAC5E;AACA;AACA;;AAEA;AACA,WAAW,MAAM;AACjB,WAAW,gBAAgB;AAC3B;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,iDAAiD;AACjD;AACA;;AAEA,UAAU,kBAAkB;AAC5B;AACA;AACA;AACA;AACA,uGAAuG;AACvG;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,YAAY;AACZ,eAAe,OAAO;AACtB,mHAAmH;AACnH;AACA;AACA;AACA,iEAAiE;AACjE;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,0EAA0E;AAC1E;AACA,mCAAmC;AACnC,iDAAiD,gBAAgB;AACjE,mDAAmD;AACnD,8FAA8F,sBAAsB;;AAEpH;AACA,yDAAyD;AACzD;;AAEA;AACA,yDAAyD;AACzD;;AAEA,8CAA8C,kDAAkD,uBAAuB,cAAc,EAAE;AACvI,gCAAgC;AAChC,gCAAgC,mBAAmB,mBAAmB,aAAa,EAAE;AACrF,8BAA8B,mBAAmB,mBAAmB,aAAa,4CAA4C;AAC7H,mBAAmB,mBAAmB,EAAE;AACxC,UAAU,OAAO,mBAAmB,EAAE;;AAEtC;AACA;AACA;;AAEA;AACA,uCAAuC,aAAa;AACpD,8BAA8B,EAAE;;AAEhC;AACA,qCAAqC,IAAI;AACzC;AACA,uCAAuC;AACvC,0BAA0B;AAC1B,2BAA2B,EAAE;AAC7B,6BAA6B,WAAW,8CAA8C,2BAA2B,gBAAgB,kDAAkD,yCAAyC,EAAE,qBAAqB,sEAAsE,EAAE,qBAAqB,YAAY,iBAAiB,UAAU,EAAE,OAAO,WAAW,GAAG,EAAE,EAAE,EAAE;;AAEpZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;AACA,kCAAkC;AAClC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,aAAa,WAAW;AACxB,4GAA4G;AAC5G,2BAA2B,SAAS,gBAAgB,mBAAmB,KAAK,aAAa;AACzF;;AAEA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA,8FAA8F,SAAS;AACvG;;AAEA;AACA;;AAEA,gFAAgF,0BAA0B;AAC1G;AACA;AACA;AACA,+EAA+E;AAC/E;AACA;;AAEA,2CAA2C;AAC3C;AACA;AACA;AACA,oCAAoC,GAAG;AACvC;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;;;;;;;;;;;ACnmGA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,sBAAsB,6BAA6B;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb;AACA,SAAS;AACT,KAAK;AACL,wBAAwB,6BAA6B;AACrD;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT,KAAK;AACL,CAAC;;AAED;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,kBAAkB;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,kBAAkB;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA,WAAW,kBAAkB;AAC7B;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,kBAAkB;AAC7B,WAAW,kBAAkB;AAC7B;AACA;AACA;AACA;AACA,YAAY;AACZ,oBAAoB;AACpB,kBAAkB;AAClB,kBAAkB;AAClB;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,YAAY,mBAAmB;AAC/B;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA,gBAAgB;AAChB,4BAA4B;AAC5B,YAAY;AACZ,cAAc;;AAEd;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,cAAc;;AAEd;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC;;AAEhC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,SAAS;AACT;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,wBAAwB;AACxB,aAAa;AACb;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,yCAAyC;AACpD,WAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,aAAa;AACb,4CAA4C;AAC5C;AACA;AACA,SAAS;AACT;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,oCAAoC;AACpC;AACA;AACA,KAAK;AACL;AACA;AACA,CAAC;;AAED;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;AAEA;AACA,aAAa;AACb;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;;AAEA,eAAe;;AAEf;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;;AAEA;AACA,0BAA0B;AAC1B;;AAEA;AACA;AACA;;AAEA,8CAA8C;AAC9C;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sDAAsD;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,8BAA8B,QAAQ;AACtC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,0CAA0C;AAC1C,+CAA+C;AAC/C,yCAAyC;;AAEzC;AACA;AACA;AACA;;;;;;;;;;;;;;AC33BA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AC3EA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,iBAAiB;AAC5B,WAAW,SAAS;AACpB;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,0DAA0D;AAC1D,0BAA0B,uBAAuB,0CAA0C;AAC3F;AACA;AACA;AACA,SAAS;AACT,gBAAgB,4BAA4B;AAC5C,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;;AAEA;AACA;AACA,WAAW,WAAW;AACtB,WAAW,OAAO;AAClB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,SAAS;AACT;AACA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL,CAAC;;AAED;AACA,WAAW,WAAW;AACtB,WAAW,OAAO;AAClB,aAAa;AACb;AACA;AACA;AACA;AACA,kCAAkC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,KAAK;AACL,CAAC;;AAED;AACA;AACA,aAAa;AACb;AACA,WAAW,WAAW;AACtB,WAAW,OAAO;AAClB,WAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA,+CAA+C;AAC/C;AACA,SAAS;AACT,KAAK;AACL,CAAC;;AAED;AACA;AACA,aAAa;AACb,WAAW,8BAA8B;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA,KAAK;AACL,SAAS;AACT,KAAK;AACL,CAAC;;AAED;AACA;AACA;AACA,aAAa;AACb,WAAW,WAAW;AACtB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC;AAClC;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA,CAAC;;;AAGD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,E;;;;;;;;;;;AC5YD,cAAc,kBAAkB;AAChC,cAAc,yBAAyB;;AAEvC;AACA;AACA,aAAa;AACb,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,uBAAuB,cAAc;AACrC;AACA;AACA;AACA,0BAA0B;AAC1B,KAAK;AACL,sBAAsB,0BAA0B;AAChD;AACA;AACA;AACA;AACA;AACA,6MAA6M;AAC7M;AACA;AACA;AACA,4CAA4C,IAAI;AAChD;AACA;AACA;AACA;AACA;AACA,wCAAwC,uBAAuB;AAC/D,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT,KAAK;AACL,wBAAwB,0BAA0B;AAClD;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,uBAAuB;AAC5C;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,uBAAuB;AAC5C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,uBAAuB;AAC5C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA,iGAAiG;AACjG,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT,KAAK;AACL,6BAA6B,0BAA0B;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB;AACzB,qBAAqB;AACrB;AACA;AACA,aAAa;AACb,qBAAqB,yBAAyB;AAC9C;AACA;AACA,SAAS;AACT,KAAK;AACL,sBAAsB,0BAA0B;AAChD;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,yDAAyD;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B,wBAAwB;AACvD;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,eAAe;AAC1B,UAAU;AACV;AACA;AACA;AACA;AACA,cAAc,OAAO;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA,YAAY,mBAAmB;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,mBAAmB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,mBAAmB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,kBAAkB;AAC7B,WAAW,kBAAkB;AAC7B,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,kBAAkB;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,gBAAgB;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C,mBAAmB;AAC7D;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,MAAM;AACjB,WAAW,MAAM;AACjB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,mBAAmB;AAC9C;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA,WAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+HAA+H;AAC/H;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,kBAAkB;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4DAA4D,iBAAiB;AAC7E;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA,WAAW,OAAO;AAClB,WAAW,SAAS;AACpB,WAAW,UAAU;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT,gBAAgB,4BAA4B;AAC5C,gBAAgB,mCAAmC;AACnD,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,gBAAgB;AAC3B;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA,WAAW,gBAAgB;AAC3B;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA,WAAW,gBAAgB;AAC3B;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA,SAAS;AACT;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,SAAS;AACT,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,SAAS;AACT,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,SAAS;AACT,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;AACL;;;;;;;;;;;;ACt6BA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;;AAET;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,aAAa;AACb,+EAA+E,mBAAmB;AAClG;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,sBAAsB;AACtB;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA,iBAAiB;AACjB;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,WAAW,OAAO;AAClB,WAAW,SAAS;AACpB,WAAW,UAAU;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,SAAS;AACT,gBAAgB,mCAAmC;AACnD,KAAK;AACL;;AAEA;AACA;AACA,WAAW,gBAAgB;AAC3B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,gBAAgB;AAC3B;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA,WAAW,gBAAgB;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;;AAEA;AACA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;;;;;;;;;;;AC1MD;AACA;AACA,WAAW,SAAS;AACpB,WAAW,eAAe;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA,CAAC;AACD,8D;;;;;;;;;;;AC1CA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,0DAA0D;AAC1D;AACA,aAAa;AACb;AACA,+BAA+B,iCAAiC;AAChE;AACA;AACA,aAAa;AACb;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,WAAW,IAAI;AACf;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,CAAC;;AAED;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,SAAS;AACT;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,2BAA2B,yBAAyB;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,uBAAuB,yBAAyB;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;;AC9ZA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;AAIA;AACA;AACA,WAAW,IAAI;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4CAA4C,6DAA6D;AACzG;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,sBAAsB,cAAc;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,KAAK;AACL,wBAAwB,cAAc;AACtC;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA,+BAA+B,uBAAuB,EAAE;AACxD,+BAA+B,oBAAoB;AACnD,SAAS;AACT;AACA,+BAA+B,sBAAsB,EAAE;AACvD,+BAA+B,mBAAmB;AAClD,SAAS;AACT;AACA,+BAA+B,yBAAyB,EAAE;AAC1D,+BAA+B,sBAAsB;AACrD,SAAS;AACT;AACA,+BAA+B,kCAAkC,EAAE;AACnE,+BAA+B,+BAA+B;AAC9D;AACA,KAAK;AACL,sBAAsB,cAAc;AACpC;AACA;AACA;;AAEA;AACA;AACA,aAAa;AACb;AACA;;AAEA;AACA;AACA,+BAA+B,oBAAoB;AACnD;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA,0CAA0C,KAAK;AAC/C;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,2BAA2B,IAAI;AAC/B,mBAAmB;AACnB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA,qBAAqB;AACrB,iBAAiB;AACjB;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,mCAAmC;AACnC;AACA;AACA,CAAC;;AAED;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,iDAAiD;AACjD;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;AAGA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,CAAC;;;AAGD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,mBAAmB,mBAAmB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;;ACnkBA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,mBAAmB,gBAAgB;AACnC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB;AACA,SAAS;AACT;AACA,KAAK;AACL;AACA,mBAAmB,kBAAkB;AACrC;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACzKA;AACA;AACA;;AAEA;AACA;AACA,WAAW,eAAe;AAC1B,WAAW,eAAe;AAC1B,WAAW,OAAO;AAClB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,KAAK;AACL,2BAA2B;AAC3B;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA,qBAAqB,4BAA4B;AACjD;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;;;AAID;AACA;AACA;AACA,CAAC;;AAED;AACA,CAAC;;AAED;AACA;AACA,CAAC,EAAE;;AAEH;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;AAEA;AACA,CAAC;;AAED;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,SAAS;AACT;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;;AAEA;AACA;AACA,8BAA8B,0BAA0B;AACxD;AACA;AACA;AACA,CAAC;;AAED;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;;AAEA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA,CAAC;;;AAGD;;;;;;;;;;;;ACvQA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL,CAAC;;AAED,0D;;;;;;;;;;;ACjDA,cAAc,kBAAkB;;AAEhC;AACA,eAAe,gBAAgB;AAC/B,kBAAkB,iBAAiB;AACnC,UAAU,WAAW;AACrB,CAAC;;AAED;AACA;AACA,aAAa;AACb;AACA,WAAW,OAAO;AAClB;AACA,YAAY,kBAAkB;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT,gCAAgC;AAChC,SAAS;AACT;AACA;AACA,KAAK;AACL,sBAAsB,4BAA4B;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,yBAAyB,4BAA4B;AACrD;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb;AACA,SAAS;AACT,KAAK;AACL,yBAAyB,4BAA4B;AACrD;AACA;AACA,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,uBAAuB;AAC5C;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,gDAAgD;AAC7E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,wBAAwB,eAAe;AACvC;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT,KAAK;AACL,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,YAAY,QAAQ;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA,YAAY,cAAc;AAC1B,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB;AACvB,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,UAAU;AACtB,YAAY,kCAAkC;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,SAAS;AACT;AACA;;AAEA;AACA;AACA;AACA;;AAEA,0DAA0D,GAAG;AAC7D;AACA;AACA,aAAa;AACb;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;;AAGA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACrnBA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,8BAA8B,EAAE;AAChC,wCAAwC,EAAE;;AAE1C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA,4BAA4B;AAC5B;;AAEA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,wEAAwE,eAAe;AACvF;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sDAAsD,EAAE;AACxD;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,oBAAoB,mFAAmF,MAAM;AAC7G,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,mBAAmB,mBAAmB;AACtC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,0C;;;;;;;;;;;ACnWA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,QAAQ;AACnB;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,wEAAwE;AACxE;;AAEA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,iBAAiB;AACjB;AACA,iBAAiB;AACjB;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;;AAEA;AACA,CAAC;;;AAGD;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,2BAA2B,4BAA4B;AACvD;AACA;AACA;AACA;AACA;AACA;;;;AAIA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,uBAAuB,eAAe;AACtC,6BAA6B;AAC7B,kCAAkC;AAClC;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc,kBAAkB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc,iBAAiB;AAC/B;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA,iCAAiC,eAAe;AAChD;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,gBAAgB;AAChB;AACA;AACA,qCAAqC,qBAAqB;AAC1D;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;;;AC3UA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,6BAA6B;AACpD;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA,SAAS;AACT,KAAK;AACL,CAAC;AACD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;;;;;ACzIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,cAAc,kBAAkB;AAChC,cAAc,yBAAyB;;AAEvC;AACA;AACA;AACA,WAAW,eAAe;AAC1B,WAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,eAAe;AAC1B,WAAW,4BAA4B;AACvC,WAAW,SAAS;AACpB,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,WAAW,WAAW;AACtB;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,aAAa,eAAe;AAC5B;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2CAA2C;AAC3C;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,aAAa,aAAa;AAC1B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,aAAa,aAAa;AAC1B;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,8BAA8B;AAC7C;AACA;AACA;AACA;AACA,wBAAwB;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA,SAAS;AACT,iBAAiB,eAAe;AAChC,KAAK;AACL,E;;;;;;;;;;;ACnWA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB;AACxB;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,CAAC;;;;;;;;;;;;AC9MD;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,eAAe,sCAAsC;AAClE;AACA;AACA;AACA,kDAAkD,yDAAyD;AAC3G;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sFAAsF;AACtF;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,uBAAuB;AAC1C;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,WAAW,OAAO;AAClB,WAAW,SAAS;AACpB,WAAW,QAAQ;AACnB;AACA,WAAW,QAAQ;AACnB;AACA,WAAW,QAAQ;AACnB,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,+CAA+C,IAAI;AACnD;AACA;;AAEA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,iBAAiB;AACjB;AACA;AACA,qBAAqB;AACrB;AACA;;AAEA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA,uDAAuD;AACvD;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA,iBAAiB;;AAEjB;AACA;;AAEA,SAAS;;AAET;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA,iCAAiC,SAAS;AAC1C;;AAEA;AACA;AACA;;AAEA;AACA,sEAAsE;AACtE;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B,mBAAmB;AAClD;AACA;AACA,uCAAuC,OAAO;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,gDAAgD;;AAEhD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,SAAS;AACT;;AAEA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,SAAS;AACT,KAAK;;AAEL;AACA;;AAEA;AACA,WAAW,OAAO;AAClB,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,gBAAgB,OAAO;AACvB,kBAAkB,QAAQ;AAC1B,gBAAgB,OAAO;AACvB,sBAAsB,QAAQ;AAC9B,sBAAsB,OAAO;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,gBAAgB,OAAO;AACvB,kBAAkB,QAAQ;AAC1B,gBAAgB,OAAO;AACvB,sBAAsB,QAAQ;AAC9B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,uBAAuB,UAAU;;AAEjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,uBAAuB,qBAAqB;AAC5C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;;AAEA,KAAK;AACL;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,4BAA4B;;AAE5B;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,gD;;;;;;;;;;;AClnBA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,oBAAoB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA,SAAS;AACT,8BAA8B;AAC9B,SAAS;AACT;AACA;AACA;AACA,KAAK;AACL,uBAAuB,0BAA0B;AACjD;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA,gCAAgC;AAChC,SAAS;;AAET;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B,SAAS;AACT;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT,KAAK;AACL,yBAAyB,0BAA0B;AACnD;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb;AACA,SAAS;AACT,KAAK;AACL,yBAAyB,0BAA0B;AACnD;AACA;AACA,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,uBAAuB;AAC5C;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT,KAAK;AACL,uBAAuB,0BAA0B;AACjD;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB;AACA;AACA;AACA,cAAc;AACd;AACA,eAAe,kCAAkC;AACjD,eAAe;AACf;AACA;AACA;AACA;AACA;AACA,sBAAsB,YAAY;AAClC;AACA,sBAAsB,YAAY;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,yBAAyB;AACpC,WAAW,qBAAqB;AAChC;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,gBAAgB;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sDAAsD;AACtD;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,YAAY,OAAO;AACnB,YAAY,eAAe;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,eAAe,cAAc;AAC7B;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,mBAAmB;AACnB;AACA;AACA;;AAEA;;AAEA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,EAAE;AACb,WAAW,EAAE;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B,QAAQ;AACtC;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,mBAAmB;AAC9B,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,uBAAuB,yBAAyB;AAChD;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT,KAAK;AACL,CAAC;;AAED;;;;;;;;;;;;AC32BA,eAAe,SAAS,w1D;;;;;;;;;;;ACAxB;AACA;AACA,WAAW,MAAM;AACjB;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,uBAAuB,0BAA0B;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,+DAA+D,iBAAiB;AAChF;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,OAAO;AAClC,+BAA+B,mBAAmB;AAClD;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;;AAEA,2BAA2B,OAAO;AAClC,+BAA+B,SAAS;AACxC;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL,yBAAyB,0BAA0B;AACnD;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,uBAAuB,QAAQ;AAC/B;AACA;AACA,aAAa;AACb,qBAAqB,uBAAuB;AAC5C;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,uBAAuB;AAC5C;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,uBAAuB;AAC5C;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,+BAA+B,SAAS;AACxC;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA,uBAAuB,0BAA0B;AACjD;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,cAAc,aAAa;AAC3B,+BAA+B,8BAA8B;AAC7D;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,KAAK;AACL,uBAAuB,oBAAoB;AAC3C;AACA;AACA,SAAS;AACT;AACA;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,oBAAoB;AAC/C;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,KAAK;AACL,uBAAuB,oBAAoB;AAC3C;AACA;AACA,SAAS;AACT;AACA;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA,wBAAwB;AACxB;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT,KAAK;AACL,CAAC;;AAED;;AAEA;AACA;AACA;AACA,WAAW,GAAG;AACd,WAAW,GAAG;AACd,WAAW,GAAG;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,uBAAuB,wBAAwB;AAC/C;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,uBAAuB,wBAAwB;AAC/C;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA,aAAa;AACb,WAAW,gBAAgB;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL,YAAY,4BAA4B;AACxC,CAAC;;AAED;AACA;AACA,aAAa;AACb,WAAW,gBAAgB;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL,YAAY,4BAA4B;AACxC,CAAC;;;;;;;;;;;;AC9gBD;;AAEA;AACA;AACA;;AAEA,mBAAO,CAAC,gCAAW;;AAEnB;AACA,wBAAwB,mBAAO,CAAC,qDAAU;AAC1C,mBAAO,CAAC,8DAA2B;AACnC,mBAAO,CAAC,4DAA0B;AAClC,mBAAO,CAAC,iEAAc;;AAEtB;AACA,mBAAO,CAAC,mCAAQ;AAChB,mBAAO,CAAC,8BAAU;AAClB,mBAAO,CAAC,gCAAW;AACnB,mBAAO,CAAC,sCAAc;AACtB,mBAAO,CAAC,kCAAY;AACpB,mBAAO,CAAC,wCAAe;AACvB,mBAAO,CAAC,oCAAa;AACrB,mBAAO,CAAC,wCAAe;AACvB,mBAAO,CAAC,kCAAY;AACpB;AACA,mBAAO,CAAC,0CAAgB;AACxB;AACA;AACA;AACA;AACA;AACA,CAAC;AACD,mBAAO,CAAC,qCAAY;AACpB,mBAAO,CAAC,4CAAiB;AACzB,mBAAO,CAAC,8BAAU;;AAElB;AACA;AACA;AACA,CAAC;;AAED,mBAAO,CAAC,wCAAe;AACvB,mBAAO,CAAC,sCAAc;AACtB,mBAAO,CAAC,oCAAa;AACrB,mBAAO,CAAC,oCAAa;AACrB,mBAAO,CAAC,wCAAe;AACvB,mBAAO,CAAC,wDAAuB;AAC/B,mBAAO,CAAC,gCAAW;AACnB,mBAAO,CAAC,8BAAU;AAClB,mBAAO,CAAC,4CAAiB;AACzB,mBAAO,CAAC,kCAAY;AACpB,mBAAO,CAAC,kCAAY;AACpB,mBAAO,CAAC,gCAAW;AACnB,mBAAO,CAAC,0CAAgB;AACxB,mBAAO,CAAC,gDAAmB;AAC3B,mBAAO,CAAC,kEAA4B;AACpC,mBAAO,CAAC,8BAAU;AAClB,mBAAO,CAAC,gCAAW;AACnB,mBAAO,CAAC,kCAAY;AACpB,mBAAO,CAAC,sCAAc;AACtB,mBAAO,CAAC,kCAAY;AACpB,mBAAO,CAAC,8BAAU;AAClB,mBAAO,CAAC,kCAAY;AACpB,mBAAO,CAAC,oCAAa;AACrB,mBAAO,CAAC,0CAAgB;AACxB,mBAAO,CAAC,0CAAgB;AACxB,mBAAO,CAAC,gCAAW;AACnB,mBAAO,CAAC,8BAAU;AAClB,mBAAO,CAAC,kCAAY;AACpB,mBAAO,CAAC,0CAAgB;AACxB,mBAAO,CAAC,oCAAa;AACrB,mBAAO,CAAC,8BAAU;AAClB,mBAAO,CAAC,wCAAe;AACvB,mBAAO,CAAC,8BAAU;AAClB,mBAAO,CAAC,kCAAY;AACpB,mBAAO,CAAC,wCAAe;AACvB,mBAAO,CAAC,qDAAwB;AAChC,mBAAO,CAAC,oCAAa;AACrB,mBAAO,CAAC,6CAAoB;AAC5B,mBAAO,CAAC,8BAAU;AAClB,mBAAO,CAAC,wCAAe;AACvB,mBAAO,CAAC,sCAAc;AACtB,mBAAO,CAAC,oCAAa;AACrB,mBAAO,CAAC,sCAAc;AACtB,mBAAO,CAAC,kCAAY;AACpB,mBAAO,CAAC,kDAAoB;AAC5B,mBAAO,CAAC,8CAAkB;AAC1B,mBAAO,CAAC,0CAAgB;AACxB,mBAAO,CAAC,oDAAqB;;AAE7B;;;;;;;;;;;;AC1FA;AACA;AACA,WAAW,gBAAgB;AAC3B,WAAW,MAAM;AACjB;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL,CAAC;;AAED;;;;;;;;;;;;AClDA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,qGAAqG;AACrG,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,iBAAiB;AACtC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA,KAAK;AACL,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA,aAAa;AACb;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,SAAS;AACT,KAAK;AACL;;;;;;;;;;;;ACjLA;AACA;AACA;AACA,WAAW,gBAAgB;AAC3B,WAAW,kBAAkB;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT,KAAK;AACL,YAAY,4BAA4B;AACxC,CAAC;;;;;;;;;;;;AC5FD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,cAAc,kBAAkB;;AAEhC;AACA;AACA,GAAG,oBAAoB,IAAI;AAC3B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,WAAW,aAAa;AACxB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,uBAAuB;AAClC,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,oFAAoF;AACjH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,SAAS,mBAAmB,sBAAsB;AAC7D,aAAa;AACb;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA,KAAK;AACL,gCAAgC;AAChC,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B,wBAAwB,QAAQ;AAChC;AACA;;AAEA;AACA;AACA,WAAW,EAAE;AACb;AACA;AACA;AACA;AACA;AACA,qEAAqE;AACrE,yDAAyD;AACzD;AACA;;;AAGA;AACA;AACA,WAAW,EAAE;AACb,WAAW,sBAAsB;AACjC,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,gBAAgB,uBAAuB,sBAAsB;AACxE,WAAW,QAAQ;AACnB,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA,YAAY,QAAQ;AACpB;AACA;AACA;AACA,aAAa,mB;AACb;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,2DAA2D,iBAAiB;AAC5E;AACA;AACA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,KAAK;AACL,qCAAqC;AACrC;AACA,KAAK;AACL,YAAY,4BAA4B;AACxC,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB,WAAW,SAAS;AACpB;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA,qBAAqB;AACrB;AACA,qBAAqB;AACrB;AACA,qBAAqB;AACrB;AACA,qBAAqB;AACrB;AACA;AACA;;AAEA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA,qBAAqB;AACrB;AACA,qBAAqB;AACrB;AACA,qBAAqB;AACrB;AACA,qBAAqB;AACrB;AACA;AACA;;AAEA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA,aAAa;AACb,WAAW,EAAE;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oCAAoC,IAAI;AACxC;AACA;AACA;AACA;AACA,wBAAwB,IAAI;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,WAAW,KAAK;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;;AAEA;AACA,WAAW,QAAQ;AACnB,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,WAAW,KAAK;AAChB;AACA;AACA;AACA;;AAEA;AACA;AACA,YAAY;AACZ;AACA;AACA;;AAEA;AACA;AACA,YAAY;AACZ;AACA;AACA;;AAEA;AACA,WAAW,OAAO;AAClB,WAAW,KAAK;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,WAAW,QAAQ;AACnB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,WAAW,QAAQ;AACnB,WAAW,OAAO;AAClB,WAAW,KAAK;AAChB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,WAAW,OAAO;AAClB,WAAW,KAAK;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,YAAY,8BAA8B,EAAE;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA,iEAAiE;AACjE;AACA;AACA;AACA;AACA;AACA,UAAU,WAAW;AACrB,UAAU,QAAQ;AAClB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA;;AAEA;AACA,iBAAiB;AACjB;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,WAAW,eAAe;AAC1B;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA,eAAe,0BAA0B;AACzC;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oCAAoC;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,WAAW,sBAAsB;AACjC,WAAW,GAAG;AACd;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,MAAM;AACjB,WAAW,sBAAsB;AACjC,WAAW,GAAG;AACd;AACA;AACA;AACA;AACA,gCAAgC,6BAA6B;AAC7D;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,GAAG;AACd;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,gEAAgE,iBAAiB;AACjF;AACA;AACA;;AAEA;AACA,kEAAkE,iBAAiB;AACnF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,YAAY;AACZ;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;;AAEA,wCAAwC;AACxC;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,8CAA8C;AAC9C,kCAAkC;AAClC;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sDAAsD;AACtD,oDAAoD;AACpD,8KAA8K;AAC9K,oIAAoI;AACpI,6BAA6B,GAAG;AAChC;AACA;;;;;;;;;;;;AC38CA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,qBAAqB;AACrB,KAAK;AACL;AACA,sEAAsE;AACtE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA,KAAK;AACL,CAAC;;AAED;;;;;;;;;;;;ACxIA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,oEAAoE;AACpE;AACA;AACA;AACA,qCAAqC;AACrC,KAAK;AACL,sBAAsB,0BAA0B;AAChD;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA,KAAK;AACL,CAAC;;AAED;AACA;AACA,UAAU;AACV,YAAY;AACZ;AACA,mCAAmC,gBAAgB;AACnD,QAAQ,gCAAgC;AACxC,CAAC;;AAED;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,yDAAyD;AACzD,KAAK;AACL,sBAAsB,oCAAoC;AAC1D;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA,UAAU;AACV,YAAY;AACZ;AACA,uDAAuD,0BAA0B;AACjF,QAAQ,gCAAgC;AACxC,CAAC;;;AAGD;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,CAAC;;AAED,6DAA6D,IAAI,gBAAgB,E;;;;;;;;;;;AC3FjF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,iBAAiB;AACjB,0FAA0F,wBAAwB;AAClH;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA,SAAS;AACT,KAAK;AACL,sBAAsB,4BAA4B;AAClD;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACpMD;;AAEA;AACA;AACA;AACA,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;;AAGA,eAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,mBAAmB,iBAAiB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,2BAA2B;AAC3B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,8BAA8B;AAC9B;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,eAAe,cAAc;AAC7B,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;AACA;AACA,kBAAkB;AAClB;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB;AACxB;AACA,mBAAmB,uBAAuB;AAC1C;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;;;;;;;;;;;;ACrZA;AACA;AACA;;AAEA,qBAAqB;AACrB;AACA;AACA,KAAK;AACL;AACA,SAAS;AACT;AACA;;AAEA,qBAAqB;AACrB;AACA;AACA,KAAK;AACL;AACA,SAAS;AACT;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT;;AAEA;AACA;;AAEA;AACA,iC;;;;;;;;;;;AChDA;AACA;AACA,WAAW,gBAAgB;AAC3B,WAAW,gBAAgB;AAC3B,WAAW,gBAAgB;AAC3B,WAAW,eAAe;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL,CAAC;;AAED;AACA;AACA,WAAW,gBAAgB;AAC3B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA,KAAK;AACL,CAAC;;AAED;AACA;AACA,WAAW,gBAAgB;AAC3B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA,KAAK;AACL,CAAC;;;;;;;;;;;;AC5MD;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,2BAA2B,gBAAgB;AAC3C;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,iBAAiB;AACjB,qBAAqB,oBAAoB;AACzC;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA,wBAAwB;AACxB;AACA,yBAAyB;AACzB;AACA;AACA;AACA,+BAA+B,mBAAmB;AAClD;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT;AACA;AACA,+BAA+B,mBAAmB;AAClD;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA,KAAK;AACL,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,+BAA+B,UAAU;AACzC;AACA;AACA,SAAS;AACT,+BAA+B,UAAU;AACzC;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL,YAAY,4BAA4B;AACxC,CAAC;;AAED;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL,YAAY,4BAA4B;AACxC,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,WAAW,EAAE;AACb,WAAW,EAAE;AACb;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AC9PA;AACA;AACA,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC,SAAS;AACT,KAAK;AACL,CAAC;;;;;;;;;;;;AC3DD;;AAEA;AACA;AACA;AACA,WAAW,MAAM;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,iDAAiD;AACjD;AACA;AACA;AACA,uBAAuB,cAAc;AACrC;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,sBAAsB,yBAAyB;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA,2EAA2E,uBAAuB;AAClG,iBAAiB;AACjB,gDAAgD,uBAAuB;AACvE;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL,wBAAwB,yBAAyB;AACjD;AACA;AACA;AACA;AACA,SAAS;AACT,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,SAAS;AACT,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,iBAAiB,WAAW;AAC5B;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,iBAAiB,WAAW;AAC5B;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT,iBAAiB,WAAW;AAC5B;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB,SAAS;AACT,iBAAiB,WAAW;AAC5B;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA,SAAS;AACT,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;AACL;AACA;AACA,oBAAoB;AACpB;AACA,2DAA2D;AAC3D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,iBAAiB,aAAa;AAC9B;AACA,4CAA4C;AAC5C,KAAK;AACL;AACA;AACA,oBAAoB;AACpB;AACA,oEAAoE;AACpE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA,SAAS;AACT,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,iBAAiB,aAAa;AAC9B;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,iBAAiB,WAAW;AAC5B;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,iBAAiB,WAAW;AAC5B;AACA;AACA,KAAK;AACL,KAAK;AACL;AACA,sBAAsB,yBAAyB;AAC/C;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB,iBAAiB;AACjB;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+DAA+D,iBAAiB;AAChF;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA,KAAK;AACL,KAAK;AACL,CAAC;;AAED;;AAEA;AACA;AACA;AACA,WAAW,eAAe;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,iDAAiD;AACjD;AACA;AACA;AACA,uBAAuB,cAAc;AACrC;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,sBAAsB,+BAA+B;AACrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,oBAAoB;AAC/C;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,mBAAmB,MAAM;AACzB,mBAAmB,OAAO;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,wBAAwB,+BAA+B;AACvD,8BAA8B;AAC9B;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,sBAAsB,+BAA+B;AACrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB,SAAS;AACT,KAAK;AACL;AACA;AACA,CAAC;;AAED;AACA,QAAQ,mDAAmD;AAC3D,cAAc,iCAAiC;AAC/C,CAAC;;AAED;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa;AACb,WAAW,oCAAoC;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL,YAAY,4BAA4B;AACxC,CAAC;;;;;;;;;;;;AC/jBD;AACA;AACA;AACA,aAAa;AACb,WAAW,gBAAgB;AAC3B,WAAW,kBAAkB;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,KAAK;AACL,YAAY,4BAA4B;AACxC,CAAC;;;;;AAKD;AACA;AACA,aAAa;AACb,WAAW,kBAAkB;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,qBAAqB,aAAa;AAClC;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT,KAAK;AACL,YAAY,4BAA4B;AACxC,CAAC;;;;;;AAMD;;;;;;;;;;;;ACnGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,EAAE;AACb,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA,SAAS;AACT,KAAK;AACL,YAAY,4BAA4B;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT,KAAK;AACL,CAAC;;;;;;;;;;;;AC7JD,cAAc,kBAAkB;;AAEhC;AACA;AACA,aAAa;AACb,WAAW,SAAS;AACpB,WAAW,UAAU;AACrB,WAAW,UAAU;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,sBAAsB,2BAA2B;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL,wBAAwB,2BAA2B;AACnD;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT,KAAK;AACL,wBAAwB,2BAA2B;AACnD;AACA;AACA,oFAAoF;AACpF;AACA;AACA;AACA;AACA,uBAAuB,kBAAkB;AACzC;AACA,aAAa;AACb;AACA;AACA;AACA,qBAAqB,aAAa;AAClC,SAAS;AACT,KAAK;AACL,sBAAsB,2BAA2B;AACjD;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,oBAAoB;AACpB,SAAS;AACT;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;;AAEA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA,iBAAiB;AACjB;AACA;AACA,aAAa;AACb;AACA;AACA,iBAAiB;AACjB;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;;AAEA,oBAAoB;AACpB,SAAS;AACT;AACA,iBAAiB,kBAAkB;AACnC;AACA,SAAS;AACT;AACA;AACA,mBAAmB,OAAO;AAC1B,mBAAmB,SAAS;AAC5B;AACA;AACA,iBAAiB,kBAAkB;AACnC;AACA,mCAAmC,UAAU;AAC7C;AACA;AACA,aAAa;AACb,mCAAmC,UAAU;AAC7C;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA,KAAK;AACL,CAAC;;AAED;AACA;AACA,WAAW,EAAE;AACb,WAAW,EAAE;AACb,WAAW,EAAE;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,YAAY;AACZ;;;;;;;;;;;;ACnOA,cAAc,kBAAkB;AAChC,cAAc,yBAAyB;;AAEvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,WAAW,MAAM;AACjB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,WAAW,MAAM;AACjB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,WAAW,EAAE;AACb,WAAW,MAAM;AACjB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,WAAW,EAAE;AACb,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,WAAW,MAAM;AACjB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,WAAW,MAAM;AACjB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,WAAW,OAAO;AAClB,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB,WAAW,UAAU;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,gEAAgE,wBAAwB;AACxF;AACA,6BAA6B;AAC7B;AACA,2CAA2C,iCAAiC;AAC5E;AACA;AACA,iDAAiD;AACjD;AACA;AACA;AACA;AACA,yDAAyD,wBAAwB,kBAAkB;AACnG;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,UAAU;AACV;;AAEA;AACA;AACA;AACA;AACA,cAAc;AACd,WAAW,MAAM;AACjB,WAAW,OAAO;AAClB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,aAAa,eAAe;AAC5B;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc;AACd,aAAa;AACb,WAAW,MAAM;AACjB,WAAW,OAAO;AAClB;AACA,IAAI,qBAAqB,EAAE,8BAA8B;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,qCAAqC;AACrC;AACA,KAAK;AACL;AACA;AACA,aAAa,eAAe;AAC5B;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc;AACd,WAAW,MAAM;AACjB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,eAAe;AAC5B;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc;AACd,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc;AACd,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,aAAa;AACb;AACA,sCAAsC,4BAA4B,UAAU;AAC5E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,aAAa,aAAa;AAC1B;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA,WAAW,eAAe;AAC1B,WAAW,SAAS;AACpB;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,aAAa,aAAa;AAC1B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,cAAc;AACd;AACA;AACA;AACA,WAAW,eAAe;AAC1B,WAAW,mBAAmB;AAC9B,WAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qC;AACA,KAAK;AACL;AACA,aAAa,uBAAuB;AACpC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,aAAa,aAAa;AAC1B;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc;AACd,WAAW,SAAS;AACpB,WAAW,YAAY;AACvB,WAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,aAAa,uBAAuB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,WAAW,SAAS;AACpB,WAAW,mBAAmB;AAC9B,WAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,uBAAuB;AACpC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc;AACd,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB,aAAa;AACb;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc;AACd,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc;AACd,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,cAAc;AACd,aAAa,SAAS;AACtB,QAAQ,kCAAkC,MAAM;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;;AAEA;AACA;AACA;AACA,WAAW,SAAS;AACpB;AACA,cAAc;AACd,aAAa,mBAAmB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,eAAe,EAAE;AACjB,eAAe,MAAM;AACrB,eAAe,iBAAiB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA,aAAa,aAAa;AAC1B;AACA;;AAEA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA,+DAA+D;AAC/D;AACA,iBAAiB;AACjB,iBAAiB;AACjB,mBAAmB;AACnB,iBAAiB;AACjB,oBAAoB;AACpB,wBAAwB;AACxB;;AAEA;AACA;AACA;AACA;AACA,cAAc;AACd,iDAAiD,yCAAyC;AAC1F;AACA,0DAA0D,sBAAsB;AAChF;;AAEA;AACA;AACA;AACA;AACA,cAAc;AACd,iDAAiD,yCAAyC;AAC1F;AACA,+DAA+D,2BAA2B;AAC1F;;AAEA;AACA;AACA;AACA,WAAW,SAAS;AACpB;AACA,cAAc;AACd,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB,aAAa;AACb;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,aAAa,aAAa;AAC1B;AACA;AACA;;AAEA;AACA,cAAc;AACd;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;;AAEA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB;AACA,cAAc;AACd,aAAa;AACb,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,aAAa,aAAa;AAC1B;AACA;;AAEA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,mBAAmB;AAC9B,WAAW,SAAS;AACpB;AACA,cAAc;AACd,aAAa;AACb,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,uBAAuB;AACpC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;;AAEA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA,kDAAkD;AAClD;AACA,uDAAuD;AACvD;AACA;AACA,cAAc;AACd,cAAc;AACd,iBAAiB,yBAAyB;AAC1C,eAAe,uBAAuB;AACtC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,aAAa,uBAAuB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,uBAAuB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,uBAAuB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA,aAAa,8BAA8B;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL,kBAAkB,mCAAmC;AACrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL,aAAa,8BAA8B;AAC3C,YAAY,6BAA6B;AACzC,aAAa,8BAA8B;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,uBAAuB,yBAAyB;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,gCAAgC;AACvD;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,uBAAuB,gCAAgC;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AC7pEA;AACA,mCAAmC;;AAEnC;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,WAAW,EAAE;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL,sBAAsB,yBAAyB;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,SAAS;AACpC;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA,iBAAiB;AACjB;AACA;AACA,iBAAiB;AACjB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA,iBAAiB;AACjB;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB,iBAAiB;AACjB;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,OAAO;AAClC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL,sBAAsB,yBAAyB;AAC/C;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,2BAA2B,mBAAmB;AAC9C;AACA;AACA;AACA;AACA;AACA,mCAAmC,mBAAmB;AACtD;AACA;AACA;AACA,gCAAgC;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,+BAA+B,uBAAuB;AACtD;AACA;AACA,KAAK;AACL,+BAA+B,mBAAmB;AAClD;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT,KAAK;AACL,wBAAwB,yBAAyB;AACjD;AACA;AACA,kBAAkB,mBAAmB;AACrC;AACA;AACA,aAAa;AACb,qBAAqB,oCAAoC;AACzD;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,+BAA+B,uBAAuB;AACtD;AACA;AACA;AACA,aAAa;AACb,qBAAqB,wEAAwE;AAC7F;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA,kCAAkC,uBAAuB;AACzD;AACA;AACA;AACA,aAAa;AACb,qBAAqB,wEAAwE;AAC7F;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,wBAAwB,eAAe;AACvC;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,yBAAyB;AAC9C;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,kBAAkB,aAAa;AAC/B;AACA;AACA;AACA,uDAAuD;AACvD;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,aAAa;AACb,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,wCAAwC;AAC7D;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,aAAa;AACb,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,yBAAyB;AAC9C;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,aAAa;AACb,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,yBAAyB;AAC9C;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B,SAAS;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,6CAA6C;AAClE;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,oBAAoB;AACrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,wBAAwB,eAAe;AACvC;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA,mDAAmD;AACnD;AACA;AACA,+BAA+B,YAAY;AAC3C;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT;AACA;AACA,qBAAqB,iBAAiB;AACtC;AACA;AACA,+KAA+K,QAAQ;AACvL,SAAS;AACT;AACA;AACA,yBAAyB;AACzB;AACA;AACA,sKAAsK,QAAQ;AAC9K,YAAY;AACZ;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT;AACA;AACA,yBAAyB;AACzB;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA,aAAa;AACb,qBAAqB,eAAe;AACpC;AACA;AACA,SAAS;AACT,KAAK;AACL,CAAC;;AAED;;AAEA;AACA;AACA;AACA;AACA,mBAAmB,cAAc;AACjC;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,yCAAyC,EAAE;AAC3C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;;AAEA;AACA;AACA;;AAEA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM,aAAa;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,UAAU,aAAa;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,2BAA2B,SAAS;AACpC;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,UAAU,aAAa;;AAEvB;AACA;AACA;;AAEA;;AAEA;AACA,mEAAmE,iBAAiB;AACpF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,aAAa,oCAAoC;AACjD,CAAC;;AAED;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;;AAEA;AACA;AACA,aAAa;AACb;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,aAAa;AACb;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA,kCAAkC,eAAe;AACjD;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA;;AAEA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oCAAoC,gBAAgB;AACpD;AACA;AACA,iBAAiB;AACjB,oCAAoC,gBAAgB;AACpD;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB,oCAAoC,gBAAgB;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA,oDAAoD;;AAEpD;AACA;AACA;AACA,0CAA0C;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL,YAAY,4BAA4B;AACxC,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACr9CA;;AAEA,oFAAoF;AACpF;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,kBAAkB,EAAE;AACxC;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,eAAe,sBAAsB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB,iJ;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;;AAEb,SAAS;AACT;AACA;AACA;AACA;AACA,iBAAiB;AACjB,yBAAyB;AACzB;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;;;;;;;;;;;ACpFA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,yFAAyF;AACzF,sDAAsD;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,WAAW;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,iDAAiD;AACjD,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,6DAA6D;AAC7D,SAAS;AACT,KAAK;AACL;AACA;AACA;;AAEA;;AAEA;AACA,uCAAuC;;AAEvC;AACA,gCAAgC;;AAEhC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL,CAAC,E;;;;;;;;;;;ACrKD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,yBAAyB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,WAAW,YAAY;AACvB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,0BAA0B;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA,mBAAmB,0BAA0B;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB;AACvB,yBAAyB;AACzB;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,SAAS;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,SAAS;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,eAAe,iBAAiB;AAChC;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,mBAAmB,iBAAiB;AACpC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,mBAAmB;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,cAAc;AACrC;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA,eAAe,gBAAgB;AAC/B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,qBAAqB,SAAS;AAC9B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,kBAAkB;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,eAAe,kBAAkB;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,eAAe,cAAc;AAC7B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,eAAe,qBAAqB;AACpC;AACA;;AAEA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,cAAc;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,kBAAkB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,YAAY;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;;AC1oCA;AACA;AACA,WAAW,iBAAiB;AAC5B,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,wBAAwB;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,OAAO;AAC9B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,gCAAgC,oBAAoB;AACpD;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA,SAAS;AACT;AACA,gCAAgC,oBAAoB;AACpD;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,wDAAwD;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV,KAAK;AACL;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,0BAA0B;AAC1B;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B,SAAS;AACT,oBAAoB;AACpB;AACA;AACA,sCAAsC;AACtC;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,uBAAuB;AACvB,uBAAuB;;AAEvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,gCAAgC,qBAAqB;AACrD;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA,gCAAgC,qBAAqB;AACrD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,6BAA6B;AAC7B;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,wBAAwB,oBAAoB;AAC5C;AACA;AACA;AACA,wBAAwB,oBAAoB;AAC5C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,uBAAuB;AACvB,uBAAuB;;AAEvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,4CAA4C,oBAAoB;AAChE;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,4CAA4C,oBAAoB;AAChE;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,6BAA6B;AAC7B;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,oCAAoC,gBAAgB;AACpD;AACA;AACA;AACA,oCAAoC,gBAAgB;AACpD;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,mDAAmD;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,iBAAiB;AAC5B,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;;AC5tBA;;AAEA;;AAEA,2CAA2C;AAC3C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED,uDAAuD,oBAAoB,EAAE;;AAE7E;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACvKA;AAAA;AAAmD;;AAEnD;;AAEA;AACA;;AAEA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,cAAc;AACzB,WAAW,cAAc;AACzB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA,YAAY,KAAK;AACjB;AACA;AACA;AACA;;AAEA,YAAY,KAAK;AACjB;AACA;AACA;;AAEA,YAAY,KAAK;AACjB;AACA;AACA;;AAEA,oCAAoC;AACpC;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,EAAE;AACb,WAAW,EAAE;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,0BAA0B,OAAO;AACjC;AACA;AACA;AACA;AACA;AACA;;;;AAIA,OAAO,yCAAyC,GAAG,kEAAO;AAC1D;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA,WAAW,IAAI;AACf,aAAa;AACb;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;;;AAGtB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;;AAEA;;;;AAIA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA,WAAW,mBAAmB;AAC9B,WAAW,OAAO;AAClB,WAAW,0BAA0B;AACrC;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,kBAAkB;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,SAAS,wCAAwC;AACjD;AACA;AACA;AACA;AACA,+BAA+B;AAC/B;AACA;AACA,iBAAiB;AACjB;AACA,iBAAiB;AACjB;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,+CAA+C;AAC/C;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,uDAAuD;AACvD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,6DAA6D;AAC7D;;AAEA;;AAEA;AACA;AACA,SAAS,OAAO;AAChB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA,qBAAqB;AACrB;AACA;AACA,iBAAiB;AACjB;AACA;AACA,iBAAiB;AACjB;AACA;AACA,mCAAmC;AACnC;AACA;AACA;AACA,qBAAqB;AACrB,iDAAiD;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA,0DAA0D;AAC1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,OAAO;AAC5B;AACA;;AAEA,iBAAiB,kCAAkC;AACnD;AACA,iBAAiB,4BAA4B;AAC7C;AACA,iBAAiB;AACjB,qCAAqC;AACrC;AACA,qBAAqB,uBAAuB;AAC5C;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,qCAAqC;AACrC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA,8C;;;;;;;;;;;ACxfA;AACA;AACA,WAAW,MAAM;AACjB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,iD;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,sBAAsB,2BAA2B;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,mBAAmB,MAAM;AACzB,mBAAmB,OAAO;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,SAAS;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,OAAO;AAClC,+BAA+B,mBAAmB;AAClD;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,+DAA+D,iBAAiB;AAChF;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL,sBAAsB,2BAA2B;AACjD;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT,KAAK;AACL,wBAAwB,2BAA2B;AACnD;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT,0BAA0B,0BAA0B;AACpD;AACA;AACA;AACA;AACA;AACA,kBAAkB,aAAa;AAC/B;AACA,mCAAmC,SAAS;AAC5C;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,uBAAuB;AAC5C;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,+BAA+B,SAAS;AACxC;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,qBAAqB,aAAa;AAClC;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA,CAAC;;AAED;;AAEA;AACA;AACA,aAAa;AACb,WAAW,iBAAiB;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL,YAAY,4BAA4B;AACxC,CAAC;;;;;;;;;;;;AClND;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa;AACb;AACA;AACA,gBAAgB,gCAAgC;AAChD,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB;AACvB;;AAEA;AACA;AACA,eAAe,0BAA0B;AACzC,WAAW,iCAAiC;AAC5C,YAAY,kCAAkC;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,SAAS;AACT,qBAAqB,8BAA8B;AACnD,qBAAqB,8BAA8B;AACnD,cAAc,cAAc;AAC5B,qBAAqB,oBAAoB;AACzC,wBAAwB,uBAAuB;AAC/C,yBAAyB,wBAAwB;AACjD,8BAA8B,6BAA6B;AAC3D,sBAAsB,qCAAqC;AAC3D,oBAAoB,mBAAmB;AACvC,oBAAoB,mBAAmB;AACvC;AACA;AACA;AACA,aAAa;AACb;AACA,SAAS;AACT;AACA;;AAEA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,WAAW,MAAM;AACjB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,mBAAmB,gBAAgB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,0BAA0B,8BAA8B;AACxD,mBAAmB,+BAA+B;AAClD,iBAAiB,8BAA8B;AAC/C,kBAAkB,8BAA8B;AAChD,kBAAkB,+BAA+B;AACjD,sBAAsB,+BAA+B;AACrD,KAAK;AACL;;AAEA;AACA,sBAAsB,+EAA+E;AACrG,mBAAmB,8BAA8B;AACjD,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,mBAAmB,kBAAkB;AACrC;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,uCAAuC;AACvC;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA,0CAA0C;AAC1C;AACA;AACA,UAAU,EAAE;AACZ,mBAAmB,iBAAiB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,iBAAiB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA,kCAAkC,iBAAiB;AACnD;AACA,mCAAmC,iBAAiB;AACpD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,mBAAmB,iBAAiB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,mBAAmB,mBAAmB;AACtC;AACA;;AAEA;AACA,mBAAmB,mBAAmB;AACtC;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,gCAAgC;AAChC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA;AACA;AACA,2BAA2B,gBAAgB;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;;AAEA,kDAAkD,0BAA0B;AAC5E;AACA;AACA;AACA,SAAS;AACT,iBAAiB,aAAa;AAC9B,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,+BAA+B,gBAAgB;AAC/C;AACA,mCAAmC,kBAAkB;AACrD;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,iBAAiB,aAAa;AAC9B;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACnuBA;AACA,YAAY;;AAEZ;AACA,aAAa,0CAAO;AACpB,UAAU,0BAAS;AACnB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,EAAE;AACb;AACA;AACA;AACA;AACA;;AAEA,iBAAiB,0BAA0B;AAC3C;;AAEA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AC5DA;AACA;AACA,WAAW,MAAM;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,iBAAiB;AAC5C;AACA;AACA,SAAS;AACT;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL,CAAC;AACD;;;;;;;;;;;;;ACxDA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,mBAAO,CAAC,kDAAM;AAC7B;;AAEA,iEAAiE;;AAEjE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AC3FA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB;AAClB;AACA;AACA,2BAA2B;AAC3B,kBAAkB;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,gBAAgB;;AAEhB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;;AAEA;;AAEA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEe,sEAAO,EAAC;;;;;;;;;;;;ACzLvB;AACA;;AAEA,kB","file":"skulpt.js","sourcesContent":[" \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = \"./src/main.js\");\n","/* File automatically generated by asdl_js.py. */\r\n\r\n/* Object that holds all nodes */\r\nSk.astnodes = {};\r\n\r\n/* ----- expr_context ----- */\r\n/** @constructor */\r\nSk.astnodes.Load = function Load() {}\r\n/** @constructor */\r\nSk.astnodes.Store = function Store() {}\r\n/** @constructor */\r\nSk.astnodes.Del = function Del() {}\r\n/** @constructor */\r\nSk.astnodes.AugLoad = function AugLoad() {}\r\n/** @constructor */\r\nSk.astnodes.AugStore = function AugStore() {}\r\n/** @constructor */\r\nSk.astnodes.Param = function Param() {}\r\n\r\n/* ----- boolop ----- */\r\n/** @constructor */\r\nSk.astnodes.And = function And() {}\r\n/** @constructor */\r\nSk.astnodes.Or = function Or() {}\r\n\r\n/* ----- operator ----- */\r\n/** @constructor */\r\nSk.astnodes.Add = function Add() {}\r\n/** @constructor */\r\nSk.astnodes.Sub = function Sub() {}\r\n/** @constructor */\r\nSk.astnodes.Mult = function Mult() {}\r\n/** @constructor */\r\nSk.astnodes.MatMult = function MatMult() {}\r\n/** @constructor */\r\nSk.astnodes.Div = function Div() {}\r\n/** @constructor */\r\nSk.astnodes.Mod = function Mod() {}\r\n/** @constructor */\r\nSk.astnodes.Pow = function Pow() {}\r\n/** @constructor */\r\nSk.astnodes.LShift = function LShift() {}\r\n/** @constructor */\r\nSk.astnodes.RShift = function RShift() {}\r\n/** @constructor */\r\nSk.astnodes.BitOr = function BitOr() {}\r\n/** @constructor */\r\nSk.astnodes.BitXor = function BitXor() {}\r\n/** @constructor */\r\nSk.astnodes.BitAnd = function BitAnd() {}\r\n/** @constructor */\r\nSk.astnodes.FloorDiv = function FloorDiv() {}\r\n\r\n/* ----- unaryop ----- */\r\n/** @constructor */\r\nSk.astnodes.Invert = function Invert() {}\r\n/** @constructor */\r\nSk.astnodes.Not = function Not() {}\r\n/** @constructor */\r\nSk.astnodes.UAdd = function UAdd() {}\r\n/** @constructor */\r\nSk.astnodes.USub = function USub() {}\r\n\r\n/* ----- cmpop ----- */\r\n/** @constructor */\r\nSk.astnodes.Eq = function Eq() {}\r\n/** @constructor */\r\nSk.astnodes.NotEq = function NotEq() {}\r\n/** @constructor */\r\nSk.astnodes.Lt = function Lt() {}\r\n/** @constructor */\r\nSk.astnodes.LtE = function LtE() {}\r\n/** @constructor */\r\nSk.astnodes.Gt = function Gt() {}\r\n/** @constructor */\r\nSk.astnodes.GtE = function GtE() {}\r\n/** @constructor */\r\nSk.astnodes.Is = function Is() {}\r\n/** @constructor */\r\nSk.astnodes.IsNot = function IsNot() {}\r\n/** @constructor */\r\nSk.astnodes.In = function In() {}\r\n/** @constructor */\r\nSk.astnodes.NotIn = function NotIn() {}\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n/* ---------------------- */\r\n/* constructors for nodes */\r\n/* ---------------------- */\r\n\r\n\r\n\r\n\r\n\r\n/** @constructor */\r\nSk.astnodes.Module = function Module(/* {asdl_seq *} */ body, /* {string} */\r\n                                          docstring)\r\n{\r\n    this.body = body;\r\n    this.docstring = docstring;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Interactive = function Interactive(/* {asdl_seq *} */ body)\r\n{\r\n    this.body = body;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Expression = function Expression(/* {expr_ty} */ body)\r\n{\r\n    this.body = body;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Suite = function Suite(/* {asdl_seq *} */ body)\r\n{\r\n    this.body = body;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.FunctionDef = function FunctionDef(/* {identifier} */ name, /*\r\n                                                    {arguments__ty} */ args, /*\r\n                                                    {asdl_seq *} */ body, /*\r\n                                                    {asdl_seq *} */\r\n                                                    decorator_list, /*\r\n                                                    {expr_ty} */ returns, /*\r\n                                                    {string} */ docstring, /*\r\n                                                    {int} */ lineno, /* {int}\r\n                                                    */ col_offset, /* {int} */\r\n                                                    end_lineno, /* {int} */\r\n                                                    end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.name = name;\r\n    this.args = args;\r\n    this.body = body;\r\n    this.decorator_list = decorator_list;\r\n    this.returns = returns;\r\n    this.docstring = docstring;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.AsyncFunctionDef = function AsyncFunctionDef(/* {identifier} */\r\n                                                              name, /*\r\n                                                              {arguments__ty}\r\n                                                              */ args, /*\r\n                                                              {asdl_seq *} */\r\n                                                              body, /*\r\n                                                              {asdl_seq *} */\r\n                                                              decorator_list,\r\n                                                              /* {expr_ty} */\r\n                                                              returns, /*\r\n                                                              {string} */\r\n                                                              docstring, /*\r\n                                                              {int} */ lineno,\r\n                                                              /* {int} */\r\n                                                              col_offset, /*\r\n                                                              {int} */\r\n                                                              end_lineno, /*\r\n                                                              {int} */\r\n                                                              end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.name = name;\r\n    this.args = args;\r\n    this.body = body;\r\n    this.decorator_list = decorator_list;\r\n    this.returns = returns;\r\n    this.docstring = docstring;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.ClassDef = function ClassDef(/* {identifier} */ name, /* {asdl_seq\r\n                                              *} */ bases, /* {asdl_seq *} */\r\n                                              keywords, /* {asdl_seq *} */\r\n                                              body, /* {asdl_seq *} */\r\n                                              decorator_list, /* {string} */\r\n                                              docstring, /* {int} */ lineno, /*\r\n                                              {int} */ col_offset, /* {int} */\r\n                                              end_lineno, /* {int} */\r\n                                              end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.name = name;\r\n    this.bases = bases;\r\n    this.keywords = keywords;\r\n    this.body = body;\r\n    this.decorator_list = decorator_list;\r\n    this.docstring = docstring;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Return = function Return(/* {expr_ty} */ value, /* {int} */ lineno,\r\n                                          /* {int} */ col_offset, /* {int} */\r\n                                          end_lineno, /* {int} */\r\n                                          end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.value = value;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Delete = function Delete(/* {asdl_seq *} */ targets, /* {int} */\r\n                                          lineno, /* {int} */ col_offset, /*\r\n                                          {int} */ end_lineno, /* {int} */\r\n                                          end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.targets = targets;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Assign = function Assign(/* {asdl_seq *} */ targets, /* {expr_ty}\r\n                                          */ value, /* {int} */ lineno, /*\r\n                                          {int} */ col_offset, /* {int} */\r\n                                          end_lineno, /* {int} */\r\n                                          end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.targets = targets;\r\n    this.value = value;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.AugAssign = function AugAssign(/* {expr_ty} */ target, /*\r\n                                                {operator_ty} */ op, /*\r\n                                                {expr_ty} */ value, /* {int} */\r\n                                                lineno, /* {int} */ col_offset,\r\n                                                /* {int} */ end_lineno, /*\r\n                                                {int} */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.target = target;\r\n    this.op = op;\r\n    this.value = value;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.AnnAssign = function AnnAssign(/* {expr_ty} */ target, /* {expr_ty}\r\n                                                */ annotation, /* {expr_ty} */\r\n                                                value, /* {int} */ simple, /*\r\n                                                {int} */ lineno, /* {int} */\r\n                                                col_offset, /* {int} */\r\n                                                end_lineno, /* {int} */\r\n                                                end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.target = target;\r\n    this.annotation = annotation;\r\n    this.value = value;\r\n    this.simple = simple;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.For = function For(/* {expr_ty} */ target, /* {expr_ty} */ iter, /*\r\n                                    {asdl_seq *} */ body, /* {asdl_seq *} */\r\n                                    orelse, /* {int} */ lineno, /* {int} */\r\n                                    col_offset, /* {int} */ end_lineno, /*\r\n                                    {int} */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.target = target;\r\n    this.iter = iter;\r\n    this.body = body;\r\n    this.orelse = orelse;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.AsyncFor = function AsyncFor(/* {expr_ty} */ target, /* {expr_ty}\r\n                                              */ iter, /* {asdl_seq *} */ body,\r\n                                              /* {asdl_seq *} */ orelse, /*\r\n                                              {int} */ lineno, /* {int} */\r\n                                              col_offset, /* {int} */\r\n                                              end_lineno, /* {int} */\r\n                                              end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.target = target;\r\n    this.iter = iter;\r\n    this.body = body;\r\n    this.orelse = orelse;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.While = function While(/* {expr_ty} */ test, /* {asdl_seq *} */\r\n                                        body, /* {asdl_seq *} */ orelse, /*\r\n                                        {int} */ lineno, /* {int} */\r\n                                        col_offset, /* {int} */ end_lineno, /*\r\n                                        {int} */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.test = test;\r\n    this.body = body;\r\n    this.orelse = orelse;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.If = function If(/* {expr_ty} */ test, /* {asdl_seq *} */ body, /*\r\n                                  {asdl_seq *} */ orelse, /* {int} */ lineno,\r\n                                  /* {int} */ col_offset, /* {int} */\r\n                                  end_lineno, /* {int} */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.test = test;\r\n    this.body = body;\r\n    this.orelse = orelse;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.With = function With(/* {asdl_seq *} */ items, /* {asdl_seq *} */\r\n                                      body, /* {int} */ lineno, /* {int} */\r\n                                      col_offset, /* {int} */ end_lineno, /*\r\n                                      {int} */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.items = items;\r\n    this.body = body;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.AsyncWith = function AsyncWith(/* {asdl_seq *} */ items, /*\r\n                                                {asdl_seq *} */ body, /* {int}\r\n                                                */ lineno, /* {int} */\r\n                                                col_offset, /* {int} */\r\n                                                end_lineno, /* {int} */\r\n                                                end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.items = items;\r\n    this.body = body;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Raise = function Raise(/* {expr_ty} */ exc, /* {expr_ty} */ cause,\r\n                                        /* {expr_ty} */ inst, /* {expr_ty} */\r\n                                        tback, /* {int} */ lineno, /* {int} */\r\n                                        col_offset, /* {int} */ end_lineno, /*\r\n                                        {int} */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.exc = exc;\r\n    this.cause = cause;\r\n    this.inst = inst;\r\n    this.tback = tback;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Try = function Try(/* {asdl_seq *} */ body, /* {asdl_seq *} */\r\n                                    handlers, /* {asdl_seq *} */ orelse, /*\r\n                                    {asdl_seq *} */ finalbody, /* {int} */\r\n                                    lineno, /* {int} */ col_offset, /* {int} */\r\n                                    end_lineno, /* {int} */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.body = body;\r\n    this.handlers = handlers;\r\n    this.orelse = orelse;\r\n    this.finalbody = finalbody;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Assert = function Assert(/* {expr_ty} */ test, /* {expr_ty} */ msg,\r\n                                          /* {int} */ lineno, /* {int} */\r\n                                          col_offset, /* {int} */ end_lineno,\r\n                                          /* {int} */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.test = test;\r\n    this.msg = msg;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Import = function Import(/* {asdl_seq *} */ names, /* {int} */\r\n                                          lineno, /* {int} */ col_offset, /*\r\n                                          {int} */ end_lineno, /* {int} */\r\n                                          end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.names = names;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.ImportFrom = function ImportFrom(/* {identifier} */ module, /*\r\n                                                  {asdl_seq *} */ names, /*\r\n                                                  {int} */ level, /* {int} */\r\n                                                  lineno, /* {int} */\r\n                                                  col_offset, /* {int} */\r\n                                                  end_lineno, /* {int} */\r\n                                                  end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.module = module;\r\n    this.names = names;\r\n    this.level = level;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Global = function Global(/* {asdl_seq *} */ names, /* {int} */\r\n                                          lineno, /* {int} */ col_offset, /*\r\n                                          {int} */ end_lineno, /* {int} */\r\n                                          end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.names = names;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Nonlocal = function Nonlocal(/* {asdl_seq *} */ names, /* {int} */\r\n                                              lineno, /* {int} */ col_offset,\r\n                                              /* {int} */ end_lineno, /* {int}\r\n                                              */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.names = names;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Expr = function Expr(/* {expr_ty} */ value, /* {int} */ lineno, /*\r\n                                      {int} */ col_offset, /* {int} */\r\n                                      end_lineno, /* {int} */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.value = value;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Pass = function Pass(/* {int} */ lineno, /* {int} */ col_offset, /*\r\n                                      {int} */ end_lineno, /* {int} */\r\n                                      end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Break = function Break(/* {int} */ lineno, /* {int} */ col_offset,\r\n                                        /* {int} */ end_lineno, /* {int} */\r\n                                        end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Continue = function Continue(/* {int} */ lineno, /* {int} */\r\n                                              col_offset, /* {int} */\r\n                                              end_lineno, /* {int} */\r\n                                              end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Print = function Print(/* {expr_ty} */ dest, /* {asdl_seq *} */\r\n                                        values, /* {int} */ nl, /* {int} */\r\n                                        lineno, /* {int} */ col_offset, /*\r\n                                        {int} */ end_lineno, /* {int} */\r\n                                        end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.dest = dest;\r\n    this.values = values;\r\n    this.nl = nl;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Debugger = function Debugger(/* {int} */ lineno, /* {int} */\r\n                                              col_offset, /* {int} */\r\n                                              end_lineno, /* {int} */\r\n                                              end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.BoolOp = function BoolOp(/* {boolop_ty} */ op, /* {asdl_seq *} */\r\n                                          values, /* {int} */ lineno, /* {int}\r\n                                          */ col_offset, /* {int} */\r\n                                          end_lineno, /* {int} */\r\n                                          end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.op = op;\r\n    this.values = values;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.BinOp = function BinOp(/* {expr_ty} */ left, /* {operator_ty} */\r\n                                        op, /* {expr_ty} */ right, /* {int} */\r\n                                        lineno, /* {int} */ col_offset, /*\r\n                                        {int} */ end_lineno, /* {int} */\r\n                                        end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.left = left;\r\n    this.op = op;\r\n    this.right = right;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.UnaryOp = function UnaryOp(/* {unaryop_ty} */ op, /* {expr_ty} */\r\n                                            operand, /* {int} */ lineno, /*\r\n                                            {int} */ col_offset, /* {int} */\r\n                                            end_lineno, /* {int} */\r\n                                            end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.op = op;\r\n    this.operand = operand;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Lambda = function Lambda(/* {arguments__ty} */ args, /* {expr_ty}\r\n                                          */ body, /* {int} */ lineno, /* {int}\r\n                                          */ col_offset, /* {int} */\r\n                                          end_lineno, /* {int} */\r\n                                          end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.args = args;\r\n    this.body = body;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.IfExp = function IfExp(/* {expr_ty} */ test, /* {expr_ty} */ body,\r\n                                        /* {expr_ty} */ orelse, /* {int} */\r\n                                        lineno, /* {int} */ col_offset, /*\r\n                                        {int} */ end_lineno, /* {int} */\r\n                                        end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.test = test;\r\n    this.body = body;\r\n    this.orelse = orelse;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Dict = function Dict(/* {asdl_seq *} */ keys, /* {asdl_seq *} */\r\n                                      values, /* {int} */ lineno, /* {int} */\r\n                                      col_offset, /* {int} */ end_lineno, /*\r\n                                      {int} */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.keys = keys;\r\n    this.values = values;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Set = function Set(/* {asdl_seq *} */ elts, /* {int} */ lineno, /*\r\n                                    {int} */ col_offset, /* {int} */\r\n                                    end_lineno, /* {int} */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.elts = elts;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.ListComp = function ListComp(/* {expr_ty} */ elt, /* {asdl_seq *}\r\n                                              */ generators, /* {int} */\r\n                                              lineno, /* {int} */ col_offset,\r\n                                              /* {int} */ end_lineno, /* {int}\r\n                                              */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.elt = elt;\r\n    this.generators = generators;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.SetComp = function SetComp(/* {expr_ty} */ elt, /* {asdl_seq *} */\r\n                                            generators, /* {int} */ lineno, /*\r\n                                            {int} */ col_offset, /* {int} */\r\n                                            end_lineno, /* {int} */\r\n                                            end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.elt = elt;\r\n    this.generators = generators;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.DictComp = function DictComp(/* {expr_ty} */ key, /* {expr_ty} */\r\n                                              value, /* {asdl_seq *} */\r\n                                              generators, /* {int} */ lineno,\r\n                                              /* {int} */ col_offset, /* {int}\r\n                                              */ end_lineno, /* {int} */\r\n                                              end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.key = key;\r\n    this.value = value;\r\n    this.generators = generators;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.GeneratorExp = function GeneratorExp(/* {expr_ty} */ elt, /*\r\n                                                      {asdl_seq *} */\r\n                                                      generators, /* {int} */\r\n                                                      lineno, /* {int} */\r\n                                                      col_offset, /* {int} */\r\n                                                      end_lineno, /* {int} */\r\n                                                      end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.elt = elt;\r\n    this.generators = generators;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Await = function Await(/* {expr_ty} */ value, /* {int} */ lineno,\r\n                                        /* {int} */ col_offset, /* {int} */\r\n                                        end_lineno, /* {int} */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.value = value;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Yield = function Yield(/* {expr_ty} */ value, /* {int} */ lineno,\r\n                                        /* {int} */ col_offset, /* {int} */\r\n                                        end_lineno, /* {int} */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.value = value;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.YieldFrom = function YieldFrom(/* {expr_ty} */ value, /* {int} */\r\n                                                lineno, /* {int} */ col_offset,\r\n                                                /* {int} */ end_lineno, /*\r\n                                                {int} */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.value = value;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Compare = function Compare(/* {expr_ty} */ left, /* {asdl_int_seq\r\n                                            *} */ ops, /* {asdl_seq *} */\r\n                                            comparators, /* {int} */ lineno, /*\r\n                                            {int} */ col_offset, /* {int} */\r\n                                            end_lineno, /* {int} */\r\n                                            end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.left = left;\r\n    this.ops = ops;\r\n    this.comparators = comparators;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Call = function Call(/* {expr_ty} */ func, /* {asdl_seq *} */ args,\r\n                                      /* {asdl_seq *} */ keywords, /* {int} */\r\n                                      lineno, /* {int} */ col_offset, /* {int}\r\n                                      */ end_lineno, /* {int} */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.func = func;\r\n    this.args = args;\r\n    this.keywords = keywords;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Num = function Num(/* {object} */ n, /* {int} */ lineno, /* {int}\r\n                                    */ col_offset, /* {int} */ end_lineno, /*\r\n                                    {int} */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.n = n;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Str = function Str(/* {string} */ s, /* {int} */ lineno, /* {int}\r\n                                    */ col_offset, /* {int} */ end_lineno, /*\r\n                                    {int} */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.s = s;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.FormattedValue = function FormattedValue(/* {expr_ty} */ value, /*\r\n                                                          {int} */ conversion,\r\n                                                          /* {expr_ty} */\r\n                                                          format_spec, /* {int}\r\n                                                          */ lineno, /* {int}\r\n                                                          */ col_offset, /*\r\n                                                          {int} */ end_lineno,\r\n                                                          /* {int} */\r\n                                                          end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.value = value;\r\n    this.conversion = conversion;\r\n    this.format_spec = format_spec;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.JoinedStr = function JoinedStr(/* {asdl_seq *} */ values, /* {int}\r\n                                                */ lineno, /* {int} */\r\n                                                col_offset, /* {int} */\r\n                                                end_lineno, /* {int} */\r\n                                                end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.values = values;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Bytes = function Bytes(/* {bytes} */ s, /* {int} */ lineno, /*\r\n                                        {int} */ col_offset, /* {int} */\r\n                                        end_lineno, /* {int} */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.s = s;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.NameConstant = function NameConstant(/* {singleton} */ value, /*\r\n                                                      {int} */ lineno, /* {int}\r\n                                                      */ col_offset, /* {int}\r\n                                                      */ end_lineno, /* {int}\r\n                                                      */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.value = value;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Ellipsis = function Ellipsis(/* {int} */ lineno, /* {int} */\r\n                                              col_offset, /* {int} */\r\n                                              end_lineno, /* {int} */\r\n                                              end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Constant = function Constant(/* {constant} */ value, /* {int} */\r\n                                              lineno, /* {int} */ col_offset,\r\n                                              /* {int} */ end_lineno, /* {int}\r\n                                              */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.value = value;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Attribute = function Attribute(/* {expr_ty} */ value, /*\r\n                                                {identifier} */ attr, /*\r\n                                                {expr_context_ty} */ ctx, /*\r\n                                                {int} */ lineno, /* {int} */\r\n                                                col_offset, /* {int} */\r\n                                                end_lineno, /* {int} */\r\n                                                end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.value = value;\r\n    this.attr = attr;\r\n    this.ctx = ctx;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Subscript = function Subscript(/* {expr_ty} */ value, /* {slice_ty}\r\n                                                */ slice, /* {expr_context_ty}\r\n                                                */ ctx, /* {int} */ lineno, /*\r\n                                                {int} */ col_offset, /* {int}\r\n                                                */ end_lineno, /* {int} */\r\n                                                end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.value = value;\r\n    this.slice = slice;\r\n    this.ctx = ctx;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Starred = function Starred(/* {expr_ty} */ value, /*\r\n                                            {expr_context_ty} */ ctx, /* {int}\r\n                                            */ lineno, /* {int} */ col_offset,\r\n                                            /* {int} */ end_lineno, /* {int} */\r\n                                            end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.value = value;\r\n    this.ctx = ctx;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Name = function Name(/* {identifier} */ id, /* {expr_context_ty} */\r\n                                      ctx, /* {int} */ lineno, /* {int} */\r\n                                      col_offset, /* {int} */ end_lineno, /*\r\n                                      {int} */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.id = id;\r\n    this.ctx = ctx;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.List = function List(/* {asdl_seq *} */ elts, /* {expr_context_ty}\r\n                                      */ ctx, /* {int} */ lineno, /* {int} */\r\n                                      col_offset, /* {int} */ end_lineno, /*\r\n                                      {int} */ end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.elts = elts;\r\n    this.ctx = ctx;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Tuple = function Tuple(/* {asdl_seq *} */ elts, /*\r\n                                        {expr_context_ty} */ ctx, /* {int} */\r\n                                        lineno, /* {int} */ col_offset, /*\r\n                                        {int} */ end_lineno, /* {int} */\r\n                                        end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.elts = elts;\r\n    this.ctx = ctx;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Slice = function Slice(/* {expr_ty} */ lower, /* {expr_ty} */\r\n                                        upper, /* {expr_ty} */ step)\r\n{\r\n    this.lower = lower;\r\n    this.upper = upper;\r\n    this.step = step;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.ExtSlice = function ExtSlice(/* {asdl_seq *} */ dims)\r\n{\r\n    this.dims = dims;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.Index = function Index(/* {expr_ty} */ value)\r\n{\r\n    this.value = value;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.comprehension = function comprehension(/* {expr_ty} */ target, /*\r\n                                                        {expr_ty} */ iter, /*\r\n                                                        {asdl_seq *} */ ifs, /*\r\n                                                        {int} */ is_async)\r\n{\r\n    this.target = target;\r\n    this.iter = iter;\r\n    this.ifs = ifs;\r\n    this.is_async = is_async;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.ExceptHandler = function ExceptHandler(/* {expr_ty} */ type, /*\r\n                                                        {identifier} */ name,\r\n                                                        /* {asdl_seq *} */\r\n                                                        body, /* {int} */\r\n                                                        lineno, /* {int} */\r\n                                                        col_offset, /* {int} */\r\n                                                        end_lineno, /* {int} */\r\n                                                        end_col_offset)\r\n{\r\n    Sk.asserts.assert(lineno !== null && lineno !== undefined);\r\n    Sk.asserts.assert(col_offset !== null && col_offset !== undefined);\r\n    Sk.asserts.assert(end_lineno !== null && end_lineno !== undefined);\r\n    Sk.asserts.assert(end_col_offset !== null && end_col_offset !== undefined);\r\n    this.type = type;\r\n    this.name = name;\r\n    this.body = body;\r\n    this.lineno = lineno;\r\n    this.col_offset = col_offset;\r\n    this.end_lineno = end_lineno;\r\n    this.end_col_offset = end_col_offset;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.arguments_ = function arguments_(/* {asdl_seq *} */ args, /*\r\n                                                  {arg_ty} */ vararg, /*\r\n                                                  {asdl_seq *} */ kwonlyargs,\r\n                                                  /* {asdl_seq *} */\r\n                                                  kw_defaults, /* {arg_ty} */\r\n                                                  kwarg, /* {asdl_seq *} */\r\n                                                  defaults)\r\n{\r\n    this.args = args;\r\n    this.vararg = vararg;\r\n    this.kwonlyargs = kwonlyargs;\r\n    this.kw_defaults = kw_defaults;\r\n    this.kwarg = kwarg;\r\n    this.defaults = defaults;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.arg = function arg(/* {identifier} */ arg, /* {expr_ty} */\r\n                                    annotation)\r\n{\r\n    this.arg = arg;\r\n    this.annotation = annotation;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.keyword = function keyword(/* {identifier} */ arg, /* {expr_ty} */\r\n                                            value)\r\n{\r\n    this.arg = arg;\r\n    this.value = value;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.alias = function alias(/* {identifier} */ name, /* {identifier} */\r\n                                        asname)\r\n{\r\n    this.name = name;\r\n    this.asname = asname;\r\n    return this;\r\n}\r\n\r\n/** @constructor */\r\nSk.astnodes.withitem = function withitem(/* {expr_ty} */ context_expr, /*\r\n                                              {expr_ty} */ optional_vars)\r\n{\r\n    this.context_expr = context_expr;\r\n    this.optional_vars = optional_vars;\r\n    return this;\r\n}\r\n\r\n\r\nSk.astnodes.Module.prototype._astname = \"Module\";\r\nSk.astnodes.Module.prototype._fields = [\r\n    \"body\", function(n) { return n.body; },\r\n    \"docstring\", function(n) { return n.docstring; }\r\n];\r\nSk.astnodes.Interactive.prototype._astname = \"Interactive\";\r\nSk.astnodes.Interactive.prototype._fields = [\r\n    \"body\", function(n) { return n.body; }\r\n];\r\nSk.astnodes.Expression.prototype._astname = \"Expression\";\r\nSk.astnodes.Expression.prototype._fields = [\r\n    \"body\", function(n) { return n.body; }\r\n];\r\nSk.astnodes.Suite.prototype._astname = \"Suite\";\r\nSk.astnodes.Suite.prototype._fields = [\r\n    \"body\", function(n) { return n.body; }\r\n];\r\nSk.astnodes.FunctionDef.prototype._astname = \"FunctionDef\";\r\nSk.astnodes.FunctionDef.prototype._fields = [\r\n    \"name\", function(n) { return n.name; },\r\n    \"args\", function(n) { return n.args; },\r\n    \"body\", function(n) { return n.body; },\r\n    \"decorator_list\", function(n) { return n.decorator_list; },\r\n    \"returns\", function(n) { return n.returns; },\r\n    \"docstring\", function(n) { return n.docstring; }\r\n];\r\nSk.astnodes.AsyncFunctionDef.prototype._astname = \"AsyncFunctionDef\";\r\nSk.astnodes.AsyncFunctionDef.prototype._fields = [\r\n    \"name\", function(n) { return n.name; },\r\n    \"args\", function(n) { return n.args; },\r\n    \"body\", function(n) { return n.body; },\r\n    \"decorator_list\", function(n) { return n.decorator_list; },\r\n    \"returns\", function(n) { return n.returns; },\r\n    \"docstring\", function(n) { return n.docstring; }\r\n];\r\nSk.astnodes.ClassDef.prototype._astname = \"ClassDef\";\r\nSk.astnodes.ClassDef.prototype._fields = [\r\n    \"name\", function(n) { return n.name; },\r\n    \"bases\", function(n) { return n.bases; },\r\n    \"keywords\", function(n) { return n.keywords; },\r\n    \"body\", function(n) { return n.body; },\r\n    \"decorator_list\", function(n) { return n.decorator_list; },\r\n    \"docstring\", function(n) { return n.docstring; }\r\n];\r\nSk.astnodes.Return.prototype._astname = \"Return\";\r\nSk.astnodes.Return.prototype._fields = [\r\n    \"value\", function(n) { return n.value; }\r\n];\r\nSk.astnodes.Delete.prototype._astname = \"Delete\";\r\nSk.astnodes.Delete.prototype._fields = [\r\n    \"targets\", function(n) { return n.targets; }\r\n];\r\nSk.astnodes.Assign.prototype._astname = \"Assign\";\r\nSk.astnodes.Assign.prototype._fields = [\r\n    \"targets\", function(n) { return n.targets; },\r\n    \"value\", function(n) { return n.value; }\r\n];\r\nSk.astnodes.AugAssign.prototype._astname = \"AugAssign\";\r\nSk.astnodes.AugAssign.prototype._fields = [\r\n    \"target\", function(n) { return n.target; },\r\n    \"op\", function(n) { return n.op; },\r\n    \"value\", function(n) { return n.value; }\r\n];\r\nSk.astnodes.AnnAssign.prototype._astname = \"AnnAssign\";\r\nSk.astnodes.AnnAssign.prototype._fields = [\r\n    \"target\", function(n) { return n.target; },\r\n    \"annotation\", function(n) { return n.annotation; },\r\n    \"value\", function(n) { return n.value; },\r\n    \"simple\", function(n) { return n.simple; }\r\n];\r\nSk.astnodes.For.prototype._astname = \"For\";\r\nSk.astnodes.For.prototype._fields = [\r\n    \"target\", function(n) { return n.target; },\r\n    \"iter\", function(n) { return n.iter; },\r\n    \"body\", function(n) { return n.body; },\r\n    \"orelse\", function(n) { return n.orelse; }\r\n];\r\nSk.astnodes.AsyncFor.prototype._astname = \"AsyncFor\";\r\nSk.astnodes.AsyncFor.prototype._fields = [\r\n    \"target\", function(n) { return n.target; },\r\n    \"iter\", function(n) { return n.iter; },\r\n    \"body\", function(n) { return n.body; },\r\n    \"orelse\", function(n) { return n.orelse; }\r\n];\r\nSk.astnodes.While.prototype._astname = \"While\";\r\nSk.astnodes.While.prototype._fields = [\r\n    \"test\", function(n) { return n.test; },\r\n    \"body\", function(n) { return n.body; },\r\n    \"orelse\", function(n) { return n.orelse; }\r\n];\r\nSk.astnodes.If.prototype._astname = \"If\";\r\nSk.astnodes.If.prototype._fields = [\r\n    \"test\", function(n) { return n.test; },\r\n    \"body\", function(n) { return n.body; },\r\n    \"orelse\", function(n) { return n.orelse; }\r\n];\r\nSk.astnodes.With.prototype._astname = \"With\";\r\nSk.astnodes.With.prototype._fields = [\r\n    \"items\", function(n) { return n.items; },\r\n    \"body\", function(n) { return n.body; }\r\n];\r\nSk.astnodes.AsyncWith.prototype._astname = \"AsyncWith\";\r\nSk.astnodes.AsyncWith.prototype._fields = [\r\n    \"items\", function(n) { return n.items; },\r\n    \"body\", function(n) { return n.body; }\r\n];\r\nSk.astnodes.Raise.prototype._astname = \"Raise\";\r\nSk.astnodes.Raise.prototype._fields = [\r\n    \"exc\", function(n) { return n.exc; },\r\n    \"cause\", function(n) { return n.cause; },\r\n    \"inst\", function(n) { return n.inst; },\r\n    \"tback\", function(n) { return n.tback; }\r\n];\r\nSk.astnodes.Try.prototype._astname = \"Try\";\r\nSk.astnodes.Try.prototype._fields = [\r\n    \"body\", function(n) { return n.body; },\r\n    \"handlers\", function(n) { return n.handlers; },\r\n    \"orelse\", function(n) { return n.orelse; },\r\n    \"finalbody\", function(n) { return n.finalbody; }\r\n];\r\nSk.astnodes.Assert.prototype._astname = \"Assert\";\r\nSk.astnodes.Assert.prototype._fields = [\r\n    \"test\", function(n) { return n.test; },\r\n    \"msg\", function(n) { return n.msg; }\r\n];\r\nSk.astnodes.Import.prototype._astname = \"Import\";\r\nSk.astnodes.Import.prototype._fields = [\r\n    \"names\", function(n) { return n.names; }\r\n];\r\nSk.astnodes.ImportFrom.prototype._astname = \"ImportFrom\";\r\nSk.astnodes.ImportFrom.prototype._fields = [\r\n    \"module\", function(n) { return n.module; },\r\n    \"names\", function(n) { return n.names; },\r\n    \"level\", function(n) { return n.level; }\r\n];\r\nSk.astnodes.Global.prototype._astname = \"Global\";\r\nSk.astnodes.Global.prototype._fields = [\r\n    \"names\", function(n) { return n.names; }\r\n];\r\nSk.astnodes.Nonlocal.prototype._astname = \"Nonlocal\";\r\nSk.astnodes.Nonlocal.prototype._fields = [\r\n    \"names\", function(n) { return n.names; }\r\n];\r\nSk.astnodes.Expr.prototype._astname = \"Expr\";\r\nSk.astnodes.Expr.prototype._fields = [\r\n    \"value\", function(n) { return n.value; }\r\n];\r\nSk.astnodes.Pass.prototype._astname = \"Pass\";\r\nSk.astnodes.Pass.prototype._fields = [\r\n];\r\nSk.astnodes.Break.prototype._astname = \"Break\";\r\nSk.astnodes.Break.prototype._fields = [\r\n];\r\nSk.astnodes.Continue.prototype._astname = \"Continue\";\r\nSk.astnodes.Continue.prototype._fields = [\r\n];\r\nSk.astnodes.Print.prototype._astname = \"Print\";\r\nSk.astnodes.Print.prototype._fields = [\r\n    \"dest\", function(n) { return n.dest; },\r\n    \"values\", function(n) { return n.values; },\r\n    \"nl\", function(n) { return n.nl; }\r\n];\r\nSk.astnodes.Debugger.prototype._astname = \"Debugger\";\r\nSk.astnodes.Debugger.prototype._fields = [\r\n];\r\nSk.astnodes.BoolOp.prototype._astname = \"BoolOp\";\r\nSk.astnodes.BoolOp.prototype._fields = [\r\n    \"op\", function(n) { return n.op; },\r\n    \"values\", function(n) { return n.values; }\r\n];\r\nSk.astnodes.BinOp.prototype._astname = \"BinOp\";\r\nSk.astnodes.BinOp.prototype._fields = [\r\n    \"left\", function(n) { return n.left; },\r\n    \"op\", function(n) { return n.op; },\r\n    \"right\", function(n) { return n.right; }\r\n];\r\nSk.astnodes.UnaryOp.prototype._astname = \"UnaryOp\";\r\nSk.astnodes.UnaryOp.prototype._fields = [\r\n    \"op\", function(n) { return n.op; },\r\n    \"operand\", function(n) { return n.operand; }\r\n];\r\nSk.astnodes.Lambda.prototype._astname = \"Lambda\";\r\nSk.astnodes.Lambda.prototype._fields = [\r\n    \"args\", function(n) { return n.args; },\r\n    \"body\", function(n) { return n.body; }\r\n];\r\nSk.astnodes.IfExp.prototype._astname = \"IfExp\";\r\nSk.astnodes.IfExp.prototype._fields = [\r\n    \"test\", function(n) { return n.test; },\r\n    \"body\", function(n) { return n.body; },\r\n    \"orelse\", function(n) { return n.orelse; }\r\n];\r\nSk.astnodes.Dict.prototype._astname = \"Dict\";\r\nSk.astnodes.Dict.prototype._fields = [\r\n    \"keys\", function(n) { return n.keys; },\r\n    \"values\", function(n) { return n.values; }\r\n];\r\nSk.astnodes.Set.prototype._astname = \"Set\";\r\nSk.astnodes.Set.prototype._fields = [\r\n    \"elts\", function(n) { return n.elts; }\r\n];\r\nSk.astnodes.ListComp.prototype._astname = \"ListComp\";\r\nSk.astnodes.ListComp.prototype._fields = [\r\n    \"elt\", function(n) { return n.elt; },\r\n    \"generators\", function(n) { return n.generators; }\r\n];\r\nSk.astnodes.SetComp.prototype._astname = \"SetComp\";\r\nSk.astnodes.SetComp.prototype._fields = [\r\n    \"elt\", function(n) { return n.elt; },\r\n    \"generators\", function(n) { return n.generators; }\r\n];\r\nSk.astnodes.DictComp.prototype._astname = \"DictComp\";\r\nSk.astnodes.DictComp.prototype._fields = [\r\n    \"key\", function(n) { return n.key; },\r\n    \"value\", function(n) { return n.value; },\r\n    \"generators\", function(n) { return n.generators; }\r\n];\r\nSk.astnodes.GeneratorExp.prototype._astname = \"GeneratorExp\";\r\nSk.astnodes.GeneratorExp.prototype._fields = [\r\n    \"elt\", function(n) { return n.elt; },\r\n    \"generators\", function(n) { return n.generators; }\r\n];\r\nSk.astnodes.Await.prototype._astname = \"Await\";\r\nSk.astnodes.Await.prototype._fields = [\r\n    \"value\", function(n) { return n.value; }\r\n];\r\nSk.astnodes.Yield.prototype._astname = \"Yield\";\r\nSk.astnodes.Yield.prototype._fields = [\r\n    \"value\", function(n) { return n.value; }\r\n];\r\nSk.astnodes.YieldFrom.prototype._astname = \"YieldFrom\";\r\nSk.astnodes.YieldFrom.prototype._fields = [\r\n    \"value\", function(n) { return n.value; }\r\n];\r\nSk.astnodes.Compare.prototype._astname = \"Compare\";\r\nSk.astnodes.Compare.prototype._fields = [\r\n    \"left\", function(n) { return n.left; },\r\n    \"ops\", function(n) { return n.ops; },\r\n    \"comparators\", function(n) { return n.comparators; }\r\n];\r\nSk.astnodes.Call.prototype._astname = \"Call\";\r\nSk.astnodes.Call.prototype._fields = [\r\n    \"func\", function(n) { return n.func; },\r\n    \"args\", function(n) { return n.args; },\r\n    \"keywords\", function(n) { return n.keywords; }\r\n];\r\nSk.astnodes.Num.prototype._astname = \"Num\";\r\nSk.astnodes.Num.prototype._fields = [\r\n    \"n\", function(n) { return n.n; }\r\n];\r\nSk.astnodes.Str.prototype._astname = \"Str\";\r\nSk.astnodes.Str.prototype._fields = [\r\n    \"s\", function(n) { return n.s; }\r\n];\r\nSk.astnodes.FormattedValue.prototype._astname = \"FormattedValue\";\r\nSk.astnodes.FormattedValue.prototype._fields = [\r\n    \"value\", function(n) { return n.value; },\r\n    \"conversion\", function(n) { return n.conversion; },\r\n    \"format_spec\", function(n) { return n.format_spec; }\r\n];\r\nSk.astnodes.JoinedStr.prototype._astname = \"JoinedStr\";\r\nSk.astnodes.JoinedStr.prototype._fields = [\r\n    \"values\", function(n) { return n.values; }\r\n];\r\nSk.astnodes.Bytes.prototype._astname = \"Bytes\";\r\nSk.astnodes.Bytes.prototype._fields = [\r\n    \"s\", function(n) { return n.s; }\r\n];\r\nSk.astnodes.NameConstant.prototype._astname = \"NameConstant\";\r\nSk.astnodes.NameConstant.prototype._fields = [\r\n    \"value\", function(n) { return n.value; }\r\n];\r\nSk.astnodes.Ellipsis.prototype._astname = \"Ellipsis\";\r\nSk.astnodes.Ellipsis.prototype._fields = [\r\n];\r\nSk.astnodes.Constant.prototype._astname = \"Constant\";\r\nSk.astnodes.Constant.prototype._fields = [\r\n    \"value\", function(n) { return n.value; }\r\n];\r\nSk.astnodes.Attribute.prototype._astname = \"Attribute\";\r\nSk.astnodes.Attribute.prototype._fields = [\r\n    \"value\", function(n) { return n.value; },\r\n    \"attr\", function(n) { return n.attr; },\r\n    \"ctx\", function(n) { return n.ctx; }\r\n];\r\nSk.astnodes.Subscript.prototype._astname = \"Subscript\";\r\nSk.astnodes.Subscript.prototype._fields = [\r\n    \"value\", function(n) { return n.value; },\r\n    \"slice\", function(n) { return n.slice; },\r\n    \"ctx\", function(n) { return n.ctx; }\r\n];\r\nSk.astnodes.Starred.prototype._astname = \"Starred\";\r\nSk.astnodes.Starred.prototype._fields = [\r\n    \"value\", function(n) { return n.value; },\r\n    \"ctx\", function(n) { return n.ctx; }\r\n];\r\nSk.astnodes.Name.prototype._astname = \"Name\";\r\nSk.astnodes.Name.prototype._fields = [\r\n    \"id\", function(n) { return n.id; },\r\n    \"ctx\", function(n) { return n.ctx; }\r\n];\r\nSk.astnodes.List.prototype._astname = \"List\";\r\nSk.astnodes.List.prototype._fields = [\r\n    \"elts\", function(n) { return n.elts; },\r\n    \"ctx\", function(n) { return n.ctx; }\r\n];\r\nSk.astnodes.Tuple.prototype._astname = \"Tuple\";\r\nSk.astnodes.Tuple.prototype._fields = [\r\n    \"elts\", function(n) { return n.elts; },\r\n    \"ctx\", function(n) { return n.ctx; }\r\n];\r\nSk.astnodes.Load.prototype._astname = \"Load\";\r\nSk.astnodes.Load.prototype._isenum = true;\r\nSk.astnodes.Store.prototype._astname = \"Store\";\r\nSk.astnodes.Store.prototype._isenum = true;\r\nSk.astnodes.Del.prototype._astname = \"Del\";\r\nSk.astnodes.Del.prototype._isenum = true;\r\nSk.astnodes.AugLoad.prototype._astname = \"AugLoad\";\r\nSk.astnodes.AugLoad.prototype._isenum = true;\r\nSk.astnodes.AugStore.prototype._astname = \"AugStore\";\r\nSk.astnodes.AugStore.prototype._isenum = true;\r\nSk.astnodes.Param.prototype._astname = \"Param\";\r\nSk.astnodes.Param.prototype._isenum = true;\r\nSk.astnodes.Slice.prototype._astname = \"Slice\";\r\nSk.astnodes.Slice.prototype._fields = [\r\n    \"lower\", function(n) { return n.lower; },\r\n    \"upper\", function(n) { return n.upper; },\r\n    \"step\", function(n) { return n.step; }\r\n];\r\nSk.astnodes.ExtSlice.prototype._astname = \"ExtSlice\";\r\nSk.astnodes.ExtSlice.prototype._fields = [\r\n    \"dims\", function(n) { return n.dims; }\r\n];\r\nSk.astnodes.Index.prototype._astname = \"Index\";\r\nSk.astnodes.Index.prototype._fields = [\r\n    \"value\", function(n) { return n.value; }\r\n];\r\nSk.astnodes.And.prototype._astname = \"And\";\r\nSk.astnodes.And.prototype._isenum = true;\r\nSk.astnodes.Or.prototype._astname = \"Or\";\r\nSk.astnodes.Or.prototype._isenum = true;\r\nSk.astnodes.Add.prototype._astname = \"Add\";\r\nSk.astnodes.Add.prototype._isenum = true;\r\nSk.astnodes.Sub.prototype._astname = \"Sub\";\r\nSk.astnodes.Sub.prototype._isenum = true;\r\nSk.astnodes.Mult.prototype._astname = \"Mult\";\r\nSk.astnodes.Mult.prototype._isenum = true;\r\nSk.astnodes.MatMult.prototype._astname = \"MatMult\";\r\nSk.astnodes.MatMult.prototype._isenum = true;\r\nSk.astnodes.Div.prototype._astname = \"Div\";\r\nSk.astnodes.Div.prototype._isenum = true;\r\nSk.astnodes.Mod.prototype._astname = \"Mod\";\r\nSk.astnodes.Mod.prototype._isenum = true;\r\nSk.astnodes.Pow.prototype._astname = \"Pow\";\r\nSk.astnodes.Pow.prototype._isenum = true;\r\nSk.astnodes.LShift.prototype._astname = \"LShift\";\r\nSk.astnodes.LShift.prototype._isenum = true;\r\nSk.astnodes.RShift.prototype._astname = \"RShift\";\r\nSk.astnodes.RShift.prototype._isenum = true;\r\nSk.astnodes.BitOr.prototype._astname = \"BitOr\";\r\nSk.astnodes.BitOr.prototype._isenum = true;\r\nSk.astnodes.BitXor.prototype._astname = \"BitXor\";\r\nSk.astnodes.BitXor.prototype._isenum = true;\r\nSk.astnodes.BitAnd.prototype._astname = \"BitAnd\";\r\nSk.astnodes.BitAnd.prototype._isenum = true;\r\nSk.astnodes.FloorDiv.prototype._astname = \"FloorDiv\";\r\nSk.astnodes.FloorDiv.prototype._isenum = true;\r\nSk.astnodes.Invert.prototype._astname = \"Invert\";\r\nSk.astnodes.Invert.prototype._isenum = true;\r\nSk.astnodes.Not.prototype._astname = \"Not\";\r\nSk.astnodes.Not.prototype._isenum = true;\r\nSk.astnodes.UAdd.prototype._astname = \"UAdd\";\r\nSk.astnodes.UAdd.prototype._isenum = true;\r\nSk.astnodes.USub.prototype._astname = \"USub\";\r\nSk.astnodes.USub.prototype._isenum = true;\r\nSk.astnodes.Eq.prototype._astname = \"Eq\";\r\nSk.astnodes.Eq.prototype._isenum = true;\r\nSk.astnodes.NotEq.prototype._astname = \"NotEq\";\r\nSk.astnodes.NotEq.prototype._isenum = true;\r\nSk.astnodes.Lt.prototype._astname = \"Lt\";\r\nSk.astnodes.Lt.prototype._isenum = true;\r\nSk.astnodes.LtE.prototype._astname = \"LtE\";\r\nSk.astnodes.LtE.prototype._isenum = true;\r\nSk.astnodes.Gt.prototype._astname = \"Gt\";\r\nSk.astnodes.Gt.prototype._isenum = true;\r\nSk.astnodes.GtE.prototype._astname = \"GtE\";\r\nSk.astnodes.GtE.prototype._isenum = true;\r\nSk.astnodes.Is.prototype._astname = \"Is\";\r\nSk.astnodes.Is.prototype._isenum = true;\r\nSk.astnodes.IsNot.prototype._astname = \"IsNot\";\r\nSk.astnodes.IsNot.prototype._isenum = true;\r\nSk.astnodes.In.prototype._astname = \"In\";\r\nSk.astnodes.In.prototype._isenum = true;\r\nSk.astnodes.NotIn.prototype._astname = \"NotIn\";\r\nSk.astnodes.NotIn.prototype._isenum = true;\r\nSk.astnodes.comprehension.prototype._astname = \"comprehension\";\r\nSk.astnodes.comprehension.prototype._fields = [\r\n    \"target\", function(n) { return n.target; },\r\n    \"iter\", function(n) { return n.iter; },\r\n    \"ifs\", function(n) { return n.ifs; },\r\n    \"is_async\", function(n) { return n.is_async; }\r\n];\r\nSk.astnodes.ExceptHandler.prototype._astname = \"ExceptHandler\";\r\nSk.astnodes.ExceptHandler.prototype._fields = [\r\n    \"type\", function(n) { return n.type; },\r\n    \"name\", function(n) { return n.name; },\r\n    \"body\", function(n) { return n.body; }\r\n];\r\nSk.astnodes.arguments_.prototype._astname = \"arguments\";\r\nSk.astnodes.arguments_.prototype._fields = [\r\n    \"args\", function(n) { return n.args; },\r\n    \"vararg\", function(n) { return n.vararg; },\r\n    \"kwonlyargs\", function(n) { return n.kwonlyargs; },\r\n    \"kw_defaults\", function(n) { return n.kw_defaults; },\r\n    \"kwarg\", function(n) { return n.kwarg; },\r\n    \"defaults\", function(n) { return n.defaults; }\r\n];\r\nSk.astnodes.arg.prototype._astname = \"arg\";\r\nSk.astnodes.arg.prototype._fields = [\r\n    \"arg\", function(n) { return n.arg; },\r\n    \"annotation\", function(n) { return n.annotation; }\r\n];\r\nSk.astnodes.keyword.prototype._astname = \"keyword\";\r\nSk.astnodes.keyword.prototype._fields = [\r\n    \"arg\", function(n) { return n.arg; },\r\n    \"value\", function(n) { return n.value; }\r\n];\r\nSk.astnodes.alias.prototype._astname = \"alias\";\r\nSk.astnodes.alias.prototype._fields = [\r\n    \"name\", function(n) { return n.name; },\r\n    \"asname\", function(n) { return n.asname; }\r\n];\r\nSk.astnodes.withitem.prototype._astname = \"withitem\";\r\nSk.astnodes.withitem.prototype._fields = [\r\n    \"context_expr\", function(n) { return n.context_expr; },\r\n    \"optional_vars\", function(n) { return n.optional_vars; }\r\n];\r\n\r\nSk.exportSymbol(\"Sk.astnodes\", Sk.astnodes);\r\n","// generated by pgen/main.py\r\nSk.OpMap = {\r\n\"(\": Sk.token.tokens.T_LPAR,\r\n\")\": Sk.token.tokens.T_RPAR,\r\n\"[\": Sk.token.tokens.T_LSQB,\r\n\"]\": Sk.token.tokens.T_RSQB,\r\n\":\": Sk.token.tokens.T_COLON,\r\n\",\": Sk.token.tokens.T_COMMA,\r\n\";\": Sk.token.tokens.T_SEMI,\r\n\"+\": Sk.token.tokens.T_PLUS,\r\n\"-\": Sk.token.tokens.T_MINUS,\r\n\"*\": Sk.token.tokens.T_STAR,\r\n\"/\": Sk.token.tokens.T_SLASH,\r\n\"|\": Sk.token.tokens.T_VBAR,\r\n\"&\": Sk.token.tokens.T_AMPER,\r\n\"<\": Sk.token.tokens.T_LESS,\r\n\">\": Sk.token.tokens.T_GREATER,\r\n\"=\": Sk.token.tokens.T_EQUAL,\r\n\".\": Sk.token.tokens.T_DOT,\r\n\"%\": Sk.token.tokens.T_PERCENT,\r\n\"`\": Sk.token.tokens.T_BACKQUOTE,\r\n\"{\": Sk.token.tokens.T_LBRACE,\r\n\"}\": Sk.token.tokens.T_RBRACE,\r\n\"@\": Sk.token.tokens.T_AT,\r\n\"@=\": Sk.token.tokens.T_ATEQUAL,\r\n\"==\": Sk.token.tokens.T_EQEQUAL,\r\n\"!=\": Sk.token.tokens.T_NOTEQUAL,\r\n\"<>\": Sk.token.tokens.T_NOTEQUAL,\r\n\"<=\": Sk.token.tokens.T_LESSEQUAL,\r\n\">=\": Sk.token.tokens.T_GREATEREQUAL,\r\n\"~\": Sk.token.tokens.T_TILDE,\r\n\"^\": Sk.token.tokens.T_CIRCUMFLEX,\r\n\"<<\": Sk.token.tokens.T_LEFTSHIFT,\r\n\">>\": Sk.token.tokens.T_RIGHTSHIFT,\r\n\"**\": Sk.token.tokens.T_DOUBLESTAR,\r\n\"+=\": Sk.token.tokens.T_PLUSEQUAL,\r\n\"-=\": Sk.token.tokens.T_MINEQUAL,\r\n\"*=\": Sk.token.tokens.T_STAREQUAL,\r\n\"/=\": Sk.token.tokens.T_SLASHEQUAL,\r\n\"%=\": Sk.token.tokens.T_PERCENTEQUAL,\r\n\"&=\": Sk.token.tokens.T_AMPEREQUAL,\r\n\"|=\": Sk.token.tokens.T_VBAREQUAL,\r\n\"^=\": Sk.token.tokens.T_CIRCUMFLEXEQUAL,\r\n\"<<=\": Sk.token.tokens.T_LEFTSHIFTEQUAL,\r\n\">>=\": Sk.token.tokens.T_RIGHTSHIFTEQUAL,\r\n\"**=\": Sk.token.tokens.T_DOUBLESTAREQUAL,\r\n\"//\": Sk.token.tokens.T_DOUBLESLASH,\r\n\"//=\": Sk.token.tokens.T_DOUBLESLASHEQUAL,\r\n\"->\": Sk.token.tokens.T_RARROW,\r\n\"...\": Sk.token.tokens.T_ELLIPSIS\r\n};\r\nSk.ParseTables = {\r\nsym:\r\n{and_expr: 257,\r\n and_test: 258,\r\n annassign: 259,\r\n arglist: 260,\r\n argument: 261,\r\n arith_expr: 262,\r\n assert_stmt: 263,\r\n async_funcdef: 264,\r\n async_stmt: 265,\r\n atom: 266,\r\n atom_expr: 267,\r\n augassign: 268,\r\n break_stmt: 269,\r\n classdef: 270,\r\n comp_for: 271,\r\n comp_if: 272,\r\n comp_iter: 273,\r\n comp_op: 274,\r\n comparison: 275,\r\n compound_stmt: 276,\r\n continue_stmt: 277,\r\n debugger_stmt: 278,\r\n decorated: 279,\r\n decorator: 280,\r\n decorators: 281,\r\n del_stmt: 282,\r\n dictorsetmaker: 283,\r\n dotted_as_name: 284,\r\n dotted_as_names: 285,\r\n dotted_name: 286,\r\n encoding_decl: 287,\r\n eval_input: 288,\r\n except_clause: 289,\r\n expr: 290,\r\n expr_stmt: 291,\r\n exprlist: 292,\r\n factor: 293,\r\n file_input: 294,\r\n flow_stmt: 295,\r\n for_stmt: 296,\r\n funcdef: 297,\r\n global_stmt: 298,\r\n if_stmt: 299,\r\n import_as_name: 300,\r\n import_as_names: 301,\r\n import_from: 302,\r\n import_name: 303,\r\n import_stmt: 304,\r\n lambdef: 305,\r\n lambdef_nocond: 306,\r\n nonlocal_stmt: 307,\r\n not_test: 308,\r\n or_test: 309,\r\n parameters: 310,\r\n pass_stmt: 311,\r\n power: 312,\r\n print_stmt: 313,\r\n raise_stmt: 314,\r\n return_stmt: 315,\r\n shift_expr: 316,\r\n simple_stmt: 317,\r\n single_input: 256,\r\n sliceop: 318,\r\n small_stmt: 319,\r\n star_expr: 320,\r\n stmt: 321,\r\n subscript: 322,\r\n subscriptlist: 323,\r\n suite: 324,\r\n term: 325,\r\n test: 326,\r\n test_nocond: 327,\r\n testlist: 328,\r\n testlist_comp: 329,\r\n testlist_star_expr: 330,\r\n tfpdef: 331,\r\n trailer: 332,\r\n try_stmt: 333,\r\n typedargslist: 334,\r\n varargslist: 335,\r\n vfpdef: 336,\r\n while_stmt: 337,\r\n with_item: 338,\r\n with_stmt: 339,\r\n xor_expr: 340,\r\n yield_arg: 341,\r\n yield_expr: 342,\r\n yield_stmt: 343},\r\nnumber2symbol:\r\n{256: 'single_input',\r\n 257: 'and_expr',\r\n 258: 'and_test',\r\n 259: 'annassign',\r\n 260: 'arglist',\r\n 261: 'argument',\r\n 262: 'arith_expr',\r\n 263: 'assert_stmt',\r\n 264: 'async_funcdef',\r\n 265: 'async_stmt',\r\n 266: 'atom',\r\n 267: 'atom_expr',\r\n 268: 'augassign',\r\n 269: 'break_stmt',\r\n 270: 'classdef',\r\n 271: 'comp_for',\r\n 272: 'comp_if',\r\n 273: 'comp_iter',\r\n 274: 'comp_op',\r\n 275: 'comparison',\r\n 276: 'compound_stmt',\r\n 277: 'continue_stmt',\r\n 278: 'debugger_stmt',\r\n 279: 'decorated',\r\n 280: 'decorator',\r\n 281: 'decorators',\r\n 282: 'del_stmt',\r\n 283: 'dictorsetmaker',\r\n 284: 'dotted_as_name',\r\n 285: 'dotted_as_names',\r\n 286: 'dotted_name',\r\n 287: 'encoding_decl',\r\n 288: 'eval_input',\r\n 289: 'except_clause',\r\n 290: 'expr',\r\n 291: 'expr_stmt',\r\n 292: 'exprlist',\r\n 293: 'factor',\r\n 294: 'file_input',\r\n 295: 'flow_stmt',\r\n 296: 'for_stmt',\r\n 297: 'funcdef',\r\n 298: 'global_stmt',\r\n 299: 'if_stmt',\r\n 300: 'import_as_name',\r\n 301: 'import_as_names',\r\n 302: 'import_from',\r\n 303: 'import_name',\r\n 304: 'import_stmt',\r\n 305: 'lambdef',\r\n 306: 'lambdef_nocond',\r\n 307: 'nonlocal_stmt',\r\n 308: 'not_test',\r\n 309: 'or_test',\r\n 310: 'parameters',\r\n 311: 'pass_stmt',\r\n 312: 'power',\r\n 313: 'print_stmt',\r\n 314: 'raise_stmt',\r\n 315: 'return_stmt',\r\n 316: 'shift_expr',\r\n 317: 'simple_stmt',\r\n 318: 'sliceop',\r\n 319: 'small_stmt',\r\n 320: 'star_expr',\r\n 321: 'stmt',\r\n 322: 'subscript',\r\n 323: 'subscriptlist',\r\n 324: 'suite',\r\n 325: 'term',\r\n 326: 'test',\r\n 327: 'test_nocond',\r\n 328: 'testlist',\r\n 329: 'testlist_comp',\r\n 330: 'testlist_star_expr',\r\n 331: 'tfpdef',\r\n 332: 'trailer',\r\n 333: 'try_stmt',\r\n 334: 'typedargslist',\r\n 335: 'varargslist',\r\n 336: 'vfpdef',\r\n 337: 'while_stmt',\r\n 338: 'with_item',\r\n 339: 'with_stmt',\r\n 340: 'xor_expr',\r\n 341: 'yield_arg',\r\n 342: 'yield_expr',\r\n 343: 'yield_stmt'},\r\ndfas:\r\n{256: [[[[1, 1], [2, 1], [3, 2]], [[0, 1]], [[2, 1]]],\r\n       {2: 1,\r\n        4: 1,\r\n        5: 1,\r\n        6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        10: 1,\r\n        11: 1,\r\n        12: 1,\r\n        13: 1,\r\n        14: 1,\r\n        15: 1,\r\n        16: 1,\r\n        17: 1,\r\n        18: 1,\r\n        19: 1,\r\n        20: 1,\r\n        21: 1,\r\n        22: 1,\r\n        23: 1,\r\n        24: 1,\r\n        25: 1,\r\n        26: 1,\r\n        27: 1,\r\n        28: 1,\r\n        29: 1,\r\n        30: 1,\r\n        31: 1,\r\n        32: 1,\r\n        33: 1,\r\n        34: 1,\r\n        35: 1,\r\n        36: 1,\r\n        37: 1,\r\n        38: 1,\r\n        39: 1,\r\n        40: 1,\r\n        41: 1,\r\n        42: 1,\r\n        43: 1}],\r\n 257: [[[[44, 1]], [[45, 0], [0, 1]]],\r\n       {6: 1,\r\n        7: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 258: [[[[46, 1]], [[47, 0], [0, 1]]],\r\n       {6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 259: [[[[48, 1]], [[49, 2]], [[50, 3], [0, 2]], [[49, 4]], [[0, 4]]],\r\n       {48: 1}],\r\n 260: [[[[51, 1]], [[52, 2], [0, 1]], [[51, 1], [0, 2]]],\r\n       {6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        14: 1,\r\n        15: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1,\r\n        53: 1}],\r\n 261: [[[[49, 1], [15, 2], [53, 2]],\r\n        [[50, 2], [54, 3], [0, 1]],\r\n        [[49, 3]],\r\n        [[0, 3]]],\r\n       {6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        14: 1,\r\n        15: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1,\r\n        53: 1}],\r\n 262: [[[[55, 1]], [[30, 0], [43, 0], [0, 1]]],\r\n       {6: 1,\r\n        7: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 263: [[[[24, 1]], [[49, 2]], [[52, 3], [0, 2]], [[49, 4]], [[0, 4]]],\r\n       {24: 1}],\r\n 264: [[[[10, 1]], [[56, 2]], [[0, 2]]], {10: 1}],\r\n 265: [[[[10, 1]], [[57, 2], [56, 2], [58, 2]], [[0, 2]]], {10: 1}],\r\n 266: [[[[6, 1],\r\n         [25, 1],\r\n         [33, 1],\r\n         [9, 1],\r\n         [11, 1],\r\n         [12, 2],\r\n         [35, 3],\r\n         [38, 4],\r\n         [19, 1],\r\n         [7, 5]],\r\n        [[0, 1]],\r\n        [[59, 1], [60, 6]],\r\n        [[61, 1], [62, 7], [63, 7]],\r\n        [[64, 1], [63, 8]],\r\n        [[7, 5], [0, 5]],\r\n        [[59, 1]],\r\n        [[61, 1]],\r\n        [[64, 1]]],\r\n       {6: 1, 7: 1, 9: 1, 11: 1, 12: 1, 19: 1, 25: 1, 33: 1, 35: 1, 38: 1}],\r\n 267: [[[[29, 1], [65, 2]], [[65, 2]], [[66, 2], [0, 2]]],\r\n       {6: 1,\r\n        7: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        19: 1,\r\n        25: 1,\r\n        29: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1}],\r\n 268: [[[[67, 1],\r\n         [68, 1],\r\n         [69, 1],\r\n         [70, 1],\r\n         [71, 1],\r\n         [72, 1],\r\n         [73, 1],\r\n         [74, 1],\r\n         [75, 1],\r\n         [76, 1],\r\n         [77, 1],\r\n         [78, 1],\r\n         [79, 1]],\r\n        [[0, 1]]],\r\n       {67: 1,\r\n        68: 1,\r\n        69: 1,\r\n        70: 1,\r\n        71: 1,\r\n        72: 1,\r\n        73: 1,\r\n        74: 1,\r\n        75: 1,\r\n        76: 1,\r\n        77: 1,\r\n        78: 1,\r\n        79: 1}],\r\n 269: [[[[39, 1]], [[0, 1]]], {39: 1}],\r\n 270: [[[[13, 1]],\r\n        [[25, 2]],\r\n        [[48, 3], [35, 4]],\r\n        [[80, 5]],\r\n        [[61, 6], [81, 7]],\r\n        [[0, 5]],\r\n        [[48, 3]],\r\n        [[61, 6]]],\r\n       {13: 1}],\r\n 271: [[[[10, 1], [34, 2]],\r\n        [[34, 2]],\r\n        [[82, 3]],\r\n        [[83, 4]],\r\n        [[84, 5]],\r\n        [[85, 6], [0, 5]],\r\n        [[0, 6]]],\r\n       {10: 1, 34: 1}],\r\n 272: [[[[37, 1]], [[86, 2]], [[85, 3], [0, 2]], [[0, 3]]], {37: 1}],\r\n 273: [[[[87, 1], [54, 1]], [[0, 1]]], {10: 1, 34: 1, 37: 1}],\r\n 274: [[[[88, 1],\r\n         [89, 1],\r\n         [8, 2],\r\n         [90, 1],\r\n         [88, 1],\r\n         [83, 1],\r\n         [91, 1],\r\n         [92, 3],\r\n         [93, 1],\r\n         [94, 1]],\r\n        [[0, 1]],\r\n        [[83, 1]],\r\n        [[8, 1], [0, 3]]],\r\n       {8: 1, 83: 1, 88: 1, 89: 1, 90: 1, 91: 1, 92: 1, 93: 1, 94: 1}],\r\n 275: [[[[95, 1]], [[96, 0], [0, 1]]],\r\n       {6: 1,\r\n        7: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 276: [[[[97, 1],\r\n         [98, 1],\r\n         [58, 1],\r\n         [99, 1],\r\n         [57, 1],\r\n         [100, 1],\r\n         [56, 1],\r\n         [101, 1],\r\n         [102, 1]],\r\n        [[0, 1]]],\r\n       {4: 1, 10: 1, 13: 1, 20: 1, 21: 1, 34: 1, 37: 1, 41: 1, 42: 1}],\r\n 277: [[[[40, 1]], [[0, 1]]], {40: 1}],\r\n 278: [[[[17, 1]], [[0, 1]]], {17: 1}],\r\n 279: [[[[103, 1]], [[56, 2], [104, 2], [99, 2]], [[0, 2]]], {41: 1}],\r\n 280: [[[[41, 1]],\r\n        [[105, 2]],\r\n        [[2, 4], [35, 3]],\r\n        [[61, 5], [81, 6]],\r\n        [[0, 4]],\r\n        [[2, 4]],\r\n        [[61, 5]]],\r\n       {41: 1}],\r\n 281: [[[[106, 1]], [[106, 1], [0, 1]]], {41: 1}],\r\n 282: [[[[27, 1]], [[82, 2]], [[0, 2]]], {27: 1}],\r\n 283: [[[[49, 1], [107, 2], [53, 3]],\r\n        [[48, 4], [54, 5], [52, 6], [0, 1]],\r\n        [[54, 5], [52, 6], [0, 2]],\r\n        [[95, 7]],\r\n        [[49, 7]],\r\n        [[0, 5]],\r\n        [[49, 8], [107, 8], [0, 6]],\r\n        [[54, 5], [52, 9], [0, 7]],\r\n        [[52, 6], [0, 8]],\r\n        [[49, 10], [53, 11], [0, 9]],\r\n        [[48, 12]],\r\n        [[95, 13]],\r\n        [[49, 13]],\r\n        [[52, 9], [0, 13]]],\r\n       {6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        14: 1,\r\n        15: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1,\r\n        53: 1}],\r\n 284: [[[[105, 1]], [[108, 2], [0, 1]], [[25, 3]], [[0, 3]]], {25: 1}],\r\n 285: [[[[109, 1]], [[52, 0], [0, 1]]], {25: 1}],\r\n 286: [[[[25, 1]], [[110, 0], [0, 1]]], {25: 1}],\r\n 287: [[[[25, 1]], [[0, 1]]], {25: 1}],\r\n 288: [[[[111, 1]], [[2, 1], [112, 2]], [[0, 2]]],\r\n       {6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        14: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 289: [[[[113, 1]],\r\n        [[49, 2], [0, 1]],\r\n        [[108, 3], [52, 3], [0, 2]],\r\n        [[49, 4]],\r\n        [[0, 4]]],\r\n       {113: 1}],\r\n 290: [[[[114, 1]], [[115, 0], [0, 1]]],\r\n       {6: 1,\r\n        7: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 291: [[[[116, 1]],\r\n        [[117, 2], [50, 3], [118, 4], [0, 1]],\r\n        [[111, 4], [62, 4]],\r\n        [[116, 5], [62, 5]],\r\n        [[0, 4]],\r\n        [[50, 3], [0, 5]]],\r\n       {6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        14: 1,\r\n        15: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 292: [[[[95, 1], [107, 1]], [[52, 2], [0, 1]], [[95, 1], [107, 1], [0, 2]]],\r\n       {6: 1,\r\n        7: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        15: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 293: [[[[119, 2], [30, 1], [22, 1], [43, 1]], [[120, 2]], [[0, 2]]],\r\n       {6: 1,\r\n        7: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 294: [[[[2, 0], [112, 1], [121, 0]], [[0, 1]]],\r\n       {2: 1,\r\n        4: 1,\r\n        5: 1,\r\n        6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        10: 1,\r\n        11: 1,\r\n        12: 1,\r\n        13: 1,\r\n        14: 1,\r\n        15: 1,\r\n        16: 1,\r\n        17: 1,\r\n        18: 1,\r\n        19: 1,\r\n        20: 1,\r\n        21: 1,\r\n        22: 1,\r\n        23: 1,\r\n        24: 1,\r\n        25: 1,\r\n        26: 1,\r\n        27: 1,\r\n        28: 1,\r\n        29: 1,\r\n        30: 1,\r\n        31: 1,\r\n        32: 1,\r\n        33: 1,\r\n        34: 1,\r\n        35: 1,\r\n        36: 1,\r\n        37: 1,\r\n        38: 1,\r\n        39: 1,\r\n        40: 1,\r\n        41: 1,\r\n        42: 1,\r\n        43: 1,\r\n        112: 1}],\r\n 295: [[[[122, 1], [123, 1], [124, 1], [125, 1], [126, 1]], [[0, 1]]],\r\n       {5: 1, 23: 1, 31: 1, 39: 1, 40: 1}],\r\n 296: [[[[34, 1]],\r\n        [[82, 2]],\r\n        [[83, 3]],\r\n        [[111, 4]],\r\n        [[48, 5]],\r\n        [[80, 6]],\r\n        [[127, 7], [0, 6]],\r\n        [[48, 8]],\r\n        [[80, 9]],\r\n        [[0, 9]]],\r\n       {34: 1}],\r\n 297: [[[[4, 1]],\r\n        [[25, 2]],\r\n        [[128, 3]],\r\n        [[48, 4], [129, 5]],\r\n        [[80, 6]],\r\n        [[49, 7]],\r\n        [[0, 6]],\r\n        [[48, 4]]],\r\n       {4: 1}],\r\n 298: [[[[26, 1]], [[25, 2]], [[52, 1], [0, 2]]], {26: 1}],\r\n 299: [[[[37, 1]],\r\n        [[49, 2]],\r\n        [[48, 3]],\r\n        [[80, 4]],\r\n        [[127, 5], [130, 1], [0, 4]],\r\n        [[48, 6]],\r\n        [[80, 7]],\r\n        [[0, 7]]],\r\n       {37: 1}],\r\n 300: [[[[25, 1]], [[108, 2], [0, 1]], [[25, 3]], [[0, 3]]], {25: 1}],\r\n 301: [[[[131, 1]], [[52, 2], [0, 1]], [[131, 1], [0, 2]]], {25: 1}],\r\n 302: [[[[36, 1]],\r\n        [[105, 2], [19, 3], [110, 3]],\r\n        [[32, 4]],\r\n        [[105, 2], [19, 3], [32, 4], [110, 3]],\r\n        [[132, 5], [15, 5], [35, 6]],\r\n        [[0, 5]],\r\n        [[132, 7]],\r\n        [[61, 5]]],\r\n       {36: 1}],\r\n 303: [[[[32, 1]], [[133, 2]], [[0, 2]]], {32: 1}],\r\n 304: [[[[134, 1], [135, 1]], [[0, 1]]], {32: 1, 36: 1}],\r\n 305: [[[[14, 1]], [[48, 2], [136, 3]], [[49, 4]], [[48, 2]], [[0, 4]]],\r\n       {14: 1}],\r\n 306: [[[[14, 1]], [[48, 2], [136, 3]], [[86, 4]], [[48, 2]], [[0, 4]]],\r\n       {14: 1}],\r\n 307: [[[[18, 1]], [[25, 2]], [[52, 1], [0, 2]]], {18: 1}],\r\n 308: [[[[8, 1], [137, 2]], [[46, 2]], [[0, 2]]],\r\n       {6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 309: [[[[138, 1]], [[139, 0], [0, 1]]],\r\n       {6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 310: [[[[35, 1]], [[61, 2], [140, 3]], [[0, 2]], [[61, 2]]], {35: 1}],\r\n 311: [[[[28, 1]], [[0, 1]]], {28: 1}],\r\n 312: [[[[141, 1]], [[53, 2], [0, 1]], [[120, 3]], [[0, 3]]],\r\n       {6: 1,\r\n        7: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        19: 1,\r\n        25: 1,\r\n        29: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1}],\r\n 313: [[[[16, 1]],\r\n        [[49, 2], [142, 3], [0, 1]],\r\n        [[52, 4], [0, 2]],\r\n        [[49, 5]],\r\n        [[49, 2], [0, 4]],\r\n        [[52, 6], [0, 5]],\r\n        [[49, 7]],\r\n        [[52, 8], [0, 7]],\r\n        [[49, 7], [0, 8]]],\r\n       {16: 1}],\r\n 314: [[[[5, 1]],\r\n        [[49, 2], [0, 1]],\r\n        [[36, 3], [52, 3], [0, 2]],\r\n        [[49, 4]],\r\n        [[52, 5], [0, 4]],\r\n        [[49, 6]],\r\n        [[0, 6]]],\r\n       {5: 1}],\r\n 315: [[[[23, 1]], [[111, 2], [0, 1]], [[0, 2]]], {23: 1}],\r\n 316: [[[[143, 1]], [[144, 0], [142, 0], [0, 1]]],\r\n       {6: 1,\r\n        7: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 317: [[[[145, 1]], [[2, 2], [146, 3]], [[0, 2]], [[145, 1], [2, 2]]],\r\n       {5: 1,\r\n        6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        14: 1,\r\n        15: 1,\r\n        16: 1,\r\n        17: 1,\r\n        18: 1,\r\n        19: 1,\r\n        22: 1,\r\n        23: 1,\r\n        24: 1,\r\n        25: 1,\r\n        26: 1,\r\n        27: 1,\r\n        28: 1,\r\n        29: 1,\r\n        30: 1,\r\n        31: 1,\r\n        32: 1,\r\n        33: 1,\r\n        35: 1,\r\n        36: 1,\r\n        38: 1,\r\n        39: 1,\r\n        40: 1,\r\n        43: 1}],\r\n 318: [[[[48, 1]], [[49, 2], [0, 1]], [[0, 2]]], {48: 1}],\r\n 319: [[[[147, 1],\r\n         [148, 1],\r\n         [149, 1],\r\n         [150, 1],\r\n         [151, 1],\r\n         [152, 1],\r\n         [153, 1],\r\n         [154, 1],\r\n         [155, 1],\r\n         [156, 1]],\r\n        [[0, 1]]],\r\n       {5: 1,\r\n        6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        14: 1,\r\n        15: 1,\r\n        16: 1,\r\n        17: 1,\r\n        18: 1,\r\n        19: 1,\r\n        22: 1,\r\n        23: 1,\r\n        24: 1,\r\n        25: 1,\r\n        26: 1,\r\n        27: 1,\r\n        28: 1,\r\n        29: 1,\r\n        30: 1,\r\n        31: 1,\r\n        32: 1,\r\n        33: 1,\r\n        35: 1,\r\n        36: 1,\r\n        38: 1,\r\n        39: 1,\r\n        40: 1,\r\n        43: 1}],\r\n 320: [[[[15, 1]], [[95, 2]], [[0, 2]]], {15: 1}],\r\n 321: [[[[1, 1], [3, 1]], [[0, 1]]],\r\n       {4: 1,\r\n        5: 1,\r\n        6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        10: 1,\r\n        11: 1,\r\n        12: 1,\r\n        13: 1,\r\n        14: 1,\r\n        15: 1,\r\n        16: 1,\r\n        17: 1,\r\n        18: 1,\r\n        19: 1,\r\n        20: 1,\r\n        21: 1,\r\n        22: 1,\r\n        23: 1,\r\n        24: 1,\r\n        25: 1,\r\n        26: 1,\r\n        27: 1,\r\n        28: 1,\r\n        29: 1,\r\n        30: 1,\r\n        31: 1,\r\n        32: 1,\r\n        33: 1,\r\n        34: 1,\r\n        35: 1,\r\n        36: 1,\r\n        37: 1,\r\n        38: 1,\r\n        39: 1,\r\n        40: 1,\r\n        41: 1,\r\n        42: 1,\r\n        43: 1}],\r\n 322: [[[[49, 1], [48, 2]],\r\n        [[48, 2], [0, 1]],\r\n        [[49, 3], [157, 4], [0, 2]],\r\n        [[157, 4], [0, 3]],\r\n        [[0, 4]]],\r\n       {6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        14: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1,\r\n        48: 1}],\r\n 323: [[[[158, 1]], [[52, 2], [0, 1]], [[158, 1], [0, 2]]],\r\n       {6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        14: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1,\r\n        48: 1}],\r\n 324: [[[[1, 1], [2, 2]],\r\n        [[0, 1]],\r\n        [[159, 3]],\r\n        [[121, 4]],\r\n        [[160, 1], [121, 4]]],\r\n       {2: 1,\r\n        5: 1,\r\n        6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        14: 1,\r\n        15: 1,\r\n        16: 1,\r\n        17: 1,\r\n        18: 1,\r\n        19: 1,\r\n        22: 1,\r\n        23: 1,\r\n        24: 1,\r\n        25: 1,\r\n        26: 1,\r\n        27: 1,\r\n        28: 1,\r\n        29: 1,\r\n        30: 1,\r\n        31: 1,\r\n        32: 1,\r\n        33: 1,\r\n        35: 1,\r\n        36: 1,\r\n        38: 1,\r\n        39: 1,\r\n        40: 1,\r\n        43: 1}],\r\n 325: [[[[120, 1]], [[161, 0], [15, 0], [162, 0], [41, 0], [163, 0], [0, 1]]],\r\n       {6: 1,\r\n        7: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 326: [[[[84, 1], [164, 2]],\r\n        [[37, 3], [0, 1]],\r\n        [[0, 2]],\r\n        [[84, 4]],\r\n        [[127, 5]],\r\n        [[49, 2]]],\r\n       {6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        14: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 327: [[[[165, 1], [84, 1]], [[0, 1]]],\r\n       {6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        14: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 328: [[[[49, 1]], [[52, 2], [0, 1]], [[49, 1], [0, 2]]],\r\n       {6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        14: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 329: [[[[49, 1], [107, 1]],\r\n        [[54, 2], [52, 3], [0, 1]],\r\n        [[0, 2]],\r\n        [[49, 4], [107, 4], [0, 3]],\r\n        [[52, 3], [0, 4]]],\r\n       {6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        14: 1,\r\n        15: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 330: [[[[49, 1], [107, 1]], [[52, 2], [0, 1]], [[49, 1], [107, 1], [0, 2]]],\r\n       {6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        14: 1,\r\n        15: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 331: [[[[25, 1]], [[48, 2], [0, 1]], [[49, 3]], [[0, 3]]], {25: 1}],\r\n 332: [[[[35, 1], [110, 2], [38, 3]],\r\n        [[61, 4], [81, 5]],\r\n        [[25, 4]],\r\n        [[166, 6]],\r\n        [[0, 4]],\r\n        [[61, 4]],\r\n        [[64, 4]]],\r\n       {35: 1, 38: 1, 110: 1}],\r\n 333: [[[[20, 1]],\r\n        [[48, 2]],\r\n        [[80, 3]],\r\n        [[167, 4], [168, 5]],\r\n        [[48, 6]],\r\n        [[48, 7]],\r\n        [[80, 8]],\r\n        [[80, 9]],\r\n        [[167, 4], [127, 10], [168, 5], [0, 8]],\r\n        [[0, 9]],\r\n        [[48, 11]],\r\n        [[80, 12]],\r\n        [[168, 5], [0, 12]]],\r\n       {20: 1}],\r\n 334: [[[[15, 1], [169, 2], [53, 3]],\r\n        [[169, 4], [52, 5], [0, 1]],\r\n        [[50, 6], [52, 7], [0, 2]],\r\n        [[169, 8]],\r\n        [[52, 5], [0, 4]],\r\n        [[169, 9], [53, 3], [0, 5]],\r\n        [[49, 10]],\r\n        [[15, 11], [169, 2], [53, 3], [0, 7]],\r\n        [[52, 12], [0, 8]],\r\n        [[50, 13], [52, 5], [0, 9]],\r\n        [[52, 7], [0, 10]],\r\n        [[169, 14], [52, 15], [0, 11]],\r\n        [[0, 12]],\r\n        [[49, 4]],\r\n        [[52, 15], [0, 14]],\r\n        [[169, 16], [53, 3], [0, 15]],\r\n        [[50, 17], [52, 15], [0, 16]],\r\n        [[49, 14]]],\r\n       {15: 1, 25: 1, 53: 1}],\r\n 335: [[[[15, 1], [53, 2], [170, 3]],\r\n        [[170, 5], [52, 4], [0, 1]],\r\n        [[170, 6]],\r\n        [[50, 7], [52, 8], [0, 3]],\r\n        [[53, 2], [170, 9], [0, 4]],\r\n        [[52, 4], [0, 5]],\r\n        [[52, 10], [0, 6]],\r\n        [[49, 11]],\r\n        [[15, 12], [53, 2], [170, 3], [0, 8]],\r\n        [[50, 13], [52, 4], [0, 9]],\r\n        [[0, 10]],\r\n        [[52, 8], [0, 11]],\r\n        [[52, 15], [170, 14], [0, 12]],\r\n        [[49, 5]],\r\n        [[52, 15], [0, 14]],\r\n        [[53, 2], [170, 16], [0, 15]],\r\n        [[50, 17], [52, 15], [0, 16]],\r\n        [[49, 14]]],\r\n       {15: 1, 25: 1, 53: 1}],\r\n 336: [[[[25, 1]], [[0, 1]]], {25: 1}],\r\n 337: [[[[21, 1]],\r\n        [[49, 2]],\r\n        [[48, 3]],\r\n        [[80, 4]],\r\n        [[127, 5], [0, 4]],\r\n        [[48, 6]],\r\n        [[80, 7]],\r\n        [[0, 7]]],\r\n       {21: 1}],\r\n 338: [[[[49, 1]], [[108, 2], [0, 1]], [[95, 3]], [[0, 3]]],\r\n       {6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        14: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 339: [[[[42, 1]], [[171, 2]], [[48, 3], [52, 1]], [[80, 4]], [[0, 4]]],\r\n       {42: 1}],\r\n 340: [[[[172, 1]], [[173, 0], [0, 1]]],\r\n       {6: 1,\r\n        7: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 341: [[[[111, 2], [36, 1]], [[49, 2]], [[0, 2]]],\r\n       {6: 1,\r\n        7: 1,\r\n        8: 1,\r\n        9: 1,\r\n        11: 1,\r\n        12: 1,\r\n        14: 1,\r\n        19: 1,\r\n        22: 1,\r\n        25: 1,\r\n        29: 1,\r\n        30: 1,\r\n        33: 1,\r\n        35: 1,\r\n        36: 1,\r\n        38: 1,\r\n        43: 1}],\r\n 342: [[[[31, 1]], [[174, 2], [0, 1]], [[0, 2]]], {31: 1}],\r\n 343: [[[[62, 1]], [[0, 1]]], {31: 1}]},\r\nstates:\r\n[[[[1, 1], [2, 1], [3, 2]], [[0, 1]], [[2, 1]]],\r\n [[[44, 1]], [[45, 0], [0, 1]]],\r\n [[[46, 1]], [[47, 0], [0, 1]]],\r\n [[[48, 1]], [[49, 2]], [[50, 3], [0, 2]], [[49, 4]], [[0, 4]]],\r\n [[[51, 1]], [[52, 2], [0, 1]], [[51, 1], [0, 2]]],\r\n [[[49, 1], [15, 2], [53, 2]],\r\n  [[50, 2], [54, 3], [0, 1]],\r\n  [[49, 3]],\r\n  [[0, 3]]],\r\n [[[55, 1]], [[30, 0], [43, 0], [0, 1]]],\r\n [[[24, 1]], [[49, 2]], [[52, 3], [0, 2]], [[49, 4]], [[0, 4]]],\r\n [[[10, 1]], [[56, 2]], [[0, 2]]],\r\n [[[10, 1]], [[57, 2], [56, 2], [58, 2]], [[0, 2]]],\r\n [[[6, 1],\r\n   [25, 1],\r\n   [33, 1],\r\n   [9, 1],\r\n   [11, 1],\r\n   [12, 2],\r\n   [35, 3],\r\n   [38, 4],\r\n   [19, 1],\r\n   [7, 5]],\r\n  [[0, 1]],\r\n  [[59, 1], [60, 6]],\r\n  [[61, 1], [62, 7], [63, 7]],\r\n  [[64, 1], [63, 8]],\r\n  [[7, 5], [0, 5]],\r\n  [[59, 1]],\r\n  [[61, 1]],\r\n  [[64, 1]]],\r\n [[[29, 1], [65, 2]], [[65, 2]], [[66, 2], [0, 2]]],\r\n [[[67, 1],\r\n   [68, 1],\r\n   [69, 1],\r\n   [70, 1],\r\n   [71, 1],\r\n   [72, 1],\r\n   [73, 1],\r\n   [74, 1],\r\n   [75, 1],\r\n   [76, 1],\r\n   [77, 1],\r\n   [78, 1],\r\n   [79, 1]],\r\n  [[0, 1]]],\r\n [[[39, 1]], [[0, 1]]],\r\n [[[13, 1]],\r\n  [[25, 2]],\r\n  [[48, 3], [35, 4]],\r\n  [[80, 5]],\r\n  [[61, 6], [81, 7]],\r\n  [[0, 5]],\r\n  [[48, 3]],\r\n  [[61, 6]]],\r\n [[[10, 1], [34, 2]],\r\n  [[34, 2]],\r\n  [[82, 3]],\r\n  [[83, 4]],\r\n  [[84, 5]],\r\n  [[85, 6], [0, 5]],\r\n  [[0, 6]]],\r\n [[[37, 1]], [[86, 2]], [[85, 3], [0, 2]], [[0, 3]]],\r\n [[[87, 1], [54, 1]], [[0, 1]]],\r\n [[[88, 1],\r\n   [89, 1],\r\n   [8, 2],\r\n   [90, 1],\r\n   [88, 1],\r\n   [83, 1],\r\n   [91, 1],\r\n   [92, 3],\r\n   [93, 1],\r\n   [94, 1]],\r\n  [[0, 1]],\r\n  [[83, 1]],\r\n  [[8, 1], [0, 3]]],\r\n [[[95, 1]], [[96, 0], [0, 1]]],\r\n [[[97, 1],\r\n   [98, 1],\r\n   [58, 1],\r\n   [99, 1],\r\n   [57, 1],\r\n   [100, 1],\r\n   [56, 1],\r\n   [101, 1],\r\n   [102, 1]],\r\n  [[0, 1]]],\r\n [[[40, 1]], [[0, 1]]],\r\n [[[17, 1]], [[0, 1]]],\r\n [[[103, 1]], [[56, 2], [104, 2], [99, 2]], [[0, 2]]],\r\n [[[41, 1]],\r\n  [[105, 2]],\r\n  [[2, 4], [35, 3]],\r\n  [[61, 5], [81, 6]],\r\n  [[0, 4]],\r\n  [[2, 4]],\r\n  [[61, 5]]],\r\n [[[106, 1]], [[106, 1], [0, 1]]],\r\n [[[27, 1]], [[82, 2]], [[0, 2]]],\r\n [[[49, 1], [107, 2], [53, 3]],\r\n  [[48, 4], [54, 5], [52, 6], [0, 1]],\r\n  [[54, 5], [52, 6], [0, 2]],\r\n  [[95, 7]],\r\n  [[49, 7]],\r\n  [[0, 5]],\r\n  [[49, 8], [107, 8], [0, 6]],\r\n  [[54, 5], [52, 9], [0, 7]],\r\n  [[52, 6], [0, 8]],\r\n  [[49, 10], [53, 11], [0, 9]],\r\n  [[48, 12]],\r\n  [[95, 13]],\r\n  [[49, 13]],\r\n  [[52, 9], [0, 13]]],\r\n [[[105, 1]], [[108, 2], [0, 1]], [[25, 3]], [[0, 3]]],\r\n [[[109, 1]], [[52, 0], [0, 1]]],\r\n [[[25, 1]], [[110, 0], [0, 1]]],\r\n [[[25, 1]], [[0, 1]]],\r\n [[[111, 1]], [[2, 1], [112, 2]], [[0, 2]]],\r\n [[[113, 1]],\r\n  [[49, 2], [0, 1]],\r\n  [[108, 3], [52, 3], [0, 2]],\r\n  [[49, 4]],\r\n  [[0, 4]]],\r\n [[[114, 1]], [[115, 0], [0, 1]]],\r\n [[[116, 1]],\r\n  [[117, 2], [50, 3], [118, 4], [0, 1]],\r\n  [[111, 4], [62, 4]],\r\n  [[116, 5], [62, 5]],\r\n  [[0, 4]],\r\n  [[50, 3], [0, 5]]],\r\n [[[95, 1], [107, 1]], [[52, 2], [0, 1]], [[95, 1], [107, 1], [0, 2]]],\r\n [[[119, 2], [30, 1], [22, 1], [43, 1]], [[120, 2]], [[0, 2]]],\r\n [[[2, 0], [112, 1], [121, 0]], [[0, 1]]],\r\n [[[122, 1], [123, 1], [124, 1], [125, 1], [126, 1]], [[0, 1]]],\r\n [[[34, 1]],\r\n  [[82, 2]],\r\n  [[83, 3]],\r\n  [[111, 4]],\r\n  [[48, 5]],\r\n  [[80, 6]],\r\n  [[127, 7], [0, 6]],\r\n  [[48, 8]],\r\n  [[80, 9]],\r\n  [[0, 9]]],\r\n [[[4, 1]],\r\n  [[25, 2]],\r\n  [[128, 3]],\r\n  [[48, 4], [129, 5]],\r\n  [[80, 6]],\r\n  [[49, 7]],\r\n  [[0, 6]],\r\n  [[48, 4]]],\r\n [[[26, 1]], [[25, 2]], [[52, 1], [0, 2]]],\r\n [[[37, 1]],\r\n  [[49, 2]],\r\n  [[48, 3]],\r\n  [[80, 4]],\r\n  [[127, 5], [130, 1], [0, 4]],\r\n  [[48, 6]],\r\n  [[80, 7]],\r\n  [[0, 7]]],\r\n [[[25, 1]], [[108, 2], [0, 1]], [[25, 3]], [[0, 3]]],\r\n [[[131, 1]], [[52, 2], [0, 1]], [[131, 1], [0, 2]]],\r\n [[[36, 1]],\r\n  [[105, 2], [19, 3], [110, 3]],\r\n  [[32, 4]],\r\n  [[105, 2], [19, 3], [32, 4], [110, 3]],\r\n  [[132, 5], [15, 5], [35, 6]],\r\n  [[0, 5]],\r\n  [[132, 7]],\r\n  [[61, 5]]],\r\n [[[32, 1]], [[133, 2]], [[0, 2]]],\r\n [[[134, 1], [135, 1]], [[0, 1]]],\r\n [[[14, 1]], [[48, 2], [136, 3]], [[49, 4]], [[48, 2]], [[0, 4]]],\r\n [[[14, 1]], [[48, 2], [136, 3]], [[86, 4]], [[48, 2]], [[0, 4]]],\r\n [[[18, 1]], [[25, 2]], [[52, 1], [0, 2]]],\r\n [[[8, 1], [137, 2]], [[46, 2]], [[0, 2]]],\r\n [[[138, 1]], [[139, 0], [0, 1]]],\r\n [[[35, 1]], [[61, 2], [140, 3]], [[0, 2]], [[61, 2]]],\r\n [[[28, 1]], [[0, 1]]],\r\n [[[141, 1]], [[53, 2], [0, 1]], [[120, 3]], [[0, 3]]],\r\n [[[16, 1]],\r\n  [[49, 2], [142, 3], [0, 1]],\r\n  [[52, 4], [0, 2]],\r\n  [[49, 5]],\r\n  [[49, 2], [0, 4]],\r\n  [[52, 6], [0, 5]],\r\n  [[49, 7]],\r\n  [[52, 8], [0, 7]],\r\n  [[49, 7], [0, 8]]],\r\n [[[5, 1]],\r\n  [[49, 2], [0, 1]],\r\n  [[36, 3], [52, 3], [0, 2]],\r\n  [[49, 4]],\r\n  [[52, 5], [0, 4]],\r\n  [[49, 6]],\r\n  [[0, 6]]],\r\n [[[23, 1]], [[111, 2], [0, 1]], [[0, 2]]],\r\n [[[143, 1]], [[144, 0], [142, 0], [0, 1]]],\r\n [[[145, 1]], [[2, 2], [146, 3]], [[0, 2]], [[145, 1], [2, 2]]],\r\n [[[48, 1]], [[49, 2], [0, 1]], [[0, 2]]],\r\n [[[147, 1],\r\n   [148, 1],\r\n   [149, 1],\r\n   [150, 1],\r\n   [151, 1],\r\n   [152, 1],\r\n   [153, 1],\r\n   [154, 1],\r\n   [155, 1],\r\n   [156, 1]],\r\n  [[0, 1]]],\r\n [[[15, 1]], [[95, 2]], [[0, 2]]],\r\n [[[1, 1], [3, 1]], [[0, 1]]],\r\n [[[49, 1], [48, 2]],\r\n  [[48, 2], [0, 1]],\r\n  [[49, 3], [157, 4], [0, 2]],\r\n  [[157, 4], [0, 3]],\r\n  [[0, 4]]],\r\n [[[158, 1]], [[52, 2], [0, 1]], [[158, 1], [0, 2]]],\r\n [[[1, 1], [2, 2]], [[0, 1]], [[159, 3]], [[121, 4]], [[160, 1], [121, 4]]],\r\n [[[120, 1]], [[161, 0], [15, 0], [162, 0], [41, 0], [163, 0], [0, 1]]],\r\n [[[84, 1], [164, 2]],\r\n  [[37, 3], [0, 1]],\r\n  [[0, 2]],\r\n  [[84, 4]],\r\n  [[127, 5]],\r\n  [[49, 2]]],\r\n [[[165, 1], [84, 1]], [[0, 1]]],\r\n [[[49, 1]], [[52, 2], [0, 1]], [[49, 1], [0, 2]]],\r\n [[[49, 1], [107, 1]],\r\n  [[54, 2], [52, 3], [0, 1]],\r\n  [[0, 2]],\r\n  [[49, 4], [107, 4], [0, 3]],\r\n  [[52, 3], [0, 4]]],\r\n [[[49, 1], [107, 1]], [[52, 2], [0, 1]], [[49, 1], [107, 1], [0, 2]]],\r\n [[[25, 1]], [[48, 2], [0, 1]], [[49, 3]], [[0, 3]]],\r\n [[[35, 1], [110, 2], [38, 3]],\r\n  [[61, 4], [81, 5]],\r\n  [[25, 4]],\r\n  [[166, 6]],\r\n  [[0, 4]],\r\n  [[61, 4]],\r\n  [[64, 4]]],\r\n [[[20, 1]],\r\n  [[48, 2]],\r\n  [[80, 3]],\r\n  [[167, 4], [168, 5]],\r\n  [[48, 6]],\r\n  [[48, 7]],\r\n  [[80, 8]],\r\n  [[80, 9]],\r\n  [[167, 4], [127, 10], [168, 5], [0, 8]],\r\n  [[0, 9]],\r\n  [[48, 11]],\r\n  [[80, 12]],\r\n  [[168, 5], [0, 12]]],\r\n [[[15, 1], [169, 2], [53, 3]],\r\n  [[169, 4], [52, 5], [0, 1]],\r\n  [[50, 6], [52, 7], [0, 2]],\r\n  [[169, 8]],\r\n  [[52, 5], [0, 4]],\r\n  [[169, 9], [53, 3], [0, 5]],\r\n  [[49, 10]],\r\n  [[15, 11], [169, 2], [53, 3], [0, 7]],\r\n  [[52, 12], [0, 8]],\r\n  [[50, 13], [52, 5], [0, 9]],\r\n  [[52, 7], [0, 10]],\r\n  [[169, 14], [52, 15], [0, 11]],\r\n  [[0, 12]],\r\n  [[49, 4]],\r\n  [[52, 15], [0, 14]],\r\n  [[169, 16], [53, 3], [0, 15]],\r\n  [[50, 17], [52, 15], [0, 16]],\r\n  [[49, 14]]],\r\n [[[15, 1], [53, 2], [170, 3]],\r\n  [[170, 5], [52, 4], [0, 1]],\r\n  [[170, 6]],\r\n  [[50, 7], [52, 8], [0, 3]],\r\n  [[53, 2], [170, 9], [0, 4]],\r\n  [[52, 4], [0, 5]],\r\n  [[52, 10], [0, 6]],\r\n  [[49, 11]],\r\n  [[15, 12], [53, 2], [170, 3], [0, 8]],\r\n  [[50, 13], [52, 4], [0, 9]],\r\n  [[0, 10]],\r\n  [[52, 8], [0, 11]],\r\n  [[52, 15], [170, 14], [0, 12]],\r\n  [[49, 5]],\r\n  [[52, 15], [0, 14]],\r\n  [[53, 2], [170, 16], [0, 15]],\r\n  [[50, 17], [52, 15], [0, 16]],\r\n  [[49, 14]]],\r\n [[[25, 1]], [[0, 1]]],\r\n [[[21, 1]],\r\n  [[49, 2]],\r\n  [[48, 3]],\r\n  [[80, 4]],\r\n  [[127, 5], [0, 4]],\r\n  [[48, 6]],\r\n  [[80, 7]],\r\n  [[0, 7]]],\r\n [[[49, 1]], [[108, 2], [0, 1]], [[95, 3]], [[0, 3]]],\r\n [[[42, 1]], [[171, 2]], [[48, 3], [52, 1]], [[80, 4]], [[0, 4]]],\r\n [[[172, 1]], [[173, 0], [0, 1]]],\r\n [[[111, 2], [36, 1]], [[49, 2]], [[0, 2]]],\r\n [[[31, 1]], [[174, 2], [0, 1]], [[0, 2]]],\r\n [[[62, 1]], [[0, 1]]]],\r\nlabels:\r\n[[0, 'EMPTY'],\r\n [317, null],\r\n [4, null],\r\n [276, null],\r\n [1, 'def'],\r\n [1, 'raise'],\r\n [1, 'True'],\r\n [3, null],\r\n [1, 'not'],\r\n [1, 'null'],\r\n [55, null],\r\n [2, null],\r\n [25, null],\r\n [1, 'class'],\r\n [1, 'lambda'],\r\n [16, null],\r\n [1, 'print'],\r\n [1, 'debugger'],\r\n [1, 'nonlocal'],\r\n [52, null],\r\n [1, 'try'],\r\n [1, 'while'],\r\n [31, null],\r\n [1, 'return'],\r\n [1, 'assert'],\r\n [1, null],\r\n [1, 'global'],\r\n [1, 'del'],\r\n [1, 'pass'],\r\n [54, null],\r\n [15, null],\r\n [1, 'yield'],\r\n [1, 'import'],\r\n [1, 'False'],\r\n [1, 'for'],\r\n [7, null],\r\n [1, 'from'],\r\n [1, 'if'],\r\n [9, null],\r\n [1, 'break'],\r\n [1, 'continue'],\r\n [49, null],\r\n [1, 'with'],\r\n [14, null],\r\n [316, null],\r\n [19, null],\r\n [308, null],\r\n [1, 'and'],\r\n [11, null],\r\n [326, null],\r\n [22, null],\r\n [261, null],\r\n [12, null],\r\n [35, null],\r\n [271, null],\r\n [325, null],\r\n [297, null],\r\n [339, null],\r\n [296, null],\r\n [26, null],\r\n [283, null],\r\n [8, null],\r\n [342, null],\r\n [329, null],\r\n [10, null],\r\n [266, null],\r\n [332, null],\r\n [45, null],\r\n [38, null],\r\n [40, null],\r\n [50, null],\r\n [46, null],\r\n [41, null],\r\n [42, null],\r\n [36, null],\r\n [43, null],\r\n [48, null],\r\n [44, null],\r\n [37, null],\r\n [39, null],\r\n [324, null],\r\n [260, null],\r\n [292, null],\r\n [1, 'in'],\r\n [309, null],\r\n [273, null],\r\n [327, null],\r\n [272, null],\r\n [28, null],\r\n [21, null],\r\n [27, null],\r\n [29, null],\r\n [1, 'is'],\r\n [30, null],\r\n [20, null],\r\n [290, null],\r\n [274, null],\r\n [333, null],\r\n [299, null],\r\n [270, null],\r\n [337, null],\r\n [279, null],\r\n [265, null],\r\n [281, null],\r\n [264, null],\r\n [286, null],\r\n [280, null],\r\n [320, null],\r\n [1, 'as'],\r\n [284, null],\r\n [23, null],\r\n [328, null],\r\n [0, null],\r\n [1, 'except'],\r\n [340, null],\r\n [18, null],\r\n [330, null],\r\n [268, null],\r\n [259, null],\r\n [312, null],\r\n [293, null],\r\n [321, null],\r\n [269, null],\r\n [277, null],\r\n [314, null],\r\n [315, null],\r\n [343, null],\r\n [1, 'else'],\r\n [310, null],\r\n [51, null],\r\n [1, 'elif'],\r\n [300, null],\r\n [301, null],\r\n [285, null],\r\n [303, null],\r\n [302, null],\r\n [335, null],\r\n [275, null],\r\n [258, null],\r\n [1, 'or'],\r\n [334, null],\r\n [267, null],\r\n [34, null],\r\n [262, null],\r\n [33, null],\r\n [319, null],\r\n [13, null],\r\n [295, null],\r\n [263, null],\r\n [291, null],\r\n [311, null],\r\n [307, null],\r\n [313, null],\r\n [282, null],\r\n [298, null],\r\n [304, null],\r\n [278, null],\r\n [318, null],\r\n [322, null],\r\n [5, null],\r\n [6, null],\r\n [47, null],\r\n [17, null],\r\n [24, null],\r\n [305, null],\r\n [306, null],\r\n [323, null],\r\n [289, null],\r\n [1, 'finally'],\r\n [331, null],\r\n [336, null],\r\n [338, null],\r\n [257, null],\r\n [32, null],\r\n [341, null]],\r\nkeywords:\r\n{'False': 33,\r\n 'null': 9,\r\n 'True': 6,\r\n 'and': 47,\r\n 'as': 108,\r\n 'assert': 24,\r\n 'break': 39,\r\n 'class': 13,\r\n 'continue': 40,\r\n 'debugger': 17,\r\n 'def': 4,\r\n 'del': 27,\r\n 'elif': 130,\r\n 'else': 127,\r\n 'except': 113,\r\n 'finally': 168,\r\n 'for': 34,\r\n 'from': 36,\r\n 'global': 26,\r\n 'if': 37,\r\n 'import': 32,\r\n 'in': 83,\r\n 'is': 92,\r\n 'lambda': 14,\r\n 'nonlocal': 18,\r\n 'not': 8,\r\n 'or': 139,\r\n 'pass': 28,\r\n 'print': 16,\r\n 'raise': 5,\r\n 'return': 23,\r\n 'try': 20,\r\n 'while': 21,\r\n 'with': 42,\r\n 'yield': 31},\r\ntokens:\r\n{0: 112,\r\n 1: 25,\r\n 2: 11,\r\n 3: 7,\r\n 4: 2,\r\n 5: 159,\r\n 6: 160,\r\n 7: 35,\r\n 8: 61,\r\n 9: 38,\r\n 10: 64,\r\n 11: 48,\r\n 12: 52,\r\n 13: 146,\r\n 14: 43,\r\n 15: 30,\r\n 16: 15,\r\n 17: 162,\r\n 18: 115,\r\n 19: 45,\r\n 20: 94,\r\n 21: 89,\r\n 22: 50,\r\n 23: 110,\r\n 24: 163,\r\n 25: 12,\r\n 26: 59,\r\n 27: 90,\r\n 28: 88,\r\n 29: 91,\r\n 30: 93,\r\n 31: 22,\r\n 32: 173,\r\n 33: 144,\r\n 34: 142,\r\n 35: 53,\r\n 36: 74,\r\n 37: 78,\r\n 38: 68,\r\n 39: 79,\r\n 40: 69,\r\n 41: 72,\r\n 42: 73,\r\n 43: 75,\r\n 44: 77,\r\n 45: 67,\r\n 46: 71,\r\n 47: 161,\r\n 48: 76,\r\n 49: 41,\r\n 50: 70,\r\n 51: 129,\r\n 52: 19,\r\n 54: 29,\r\n 55: 10},\r\nstart: 256\r\n};\r\n","'use strict';(function(r){function x(){}function y(){}var z=String.fromCharCode,v={}.toString,A=v.call(r.SharedArrayBuffer),B=v(),q=r.Uint8Array,t=q||Array,w=q?ArrayBuffer:t,C=w.isView||function(g){return g&&\"length\"in g},D=v.call(w.prototype);w=y.prototype;var E=r.TextEncoder,a=new (q?Uint16Array:t)(32);x.prototype.decode=function(g){if(!C(g)){var l=v.call(g);if(l!==D&&l!==A&&l!==B)throw TypeError(\"Failed to execute 'decode' on 'TextDecoder': The provided value is not of type '(ArrayBuffer or ArrayBufferView)'\");\ng=q?new t(g):g||[]}for(var f=l=\"\",b=0,c=g.length|0,u=c-32|0,e,d,h=0,p=0,m,k=0,n=-1;b<c;){for(e=b<=u?32:c-b|0;k<e;b=b+1|0,k=k+1|0){d=g[b]&255;switch(d>>4){case 15:m=g[b=b+1|0]&255;if(2!==m>>6||247<d){b=b-1|0;break}h=(d&7)<<6|m&63;p=5;d=256;case 14:m=g[b=b+1|0]&255,h<<=6,h|=(d&15)<<6|m&63,p=2===m>>6?p+4|0:24,d=d+256&768;case 13:case 12:m=g[b=b+1|0]&255,h<<=6,h|=(d&31)<<6|m&63,p=p+7|0,b<c&&2===m>>6&&h>>p&&1114112>h?(d=h,h=h-65536|0,0<=h&&(n=(h>>10)+55296|0,d=(h&1023)+56320|0,31>k?(a[k]=n,k=k+1|0,n=-1):\n(m=n,n=d,d=m))):(d>>=8,b=b-d-1|0,d=65533),h=p=0,e=b<=u?32:c-b|0;default:a[k]=d;continue;case 11:case 10:case 9:case 8:}a[k]=65533}f+=z(a[0],a[1],a[2],a[3],a[4],a[5],a[6],a[7],a[8],a[9],a[10],a[11],a[12],a[13],a[14],a[15],a[16],a[17],a[18],a[19],a[20],a[21],a[22],a[23],a[24],a[25],a[26],a[27],a[28],a[29],a[30],a[31]);32>k&&(f=f.slice(0,k-32|0));if(b<c){if(a[0]=n,k=~n>>>31,n=-1,f.length<l.length)continue}else-1!==n&&(f+=z(n));l+=f;f=\"\"}return l};w.encode=function(g){g=void 0===g?\"\":\"\"+g;var l=g.length|\n0,f=new t((l<<1)+8|0),b,c=0,u=!q;for(b=0;b<l;b=b+1|0,c=c+1|0){var e=g.charCodeAt(b)|0;if(127>=e)f[c]=e;else{if(2047>=e)f[c]=192|e>>6;else{a:{if(55296<=e)if(56319>=e){var d=g.charCodeAt(b=b+1|0)|0;if(56320<=d&&57343>=d){e=(e<<10)+d-56613888|0;if(65535<e){f[c]=240|e>>18;f[c=c+1|0]=128|e>>12&63;f[c=c+1|0]=128|e>>6&63;f[c=c+1|0]=128|e&63;continue}break a}e=65533}else 57343>=e&&(e=65533);!u&&b<<1<c&&b<<1<(c-7|0)&&(u=!0,d=new t(3*l),d.set(f),f=d)}f[c]=224|e>>12;f[c=c+1|0]=128|e>>6&63}f[c=c+1|0]=128|e&63}}return q?\nf.subarray(0,c):f.slice(0,c)};E||(r.TextDecoder=x,r.TextEncoder=y)})(\"\"+void 0==typeof global?\"\"+void 0==typeof self?this:self:global);//AnonyCo\n//# sourceMappingURL=https://cdn.jsdelivr.net/gh/AnonyCo/FastestSmallestTextEncoderDecoder/EncoderDecoderTogether.min.js.map\n","(function(i,_){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=_():\"function\"==typeof define&&define.amd?define(_):(i=i||self,i.JSBI=_())})(this,function(){'use strict';var i=Math.imul,_=Math.clz32,t=Math.abs,e=Math.max,g=Math.floor;class o extends Array{constructor(i,_){if(super(i),this.sign=_,i>o.__kMaxLength)throw new RangeError(\"Maximum BigInt size exceeded\")}static BigInt(i){var _=Number.isFinite;if(\"number\"==typeof i){if(0===i)return o.__zero();if(o.__isOneDigitInt(i))return 0>i?o.__oneDigit(-i,!0):o.__oneDigit(i,!1);if(!_(i)||g(i)!==i)throw new RangeError(\"The number \"+i+\" cannot be converted to BigInt because it is not an integer\");return o.__fromDouble(i)}if(\"string\"==typeof i){const _=o.__fromString(i);if(null===_)throw new SyntaxError(\"Cannot convert \"+i+\" to a BigInt\");return _}if(\"boolean\"==typeof i)return!0===i?o.__oneDigit(1,!1):o.__zero();if(\"object\"==typeof i){if(i.constructor===o)return i;const _=o.__toPrimitive(i);return o.BigInt(_)}throw new TypeError(\"Cannot convert \"+i+\" to a BigInt\")}toDebugString(){const i=[\"BigInt[\"];for(const _ of this)i.push((_?(_>>>0).toString(16):_)+\", \");return i.push(\"]\"),i.join(\"\")}toString(i=10){if(2>i||36<i)throw new RangeError(\"toString() radix argument must be between 2 and 36\");return 0===this.length?\"0\":0==(i&i-1)?o.__toStringBasePowerOfTwo(this,i):o.__toStringGeneric(this,i,!1)}static toNumber(i){const _=i.length;if(0===_)return 0;if(1===_){const _=i.__unsignedDigit(0);return i.sign?-_:_}const t=i.__digit(_-1),e=o.__clz30(t),n=30*_-e;if(1024<n)return i.sign?-Infinity:1/0;let g=n-1,s=t,l=_-1;const r=e+3;let a=32===r?0:s<<r;a>>>=12;const u=r-12;let d=12<=r?0:s<<20+r,h=20+r;for(0<u&&0<l&&(l--,s=i.__digit(l),a|=s>>>30-u,d=s<<u+2,h=u+2);0<h&&0<l;)l--,s=i.__digit(l),d|=30<=h?s<<h-30:s>>>30-h,h-=30;const m=o.__decideRounding(i,h,l,s);if((1===m||0===m&&1==(1&d))&&(d=d+1>>>0,0===d&&(a++,0!=a>>>20&&(a=0,g++,1023<g))))return i.sign?-Infinity:1/0;const b=i.sign?-2147483648:0;return g=g+1023<<20,o.__kBitConversionInts[1]=b|g|a,o.__kBitConversionInts[0]=d,o.__kBitConversionDouble[0]}static unaryMinus(i){if(0===i.length)return i;const _=i.__copy();return _.sign=!i.sign,_}static bitwiseNot(i){return i.sign?o.__absoluteSubOne(i).__trim():o.__absoluteAddOne(i,!0)}static exponentiate(i,_){if(_.sign)throw new RangeError(\"Exponent must be positive\");if(0===_.length)return o.__oneDigit(1,!1);if(0===i.length)return i;if(1===i.length&&1===i.__digit(0))return i.sign&&0==(1&_.__digit(0))?o.unaryMinus(i):i;if(1<_.length)throw new RangeError(\"BigInt too big\");let t=_.__unsignedDigit(0);if(1===t)return i;if(t>=o.__kMaxLengthBits)throw new RangeError(\"BigInt too big\");if(1===i.length&&2===i.__digit(0)){const _=1+(0|t/30),e=i.sign&&0!=(1&t),n=new o(_,e);n.__initializeDigits();const g=1<<t%30;return n.__setDigit(_-1,g),n}let e=null,n=i;for(0!=(1&t)&&(e=i),t>>=1;0!==t;t>>=1)n=o.multiply(n,n),0!=(1&t)&&(null===e?e=n:e=o.multiply(e,n));return e}static multiply(_,t){if(0===_.length)return _;if(0===t.length)return t;let i=_.length+t.length;30<=_.__clzmsd()+t.__clzmsd()&&i--;const e=new o(i,_.sign!==t.sign);e.__initializeDigits();for(let n=0;n<_.length;n++)o.__multiplyAccumulate(t,_.__digit(n),e,n);return e.__trim()}static divide(i,_){if(0===_.length)throw new RangeError(\"Division by zero\");if(0>o.__absoluteCompare(i,_))return o.__zero();const t=i.sign!==_.sign,e=_.__unsignedDigit(0);let n;if(1===_.length&&32767>=e){if(1===e)return t===i.sign?i:o.unaryMinus(i);n=o.__absoluteDivSmall(i,e,null)}else n=o.__absoluteDivLarge(i,_,!0,!1);return n.sign=t,n.__trim()}static remainder(i,_){if(0===_.length)throw new RangeError(\"Division by zero\");if(0>o.__absoluteCompare(i,_))return i;const t=_.__unsignedDigit(0);if(1===_.length&&32767>=t){if(1===t)return o.__zero();const _=o.__absoluteModSmall(i,t);return 0===_?o.__zero():o.__oneDigit(_,i.sign)}const e=o.__absoluteDivLarge(i,_,!1,!0);return e.sign=i.sign,e.__trim()}static add(i,_){const t=i.sign;return t===_.sign?o.__absoluteAdd(i,_,t):0<=o.__absoluteCompare(i,_)?o.__absoluteSub(i,_,t):o.__absoluteSub(_,i,!t)}static subtract(i,_){const t=i.sign;return t===_.sign?0<=o.__absoluteCompare(i,_)?o.__absoluteSub(i,_,t):o.__absoluteSub(_,i,!t):o.__absoluteAdd(i,_,t)}static leftShift(i,_){return 0===_.length||0===i.length?i:_.sign?o.__rightShiftByAbsolute(i,_):o.__leftShiftByAbsolute(i,_)}static signedRightShift(i,_){return 0===_.length||0===i.length?i:_.sign?o.__leftShiftByAbsolute(i,_):o.__rightShiftByAbsolute(i,_)}static unsignedRightShift(){throw new TypeError(\"BigInts have no unsigned right shift; use >> instead\")}static lessThan(i,_){return 0>o.__compareToBigInt(i,_)}static lessThanOrEqual(i,_){return 0>=o.__compareToBigInt(i,_)}static greaterThan(i,_){return 0<o.__compareToBigInt(i,_)}static greaterThanOrEqual(i,_){return 0<=o.__compareToBigInt(i,_)}static equal(_,t){if(_.sign!==t.sign)return!1;if(_.length!==t.length)return!1;for(let e=0;e<_.length;e++)if(_.__digit(e)!==t.__digit(e))return!1;return!0}static notEqual(i,_){return!o.equal(i,_)}static bitwiseAnd(i,_){if(!i.sign&&!_.sign)return o.__absoluteAnd(i,_).__trim();if(i.sign&&_.sign){const t=e(i.length,_.length)+1;let n=o.__absoluteSubOne(i,t);const g=o.__absoluteSubOne(_);return n=o.__absoluteOr(n,g,n),o.__absoluteAddOne(n,!0,n).__trim()}return i.sign&&([i,_]=[_,i]),o.__absoluteAndNot(i,o.__absoluteSubOne(_)).__trim()}static bitwiseXor(i,_){if(!i.sign&&!_.sign)return o.__absoluteXor(i,_).__trim();if(i.sign&&_.sign){const t=e(i.length,_.length),n=o.__absoluteSubOne(i,t),g=o.__absoluteSubOne(_);return o.__absoluteXor(n,g,n).__trim()}const t=e(i.length,_.length)+1;i.sign&&([i,_]=[_,i]);let n=o.__absoluteSubOne(_,t);return n=o.__absoluteXor(n,i,n),o.__absoluteAddOne(n,!0,n).__trim()}static bitwiseOr(i,_){const t=e(i.length,_.length);if(!i.sign&&!_.sign)return o.__absoluteOr(i,_).__trim();if(i.sign&&_.sign){let e=o.__absoluteSubOne(i,t);const n=o.__absoluteSubOne(_);return e=o.__absoluteAnd(e,n,e),o.__absoluteAddOne(e,!0,e).__trim()}i.sign&&([i,_]=[_,i]);let n=o.__absoluteSubOne(_,t);return n=o.__absoluteAndNot(n,i,n),o.__absoluteAddOne(n,!0,n).__trim()}static asIntN(_,t){if(0===t.length)return t;if(_=g(_),0>_)throw new RangeError(\"Invalid value: not (convertible to) a safe integer\");if(0===_)return o.__zero();if(_>=o.__kMaxLengthBits)return t;const e=0|(_+29)/30;if(t.length<e)return t;const s=t.__unsignedDigit(e-1),l=1<<(_-1)%30;if(t.length===e&&s<l)return t;if(!((s&l)===l))return o.__truncateToNBits(_,t);if(!t.sign)return o.__truncateAndSubFromPowerOfTwo(_,t,!0);if(0==(s&l-1)){for(let n=e-2;0<=n;n--)if(0!==t.__digit(n))return o.__truncateAndSubFromPowerOfTwo(_,t,!1);return t.length===e&&s===l?t:o.__truncateToNBits(_,t)}return o.__truncateAndSubFromPowerOfTwo(_,t,!1)}static asUintN(i,_){if(0===_.length)return _;if(i=g(i),0>i)throw new RangeError(\"Invalid value: not (convertible to) a safe integer\");if(0===i)return o.__zero();if(_.sign){if(i>o.__kMaxLengthBits)throw new RangeError(\"BigInt too big\");return o.__truncateAndSubFromPowerOfTwo(i,_,!1)}if(i>=o.__kMaxLengthBits)return _;const t=0|(i+29)/30;if(_.length<t)return _;const e=i%30;if(_.length==t){if(0===e)return _;const i=_.__digit(t-1);if(0==i>>>e)return _}return o.__truncateToNBits(i,_)}static ADD(i,_){if(i=o.__toPrimitive(i),_=o.__toPrimitive(_),\"string\"==typeof i)return\"string\"!=typeof _&&(_=_.toString()),i+_;if(\"string\"==typeof _)return i.toString()+_;if(i=o.__toNumeric(i),_=o.__toNumeric(_),o.__isBigInt(i)&&o.__isBigInt(_))return o.add(i,_);if(\"number\"==typeof i&&\"number\"==typeof _)return i+_;throw new TypeError(\"Cannot mix BigInt and other types, use explicit conversions\")}static LT(i,_){return o.__compare(i,_,0)}static LE(i,_){return o.__compare(i,_,1)}static GT(i,_){return o.__compare(i,_,2)}static GE(i,_){return o.__compare(i,_,3)}static EQ(i,_){for(;;){if(o.__isBigInt(i))return o.__isBigInt(_)?o.equal(i,_):o.EQ(_,i);if(\"number\"==typeof i){if(o.__isBigInt(_))return o.__equalToNumber(_,i);if(\"object\"!=typeof _)return i==_;_=o.__toPrimitive(_)}else if(\"string\"==typeof i){if(o.__isBigInt(_))return i=o.__fromString(i),null!==i&&o.equal(i,_);if(\"object\"!=typeof _)return i==_;_=o.__toPrimitive(_)}else if(\"boolean\"==typeof i){if(o.__isBigInt(_))return o.__equalToNumber(_,+i);if(\"object\"!=typeof _)return i==_;_=o.__toPrimitive(_)}else if(\"symbol\"==typeof i){if(o.__isBigInt(_))return!1;if(\"object\"!=typeof _)return i==_;_=o.__toPrimitive(_)}else if(\"object\"==typeof i){if(\"object\"==typeof _&&_.constructor!==o)return i==_;i=o.__toPrimitive(i)}else return i==_}}static NE(i,_){return!o.EQ(i,_)}static __zero(){return new o(0,!1)}static __oneDigit(i,_){const t=new o(1,_);return t.__setDigit(0,i),t}__copy(){const _=new o(this.length,this.sign);for(let t=0;t<this.length;t++)_[t]=this[t];return _}__trim(){let i=this.length,_=this[i-1];for(;0===_;)i--,_=this[i-1],this.pop();return 0===i&&(this.sign=!1),this}__initializeDigits(){for(let _=0;_<this.length;_++)this[_]=0}static __decideRounding(i,_,t,e){if(0<_)return-1;let n;if(0>_)n=-_-1;else{if(0===t)return-1;t--,e=i.__digit(t),n=29}let g=1<<n;if(0==(e&g))return-1;if(g-=1,0!=(e&g))return 1;for(;0<t;)if(t--,0!==i.__digit(t))return 1;return 0}static __fromDouble(i){o.__kBitConversionDouble[0]=i;const _=2047&o.__kBitConversionInts[1]>>>20,t=_-1023,e=(0|t/30)+1,n=new o(e,0>i);let g=1048575&o.__kBitConversionInts[1]|1048576,s=o.__kBitConversionInts[0];const l=20,r=t%30;let a,u=0;if(20>r){const i=l-r;u=i+32,a=g>>>i,g=g<<32-i|s>>>i,s<<=32-i}else if(20===r)u=32,a=g,g=s,s=0;else{const i=r-l;u=32-i,a=g<<i|s>>>32-i,g=s<<i,s=0}n.__setDigit(e-1,a);for(let _=e-2;0<=_;_--)0<u?(u-=30,a=g>>>2,g=g<<30|s>>>2,s<<=30):a=0,n.__setDigit(_,a);return n.__trim()}static __isWhitespace(i){return!!(13>=i&&9<=i)||(159>=i?32==i:131071>=i?160==i||5760==i:196607>=i?(i&=131071,10>=i||40==i||41==i||47==i||95==i||4096==i):65279==i)}static __fromString(i,_=0){let t=0;const e=i.length;let n=0;if(n===e)return o.__zero();let g=i.charCodeAt(n);for(;o.__isWhitespace(g);){if(++n===e)return o.__zero();g=i.charCodeAt(n)}if(43===g){if(++n===e)return null;g=i.charCodeAt(n),t=1}else if(45===g){if(++n===e)return null;g=i.charCodeAt(n),t=-1}if(0===_){if(_=10,48===g){if(++n===e)return o.__zero();if(g=i.charCodeAt(n),88===g||120===g){if(_=16,++n===e)return null;g=i.charCodeAt(n)}else if(79===g||111===g){if(_=8,++n===e)return null;g=i.charCodeAt(n)}else if(66===g||98===g){if(_=2,++n===e)return null;g=i.charCodeAt(n)}}}else if(16===_&&48===g){if(++n===e)return o.__zero();if(g=i.charCodeAt(n),88===g||120===g){if(++n===e)return null;g=i.charCodeAt(n)}}if(0!=t&&10!==_)return null;for(;48===g;){if(++n===e)return o.__zero();g=i.charCodeAt(n)}const s=e-n;let l=o.__kMaxBitsPerChar[_],r=o.__kBitsPerCharTableMultiplier-1;if(s>1073741824/l)return null;const a=l*s+r>>>o.__kBitsPerCharTableShift,u=new o(0|(a+29)/30,!1),h=10>_?_:10,b=10<_?_-10:0;if(0==(_&_-1)){l>>=o.__kBitsPerCharTableShift;const _=[],t=[];let s=!1;do{let o=0,r=0;for(;;){let _;if(g-48>>>0<h)_=g-48;else if((32|g)-97>>>0<b)_=(32|g)-87;else{s=!0;break}if(r+=l,o=o<<l|_,++n===e){s=!0;break}if(g=i.charCodeAt(n),30<r+l)break}_.push(o),t.push(r)}while(!s);o.__fillFromParts(u,_,t)}else{u.__initializeDigits();let t=!1,s=0;do{let a=0,D=1;for(;;){let o;if(g-48>>>0<h)o=g-48;else if((32|g)-97>>>0<b)o=(32|g)-87;else{t=!0;break}const l=D*_;if(1073741823<l)break;if(D=l,a=a*_+o,s++,++n===e){t=!0;break}g=i.charCodeAt(n)}r=30*o.__kBitsPerCharTableMultiplier-1;const c=0|(l*s+r>>>o.__kBitsPerCharTableShift)/30;u.__inplaceMultiplyAdd(D,a,c)}while(!t)}if(n!==e){if(!o.__isWhitespace(g))return null;for(n++;n<e;n++)if(g=i.charCodeAt(n),!o.__isWhitespace(g))return null}return u.sign=-1==t,u.__trim()}static __fillFromParts(_,t,e){let n=0,g=0,o=0;for(let s=t.length-1;0<=s;s--){const i=t[s],l=e[s];g|=i<<o,o+=l,30===o?(_.__setDigit(n++,g),o=0,g=0):30<o&&(_.__setDigit(n++,1073741823&g),o-=30,g=i>>>l-o)}if(0!==g){if(n>=_.length)throw new Error(\"implementation bug\");_.__setDigit(n++,g)}for(;n<_.length;n++)_.__setDigit(n,0)}static __toStringBasePowerOfTwo(_,i){const t=_.length;let e=i-1;e=(85&e>>>1)+(85&e),e=(51&e>>>2)+(51&e),e=(15&e>>>4)+(15&e);const n=e,g=i-1,s=_.__digit(t-1),l=o.__clz30(s);let r=0|(30*t-l+n-1)/n;if(_.sign&&r++,268435456<r)throw new Error(\"string too long\");const a=Array(r);let u=r-1,d=0,h=0;for(let e=0;e<t-1;e++){const i=_.__digit(e),t=(d|i<<h)&g;a[u--]=o.__kConversionChars[t];const s=n-h;for(d=i>>>s,h=30-s;h>=n;)a[u--]=o.__kConversionChars[d&g],d>>>=n,h-=n}const m=(d|s<<h)&g;for(a[u--]=o.__kConversionChars[m],d=s>>>n-h;0!==d;)a[u--]=o.__kConversionChars[d&g],d>>>=n;if(_.sign&&(a[u--]=\"-\"),-1!=u)throw new Error(\"implementation bug\");return a.join(\"\")}static __toStringGeneric(_,i,t){const e=_.length;if(0===e)return\"\";if(1===e){let e=_.__unsignedDigit(0).toString(i);return!1===t&&_.sign&&(e=\"-\"+e),e}const n=30*e-o.__clz30(_.__digit(e-1)),g=o.__kMaxBitsPerChar[i],s=g-1;let l=n*o.__kBitsPerCharTableMultiplier;l+=s-1,l=0|l/s;const r=l+1>>1,a=o.exponentiate(o.__oneDigit(i,!1),o.__oneDigit(r,!1));let u,d;const h=a.__unsignedDigit(0);if(1===a.length&&32767>=h){u=new o(_.length,!1),u.__initializeDigits();let t=0;for(let e=2*_.length-1;0<=e;e--){const i=t<<15|_.__halfDigit(e);u.__setHalfDigit(e,0|i/h),t=0|i%h}d=t.toString(i)}else{const t=o.__absoluteDivLarge(_,a,!0,!0);u=t.quotient;const e=t.remainder.__trim();d=o.__toStringGeneric(e,i,!0)}u.__trim();let m=o.__toStringGeneric(u,i,!0);for(;d.length<r;)d=\"0\"+d;return!1===t&&_.sign&&(m=\"-\"+m),m+d}static __unequalSign(i){return i?-1:1}static __absoluteGreater(i){return i?-1:1}static __absoluteLess(i){return i?1:-1}static __compareToBigInt(i,_){const t=i.sign;if(t!==_.sign)return o.__unequalSign(t);const e=o.__absoluteCompare(i,_);return 0<e?o.__absoluteGreater(t):0>e?o.__absoluteLess(t):0}static __compareToNumber(i,_){if(o.__isOneDigitInt(_)){const e=i.sign,n=0>_;if(e!==n)return o.__unequalSign(e);if(0===i.length){if(n)throw new Error(\"implementation bug\");return 0===_?0:-1}if(1<i.length)return o.__absoluteGreater(e);const g=t(_),s=i.__unsignedDigit(0);return s>g?o.__absoluteGreater(e):s<g?o.__absoluteLess(e):0}return o.__compareToDouble(i,_)}static __compareToDouble(i,_){if(_!==_)return _;if(_===1/0)return-1;if(_===-Infinity)return 1;const t=i.sign;if(t!==0>_)return o.__unequalSign(t);if(0===_)throw new Error(\"implementation bug: should be handled elsewhere\");if(0===i.length)return-1;o.__kBitConversionDouble[0]=_;const e=2047&o.__kBitConversionInts[1]>>>20;if(2047==e)throw new Error(\"implementation bug: handled elsewhere\");const n=e-1023;if(0>n)return o.__absoluteGreater(t);const g=i.length;let s=i.__digit(g-1);const l=o.__clz30(s),r=30*g-l,a=n+1;if(r<a)return o.__absoluteLess(t);if(r>a)return o.__absoluteGreater(t);let u=1048576|1048575&o.__kBitConversionInts[1],d=o.__kBitConversionInts[0];const h=20,m=29-l;if(m!==(0|(r-1)%30))throw new Error(\"implementation bug\");let b,D=0;if(20>m){const i=h-m;D=i+32,b=u>>>i,u=u<<32-i|d>>>i,d<<=32-i}else if(20===m)D=32,b=u,u=d,d=0;else{const i=m-h;D=32-i,b=u<<i|d>>>32-i,u=d<<i,d=0}if(s>>>=0,b>>>=0,s>b)return o.__absoluteGreater(t);if(s<b)return o.__absoluteLess(t);for(let e=g-2;0<=e;e--){0<D?(D-=30,b=u>>>2,u=u<<30|d>>>2,d<<=30):b=0;const _=i.__unsignedDigit(e);if(_>b)return o.__absoluteGreater(t);if(_<b)return o.__absoluteLess(t)}if(0!==u||0!==d){if(0===D)throw new Error(\"implementation bug\");return o.__absoluteLess(t)}return 0}static __equalToNumber(i,_){return o.__isOneDigitInt(_)?0===_?0===i.length:1===i.length&&i.sign===0>_&&i.__unsignedDigit(0)===t(_):0===o.__compareToDouble(i,_)}static __comparisonResultToBool(i,_){return 0===_?0>i:1===_?0>=i:2===_?0<i:3===_?0<=i:void 0}static __compare(i,_,t){if(i=o.__toPrimitive(i),_=o.__toPrimitive(_),\"string\"==typeof i&&\"string\"==typeof _)switch(t){case 0:return i<_;case 1:return i<=_;case 2:return i>_;case 3:return i>=_;}if(o.__isBigInt(i)&&\"string\"==typeof _)return _=o.__fromString(_),null!==_&&o.__comparisonResultToBool(o.__compareToBigInt(i,_),t);if(\"string\"==typeof i&&o.__isBigInt(_))return i=o.__fromString(i),null!==i&&o.__comparisonResultToBool(o.__compareToBigInt(i,_),t);if(i=o.__toNumeric(i),_=o.__toNumeric(_),o.__isBigInt(i)){if(o.__isBigInt(_))return o.__comparisonResultToBool(o.__compareToBigInt(i,_),t);if(\"number\"!=typeof _)throw new Error(\"implementation bug\");return o.__comparisonResultToBool(o.__compareToNumber(i,_),t)}if(\"number\"!=typeof i)throw new Error(\"implementation bug\");if(o.__isBigInt(_))return o.__comparisonResultToBool(o.__compareToNumber(_,i),2^t);if(\"number\"!=typeof _)throw new Error(\"implementation bug\");return 0===t?i<_:1===t?i<=_:2===t?i>_:3===t?i>=_:void 0}__clzmsd(){return o.__clz30(this.__digit(this.length-1))}static __absoluteAdd(_,t,e){if(_.length<t.length)return o.__absoluteAdd(t,_,e);if(0===_.length)return _;if(0===t.length)return _.sign===e?_:o.unaryMinus(_);let n=_.length;(0===_.__clzmsd()||t.length===_.length&&0===t.__clzmsd())&&n++;const g=new o(n,e);let s=0,l=0;for(;l<t.length;l++){const i=_.__digit(l)+t.__digit(l)+s;s=i>>>30,g.__setDigit(l,1073741823&i)}for(;l<_.length;l++){const i=_.__digit(l)+s;s=i>>>30,g.__setDigit(l,1073741823&i)}return l<g.length&&g.__setDigit(l,s),g.__trim()}static __absoluteSub(_,t,e){if(0===_.length)return _;if(0===t.length)return _.sign===e?_:o.unaryMinus(_);const n=new o(_.length,e);let g=0,s=0;for(;s<t.length;s++){const i=_.__digit(s)-t.__digit(s)-g;g=1&i>>>30,n.__setDigit(s,1073741823&i)}for(;s<_.length;s++){const i=_.__digit(s)-g;g=1&i>>>30,n.__setDigit(s,1073741823&i)}return n.__trim()}static __absoluteAddOne(_,i,t=null){const e=_.length;null===t?t=new o(e,i):t.sign=i;let n=1;for(let g=0;g<e;g++){const i=_.__digit(g)+n;n=i>>>30,t.__setDigit(g,1073741823&i)}return 0!=n&&t.__setDigitGrow(e,1),t}static __absoluteSubOne(_,t){const e=_.length;t=t||e;const n=new o(t,!1);let g=1;for(let o=0;o<e;o++){const i=_.__digit(o)-g;g=1&i>>>30,n.__setDigit(o,1073741823&i)}if(0!=g)throw new Error(\"implementation bug\");for(let g=e;g<t;g++)n.__setDigit(g,0);return n}static __absoluteAnd(_,t,e=null){let n=_.length,g=t.length,s=g;if(n<g){s=n;const i=_,e=n;_=t,n=g,t=i,g=e}let l=s;null===e?e=new o(l,!1):l=e.length;let r=0;for(;r<s;r++)e.__setDigit(r,_.__digit(r)&t.__digit(r));for(;r<l;r++)e.__setDigit(r,0);return e}static __absoluteAndNot(_,t,e=null){const n=_.length,g=t.length;let s=g;n<g&&(s=n);let l=n;null===e?e=new o(l,!1):l=e.length;let r=0;for(;r<s;r++)e.__setDigit(r,_.__digit(r)&~t.__digit(r));for(;r<n;r++)e.__setDigit(r,_.__digit(r));for(;r<l;r++)e.__setDigit(r,0);return e}static __absoluteOr(_,t,e=null){let n=_.length,g=t.length,s=g;if(n<g){s=n;const i=_,e=n;_=t,n=g,t=i,g=e}let l=n;null===e?e=new o(l,!1):l=e.length;let r=0;for(;r<s;r++)e.__setDigit(r,_.__digit(r)|t.__digit(r));for(;r<n;r++)e.__setDigit(r,_.__digit(r));for(;r<l;r++)e.__setDigit(r,0);return e}static __absoluteXor(_,t,e=null){let n=_.length,g=t.length,s=g;if(n<g){s=n;const i=_,e=n;_=t,n=g,t=i,g=e}let l=n;null===e?e=new o(l,!1):l=e.length;let r=0;for(;r<s;r++)e.__setDigit(r,_.__digit(r)^t.__digit(r));for(;r<n;r++)e.__setDigit(r,_.__digit(r));for(;r<l;r++)e.__setDigit(r,0);return e}static __absoluteCompare(_,t){const e=_.length-t.length;if(0!=e)return e;let n=_.length-1;for(;0<=n&&_.__digit(n)===t.__digit(n);)n--;return 0>n?0:_.__unsignedDigit(n)>t.__unsignedDigit(n)?1:-1}static __multiplyAccumulate(_,t,e,n){if(0===t)return;const g=32767&t,s=t>>>15;let l=0,r=0;for(let a,u=0;u<_.length;u++,n++){a=e.__digit(n);const i=_.__digit(u),t=32767&i,d=i>>>15,h=o.__imul(t,g),m=o.__imul(t,s),b=o.__imul(d,g),D=o.__imul(d,s);a+=r+h+l,l=a>>>30,a&=1073741823,a+=((32767&m)<<15)+((32767&b)<<15),l+=a>>>30,r=D+(m>>>15)+(b>>>15),e.__setDigit(n,1073741823&a)}for(;0!=l||0!==r;n++){let i=e.__digit(n);i+=l+r,r=0,l=i>>>30,e.__setDigit(n,1073741823&i)}}static __internalMultiplyAdd(_,t,e,g,s){let l=e,a=0;for(let n=0;n<g;n++){const i=_.__digit(n),e=o.__imul(32767&i,t),g=o.__imul(i>>>15,t),u=e+((32767&g)<<15)+a+l;l=u>>>30,a=g>>>15,s.__setDigit(n,1073741823&u)}if(s.length>g)for(s.__setDigit(g++,l+a);g<s.length;)s.__setDigit(g++,0);else if(0!==l+a)throw new Error(\"implementation bug\")}__inplaceMultiplyAdd(i,_,t){t>this.length&&(t=this.length);const e=32767&i,n=i>>>15;let g=0,s=_;for(let l=0;l<t;l++){const i=this.__digit(l),_=32767&i,t=i>>>15,r=o.__imul(_,e),a=o.__imul(_,n),u=o.__imul(t,e),d=o.__imul(t,n);let h=s+r+g;g=h>>>30,h&=1073741823,h+=((32767&a)<<15)+((32767&u)<<15),g+=h>>>30,s=d+(a>>>15)+(u>>>15),this.__setDigit(l,1073741823&h)}if(0!=g||0!==s)throw new Error(\"implementation bug\")}static __absoluteDivSmall(_,t,e=null){null===e&&(e=new o(_.length,!1));let n=0;for(let g,o=2*_.length-1;0<=o;o-=2){g=(n<<15|_.__halfDigit(o))>>>0;const i=0|g/t;n=0|g%t,g=(n<<15|_.__halfDigit(o-1))>>>0;const s=0|g/t;n=0|g%t,e.__setDigit(o>>>1,i<<15|s)}return e}static __absoluteModSmall(_,t){let e=0;for(let n=2*_.length-1;0<=n;n--){const i=(e<<15|_.__halfDigit(n))>>>0;e=0|i%t}return e}static __absoluteDivLarge(i,_,t,e){const g=_.__halfDigitLength(),n=_.length,s=i.__halfDigitLength()-g;let l=null;t&&(l=new o(s+2>>>1,!1),l.__initializeDigits());const r=new o(g+2>>>1,!1);r.__initializeDigits();const a=o.__clz15(_.__halfDigit(g-1));0<a&&(_=o.__specialLeftShift(_,a,0));const d=o.__specialLeftShift(i,a,1),u=_.__halfDigit(g-1);let h=0;for(let a,m=s;0<=m;m--){a=32767;const i=d.__halfDigit(m+g);if(i!==u){const t=(i<<15|d.__halfDigit(m+g-1))>>>0;a=0|t/u;let e=0|t%u;const n=_.__halfDigit(g-2),s=d.__halfDigit(m+g-2);for(;o.__imul(a,n)>>>0>(e<<16|s)>>>0&&(a--,e+=u,!(32767<e)););}o.__internalMultiplyAdd(_,a,0,n,r);let e=d.__inplaceSub(r,m,g+1);0!==e&&(e=d.__inplaceAdd(_,m,g),d.__setHalfDigit(m+g,32767&d.__halfDigit(m+g)+e),a--),t&&(1&m?h=a<<15:l.__setDigit(m>>>1,h|a))}if(e)return d.__inplaceRightShift(a),t?{quotient:l,remainder:d}:d;if(t)return l;throw new Error(\"unreachable\")}static __clz15(i){return o.__clz30(i)-15}__inplaceAdd(_,t,e){let n=0;for(let g=0;g<e;g++){const i=this.__halfDigit(t+g)+_.__halfDigit(g)+n;n=i>>>15,this.__setHalfDigit(t+g,32767&i)}return n}__inplaceSub(_,t,e){let n=0;if(1&t){t>>=1;let g=this.__digit(t),o=32767&g,s=0;for(;s<e-1>>>1;s++){const i=_.__digit(s),e=(g>>>15)-(32767&i)-n;n=1&e>>>15,this.__setDigit(t+s,(32767&e)<<15|32767&o),g=this.__digit(t+s+1),o=(32767&g)-(i>>>15)-n,n=1&o>>>15}const i=_.__digit(s),l=(g>>>15)-(32767&i)-n;n=1&l>>>15,this.__setDigit(t+s,(32767&l)<<15|32767&o);if(t+s+1>=this.length)throw new RangeError(\"out of bounds\");0==(1&e)&&(g=this.__digit(t+s+1),o=(32767&g)-(i>>>15)-n,n=1&o>>>15,this.__setDigit(t+_.length,1073709056&g|32767&o))}else{t>>=1;let g=0;for(;g<_.length-1;g++){const i=this.__digit(t+g),e=_.__digit(g),o=(32767&i)-(32767&e)-n;n=1&o>>>15;const s=(i>>>15)-(e>>>15)-n;n=1&s>>>15,this.__setDigit(t+g,(32767&s)<<15|32767&o)}const i=this.__digit(t+g),o=_.__digit(g),s=(32767&i)-(32767&o)-n;n=1&s>>>15;let l=0;0==(1&e)&&(l=(i>>>15)-(o>>>15)-n,n=1&l>>>15),this.__setDigit(t+g,(32767&l)<<15|32767&s)}return n}__inplaceRightShift(_){if(0===_)return;let t=this.__digit(0)>>>_;const e=this.length-1;for(let n=0;n<e;n++){const i=this.__digit(n+1);this.__setDigit(n,1073741823&i<<30-_|t),t=i>>>_}this.__setDigit(e,t)}static __specialLeftShift(_,t,e){const g=_.length,n=new o(g+e,!1);if(0===t){for(let t=0;t<g;t++)n.__setDigit(t,_.__digit(t));return 0<e&&n.__setDigit(g,0),n}let s=0;for(let o=0;o<g;o++){const i=_.__digit(o);n.__setDigit(o,1073741823&i<<t|s),s=i>>>30-t}return 0<e&&n.__setDigit(g,s),n}static __leftShiftByAbsolute(_,i){const t=o.__toShiftAmount(i);if(0>t)throw new RangeError(\"BigInt too big\");const e=0|t/30,n=t%30,g=_.length,s=0!==n&&0!=_.__digit(g-1)>>>30-n,l=g+e+(s?1:0),r=new o(l,_.sign);if(0===n){let t=0;for(;t<e;t++)r.__setDigit(t,0);for(;t<l;t++)r.__setDigit(t,_.__digit(t-e))}else{let t=0;for(let _=0;_<e;_++)r.__setDigit(_,0);for(let o=0;o<g;o++){const i=_.__digit(o);r.__setDigit(o+e,1073741823&i<<n|t),t=i>>>30-n}if(s)r.__setDigit(g+e,t);else if(0!==t)throw new Error(\"implementation bug\")}return r.__trim()}static __rightShiftByAbsolute(_,i){const t=_.length,e=_.sign,n=o.__toShiftAmount(i);if(0>n)return o.__rightShiftByMaximum(e);const g=0|n/30,s=n%30;let l=t-g;if(0>=l)return o.__rightShiftByMaximum(e);let r=!1;if(e){if(0!=(_.__digit(g)&(1<<s)-1))r=!0;else for(let t=0;t<g;t++)if(0!==_.__digit(t)){r=!0;break}}if(r&&0===s){const i=_.__digit(t-1);0==~i&&l++}let a=new o(l,e);if(0===s){a.__setDigit(l-1,0);for(let e=g;e<t;e++)a.__setDigit(e-g,_.__digit(e))}else{let e=_.__digit(g)>>>s;const n=t-g-1;for(let t=0;t<n;t++){const i=_.__digit(t+g+1);a.__setDigit(t,1073741823&i<<30-s|e),e=i>>>s}a.__setDigit(n,e)}return r&&(a=o.__absoluteAddOne(a,!0,a)),a.__trim()}static __rightShiftByMaximum(i){return i?o.__oneDigit(1,!0):o.__zero()}static __toShiftAmount(i){if(1<i.length)return-1;const _=i.__unsignedDigit(0);return _>o.__kMaxLengthBits?-1:_}static __toPrimitive(i,_=\"default\"){if(\"object\"!=typeof i)return i;if(i.constructor===o)return i;if(\"undefined\"!=typeof Symbol&&\"symbol\"==typeof Symbol.toPrimitive){const t=i[Symbol.toPrimitive];if(t){const i=t(_);if(\"object\"!=typeof i)return i;throw new TypeError(\"Cannot convert object to primitive value\")}}const t=i.valueOf;if(t){const _=t.call(i);if(\"object\"!=typeof _)return _}const e=i.toString;if(e){const _=e.call(i);if(\"object\"!=typeof _)return _}throw new TypeError(\"Cannot convert object to primitive value\")}static __toNumeric(i){return o.__isBigInt(i)?i:+i}static __isBigInt(i){return\"object\"==typeof i&&null!==i&&i.constructor===o}static __truncateToNBits(i,_){const t=0|(i+29)/30,e=new o(t,_.sign),n=t-1;for(let t=0;t<n;t++)e.__setDigit(t,_.__digit(t));let g=_.__digit(n);if(0!=i%30){const _=32-i%30;g=g<<_>>>_}return e.__setDigit(n,g),e.__trim()}static __truncateAndSubFromPowerOfTwo(_,t,e){var n=Math.min;const g=0|(_+29)/30,s=new o(g,e);let l=0;const r=g-1;let a=0;for(const i=n(r,t.length);l<i;l++){const i=0-t.__digit(l)-a;a=1&i>>>30,s.__setDigit(l,1073741823&i)}for(;l<r;l++)s.__setDigit(l,0|1073741823&-a);let u=r<t.length?t.__digit(r):0;const d=_%30;let h;if(0==d)h=0-u-a,h&=1073741823;else{const i=32-d;u=u<<i>>>i;const _=1<<32-i;h=_-u-a,h&=_-1}return s.__setDigit(r,h),s.__trim()}__digit(_){return this[_]}__unsignedDigit(_){return this[_]>>>0}__setDigit(_,i){this[_]=0|i}__setDigitGrow(_,i){this[_]=0|i}__halfDigitLength(){const i=this.length;return 32767>=this.__unsignedDigit(i-1)?2*i-1:2*i}__halfDigit(_){return 32767&this[_>>>1]>>>15*(1&_)}__setHalfDigit(_,i){const t=_>>>1,e=this.__digit(t),n=1&_?32767&e|i<<15:1073709056&e|32767&i;this.__setDigit(t,n)}static __digitPow(i,_){let t=1;for(;0<_;)1&_&&(t*=i),_>>>=1,i*=i;return t}static __isOneDigitInt(i){return(1073741823&i)===i}}return o.__kMaxLength=33554432,o.__kMaxLengthBits=o.__kMaxLength<<5,o.__kMaxBitsPerChar=[0,0,32,51,64,75,83,90,96,102,107,111,115,119,122,126,128,131,134,136,139,141,143,145,147,149,151,153,154,156,158,159,160,162,163,165,166],o.__kBitsPerCharTableShift=5,o.__kBitsPerCharTableMultiplier=1<<o.__kBitsPerCharTableShift,o.__kConversionChars=[\"0\",\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\",\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\",\"i\",\"j\",\"k\",\"l\",\"m\",\"n\",\"o\",\"p\",\"q\",\"r\",\"s\",\"t\",\"u\",\"v\",\"w\",\"x\",\"y\",\"z\"],o.__kBitConversionBuffer=new ArrayBuffer(8),o.__kBitConversionDouble=new Float64Array(o.__kBitConversionBuffer),o.__kBitConversionInts=new Int32Array(o.__kBitConversionBuffer),o.__clz30=_?function(i){return _(i)-2}:function(i){var _=Math.LN2,t=Math.log;return 0===i?30:0|29-(0|t(i>>>0)/_)},o.__imul=i||function(i,_){return 0|i*_},o});\n//# sourceMappingURL=jsbi-umd.js.map\n","// shim for using process in browser\nvar process = module.exports = {};\n\n// cached from whatever global is present so that test runners that stub it\n// don't break things.  But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals.  It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n    throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout () {\n    throw new Error('clearTimeout has not been defined');\n}\n(function () {\n    try {\n        if (typeof setTimeout === 'function') {\n            cachedSetTimeout = setTimeout;\n        } else {\n            cachedSetTimeout = defaultSetTimout;\n        }\n    } catch (e) {\n        cachedSetTimeout = defaultSetTimout;\n    }\n    try {\n        if (typeof clearTimeout === 'function') {\n            cachedClearTimeout = clearTimeout;\n        } else {\n            cachedClearTimeout = defaultClearTimeout;\n        }\n    } catch (e) {\n        cachedClearTimeout = defaultClearTimeout;\n    }\n} ())\nfunction runTimeout(fun) {\n    if (cachedSetTimeout === setTimeout) {\n        //normal enviroments in sane situations\n        return setTimeout(fun, 0);\n    }\n    // if setTimeout wasn't available but was latter defined\n    if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {\n        cachedSetTimeout = setTimeout;\n        return setTimeout(fun, 0);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedSetTimeout(fun, 0);\n    } catch(e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n            return cachedSetTimeout.call(null, fun, 0);\n        } catch(e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n            return cachedSetTimeout.call(this, fun, 0);\n        }\n    }\n\n\n}\nfunction runClearTimeout(marker) {\n    if (cachedClearTimeout === clearTimeout) {\n        //normal enviroments in sane situations\n        return clearTimeout(marker);\n    }\n    // if clearTimeout wasn't available but was latter defined\n    if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {\n        cachedClearTimeout = clearTimeout;\n        return clearTimeout(marker);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedClearTimeout(marker);\n    } catch (e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't  trust the global object when called normally\n            return cachedClearTimeout.call(null, marker);\n        } catch (e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n            // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n            return cachedClearTimeout.call(this, marker);\n        }\n    }\n\n\n\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n    if (!draining || !currentQueue) {\n        return;\n    }\n    draining = false;\n    if (currentQueue.length) {\n        queue = currentQueue.concat(queue);\n    } else {\n        queueIndex = -1;\n    }\n    if (queue.length) {\n        drainQueue();\n    }\n}\n\nfunction drainQueue() {\n    if (draining) {\n        return;\n    }\n    var timeout = runTimeout(cleanUpNextTick);\n    draining = true;\n\n    var len = queue.length;\n    while(len) {\n        currentQueue = queue;\n        queue = [];\n        while (++queueIndex < len) {\n            if (currentQueue) {\n                currentQueue[queueIndex].run();\n            }\n        }\n        queueIndex = -1;\n        len = queue.length;\n    }\n    currentQueue = null;\n    draining = false;\n    runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n    var args = new Array(arguments.length - 1);\n    if (arguments.length > 1) {\n        for (var i = 1; i < arguments.length; i++) {\n            args[i - 1] = arguments[i];\n        }\n    }\n    queue.push(new Item(fun, args));\n    if (queue.length === 1 && !draining) {\n        runTimeout(drainQueue);\n    }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n    this.fun = fun;\n    this.array = array;\n}\nItem.prototype.run = function () {\n    this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\n\nprocess.listeners = function (name) { return [] }\n\nprocess.binding = function (name) {\n    throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n    throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n","(function (global, undefined) {\n    \"use strict\";\n\n    if (global.setImmediate) {\n        return;\n    }\n\n    var nextHandle = 1; // Spec says greater than zero\n    var tasksByHandle = {};\n    var currentlyRunningATask = false;\n    var doc = global.document;\n    var registerImmediate;\n\n    function setImmediate(callback) {\n      // Callback can either be a function or a string\n      if (typeof callback !== \"function\") {\n        callback = new Function(\"\" + callback);\n      }\n      // Copy function arguments\n      var args = new Array(arguments.length - 1);\n      for (var i = 0; i < args.length; i++) {\n          args[i] = arguments[i + 1];\n      }\n      // Store and register the task\n      var task = { callback: callback, args: args };\n      tasksByHandle[nextHandle] = task;\n      registerImmediate(nextHandle);\n      return nextHandle++;\n    }\n\n    function clearImmediate(handle) {\n        delete tasksByHandle[handle];\n    }\n\n    function run(task) {\n        var callback = task.callback;\n        var args = task.args;\n        switch (args.length) {\n        case 0:\n            callback();\n            break;\n        case 1:\n            callback(args[0]);\n            break;\n        case 2:\n            callback(args[0], args[1]);\n            break;\n        case 3:\n            callback(args[0], args[1], args[2]);\n            break;\n        default:\n            callback.apply(undefined, args);\n            break;\n        }\n    }\n\n    function runIfPresent(handle) {\n        // From the spec: \"Wait until any invocations of this algorithm started before this one have completed.\"\n        // So if we're currently running a task, we'll need to delay this invocation.\n        if (currentlyRunningATask) {\n            // Delay by doing a setTimeout. setImmediate was tried instead, but in Firefox 7 it generated a\n            // \"too much recursion\" error.\n            setTimeout(runIfPresent, 0, handle);\n        } else {\n            var task = tasksByHandle[handle];\n            if (task) {\n                currentlyRunningATask = true;\n                try {\n                    run(task);\n                } finally {\n                    clearImmediate(handle);\n                    currentlyRunningATask = false;\n                }\n            }\n        }\n    }\n\n    function installNextTickImplementation() {\n        registerImmediate = function(handle) {\n            process.nextTick(function () { runIfPresent(handle); });\n        };\n    }\n\n    function canUsePostMessage() {\n        // The test against `importScripts` prevents this implementation from being installed inside a web worker,\n        // where `global.postMessage` means something completely different and can't be used for this purpose.\n        if (global.postMessage && !global.importScripts) {\n            var postMessageIsAsynchronous = true;\n            var oldOnMessage = global.onmessage;\n            global.onmessage = function() {\n                postMessageIsAsynchronous = false;\n            };\n            global.postMessage(\"\", \"*\");\n            global.onmessage = oldOnMessage;\n            return postMessageIsAsynchronous;\n        }\n    }\n\n    function installPostMessageImplementation() {\n        // Installs an event handler on `global` for the `message` event: see\n        // * https://developer.mozilla.org/en/DOM/window.postMessage\n        // * http://www.whatwg.org/specs/web-apps/current-work/multipage/comms.html#crossDocumentMessages\n\n        var messagePrefix = \"setImmediate$\" + Math.random() + \"$\";\n        var onGlobalMessage = function(event) {\n            if (event.source === global &&\n                typeof event.data === \"string\" &&\n                event.data.indexOf(messagePrefix) === 0) {\n                runIfPresent(+event.data.slice(messagePrefix.length));\n            }\n        };\n\n        if (global.addEventListener) {\n            global.addEventListener(\"message\", onGlobalMessage, false);\n        } else {\n            global.attachEvent(\"onmessage\", onGlobalMessage);\n        }\n\n        registerImmediate = function(handle) {\n            global.postMessage(messagePrefix + handle, \"*\");\n        };\n    }\n\n    function installMessageChannelImplementation() {\n        var channel = new MessageChannel();\n        channel.port1.onmessage = function(event) {\n            var handle = event.data;\n            runIfPresent(handle);\n        };\n\n        registerImmediate = function(handle) {\n            channel.port2.postMessage(handle);\n        };\n    }\n\n    function installReadyStateChangeImplementation() {\n        var html = doc.documentElement;\n        registerImmediate = function(handle) {\n            // Create a <script> element; its readystatechange event will be fired asynchronously once it is inserted\n            // into the document. Do so, thus queuing up the task. Remember to clean up once it's been called.\n            var script = doc.createElement(\"script\");\n            script.onreadystatechange = function () {\n                runIfPresent(handle);\n                script.onreadystatechange = null;\n                html.removeChild(script);\n                script = null;\n            };\n            html.appendChild(script);\n        };\n    }\n\n    function installSetTimeoutImplementation() {\n        registerImmediate = function(handle) {\n            setTimeout(runIfPresent, 0, handle);\n        };\n    }\n\n    // If supported, we should attach to the prototype of global, since that is where setTimeout et al. live.\n    var attachTo = Object.getPrototypeOf && Object.getPrototypeOf(global);\n    attachTo = attachTo && attachTo.setTimeout ? attachTo : global;\n\n    // Don't get fooled by e.g. browserify environments.\n    if ({}.toString.call(global.process) === \"[object process]\") {\n        // For Node.js before 0.9\n        installNextTickImplementation();\n\n    } else if (canUsePostMessage()) {\n        // For non-IE10 modern browsers\n        installPostMessageImplementation();\n\n    } else if (global.MessageChannel) {\n        // For web workers, where supported\n        installMessageChannelImplementation();\n\n    } else if (doc && \"onreadystatechange\" in doc.createElement(\"script\")) {\n        // For IE 6–8\n        installReadyStateChangeImplementation();\n\n    } else {\n        // For older browsers\n        installSetTimeoutImplementation();\n    }\n\n    attachTo.setImmediate = setImmediate;\n    attachTo.clearImmediate = clearImmediate;\n}(typeof self === \"undefined\" ? typeof global === \"undefined\" ? this : global : self));\n","//\n// strftime\n// github.com/samsonjs/strftime\n// @_sjs\n//\n// Copyright 2010 - 2021 Sami Samhuri <sami@samhuri.net>\n//\n// MIT License\n// http://sjs.mit-license.org\n//\n\n; (function () {\n\n    var Locales = {\n        de_DE: {\n            identifier: 'de-DE',\n            days: ['Sonntag', 'Montag', 'Dienstag', 'Mittwoch', 'Donnerstag', 'Freitag', 'Samstag'],\n            shortDays: ['So', 'Mo', 'Di', 'Mi', 'Do', 'Fr', 'Sa'],\n            months: ['Januar', 'Februar', 'März', 'April', 'Mai', 'Juni', 'Juli', 'August', 'September', 'Oktober', 'November', 'Dezember'],\n            shortMonths: ['Jan', 'Feb', 'Mär', 'Apr', 'Mai', 'Jun', 'Jul', 'Aug', 'Sep', 'Okt', 'Nov', 'Dez'],\n            AM: 'AM',\n            PM: 'PM',\n            am: 'am',\n            pm: 'pm',\n            formats: {\n                c: '%a %d %b %Y %X %Z',\n                D: '%d.%m.%Y',\n                F: '%Y-%m-%d',\n                R: '%H:%M',\n                r: '%I:%M:%S %p',\n                T: '%H:%M:%S',\n                v: '%e-%b-%Y',\n                X: '%T',\n                x: '%D'\n            }\n        },\n\n        en_CA: {\n            identifier: 'en-CA',\n            days: ['Sunday', 'Monday', 'Tuesday', 'Wednesday', 'Thursday', 'Friday', 'Saturday'],\n            shortDays: ['Sun', 'Mon', 'Tue', 'Wed', 'Thu', 'Fri', 'Sat'],\n            months: ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December'],\n            shortMonths: ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep', 'Oct', 'Nov', 'Dec'],\n            ordinalSuffixes: [\n                'st', 'nd', 'rd', 'th', 'th', 'th', 'th', 'th', 'th', 'th',\n                'th', 'th', 'th', 'th', 'th', 'th', 'th', 'th', 'th', 'th',\n                'st', 'nd', 'rd', 'th', 'th', 'th', 'th', 'th', 'th', 'th',\n                'st'\n            ],\n            AM: 'AM',\n            PM: 'PM',\n            am: 'am',\n            pm: 'pm',\n            formats: {\n                c: '%a %d %b %Y %X %Z',\n                D: '%d/%m/%y',\n                F: '%Y-%m-%d',\n                R: '%H:%M',\n                r: '%I:%M:%S %p',\n                T: '%H:%M:%S',\n                v: '%e-%b-%Y',\n                X: '%r',\n                x: '%D'\n            }\n        },\n\n        en_US: {\n            identifier: 'en-US',\n            days: ['Sunday', 'Monday', 'Tuesday', 'Wednesday', 'Thursday', 'Friday', 'Saturday'],\n            shortDays: ['Sun', 'Mon', 'Tue', 'Wed', 'Thu', 'Fri', 'Sat'],\n            months: ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December'],\n            shortMonths: ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep', 'Oct', 'Nov', 'Dec'],\n            ordinalSuffixes: [\n                'st', 'nd', 'rd', 'th', 'th', 'th', 'th', 'th', 'th', 'th',\n                'th', 'th', 'th', 'th', 'th', 'th', 'th', 'th', 'th', 'th',\n                'st', 'nd', 'rd', 'th', 'th', 'th', 'th', 'th', 'th', 'th',\n                'st'\n            ],\n            AM: 'AM',\n            PM: 'PM',\n            am: 'am',\n            pm: 'pm',\n            formats: {\n                c: '%a %d %b %Y %X %Z',\n                D: '%m/%d/%y',\n                F: '%Y-%m-%d',\n                R: '%H:%M',\n                r: '%I:%M:%S %p',\n                T: '%H:%M:%S',\n                v: '%e-%b-%Y',\n                X: '%r',\n                x: '%D'\n            }\n        },\n\n        es_MX: {\n            identifier: 'es-MX',\n            days: ['domingo', 'lunes', 'martes', 'miércoles', 'jueves', 'viernes', 'sábado'],\n            shortDays: ['dom', 'lun', 'mar', 'mié', 'jue', 'vie', 'sáb'],\n            months: ['enero', 'febrero', 'marzo', 'abril', 'mayo', 'junio', 'julio', 'agosto', 'septiembre', 'octubre', 'noviembre', 'diciembre'],\n            shortMonths: ['ene', 'feb', 'mar', 'abr', 'may', 'jun', 'jul', 'ago', 'sep', 'oct', 'nov', 'dic'],\n            AM: 'AM',\n            PM: 'PM',\n            am: 'am',\n            pm: 'pm',\n            formats: {\n                c: '%a %d %b %Y %X %Z',\n                D: '%d/%m/%Y',\n                F: '%Y-%m-%d',\n                R: '%H:%M',\n                r: '%I:%M:%S %p',\n                T: '%H:%M:%S',\n                v: '%e-%b-%Y',\n                X: '%T',\n                x: '%D'\n            }\n        },\n\n        fr_FR: {\n            identifier: 'fr-FR',\n            days: ['dimanche', 'lundi', 'mardi', 'mercredi', 'jeudi', 'vendredi', 'samedi'],\n            shortDays: ['dim.', 'lun.', 'mar.', 'mer.', 'jeu.', 'ven.', 'sam.'],\n            months: ['janvier', 'février', 'mars', 'avril', 'mai', 'juin', 'juillet', 'août', 'septembre', 'octobre', 'novembre', 'décembre'],\n            shortMonths: ['janv.', 'févr.', 'mars', 'avril', 'mai', 'juin', 'juil.', 'août', 'sept.', 'oct.', 'nov.', 'déc.'],\n            AM: 'AM',\n            PM: 'PM',\n            am: 'am',\n            pm: 'pm',\n            formats: {\n                c: '%a %d %b %Y %X %Z',\n                D: '%d/%m/%Y',\n                F: '%Y-%m-%d',\n                R: '%H:%M',\n                r: '%I:%M:%S %p',\n                T: '%H:%M:%S',\n                v: '%e-%b-%Y',\n                X: '%T',\n                x: '%D'\n            }\n        },\n\n        it_IT: {\n            identifier: 'it-IT',\n            days: ['domenica', 'lunedì', 'martedì', 'mercoledì', 'giovedì', 'venerdì', 'sabato'],\n            shortDays: ['dom', 'lun', 'mar', 'mer', 'gio', 'ven', 'sab'],\n            months: ['gennaio', 'febbraio', 'marzo', 'aprile', 'maggio', 'giugno', 'luglio', 'agosto', 'settembre', 'ottobre', 'novembre', 'dicembre'],\n            shortMonths: ['gen', 'feb', 'mar', 'apr', 'mag', 'giu', 'lug', 'ago', 'set', 'ott', 'nov', 'dic'],\n            AM: 'AM',\n            PM: 'PM',\n            am: 'am',\n            pm: 'pm',\n            formats: {\n                c: '%a %d %b %Y %X %Z',\n                D: '%d/%m/%Y',\n                F: '%Y-%m-%d',\n                R: '%H:%M',\n                r: '%I:%M:%S %p',\n                T: '%H:%M:%S',\n                v: '%e-%b-%Y',\n                X: '%T',\n                x: '%D'\n            }\n        },\n\n        nl_NL: {\n            identifier: 'nl-NL',\n            days: ['zondag', 'maandag', 'dinsdag', 'woensdag', 'donderdag', 'vrijdag', 'zaterdag'],\n            shortDays: ['zo', 'ma', 'di', 'wo', 'do', 'vr', 'za'],\n            months: ['januari', 'februari', 'maart', 'april', 'mei', 'juni', 'juli', 'augustus', 'september', 'oktober', 'november', 'december'],\n            shortMonths: ['jan', 'feb', 'mrt', 'apr', 'mei', 'jun', 'jul', 'aug', 'sep', 'okt', 'nov', 'dec'],\n            AM: 'AM',\n            PM: 'PM',\n            am: 'am',\n            pm: 'pm',\n            formats: {\n                c: '%a %d %b %Y %X %Z',\n                D: '%d-%m-%y',\n                F: '%Y-%m-%d',\n                R: '%H:%M',\n                r: '%I:%M:%S %p',\n                T: '%H:%M:%S',\n                v: '%e-%b-%Y',\n                X: '%T',\n                x: '%D'\n            }\n        },\n\n        pt_BR: {\n            identifier: 'pt-BR',\n            days: ['domingo', 'segunda', 'terça', 'quarta', 'quinta', 'sexta', 'sábado'],\n            shortDays: ['Dom', 'Seg', 'Ter', 'Qua', 'Qui', 'Sex', 'Sáb'],\n            months: ['janeiro', 'fevereiro', 'março', 'abril', 'maio', 'junho', 'julho', 'agosto', 'setembro', 'outubro', 'novembro', 'dezembro'],\n            shortMonths: ['Jan', 'Fev', 'Mar', 'Abr', 'Mai', 'Jun', 'Jul', 'Ago', 'Set', 'Out', 'Nov', 'Dez'],\n            AM: 'AM',\n            PM: 'PM',\n            am: 'am',\n            pm: 'pm',\n            formats: {\n                c: '%a %d %b %Y %X %Z',\n                D: '%d-%m-%Y',\n                F: '%Y-%m-%d',\n                R: '%H:%M',\n                r: '%I:%M:%S %p',\n                T: '%H:%M:%S',\n                v: '%e-%b-%Y',\n                X: '%T',\n                x: '%D'\n            }\n        },\n\n        ru_RU: {\n            identifier: 'ru-RU',\n            days: ['Воскресенье', 'Понедельник', 'Вторник', 'Среда', 'Четверг', 'Пятница', 'Суббота'],\n            shortDays: ['Вс', 'Пн', 'Вт', 'Ср', 'Чт', 'Пт', 'Сб'],\n            months: ['Январь', 'Февраль', 'Март', 'Апрель', 'Май', 'Июнь', 'Июль', 'Август', 'Сентябрь', 'Октябрь', 'Ноябрь', 'Декабрь'],\n            shortMonths: ['янв', 'фев', 'мар', 'апр', 'май', 'июн', 'июл', 'авг', 'сен', 'окт', 'ноя', 'дек'],\n            AM: 'AM',\n            PM: 'PM',\n            am: 'am',\n            pm: 'pm',\n            formats: {\n                c: '%a %d %b %Y %X',\n                D: '%d.%m.%y',\n                F: '%Y-%m-%d',\n                R: '%H:%M',\n                r: '%I:%M:%S %p',\n                T: '%H:%M:%S',\n                v: '%e-%b-%Y',\n                X: '%T',\n                x: '%D'\n            }\n        },\n\n        tr_TR: {\n            identifier: 'tr-TR',\n            days: ['Pazar', 'Pazartesi', 'Salı', 'Çarşamba', 'Perşembe', 'Cuma', 'Cumartesi'],\n            shortDays: ['Paz', 'Pzt', 'Sal', 'Çrş', 'Prş', 'Cum', 'Cts'],\n            months: ['Ocak', 'Şubat', 'Mart', 'Nisan', 'Mayıs', 'Haziran', 'Temmuz', 'Ağustos', 'Eylül', 'Ekim', 'Kasım', 'Aralık'],\n            shortMonths: ['Oca', 'Şub', 'Mar', 'Nis', 'May', 'Haz', 'Tem', 'Ağu', 'Eyl', 'Eki', 'Kas', 'Ara'],\n            AM: 'ÖÖ',\n            PM: 'ÖS',\n            am: 'ÖÖ',\n            pm: 'ÖS',\n            formats: {\n                c: '%a %d %b %Y %X %Z',\n                D: '%d-%m-%Y',\n                F: '%Y-%m-%d',\n                R: '%H:%M',\n                r: '%I:%M:%S %p',\n                T: '%H:%M:%S',\n                v: '%e-%b-%Y',\n                X: '%T',\n                x: '%D'\n            }\n        },\n\n        // By michaeljayt<michaeljayt@gmail.com>\n        // https://github.com/michaeljayt/strftime/commit/bcb4c12743811d51e568175aa7bff3fd2a77cef3\n        zh_CN: {\n            identifier: 'zh-CN',\n            days: ['星期日', '星期一', '星期二', '星期三', '星期四', '星期五', '星期六'],\n            shortDays: ['日', '一', '二', '三', '四', '五', '六'],\n            months: ['一月', '二月', '三月', '四月', '五月', '六月', '七月', '八月', '九月', '十月', '十一月', '十二月'],\n            shortMonths: ['一月', '二月', '三月', '四月', '五月', '六月', '七月', '八月', '九月', '十月', '十一月', '十二月'],\n            AM: '上午',\n            PM: '下午',\n            am: '上午',\n            pm: '下午',\n            formats: {\n                c: '%a %d %b %Y %X %Z',\n                D: '%d/%m/%y',\n                F: '%Y-%m-%d',\n                R: '%H:%M',\n                r: '%I:%M:%S %p',\n                T: '%H:%M:%S',\n                v: '%e-%b-%Y',\n                X: '%r',\n                x: '%D'\n            }\n        }\n    };\n\n    var DefaultLocale = Locales['en_US'],\n        defaultStrftime = new Strftime(DefaultLocale, 0, false),\n        isCommonJS = typeof module !== 'undefined',\n        namespace;\n\n    // CommonJS / Node module\n    if (isCommonJS) {\n        namespace = module.exports = defaultStrftime;\n    }\n    // Browsers and other environments\n    else {\n        // Get the global object. Works in ES3, ES5, and ES5 strict mode.\n        namespace = (function () { return this || (1, eval)('this'); }());\n        namespace.strftime = defaultStrftime;\n    }\n\n    // Polyfill Date.now for old browsers.\n    if (typeof Date.now !== 'function') {\n        Date.now = function () {\n            return +new Date();\n        };\n    }\n\n    function Strftime(locale, customTimezoneOffset, useUtcTimezone) {\n        var _locale = locale || DefaultLocale,\n            _customTimezoneOffset = customTimezoneOffset || 0,\n            _useUtcBasedDate = useUtcTimezone || false,\n\n            // we store unix timestamp value here to not create new Date() each iteration (each millisecond)\n            // Date.now() is 2 times faster than new Date()\n            // while millisecond precise is enough here\n            // this could be very helpful when strftime triggered a lot of times one by one\n            _cachedDateTimestamp = 0,\n            _cachedDate;\n\n        function _strftime(format, date) {\n            var timestamp;\n\n            if (!date) {\n                var currentTimestamp = Date.now();\n                if (currentTimestamp > _cachedDateTimestamp) {\n                    _cachedDateTimestamp = currentTimestamp;\n                    _cachedDate = new Date(_cachedDateTimestamp);\n\n                    timestamp = _cachedDateTimestamp;\n\n                    if (_useUtcBasedDate) {\n                        // how to avoid duplication of date instantiation for utc here?\n                        // we tied to getTimezoneOffset of the current date\n                        _cachedDate = new Date(_cachedDateTimestamp + getTimestampToUtcOffsetFor(_cachedDate) + _customTimezoneOffset);\n                    }\n                }\n                else {\n                    timestamp = _cachedDateTimestamp;\n                }\n                date = _cachedDate;\n            }\n            else {\n                timestamp = date.getTime();\n\n                if (_useUtcBasedDate) {\n                    var utcOffset = getTimestampToUtcOffsetFor(date);\n                    date = new Date(timestamp + utcOffset + _customTimezoneOffset);\n                    // If we've crossed a DST boundary with this calculation we need to\n                    // adjust the new date accordingly or it will be off by an hour in UTC.\n                    if (getTimestampToUtcOffsetFor(date) !== utcOffset) {\n                        var newUTCOffset = getTimestampToUtcOffsetFor(date);\n                        date = new Date(timestamp + newUTCOffset + _customTimezoneOffset);\n                    }\n                }\n            }\n\n            return _processFormat(format, date, _locale, timestamp);\n        }\n\n        function _processFormat(format, date, locale, timestamp) {\n            var resultString = '',\n                padding = null,\n                isInScope = false,\n                length = format.length,\n                extendedTZ = false;\n\n            for (var i = 0; i < length; i++) {\n\n                var currentCharCode = format.charCodeAt(i);\n\n                if (isInScope === true) {\n                    // '-'\n                    if (currentCharCode === 45) {\n                        padding = '';\n                        continue;\n                    }\n                    // '_'\n                    else if (currentCharCode === 95) {\n                        padding = ' ';\n                        continue;\n                    }\n                    // '0'\n                    else if (currentCharCode === 48) {\n                        padding = '0';\n                        continue;\n                    }\n                    // ':'\n                    else if (currentCharCode === 58) {\n                        if (extendedTZ) {\n                            warn(\"[WARNING] detected use of unsupported %:: or %::: modifiers to strftime\");\n                        }\n                        extendedTZ = true;\n                        continue;\n                    }\n\n                    switch (currentCharCode) {\n\n                        // Examples for new Date(0) in GMT\n\n                        // '%'\n                        // case '%':\n                        case 37:\n                            resultString += '%';\n                            break;\n\n                        // 'Thursday'\n                        // case 'A':\n                        case 65:\n                            resultString += locale.days[date.getDay()];\n                            break;\n\n                        // 'January'\n                        // case 'B':\n                        case 66:\n                            resultString += locale.months[date.getMonth()];\n                            break;\n\n                        // '19'\n                        // case 'C':\n                        case 67:\n                            resultString += padTill2(Math.floor(date.getFullYear() / 100), padding);\n                            break;\n\n                        // '01/01/70'\n                        // case 'D':\n                        case 68:\n                            resultString += _processFormat(locale.formats.D, date, locale, timestamp);\n                            break;\n\n                        // '1970-01-01'\n                        // case 'F':\n                        case 70:\n                            resultString += _processFormat(locale.formats.F, date, locale, timestamp);\n                            break;\n\n                        // '00'\n                        // case 'H':\n                        case 72:\n                            resultString += padTill2(date.getHours(), padding);\n                            break;\n\n                        // '12'\n                        // case 'I':\n                        case 73:\n                            resultString += padTill2(hours12(date.getHours()), padding);\n                            break;\n\n                        // '000'\n                        // case 'L':\n                        case 76:\n                            resultString += padTill3(Math.floor(timestamp % 1000));\n                            break;\n\n                        // '00'\n                        // case 'M':\n                        case 77:\n                            resultString += padTill2(date.getMinutes(), padding);\n                            break;\n\n                        // 'am'\n                        // case 'P':\n                        case 80:\n                            resultString += date.getHours() < 12 ? locale.am : locale.pm;\n                            break;\n\n                        // '00:00'\n                        // case 'R':\n                        case 82:\n                            resultString += _processFormat(locale.formats.R, date, locale, timestamp);\n                            break;\n\n                        // '00'\n                        // case 'S':\n                        case 83:\n                            resultString += padTill2(date.getSeconds(), padding);\n                            break;\n\n                        // '00:00:00'\n                        // case 'T':\n                        case 84:\n                            resultString += _processFormat(locale.formats.T, date, locale, timestamp);\n                            break;\n\n                        // '00'\n                        // case 'U':\n                        case 85:\n                            resultString += padTill2(weekNumber(date, 'sunday'), padding);\n                            break;\n\n                        // '00'\n                        // case 'W':\n                        case 87:\n                            resultString += padTill2(weekNumber(date, 'monday'), padding);\n                            break;\n\n                        // '16:00:00'\n                        // case 'X':\n                        case 88:\n                            resultString += _processFormat(locale.formats.X, date, locale, timestamp);\n                            break;\n\n                        // '1970'\n                        // case 'Y':\n                        case 89:\n                            resultString += date.getFullYear();\n                            break;\n\n                        // 'GMT'\n                        // case 'Z':\n                        case 90:\n                            if (_useUtcBasedDate && _customTimezoneOffset === 0) {\n                                resultString += \"GMT\";\n                            }\n                            else {\n                                var tzName = getTimezoneName(date);\n                                resultString += tzName || '';\n                            }\n                            break;\n\n                        // 'Thu'\n                        // case 'a':\n                        case 97:\n                            resultString += locale.shortDays[date.getDay()];\n                            break;\n\n                        // 'Jan'\n                        // case 'b':\n                        case 98:\n                            resultString += locale.shortMonths[date.getMonth()];\n                            break;\n\n                        // ''\n                        // case 'c':\n                        case 99:\n                            resultString += _processFormat(locale.formats.c, date, locale, timestamp);\n                            break;\n\n                        // '01'\n                        // case 'd':\n                        case 100:\n                            resultString += padTill2(date.getDate(), padding);\n                            break;\n\n                        // ' 1'\n                        // case 'e':\n                        case 101:\n                            resultString += padTill2(date.getDate(), padding == null ? ' ' : padding);\n                            break;\n\n                        // 'Jan'\n                        // case 'h':\n                        case 104:\n                            resultString += locale.shortMonths[date.getMonth()];\n                            break;\n\n                        // '000'\n                        // case 'j':\n                        case 106:\n                            var y = new Date(date.getFullYear(), 0, 1);\n                            var day = Math.ceil((date.getTime() - y.getTime()) / (1000 * 60 * 60 * 24));\n                            resultString += padTill3(day);\n                            break;\n\n                        // ' 0'\n                        // case 'k':\n                        case 107:\n                            resultString += padTill2(date.getHours(), padding == null ? ' ' : padding);\n                            break;\n\n                        // '12'\n                        // case 'l':\n                        case 108:\n                            resultString += padTill2(hours12(date.getHours()), padding == null ? ' ' : padding);\n                            break;\n\n                        // '01'\n                        // case 'm':\n                        case 109:\n                            resultString += padTill2(date.getMonth() + 1, padding);\n                            break;\n\n                        // '\\n'\n                        // case 'n':\n                        case 110:\n                            resultString += '\\n';\n                            break;\n\n                        // '1st'\n                        // case 'o':\n                        case 111:\n                            // Try to use an ordinal suffix from the locale, but fall back to using the old\n                            // function for compatibility with old locales that lack them.\n                            var day = date.getDate();\n                            if (locale.ordinalSuffixes) {\n                                resultString += String(day) + (locale.ordinalSuffixes[day - 1] || ordinal(day));\n                            }\n                            else {\n                                resultString += String(day) + ordinal(day);\n                            }\n                            break;\n\n                        // 'AM'\n                        // case 'p':\n                        case 112:\n                            resultString += date.getHours() < 12 ? locale.AM : locale.PM;\n                            break;\n\n                        // '12:00:00 AM'\n                        // case 'r':\n                        case 114:\n                            resultString += _processFormat(locale.formats.r, date, locale, timestamp);\n                            break;\n\n                        // '0'\n                        // case 's':\n                        case 115:\n                            resultString += Math.floor(timestamp / 1000);\n                            break;\n\n                        // '\\t'\n                        // case 't':\n                        case 116:\n                            resultString += '\\t';\n                            break;\n\n                        // '4'\n                        // case 'u':\n                        case 117:\n                            var day = date.getDay();\n                            resultString += day === 0 ? 7 : day;\n                            break; // 1 - 7, Monday is first day of the week\n\n                        // ' 1-Jan-1970'\n                        // case 'v':\n                        case 118:\n                            resultString += _processFormat(locale.formats.v, date, locale, timestamp);\n                            break;\n\n                        // '4'\n                        // case 'w':\n                        case 119:\n                            resultString += date.getDay();\n                            break; // 0 - 6, Sunday is first day of the week\n\n                        // '12/31/69'\n                        // case 'x':\n                        case 120:\n                            resultString += _processFormat(locale.formats.x, date, locale, timestamp);\n                            break;\n\n                        // '70'\n                        // case 'y':\n                        case 121:\n                            resultString += padTill2(date.getFullYear() % 100, padding);\n                            break;\n\n                        // '+0000'\n                        // case 'z':\n                        case 122:\n                            if (_useUtcBasedDate && _customTimezoneOffset === 0) {\n                                resultString += extendedTZ ? \"+00:00\" : \"+0000\";\n                            }\n                            else {\n                                var off;\n                                if (_customTimezoneOffset !== 0) {\n                                    off = _customTimezoneOffset / (60 * 1000);\n                                }\n                                else {\n                                    off = -date.getTimezoneOffset();\n                                }\n                                var sign = off < 0 ? '-' : '+';\n                                var sep = extendedTZ ? ':' : '';\n                                var hours = Math.floor(Math.abs(off / 60));\n                                var mins = Math.abs(off % 60);\n                                resultString += sign + padTill2(hours) + sep + padTill2(mins);\n                            }\n                            break;\n\n                        default:\n                            if (isInScope) {\n                                resultString += '%';\n                            }\n                            resultString += format[i];\n                            break;\n                    }\n\n                    padding = null;\n                    isInScope = false;\n                    continue;\n                }\n\n                // '%'\n                if (currentCharCode === 37) {\n                    isInScope = true;\n                    continue;\n                }\n\n                resultString += format[i];\n            }\n\n            return resultString;\n        }\n\n        var strftime = _strftime;\n\n        strftime.localize = function (locale) {\n            return new Strftime(locale || _locale, _customTimezoneOffset, _useUtcBasedDate);\n        };\n\n        strftime.localizeByIdentifier = function (localeIdentifier) {\n            var locale = Locales[localeIdentifier];\n            if (!locale) {\n                warn('[WARNING] No locale found with identifier \"' + localeIdentifier + '\".');\n                return strftime;\n            }\n            return strftime.localize(locale);\n        };\n\n        strftime.timezone = function (timezone) {\n            var customTimezoneOffset = _customTimezoneOffset;\n            var useUtcBasedDate = _useUtcBasedDate;\n\n            var timezoneType = typeof timezone;\n            if (timezoneType === 'number' || timezoneType === 'string') {\n                useUtcBasedDate = true;\n\n                // ISO 8601 format timezone string, [-+]HHMM\n                if (timezoneType === 'string') {\n                    var sign = timezone[0] === '-' ? -1 : 1,\n                        hours = parseInt(timezone.slice(1, 3), 10),\n                        minutes = parseInt(timezone.slice(3, 5), 10);\n\n                    customTimezoneOffset = sign * ((60 * hours) + minutes) * 60 * 1000;\n                    // in minutes: 420\n                }\n                else if (timezoneType === 'number') {\n                    customTimezoneOffset = timezone * 60 * 1000;\n                }\n            }\n\n            return new Strftime(_locale, customTimezoneOffset, useUtcBasedDate);\n        };\n\n        strftime.utc = function () {\n            return new Strftime(_locale, _customTimezoneOffset, true);\n        };\n\n        return strftime;\n    }\n\n    function padTill2(numberToPad, paddingChar) {\n        if (paddingChar === '' || numberToPad > 9) {\n            return '' + numberToPad;\n        }\n        if (paddingChar == null) {\n            paddingChar = '0';\n        }\n        return paddingChar + numberToPad;\n    }\n\n    function padTill3(numberToPad) {\n        if (numberToPad > 99) {\n            return numberToPad;\n        }\n        if (numberToPad > 9) {\n            return '0' + numberToPad;\n        }\n        return '00' + numberToPad;\n    }\n\n    function hours12(hour) {\n        if (hour === 0) {\n            return 12;\n        }\n        else if (hour > 12) {\n            return hour - 12;\n        }\n        return hour;\n    }\n\n    // firstWeekday: 'sunday' or 'monday', default is 'sunday'\n    //\n    // Pilfered & ported from Ruby's strftime implementation.\n    function weekNumber(date, firstWeekday) {\n        firstWeekday = firstWeekday || 'sunday';\n\n        // This works by shifting the weekday back by one day if we\n        // are treating Monday as the first day of the week.\n        var weekday = date.getDay();\n        if (firstWeekday === 'monday') {\n            if (weekday === 0) // Sunday\n                weekday = 6;\n            else\n                weekday--;\n        }\n\n        var firstDayOfYearUtc = Date.UTC(date.getFullYear(), 0, 1),\n            dateUtc = Date.UTC(date.getFullYear(), date.getMonth(), date.getDate()),\n            yday = Math.floor((dateUtc - firstDayOfYearUtc) / 86400000),\n            weekNum = (yday + 7 - weekday) / 7;\n\n        return Math.floor(weekNum);\n    }\n\n    // Get the ordinal suffix for a number: st, nd, rd, or th\n    function ordinal(number) {\n        var i = number % 10;\n        var ii = number % 100;\n\n        if ((ii >= 11 && ii <= 13) || i === 0 || i >= 4) {\n            return 'th';\n        }\n        switch (i) {\n            case 1: return 'st';\n            case 2: return 'nd';\n            case 3: return 'rd';\n        }\n    }\n\n    function getTimestampToUtcOffsetFor(date) {\n        return (date.getTimezoneOffset() || 0) * 60000;\n    }\n\n    // Tries to get a short timezone name using Date.toLocaleString, falling back on the platform default\n    // using Date.toString if necessary.\n    function getTimezoneName(date, localeIdentifier) {\n        return getShortTimezoneName(date, localeIdentifier) || getDefaultTimezoneName(date);\n    }\n\n    // Unfortunately this returns GMT+2 when running with `TZ=Europe/Amsterdam node test.js` so it's not\n    // perfect.\n    function getShortTimezoneName(date, localeIdentifier) {\n        if (localeIdentifier == null) return null;\n\n        var tzString = date\n            .toLocaleString(localeIdentifier, { timeZoneName: 'short' })\n            .match(/\\s([\\w]+)$/);\n        return tzString && tzString[1];\n    }\n\n    // This varies by platform so it's not an ideal way to get the time zone name. On most platforms it's\n    // a short name but in Node v10+ and Chrome 66+ it's a long name now. Prefer getShortTimezoneName(date)\n    // where possible.\n    function getDefaultTimezoneName(date) {\n        var tzString = date.toString().match(/\\(([\\w\\s]+)\\)/);\n        return tzString && tzString[1];\n    }\n\n    function warn(message) {\n        if (typeof console !== 'undefined' && typeof console.warn == 'function') {\n            console.warn(message)\n        }\n    }\n\n}());\n","var g;\n\n// This works in non-strict mode\ng = (function() {\n\treturn this;\n})();\n\ntry {\n\t// This works if eval is allowed (see CSP)\n\tg = g || new Function(\"return this\")();\n} catch (e) {\n\t// This works if the window reference is available\n\tif (typeof window === \"object\") g = window;\n}\n\n// g can still be undefined, but nothing to do about it...\n// We return undefined, instead of nothing here, so it's\n// easier to handle this case. if(!global) { ...}\n\nmodule.exports = g;\n","/**\r\n * @namespace Sk.abstr\r\n *\r\n * @description\r\n * A collection of functions that can be used to interact with Skulpt Python Objects\r\n */\r\nSk.abstr = {};\r\n\r\n/**@typedef {Sk.builtin.object}*/var pyObject;\r\n/** @typedef {Sk.builtin.type|FunctionConstructor}*/var typeObject;\r\n\r\n\r\n/**\r\n * @function\r\n * @description\r\n * Typically used withing error messages\r\n *\r\n * @example\r\n * throw new Sk.builtin.TypeError(\"expected an 'int' (got '\" + Sk.abstr.typeName(i) + \"'\");\r\n *\r\n * @param {*} obj\r\n * @returns {string} - returns the typeName of any pyObject or `<invaid type>` if a JS object was passed\r\n */\r\nSk.abstr.typeName = function (obj) {\r\n    if (obj != null && obj.tp$name !== undefined) {\r\n        let name = obj.ht$name;\r\n        if (name !== undefined) {\r\n            return name.toString();\r\n        }\r\n        name = obj.tp$name;\r\n        if (name.includes(\".\")) {\r\n            name = name.slice(name.lastIndexOf(\".\") + 1);\r\n        }\r\n        return name;\r\n    } else {\r\n        Sk.asserts.fail(obj + \" passed to typeName\");\r\n        return \"<invalid type>\";\r\n    }\r\n};\r\n\r\nconst binop_name_to_symbol = {\r\n    Add: \"+\",\r\n    Sub: \"-\",\r\n    Mult: \"*\",\r\n    MatMult: \"@\",\r\n    Div: \"/\",\r\n    FloorDiv: \"//\",\r\n    Mod: \"%\",\r\n    DivMod: \"divmod()\",\r\n    Pow: \"** or pow()\",\r\n    LShift: \"<<\",\r\n    RShift: \">>\",\r\n    BitAnd: \"&\",\r\n    BitXor: \"^\",\r\n    BitOr: \"|\",\r\n};\r\n\r\nfunction binop_type_error(v, w, name) {\r\n    const vtypename = Sk.abstr.typeName(v);\r\n    const wtypename = Sk.abstr.typeName(w);\r\n    throw new Sk.builtin.TypeError(\"unsupported operand type(s) for \" + binop_name_to_symbol[name] + \": '\" + vtypename + \"' and '\" + wtypename + \"'\");\r\n};\r\n\r\nfunction biniop_type_error(v, w, name) {\r\n    const vtypename = Sk.abstr.typeName(v);\r\n    const wtypename = Sk.abstr.typeName(w);\r\n    throw new Sk.builtin.TypeError(\"unsupported operand type(s) for \" + binop_name_to_symbol[name] + \"=: '\" + vtypename + \"' and '\" + wtypename + \"'\");\r\n};\r\n\r\nconst uop_name_to_symbol = {\r\n    UAdd: \"+\",\r\n    USub: \"-\",\r\n    Invert: \"~\",\r\n};\r\nfunction unop_type_error(v, name) {\r\n    var vtypename = Sk.abstr.typeName(v);\r\n    throw new Sk.builtin.TypeError(\"bad operand type for unary \" + uop_name_to_symbol[name] + \": '\" + vtypename + \"'\");\r\n};\r\n\r\n/**\r\n * lookup and return the LHS object slot function method.  This could be either a builtin slot function or a dunder method defined by the user.\r\n *\r\n * @param obj\r\n * @param name\r\n *\r\n * @returns {Function|undefined}\r\n *\r\n * @private\r\n */\r\nfunction boNameToSlotFuncLhs_(obj, name) {\r\n    switch (name) {\r\n        case \"Add\":\r\n            return obj.nb$add;\r\n        case \"Sub\":\r\n            return obj.nb$subtract;\r\n        case \"Mult\":\r\n            return obj.nb$multiply;\r\n        case \"MatMult\":\r\n            if (Sk.__future__.python3) {\r\n                return obj.nb$matrix_multiply;\r\n            }\r\n        case \"Div\":\r\n            return obj.nb$divide;\r\n        case \"FloorDiv\":\r\n            return obj.nb$floor_divide;\r\n        case \"Mod\":\r\n            return obj.nb$remainder;\r\n        case \"DivMod\":\r\n            return obj.nb$divmod;\r\n        case \"Pow\":\r\n            return obj.nb$power;\r\n        case \"LShift\":\r\n            return obj.nb$lshift;\r\n        case \"RShift\":\r\n            return obj.nb$rshift;\r\n        case \"BitAnd\":\r\n            return obj.nb$and;\r\n        case \"BitXor\":\r\n            return obj.nb$xor;\r\n        case \"BitOr\":\r\n            return obj.nb$or;\r\n    }\r\n};\r\n\r\nfunction boNameToSlotFuncRhs_(obj, name) {\r\n    switch (name) {\r\n        case \"Add\":\r\n            return obj.nb$reflected_add;\r\n        case \"Sub\":\r\n            return obj.nb$reflected_subtract;\r\n        case \"Mult\":\r\n            return obj.nb$reflected_multiply;\r\n        case \"MatMult\":\r\n            if (Sk.__future__.python3) {\r\n                return obj.nb$reflected_matrix_multiply;\r\n            }\r\n        case \"Div\":\r\n            return obj.nb$reflected_divide;\r\n        case \"FloorDiv\":\r\n            return obj.nb$reflected_floor_divide;\r\n        case \"Mod\":\r\n            return obj.nb$reflected_remainder;\r\n        case \"DivMod\":\r\n            return obj.nb$reflected_divmod;\r\n        case \"Pow\":\r\n            return obj.nb$reflected_power;\r\n        case \"LShift\":\r\n            return obj.nb$reflected_lshift;\r\n        case \"RShift\":\r\n            return obj.nb$reflected_rshift;\r\n        case \"BitAnd\":\r\n            return obj.nb$reflected_and;\r\n        case \"BitXor\":\r\n            return obj.nb$reflected_xor;\r\n        case \"BitOr\":\r\n            return obj.nb$reflected_or;\r\n    }\r\n};\r\n\r\nfunction iboNameToSlotFunc_(obj, name) {\r\n    switch (name) {\r\n        case \"Add\":\r\n            return obj.nb$inplace_add;\r\n        case \"Sub\":\r\n            return obj.nb$inplace_subtract;\r\n        case \"Mult\":\r\n            return obj.nb$inplace_multiply;\r\n        case \"MatMult\":\r\n            if (Sk.__future__.python3) {\r\n                return obj.nb$inplace_matrix_multiply;\r\n            }\r\n        case \"Div\":\r\n            return obj.nb$inplace_divide;\r\n        case \"FloorDiv\":\r\n            return obj.nb$inplace_floor_divide;\r\n        case \"Mod\":\r\n            return obj.nb$inplace_remainder;\r\n        case \"Pow\":\r\n            return obj.nb$inplace_power;\r\n        case \"LShift\":\r\n            return obj.nb$inplace_lshift;\r\n        case \"RShift\":\r\n            return obj.nb$inplace_rshift;\r\n        case \"BitAnd\":\r\n            return obj.nb$inplace_and;\r\n        case \"BitOr\":\r\n            return obj.nb$inplace_or;\r\n        case \"BitXor\":\r\n            return obj.nb$inplace_xor;\r\n    }\r\n};\r\n\r\nfunction uoNameToSlotFunc_(obj, name) {\r\n    switch (name) {\r\n        case \"USub\":\r\n            return obj.nb$negative;\r\n        case \"UAdd\":\r\n            return obj.nb$positive;\r\n        case \"Invert\":\r\n            return obj.nb$invert;\r\n    }\r\n};\r\n\r\nfunction binary_op_(v, w, opname) {\r\n    // All Python inheritance is now enforced with Javascript inheritance\r\n    // (see Sk.abstr.setUpInheritance). This checks if w's type is a strict\r\n    // subclass of v's type\r\n    const w_type = w.constructor;\r\n    const v_type = v.constructor;\r\n    const w_is_subclass = w_type !== v_type && w_type.sk$baseClass === undefined && w instanceof v_type;\r\n\r\n    // From the Python 2.7 docs:\r\n    //\r\n    // \"If the right operand’s type is a subclass of the left operand’s type and\r\n    // that subclass provides the reflected method for the operation, this\r\n    // method will be called before the left operand’s non-reflected method.\r\n    // This behavior allows subclasses to override their ancestors’ operations.\"\r\n    //\r\n    // -- https://docs.python.org/2/reference/datamodel.html#index-92\r\n\r\n    let wop;\r\n    let ret;\r\n    let tried_reflected = false;\r\n    if (w_is_subclass) {\r\n        wop = boNameToSlotFuncRhs_(w, opname);\r\n        if (wop === undefined) {\r\n            tried_reflected = true;\r\n        } else if (wop !== boNameToSlotFuncRhs_(v, opname)) {\r\n            tried_reflected = true;\r\n            ret = wop.call(w, v);\r\n            if (ret !== Sk.builtin.NotImplemented.NotImplemented$) {\r\n                return ret;\r\n            }\r\n        }\r\n    }\r\n\r\n    const vop = boNameToSlotFuncLhs_(v, opname);\r\n    if (vop !== undefined) {\r\n        ret = vop.call(v, w);\r\n        if (ret !== Sk.builtin.NotImplemented.NotImplemented$) {\r\n            return ret;\r\n        }\r\n    }\r\n    // try the RHS if we haven't tried it yet and we're not the same type see test_magicmethods.py\r\n    if (!tried_reflected && w_type !== v_type) {\r\n        wop || (wop = boNameToSlotFuncRhs_(w, opname));\r\n        if (wop !== undefined) {\r\n            ret = wop.call(w, v);\r\n            if (ret !== Sk.builtin.NotImplemented.NotImplemented$) {\r\n                return ret;\r\n            }\r\n        }\r\n    }\r\n\r\n};\r\n\r\nfunction binary_iop_(v, w, opname) {\r\n    const vop = iboNameToSlotFunc_(v, opname);\r\n    if (vop !== undefined) {\r\n        const ret = vop.call(v, w);\r\n        if (ret !== Sk.builtin.NotImplemented.NotImplemented$) {\r\n            return ret;\r\n        }\r\n    }\r\n    // If there wasn't an in-place operation, fall back to the binop\r\n    return binary_op_(v, w, opname);\r\n};\r\n\r\nfunction unary_op_(v, opname) {\r\n    const vop = uoNameToSlotFunc_(v, opname);\r\n    if (vop !== undefined) {\r\n        return vop.call(v);\r\n    }\r\n};\r\n\r\n/**\r\n * @function\r\n * @description\r\n * Perform a binary operation with any pyObjects that support the operation\r\n * @param {pyObject} v\r\n * @param {pyObject} w\r\n * @param {string} op - `Add`, `Sub`, `Mult`, `Divide`, ...\r\n *\r\n * @throws {Sk.builtin.TypeError}\r\n */\r\nSk.abstr.numberBinOp = function (v, w, op) {\r\n    return binary_op_(v, w, op) || binop_type_error(v, w, op);\r\n};\r\nSk.exportSymbol(\"Sk.abstr.numberBinOp\", Sk.abstr.numberBinOp);\r\n\r\n/**\r\n * @function\r\n * @description\r\n * Perform an inplace operation with any pyObjects that support the operation\r\n * @param {pyObject} v\r\n * @param {pyObject} w\r\n * @param {string} op - `Add`, `Sub`, `Mult`, `Divide`, ...\r\n *\r\n * @throws {Sk.builtin.TypeError}\r\n */\r\nSk.abstr.numberInplaceBinOp = function (v, w, op) {\r\n    return binary_iop_(v, w, op) || biniop_type_error(v, w, op);\r\n};\r\nSk.exportSymbol(\"Sk.abstr.numberInplaceBinOp\", Sk.abstr.numberInplaceBinOp);\r\n\r\n/**\r\n * @function\r\n * @description\r\n * Perform a unary operation with any pyObjects that support the operation\r\n * @param {pyObject} v\r\n * @param {string} op - `UAdd`, `USub`\r\n *\r\n * @throws {Sk.builtin.TypeError}\r\n */\r\nSk.abstr.numberUnaryOp = function (v, op) {\r\n    if (op === \"Not\") {\r\n        return Sk.misceval.isTrue(v) ? Sk.builtin.bool.false$ : Sk.builtin.bool.true$;\r\n    }\r\n    return unary_op_(v, op) || unop_type_error(v, op);\r\n};\r\nSk.exportSymbol(\"Sk.abstr.numberUnaryOp\", Sk.abstr.numberUnaryOp);\r\n\r\n/**\r\n * @deprecated\r\n */\r\nSk.abstr.fixSeqIndex_ = function (seq, i) {\r\n    i = Sk.builtin.asnum$(i);\r\n    if (i < 0 && seq.sq$length) {\r\n        i += seq.sq$length();\r\n    }\r\n    return i;\r\n};\r\n\r\n/**\r\n * @param {pyObject} seq\r\n * @param {pyObject} ob\r\n * @param {boolean=} canSuspend\r\n *\r\n */\r\nSk.abstr.sequenceContains = function (seq, ob, canSuspend) {\r\n    if (seq.sq$contains) {\r\n        return seq.sq$contains(ob, canSuspend);\r\n    }\r\n    const r = Sk.misceval.iterFor(\r\n        Sk.abstr.iter(seq),\r\n        function (i) {\r\n            if (i === ob || Sk.misceval.richCompareBool(i, ob, \"Eq\")) {\r\n                return new Sk.misceval.Break(true);\r\n            } else {\r\n                return false;\r\n            }\r\n        },\r\n        false\r\n    );\r\n    return canSuspend ? r : Sk.misceval.retryOptionalSuspensionOrThrow(r);\r\n};\r\n\r\nSk.abstr.sequenceConcat = function (s, o) {\r\n    if (s.sq$concat) {\r\n        return s.sq$concat(o);\r\n    }\r\n    // user defined classes don't have a sq$concat only nb$add\r\n    if (Sk.builtin.checkSequence(s) && Sk.builtin.checkSequence(o)) {\r\n        const res = binary_op_(s, o, \"Add\");\r\n        if (res !== undefined) {\r\n            return res;\r\n        }\r\n    }\r\n    throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(s) + \"' object can't be concatenated\");\r\n};\r\n\r\nSk.abstr.sequenceInPlaceConcat = function (s, o) {\r\n    if (s.sq$inplace_concat) {\r\n        return s.sq$inplace_concat(o);\r\n    } else if (s.sq$concat) {\r\n        return s.sq$concat(o);\r\n    }\r\n    // user defined classes don't have a sq$concat only nb$add\r\n    if (Sk.builtin.checkSequence(s) && Sk.builtin.checkSequence(o)) {\r\n        const res = binary_iop_(s, o, \"Add\");\r\n        if (res !== undefined) {\r\n            return res;\r\n        }\r\n    }\r\n    throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(s) + \"' object can't be concatenated\");\r\n};\r\n\r\n/**\r\n * @param {pyObject} seq \r\n * @param {pyObject} ob \r\n */\r\nSk.abstr.sequenceGetIndexOf = function (seq, ob) {\r\n    if (seq.index) {\r\n        return Sk.misceval.callsimArray(seq.index, [seq, ob]);\r\n    }\r\n    let index = 0;\r\n    for (let it = Sk.abstr.iter(seq), i = it.tp$iternext(); i !== undefined; i = it.tp$iternext()) {\r\n        if (Sk.misceval.richCompareBool(ob, i, \"Eq\")) {\r\n            return new Sk.builtin.int_(index);\r\n        }\r\n        index += 1;\r\n    }\r\n    throw new Sk.builtin.ValueError(\"sequence.index(x): x not in sequence\");\r\n};\r\n\r\n/**\r\n * @param {pyObject} seq \r\n * @param {pyObject} ob \r\n */\r\nSk.abstr.sequenceGetCountOf = function (seq, ob) {\r\n    if (seq.count) {\r\n        return Sk.misceval.callsimArray(seq.count, [seq, ob]);\r\n    }\r\n    let count = 0;\r\n    for (let it = Sk.abstr.iter(seq), i = it.tp$iternext(); i !== undefined; i = it.tp$iternext()) {\r\n        if (Sk.misceval.richCompareBool(ob, i, \"Eq\")) {\r\n            count += 1;\r\n        }\r\n    }\r\n    return new Sk.builtin.int_(count);\r\n};\r\n\r\nSk.abstr.sequenceGetItem = function (seq, i, canSuspend) {\r\n    if (typeof i === \"number\") {\r\n        i = new Sk.builtin.int_(i);\r\n    }\r\n    return Sk.abstr.objectGetItem(seq, i, canSuspend);\r\n};\r\n\r\nSk.abstr.sequenceSetItem = function (seq, i, x, canSuspend) {\r\n    if (typeof i === \"number\") {\r\n        i = new Sk.builtin.int_(i);\r\n    }\r\n    return Sk.abstr.objectSetItem(seq, i, x, canSuspend);\r\n};\r\n\r\nSk.abstr.sequenceDelItem = function (seq, i, canSuspend) {\r\n    return Sk.abstr.objectDelItem(seq, i, canSuspend);\r\n};\r\n\r\nSk.abstr.sequenceGetSlice = function (seq, i1, i2) {\r\n    return Sk.abstr.objectGetItem(seq, new Sk.builtin.slice(i1, i2));\r\n};\r\n\r\nSk.abstr.sequenceDelSlice = function (seq, i1, i2) {\r\n    return Sk.abstr.objectDelItem(seq, new Sk.builtin.slice(i1, i2));\r\n};\r\n\r\nSk.abstr.sequenceSetSlice = function (seq, i1, i2, x) {\r\n    return Sk.abstr.objectSetItem(seq, new Sk.builtin.slice(i1, i2));\r\n};\r\n\r\n/**\r\n * \r\n * @param {*} seq the iterable to unpack\r\n * @param {*} breakIdx either the starred index or the number of elements to unpack if no star\r\n * @param {*} numvals the total number of un-starred indices\r\n * @param {*} hasStar is there a starred index\r\n * \r\n * this function is used in compile code to unpack a sequence to an assignment statement\r\n * e.g.\r\n * a, b, c = 1, 2, 3 # seq is the tuple 1,2,3\r\n * // Sk.abstr.sequenceUncpack(seq, 3, 3, false)\r\n * // return [int_(1), int_(2), int_(3)]\r\n * \r\n * \r\n * a, *b, c = 1,2,3,4 \r\n * // Sk.abstr.sequenceUncpack(seq, 1, 2, true)\r\n * // return [int_(1), list(int_(2), int_(3)), int_(4)]\r\n * \r\n */\r\nSk.abstr.sequenceUnpack = function (seq, breakIdx, numvals, hasStar) {\r\n    if (!Sk.builtin.checkIterable(seq)) {\r\n        throw new Sk.builtin.TypeError(\"cannot unpack non-iterable \" + Sk.abstr.typeName(seq) + \" object\");\r\n    }\r\n    const it = Sk.abstr.iter(seq);\r\n    const res = [];\r\n    let i = 0;\r\n    let upToStar;\r\n    if (breakIdx > 0) {\r\n        // iterator up to but not including the breakIdx\r\n        upToStar = Sk.misceval.iterFor(it, (nxt) => {\r\n            res.push(nxt);\r\n            if (++i === breakIdx) {\r\n                return new Sk.misceval.Break();\r\n            }\r\n        });\r\n    }\r\n\r\n    return Sk.misceval.chain(upToStar, () => {\r\n        if (res.length < breakIdx) {\r\n            throw new Sk.builtin.ValueError(\"not enough values to unpack (expected at least \" + numvals + \", got \" + res.length + \")\");\r\n        }\r\n        if (!hasStar) {\r\n            // check we've consumed the iterator\r\n            return Sk.misceval.chain(it.tp$iternext(true), (nxt) => {\r\n                if (nxt !== undefined) {\r\n                    throw new Sk.builtin.ValueError(\"too many values to unpack (expected \" + breakIdx + \")\");\r\n                }\r\n                return res;\r\n            });\r\n        }\r\n        const starred = [];\r\n        return Sk.misceval.chain(\r\n            Sk.misceval.iterFor(it, (nxt) => {\r\n                starred.push(nxt);\r\n            }),\r\n            () => {\r\n                const starred_end = starred.length + breakIdx - numvals;\r\n                if (starred_end < 0) {\r\n                    throw new Sk.builtin.ValueError(\r\n                        \"not enough values to unpack (expected at least \" + numvals + \", got \" + (numvals + starred_end) + \")\"\r\n                    );\r\n                }\r\n                res.push(new Sk.builtin.list(starred.slice(0, starred_end)));\r\n                res.push(...starred.slice(starred_end));\r\n                // Return Javascript array of items\r\n                return res;\r\n            }\r\n        );\r\n    });\r\n};\r\n\r\n// Unpack mapping into a JS array of alternating keys/values, possibly suspending\r\n// Skulpt uses a slightly grungy format for keyword args\r\n// into misceval.apply() and friends (alternating JS strings and Python values).\r\n// We should probably migrate that interface to using Python strings\r\n// at some point, but in the meantime we have this function to\r\n// unpack keyword dictionaries into our special format\r\nSk.abstr.mappingUnpackIntoKeywordArray = function (jsArray, pyMapping, pyCodeObject) {\r\n    if (pyMapping instanceof Sk.builtin.dict) {\r\n        pyMapping.$items().forEach(([key, val]) => {\r\n            if (!Sk.builtin.checkString(key)) {\r\n                throw new Sk.builtin.TypeError((pyCodeObject.$qualname ? pyCodeObject.$qualname + \"() \" : \"\") + \"keywords must be strings\");\r\n            }\r\n            jsArray.push(key.v);\r\n            jsArray.push(val);\r\n        });\r\n        return;\r\n    }\r\n\r\n    const keyf = Sk.abstr.lookupSpecial(pyMapping, Sk.builtin.str.$keys);\r\n    if (keyf === undefined) {\r\n        throw new Sk.builtin.TypeError(\"Object is not a mapping\");\r\n    }\r\n    return Sk.misceval.chain(Sk.misceval.callsimOrSuspendArray(keyf), (keys) =>\r\n        Sk.misceval.iterFor(Sk.abstr.iter(keys), (key) => {\r\n            if (!Sk.builtin.checkString(key)) {\r\n                throw new Sk.builtin.TypeError((pyCodeObject.$qualname ? pyCodeObject.$qualname + \"() \" : \"\") + \"keywords must be strings\");\r\n            }\r\n            return Sk.misceval.chain(pyMapping.mp$subscript(key, true), (val) => {\r\n                jsArray.push(key.v);\r\n                jsArray.push(val);\r\n            });\r\n        })\r\n    );\r\n};\r\n\r\nSk.abstr.keywordArrayFromPyDict = function (dict) {\r\n    const kwarray = [];\r\n    dict.$items().forEach(([key, val]) => {\r\n        if (!Sk.builtin.checkString(key)) {\r\n            throw new Sk.builtin.TypeError(\"keywords must be strings\");\r\n        }\r\n        kwarray.push(key.toString());\r\n        kwarray.push(val);\r\n    });\r\n    return kwarray;\r\n};\r\n\r\nSk.abstr.keywordArrayToPyDict = function (kwarray) {\r\n    const dict = new Sk.builtin.dict();\r\n    for (let i = 0; i < kwarray.length; i += 2) {\r\n        dict.mp$ass_subscript(new Sk.builtin.str(kwarray[i]), kwarray[i + 1]);\r\n    }\r\n    return dict;\r\n};\r\n\r\n/**\r\n *\r\n * @function\r\n * @description\r\n * A helper function used by native js functions whose call method is FastCall i.e. the args and kwargs are provided as Array objects.\r\n *\r\n * @param {string} func_name - used for error messages\r\n * @param {Array<null|string>} varnames - Argument names to map to. For position only arguments use null\r\n * @param {Array} args - typically provided by the `tp$call` method\r\n * @param {Array|undefined} kwargs - typically provided the `tp$call` method\r\n * @param {Array=} defaults\r\n * @throws {Sk.builtin.TypeError}\r\n *\r\n * @example\r\n * // base is a possible keyword argument for int_ and x is a position only argument\r\n * Sk.builtin.int_.prototype.tp$new = function(args, kwargs) {\r\n *     args = Sk.abstr.copyKeywordsToNamedArgs(\"int\", [null, \"base\"], args, kwargs, [\r\n *         new Sk.builtin.int_(0),\r\n *         Sk.builtin.none.none$\r\n *     ]);\r\n * }\r\n */\r\nSk.abstr.copyKeywordsToNamedArgs = function (func_name, varnames, args, kwargs, defaults) {\r\n    // args is an array, kwargs is an array or undefined\r\n    kwargs = kwargs || [];\r\n\r\n    const nargs = args.length + kwargs.length / 2;\r\n    if (nargs > varnames.length) {\r\n        throw new Sk.builtin.TypeError(func_name + \"() expected at most \" + varnames.length + \" arguments (\" + nargs + \" given)\");\r\n    }\r\n    if (!kwargs.length && defaults === undefined) {\r\n        // no defaults supplied\r\n        return args;\r\n    } else if (nargs === varnames.length && !kwargs.length) {\r\n        // position only arguments match\r\n        return args;\r\n    } else if (nargs === 0 && varnames.length === (defaults && defaults.length)) {\r\n        // a fast case - no args so just return the defaults\r\n        return defaults;\r\n    }\r\n    args = args.slice(0); // make a copy of args\r\n\r\n    for (let i = 0; i < kwargs.length; i += 2) {\r\n        const name = kwargs[i]; // JS string\r\n        if (name === null) {\r\n            continue;\r\n        }\r\n        const value = kwargs[i + 1]; // Python value\r\n        const idx = varnames.indexOf(name);\r\n\r\n        if (idx >= 0) {\r\n            if (args[idx] !== undefined) {\r\n                throw new Sk.builtin.TypeError(func_name + \"() got multiple values for argument '\" + name + \"'\");\r\n            }\r\n            args[idx] = value;\r\n        } else {\r\n            throw new Sk.builtin.TypeError(func_name + \"() got an unexpected keyword argument '\" + name + \"'\");\r\n        }\r\n    }\r\n    if (defaults) {\r\n        const nargs = varnames.length;\r\n        for (let i = nargs - 1; i >= 0; i--) {\r\n            if (args[i] === undefined) {\r\n                args[i] = defaults[defaults.length - 1 - (nargs - 1 - i)];\r\n            }\r\n        }\r\n        const missing = varnames.filter((x, i) => args[i] === undefined);\r\n        if (missing.length) {\r\n            throw new Sk.builtin.TypeError(func_name + \"() missing \" + missing.length + \" required positional arguments: \" + missing.join(\", \"));\r\n        }\r\n    }\r\n\r\n    return args;\r\n};\r\nSk.exportSymbol(\"Sk.abstr.copyKeywordsToNamedArgs\", Sk.abstr.copyKeywordsToNamedArgs);\r\n\r\n/**\r\n * @function\r\n * @param {string} func_name\r\n * @param {Array|undefined} kwargs\r\n * @throws {Sk.builtin.TypeError}\r\n */\r\nSk.abstr.checkNoKwargs = function (func_name, kwargs) {\r\n    if (kwargs && kwargs.length) {\r\n        throw new Sk.builtin.TypeError(func_name + \"() takes no keyword arguments\");\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.abstr.checkNoKwargs\", Sk.abstr.checkNoKwargs);\r\n\r\n/**\r\n * @function\r\n * @param {string} func_name\r\n * @param {Array} args\r\n * @param {Array|undefined=} kwargs\r\n *\r\n * @throws {Sk.builtin.TypeError}\r\n */\r\nSk.abstr.checkNoArgs = function (func_name, args, kwargs) {\r\n    const nargs = args.length + (kwargs ? kwargs.length : 0);\r\n    if (nargs) {\r\n        throw new Sk.builtin.TypeError(func_name + \"() takes no arguments (\" + nargs + \" given)\");\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.abstr.checkNoArgs\", Sk.abstr.checkNoArgs);\r\n\r\n/**\r\n * @function\r\n * @param {string} func_name\r\n * @param {Array} args\r\n * @param {Array|undefined=} kwargs\r\n * @throws {Sk.builtin.TypeError}\r\n */\r\nSk.abstr.checkOneArg = function (func_name, args, kwargs) {\r\n    Sk.abstr.checkNoKwargs(func_name, kwargs);\r\n    if (args.length !== 1) {\r\n        throw new Sk.builtin.TypeError(func_name + \"() takes exactly one argument (\" + args.length + \" given)\");\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.abstr.checkOneArg\", Sk.abstr.checkOneArg);\r\n\r\n/**\r\n * @function\r\n * @param {string} func_name\r\n * @param {Array} args\r\n * @param {number} minargs\r\n * @param {number=} [maxargs=Infinity]\r\n * @throws {Sk.builtin.TypeError}\r\n *\r\n */\r\nSk.abstr.checkArgsLen = function (func_name, args, minargs, maxargs) {\r\n    const nargs = args.length;\r\n    let msg;\r\n    if (maxargs === undefined) {\r\n        maxargs = Infinity;\r\n    }\r\n    if (nargs < minargs || nargs > maxargs) {\r\n        if (minargs === maxargs) {\r\n            msg = func_name + \"() takes exactly \" + minargs + \" arguments\";\r\n        } else if (nargs < minargs) {\r\n            msg = func_name + \"() takes at least \" + minargs + \" arguments\";\r\n        } else {\r\n            msg = func_name + \"() takes at most \" + maxargs + \" arguments\";\r\n        }\r\n        msg += \" (\" + nargs + \" given)\";\r\n        throw new Sk.builtin.TypeError(msg);\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.abstr.checkArgsLen\", Sk.abstr.checkArgsLen);\r\n\r\nSk.abstr.objectFormat = function (obj, format_spec) {\r\n    if (format_spec === undefined) {\r\n        format_spec = Sk.builtin.str.$emptystr;\r\n    } else if (!Sk.builtin.checkString(format_spec)) {\r\n        throw new Sk.builtin.TypeError(\"Format specifier must be a string, not \" + Sk.abstr.typeName(format_spec));\r\n    }\r\n    const meth = Sk.abstr.lookupSpecial(obj, Sk.builtin.str.$format); // inherited from object so guaranteed to exist\r\n    const result = Sk.misceval.callsimArray(meth, [format_spec]);\r\n    if (!Sk.builtin.checkString(result)) {\r\n        throw new Sk.builtin.TypeError(\"__format__ must return a str, not \" + Sk.abstr.typeName(result));\r\n    }\r\n    return result;\r\n};\r\n\r\n/**\r\n * \r\n * @param {pyObject} obj \r\n * \r\n * @returns {Number} the hash value a number less than Number.MAX_SAFE_INTEGER \r\n * @throws {Sk.buitin.TypeError} if the object is unhashable\r\n */\r\nSk.abstr.objectHash = function (obj) {\r\n    const hash_func = obj.tp$hash;\r\n    if (hash_func !== undefined) {\r\n        if (Sk.builtin.checkNone(hash_func)) {\r\n            throw new Sk.builtin.TypeError(\"unhashable type: '\" + Sk.abstr.typeName(obj) + \"'\");\r\n        }\r\n        return obj.tp$hash();\r\n    }\r\n    throw new Sk.builtin.TypeError(\"unsupported Javascript type\");\r\n};\r\n\r\nSk.abstr.objectAdd = function (a, b) {\r\n    if (a.nb$add) {\r\n        return a.nb$add(b);\r\n    }\r\n    const atypename = Sk.abstr.typeName(a);\r\n    const btypename = Sk.abstr.typeName(b);\r\n    throw new Sk.builtin.TypeError(\"unsupported operand type(s) for +: '\" + atypename + \"' and '\" + btypename + \"'\");\r\n};\r\n\r\n// in Python 2.6, this behaviour seems to be defined for numbers and bools (converts bool to int)\r\nSk.abstr.objectNegative = function (obj) {\r\n    if (obj.nb$negative) {\r\n        return obj.nb$negative();\r\n    }\r\n    throw new Sk.builtin.TypeError(\"bad operand type for unary -: '\" + Sk.abstr.typeName(obj) + \"'\");\r\n};\r\n\r\nSk.abstr.objectPositive = function (obj) {\r\n    if (obj.nb$positive) {\r\n        return obj.nb$positive();\r\n    }\r\n    throw new Sk.builtin.TypeError(\"bad operand type for unary +: '\" + Sk.abstr.typeName(obj) + \"'\");\r\n};\r\n\r\nSk.abstr.objectDelItem = function (o, key, canSuspend) {\r\n    if (o.mp$ass_subscript) {\r\n        return o.mp$ass_subscript(key, undefined, canSuspend);\r\n    }\r\n    throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(o) + \"' object does not support item deletion\");\r\n};\r\nSk.exportSymbol(\"Sk.abstr.objectDelItem\", Sk.abstr.objectDelItem);\r\n\r\n/**\r\n * \r\n * @param {pyObject} o \r\n * @param {pyObject} key \r\n * @param {boolean=} canSuspend \r\n */\r\nSk.abstr.objectGetItem = function (o, key, canSuspend) {\r\n    if (o.mp$subscript) {\r\n        return o.mp$subscript(key, canSuspend);\r\n    }\r\n    if (Sk.builtin.checkClass(o)) {\r\n        if (o === Sk.builtin.type) {\r\n            return new Sk.builtin.GenericAlias(o, key);\r\n        }\r\n        const meth = Sk.abstr.typeLookup(o, Sk.builtin.str.$class_getitem);\r\n        if (meth !== undefined) {\r\n            const res = Sk.misceval.callsimOrSuspendArray(meth, [key]);\r\n            return canSuspend ? res : Sk.misceval.retryOptionalSuspensionOrThrow(res);\r\n        }\r\n    }\r\n    throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(o) + \"' does not support indexing\");\r\n};\r\nSk.exportSymbol(\"Sk.abstr.objectGetItem\", Sk.abstr.objectGetItem);\r\n\r\n/**\r\n * \r\n * @param {pyObject} o \r\n * @param {pyObject} key \r\n * @param {pyObject=} v \r\n * @param {boolean=} canSuspend \r\n */\r\nSk.abstr.objectSetItem = function (o, key, v, canSuspend) {\r\n    if (o.mp$ass_subscript) {\r\n        return o.mp$ass_subscript(key, v, canSuspend);\r\n    }\r\n    throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(o) + \"' does not support item assignment\");\r\n};\r\nSk.exportSymbol(\"Sk.abstr.objectSetItem\", Sk.abstr.objectSetItem);\r\n\r\n/**\r\n * \r\n * @param {pyObject} obj \r\n * @param {Sk.builtin.str} pyName \r\n * @param {boolean=} canSuspend \r\n */\r\nSk.abstr.gattr = function (obj, pyName, canSuspend) {\r\n    // let the getattr and setattr's deal with reserved words - we don't want to pass a mangled pyName to tp$getattr!!\r\n    const ret = obj.tp$getattr(pyName, canSuspend);\r\n    if (ret === undefined) {\r\n        throw new Sk.builtin.AttributeError(obj.sk$attrError() + \" has no attribute '\" + pyName.$jsstr() + \"'\");\r\n    } else if (ret.$isSuspension) {\r\n        return Sk.misceval.chain(ret, function (r) {\r\n            if (r === undefined) {\r\n                throw new Sk.builtin.AttributeError(obj.sk$attrError() + \" has no attribute '\" + pyName.$jsstr() + \"'\");\r\n            }\r\n            return r;\r\n        });\r\n    } else {\r\n        return ret;\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.abstr.gattr\", Sk.abstr.gattr);\r\n\r\nSk.abstr.sattr = function (obj, pyName, data, canSuspend) {\r\n    return obj.tp$setattr(pyName, data, canSuspend);\r\n};\r\nSk.exportSymbol(\"Sk.abstr.sattr\", Sk.abstr.sattr);\r\n\r\nSk.abstr.iternext = function (it, canSuspend) {\r\n    return it.tp$iternext(canSuspend);\r\n};\r\nSk.exportSymbol(\"Sk.abstr.iternext\", Sk.abstr.iternext);\r\n\r\n/**\r\n * @function\r\n *\r\n * @description\r\n * Get the iterator for a Python object  This iterator could be one of the following.\r\n * This is the preferred mechanism for consistently getting the correct iterator.  You should\r\n * not just use tp$iter because that could lead to incorrect behavior of a user created class.\r\n *\r\n * - `tp$iter`\r\n * - A user defined `__iter__` method\r\n * - A user defined `__getitem__` method\r\n *\r\n * @param {pyObject} obj\r\n *\r\n * @throws {Sk.builtin.TypeError} If the object passed is not iterable\r\n * @returns {pyObject}\r\n */\r\nSk.abstr.iter = function (obj) {\r\n    if (obj.tp$iter) {\r\n        const iter = obj.tp$iter();\r\n        if (iter.tp$iternext) {\r\n            // only a valid iterator if there is a tp$iternext\r\n            return iter;\r\n        }\r\n        throw new Sk.builtin.TypeError(\"iter() returned non-iterator of type '\" + Sk.abstr.typeName(iter) + \"'\");\r\n    }\r\n    if (obj.mp$subscript) {\r\n        return new Sk.builtin.seq_iter_(obj);\r\n    }\r\n\r\n    throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(obj) + \"' object is not iterable\");\r\n};\r\nSk.exportSymbol(\"Sk.abstr.iter\", Sk.abstr.iter);\r\n\r\n\r\n/**\r\n * @description\r\n * Special method look up.\r\n * Checks whether the attribute is defined on object type's prototype\r\n *\r\n * @returns {undefined | Object} Return undefined if not found or the function\r\n *\r\n * @param {pyObject} obj\r\n * @param {Sk.builtin.str} pyName\r\n */\r\nSk.abstr.lookupSpecial = function (obj, pyName) {\r\n    var obtype = obj.ob$type;\r\n    if (obtype === undefined) {\r\n        Sk.asserts.fail(\"javascript object sent to lookupSpecial\");\r\n        return;\r\n    }\r\n    var func = obtype.$typeLookup(pyName);\r\n    if (func === undefined) {\r\n        return;\r\n    } else if (func.tp$descr_get !== undefined) {\r\n        func = func.tp$descr_get(obj, obtype);\r\n    }\r\n    return func;\r\n};\r\nSk.exportSymbol(\"Sk.abstr.lookupSpecial\", Sk.abstr.lookupSpecial);\r\n\r\n\r\nSk.abstr.typeLookup = function (type_obj, pyName) {\r\n    const res = type_obj.$typeLookup(pyName);\r\n    if (res !== undefined && res.tp$descr_get) {\r\n        return res.tp$descr_get(null, type_obj);\r\n    }\r\n    return res;\r\n};\r\n\r\n/**\r\n * Mark a class as unhashable and prevent its `__hash__` function from being called.\r\n * @param  {*} thisClass The class to mark as unhashable.\r\n * @return {undefined}\r\n */\r\nSk.abstr.markUnhashable = function (thisClass) {\r\n    const proto = thisClass.prototype;\r\n    proto.__hash__ = Sk.builtin.none.none$;\r\n    proto.tp$hash = Sk.builtin.none.none$;\r\n};\r\n\r\n/**\r\n * @description\r\n * Set up inheritance between two Python classes. This allows only for single\r\n * inheritance -- multiple inheritance is not supported by Javascript.\r\n * multiple inheritance is dealt with by tp$getattr implementations\r\n *\r\n * Javascript's inheritance is prototypal. This means that properties must\r\n * be defined on the superclass' prototype in order for subclasses to inherit\r\n * them.\r\n *\r\n * ```\r\n * Sk.superclass.myProperty                 # will NOT be inherited\r\n * Sk.superclass.prototype.myProperty       # will be inherited\r\n * ```\r\n *\r\n * In order for a class to be subclassable, it must (directly or indirectly)\r\n * inherit from Sk.builtin.object so that it will be properly initialized in\r\n * {@link Sk.doOneTimeInitialization} (in src/import.js). Further, all Python\r\n * builtins should inherit from Sk.builtin.object.\r\n *\r\n * @param {string} childName The Python name of the child (subclass).\r\n * @param {FunctionConstructor} child     The subclass.\r\n * @param {FunctionConstructor=} [parent=Sk.builtin.object]    The base of child.\r\n * @param {FunctionConstructor=} [metaclass=Sk.builtin.type]\r\n * \r\n * @returns {FunctionConstructor}\r\n * \r\n */\r\nSk.abstr.setUpInheritance = function (childName, child, parent, metaclass) {\r\n    metaclass = metaclass || Sk.builtin.type;\r\n    parent = parent === undefined ? Sk.builtin.object : parent;\r\n    const parentproto = parent !== null ? parent.prototype : null;\r\n    Object.setPrototypeOf(child, metaclass.prototype);\r\n    Object.setPrototypeOf(child.prototype, parentproto);\r\n    Object.defineProperties(child.prototype, {\r\n        sk$object: { value: child, writable: true },\r\n        ob$type: {value: child, writable: true},\r\n        tp$name: {value: childName, writable: true},\r\n        tp$base: {value: parent, writable: true},\r\n    });\r\n};\r\n\r\n\r\n/**\r\n * This function is called in {@link Sk.doOneTimeInitialization}\r\n * and {@link Sk.abstr.buildNativeClass}\r\n *\r\n * @param  {FunctionConstructor} child\r\n *\r\n */\r\nSk.abstr.setUpBuiltinMro = function (child) {\r\n    let base = child.prototype.tp$base;\r\n    const bases = base === null ? [] : [base];\r\n    if (base === Sk.builtin.object || base === null) {\r\n        Object.defineProperty(child, \"sk$baseClass\", { value: true, writable: true });\r\n        Object.defineProperty(child.prototype, \"sk$builtinBase\", { value: child, writable: true });\r\n    }\r\n    // assume solid base - this can be overridden later in flags\r\n    Object.defineProperty(child, \"sk$solidBase\", { value: true, writable: true });\r\n    const mro = [child];\r\n    while (base !== null) {\r\n        mro.push(base);\r\n        base = base.prototype.tp$base;\r\n    }\r\n    \r\n    // internally we keep the mro and bases as array objects\r\n    // the wrapper descripor returns the tuple of the array\r\n    Object.defineProperties(child.prototype, {\r\n        sk$prototypical: {value: true, writable: true},\r\n        tp$bases: {value: bases, writable: true},\r\n        tp$mro: { value: mro, writable: true },\r\n    });\r\n    Object.defineProperty(child, \"$typeLookup\", {\r\n        value: function (pyName) {\r\n            var jsName = pyName.$mangled;\r\n            return this.prototype[jsName];\r\n        },\r\n        writable: true,\r\n    });\r\n};\r\n/**\r\n * @param {FunctionConstructor} klass \r\n * @param {Object=} getsets \r\n */\r\nSk.abstr.setUpGetSets = function (klass, getsets) {\r\n    if (Sk.builtin.getset_descriptor === undefined) {\r\n        return;\r\n    }\r\n    const klass_proto = klass.prototype;\r\n    getsets = getsets || klass_proto.tp$getsets || {};\r\n    Object.entries(getsets).forEach(([getset_name, getset_def]) => {\r\n        getset_def.$name = getset_name;\r\n        klass_proto[getset_name] = new Sk.builtin.getset_descriptor(klass, getset_def);\r\n    });\r\n    Object.defineProperty(klass_proto, \"tp$getsets\", { value: null, writable: true });\r\n};\r\n\r\n/**\r\n * \r\n * @param {FunctionConstructor} klass \r\n * @param {Object=} methods \r\n */\r\nSk.abstr.setUpMethods = function (klass, methods) {\r\n    if (Sk.builtin.method_descriptor === undefined) {\r\n        return;\r\n    }\r\n    const klass_proto = klass.prototype;\r\n    methods = methods || klass_proto.tp$methods || {};\r\n    Object.entries(methods).forEach(([method_name, method_def]) => {\r\n        method_def.$name = method_name;\r\n        klass_proto[method_name] = new Sk.builtin.method_descriptor(klass, method_def);\r\n    });\r\n    Object.defineProperty(klass_proto, \"tp$methods\", { value: null, writable: true });\r\n};\r\n\r\n/**\r\n * \r\n * @param {FunctionConstructor} klass \r\n * @param {Object=} methods \r\n */\r\nSk.abstr.setUpClassMethods = function (klass, methods) {\r\n    if (Sk.builtin.classmethod_descriptor === undefined) {\r\n        return;\r\n    }\r\n    const klass_proto = klass.prototype;\r\n    methods = methods || klass_proto.tp$classmethods || {};\r\n    Object.entries(methods).forEach(([method_name, method_def]) => {\r\n        method_def.$name = method_name;\r\n        klass_proto[method_name] = new Sk.builtin.classmethod_descriptor(klass, method_def);\r\n    });\r\n    Object.defineProperty(klass_proto, \"tp$classmethods\", { value: null, writable: true });\r\n};\r\n\r\nconst op2shortcut = Object.entries({\r\n    Eq: \"ob$eq\",\r\n    NotEq: \"ob$ne\",\r\n    Gt: \"ob$gt\",\r\n    GtE: \"ob$ge\",\r\n    Lt: \"ob$lt\",\r\n    LtE: \"ob$le\",\r\n});\r\n\r\nfunction _set_up_richcompare_wrappers(slots) {\r\n    op2shortcut.forEach(([op, shortcut]) => {\r\n        slots[shortcut] = function (other) {\r\n            return this.tp$richcompare(other, op);\r\n        };\r\n    });\r\n}\r\n\r\nfunction _set_up_reflected_number_slots(slots) {\r\n    // do the reflected slots\r\n    const reflected_slots = Sk.reflectedNumberSlots;\r\n    Object.keys(reflected_slots).forEach((slot_name) => {\r\n        if (slots[slot_name] !== undefined) {\r\n            const reflected_slot_def = reflected_slots[slot_name];\r\n            const reflect_name = reflected_slot_def.reflected;\r\n            const reflected_slot = slots[reflect_name];\r\n            if (reflected_slot !== undefined) {\r\n                // the reflected slot was already defined so don't recreate it\r\n                if (reflected_slot === null) {\r\n                    delete slots[reflect_name]; // e.g. Counter doesn't want reflected slots\r\n                }\r\n            } else {\r\n                // either the reflected slot is a function or it's undefined\r\n                // if it's undefined then the reflected slot is the same as non reflected slot - like nb$add\r\n                slots[reflect_name] = reflected_slot_def.slot || slots[slot_name];\r\n            }\r\n        }\r\n    });\r\n}\r\n\r\nfunction _set_up_sequence_to_number_slots(slots) {\r\n    const sequenceToNumber = Sk.sequenceAndMappingSlots;\r\n    Object.keys(sequenceToNumber).forEach((slot_name) => {\r\n        if (slots[slot_name] !== undefined) {\r\n            const equiv_slots = sequenceToNumber[slot_name];\r\n            equiv_slots.forEach((equv_slot_name) => {\r\n                slots[equv_slot_name] = slots[slot_name];\r\n            });\r\n        }\r\n    });\r\n}\r\n\r\n/**\r\n * \r\n * @param {FunctionConstructor} klass\r\n * @param {Object=} slots \r\n */\r\nSk.abstr.setUpSlots = function (klass, slots) {\r\n    if (Sk.builtin.wrapper_descriptor === undefined) {\r\n        return;\r\n    }\r\n    const proto = klass.prototype;\r\n    slots = slots || proto.tp$slots || {};\r\n\r\n    // set up the raw slots on the proto\r\n\r\n    // start with tp$new - we couldn't call genericnew before the klass was defined so call it now\r\n    if (slots.tp$new === Sk.generic.new) {\r\n        slots.tp$new = Sk.generic.new(klass);\r\n    }\r\n\r\n    // wrap ob$eq slots into tp$richcompare\r\n    if (slots.tp$richcompare) {\r\n        // Either a klass defines a tp$richcompare slot or ob$eq slots\r\n        // if tp$richcompare is defined then create all the ob$eq slots\r\n        _set_up_richcompare_wrappers(slots);\r\n    }\r\n\r\n    // setup some reflected slots\r\n    if (slots.tp$as_number) {\r\n        _set_up_reflected_number_slots(slots);\r\n    }\r\n\r\n    // turn sequence slots into number slots\r\n    if (slots.tp$as_sequence_or_mapping) {\r\n        _set_up_sequence_to_number_slots(slots);\r\n    }\r\n\r\n    // make all slots non-enumerable - makes the dir implementation easier\r\n    Object.entries(slots).forEach(([slot_name, value]) => {\r\n        Object.defineProperty(proto, slot_name, {\r\n            value: value,\r\n            writable: true,\r\n        });\r\n    });\r\n\r\n    if (slots.tp$new) {\r\n        proto.__new__ = new Sk.builtin.sk_method(Sk.generic.newMethodDef, klass);\r\n        // this property is used in the implementation of calling __new__\r\n        Object.defineProperty(proto, \"sk$staticNew\", {value: klass, writable: true});\r\n    }\r\n\r\n    function wrap_func(dunder_name, wrapped_func) {\r\n        const slot_def = Sk.slots[dunder_name];\r\n        // we do this here because in the generic.wrapperCall methods the wrapped_func\r\n        // the wrapped func should have a $name property and a $flags property (for minArgs)\r\n        proto[dunder_name] = new Sk.builtin.wrapper_descriptor(klass, slot_def, wrapped_func);\r\n    }\r\n\r\n    function set_up_slot(dunder_name, wrapped_func) {\r\n        // some slots get multpile dunders\r\n        if (typeof dunder_name === \"string\") {\r\n            wrap_func(dunder_name, wrapped_func);\r\n        } else {\r\n            dunder_name.forEach((related_dunder_name) => {\r\n                wrap_func(related_dunder_name, wrapped_func);\r\n            });\r\n        }\r\n    }\r\n\r\n    // main slots\r\n    Sk.subSlots.main_slots.forEach(([slot_name, dunder_name]) => {\r\n        const wrapped_func = slots[slot_name];\r\n        if (wrapped_func !== undefined) {\r\n            set_up_slot(dunder_name, wrapped_func);\r\n        }\r\n    });\r\n\r\n    // __hash__\r\n    const hash = slots.tp$hash;\r\n    if (hash !== undefined) {   \r\n        if (typeof hash === \"function\") {\r\n            wrap_func(\"__hash__\", hash);\r\n        } else if (hash === Sk.builtin.none.none$) {\r\n            proto.__hash__ = hash;\r\n        } else {\r\n            Sk.asserts.fail(\"invalid tp$hash\");\r\n        }\r\n    }\r\n\r\n    // number_slots\r\n    if (slots.tp$as_number) {\r\n        Sk.subSlots.number_slots.forEach(([slot_name, dunder_name]) => {\r\n            const wrapped_func = slots[slot_name];\r\n            if (wrapped_func !== undefined) {\r\n                set_up_slot(dunder_name, wrapped_func);\r\n            }\r\n        });\r\n    }\r\n\r\n    // as_sequence_or_mapping slots\r\n    if (slots.tp$as_sequence_or_mapping) {\r\n        Sk.subSlots.sequence_and_mapping_slots.forEach(([slot_name, dunder_name]) => {\r\n            const wrapped_func = slots[slot_name];\r\n            if (wrapped_func !== undefined) {\r\n                set_up_slot(dunder_name, wrapped_func);\r\n            }\r\n        });\r\n    }\r\n\r\n    Object.defineProperty(proto, \"tp$slots\", { value: null, writable: true });\r\n};\r\n\r\n/**\r\n * @function\r\n * @param {string} typename\r\n * @param {Object} options An object literal that provides the functionality of the typobject\r\n * @returns {FunctionConstructor}\r\n *\r\n * @description\r\n * this can be called to create a native typeobj\r\n * options include\r\n * ```\r\n * - base: default to {@link Sk.builtin.object}\r\n * - meta: default to {@link Sk.builtin.type}\r\n *\r\n * - slots: skulpt slot functions that will be allocated slot wrappers\r\n * - methods: method objects `{$meth: Function, $flags: callmethod, $doc: string, $textsic: string|null}`,\r\n * - getsets: getset objects `{$get: Function, $set: Function, $doc: string}`,\r\n * - classmethods: classmethod objects `{$meth: Function, $flags: callmethod, $doc: string, $textsic: string|null}`,\r\n *\r\n * - flags: Object allocated directly onto class like `klass.sk$unacceptableBase`\r\n * - proto: Object allocated onto the prototype useful for private methods\r\n * ```\r\n * See most builtin type objects for examples\r\n *\r\n */\r\nSk.abstr.buildNativeClass = function (typename, options) {\r\n    options = options || {};\r\n    Sk.asserts.assert(options.hasOwnProperty(\"constructor\"), \"A constructor is required to build a native class\");\r\n\r\n    /**@type {FunctionConstructor} */\r\n    let typeobject = options.constructor;\r\n\r\n    // set the prototypical chains for inheritance\r\n    Sk.abstr.setUpInheritance(typename, typeobject, options.base, options.meta);\r\n\r\n    // Native classes can only be single inheritance objects\r\n    Sk.abstr.setUpBuiltinMro(typeobject);\r\n\r\n    const type_proto = typeobject.prototype;\r\n\r\n    Object.defineProperties(type_proto, {\r\n        // memoise these and make them null later\r\n        tp$slots: {value: options.slots, writable: true},\r\n        tp$getsets: {value: options.getsets, writable: true},\r\n        tp$methods: {value: options.methods, writable: true},\r\n        tp$classmethods: {value: options.classmethods, writable: true},\r\n    });\r\n\r\n    Sk.abstr.setUpSlots(typeobject, /**@lends {typeobject.prototype} */ options.slots || {});\r\n    Sk.abstr.setUpMethods(typeobject, options.methods);\r\n    Sk.abstr.setUpGetSets(typeobject, options.getsets);\r\n    Sk.abstr.setUpClassMethods(typeobject, options.classmethods);\r\n\r\n\r\n    const proto = options.proto || {};\r\n    Object.entries(proto).forEach(([p, val]) => {\r\n        Object.defineProperty(type_proto, p, {\r\n            value: val,\r\n            writable: true,\r\n            enumerable: !(p.includes(\"$\") || (p in Object.prototype)), \r\n            // only make these private in these cases otherwise they're public methods\r\n        });\r\n    });\r\n\r\n    const flags = options.flags || {};\r\n    Object.entries(flags).forEach(([flag, val]) => {\r\n        Object.defineProperty(typeobject, flag, {\r\n            value: val,\r\n            writable: true,\r\n        }); \r\n    });\r\n\r\n    // str might not have been created yet\r\n    if (Sk.builtin.str !== undefined && type_proto.hasOwnProperty(\"tp$doc\") && !type_proto.hasOwnProperty(\"__doc__\")) {\r\n        const docstr = type_proto.tp$doc || null;\r\n        if (typeof docstr === \"string\") {\r\n            type_proto.__doc__ = new Sk.builtin.str(docstr);\r\n        } else {\r\n            type_proto.__doc__ = Sk.builtin.none.none$;\r\n        }\r\n    }\r\n    return typeobject;\r\n};\r\n\r\n/**\r\n * @function\r\n *\r\n * @param {string} typename e.g. \"itertools.chain\"\r\n * @param {Object} iterator minimum options `{constructor: function, iternext: function}`\r\n *\r\n * @description\r\n * effectively a wrapper for easily defining an iterator\r\n * `tp$iter` slot is added and returns self\r\n *\r\n * define a constructor in the usual way\r\n *\r\n * define `tp$iternext` using iternext in the object literal\r\n * mostly as a convenience\r\n * you can also define `tp$iternext` in the slots which will take priority\r\n *\r\n * the main benefit of this helper function is to reduce some repetitive code for defining an iterator class\r\n *\r\n * If you want a generic iterator see {@link Sk.miscival.iterator}\r\n *\r\n *\r\n * @example\r\n * Sk.builtin.tuple_iter_ = Sk.abstr.buildIteratorClass(\"tuple_iterator\", {\r\n    constructor: function tuple_iter_(tuple) {\r\n        this.$index = 0;\r\n        this.$seq = tuple.sk$asarray();\r\n    },\r\n    iternext: function () {\r\n        if (this.$index >= this.$seq.length) {\r\n            return undefined;\r\n        }\r\n        return this.$seq[this.$index++];\r\n    }\r\n});\r\n * @returns {FunctionConstructor}\r\n *\r\n */\r\n\r\nSk.abstr.buildIteratorClass = function (typename, iterator) {\r\n    Sk.asserts.assert(iterator.hasOwnProperty(\"constructor\"), \"must provide a constructor\");\r\n    iterator.slots = iterator.slots || {};\r\n    iterator.slots.tp$iter = Sk.generic.selfIter;\r\n    iterator.slots.tp$iternext = iterator.slots.tp$iternext || iterator.iternext;\r\n    iterator.slots.tp$getattr = iterator.slots.tp$getattr || Sk.generic.getAttr;\r\n    let ret = Sk.abstr.buildNativeClass(typename, iterator);\r\n    Sk.abstr.built$iterators.push(ret);\r\n    return ret;\r\n};\r\n\r\nSk.abstr.built$iterators = [];\r\n\r\nSk.abstr.setUpModuleMethods = function (module_name, module, method_defs) {\r\n    Object.entries(method_defs).forEach(([method_name, method_def]) => {\r\n        method_def.$name = method_def.$name || method_name; // operator e.g. some methods share method_defs\r\n        module[method_name] = new Sk.builtin.sk_method(method_def, null, module_name);\r\n    });\r\n};\r\n\r\n/**\r\n * Call the super constructor of the provided class, with the object `self` as\r\n * the `this` value of that constructor. Any arguments passed to this function\r\n * after `self` will be passed as-is to the constructor.\r\n *\r\n * @param  {*} thisClass The subclass.\r\n * @param  {Object} self      The instance of the subclas.\r\n * @param  {...?} args Arguments to pass to the constructor.\r\n * @return {undefined}\r\n * @deprecated\r\n */\r\nSk.abstr.superConstructor = function (thisClass, self, args) {\r\n    var argumentsForConstructor = Array.prototype.slice.call(arguments, 2);\r\n    thisClass.prototype.tp$base.apply(self, argumentsForConstructor);\r\n};\r\n","Sk.asserts = {ENABLE_ASSERTS: true};\r\n\r\n/**\r\n * Cause assertion failure when condition is false.\r\n *\r\n * @param {*} condition condition to check\r\n * @param {string=} message error message\r\n */\r\nSk.asserts.assert = function (condition, message) {\r\n    if (Sk.asserts.ENABLE_ASSERTS && !condition) {\r\n        var msg = \"Assertion failure\";\r\n        if (message) {\r\n            msg = msg + \": \" + message;\r\n        }\r\n        throw new Error(msg);\r\n    }\r\n    return condition;\r\n};\r\nSk.exportSymbol(\"Sk.asserts.assert\", Sk.asserts.assert);\r\n\r\n/**\r\n * Cause assertion failure.\r\n *\r\n * @param {string=} message error message\r\n */\r\nSk.asserts.fail = function (message) {\r\n    if (Sk.asserts.ENABLE_ASSERTS) {\r\n        var msg = \"Assertion failure\";\r\n        if (message) {\r\n            msg = msg + \": \" + message;\r\n        }\r\n        throw new Error(msg);\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.asserts.fail\", Sk.asserts.fail);\r\n","//\r\n// This is pretty much a straight port of ast.c from CPython 3.7.3\r\n// (with a few leftovers from 2.6.5).\r\n//\r\n// The previous version was easier to work with and more JS-ish, but having a\r\n// somewhat different ast structure than cpython makes testing more difficult.\r\n//\r\n// This way, we can use a dump from the ast module on any arbitrary python\r\n// code and know that we're the same up to ast level, at least.\r\n//\r\n\r\nvar SYM = Sk.ParseTables.sym;\r\nvar TOK = Sk.token.tokens;\r\nvar COMP_GENEXP = 0;\r\nvar COMP_LISTCOMP = 1;\r\nvar COMP_SETCOMP = 2;\r\nvar NULL = null;\r\nvar _slice_kind = {\r\n    Slice_kind: 1,\r\n    ExtSlice_kind: 2,\r\n    Index_kind: 3\r\n};\r\n\r\nvar _expr_kind = {\r\n    BoolOp_kind: 1, NamedExpr_kind: 2, BinOp_kind: 3, UnaryOp_kind: 4,\r\n    Lambda_kind: 5, IfExp_kind: 6, Dict_kind: 7, Set_kind: 8,\r\n    ListComp_kind: 9, SetComp_kind: 10, DictComp_kind: 11,\r\n    GeneratorExp_kind: 12, Await_kind: 13, Yield_kind: 14,\r\n    YieldFrom_kind: 15, Compare_kind: 16, Call_kind: 17,\r\n    FormattedValue_kind: 18, JoinedStr_kind: 19, Constant_kind: 20,\r\n    Attribute_kind: 21, Subscript_kind: 22, Starred_kind: 23,\r\n    Name_kind: 24, List_kind: 25, Tuple_kind: 26\r\n};\r\n\r\n/** @constructor */\r\nfunction Compiling(encoding, filename, c_flags) {\r\n    this.c_encoding = encoding;\r\n    this.c_filename = filename;\r\n    this.c_flags = c_flags || 0;\r\n}\r\n\r\n/**\r\n * @return {number}\r\n */\r\nfunction NCH(n) {\r\n    Sk.asserts.assert(n !== undefined, \"node must be defined\");\r\n    if (n.children === null) {\r\n        return 0;\r\n    }\r\n    return n.children.length;\r\n}\r\n\r\nfunction CHILD(n, i) {\r\n    Sk.asserts.assert(n !== undefined, \"node must be defined\");\r\n    Sk.asserts.assert(i !== undefined, \"index of child must be specified\");\r\n    return n.children[i];\r\n}\r\n\r\nfunction REQ(n, type) {\r\n    Sk.asserts.assert(n.type === type, \"node wasn't expected type\");\r\n}\r\n\r\nfunction TYPE(n) {\r\n    return n.type;\r\n}\r\n\r\nfunction LINENO(n) {\r\n    return n.lineno;\r\n}\r\n\r\nfunction STR(ch) {\r\n    return ch.value;\r\n}\r\n\r\nfunction ast_error(c, n, msg) {\r\n    throw new Sk.builtin.SyntaxError(msg, c.c_filename, n.lineno);\r\n}\r\n\r\nfunction strobj(s) {\r\n    Sk.asserts.assert(typeof s === \"string\", \"expecting string, got \" + (typeof s));\r\n    return new Sk.builtin.str(s);\r\n}\r\n\r\n/** @return {number} */\r\nfunction numStmts(n) {\r\n    var ch;\r\n    var i;\r\n    var cnt;\r\n    switch (n.type) {\r\n        case SYM.single_input:\r\n            if (CHILD(n, 0).type === TOK.T_NEWLINE) {\r\n                return 0;\r\n            } else {\r\n                return numStmts(CHILD(n, 0));\r\n            }\r\n        case SYM.file_input:\r\n            cnt = 0;\r\n            for (i = 0; i < NCH(n); ++i) {\r\n                ch = CHILD(n, i);\r\n                if (ch.type === SYM.stmt) {\r\n                    cnt += numStmts(ch);\r\n                }\r\n            }\r\n            return cnt;\r\n        case SYM.stmt:\r\n            return numStmts(CHILD(n, 0));\r\n        case SYM.compound_stmt:\r\n            return 1;\r\n        case SYM.simple_stmt:\r\n            return Math.floor(NCH(n) / 2); // div 2 is to remove count of ;s\r\n        case SYM.suite:\r\n            if (NCH(n) === 1) {\r\n                return numStmts(CHILD(n, 0));\r\n            } else {\r\n                cnt = 0;\r\n                for (i = 2; i < NCH(n) - 1; ++i) {\r\n                    cnt += numStmts(CHILD(n, i));\r\n                }\r\n                return cnt;\r\n            }\r\n            break;\r\n        default:\r\n            Sk.asserts.fail(\"Non-statement found\");\r\n    }\r\n    return 0;\r\n}\r\n\r\nfunction forbiddenCheck(c, n, x, lineno) {\r\n    if (x instanceof Sk.builtin.str) {\r\n        x = x.v;\r\n    }\r\n    if (x === \"None\") {\r\n        throw new Sk.builtin.SyntaxError(\"assignment to None\", c.c_filename, lineno);\r\n    }\r\n    if (x === \"True\" || x === \"False\") {\r\n        throw new Sk.builtin.SyntaxError(\"assignment to True or False is forbidden\", c.c_filename, lineno);\r\n    }\r\n}\r\n\r\n/**\r\n * Set the context ctx for e, recursively traversing e.\r\n *\r\n * Only sets context for expr kinds that can appear in assignment context as\r\n * per the asdl file.\r\n */\r\nfunction setContext(c, e, ctx, n) {\r\n    var i;\r\n    var exprName;\r\n    var s;\r\n    Sk.asserts.assert(ctx !== Sk.astnodes.AugStore && ctx !== Sk.astnodes.AugLoad, \"context not AugStore or AugLoad\");\r\n    s = null;\r\n    exprName = null;\r\n\r\n    switch (e.constructor) {\r\n        case Sk.astnodes.Attribute:\r\n        case Sk.astnodes.Name:\r\n            if (ctx === Sk.astnodes.Store) {\r\n                forbiddenCheck(c, n, e.attr, n.lineno);\r\n            }\r\n            e.ctx = ctx;\r\n            break;\r\n        case Sk.astnodes.Starred:\r\n            e.ctx = ctx;\r\n            setContext(c, e.value, ctx, n);\r\n            break;\r\n        case Sk.astnodes.Subscript:\r\n            e.ctx = ctx;\r\n            break;\r\n        case Sk.astnodes.List:\r\n            e.ctx = ctx;\r\n            s = e.elts;\r\n            break;\r\n        case Sk.astnodes.Tuple:\r\n            if (e.elts.length === 0) {\r\n                throw new Sk.builtin.SyntaxError(\"can't assign to ()\", c.c_filename, n.lineno);\r\n            }\r\n            e.ctx = ctx;\r\n            s = e.elts;\r\n            break;\r\n        case Sk.astnodes.Lambda:\r\n            exprName = \"lambda\";\r\n            break;\r\n        case Sk.astnodes.Call:\r\n            exprName = \"function call\";\r\n            break;\r\n        case Sk.astnodes.BoolOp:\r\n        case Sk.astnodes.BinOp:\r\n        case Sk.astnodes.UnaryOp:\r\n            exprName = \"operator\";\r\n            break;\r\n        case Sk.astnodes.GeneratorExp:\r\n            exprName = \"generator expression\";\r\n            break;\r\n        case Sk.astnodes.Yield:\r\n            exprName = \"yield expression\";\r\n            break;\r\n        case Sk.astnodes.ListComp:\r\n            exprName = \"list comprehension\";\r\n            break;\r\n        case Sk.astnodes.SetComp:\r\n            exprName = \"set comprehension\";\r\n            break;\r\n        case Sk.astnodes.DictComp:\r\n            exprName = \"dict comprehension\";\r\n            break;\r\n        case Sk.astnodes.Dict:\r\n        case Sk.astnodes.Set:\r\n        case Sk.astnodes.Num:\r\n        case Sk.astnodes.Str:\r\n            exprName = \"literal\";\r\n            break;\r\n        case Sk.astnodes.NameConstant:\r\n            exprName = \"True, False or None\";\r\n            break;\r\n        case Sk.astnodes.Compare:\r\n            exprName = \"comparison\";\r\n            break;\r\n        case Sk.astnodes.Repr:\r\n            exprName = \"repr\";\r\n            break;\r\n        case Sk.astnodes.IfExp:\r\n            exprName = \"conditional expression\";\r\n            break;\r\n        default:\r\n            Sk.asserts.fail(\"unhandled expression in assignment\");\r\n    }\r\n    if (exprName) {\r\n        throw new Sk.builtin.SyntaxError(\"can't \" + (ctx === Sk.astnodes.Store ? \"assign to\" : \"delete\") + \" \" + exprName, c.c_filename, n.lineno);\r\n    }\r\n\r\n    if (s) {\r\n        for (i = 0; i < s.length; ++i) {\r\n            setContext(c, s[i], ctx, n);\r\n        }\r\n    }\r\n}\r\n\r\nvar operatorMap = {};\r\n(function () {\r\n    operatorMap[TOK.T_VBAR] = Sk.astnodes.BitOr;\r\n    operatorMap[TOK.T_CIRCUMFLEX] = Sk.astnodes.BitXor;\r\n    operatorMap[TOK.T_AMPER] = Sk.astnodes.BitAnd;\r\n    operatorMap[TOK.T_LEFTSHIFT] = Sk.astnodes.LShift;\r\n    operatorMap[TOK.T_RIGHTSHIFT] = Sk.astnodes.RShift;\r\n    operatorMap[TOK.T_PLUS] = Sk.astnodes.Add;\r\n    operatorMap[TOK.T_MINUS] = Sk.astnodes.Sub;\r\n    operatorMap[TOK.T_STAR] = Sk.astnodes.Mult;\r\n    operatorMap[TOK.T_SLASH] = Sk.astnodes.Div;\r\n    operatorMap[TOK.T_DOUBLESLASH] = Sk.astnodes.FloorDiv;\r\n    operatorMap[TOK.T_PERCENT] = Sk.astnodes.Mod;\r\n}());\r\n\r\nSk.setupOperators = function (py3) {\r\n    if (py3) {\r\n        operatorMap[TOK.T_AT] = Sk.astnodes.MatMult;\r\n    } else {\r\n        if (operatorMap[TOK.T_AT]) {\r\n            delete operatorMap[TOK.T_AT];\r\n        }\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.setupOperators\", Sk.setupOperators);\r\n\r\nfunction getOperator(n) {\r\n    if (operatorMap[n.type] === undefined) {\r\n        throw new Sk.builtin.SyntaxError(\"invalid syntax\", n.type, n.lineno);\r\n    }\r\n    return operatorMap[n.type];\r\n}\r\n\r\nfunction new_identifier(n, c) {\r\n    if (n.value) {\r\n        return new Sk.builtin.str(n.value);\r\n    }\r\n\r\n    return new Sk.builtin.str(n);\r\n}\r\n\r\nfunction astForCompOp(c, n) {\r\n    /* comp_op: '<'|'>'|'=='|'>='|'<='|'!='|'in'|'not' 'in'|'is'\r\n     |'is' 'not'\r\n     */\r\n    REQ(n, SYM.comp_op);\r\n    if (NCH(n) === 1) {\r\n        n = CHILD(n, 0);\r\n        switch (n.type) {\r\n            case TOK.T_LESS:\r\n                return Sk.astnodes.Lt;\r\n            case TOK.T_GREATER:\r\n                return Sk.astnodes.Gt;\r\n            case TOK.T_EQEQUAL:\r\n                return Sk.astnodes.Eq;\r\n            case TOK.T_LESSEQUAL:\r\n                return Sk.astnodes.LtE;\r\n            case TOK.T_GREATEREQUAL:\r\n                return Sk.astnodes.GtE;\r\n            case TOK.T_NOTEQUAL:\r\n                return Sk.astnodes.NotEq;\r\n            case TOK.T_NAME:\r\n                if (n.value === \"in\") {\r\n                    return Sk.astnodes.In;\r\n                }\r\n                if (n.value === \"is\") {\r\n                    return Sk.astnodes.Is;\r\n                }\r\n        }\r\n    } else if (NCH(n) === 2) {\r\n        if (CHILD(n, 0).type === TOK.T_NAME) {\r\n            if (CHILD(n, 1).value === \"in\") {\r\n                return Sk.astnodes.NotIn;\r\n            }\r\n            if (CHILD(n, 0).value === \"is\") {\r\n                return Sk.astnodes.IsNot;\r\n            }\r\n        }\r\n    }\r\n    Sk.asserts.fail(\"invalid comp_op\");\r\n}\r\n\r\nfunction copy_location(e, n) {\r\n    if (e) {\r\n        e.lineno = LINENO(n);\r\n        e.col_offset = n.col_offset;\r\n        e.end_lineno = n.end_lineno;\r\n        e.end_col_offset = n.end_col_offset;\r\n    }\r\n    return e;\r\n}\r\n\r\nfunction seq_for_testlist(c, n) {\r\n    /* testlist: test (',' test)* [',']\r\n       testlist_star_expr: test|star_expr (',' test|star_expr)* [',']\r\n    */\r\n    var i;\r\n    var seq = [];\r\n    Sk.asserts.assert(n.type === SYM.testlist ||\r\n        n.type === SYM.testlist_star_expr ||\r\n        n.type === SYM.listmaker ||\r\n        n.type === SYM.testlist_comp ||\r\n        n.type === SYM.testlist_safe ||\r\n        n.type === SYM.testlist1, \"node type must be listlike\");\r\n    for (i = 0; i < NCH(n); i += 2) {\r\n        Sk.asserts.assert(CHILD(n, i).type === SYM.test || CHILD(n, i).type === SYM.old_test || CHILD(n, i).type === SYM.star_expr);\r\n        seq[i / 2] = ast_for_expr(c, CHILD(n, i));\r\n    }\r\n    return seq;\r\n}\r\n\r\nfunction astForSuite(c, n) {\r\n    /* suite: simple_stmt | NEWLINE INDENT stmt+ DEDENT */\r\n    var j;\r\n    var num;\r\n    var i;\r\n    var end;\r\n    var ch;\r\n    var pos;\r\n    var seq;\r\n    REQ(n, SYM.suite);\r\n    seq = [];\r\n    pos = 0;\r\n    if (CHILD(n, 0).type === SYM.simple_stmt) {\r\n        n = CHILD(n, 0);\r\n        /* simple_stmt always ends with an NEWLINE and may have a trailing\r\n         * SEMI. */\r\n        end = NCH(n) - 1;\r\n        if (CHILD(n, end - 1).type === TOK.T_SEMI) {\r\n            end -= 1;\r\n        }\r\n        for (i = 0; i < end; i += 2) {// by 2 to skip ;\r\n            seq[pos++] = astForStmt(c, CHILD(n, i));\r\n        }\r\n    } else {\r\n        for (i = 2; i < NCH(n) - 1; ++i) {\r\n            ch = CHILD(n, i);\r\n            REQ(ch, SYM.stmt);\r\n            num = numStmts(ch);\r\n            if (num === 1) {\r\n                // small_stmt or compound_stmt w/ only 1 child\r\n                seq[pos++] = astForStmt(c, ch);\r\n            } else {\r\n                ch = CHILD(ch, 0);\r\n                REQ(ch, SYM.simple_stmt);\r\n                for (j = 0; j < NCH(ch); j += 2) {\r\n                    if (NCH(CHILD(ch, j)) === 0) {\r\n                        Sk.asserts.assert(j + 1 === NCH(ch));\r\n                        break;\r\n                    }\r\n                    seq[pos++] = astForStmt(c, CHILD(ch, j));\r\n                }\r\n            }\r\n        }\r\n    }\r\n    Sk.asserts.assert(pos === numStmts(n));\r\n    return seq;\r\n}\r\n\r\nfunction astForExceptClause(c, exc, body) {\r\n    /* except_clause: 'except' [test [(',' | 'as') test]] */\r\n    var e;\r\n    REQ(exc, SYM.except_clause);\r\n    REQ(body, SYM.suite);\r\n    if (NCH(exc) === 1) {\r\n        return new Sk.astnodes.ExceptHandler(null, null, astForSuite(c, body), exc.lineno, exc.col_offset, exc.end_lineno, exc.end_col_offset);\r\n    } else if (NCH(exc) === 2) {\r\n        return new Sk.astnodes.ExceptHandler(ast_for_expr(c, CHILD(exc, 1)), null, astForSuite(c, body), exc.lineno, exc.col_offset, exc.end_lineno, exc.end_col_offset);\r\n    } else if (NCH(exc) === 4) {\r\n        if (Sk.__future__.python3 && CHILD(exc, 2).value == \",\") {\r\n            ast_error(c, exc, \"Old-style 'except' clauses are not supported in Python 3\");\r\n        }\r\n\r\n        var expression = ast_for_expr(c, CHILD(exc, 1));\r\n        e = ast_for_expr(c, CHILD(exc, 3));\r\n        setContext(c, e, Sk.astnodes.Store, CHILD(exc, 3));\r\n        return new Sk.astnodes.ExceptHandler(ast_for_expr(c, CHILD(exc, 1)), e, astForSuite(c, body), exc.lineno, exc.col_offset, exc.end_lineno, exc.end_col_offset);\r\n    }\r\n    Sk.asserts.fail(\"wrong number of children for except clause\");\r\n}\r\n\r\nfunction astForTryStmt(c, n) {\r\n    var exceptSt;\r\n    var i;\r\n    var handlers = [];\r\n    var nc = NCH(n);\r\n    var nexcept = (nc - 3) / 3;\r\n    var body, orelse = [],\r\n        finally_ = null;\r\n\r\n    REQ(n, SYM.try_stmt);\r\n    body = astForSuite(c, CHILD(n, 2));\r\n    if (CHILD(n, nc - 3).type === TOK.T_NAME) {\r\n        if (CHILD(n, nc - 3).value === \"finally\") {\r\n            if (nc >= 9 && CHILD(n, nc - 6).type === TOK.T_NAME) {\r\n                /* we can assume it's an \"else\",\r\n                 because nc >= 9 for try-else-finally and\r\n                 it would otherwise have a type of except_clause */\r\n                orelse = astForSuite(c, CHILD(n, nc - 4));\r\n                nexcept--;\r\n            }\r\n\r\n            finally_ = astForSuite(c, CHILD(n, nc - 1));\r\n            nexcept--;\r\n        } else {\r\n            /* we can assume it's an \"else\",\r\n             otherwise it would have a type of except_clause */\r\n            orelse = astForSuite(c, CHILD(n, nc - 1));\r\n            nexcept--;\r\n        }\r\n    } else if (CHILD(n, nc - 3).type !== SYM.except_clause) {\r\n        throw new Sk.builtin.SyntaxError(\"malformed 'try' statement\", c.c_filename, n.lineno);\r\n    }\r\n\r\n    if (nexcept > 0) {\r\n        /* process except statements to create a try ... except */\r\n        for (i = 0; i < nexcept; i++) {\r\n            handlers[i] = astForExceptClause(c, CHILD(n, 3 + i * 3), CHILD(n, 5 + i * 3));\r\n        }\r\n    }\r\n\r\n    Sk.asserts.assert(!!finally_ || handlers.length != 0);\r\n    return new Sk.astnodes.Try(body, handlers, orelse, finally_, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n}\r\n\r\nfunction astForDottedName(c, n) {\r\n    var i;\r\n    var e;\r\n    var id;\r\n    var col_offset;\r\n    var lineno;\r\n    REQ(n, SYM.dotted_name);\r\n    lineno = n.lineno;\r\n    col_offset = n.col_offset;\r\n    id = strobj(CHILD(n, 0).value);\r\n    e = new Sk.astnodes.Name(id, Sk.astnodes.Load, lineno, col_offset, n.end_lineno, n.end_col_offset);\r\n    for (i = 2; i < NCH(n); i += 2) {\r\n        id = strobj(CHILD(n, i).value);\r\n        e = new Sk.astnodes.Attribute(e, id, Sk.astnodes.Load, lineno, col_offset, n.end_lineno, n.end_col_offset);\r\n    }\r\n    return e;\r\n}\r\n\r\nfunction astForDecorator(c, n) {\r\n    /* decorator: '@' dotted_name [ '(' [arglist] ')' ] NEWLINE */\r\n    var nameExpr;\r\n    REQ(n, SYM.decorator);\r\n    REQ(CHILD(n, 0), TOK.T_AT);\r\n    REQ(CHILD(n, NCH(n) - 1), TOK.T_NEWLINE);\r\n    nameExpr = astForDottedName(c, CHILD(n, 1));\r\n    if (NCH(n) === 3) {// no args\r\n        return nameExpr;\r\n    } else if (NCH(n) === 5) {// call with no args\r\n        return new Sk.astnodes.Call(nameExpr, [], [],\r\n                                    n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n    } else {\r\n        return ast_for_call(c, CHILD(n, 3), nameExpr);\r\n    }\r\n}\r\n\r\nfunction astForDecorators(c, n) {\r\n    var i;\r\n    var decoratorSeq;\r\n    REQ(n, SYM.decorators);\r\n    decoratorSeq = [];\r\n    for (i = 0; i < NCH(n); ++i) {\r\n        decoratorSeq[i] = astForDecorator(c, CHILD(n, i));\r\n    }\r\n    return decoratorSeq;\r\n}\r\n\r\nfunction ast_for_decorated(c, n) {\r\n    /* decorated: decorators (classdef | funcdef | async_funcdef) */\r\n    var thing = null;\r\n    var decorator_seq = null;\r\n\r\n    REQ(n, SYM.decorated);\r\n\r\n    decorator_seq = astForDecorators(c, CHILD(n, 0));\r\n    Sk.asserts.assert(TYPE(CHILD(n, 1)) == SYM.funcdef ||\r\n        TYPE(CHILD(n, 1)) == SYM.async_funcdef ||\r\n        TYPE(CHILD(n, 1)) == SYM.classdef);\r\n\r\n    if (TYPE(CHILD(n, 1)) == SYM.funcdef) {\r\n        thing = ast_for_funcdef(c, CHILD(n, 1), decorator_seq);\r\n    } else if (TYPE(CHILD(n, 1)) == SYM.classdef) {\r\n        thing = astForClassdef(c, CHILD(n, 1), decorator_seq);\r\n    } else if (TYPE(CHILD(n, 1)) == SYM.async_funcdef) {\r\n        thing = ast_for_async_funcdef(c, CHILD(n, 1), decorator_seq);\r\n    }\r\n    /* we count the decorators in when talking about the class' or\r\n        * function's line number */\r\n    if (thing) {\r\n        thing.lineno = LINENO(n);\r\n        thing.col_offset = n.col_offset;\r\n    }\r\n    return thing;\r\n}\r\n\r\n/* with_item: test ['as' expr] */\r\nfunction ast_for_with_item(c, n) {\r\n    var context_expr, optional_vars;\r\n    REQ(n, SYM.with_item);\r\n    context_expr = ast_for_expr(c, CHILD(n, 0));\r\n    if (NCH(n) == 3) {\r\n        optional_vars = ast_for_expr(c, CHILD(n, 2));\r\n        setContext(c, optional_vars, Sk.astnodes.Store, n);\r\n    }\r\n\r\n    return new Sk.astnodes.withitem(context_expr, optional_vars);\r\n}\r\n\r\n/* with_stmt: 'with' with_item (',' with_item)* ':' suite */\r\nfunction ast_for_with_stmt(c, n0, is_async) {\r\n    const n = is_async ? CHILD(n0, 1) : n0;\r\n    var i;\r\n    var items = [], body;\r\n\r\n    REQ(n, SYM.with_stmt);\r\n\r\n    for (i = 1; i < NCH(n) - 2; i += 2) {\r\n        var item = ast_for_with_item(c, CHILD(n, i));\r\n        items[(i - 1) / 2] = item;\r\n    }\r\n\r\n    body = astForSuite(c, CHILD(n, NCH(n) - 1));\r\n\r\n    if (is_async) {\r\n        return new Sk.astnodes.AsyncWith(items, body, LINENO(n0), n0.col_offset, n0.end_lineno, n0.end_col_offset);\r\n    } else {\r\n        return new Sk.astnodes.With(items, body, LINENO(n), n.col_offset, n.end_lineno, n.end_col_offset);\r\n    }\r\n}\r\n\r\nfunction astForExecStmt(c, n) {\r\n    var expr1, globals = null, locals = null;\r\n    var nchildren = NCH(n);\r\n    Sk.asserts.assert(nchildren === 2 || nchildren === 4 || nchildren === 6);\r\n\r\n    /* exec_stmt: 'exec' expr ['in' test [',' test]] */\r\n    REQ(n, SYM.exec_stmt);\r\n    expr1 = ast_for_expr(c, CHILD(n, 1));\r\n    if (nchildren >= 4) {\r\n        globals = ast_for_expr(c, CHILD(n, 3));\r\n    }\r\n    if (nchildren === 6) {\r\n        locals = ast_for_expr(c, CHILD(n, 5));\r\n    }\r\n    return new Sk.astnodes.Exec(expr1, globals, locals, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n}\r\n\r\nfunction astForIfStmt(c, n) {\r\n    /* if_stmt: 'if' test ':' suite ('elif' test ':' suite)*\r\n     ['else' ':' suite]\r\n     */\r\n    var off;\r\n    var i;\r\n    var orelse;\r\n    var hasElse;\r\n    var nElif;\r\n    var decider;\r\n    var s;\r\n    REQ(n, SYM.if_stmt);\r\n    if (NCH(n) === 4) {\r\n        return new Sk.astnodes.If(\r\n            ast_for_expr(c, CHILD(n, 1)),\r\n            astForSuite(c, CHILD(n, 3)),\r\n            [], n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n    }\r\n\r\n    s = CHILD(n, 4).value;\r\n    decider = s.charAt(2); // elSe or elIf\r\n    if (decider === \"s\") {\r\n        return new Sk.astnodes.If(\r\n            ast_for_expr(c, CHILD(n, 1)),\r\n            astForSuite(c, CHILD(n, 3)),\r\n            astForSuite(c, CHILD(n, 6)),\r\n            n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n    } else if (decider === \"i\") {\r\n        nElif = NCH(n) - 4;\r\n        hasElse = false;\r\n        orelse = [];\r\n\r\n        /* must reference the child nElif+1 since 'else' token is third, not\r\n         * fourth child from the end. */\r\n        if (CHILD(n, nElif + 1).type === TOK.T_NAME &&\r\n            CHILD(n, nElif + 1).value.charAt(2) === \"s\") {\r\n            hasElse = true;\r\n            nElif -= 3;\r\n        }\r\n        nElif /= 4;\r\n\r\n        if (hasElse) {\r\n            orelse = [\r\n                new Sk.astnodes.If(\r\n                    ast_for_expr(c, CHILD(n, NCH(n) - 6)),\r\n                    astForSuite(c, CHILD(n, NCH(n) - 4)),\r\n                    astForSuite(c, CHILD(n, NCH(n) - 1)),\r\n                    CHILD(n, NCH(n) - 6).lineno,\r\n                    CHILD(n, NCH(n) - 6).col_offset,\r\n                    CHILD(n, NCH(n) - 6).end_lineno,\r\n                    CHILD(n, NCH(n) - 6).end_col_offset)];\r\n            nElif--;\r\n        }\r\n\r\n        for (i = 0; i < nElif; ++i) {\r\n            off = 5 + (nElif - i - 1) * 4;\r\n            orelse = [\r\n                new Sk.astnodes.If(\r\n                    ast_for_expr(c, CHILD(n, off)),\r\n                    astForSuite(c, CHILD(n, off + 2)),\r\n                    orelse,\r\n                    CHILD(n, off).lineno,\r\n                    CHILD(n, off).col_offset,\r\n                    CHILD(n, NCH(n) - 6).end_lineno,\r\n                    CHILD(n, NCH(n) - 6).end_col_offset)];\r\n        }\r\n        return new Sk.astnodes.If(\r\n            ast_for_expr(c, CHILD(n, 1)),\r\n            astForSuite(c, CHILD(n, 3)),\r\n            orelse, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n    }\r\n\r\n    Sk.asserts.fail(\"unexpected token in 'if' statement\");\r\n}\r\n\r\nfunction ast_for_exprlist(c, n, context) {\r\n    var e;\r\n    var i;\r\n    var seq;\r\n    REQ(n, SYM.exprlist);\r\n    seq = [];\r\n    for (i = 0; i < NCH(n); i += 2) {\r\n        e = ast_for_expr(c, CHILD(n, i));\r\n        seq[i / 2] = e;\r\n        if (context) {\r\n            setContext(c, e, context, CHILD(n, i));\r\n        }\r\n    }\r\n    return seq;\r\n}\r\n\r\nfunction astForDelStmt(c, n) {\r\n    /* del_stmt: 'del' exprlist */\r\n    REQ(n, SYM.del_stmt);\r\n    return new Sk.astnodes.Delete(ast_for_exprlist(c, CHILD(n, 1), Sk.astnodes.Del), n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n}\r\n\r\nfunction astForGlobalStmt(c, n) {\r\n    /* global_stmt: 'global' NAME (',' NAME)* */\r\n    var i;\r\n    var s = [];\r\n    REQ(n, SYM.global_stmt);\r\n    for (i = 1; i < NCH(n); i += 2) {\r\n        s[(i - 1) / 2] = strobj(CHILD(n, i).value);\r\n    }\r\n    return new Sk.astnodes.Global(s, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n}\r\n\r\nfunction astForAssertStmt(c, n) {\r\n    /* assert_stmt: 'assert' test [',' test] */\r\n    REQ(n, SYM.assert_stmt);\r\n    if (NCH(n) === 2) {\r\n        return new Sk.astnodes.Assert(ast_for_expr(c, CHILD(n, 1)), null, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n    } else if (NCH(n) === 4) {\r\n        return new Sk.astnodes.Assert(ast_for_expr(c, CHILD(n, 1)), ast_for_expr(c, CHILD(n, 3)), n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n    }\r\n    Sk.asserts.fail(\"improper number of parts to assert stmt\");\r\n}\r\n\r\nfunction aliasForImportName(c, n) {\r\n    /*\r\n     import_as_name: NAME ['as' NAME]\r\n     dotted_as_name: dotted_name ['as' NAME]\r\n     dotted_name: NAME ('.' NAME)*\r\n     */\r\n\r\n    var i;\r\n    var a;\r\n    var name;\r\n    var str;\r\n    loop: while (true) {\r\n        switch (n.type) {\r\n            case SYM.import_as_name:\r\n                str = null;\r\n                name = strobj(CHILD(n, 0).value);\r\n                if (NCH(n) === 3) {\r\n                    str = CHILD(n, 2).value;\r\n                }\r\n                return new Sk.astnodes.alias(name, str == null ? null : strobj(str));\r\n            case SYM.dotted_as_name:\r\n                if (NCH(n) === 1) {\r\n                    n = CHILD(n, 0);\r\n                    continue loop;\r\n                } else {\r\n                    a = aliasForImportName(c, CHILD(n, 0));\r\n                    Sk.asserts.assert(!a.asname);\r\n                    a.asname = strobj(CHILD(n, 2).value);\r\n                    return a;\r\n                }\r\n                break;\r\n            case SYM.dotted_name:\r\n                if (NCH(n) === 1) {\r\n                    return new Sk.astnodes.alias(strobj(CHILD(n, 0).value), null);\r\n                } else {\r\n                    // create a string of the form a.b.c\r\n                    str = \"\";\r\n                    for (i = 0; i < NCH(n); i += 2) {\r\n                        str += CHILD(n, i).value + \".\";\r\n                    }\r\n                    return new Sk.astnodes.alias(strobj(str.substr(0, str.length - 1)), null);\r\n                }\r\n                break;\r\n            case TOK.T_STAR:\r\n                return new Sk.astnodes.alias(strobj(\"*\"), null);\r\n            default:\r\n                throw new Sk.builtin.SyntaxError(\"unexpected import name\", c.c_filename, n.lineno);\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nfunction astForImportStmt(c, n) {\r\n    /*\r\n     import_stmt: import_name | import_from\r\n     import_name: 'import' dotted_as_names\r\n     import_from: 'from' ('.'* dotted_name | '.') 'import'\r\n     ('*' | '(' import_as_names ')' | import_as_names)\r\n     */\r\n    var modname;\r\n    var idx;\r\n    var nchildren;\r\n    var ndots;\r\n    var mod;\r\n    var i;\r\n    var aliases;\r\n    var col_offset;\r\n    var lineno;\r\n    var end_lineno;\r\n    var end_col_offset;\r\n    REQ(n, SYM.import_stmt);\r\n    lineno = n.lineno;\r\n    col_offset = n.col_offset;\r\n    end_lineno = n.end_lineno;\r\n    end_col_offset = n.end_col_offset;\r\n    n = CHILD(n, 0);\r\n    if (n.type === SYM.import_name) {\r\n        n = CHILD(n, 1);\r\n        REQ(n, SYM.dotted_as_names);\r\n        aliases = [];\r\n        for (i = 0; i < NCH(n); i += 2) {\r\n            aliases[i / 2] = aliasForImportName(c, CHILD(n, i));\r\n        }\r\n        return new Sk.astnodes.Import(aliases, lineno, col_offset, end_lineno, end_col_offset);\r\n    } else if (n.type === SYM.import_from) {\r\n        mod = null;\r\n        ndots = 0;\r\n\r\n        for (idx = 1; idx < NCH(n); ++idx) {\r\n            if (CHILD(n, idx).type === SYM.dotted_name) {\r\n                mod = aliasForImportName(c, CHILD(n, idx));\r\n                idx++;\r\n                break;\r\n            } else if (CHILD(n, idx).type === TOK.T_DOT) {\r\n                ndots++;\r\n            } else if (CHILD(n, idx).type === TOK.T_ELLIPSIS) {\r\n                ndots += 3;\r\n            } else {\r\n                break;\r\n            }\r\n        }\r\n        ++idx; // skip the import keyword\r\n        switch (CHILD(n, idx).type) {\r\n            case TOK.T_STAR:\r\n                // from ... import\r\n                n = CHILD(n, idx);\r\n                nchildren = 1;\r\n                break;\r\n            case TOK.T_LPAR:\r\n                // from ... import (x, y, z)\r\n                n = CHILD(n, idx + 1);\r\n                nchildren = NCH(n);\r\n                break;\r\n            case SYM.import_as_names:\r\n                // from ... import x, y, z\r\n                n = CHILD(n, idx);\r\n                nchildren = NCH(n);\r\n                if (nchildren % 2 === 0) {\r\n                    throw new Sk.builtin.SyntaxError(\"trailing comma not allowed without surrounding parentheses\", c.c_filename, n.lineno);\r\n                }\r\n                break;\r\n            default:\r\n                throw new Sk.builtin.SyntaxError(\"Unexpected node-type in from-import\", c.c_filename, n.lineno);\r\n        }\r\n        aliases = [];\r\n        if (n.type === TOK.T_STAR) {\r\n            aliases[0] = aliasForImportName(c, n);\r\n        } else {\r\n            for (i = 0; i < NCH(n); i += 2) {\r\n                aliases[i / 2] = aliasForImportName(c, CHILD(n, i));\r\n            }\r\n        }\r\n        modname = mod ? mod.name.v : \"\";\r\n        return new Sk.astnodes.ImportFrom(strobj(modname), aliases, ndots, lineno, col_offset, end_lineno, end_col_offset);\r\n    }\r\n    throw new Sk.builtin.SyntaxError(\"unknown import statement\", c.c_filename, n.lineno);\r\n}\r\n\r\nfunction ast_for_testlistComp(c, n) {\r\n    /* testlist_comp: test ( comp_for | (',' test)* [','] ) */\r\n    /* argument: test [comp_for] */\r\n    Sk.asserts.assert(n.type === SYM.testlist_comp || n.type === SYM.argument);\r\n    if (NCH(n) > 1 && CHILD(n, 1).type === SYM.comp_for) {\r\n        return ast_for_gen_expr(c, n);\r\n    }\r\n    return ast_for_testlist(c, n);\r\n}\r\n\r\nfunction ast_for_genexp(c, n) {\r\n    Sk.asserts.assert(TYPE(n) == SYM.testlist_comp || TYPE(n) == SYM.argument);\r\n    return ast_for_itercomp(c, n, COMP_GENEXP);\r\n}\r\n\r\nfunction ast_for_listcomp(c, n) {\r\n    Sk.asserts.assert(TYPE(n) == (SYM.testlist_comp));\r\n    return ast_for_itercomp(c, n, COMP_LISTCOMP);\r\n}\r\n\r\nfunction astForFactor(c, n) {\r\n    /* some random peephole thing that cpy does */\r\n    var expression;\r\n    var pnum;\r\n    var patom;\r\n    var ppower;\r\n    var pfactor;\r\n    if (CHILD(n, 0).type === TOK.T_MINUS && NCH(n) === 2) {\r\n        pfactor = CHILD(n, 1);\r\n        if (pfactor.type === SYM.factor && NCH(pfactor) === 1) {\r\n            ppower = CHILD(pfactor, 0);\r\n            if (ppower.type === SYM.power && NCH(ppower) === 1) {\r\n                patom = CHILD(ppower, 0);\r\n                if (patom.type === SYM.atom) {\r\n                    pnum = CHILD(patom, 0);\r\n                    if (pnum.type === TOK.T_NUMBER) {\r\n                        pnum.value = \"-\" + pnum.value;\r\n                        return ast_for_atom(c, patom);\r\n                    }\r\n                }\r\n            }\r\n        }\r\n    }\r\n\r\n    expression = ast_for_expr(c, CHILD(n, 1));\r\n    switch (CHILD(n, 0).type) {\r\n        case TOK.T_PLUS:\r\n            return new Sk.astnodes.UnaryOp(Sk.astnodes.UAdd, expression, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n        case TOK.T_MINUS:\r\n            return new Sk.astnodes.UnaryOp(Sk.astnodes.USub, expression, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n        case TOK.T_TILDE:\r\n            return new Sk.astnodes.UnaryOp(Sk.astnodes.Invert, expression, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n    }\r\n\r\n    Sk.asserts.fail(\"unhandled factor\");\r\n}\r\n\r\nfunction astForForStmt(c, n) {\r\n    /* for_stmt: 'for' exprlist 'in' testlist ':' suite ['else' ':' suite] */\r\n    var target;\r\n    var _target;\r\n    var nodeTarget;\r\n    var seq = [];\r\n    REQ(n, SYM.for_stmt);\r\n    if (NCH(n) === 9) {\r\n        seq = astForSuite(c, CHILD(n, 8));\r\n    }\r\n    nodeTarget = CHILD(n, 1);\r\n    _target = ast_for_exprlist(c, nodeTarget, Sk.astnodes.Store);\r\n    if (NCH(nodeTarget) === 1) {\r\n        target = _target[0];\r\n    } else {\r\n        target = new Sk.astnodes.Tuple(_target, Sk.astnodes.Store, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n    }\r\n\r\n    return new Sk.astnodes.For(target,\r\n                               ast_for_testlist(c, CHILD(n, 3)),\r\n                               astForSuite(c, CHILD(n, 5)),\r\n                               seq, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n}\r\n\r\nfunction ast_for_call(c, n, func, allowgen) {\r\n    /*\r\n      arglist: argument (',' argument)*  [',']\r\n      argument: ( test [comp_for] | '*' test | test '=' test | '**' test )\r\n    */\r\n\r\n    var i, nargs, nkeywords;\r\n    var ndoublestars;\r\n    var args;\r\n    var keywords;\r\n\r\n    REQ(n, SYM.arglist);\r\n\r\n    nargs = 0;\r\n    nkeywords = 0;\r\n    for (i = 0; i < NCH(n); i++) {\r\n        var ch = CHILD(n, i);\r\n        if (TYPE(ch) == SYM.argument) {\r\n            if (NCH(ch) == 1) {\r\n                nargs++;\r\n            } else if (TYPE(CHILD(ch, 1)) == SYM.comp_for) {\r\n                nargs++;\r\n                if (!allowgen) {\r\n                    ast_error(c, ch, \"invalid syntax\");\r\n                }\r\n                if (NCH(n) > 1) {\r\n                    ast_error(c, ch, \"Generator expression must be parenthesized\");\r\n                }\r\n            } else if (TYPE(CHILD(ch, 0)) == TOK.T_STAR) {\r\n                nargs++;\r\n            } else {\r\n                /* TYPE(CHILD(ch, 0)) == DOUBLESTAR or keyword argument */\r\n                nkeywords++;\r\n            }\r\n        }\r\n    }\r\n\r\n    args = [];\r\n    keywords = [];\r\n\r\n    nargs = 0;  /* positional arguments + iterable argument unpackings */\r\n    nkeywords = 0;  /* keyword arguments + keyword argument unpackings */\r\n    ndoublestars = 0;  /* just keyword argument unpackings */\r\n    for (i = 0; i < NCH(n); i++) {\r\n        ch = CHILD(n, i);\r\n        if (TYPE(ch) == SYM.argument) {\r\n            var e;\r\n            var chch = CHILD(ch, 0);\r\n            if (NCH(ch) == 1) {\r\n                /* a positional argument */\r\n                if (nkeywords) {\r\n                    if (ndoublestars) {\r\n                        ast_error(c, chch,\r\n                                  \"positional argument follows \" +\r\n                            \"keyword argument unpacking\");\r\n                    } else {\r\n                        ast_error(c, chch,\r\n                                  \"positional argument follows \" +\r\n                            \"keyword argument\");\r\n                    }\r\n                }\r\n                e = ast_for_expr(c, chch);\r\n                if (!e) {\r\n                    return NULL;\r\n                }\r\n                args[nargs++] = e;\r\n            } else if (TYPE(chch) == TOK.T_STAR) {\r\n                /* an iterable argument unpacking */\r\n                var starred;\r\n                if (ndoublestars) {\r\n                    ast_error(c, chch,\r\n                              \"iterable argument unpacking follows \" +\r\n                        \"keyword argument unpacking\");\r\n                    return NULL;\r\n                }\r\n                e = ast_for_expr(c, CHILD(ch, 1));\r\n                if (!e) {\r\n                    return NULL;\r\n                }\r\n                starred = new Sk.astnodes.Starred(e, Sk.astnodes.Load, LINENO(chch),\r\n                                                  chch.col_offset, chch.end_lineno, chch.end_col_offset);\r\n                args[nargs++] = starred;\r\n            } else if (TYPE(chch) == TOK.T_DOUBLESTAR) {\r\n                /* a keyword argument unpacking */\r\n                var kw;\r\n                i++;\r\n                e = ast_for_expr(c, CHILD(ch, 1));\r\n                if (!e) {\r\n                    return NULL;\r\n                }\r\n                kw = new Sk.astnodes.keyword(NULL, e);\r\n                keywords[nkeywords++] = kw;\r\n                ndoublestars++;\r\n            } else if (TYPE(CHILD(ch, 1)) == SYM.comp_for) {\r\n                /* the lone generator expression */\r\n                e = ast_for_genexp(c, ch);\r\n                if (!e) {\r\n                    return NULL;\r\n                }\r\n                args[nargs++] = e;\r\n            } else {\r\n                /* a keyword argument */\r\n                var kw;\r\n                var key, tmp;\r\n                var k;\r\n\r\n                /* chch is test, but must be an identifier? */\r\n                e = ast_for_expr(c, chch);\r\n                if (!e) {\r\n                    return NULL;\r\n                }\r\n                /* f(lambda x: x[0] = 3) ends up getting parsed with\r\n                 * LHS test = lambda x: x[0], and RHS test = 3.\r\n                 * SF bug 132313 points out that complaining about a keyword\r\n                 * then is very confusing.\r\n                 */\r\n                if (e.constructor === Sk.astnodes.Lambda) {\r\n                    ast_error(c, chch,\r\n                              \"lambda cannot contain assignment\");\r\n                    return NULL;\r\n                } else if (e.constructor !== Sk.astnodes.Name) {\r\n                    ast_error(c, chch,\r\n                              \"keyword can't be an expression\");\r\n                    return NULL;\r\n                } else if (forbiddenCheck(c, e.id, ch, 1)) {\r\n                    return NULL;\r\n                }\r\n                key = e.id;\r\n                for (k = 0; k < nkeywords; k++) {\r\n                    tmp = keywords[k].arg;\r\n                    if (tmp && tmp === key) {\r\n                        ast_error(c, chch,\r\n                                  \"keyword argument repeated\");\r\n                        return NULL;\r\n                    }\r\n                }\r\n                e = ast_for_expr(c, CHILD(ch, 2));\r\n                if (!e) {\r\n                    return NULL;\r\n                }\r\n                kw = new Sk.astnodes.keyword(key, e);\r\n                keywords[nkeywords++] = kw;\r\n            }\r\n        }\r\n    }\r\n\r\n    return new Sk.astnodes.Call(func, args, keywords, func.lineno, func.col_offset, func.end_lineno, func.end_col_offset);\r\n}\r\n\r\nfunction ast_for_trailer(c, n, left_expr) {\r\n    /* trailer: '(' [arglist] ')' | '[' subscriptlist ']' | '.' NAME\r\n       subscriptlist: subscript (',' subscript)* [',']\r\n       subscript: '.' '.' '.' | test | [test] ':' [test] [sliceop]\r\n     */\r\n    REQ(n, SYM.trailer);\r\n    if (TYPE(CHILD(n, 0)) == TOK.T_LPAR) {\r\n        if (NCH(n) == 2) {\r\n            return new Sk.astnodes.Call(left_expr, NULL, NULL, LINENO(n),\r\n                                        n.col_offset, n.end_lineno, n.end_col_offset);\r\n        } else {\r\n            return ast_for_call(c, CHILD(n, 1), left_expr, true);\r\n        }\r\n    } else if (TYPE(CHILD(n, 0)) == TOK.T_DOT) {\r\n        var attr_id = new_identifier(CHILD(n, 1));\r\n        if (!attr_id) {\r\n            return NULL;\r\n        }\r\n        return new Sk.astnodes.Attribute(left_expr, attr_id, Sk.astnodes.Load,\r\n                                         LINENO(n), n.col_offset, n.end_lineno, n.end_col_offset);\r\n    } else {\r\n        REQ(CHILD(n, 0), TOK.T_LSQB);\r\n        REQ(CHILD(n, 2), TOK.T_RSQB);\r\n        n = CHILD(n, 1);\r\n        if (NCH(n) == 1) {\r\n            var slc = astForSlice(c, CHILD(n, 0));\r\n            if (!slc) {\r\n                return NULL;\r\n            }\r\n            return new Sk.astnodes.Subscript(left_expr, slc, Sk.astnodes.Load,\r\n                                             LINENO(n), n.col_offset, n.end_lineno, n.end_col_offset);\r\n        } else {\r\n            /* The grammar is ambiguous here. The ambiguity is resolved\r\n               by treating the sequence as a tuple literal if there are\r\n               no slice features.\r\n            */\r\n            var j;\r\n            var slc;\r\n            var e;\r\n            var simple = 1;\r\n            var slices = [], elts;\r\n\r\n            for (j = 0; j < NCH(n); j += 2) {\r\n                slc = astForSlice(c, CHILD(n, j));\r\n                if (!slc) {\r\n                    return NULL;\r\n                }\r\n                if (slc.kind != _slice_kind.Index_kind) {\r\n                    simple = 0;\r\n                }\r\n                slices[j / 2] = slc;\r\n            }\r\n            if (!simple) {\r\n                return new Sk.astnodes.Subscript(left_expr, new Sk.astnodes.ExtSlice(slices),\r\n                                                 Sk.astnodes.Load, LINENO(n), n.col_offset,\r\n                                                 n.end_lineno, n.end_col_offset);\r\n            }\r\n            /* extract Index values and put them in a Tuple */\r\n            elts = [];\r\n            for (j = 0; j < slices.length; ++j) {\r\n                // @meredydd any idea how we reach this?\r\n                slc = slices[j];\r\n                Sk.asserts.assert(slc.kind == _slice_kind.Index_kind && slc.v.Index.value);\r\n                elts[j] = slc.v.Index.value;\r\n            }\r\n            e = new Sk.astnodes.Tuple(elts, Sk.astnodes.Load, LINENO(n), n.col_offset, n.end_lineno, n.end_col_offset);\r\n\r\n            return new Sk.astnodes.Subscript(left_expr, new Sk.astnodes.Index(e),\r\n                                             Sk.astnodes.Load, LINENO(n), n.col_offset, n.end_lineno, n.end_col_offset);\r\n        }\r\n    }\r\n}\r\n\r\nfunction ast_for_flow_stmt(c, n) {\r\n    /*\r\n      flow_stmt: break_stmt | continue_stmt | return_stmt | raise_stmt\r\n                 | yield_stmt\r\n      break_stmt: 'break'\r\n      continue_stmt: 'continue'\r\n      return_stmt: 'return' [testlist]\r\n      yield_stmt: yield_expr\r\n      yield_expr: 'yield' testlist | 'yield' 'from' test\r\n      raise_stmt: 'raise' [test [',' test [',' test]]]\r\n    */\r\n    var ch;\r\n\r\n    REQ(n, SYM.flow_stmt);\r\n    ch = CHILD(n, 0);\r\n    switch (TYPE(ch)) {\r\n        case SYM.break_stmt:\r\n            return new Sk.astnodes.Break(LINENO(n), n.col_offset,\r\n                                         n.end_lineno, n.end_col_offset);\r\n        case SYM.continue_stmt:\r\n            return new Sk.astnodes.Continue(LINENO(n), n.col_offset,\r\n                                            n.end_lineno, n.end_col_offset);\r\n        case SYM.yield_stmt: { /* will reduce to yield_expr */\r\n            var exp = ast_for_expr(c, CHILD(ch, 0));\r\n            if (!exp) {\r\n                return null;\r\n            }\r\n            return new Sk.astnodes.Expr(exp, LINENO(n), n.col_offset,\r\n                                        n.end_lineno, n.end_col_offset);\r\n        }\r\n        case SYM.return_stmt:\r\n            if (NCH(ch) == 1) {\r\n                return new Sk.astnodes.Return(null, LINENO(n), n.col_offset,\r\n                                              n.end_lineno, n.end_col_offset);\r\n            } else {\r\n                var expression = ast_for_testlist(c, CHILD(ch, 1));\r\n                if (!expression) {\r\n                    return null;\r\n                }\r\n                return new Sk.astnodes.Return(expression, LINENO(n), n.col_offset,\r\n                                              n.end_lineno, n.end_col_offset);\r\n            }\r\n        case SYM.raise_stmt:\r\n            // This is tricky and Skulpt-specific, because we need to handle\r\n            // both Python 3-style and Python 2-style 'raise' statements\r\n            if (NCH(ch) == 1) {\r\n                return new Sk.astnodes.Raise(null, null, null, null, LINENO(n), n.col_offset,\r\n                                             n.end_lineno, n.end_col_offset);\r\n            } else if (NCH(ch) >= 2) {\r\n                var cause = null;\r\n                var expression = ast_for_expr(c, CHILD(ch, 1));\r\n                var inst = null, tback = null;\r\n\r\n                // raise [expression] from [cause]\r\n                if (NCH(ch) == 4 && CHILD(ch, 2).value == \"from\") {\r\n                    if (!Sk.__future__.python3) {\r\n                        ast_error(c, CHILD(ch, 2), \"raise ... from ... is not available in Python 2\");\r\n                    }\r\n                    cause = ast_for_expr(c, CHILD(ch, 3));\r\n                } else if (NCH(ch) >= 4 && CHILD(ch, 2).value == \",\") {\r\n                    if (Sk.__future__.python3) {\r\n                        ast_error(c, n, \"Old raise syntax is not available in Python 3\");\r\n                    }\r\n                    // raise [exception_type], [instantiation value] [, [traceback]]\r\n                    // NB traceback isn't implemented in Skulpt yet\r\n                    inst = ast_for_expr(c, CHILD(ch, 3));\r\n\r\n                    if (NCH(ch) == 6) {\r\n                        tback = ast_for_expr(c, CHILD(ch, 5));\r\n                    }\r\n                }\r\n                return new Sk.astnodes.Raise(expression, cause, inst, tback, LINENO(n), n.col_offset,\r\n                                             n.end_lineno, n.end_col_offset);\r\n            }\r\n        /* fall through */\r\n        default:\r\n            Sk.asserts.fail(\"unexpected flow_stmt: \", TYPE(ch));\r\n            return null;\r\n    }\r\n}\r\n\r\nfunction astForArg(c, n) {\r\n    var name;\r\n    var annotation = null;\r\n    var ch;\r\n\r\n    Sk.asserts.assert(n.type === SYM.tfpdef || n.type === SYM.vfpdef);\r\n    ch = CHILD(n, 0);\r\n    forbiddenCheck(c, ch, ch.value, ch.lineno);\r\n    name = strobj(ch.value);\r\n\r\n    if (NCH(n) == 3 && CHILD(n, 1).type === TOK.T_COLON) {\r\n        annotation = ast_for_expr(c, CHILD(n, 2));\r\n    }\r\n\r\n    return new Sk.astnodes.arg(name, annotation, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n}\r\n\r\n/* returns -1 if failed to handle keyword only arguments\r\n   returns new position to keep processing if successful\r\n               (',' tfpdef ['=' test])*\r\n                     ^^^\r\n   start pointing here\r\n */\r\nfunction handleKeywordonlyArgs(c, n, start, kwonlyargs, kwdefaults) {\r\n    var argname;\r\n    var ch;\r\n    var expression;\r\n    var annotation;\r\n    var arg;\r\n    var i = start;\r\n    var j = 0; /* index for kwdefaults and kwonlyargs */\r\n\r\n    if (!kwonlyargs) {\r\n        ast_error(c, CHILD(n, start), \"named arguments must follow bare *\");\r\n    }\r\n    Sk.asserts.assert(kwdefaults);\r\n    while (i < NCH(n)) {\r\n        ch = CHILD(n, i);\r\n        switch (ch.type) {\r\n            case SYM.vfpdef:\r\n            case SYM.tfpdef:\r\n                if (i + 1 < NCH(n) && CHILD(n, i + 1).type == TOK.T_EQUAL) {\r\n                    kwdefaults[j] = ast_for_expr(c, CHILD(n, i + 2));\r\n                    i += 2; /* '=' and test */\r\n                } else { /* setting NULL if no default value exists */\r\n                    kwdefaults[j] = null;\r\n                }\r\n                if (NCH(ch) == 3) {\r\n                    /* ch is NAME ':' test */\r\n                    annotation = ast_for_expr(c, CHILD(ch, 2));\r\n                } else {\r\n                    annotation = null;\r\n                }\r\n                ch = CHILD(ch, 0);\r\n                forbiddenCheck(c, ch, ch.value, ch.lineno);\r\n                argname = strobj(ch.value);\r\n                kwonlyargs[j++] = new Sk.astnodes.arg(argname, annotation, ch.lineno, ch.col_offset, ch.end_lineno, ch.end_col_offset);\r\n                i += 2; /* the name and the comma */\r\n                break;\r\n            case TOK.T_DOUBLESTAR:\r\n                return i;\r\n            default:\r\n                ast_error(c, ch, \"unexpected node\");\r\n        }\r\n    }\r\n    return i;\r\n}\r\n\r\nfunction astForArguments(c, n) {\r\n    var k;\r\n    var j;\r\n    var i;\r\n    var foundDefault;\r\n    var posargs = [];\r\n    var posdefaults = [];\r\n    var kwonlyargs = [];\r\n    var kwdefaults = [];\r\n    var vararg = null;\r\n    var kwarg = null;\r\n    var ch = null;\r\n\r\n    /* This function handles both typedargslist (function definition)\r\n       and varargslist (lambda definition).\r\n\r\n       parameters: '(' [typedargslist] ')'\r\n       typedargslist: (tfpdef ['=' test] (',' tfpdef ['=' test])* [',' [\r\n               '*' [tfpdef] (',' tfpdef ['=' test])* [',' ['**' tfpdef [',']]]\r\n             | '**' tfpdef [',']]]\r\n         | '*' [tfpdef] (',' tfpdef ['=' test])* [',' ['**' tfpdef [',']]]\r\n         | '**' tfpdef [','])\r\n       tfpdef: NAME [':' test]\r\n       varargslist: (vfpdef ['=' test] (',' vfpdef ['=' test])* [',' [\r\n               '*' [vfpdef] (',' vfpdef ['=' test])* [',' ['**' vfpdef [',']]]\r\n             | '**' vfpdef [',']]]\r\n         | '*' [vfpdef] (',' vfpdef ['=' test])* [',' ['**' vfpdef [',']]]\r\n         | '**' vfpdef [',']\r\n       )\r\n       vfpdef: NAME\r\n\r\n    */\r\n    if (n.type === SYM.parameters) {\r\n        if (NCH(n) === 2) {// () as arglist\r\n            return new Sk.astnodes.arguments_([], null, [], [], null, []);\r\n        }\r\n        n = CHILD(n, 1);\r\n    }\r\n    Sk.asserts.assert(n.type === SYM.varargslist ||\r\n        n.type === SYM.typedargslist);\r\n\r\n\r\n    // Skulpt note: the \"counting numbers of args\" section\r\n    // from ast.c is omitted because JS arrays autoexpand\r\n\r\n    /* tfpdef: NAME [':' test]\r\n       vfpdef: NAME\r\n    */\r\n    i = 0;\r\n    j = 0;  /* index for defaults */\r\n    k = 0;  /* index for args */\r\n    while (i < NCH(n)) {\r\n        ch = CHILD(n, i);\r\n        switch (ch.type) {\r\n            case SYM.tfpdef:\r\n            case SYM.vfpdef:\r\n                /* XXX Need to worry about checking if TYPE(CHILD(n, i+1)) is\r\n                   anything other than EQUAL or a comma? */\r\n                /* XXX Should NCH(n) check be made a separate check? */\r\n                if (i + 1 < NCH(n) && CHILD(n, i + 1).type == TOK.T_EQUAL) {\r\n                    posdefaults[j++] = ast_for_expr(c, CHILD(n, i + 2));\r\n                    i += 2;\r\n                    foundDefault = 1;\r\n                } else if (foundDefault) {\r\n                    throw new Sk.builtin.SyntaxError(\"non-default argument follows default argument\", c.c_filename, n.lineno);\r\n                }\r\n                posargs[k++] = astForArg(c, ch);\r\n                i += 2; /* the name and the comma */\r\n                break;\r\n            case TOK.T_STAR:\r\n                if (i + 1 >= NCH(n) ||\r\n                    (i + 2 == NCH(n) && CHILD(n, i + 1).type == TOK.T_COMMA)) {\r\n                    throw new Sk.builtin.SyntaxError(\"named arguments must follow bare *\", c.c_filename, n.lineno);\r\n                }\r\n                ch = CHILD(n, i + 1);  /* tfpdef or COMMA */\r\n                if (ch.type == TOK.T_COMMA) {\r\n                    i += 2; /* now follows keyword only arguments */\r\n                    i = handleKeywordonlyArgs(c, n, i,\r\n                                              kwonlyargs, kwdefaults);\r\n                } else {\r\n                    vararg = astForArg(c, ch);\r\n\r\n                    i += 3;\r\n                    if (i < NCH(n) && (CHILD(n, i).type == SYM.tfpdef\r\n                        || CHILD(n, i).type == SYM.vfpdef)) {\r\n                        i = handleKeywordonlyArgs(c, n, i,\r\n                                                  kwonlyargs, kwdefaults);\r\n                    }\r\n                }\r\n                break;\r\n            case TOK.T_DOUBLESTAR:\r\n                ch = CHILD(n, i + 1);  /* tfpdef */\r\n                Sk.asserts.assert(ch.type == SYM.tfpdef || ch.type == SYM.vfpdef);\r\n                kwarg = astForArg(c, ch);\r\n                i += 3;\r\n                break;\r\n            default:\r\n                Sk.asserts.fail(\"unexpected node in varargslist\");\r\n                return;\r\n        }\r\n    }\r\n    return new Sk.astnodes.arguments_(posargs, vararg, kwonlyargs, kwdefaults, kwarg, posdefaults);\r\n}\r\n\r\nfunction ast_for_async_funcdef(c, n, decorator_seq) {\r\n    /* async_funcdef: 'async' funcdef */\r\n    REQ(n, SYM.async_funcdef);\r\n    REQ(CHILD(n, 0), TOK.T_NAME);\r\n    Sk.asserts.assert(STR(CHILD(n, 0) === \"async\"));\r\n    REQ(CHILD(n, 1), SYM.funcdef);\r\n\r\n    return ast_for_funcdef_impl(c, n, decorator_seq,\r\n                                true /* is_async */);\r\n}\r\n\r\nfunction ast_for_funcdef(c, n, decorator_seq) {\r\n    /* funcdef: 'def' NAME parameters ['->' test] ':' suite */\r\n    return ast_for_funcdef_impl(c, n, decorator_seq,\r\n                                false /* is_async */);\r\n}\r\n\r\nfunction ast_for_funcdef_impl(c, n0, decorator_seq, is_async) {\r\n    /* funcdef: 'def' NAME parameters ['->' test] ':' [TYPE_COMMENT] suite */\r\n    var n = is_async ? CHILD(n0, 1) : n0;\r\n    var name;\r\n    var args;\r\n    var body;\r\n    var returns = NULL;\r\n    var name_i = 1;\r\n    var end_lineno, end_col_offset;\r\n    var tc;\r\n    var type_comment = NULL;\r\n\r\n    if (is_async && c.c_feature_version < 5) {\r\n        ast_error(c, n,\r\n                  \"Async functions are only supported in Python 3.5 and greater\");\r\n        return NULL;\r\n    }\r\n\r\n    REQ(n, SYM.funcdef);\r\n\r\n    name = new_identifier(CHILD(n, name_i));\r\n\r\n    if (forbiddenCheck(c, name, CHILD(n, name_i), 0)) {\r\n        return NULL;\r\n    }\r\n    args = astForArguments(c, CHILD(n, name_i + 1));\r\n    if (!args) {\r\n        return NULL;\r\n    }\r\n    if (TYPE(CHILD(n, name_i + 2)) == TOK.T_RARROW) {\r\n        returns = ast_for_expr(c, CHILD(n, name_i + 3));\r\n        if (!returns) {\r\n            return NULL;\r\n        }\r\n        name_i += 2;\r\n    }\r\n\r\n    if (TYPE(CHILD(n, name_i + 3)) == TOK.T_TYPE_COMMENT) {\r\n        type_comment = TOK.T_NEW_TYPE_COMMENT(CHILD(n, name_i + 3));\r\n        if (!type_comment) {\r\n            return NULL;\r\n        }\r\n        name_i += 1;\r\n    }\r\n\r\n    body = astForSuite(c, CHILD(n, name_i + 3));\r\n    if (!body) {\r\n        return NULL;\r\n    }\r\n    // get_last_end_pos(body, &end_lineno, &end_col_offset);\r\n\r\n    if (NCH(CHILD(n, name_i + 3)) > 1) {\r\n        /* Check if the suite has a type comment in it. */\r\n        tc = CHILD(CHILD(n, name_i + 3), 1);\r\n\r\n        if (TYPE(tc) == TOK.T_TYPE_COMMENT) {\r\n            if (type_comment != NULL) {\r\n                ast_error(c, n, \"Cannot have two type comments on def\");\r\n                return NULL;\r\n            }\r\n            type_comment = TOK.T_NEW_TYPE_COMMENT(tc);\r\n            if (!type_comment) {\r\n                return NULL;\r\n            }\r\n        }\r\n    }\r\n\r\n    if (is_async) {\r\n        return new Sk.astnodes.AsyncFunctionDef(name, args, body, decorator_seq, returns, type_comment,\r\n                                                LINENO(n0), n0.col_offset, n0.end_lineno, n0.end_col_offset);\r\n    } else {\r\n        return new Sk.astnodes.FunctionDef(name, args, body, decorator_seq, returns, type_comment,\r\n                                           LINENO(n), n.col_offset, n.end_lineno, n.end_col_offset);\r\n    }\r\n}\r\n\r\nfunction astForClassBases(c, n) {\r\n    /* testlist: test (',' test)* [','] */\r\n    Sk.asserts.assert(NCH(n) > 0);\r\n    REQ(n, SYM.testlist);\r\n    if (NCH(n) === 1) {\r\n        return [ast_for_expr(c, CHILD(n, 0))];\r\n    }\r\n    return seq_for_testlist(c, n);\r\n}\r\n\r\nfunction astForClassdef(c, n, decoratorSeq) {\r\n    /* classdef: 'class' NAME ['(' arglist ')'] ':' suite */\r\n    var classname;\r\n    var call;\r\n    var s;\r\n\r\n    REQ(n, SYM.classdef);\r\n\r\n    if (NCH(n) == 4) { /* class NAME ':' suite */\r\n        s = astForSuite(c, CHILD(n, 3));\r\n        classname = new_identifier(CHILD(n, 1).value);\r\n        forbiddenCheck(c, CHILD(n, 3), classname, n.lineno);\r\n\r\n        return new Sk.astnodes.ClassDef(classname, [], [], s, decoratorSeq,\r\n            /*TODO docstring*/null, LINENO(n), n.col_offset,\r\n                                        n.end_lineno, n.end_col_offset);\r\n    }\r\n\r\n    if (TYPE(CHILD(n, 3)) === TOK.T_RPAR) { /* class NAME '(' ')' ':' suite */\r\n        s = astForSuite(c, CHILD(n, 5));\r\n        classname = new_identifier(CHILD(n, 1).value);\r\n        forbiddenCheck(c, CHILD(n, 3), classname, CHILD(n, 3).lineno);\r\n        return new Sk.astnodes.ClassDef(classname, [], [], s, decoratorSeq,\r\n            /*TODO docstring*/null, LINENO(n), n.col_offset,\r\n                                        n.end_lineno, n.end_col_offset);\r\n    }\r\n\r\n    /* class NAME '(' arglist ')' ':' suite */\r\n    /* build up a fake Call node so we can extract its pieces */\r\n    {\r\n        var dummy_name;\r\n        var dummy;\r\n        dummy_name = new_identifier(CHILD(n, 1));\r\n        dummy = new Sk.astnodes.Name(dummy_name, Sk.astnodes.Load, LINENO(n), n.col_offset,\r\n                                     n.end_lineno, n.end_col_offset);\r\n        call = ast_for_call(c, CHILD(n, 3), dummy, false);\r\n    }\r\n    s = astForSuite(c, CHILD(n, 6));\r\n    classname = new_identifier(CHILD(n, 1).value);\r\n    forbiddenCheck(c, CHILD(n, 1), classname, CHILD(n, 1).lineno);\r\n\r\n    return new Sk.astnodes.ClassDef(classname, call.args, call.keywords, s,\r\n                                    decoratorSeq, /*TODO docstring*/null, LINENO(n), n.col_offset,\r\n                                    n.end_lineno, n.end_col_offset);\r\n}\r\n\r\nfunction astForLambdef(c, n) {\r\n    /* lambdef: 'lambda' [varargslist] ':' test */\r\n    var args;\r\n    var expression;\r\n    if (NCH(n) === 3) {\r\n        args = new Sk.astnodes.arguments_([], null, null, []);\r\n        expression = ast_for_expr(c, CHILD(n, 2));\r\n    } else {\r\n        args = astForArguments(c, CHILD(n, 1));\r\n        expression = ast_for_expr(c, CHILD(n, 3));\r\n    }\r\n    return new Sk.astnodes.Lambda(args, expression, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n}\r\n\r\nfunction astForComprehension(c, n) {\r\n    /* testlist_comp: test ( comp_for | (',' test)* [','] )\r\n       argument: test [comp_for] | test '=' test       # Really [keyword '='] test */\r\n\r\n    var j;\r\n    var ifs;\r\n    var nifs;\r\n    var ge;\r\n    var expression;\r\n    var t;\r\n    var forch;\r\n    var i;\r\n    var ch;\r\n    var genexps;\r\n    var nfors;\r\n    var elt;\r\n    var comps;\r\n    var comp;\r\n\r\n    function countCompFors(c, n) {\r\n        var nfors = 0;\r\n        count_comp_for: while (true) {\r\n            nfors++;\r\n            REQ(n, SYM.comp_for);\r\n            if (NCH(n) === 5) {\r\n                n = CHILD(n, 4);\r\n            } else {\r\n                return nfors;\r\n            }\r\n            count_comp_iter: while (true) {\r\n                REQ(n, SYM.comp_iter);\r\n                n = CHILD(n, 0);\r\n                if (n.type === SYM.comp_for) {\r\n                    continue count_comp_for;\r\n                } else if (n.type === SYM.comp_if) {\r\n                    if (NCH(n) === 3) {\r\n                        n = CHILD(n, 2);\r\n                        continue count_comp_iter;\r\n                    } else {\r\n                        return nfors;\r\n                    }\r\n                }\r\n                break;\r\n            }\r\n            break;\r\n        }\r\n        Sk.asserts.fail(\"logic error in countCompFors\");\r\n    }\r\n\r\n    function countCompIfs(c, n) {\r\n        var nifs = 0;\r\n        while (true) {\r\n            REQ(n, SYM.comp_iter);\r\n            if (CHILD(n, 0).type === SYM.comp_for) {\r\n                return nifs;\r\n            }\r\n            n = CHILD(n, 0);\r\n            REQ(n, SYM.comp_if);\r\n            nifs++;\r\n            if (NCH(n) === 2) {\r\n                return nifs;\r\n            }\r\n            n = CHILD(n, 2);\r\n        }\r\n    }\r\n\r\n    nfors = countCompFors(c, n);\r\n    comps = [];\r\n    for (i = 0; i < nfors; ++i) {\r\n        REQ(n, SYM.comp_for);\r\n        forch = CHILD(n, 1);\r\n        t = ast_for_exprlist(c, forch, Sk.astnodes.Store);\r\n        expression = ast_for_expr(c, CHILD(n, 3));\r\n        if (NCH(forch) === 1) {\r\n            comp = new Sk.astnodes.comprehension(t[0], expression, []);\r\n        } else {\r\n            comp = new Sk.astnodes.comprehension(new Sk.astnodes.Tuple(t, Sk.astnodes.Store, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset), expression, []);\r\n        }\r\n        if (NCH(n) === 5) {\r\n            n = CHILD(n, 4);\r\n            nifs = countCompIfs(c, n);\r\n            ifs = [];\r\n            for (j = 0; j < nifs; ++j) {\r\n                REQ(n, SYM.comp_iter);\r\n                n = CHILD(n, 0);\r\n                REQ(n, SYM.comp_if);\r\n                expression = ast_for_expr(c, CHILD(n, 1));\r\n                ifs[j] = expression;\r\n                if (NCH(n) === 3) {\r\n                    n = CHILD(n, 2);\r\n                }\r\n            }\r\n            if (n.type === SYM.comp_iter) {\r\n                n = CHILD(n, 0);\r\n            }\r\n            comp.ifs = ifs;\r\n        }\r\n        comps[i] = comp;\r\n    }\r\n    return comps;\r\n}\r\n\r\nfunction astForIterComp(c, n, type) {\r\n    var elt, comps;\r\n    Sk.asserts.assert(NCH(n) > 1);\r\n    elt = ast_for_expr(c, CHILD(n, 0));\r\n    comps = astForComprehension(c, CHILD(n, 1));\r\n    if (type === COMP_GENEXP) {\r\n        return new Sk.astnodes.GeneratorExp(elt, comps, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n    } else if (type === COMP_SETCOMP) {\r\n        return new Sk.astnodes.SetComp(elt, comps, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n    }\r\n}\r\n\r\n/*\r\n   Count the number of 'for' loops in a comprehension.\r\n   Helper for ast_for_comprehension().\r\n*/\r\nfunction count_comp_fors(c, n) {\r\n    var n_fors = 0;\r\n    var is_async;\r\n    count_comp_for: while (true) {\r\n        // @meredydd needs new grammar\r\n        // REQ(n, SYM.comp_for);\r\n        // if (NCH(n) === 2) {\r\n        //     REQ(CHILD(n, 0), TOK.T_ASYNC);\r\n        //     n = CHILD(n, 1);\r\n        // } else if (NCH(n) === 1) {\r\n        //     n = CHILD(n, 0);\r\n        // } else {\r\n        //     Sk.asserts.fail(\"logic error in count_comp_fors\");\r\n        // }\r\n        // if (NCH(n) == (5)) {\r\n        //     n = CHILD(n, 4);\r\n        // } else {\r\n        //     return n_fors;\r\n        // }\r\n        is_async = 0;\r\n        n_fors++;\r\n        REQ(n, SYM.comp_for);\r\n        if (TYPE(CHILD(n, 0)) == TOK.T_ASYNC) {\r\n            is_async = 1;\r\n        }\r\n        if (NCH(n) == (5 + is_async)) {\r\n            n = CHILD(n, 4 + is_async);\r\n        } else {\r\n            return n_fors;\r\n        }\r\n        count_comp_iter: while (true) {\r\n            REQ(n, SYM.comp_iter);\r\n            n = CHILD(n, 0);\r\n            if (TYPE(n) === SYM.comp_for) {\r\n                continue count_comp_for;\r\n            } else if (TYPE(n) === SYM.comp_if) {\r\n                if (NCH(n) === 3) {\r\n                    n = CHILD(n, 2);\r\n                    continue count_comp_iter;\r\n                } else {\r\n                    return n_fors;\r\n                }\r\n            }\r\n            break;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nfunction count_comp_ifs(c, n) {\r\n    var n_ifs = 0;\r\n\r\n    while (true) {\r\n        REQ(n, SYM.comp_iter);\r\n        if (TYPE(CHILD(n, 0)) == SYM.comp_for) {\r\n            return n_ifs;\r\n        }\r\n        n = CHILD(n, 0);\r\n        REQ(n, SYM.comp_if);\r\n        n_ifs++;\r\n        if (NCH(n) == 2) {\r\n            return n_ifs;\r\n        }\r\n        n = CHILD(n, 2);\r\n    }\r\n}\r\n\r\nfunction ast_for_comprehension(c, n) {\r\n    var i, n_fors;\r\n    var comps = [];\r\n    n_fors = count_comp_fors(c, n);\r\n\r\n    for (i = 0; i < n_fors; i++) {\r\n        var comp;\r\n        var t;\r\n        var expression, first;\r\n        var for_ch;\r\n        var is_async = 0;\r\n\r\n        if (TYPE(CHILD(n, 0)) == TOK.T_ASYNC) {\r\n            is_async = 1;\r\n        }\r\n\r\n        for_ch = CHILD(n, 1 + is_async);\r\n        t = ast_for_exprlist(c, for_ch, Sk.astnodes.Store);\r\n        if (!t) {\r\n            return null;\r\n        }\r\n\r\n        expression = ast_for_expr(c, CHILD(n, 3 + is_async));\r\n\r\n        if (!expression) {\r\n            return null;\r\n        }\r\n\r\n        // again new grammar needed\r\n        // REQ(n, SYM.comp_for);\r\n\r\n        // if (NCH(n) == 2) {\r\n        //     is_async = 1;\r\n        //     REQ(CHILD(n, 0), TOK.T_ASYNC);\r\n        //     sync_n = CHILD(n, 1);\r\n        // }\r\n        // else {\r\n        //     sync_n = CHILD(n, 0);\r\n        // }\r\n        // REQ(sync_n, SYM.sync_comp_for);\r\n\r\n        // /* Async comprehensions only allowed in Python 3.6 and greater */\r\n        // /* @meredydd see below for the joys of the future! */\r\n        // if (is_async && c.c_feature_version < 6) {\r\n        //     ast_error(c, n,\r\n        //               \"Async comprehensions are only supported in Python 3.6 and greater\");\r\n        //     return null;\r\n        // }\r\n\r\n        // for_ch = CHILD(sync_n, 1);\r\n        // t = ast_for_exprlist(c, for_ch, Sk.astnodes.Store);\r\n\r\n        // expression = ast_for_expr(c, CHILD(sync_n, 3));\r\n\r\n        /* Check the # of children rather than the length of t, since\r\n           (x for x, in ...) has 1 element in t, but still requires a Tuple. */\r\n        first = t[0];\r\n        if (NCH(for_ch) == 1) {\r\n            comp = new Sk.astnodes.comprehension(first, expression, null, is_async);\r\n        } else {\r\n            comp = new Sk.astnodes.comprehension(new Sk.astnodes.Tuple(t, Sk.astnodes.Store, first.lineno, first.col_offset,\r\n                                                                       for_ch.end_lineno, for_ch.end_col_offset),\r\n                                                 expression, null, is_async);\r\n        }\r\n\r\n        if (NCH(n) == (5 + is_async)) {\r\n            var j, n_ifs;\r\n            var ifs = [];\r\n\r\n            n = CHILD(n, 4 + is_async);\r\n            n_ifs = count_comp_ifs(c, n);\r\n            if (n_ifs == -1) {\r\n                return null;\r\n            }\r\n\r\n            for (j = 0; j < n_ifs; j++) {\r\n                REQ(n, SYM.comp_iter);\r\n                n = CHILD(n, 0);\r\n                REQ(n, SYM.comp_if);\r\n\r\n                expression = ast_for_expr(c, CHILD(n, 1));\r\n                if (!expression) {\r\n                    return null;\r\n                }\r\n\r\n                ifs[j] = expression;\r\n                if (NCH(n) == 3) {\r\n                    n = CHILD(n, 2);\r\n                }\r\n            }\r\n            /* on exit, must guarantee that n is a comp_for */\r\n            if (TYPE(n) == SYM.comp_iter) {\r\n                n = CHILD(n, 0);\r\n            }\r\n            comp.ifs = ifs;\r\n        }\r\n        // if (NCH(sync_n) == 5) {\r\n        //     var j, n_ifs;\r\n        //     var ifs = [];\r\n\r\n        //     n = CHILD(sync_n, 4);\r\n        //     n_ifs = count_comp_ifs(c, n);\r\n\r\n        //     for (j = 0; j < n_ifs; j++) {\r\n        //         REQ(n, comp_iter);\r\n        //         n = CHILD(n, 0);\r\n        //         REQ(n, comp_if);\r\n\r\n        //         expression = ast_for_expr(c, CHILD(n, 1));\r\n        //         if (!expression) {\r\n        //             return null;\r\n        //         }\r\n\r\n        //         ifs[j] = expression;\r\n        //         if (NCH(n) == 3) {\r\n        //             n = CHILD(n, 2);\r\n        //         }\r\n        //     }\r\n        //     /* on exit, must guarantee that n is a comp_for */\r\n        //     if (TYPE(n) == SYM.comp_iter) {\r\n        //         n = CHILD(n, 0);\r\n        //     }\r\n        //     comp.ifs = ifs;\r\n        // }\r\n        comps[i] = comp;\r\n    }\r\n    return comps;\r\n}\r\n\r\nfunction ast_for_itercomp(c, n, type) {\r\n    /* testlist_comp: (test|star_expr)\r\n     *                ( comp_for | (',' (test|star_expr))* [','] ) */\r\n    var elt;\r\n    var comps;\r\n    var ch;\r\n\r\n    Sk.asserts.assert(NCH(n) > 1);\r\n\r\n    ch = CHILD(n, 0);\r\n    elt = ast_for_expr(c, ch);\r\n\r\n    if (elt.constructor === Sk.astnodes.Starred) {\r\n        ast_error(c, ch, \"iterable unpacking cannot be used in comprehension\");\r\n        return NULL;\r\n    }\r\n\r\n    comps = ast_for_comprehension(c, CHILD(n, 1));\r\n\r\n    if (type == COMP_GENEXP) {\r\n        return new Sk.astnodes.GeneratorExp(elt, comps, LINENO(n), n.col_offset,\r\n                                            n.end_lineno, n.end_col_offset);\r\n    } else if (type == COMP_LISTCOMP) {\r\n        return new Sk.astnodes.ListComp(elt, comps, LINENO(n), n.col_offset,\r\n                                        n.end_lineno, n.end_col_offset);\r\n    } else if (type == COMP_SETCOMP) {\r\n        return new Sk.astnodes.SetComp(elt, comps, LINENO(n), n.col_offset,\r\n                                       n.end_lineno, n.end_col_offset);\r\n    } else {\r\n        /* Should never happen */\r\n        return null;\r\n    }\r\n}\r\n\r\n/* Fills in the key, value pair corresponding to the dict element.  In case\r\n * of an unpacking, key is NULL.  *i is advanced by the number of ast\r\n * elements.  Iff successful, nonzero is returned.\r\n */\r\nfunction ast_for_dictelement(c, n, i) {\r\n    var expression;\r\n    if (TYPE(CHILD(n, i)) == TOK.T_DOUBLESTAR) {\r\n        Sk.asserts.assert(NCH(n) - i >= 2);\r\n\r\n        expression = ast_for_expr(c, CHILD(n, i + 1));\r\n\r\n        return {key: null, value: expression, i: i + 2};\r\n    } else {\r\n        Sk.asserts.assert(NCH(n) - i >= 3);\r\n\r\n        expression = ast_for_expr(c, CHILD(n, i));\r\n        if (!expression) {\r\n            return 0;\r\n        }\r\n        var key = expression;\r\n\r\n        REQ(CHILD(n, i + 1), TOK.T_COLON);\r\n\r\n        expression = ast_for_expr(c, CHILD(n, i + 2));\r\n        if (!expression) {\r\n            return false;\r\n        }\r\n\r\n        var value = expression;\r\n\r\n        return {key: key, value: value, i: i + 3};\r\n    }\r\n}\r\n\r\nfunction ast_for_dictcomp(c, n) {\r\n    var key, value;\r\n    var comps = [];\r\n    Sk.asserts.assert(NCH(n) > 3);\r\n    REQ(CHILD(n, 1), TOK.T_COLON);\r\n    key = ast_for_expr(c, CHILD(n, 0));\r\n    value = ast_for_expr(c, CHILD(n, 2));\r\n    comps = astForComprehension(c, CHILD(n, 3));\r\n    return new Sk.astnodes.DictComp(key, value, comps, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n}\r\n\r\nfunction ast_for_dictdisplay(c, n) {\r\n    var i;\r\n    var j;\r\n    var keys = [], values = [];\r\n\r\n    j = 0;\r\n    for (i = 0; i < NCH(n); i++) {\r\n        var res = ast_for_dictelement(c, n, i);\r\n        i = res.i;\r\n        keys[j] = res.key;\r\n        values[j] = res.value;\r\n        j++;\r\n    }\r\n\r\n    return new Sk.astnodes.Dict(keys, values, LINENO(n), n.col_offset,\r\n                                n.end_lineno, n.end_col_offset);\r\n}\r\n\r\nfunction ast_for_gen_expr(c, n) {\r\n    Sk.asserts.assert(n.type === SYM.testlist_comp || n.type === SYM.argument);\r\n    return astForIterComp(c, n, COMP_GENEXP);\r\n}\r\n\r\nfunction ast_for_setcomp(c, n) {\r\n    Sk.asserts.assert(n.type === SYM.dictorsetmaker);\r\n    return astForIterComp(c, n, COMP_SETCOMP);\r\n}\r\n\r\nfunction astForWhileStmt(c, n) {\r\n    /* while_stmt: 'while' test ':' suite ['else' ':' suite] */\r\n    REQ(n, SYM.while_stmt);\r\n    if (NCH(n) === 4) {\r\n        return new Sk.astnodes.While(ast_for_expr(c, CHILD(n, 1)), astForSuite(c, CHILD(n, 3)), [], n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n    } else if (NCH(n) === 7) {\r\n        return new Sk.astnodes.While(ast_for_expr(c, CHILD(n, 1)), astForSuite(c, CHILD(n, 3)), astForSuite(c, CHILD(n, 6)), n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n    }\r\n    Sk.asserts.fail(\"wrong number of tokens for 'while' stmt\");\r\n}\r\n\r\nfunction astForAugassign(c, n) {\r\n    REQ(n, SYM.augassign);\r\n    n = CHILD(n, 0);\r\n    switch (n.value.charAt(0)) {\r\n        case \"+\":\r\n            return Sk.astnodes.Add;\r\n        case \"-\":\r\n            return Sk.astnodes.Sub;\r\n        case \"/\":\r\n            if (n.value.charAt(1) === \"/\") {\r\n                return Sk.astnodes.FloorDiv;\r\n            }\r\n            return Sk.astnodes.Div;\r\n        case \"%\":\r\n            return Sk.astnodes.Mod;\r\n        case \"<\":\r\n            return Sk.astnodes.LShift;\r\n        case \">\":\r\n            return Sk.astnodes.RShift;\r\n        case \"&\":\r\n            return Sk.astnodes.BitAnd;\r\n        case \"^\":\r\n            return Sk.astnodes.BitXor;\r\n        case \"|\":\r\n            return Sk.astnodes.BitOr;\r\n        case \"*\":\r\n            if (n.value.charAt(1) === \"*\") {\r\n                return Sk.astnodes.Pow;\r\n            }\r\n            return Sk.astnodes.Mult;\r\n        case \"@\":\r\n            if (Sk.__future__.python3) {\r\n                return Sk.astnodes.MatMult;\r\n            }\r\n        default:\r\n            Sk.asserts.fail(\"invalid augassign\");\r\n    }\r\n}\r\n\r\nfunction astForBinop(c, n) {\r\n    /* Must account for a sequence of expressions.\r\n     How should A op B op C by represented?\r\n     BinOp(BinOp(A, op, B), op, C).\r\n     */\r\n    var tmp;\r\n    var newoperator;\r\n    var nextOper;\r\n    var i;\r\n    var result = new Sk.astnodes.BinOp(\r\n        ast_for_expr(c, CHILD(n, 0)),\r\n        getOperator(CHILD(n, 1)),\r\n        ast_for_expr(c, CHILD(n, 2)),\r\n        n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n    var nops = (NCH(n) - 1) / 2;\r\n    for (i = 1; i < nops; ++i) {\r\n        nextOper = CHILD(n, i * 2 + 1);\r\n        newoperator = getOperator(nextOper);\r\n        tmp = ast_for_expr(c, CHILD(n, i * 2 + 2));\r\n        result = new Sk.astnodes.BinOp(result, newoperator, tmp, nextOper.lineno, nextOper.col_offset, nextOper.end_lineno, nextOper.end_col_offset);\r\n    }\r\n    return result;\r\n}\r\n\r\nfunction ast_for_testlist(c, n) {\r\n    /* testlist_comp: test (',' comp_for | (',' test)* [',']) */\r\n    /* testlist: test (',' test)* [','] */\r\n    Sk.asserts.assert(NCH(n) > 0);\r\n    if (n.type === SYM.testlist_comp) {\r\n        if (NCH(n) > 1) {\r\n            Sk.asserts.assert(CHILD(n, 1).type !== SYM.comp_for);\r\n        }\r\n    } else {\r\n        Sk.asserts.assert(n.type === SYM.testlist || n.type === SYM.testlist_star_expr);\r\n    }\r\n\r\n    if (NCH(n) === 1) {\r\n        return ast_for_expr(c, CHILD(n, 0));\r\n    } else {\r\n        return new Sk.astnodes.Tuple(seq_for_testlist(c, n), Sk.astnodes.Load, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset/*, c.c_arena */);\r\n    }\r\n}\r\n\r\nfunction ast_for_exprStmt(c, n) {\r\n    var expression;\r\n    var value;\r\n    var e;\r\n    var i;\r\n    var targets;\r\n    var expr2;\r\n    var varName;\r\n    var expr1;\r\n    var ch;\r\n    var ann;\r\n    var simple;\r\n    var deep;\r\n    var expr3;\r\n    REQ(n, SYM.expr_stmt);\r\n    /* expr_stmt: testlist_star_expr (annassign | augassign (yield_expr|testlist) |\r\n                            ('=' (yield_expr|testlist_star_expr))*)\r\n       annassign: ':' test ['=' test]\r\n       testlist_star_expr: (test|star_expr) (',' test|star_expr)* [',']\r\n       augassign: '+=' | '-=' | '*=' | '@=' | '/=' | '%=' | '&=' | '|=' | '^='\r\n                | '<<=' | '>>=' | '**=' | '//='\r\n       test: ... here starts the operator precedence dance\r\n     */\r\n    if (NCH(n) === 1) {\r\n        return new Sk.astnodes.Expr(ast_for_testlist(c, CHILD(n, 0)), n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n    } else if (CHILD(n, 1).type === SYM.augassign) {\r\n        ch = CHILD(n, 0);\r\n        expr1 = ast_for_testlist(c, ch);\r\n        setContext(c, expr1, Sk.astnodes.Store, ch);\r\n        switch (expr1.constructor) {\r\n            case Sk.astnodes.Name:\r\n                varName = expr1.id;\r\n                forbiddenCheck(c, ch, varName, n.lineno);\r\n                break;\r\n            case Sk.astnodes.Attribute:\r\n            case Sk.astnodes.Subscript:\r\n                break;\r\n            case Sk.astnodes.GeneratorExp:\r\n                throw new Sk.builtin.SyntaxError(\"augmented assignment to generator expression not possible\", c.c_filename, n.lineno);\r\n            case Sk.astnodes.Yield:\r\n                throw new Sk.builtin.SyntaxError(\"augmented assignment to yield expression not possible\", c.c_filename, n.lineno);\r\n            default:\r\n                throw new Sk.builtin.SyntaxError(\"illegal expression for augmented assignment\", c.c_filename, n.lineno);\r\n        }\r\n\r\n        ch = CHILD(n, 2);\r\n        if (ch.type === SYM.testlist) {\r\n            expr2 = ast_for_testlist(c, ch);\r\n        } else {\r\n            expr2 = ast_for_expr(c, ch);\r\n        }\r\n\r\n        return new Sk.astnodes.AugAssign(expr1, astForAugassign(c, CHILD(n, 1)), expr2, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n    } else if (CHILD(n, 1).type === SYM.annassign) {\r\n        if (!Sk.__future__.python3) {\r\n            throw new Sk.builtin.SyntaxError(\"Annotated assignment is not supported in Python 2\", c.c_filename, n.lineno);\r\n        }\r\n        // annotated assignment\r\n        ch = CHILD(n, 0);\r\n        ann = CHILD(n, 1);\r\n        simple = 1;\r\n        deep = ch;\r\n        while (NCH(deep) == 1) {\r\n            deep = CHILD(deep, 0);\r\n        }\r\n        if (NCH(deep) > 0 && TYPE(CHILD(deep, 0)) == TOK.T_LPAR) {\r\n            simple = 0;\r\n        }\r\n        expr1 = ast_for_testlist(c, ch);\r\n        switch (expr1.constructor) {\r\n            case Sk.astnodes.Name:\r\n                varName = expr1.id;\r\n                forbiddenCheck(c, ch, varName, n.lineno);\r\n                setContext(c, expr1, Sk.astnodes.Store, ch);\r\n                break;\r\n            case Sk.astnodes.Attribute:\r\n                varName = expr1.attr;\r\n                forbiddenCheck(c, ch, varName, n.lineno);\r\n                setContext(c, expr1, Sk.astnodes.Store, ch);\r\n                break;\r\n            case Sk.astnodes.Subscript:\r\n                setContext(c, expr1, Sk.astnodes.Store, ch);\r\n                break;\r\n            case Sk.astnodes.List:\r\n                throw new Sk.builtin.SyntaxError(\"only single target (not list) can be annotated\", c.c_filename, n.lineno);\r\n            case Sk.astnodes.Tuple:\r\n                throw new Sk.builtin.SyntaxError(\"only single target (not tuple) can be annotated\", c.c_filename, n.lineno);\r\n            default:\r\n                throw new Sk.builtin.SyntaxError(\"illegal target for annotation\", c.c_filename, n.lineno);\r\n        }\r\n\r\n        if (expr1.constructor != Sk.astnodes.Name) {\r\n            simple = 0;\r\n        }\r\n\r\n        ch = CHILD(ann, 1);\r\n        expr2 = ast_for_expr(c, ch);\r\n        if (NCH(ann) == 2) {\r\n            return new Sk.astnodes.AnnAssign(expr1, expr2, null, simple, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n        } else {\r\n            ch = CHILD(ann, 3);\r\n            expr3 = ast_for_expr(c, ch);\r\n            return new Sk.astnodes.AnnAssign(expr1, expr2, expr3, simple, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n        }\r\n    } else {\r\n        // normal assignment\r\n        REQ(CHILD(n, 1), TOK.T_EQUAL);\r\n        targets = [];\r\n        for (i = 0; i < NCH(n) - 2; i += 2) {\r\n            ch = CHILD(n, i);\r\n            if (ch.type === SYM.yield_expr) {\r\n                throw new Sk.builtin.SyntaxError(\"assignment to yield expression not possible\", c.c_filename, n.lineno);\r\n            }\r\n            e = ast_for_testlist(c, ch);\r\n            setContext(c, e, Sk.astnodes.Store, CHILD(n, i));\r\n            targets[i / 2] = e;\r\n        }\r\n        value = CHILD(n, NCH(n) - 1);\r\n        if (value.type === SYM.testlist_star_expr) {\r\n            expression = ast_for_testlist(c, value);\r\n        } else {\r\n            expression = ast_for_expr(c, value);\r\n        }\r\n        return new Sk.astnodes.Assign(targets, expression, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n    }\r\n}\r\n\r\nfunction astForIfexpr(c, n) {\r\n    /* test: or_test 'if' or_test 'else' test */\r\n    Sk.asserts.assert(NCH(n) === 5);\r\n    return new Sk.astnodes.IfExp(\r\n        ast_for_expr(c, CHILD(n, 2)),\r\n        ast_for_expr(c, CHILD(n, 0)),\r\n        ast_for_expr(c, CHILD(n, 4)),\r\n        n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n}\r\n\r\n/**\r\n * s is a python-style string literal, including quote characters and u/r/b\r\n * prefixes. Returns [decoded string object, is-an-fstring]\r\n */\r\nfunction parsestr (c, n, s) {\r\n    var quote = s.charAt(0);\r\n    var rawmode = false;\r\n    var unicode = false;\r\n    var fmode = false;\r\n    var bytesmode = false;\r\n\r\n    var decodeEscape = function (s, quote) {\r\n        var d3;\r\n        var d2;\r\n        var d1;\r\n        var d0;\r\n        var ch;\r\n        var i;\r\n        var len = s.length;\r\n        var ret = \"\";\r\n        for (i = 0; i < len; ++i) {\r\n            ch = s.charAt(i);\r\n            if (ch === \"\\\\\") {\r\n                ++i;\r\n                ch = s.charAt(i);\r\n                if (ch === \"n\") {\r\n                    ret += \"\\n\";\r\n                }\r\n                else if (ch === \"\\\\\") {\r\n                    ret += \"\\\\\";\r\n                }\r\n                else if (ch === \"t\") {\r\n                    ret += \"\\t\";\r\n                }\r\n                else if (ch === \"r\") {\r\n                    ret += \"\\r\";\r\n                }\r\n                else if (ch === \"b\") {\r\n                    ret += \"\\b\";\r\n                }\r\n                else if (ch === \"f\") {\r\n                    ret += \"\\f\";\r\n                }\r\n                else if (ch === \"v\") {\r\n                    ret += \"\\v\";\r\n                }\r\n                else if (ch === \"0\") {\r\n                    ret += \"\\0\";\r\n                }\r\n                else if (ch === '\"') {\r\n                    ret += '\"';\r\n                }\r\n                else if (ch === '\\'') {\r\n                    ret += '\\'';\r\n                }\r\n                else if (ch === \"\\n\") /* escaped newline, join lines */ {\r\n                }\r\n                else if (ch === \"x\") {\r\n                    if (i+2 >= len) {\r\n                        ast_error(c, n, \"Truncated \\\\xNN escape\");\r\n                    }\r\n                    ret += String.fromCharCode(parseInt(s.substr(i+1,2), 16));\r\n                    i += 2;\r\n                }\r\n                else if (!bytesmode && ch === \"u\") {\r\n                    if (i+4 >= len) {\r\n                        ast_error(c, n, \"Truncated \\\\uXXXX escape\");\r\n                    }\r\n                    ret += String.fromCharCode(parseInt(s.substr(i+1, 4), 16))\r\n                    i += 4;\r\n                }\r\n                else if (!bytesmode && ch === \"U\") {\r\n                    if (i+8 >= len) {\r\n                        ast_error(c, n, \"Truncated \\\\UXXXXXXXX escape\");\r\n                    }\r\n                    ret += String.fromCodePoint(parseInt(s.substr(i+1, 8), 16))\r\n                    i += 8;\r\n                }\r\n                else {\r\n                    // Leave it alone\r\n                    ret += \"\\\\\" + ch;\r\n                    // Sk.asserts.fail(\"unhandled escape: '\" + ch.charCodeAt(0) + \"'\");\r\n                }\r\n                }\r\n            else if (bytesmode && ch.charCodeAt(0) > 0x7f) {\r\n                ast_error(c, n, \"bytes can only contain ASCII literal characters\");\r\n            } else {\r\n                ret += ch;\r\n            }\r\n        }\r\n        return ret;\r\n    };\r\n\r\n    //console.log(\"parsestr\", s);\r\n\r\n    // treats every sequence as unicodes even if they are not treated with uU prefix\r\n    // kinda hacking though working for most purposes\r\n    if ((c.c_flags & Sk.Parser.CO_FUTURE_UNICODE_LITERALS || Sk.__future__.unicode_literals === true)) {\r\n        unicode = true;\r\n    }\r\n\r\n    let seenflags = {};\r\n\r\n    while (true) {\r\n        if (quote === \"u\" || quote === \"U\") {\r\n            unicode = true;\r\n        } else if (quote === \"r\" || quote === \"R\") {\r\n            rawmode = true;\r\n        }\r\n        else if (quote === \"b\" || quote === \"B\") {\r\n            bytesmode = true;\r\n        }\r\n        else if (quote === \"f\" || quote === \"F\") {\r\n            fmode = true;\r\n        } else {\r\n            break;\r\n        }\r\n        s = s.substr(1);\r\n        quote = s.charAt(0);\r\n    }\r\n\r\n    Sk.asserts.assert(quote === \"'\" || quote === \"\\\"\" && s.charAt(s.length - 1) === quote);\r\n    s = s.substr(1, s.length - 2);\r\n\r\n    if (s.length >= 4 && s.charAt(0) === quote && s.charAt(1) === quote) {\r\n        Sk.asserts.assert(s.charAt(s.length - 1) === quote && s.charAt(s.length - 2) === quote);\r\n        s = s.substr(2, s.length - 4);\r\n    }\r\n\r\n    if (rawmode || s.indexOf(\"\\\\\") === -1) {\r\n        if (bytesmode) {\r\n            for (let i=0; i<s.length; i++) {\r\n                if (s.charCodeAt(i) > 0x7f) {\r\n                    ast_error(c, n, \"bytes can only contain ASCII literal characters\");\r\n                }\r\n            }\r\n    }\r\n        return [strobj(s), fmode, bytesmode];\r\n    }\r\n    return [strobj(decodeEscape(s, quote)), fmode, bytesmode];\r\n}\r\n\r\nfunction fstring_compile_expr(str, expr_start, expr_end, c, n) {\r\n    Sk.asserts.assert(expr_end >= expr_start);\r\n    Sk.asserts.assert(str.charAt(expr_start - 1) == \"{\");\r\n    Sk.asserts.assert(str.charAt(expr_end) == \"}\" || str.charAt(expr_end) == \"!\" || str.charAt(expr_end) == \":\");\r\n\r\n    let s = str.substring(expr_start, expr_end);\r\n\r\n    /* If the substring is all whitespace, it's an error.  We need to catch this\r\n       here, and not when we call PyParser_SimpleParseStringFlagsFilename,\r\n       because turning the expression '' in to '()' would go from being invalid\r\n       to valid. */\r\n    if (/^\\s*$/.test(s)) {\r\n        ast_error(c, n, \"f-string: empty expression not allowed\");\r\n    }\r\n    s = \"(\" + s + \")\";\r\n\r\n    let ast;\r\n    try {\r\n        let parsed = Sk.parse(\"<fstring>\", s);\r\n        ast = Sk.astFromParse(parsed.cst, \"<fstring>\", parsed.flags);\r\n    } catch (e) {\r\n        if (e.traceback && e.traceback[0]) {\r\n            let tb = e.traceback[0];\r\n            tb.lineno = (tb.lineno || 1) - 1 + LINENO(n);\r\n            tb.filename = c.c_filename;\r\n        }\r\n        throw e;\r\n    }\r\n\r\n    // TODO fstring_fix_node_location\r\n\r\n    Sk.asserts.assert(ast.body.length == 1 && ast.body[0].constructor === Sk.astnodes.Expr);\r\n\r\n    return ast.body[0].value;\r\n}\r\n\r\nfunction fstring_find_expr(str, start, end, raw, recurse_lvl, c, n) {\r\n    let i = start;\r\n    Sk.asserts.assert(str.charAt(i) == \"{\");\r\n    i++;\r\n    let expr_start = i;\r\n    /* null if we're not in a string, else the quote char we're trying to\r\n       match (single or double quote). */\r\n    let quote_char = null;\r\n    /* If we're inside a string, 1=normal, 3=triple-quoted. */\r\n    let string_type = 0;\r\n    /* Keep track of nesting level for braces/parens/brackets in\r\n       expressions. */\r\n    let nested_depth = 0;\r\n\r\n    let format_spec, conversion;\r\n\r\n    let unexpected_end_of_string = () => ast_error(c, n, \"f-string: expecting '}'\");\r\n\r\n    Sk.asserts.assert(i <= end);\r\n\r\n    for (; i < end; i++) {\r\n        let ch = str.charAt(i);\r\n\r\n        /* Nowhere inside an expression is a backslash allowed. */\r\n        if (ch == \"\\\\\") {\r\n            /* Error: can't include a backslash character, inside\r\n               parens or strings or not. */\r\n            ast_error(c, n, \"f-string expression part cannot include a backslash\");\r\n        }\r\n        if (quote_char) {\r\n            /* We're inside a string. See if we're at the end. */\r\n            /* This code needs to implement the same non-error logic\r\n               as tok_get from tokenizer.c, at the letter_quote\r\n               label. To actually share that code would be a\r\n               nightmare. But, it's unlikely to change and is small,\r\n               so duplicate it here. Note we don't need to catch all\r\n               of the errors, since they'll be caught when parsing the\r\n               expression. We just need to match the non-error\r\n               cases. Thus we can ignore \\n in single-quoted strings,\r\n               for example. Or non-terminated strings. */\r\n            if (ch == quote_char) {\r\n                /* Does this match the string_type (single or triple\r\n                   quoted)? */\r\n                if (string_type == 3) {\r\n                    if (i + 2 < end && str.charAt(i + 1) == ch && str.charAt(i + 2) == ch) {\r\n                        /* We're at the end of a triple quoted string. */\r\n                        i += 2;\r\n                        string_type = 0;\r\n                        quote_char = 0;\r\n                        continue;\r\n                    }\r\n                } else {\r\n                    /* We're at the end of a normal string. */\r\n                    quote_char = 0;\r\n                    string_type = 0;\r\n                    continue;\r\n                }\r\n            }\r\n        } else if (ch == \"'\" || ch == \"\\\"\") {\r\n            /* Is this a triple quoted string? */\r\n            if (i + 2 < end && str.charAt(i + 1) == ch && str.charAt(i + 2) == ch) {\r\n                string_type = 3;\r\n                i += 2;\r\n            } else {\r\n                /* Start of a normal string. */\r\n                string_type = 1;\r\n            }\r\n            /* Start looking for the end of the string. */\r\n            quote_char = ch;\r\n        } else if (ch == \"[\" || ch == \"{\" || ch == \"(\") {\r\n            nested_depth++;\r\n        } else if (nested_depth != 0 &&\r\n            (ch == \"]\" || ch == \"}\" || ch == \")\")) {\r\n            nested_depth--;\r\n        } else if (ch == \"#\") {\r\n            /* Error: can't include a comment character, inside parens\r\n               or not. */\r\n            ast_error(c, n, \"f-string expression part cannot include '#'\");\r\n        } else if (nested_depth == 0 &&\r\n            (ch == \"!\" || ch == \":\" || ch == \"}\")) {\r\n            /* First, test for the special case of \"!=\". Since '=' is\r\n               not an allowed conversion character, nothing is lost in\r\n               this test. */\r\n            if (ch == \"!\" && i + 1 < end && str.charAt(i + 1) == \"=\") {\r\n                /* This isn't a conversion character, just continue. */\r\n                continue;\r\n            }\r\n            /* Normal way out of this loop. */\r\n            break;\r\n        } else {\r\n            /* Just consume this char and loop around. */\r\n        }\r\n    }\r\n\r\n    /* If we leave this loop in a string or with mismatched parens, we\r\n       don't care. We'll get a syntax error when compiling the\r\n       expression. But, we can produce a better error message, so\r\n       let's just do that.*/\r\n    if (quote_char) {\r\n        ast_error(c, n, \"f-string: unterminated string\");\r\n    }\r\n    if (nested_depth) {\r\n        ast_error(c, n, \"f-string: mismatched '(', '{', or '['\");\r\n    }\r\n\r\n    let expr_end = i;\r\n\r\n    /* Compile the expression as soon as possible, so we show errors\r\n       related to the expression before errors related to the\r\n       conversion or format_spec. */\r\n    let simple_expression = fstring_compile_expr(str, expr_start, expr_end, c, n);\r\n\r\n    /* Check for a conversion char, if present. */\r\n    if (str.charAt(i) == \"!\") {\r\n        i++;\r\n        if (i >= end) {\r\n            unexpected_end_of_string();\r\n        }\r\n\r\n        conversion = str.charAt(i);\r\n        i++;\r\n\r\n        /* Validate the conversion. */\r\n        if (!(conversion == \"s\" || conversion == \"r\"\r\n            || conversion == \"a\")) {\r\n            ast_error(c, n, \"f-string: invalid conversion character: expected 's', 'r', or 'a'\");\r\n        }\r\n    }\r\n\r\n    /* Check for the format spec, if present. */\r\n    if (i >= end) {\r\n        unexpected_end_of_string();\r\n    }\r\n    if (str.charAt(i) == \":\") {\r\n        i++;\r\n        if (i >= end) {\r\n            unexpected_end_of_string();\r\n        }\r\n\r\n        /* Parse the format spec. */\r\n        [format_spec, i] = fstring_parse(str, i, end, raw, recurse_lvl + 1, c, n);\r\n    }\r\n\r\n    if (i >= end || str.charAt(i) != \"}\") {\r\n        unexpected_end_of_string();\r\n    }\r\n\r\n    /* We're at a right brace. Consume it. */\r\n    i++;\r\n\r\n    /* And now create the FormattedValue node that represents this\r\n       entire expression with the conversion and format spec. */\r\n    let expr = new Sk.astnodes.FormattedValue(simple_expression, conversion,\r\n                                              format_spec, LINENO(n), n.col_offset,\r\n                                              n.end_lineno, n.end_col_offset);\r\n\r\n    return [expr, i];\r\n}\r\n\r\nfunction fstring_parse(str, start, end, raw, recurse_lvl, c, n) {\r\n    let values = [];\r\n    let idx = start;\r\n\r\n    let addLiteral = (literal) => {\r\n        if (literal.indexOf(\"}\") !== -1) {\r\n            // We need to error out on any lone }s, and\r\n            // replace doubles with singles.\r\n            if (/(^|[^}])}(}})*($|[^}])/.test(literal)) {\r\n                throw new Sk.builtin.SyntaxError(\"f-string: single '}' is not allowed\", c.c_filename, LINENO(n), n.col_offset);\r\n            }\r\n            literal = literal.replace(/}}/g, \"}\");\r\n        }\r\n        values.push(new Sk.astnodes.Str(new Sk.builtin.str(literal), LINENO(n), n.col_offset, n.end_lineno, n.end_col_offset));\r\n    };\r\n\r\n\r\n    while (idx < end) {\r\n        let bidx = str.indexOf(\"{\", idx);\r\n        if (recurse_lvl !== 0) {\r\n            // If there's a closing brace before the next open brace,\r\n            // that's our end-of-expression\r\n            let cbidx = str.indexOf(\"}\", idx);\r\n            if (cbidx !== -1) {\r\n                if (bidx === -1) {\r\n                    end = cbidx;\r\n                } else if (bidx > cbidx) {\r\n                    bidx = -1;\r\n                    end = cbidx;\r\n                }\r\n            }\r\n        }\r\n        if (bidx === -1) {\r\n            addLiteral(str.substring(idx, end));\r\n            idx = end;\r\n            break;\r\n        } else if (bidx + 1 < end && str.charAt(bidx + 1) === \"{\") {\r\n            // Swallow the double {{\r\n            addLiteral(str.substring(idx, bidx + 1));\r\n            idx = bidx + 2;\r\n            continue;\r\n        } else {\r\n            addLiteral(str.substring(idx, bidx));\r\n            idx = bidx;\r\n\r\n            // And now parse the f-string expression itself\r\n            let [expr, endIdx] = fstring_find_expr(str, bidx, end, raw, recurse_lvl, c, n);\r\n            values.push(expr);\r\n            idx = endIdx;\r\n        }\r\n    }\r\n    return [new Sk.astnodes.JoinedStr(values, LINENO(n), n.col_offset, n.end_lineno, n.end_col_offset), idx];\r\n}\r\n\r\nfunction parsestrplus(c, n) {\r\n    let strs = [];\r\n    let lastStrNode;\r\n    let bytesmode;\r\n\r\n    for (let i = 0; i < NCH(n); ++i) {\r\n        let chstr = CHILD(n, i).value;\r\n        let r = parsestr(c, CHILD(n,i), chstr);\r\n        let str = r[0];\r\n        let fmode = r[1];\r\n        let this_bytesmode = r[2];\r\n\r\n\r\n        /* Check that we're not mixing bytes with unicode. */\r\n        if (i != 0 && bytesmode !== this_bytesmode) {\r\n            ast_error(c, n, \"cannot mix bytes and nonbytes literals\");\r\n        }\r\n        bytesmode = this_bytesmode;\r\n\r\n        if (fmode) {\r\n            if (!Sk.__future__.python3) {\r\n                throw new Sk.builtin.SyntaxError(\"invalid string (f-strings are not supported in Python 2)\", c.c_filename, CHILD(n, i).lineno);\r\n            }\r\n            let jss = str.$jsstr();\r\n            let [astnode, _] = fstring_parse(jss, 0, jss.length, false, 0, c, CHILD(n, i));\r\n            strs.push.apply(strs, astnode.values);\r\n            lastStrNode = null;\r\n        } else {\r\n            if (lastStrNode) {\r\n                lastStrNode.s = lastStrNode.s.sq$concat(str);\r\n            } else {\r\n                let type = bytesmode ? Sk.astnodes.Bytes : Sk.astnodes.Str;\r\n                lastStrNode = new type(str, LINENO(n), n.col_offset, n.end_lineno, n.end_col_offset)\r\n                strs.push(lastStrNode);\r\n            }\r\n        }\r\n    }\r\n\r\n    if (strs.length === 1 && strs[0].constructor === Sk.astnodes.Str) {\r\n        return strs[0];\r\n    } else {\r\n        return new Sk.astnodes.JoinedStr(strs, LINENO(n), n.col_offset, n.end_lineno, n.end_col_offset);\r\n    }\r\n}\r\n\r\nconst FLOAT_RE = new RegExp(Sk._tokenize.Floatnumber);\r\nconst underscore = /_/g;\r\n\r\nfunction parsenumber(c, s, lineno) {\r\n    s = s.replace(underscore, \"\"); // we already know that we have a valid underscore number from the tokenizer\r\n\r\n    const end = s[s.length - 1];\r\n    // we know it's just a single floating point imaginary complex number\r\n    if (end === \"j\" || end === \"J\") {\r\n        return new Sk.builtin.complex(0, parseFloat(s.slice(0, -1)));\r\n    }\r\n\r\n    // use the tokenizer float test\r\n    if (FLOAT_RE.test(s)) {\r\n        return new Sk.builtin.float_(parseFloat(s));\r\n    }\r\n\r\n    const start = s[0];\r\n    // python 2 compatiblity\r\n    if (start === \"0\" && s !== \"0\" && s.charCodeAt(1) < 65 /** i.e. the second char is a digit and not a base */) {\r\n        s = \"0o\" + s.substring(1); // silent octal\r\n    }\r\n    // python2 makes no guarantee about the size of a long\r\n    // so only make the int literal a long if it has an L suffix\r\n    let isInt = true;\r\n    if (end === \"l\" || end === \"L\") {\r\n        s = s.slice(0, -1);\r\n        isInt = false;\r\n    }\r\n\r\n    // we know it's a valid octal, hex, binary or decimal so let Number do its thing\r\n    const val = Number(s); // we can rely on this since we know s is positive and is already a valid int literal\r\n    if (val > Number.MAX_SAFE_INTEGER) {\r\n        return isInt ? new Sk.builtin.int_(JSBI.BigInt(s)) : new Sk.builtin.lng(JSBI.BigInt(s));\r\n    }\r\n    return isInt ? new Sk.builtin.int_(val) : new Sk.builtin.lng(val);\r\n    }\r\n\r\n\r\nfunction astForSlice(c, n) {\r\n    var n2;\r\n    var step;\r\n    var upper;\r\n    var lower;\r\n    var ch;\r\n    REQ(n, SYM.subscript);\r\n\r\n    /*\r\n     subscript: '.' '.' '.' | test | [test] ':' [test] [sliceop]\r\n     sliceop: ':' [test]\r\n     */\r\n    ch = CHILD(n, 0);\r\n    lower = null;\r\n    upper = null;\r\n    step = null;\r\n    if (ch.type === TOK.T_DOT) {\r\n        return new Sk.astnodes.Ellipsis();\r\n    }\r\n    if (NCH(n) === 1 && ch.type === SYM.test) {\r\n        return new Sk.astnodes.Index(ast_for_expr(c, ch));\r\n    }\r\n    if (ch.type === SYM.test) {\r\n        lower = ast_for_expr(c, ch);\r\n    }\r\n    if (ch.type === TOK.T_COLON) {\r\n        if (NCH(n) > 1) {\r\n            n2 = CHILD(n, 1);\r\n            if (n2.type === SYM.test) {\r\n                upper = ast_for_expr(c, n2);\r\n            }\r\n        }\r\n    } else if (NCH(n) > 2) {\r\n        n2 = CHILD(n, 2);\r\n        if (n2.type === SYM.test) {\r\n            upper = ast_for_expr(c, n2);\r\n        }\r\n    }\r\n\r\n    ch = CHILD(n, NCH(n) - 1);\r\n    if (ch.type === SYM.sliceop) {\r\n        if (NCH(ch) === 1) {\r\n            ch = CHILD(ch, 0);\r\n            step = new Sk.astnodes.NameConstant(Sk.builtin.none.none$, Sk.astnodes.Load, ch.lineno, ch.col_offset, ch.end_lineno, ch.end_col_offset);\r\n        } else {\r\n            ch = CHILD(ch, 1);\r\n            if (ch.type === SYM.test) {\r\n                step = ast_for_expr(c, ch);\r\n            }\r\n        }\r\n    }\r\n    return new Sk.astnodes.Slice(lower, upper, step);\r\n}\r\n\r\nfunction ast_for_atom(c, n) {\r\n    /* atom: '(' [yield_expr|testlist_comp] ')' | '[' [testlist_comp] ']'\r\n       | '{' [dictmaker|testlist_comp] '}' | NAME | NUMBER | STRING+\r\n       | '...' | 'None' | 'True' | 'False'\r\n    */\r\n    var ch = CHILD(n, 0);\r\n\r\n    switch (TYPE(ch)) {\r\n        case TOK.T_NAME: {\r\n            var name;\r\n            var s = STR(ch);\r\n            if (s.length >= 4 && s.length <= 5) {\r\n                if (s === \"None\") {\r\n                    return new Sk.astnodes.NameConstant(Sk.builtin.none.none$, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n                }\r\n\r\n                if (s === \"True\") {\r\n                    return new Sk.astnodes.NameConstant(Sk.builtin.bool.true$, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n                }\r\n\r\n                if (s === \"False\") {\r\n                    return new Sk.astnodes.NameConstant(Sk.builtin.bool.false$, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n                }\r\n            }\r\n            name = new_identifier(s, c);\r\n            /* All names start in Load context, but may later be changed. */\r\n            return new Sk.astnodes.Name(name, Sk.astnodes.Load, LINENO(n), n.col_offset,\r\n                                        n.end_lineno, n.end_col_offset);\r\n        }\r\n        case TOK.T_STRING:\r\n            return parsestrplus(c, n);\r\n        case TOK.T_NUMBER:\r\n            return new Sk.astnodes.Num(parsenumber(c, ch.value, n.lineno), n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n        case TOK.T_ELLIPSIS: /* Ellipsis */\r\n            return new Sk.astnodes.Ellipsis(LINENO(n), n.col_offset,\r\n                                            n.end_lineno, n.end_col_offset);\r\n        case TOK.T_LPAR: /* some parenthesized expressions */\r\n            ch = CHILD(n, 1);\r\n\r\n            if (TYPE(ch) == TOK.T_RPAR) {\r\n                return new Sk.astnodes.Tuple([], Sk.astnodes.Load, LINENO(n), n.col_offset,\r\n                                             n.end_lineno, n.end_col_offset);\r\n            }\r\n\r\n            if (TYPE(ch) == SYM.yield_expr) {\r\n                return ast_for_expr(c, ch);\r\n            }\r\n\r\n            /* testlist_comp: test ( comp_for | (',' test)* [','] ) */\r\n            if (NCH(ch) == 1) {\r\n                return ast_for_testlist(c, ch);\r\n            }\r\n\r\n            if (TYPE(CHILD(ch, 1)) == SYM.comp_for) {\r\n                return copy_location(ast_for_genexp(c, ch), n);\r\n            } else {\r\n                return copy_location(ast_for_testlist(c, ch), n);\r\n            }\r\n        case TOK.T_LSQB: /* list (or list comprehension) */\r\n            ch = CHILD(n, 1);\r\n\r\n            if (TYPE(ch) == TOK.T_RSQB) {\r\n                return new Sk.astnodes.List([], Sk.astnodes.Load, LINENO(n), n.col_offset,\r\n                                            n.end_lineno, n.end_col_offset);\r\n            }\r\n\r\n            REQ(ch, SYM.testlist_comp);\r\n            if (NCH(ch) == 1 || TYPE(CHILD(ch, 1)) == TOK.T_COMMA) {\r\n                var elts = seq_for_testlist(c, ch);\r\n                if (!elts) {\r\n                    return null;\r\n                }\r\n                return new Sk.astnodes.List(elts, Sk.astnodes.Load, LINENO(n), n.col_offset,\r\n                                            n.end_lineno, n.end_col_offset);\r\n            } else {\r\n                return copy_location(ast_for_listcomp(c, ch), n);\r\n            }\r\n        case TOK.T_LBRACE: {\r\n            /* dictorsetmaker: ( ((test ':' test | '**' test)\r\n            *                    (comp_for | (',' (test ':' test | '**' test))* [','])) |\r\n            *                   ((test | '*' test)\r\n            *                    (comp_for | (',' (test | '*' test))* [','])) ) */\r\n            var res;\r\n            ch = CHILD(n, 1);\r\n            if (TYPE(ch) == TOK.T_RBRACE) {\r\n                /* It's an empty dict. */\r\n                return new Sk.astnodes.Dict(null, null, LINENO(n), n.col_offset,\r\n                                            n.end_lineno, n.end_col_offset);\r\n            } else {\r\n                var is_dict = (TYPE(CHILD(ch, 0)) == TOK.T_DOUBLESTAR);\r\n                if (NCH(ch) == 1 ||\r\n                    (NCH(ch) > 1 &&\r\n                        TYPE(CHILD(ch, 1)) == TOK.T_COMMA)) {\r\n                    /* It's a set display. */\r\n                    res = ast_for_setdisplay(c, ch);\r\n                } else if (NCH(ch) > 1 &&\r\n                    TYPE(CHILD(ch, 1)) == SYM.comp_for) {\r\n                    /* It's a set comprehension. */\r\n                    res = ast_for_setcomp(c, ch);\r\n                } else if (NCH(ch) > 3 - is_dict &&\r\n                    TYPE(CHILD(ch, 3 - is_dict)) == SYM.comp_for) {\r\n                    /* It's a dictionary comprehension. */\r\n                    if (is_dict) {\r\n                        ast_error(c, n,\r\n                                  \"dict unpacking cannot be used in dict comprehension\");\r\n                        return null;\r\n                    }\r\n                    res = ast_for_dictcomp(c, ch);\r\n                } else {\r\n                    /* It's a dictionary display. */\r\n                    res = ast_for_dictdisplay(c, ch);\r\n                }\r\n                return copy_location(res, n);\r\n            }\r\n        }\r\n        default:\r\n            Sk.asserts.fail(\"unhandled atom \" + TYPE(ch));\r\n            return null;\r\n    }\r\n}\r\n\r\nfunction ast_for_setdisplay(c, n) {\r\n    var i;\r\n    var elts = [];\r\n\r\n    Sk.asserts.assert(TYPE(n) === SYM.dictorsetmaker);\r\n\r\n    for (i = 0; i < NCH(n); i += 2) {\r\n        var expression;\r\n        expression = ast_for_expr(c, CHILD(n, i));\r\n        elts[i / 2] = expression;\r\n    }\r\n\r\n    return new Sk.astnodes.Set(elts, LINENO(n), n.col_offset, n.end_lineno, n.end_col_offset);\r\n}\r\n\r\nfunction astForAtomExpr(c, n) {\r\n    var i, nch, start = 0;\r\n    var e, tmp;\r\n\r\n    REQ(n, SYM.atom_expr);\r\n    nch = NCH(n);\r\n\r\n    if (CHILD(n, 0).type === TOK.T_AWAIT) {\r\n        start = 1;\r\n        Sk.asserts.assert(nch > 1);\r\n    }\r\n\r\n    e = ast_for_atom(c, CHILD(n, start));\r\n    if (!e) {\r\n        return null;\r\n    }\r\n\r\n    if (nch === 1) {\r\n        return e;\r\n    }\r\n\r\n    if (start && nch === 2) {\r\n        return new Sk.astnodes.Await(e, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset /*, c->c_arena*/);\r\n    }\r\n\r\n    for (i = start + 1; i < nch; i++) {\r\n        var ch = CHILD(n, i);\r\n        if (ch.type !== SYM.trailer) {\r\n            break;\r\n        }\r\n        tmp = ast_for_trailer(c, ch, e);\r\n        if (!tmp) {\r\n            return null;\r\n        }\r\n\r\n        tmp.lineno = e.lineno;\r\n        tmp.col_offset = e.col_offset;\r\n        e = tmp;\r\n    }\r\n\r\n    if (start) {\r\n        /* there was an AWAIT */\r\n        return new Sk.astnodes.Await(e, n.line, n.col_offset, n.end_lineno, n.end_col_offset /*, c->c_arena*/);\r\n    } else {\r\n        return e;\r\n    }\r\n}\r\n\r\nfunction astForPower(c, n) {\r\n    /* power: atom trailer* ('**' factor)*\r\n     */\r\n    var f;\r\n    var tmp;\r\n    var ch;\r\n    var i;\r\n    var e;\r\n    REQ(n, SYM.power);\r\n    e = astForAtomExpr(c, CHILD(n, 0));\r\n    if (NCH(n) === 1) {\r\n        return e;\r\n    }\r\n    if (CHILD(n, NCH(n) - 1).type === SYM.factor) {\r\n        f = ast_for_expr(c, CHILD(n, NCH(n) - 1));\r\n        e = new Sk.astnodes.BinOp(e, Sk.astnodes.Pow, f, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n    }\r\n    return e;\r\n}\r\n\r\nfunction astForStarred(c, n) {\r\n    REQ(n, SYM.star_expr);\r\n\r\n    /* The Load context is changed later */\r\n    return new Sk.astnodes.Starred(ast_for_expr(c, CHILD(n, 1)), Sk.astnodes.Load, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset /*, c.c_arena */);\r\n}\r\n\r\nfunction ast_for_expr(c, n) {\r\n    /*\r\n     handle the full range of simple expressions\r\n     test: or_test ['if' or_test 'else' test] | lambdef\r\n     test_nocond: or_test | lambdef_nocond\r\n     or_test: and_test ('or' and_test)*\r\n     and_test: not_test ('and' not_test)*\r\n     not_test: 'not' not_test | comparison\r\n     comparison: expr (comp_op expr)*\r\n     expr: xor_expr ('|' xor_expr)*\r\n     xor_expr: and_expr ('^' and_expr)*\r\n     and_expr: shift_expr ('&' shift_expr)*\r\n     shift_expr: arith_expr (('<<'|'>>') arith_expr)*\r\n     arith_expr: term (('+'|'-') term)*\r\n     term: factor (('*'|'/'|'%'|'//') factor)*\r\n     factor: ('+'|'-'|'~') factor | power\r\n     power: atom_expr ['**' factor]\r\n     atom_expr: [AWAIT] atom trailer*\r\n     yield_expr: 'yield' [yield_arg]\r\n    */\r\n\r\n    var exp;\r\n    var cmps;\r\n    var ops;\r\n    var i;\r\n    var seq;\r\n    LOOP: while (true) {\r\n        switch (n.type) {\r\n            case SYM.test:\r\n            case SYM.test_nocond:\r\n                if (CHILD(n, 0).type === SYM.lambdef || CHILD(n, 0).type === SYM.lambdef_nocond) {\r\n                    return astForLambdef(c, CHILD(n, 0));\r\n                } else if (NCH(n) > 1) {\r\n                    return astForIfexpr(c, n);\r\n                }\r\n            // fallthrough\r\n            case SYM.or_test:\r\n            case SYM.and_test:\r\n                if (NCH(n) === 1) {\r\n                    n = CHILD(n, 0);\r\n                    continue LOOP;\r\n                }\r\n                seq = [];\r\n                for (i = 0; i < NCH(n); i += 2) {\r\n                    seq[i / 2] = ast_for_expr(c, CHILD(n, i));\r\n                }\r\n                if (CHILD(n, 1).value === \"and\") {\r\n                    return new Sk.astnodes.BoolOp(Sk.astnodes.And, seq, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset /*, c.c_arena*/);\r\n                }\r\n                Sk.asserts.assert(CHILD(n, 1).value === \"or\");\r\n                return new Sk.astnodes.BoolOp(Sk.astnodes.Or, seq, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n            case SYM.not_test:\r\n                if (NCH(n) === 1) {\r\n                    n = CHILD(n, 0);\r\n                    continue LOOP;\r\n                } else {\r\n                    return new Sk.astnodes.UnaryOp(Sk.astnodes.Not, ast_for_expr(c, CHILD(n, 1)), n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n                }\r\n                break;\r\n            case SYM.comparison:\r\n                if (NCH(n) === 1) {\r\n                    n = CHILD(n, 0);\r\n                    continue LOOP;\r\n                } else {\r\n                    ops = [];\r\n                    cmps = [];\r\n                    for (i = 1; i < NCH(n); i += 2) {\r\n                        ops[(i - 1) / 2] = astForCompOp(c, CHILD(n, i));\r\n                        cmps[(i - 1) / 2] = ast_for_expr(c, CHILD(n, i + 1));\r\n                    }\r\n                    return new Sk.astnodes.Compare(ast_for_expr(c, CHILD(n, 0)), ops, cmps, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n                }\r\n                break;\r\n            case SYM.star_expr:\r\n                return astForStarred(c, n);\r\n            /* The next fize cases all handle BinOps  The main body of code\r\n               is the same in each case, but the switch turned inside out to\r\n               reuse the code for each type of operator\r\n             */\r\n            case SYM.expr:\r\n            case SYM.xor_expr:\r\n            case SYM.and_expr:\r\n            case SYM.shift_expr:\r\n            case SYM.arith_expr:\r\n            case SYM.term:\r\n                if (NCH(n) === 1) {\r\n                    n = CHILD(n, 0);\r\n                    continue LOOP;\r\n                }\r\n                return astForBinop(c, n);\r\n            case SYM.yield_expr:\r\n                var an;\r\n                var en;\r\n                var is_from = false;\r\n                exp = null;\r\n                if (NCH(n) > 1) {\r\n                    an = CHILD(n, 1); /* yield_arg */\r\n                }\r\n\r\n                if (an) {\r\n                    en = CHILD(an, NCH(an) - 1);\r\n                    if (NCH(an) == 2) {\r\n                        is_from = true;\r\n                        exp = ast_for_expr(c, en);\r\n                    } else {\r\n                        exp = ast_for_testlist(c, en);\r\n                    }\r\n                }\r\n\r\n                if (is_from) {\r\n                    return new Sk.astnodes.YieldFrom(exp, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n                }\r\n\r\n                return new Sk.astnodes.Yield(exp, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n            case SYM.factor:\r\n                if (NCH(n) === 1) {\r\n                    n = CHILD(n, 0);\r\n                    continue LOOP;\r\n                }\r\n                return astForFactor(c, n);\r\n            case SYM.power:\r\n                return astForPower(c, n);\r\n            default:\r\n                Sk.asserts.fail(\"unhandled expr\", \"n.type: %d\", n.type);\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nfunction astForNonLocalStmt(c, n) {\r\n    ast_error(c, n, \"Not implemented: nonlocal\");\r\n}\r\n\r\nfunction astForAsyncStmt(c, n) {\r\n    ast_error(c, n, \"Not implemented: async\");\r\n}\r\n\r\n// This is only used for Python 2 support.\r\nfunction astForPrintStmt(c, n) {\r\n\r\n    if (Sk.__future__.print_function) {\r\n        ast_error(c, n, \"Missing parentheses in call to 'print'\");\r\n    }\r\n\r\n    /* print_stmt: 'print' ( [ test (',' test)* [','] ]\r\n     | '>>' test [ (',' test)+ [','] ] )\r\n     */\r\n    var nl;\r\n    var i, j;\r\n    var seq;\r\n    var start = 1;\r\n    var dest = null;\r\n    REQ(n, SYM.print_stmt);\r\n    if (NCH(n) >= 2 && CHILD(n, 1).type === TOK.T_RIGHTSHIFT) {\r\n        dest = ast_for_expr(c, CHILD(n, 2));\r\n        start = 4;\r\n    }\r\n    seq = [];\r\n    for (i = start, j = 0; i < NCH(n); i += 2, ++j) {\r\n        seq[j] = ast_for_expr(c, CHILD(n, i));\r\n    }\r\n    nl = (CHILD(n, NCH(n) - 1)).type === TOK.T_COMMA ? false : true;\r\n    return new Sk.astnodes.Print(dest, seq, nl, n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n}\r\n\r\nfunction astForStmt(c, n) {\r\n    var ch;\r\n    if (n.type === SYM.stmt) {\r\n        Sk.asserts.assert(NCH(n) === 1);\r\n        n = CHILD(n, 0);\r\n    }\r\n    if (n.type === SYM.simple_stmt) {\r\n        Sk.asserts.assert(numStmts(n) === 1);\r\n        n = CHILD(n, 0);\r\n    }\r\n    if (n.type === SYM.small_stmt) {\r\n        n = CHILD(n, 0);\r\n        /* small_stmt: expr_stmt | del_stmt | pass_stmt | flow_stmt\r\n                   | import_stmt | global_stmt | nonlocal_stmt | assert_stmt\r\n                   | debugger_stmt (skulpt special)\r\n        */\r\n        switch (n.type) {\r\n            case SYM.expr_stmt:\r\n                return ast_for_exprStmt(c, n);\r\n            case SYM.del_stmt:\r\n                return astForDelStmt(c, n);\r\n            case SYM.pass_stmt:\r\n                return new Sk.astnodes.Pass(n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n            case SYM.flow_stmt:\r\n                return ast_for_flow_stmt(c, n);\r\n            case SYM.import_stmt:\r\n                return astForImportStmt(c, n);\r\n            case SYM.global_stmt:\r\n                return astForGlobalStmt(c, n);\r\n            case SYM.nonlocal_stmt:\r\n                return astForNonLocalStmt(c, n);\r\n            case SYM.assert_stmt:\r\n                return astForAssertStmt(c, n);\r\n            case SYM.print_stmt:\r\n                return astForPrintStmt(c, n);\r\n            case SYM.debugger_stmt:\r\n                return new Sk.astnodes.Debugger(n.lineno, n.col_offset, n.end_lineno, n.end_col_offset);\r\n            default:\r\n                Sk.asserts.fail(\"unhandled small_stmt\");\r\n        }\r\n    } else {\r\n        /* compound_stmt: if_stmt | while_stmt | for_stmt | try_stmt\r\n                        | funcdef | classdef | decorated | async_stmt\r\n        */\r\n        ch = CHILD(n, 0);\r\n        REQ(n, SYM.compound_stmt);\r\n        switch (ch.type) {\r\n            case SYM.if_stmt:\r\n                return astForIfStmt(c, ch);\r\n            case SYM.while_stmt:\r\n                return astForWhileStmt(c, ch);\r\n            case SYM.for_stmt:\r\n                return astForForStmt(c, ch);\r\n            case SYM.try_stmt:\r\n                return astForTryStmt(c, ch);\r\n            case SYM.with_stmt:\r\n                return ast_for_with_stmt(c, ch);\r\n            case SYM.funcdef:\r\n                return ast_for_funcdef(c, ch, []);\r\n            case SYM.classdef:\r\n                return astForClassdef(c, ch, []);\r\n            case SYM.decorated:\r\n                return ast_for_decorated(c, ch);\r\n            case SYM.async_stmt:\r\n                return astForAsyncStmt(c, ch);\r\n            default:\r\n                Sk.asserts.assert(\"unhandled compound_stmt\");\r\n        }\r\n    }\r\n};\r\n\r\nSk.astFromParse = function (n, filename, c_flags) {\r\n    var j;\r\n    var num;\r\n    var ch;\r\n    var i;\r\n    var c = new Compiling(\"utf-8\", filename, c_flags);\r\n    var stmts = [];\r\n    var k = 0;\r\n    switch (n.type) {\r\n        case SYM.file_input:\r\n            for (i = 0; i < NCH(n) - 1; ++i) {\r\n                ch = CHILD(n, i);\r\n                if (ch.type === TOK.T_NEWLINE) {\r\n                    continue;\r\n                }\r\n                REQ(ch, SYM.stmt);\r\n                num = numStmts(ch);\r\n                if (num === 1) {\r\n                    stmts[k++] = astForStmt(c, ch);\r\n                } else {\r\n                    ch = CHILD(ch, 0);\r\n                    REQ(ch, SYM.simple_stmt);\r\n                    for (j = 0; j < num; ++j) {\r\n                        stmts[k++] = astForStmt(c, CHILD(ch, j * 2));\r\n                    }\r\n                }\r\n            }\r\n            return new Sk.astnodes.Module(stmts);\r\n        case SYM.eval_input:\r\n            Sk.asserts.fail(\"todo;\");\r\n        case SYM.single_input:\r\n            Sk.asserts.fail(\"todo;\");\r\n        default:\r\n            Sk.asserts.fail(\"todo;\");\r\n    }\r\n};\r\n\r\nSk.astDump = function (node) {\r\n    var spaces = function (n) {// todo; blurgh\r\n        var i;\r\n        var ret = \"\";\r\n        for (i = 0; i < n; ++i) {\r\n            ret += \" \";\r\n        }\r\n        return ret;\r\n    };\r\n\r\n    var _format = function (node, indent) {\r\n        var ret;\r\n        var elemsstr;\r\n        var x;\r\n        var elems;\r\n        var fieldstr;\r\n        var field;\r\n        var attrs;\r\n        var fieldlen;\r\n        var b;\r\n        var a;\r\n        var i;\r\n        var fields;\r\n        var namelen;\r\n        if (node === null) {\r\n            return indent + \"None\";\r\n        } else if (node.prototype && node.prototype._astname !== undefined && node.prototype._isenum) {\r\n            return indent + node.prototype._astname + \"()\";\r\n        } else if (node._astname !== undefined) {\r\n            namelen = spaces(node._astname.length + 1);\r\n            fields = [];\r\n            for (i = 0; i < node._fields.length; i += 2) {// iter_fields\r\n                a = node._fields[i]; // field name\r\n                b = node._fields[i + 1](node); // field getter func\r\n                fieldlen = spaces(a.length + 1);\r\n                fields.push([a, _format(b, indent + namelen + fieldlen)]);\r\n            }\r\n            attrs = [];\r\n            for (i = 0; i < fields.length; ++i) {\r\n                field = fields[i];\r\n                attrs.push(field[0] + \"=\" + field[1].replace(/^\\s+/, \"\"));\r\n            }\r\n            fieldstr = attrs.join(\",\\n\" + indent + namelen);\r\n            return indent + node._astname + \"(\" + fieldstr + \")\";\r\n        } else if (Sk.isArrayLike(node)) {\r\n            //Sk.debugout(\"arr\", node.length);\r\n            elems = [];\r\n            for (i = 0; i < node.length; ++i) {\r\n                x = node[i];\r\n                elems.push(_format(x, indent + \" \"));\r\n            }\r\n            elemsstr = elems.join(\",\\n\");\r\n            return indent + \"[\" + elemsstr.replace(/^\\s+/, \"\") + \"]\";\r\n        } else {\r\n            if (node === true) {\r\n                ret = \"True\";\r\n            } else if (node === false) {\r\n                ret = \"False\";\r\n            } else if (node instanceof Sk.builtin.lng) {\r\n                ret = node.tp$str().v;\r\n            } else if (node instanceof Sk.builtin.str) {\r\n                ret = node[\"$r\"]().v;\r\n            } else {\r\n                ret = \"\" + node;\r\n            }\r\n            return indent + ret;\r\n        }\r\n    };\r\n\r\n    return _format(node, \"\");\r\n};\r\n\r\n\r\nSk.INHERITANCE_MAP = {\r\n    \"mod\": [Sk.astnodes.Module,\r\n            Sk.astnodes.Interactive,\r\n            Sk.astnodes.Expression,\r\n            Sk.astnodes.Suite],\r\n    \"stmt\": [Sk.astnodes.FunctionDef,\r\n             Sk.astnodes.AsyncFunctionDef,\r\n             Sk.astnodes.ClassDef,\r\n             Sk.astnodes.Return,\r\n             Sk.astnodes.Delete,\r\n             Sk.astnodes.Assign,\r\n             Sk.astnodes.AugAssign,\r\n             Sk.astnodes.AnnAssign,\r\n             Sk.astnodes.For,\r\n             Sk.astnodes.AsyncFor,\r\n             Sk.astnodes.While,\r\n             Sk.astnodes.If,\r\n             Sk.astnodes.With,\r\n             Sk.astnodes.AsyncWith,\r\n             Sk.astnodes.Raise,\r\n             Sk.astnodes.Try,\r\n             Sk.astnodes.Assert,\r\n             Sk.astnodes.Import,\r\n             Sk.astnodes.ImportFrom,\r\n             Sk.astnodes.Global,\r\n             Sk.astnodes.Nonlocal,\r\n             Sk.astnodes.Expr,\r\n             Sk.astnodes.Pass,\r\n             Sk.astnodes.Break,\r\n             Sk.astnodes.Continue,\r\n             Sk.astnodes.Print,\r\n             Sk.astnodes.Debugger],\r\n    \"expr\": [Sk.astnodes.BoolOp,\r\n             Sk.astnodes.BinOp,\r\n             Sk.astnodes.UnaryOp,\r\n             Sk.astnodes.Lambda,\r\n             Sk.astnodes.IfExp,\r\n             Sk.astnodes.Dict,\r\n             Sk.astnodes.Set,\r\n             Sk.astnodes.ListComp,\r\n             Sk.astnodes.SetComp,\r\n             Sk.astnodes.DictComp,\r\n             Sk.astnodes.GeneratorExp,\r\n             Sk.astnodes.Await,\r\n             Sk.astnodes.Yield,\r\n             Sk.astnodes.YieldFrom,\r\n             Sk.astnodes.Compare,\r\n             Sk.astnodes.Call,\r\n             Sk.astnodes.Num,\r\n             Sk.astnodes.Str,\r\n             Sk.astnodes.FormattedValue,\r\n             Sk.astnodes.JoinedStr,\r\n             Sk.astnodes.Bytes,\r\n             Sk.astnodes.Ellipsis,\r\n             Sk.astnodes.NameConstant,\r\n             Sk.astnodes.Constant,\r\n             Sk.astnodes.Attribute,\r\n             Sk.astnodes.Subscript,\r\n             Sk.astnodes.Starred,\r\n             Sk.astnodes.Name,\r\n             Sk.astnodes.List,\r\n             Sk.astnodes.Tuple],\r\n    \"expr_context\": [Sk.astnodes.Load,\r\n                     Sk.astnodes.Store,\r\n                     Sk.astnodes.Del,\r\n                     Sk.astnodes.AugLoad,\r\n                     Sk.astnodes.AugStore,\r\n                     Sk.astnodes.Param],\r\n    \"slice\": [Sk.astnodes.Slice,\r\n              Sk.astnodes.ExtSlice,\r\n              Sk.astnodes.Index],\r\n    \"boolop\": [Sk.astnodes.And, Sk.astnodes.Or],\r\n    \"operator\": [Sk.astnodes.Add,\r\n                 Sk.astnodes.Sub,\r\n                 Sk.astnodes.Mult,\r\n                 Sk.astnodes.MatMult,\r\n                 Sk.astnodes.Div,\r\n                 Sk.astnodes.Mod,\r\n                 Sk.astnodes.Pow,\r\n                 Sk.astnodes.LShift,\r\n                 Sk.astnodes.RShift,\r\n                 Sk.astnodes.BitOr,\r\n                 Sk.astnodes.BitXor,\r\n                 Sk.astnodes.BitAnd,\r\n                 Sk.astnodes.FloorDiv],\r\n    \"unaryop\": [Sk.astnodes.Invert,\r\n                Sk.astnodes.Not,\r\n                Sk.astnodes.UAdd,\r\n                Sk.astnodes.USub],\r\n    \"cmpop\": [Sk.astnodes.Eq,\r\n              Sk.astnodes.NotEq,\r\n              Sk.astnodes.Lt,\r\n              Sk.astnodes.LtE,\r\n              Sk.astnodes.Gt,\r\n              Sk.astnodes.GtE,\r\n              Sk.astnodes.Is,\r\n              Sk.astnodes.IsNot,\r\n              Sk.astnodes.In,\r\n              Sk.astnodes.NotIn],\r\n    \"comprehension\": [],\r\n    \"excepthandler\": [Sk.astnodes.ExceptHandler],\r\n    \"arguments_\": [],\r\n    \"arg\": [],\r\n    \"keyword\": [],\r\n    \"alias\": [],\r\n    \"withitem\": []\r\n};\r\n\r\nSk.exportSymbol(\"Sk.astFromParse\", Sk.astFromParse);\r\nSk.exportSymbol(\"Sk.astDump\", Sk.astDump);\r\nSk.exportSymbol(\"Sk.INHERITANCE_MAP\", Sk.INHERITANCE_MAP);\r\n","const int_proto = Sk.builtin.int_.prototype;\r\n\r\n/**\r\n * @constructor\r\n * Sk.builtin.bool\r\n *\r\n * @description\r\n * Constructor for Python bool. Also used for builtin bool() function.\r\n *\r\n * Where possible, do not create a new instance but use the constants\r\n * Sk.builtin.bool.true$ or Sk.builtin.bool.false$. These are defined in src/constant.js\r\n *\r\n * @extends {Sk.builtin.int_}\r\n *\r\n * @param  {(Object|number|boolean)} x Value to evaluate as true or false\r\n * @return {Sk.builtin.bool} Sk.builtin.bool.true$ if x is true, Sk.builtin.bool.false$ otherwise\r\n */\r\nSk.builtin.bool = Sk.abstr.buildNativeClass(\"bool\", {\r\n    constructor: function bool(x) {\r\n        if (Sk.misceval.isTrue(x)) {\r\n            return Sk.builtin.bool.true$;\r\n        } else {\r\n            return Sk.builtin.bool.false$;\r\n        }\r\n    },\r\n    base: Sk.builtin.int_,\r\n    slots: {\r\n        tp$doc:\r\n            \"bool(x) -> bool\\n\\nReturns True when the argument x is true, False otherwise.\\nThe builtins True and False are the only two instances of the class bool.\\nThe class bool is a subclass of the class int, and cannot be subclassed.\",\r\n        tp$new(args, kwargs) {\r\n            Sk.abstr.checkNoKwargs(\"bool\", kwargs);\r\n            Sk.abstr.checkArgsLen(\"bool\", args, 0, 1);\r\n            return new Sk.builtin.bool(args[0]); //technically we don't need new but easier to keep consistent\r\n        },\r\n        $r() {\r\n            return this.v ? this.str$True : this.str$False;\r\n        },\r\n\r\n        tp$as_number: true,\r\n        nb$and(other) {\r\n            if (other.ob$type === Sk.builtin.bool) {\r\n                return new Sk.builtin.bool(this.v & other.v);\r\n            }\r\n            return int_proto.nb$and.call(this, other);\r\n        },\r\n        nb$or(other) {\r\n            if (other.ob$type === Sk.builtin.bool) {\r\n                return new Sk.builtin.bool(this.v | other.v);\r\n            }\r\n            return int_proto.nb$or.call(this, other);\r\n        },\r\n        nb$xor(other) {\r\n            if (other.ob$type === Sk.builtin.bool) {\r\n                return new Sk.builtin.bool(this.v ^ other.v);\r\n            }\r\n            return int_proto.nb$xor.call(this, other);\r\n        },\r\n    },\r\n    flags: {\r\n        sk$unacceptableBase: true,\r\n    },\r\n    methods: {\r\n        __format__: {\r\n            $meth() {\r\n                return this.$r();\r\n            },\r\n            $flags: {OneArg: true},\r\n        }\r\n    },\r\n    proto: {\r\n        str$False: new Sk.builtin.str(\"False\"),\r\n        str$True: new Sk.builtin.str(\"True\"),\r\n    }\r\n});\r\nSk.exportSymbol(\"Sk.builtin.bool\", Sk.builtin.bool);\r\n\r\n/**\r\n * Python bool True constant.\r\n * @type {Sk.builtin.bool}\r\n * @member {Sk.builtin.bool}\r\n */\r\nSk.builtin.bool.true$ = /** @type {Sk.builtin.bool} */ (Object.create(Sk.builtin.bool.prototype, {\r\n    v: {value: 1, enumerable: true},\r\n}));\r\n\r\n/**\r\n * Python bool False constant.\r\n * @type {Sk.builtin.bool}\r\n * @member {Sk.builtin.bool}\r\n */\r\nSk.builtin.bool.false$ = /** @type {Sk.builtin.bool} */ (Object.create(Sk.builtin.bool.prototype, {\r\n    v: {value: 0, enumerable: true},\r\n}));\r\n","/** @typedef {Sk.builtin.object} */ var pyObject;\r\n\r\n/**\r\n * builtins are supposed to come from the __builtin__ module, but we don't do\r\n * that yet.\r\n * todo; these should all be func objects too, otherwise str() of them won't\r\n * work, etc.\r\n */\r\n\r\n\r\nSk.builtin.asnum$ = function (a) {\r\n    if (a === undefined) {\r\n        return a;\r\n    }\r\n    if (a === null) {\r\n        return a;\r\n    }\r\n    if (typeof a === \"number\") {\r\n        return a;\r\n    }\r\n    if (a instanceof Sk.builtin.int_) {\r\n        if (typeof a.v === \"number\") {\r\n            return a.v;\r\n        }\r\n        return a.v.toString(); // then we have a BigInt\r\n    }\r\n    if (a instanceof Sk.builtin.float_) {\r\n        return a.v;\r\n    }\r\n    if (a === Sk.builtin.none.none$) {\r\n        return null;\r\n    }\r\n    if (typeof a === \"string\") {\r\n        return a;\r\n    }\r\n    return a;\r\n};\r\n\r\nSk.exportSymbol(\"Sk.builtin.asnum$\", Sk.builtin.asnum$);\r\n\r\n/**\r\n * Return a Python number (either float or int) from a Javascript number.\r\n *\r\n * Javacsript function, returns Python object.\r\n *\r\n * @param  {number} a Javascript number to transform into Python number.\r\n * @return {(Sk.builtin.int_|Sk.builtin.float_)} A Python number.\r\n */\r\nSk.builtin.assk$ = function (a) {\r\n    if (a % 1 === 0) {\r\n        return new Sk.builtin.int_(a);\r\n    } else {\r\n        return new Sk.builtin.float_(a);\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.builtin.assk$\", Sk.builtin.assk$);\r\n\r\nSk.builtin.asnum$nofloat = function (a) {\r\n    var decimal;\r\n    var mantissa;\r\n    var expon;\r\n    if (a === undefined) {\r\n        return a;\r\n    } else if (a === null) {\r\n        return a;\r\n    } else if (typeof a === \"number\") {\r\n        a = a.toString();\r\n    } else if (a instanceof Sk.builtin.int_) {\r\n        a = a.v.toString();\r\n    } else if (a instanceof Sk.builtin.float_) {\r\n        a = a.v.toString();\r\n    } else if (a === Sk.builtin.none.none$) {\r\n        return null;\r\n    } else {\r\n        return undefined;\r\n    }\r\n\r\n    //  Sk.debugout(\"INITIAL: \" + a);\r\n\r\n    //  If not a float, great, just return this\r\n    if (a.indexOf(\".\") < 0 && a.indexOf(\"e\") < 0 && a.indexOf(\"E\") < 0) {\r\n        return a;\r\n    }\r\n\r\n    expon = 0;\r\n\r\n    if (a.indexOf(\"e\") >= 0) {\r\n        mantissa = a.substr(0, a.indexOf(\"e\"));\r\n        expon = a.substr(a.indexOf(\"e\") + 1);\r\n    } else if (a.indexOf(\"E\") >= 0) {\r\n        mantissa = a.substr(0, a.indexOf(\"e\"));\r\n        expon = a.substr(a.indexOf(\"E\") + 1);\r\n    } else {\r\n        mantissa = a;\r\n    }\r\n\r\n    expon = parseInt(expon, 10);\r\n\r\n    decimal = mantissa.indexOf(\".\");\r\n\r\n    //  Simplest case, no decimal\r\n    if (decimal < 0) {\r\n        if (expon >= 0) {\r\n            // Just add more zeroes and we're done\r\n            while (expon-- > 0) {\r\n                mantissa += \"0\";\r\n            }\r\n            return mantissa;\r\n        } else {\r\n            if (mantissa.length > -expon) {\r\n                return mantissa.substr(0, mantissa.length + expon);\r\n            } else {\r\n                return 0;\r\n            }\r\n        }\r\n    }\r\n\r\n    //  Negative exponent OR decimal (neg or pos exp)\r\n    if (decimal === 0) {\r\n        mantissa = mantissa.substr(1);\r\n    } else if (decimal < mantissa.length) {\r\n        mantissa = mantissa.substr(0, decimal) + mantissa.substr(decimal + 1);\r\n    } else {\r\n        mantissa = mantissa.substr(0, decimal);\r\n    }\r\n\r\n    decimal = decimal + expon;\r\n    while (decimal > mantissa.length) {\r\n        mantissa += \"0\";\r\n    }\r\n\r\n    if (decimal <= 0) {\r\n        mantissa = 0;\r\n    } else {\r\n        mantissa = mantissa.substr(0, decimal);\r\n    }\r\n\r\n    return mantissa;\r\n};\r\nSk.exportSymbol(\"Sk.builtin.asnum$nofloat\", Sk.builtin.asnum$nofloat);\r\n\r\nSk.builtin.round = function round(number, ndigits) {\r\n    if (number === undefined) {\r\n        throw new Sk.builtin.TypeError(\"a float is required\");\r\n    }\r\n    if (!Sk.__future__.dunder_round) {\r\n        if (!Sk.builtin.checkNumber(number)) {\r\n            throw new Sk.builtin.TypeError(\"a float is required\");\r\n        }\r\n        if (number.round$) {\r\n            return number.round$(ndigits);\r\n        } else {\r\n            throw new Sk.builtin.AttributeError(Sk.abstr.typeName(number) + \" instance has no attribute '__float__'\");\r\n        }\r\n    }\r\n\r\n    if (ndigits !== undefined && !Sk.builtin.checkNone(ndigits) && !Sk.misceval.isIndex(ndigits)) {\r\n        throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(ndigits) + \"' object cannot be interpreted as an index\");\r\n    }\r\n\r\n    // try calling internal magic method\r\n    const special = Sk.abstr.lookupSpecial(number, Sk.builtin.str.$round);\r\n    if (special !== undefined) {\r\n        // method on builtin, provide this arg\r\n        if (ndigits !== undefined) {\r\n            return Sk.misceval.callsimArray(special, [ndigits]);\r\n        } else {\r\n            return Sk.misceval.callsimArray(special, []);\r\n        }\r\n    } else {\r\n        throw new Sk.builtin.TypeError(\"a float is required\");\r\n    }\r\n};\r\n\r\nSk.builtin.len = function len(item) {\r\n    // checking will happen in slot wrapper\r\n    let res;\r\n    if (item.sq$length) {\r\n        res = item.sq$length(true);\r\n    } else {\r\n        throw new Sk.builtin.TypeError(\"object of type '\" + Sk.abstr.typeName(item) + \"' has no len()\");\r\n    }\r\n    return Sk.misceval.chain(res, (r) => {\r\n        return new Sk.builtin.int_(r);\r\n    });\r\n};\r\n\r\nSk.builtin.min = function min(args, kwargs) {\r\n    let iter;\r\n    const nargs = args.length;\r\n    if (!nargs) {\r\n        throw new Sk.builtin.TypeError(\"min expected 1 argument, got 0\");\r\n    }\r\n    const [$default, key] = Sk.abstr.copyKeywordsToNamedArgs(\"min\", [\"default\", \"key\"], [], kwargs, [null, Sk.builtin.none.none$]);\r\n\r\n    // if args is not a single iterable then default should not be included as a kwarg\r\n    if (nargs > 1 && $default !== null) {\r\n        throw new Sk.builtin.TypeError(\"Cannot specify a default for min() with multiple positional arguments\");\r\n    }\r\n\r\n    if (nargs == 1) {\r\n        iter = Sk.abstr.iter(args[0]);\r\n    } else {\r\n        iter = Sk.abstr.iter(new Sk.builtin.tuple(args));\r\n    }\r\n\r\n    if (!Sk.builtin.checkNone(key) && !Sk.builtin.checkCallable(key)) {\r\n        throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(key) + \"' object is not callable\");\r\n    }\r\n\r\n    let lowest;\r\n    return Sk.misceval.chain(\r\n        iter.tp$iternext(true),\r\n        (i) => {\r\n            lowest = i;\r\n            if (lowest === undefined) {\r\n                return;\r\n            }\r\n            if (Sk.builtin.checkNone(key)) {\r\n                return Sk.misceval.iterFor(iter, (i) => {\r\n                    if (Sk.misceval.richCompareBool(i, lowest, \"Lt\")) {\r\n                        lowest = i;\r\n                    }\r\n                });\r\n            } else {\r\n                return Sk.misceval.chain(Sk.misceval.callsimOrSuspendArray(key, [lowest]), (lowest_compare) =>\r\n                    Sk.misceval.iterFor(iter, (i) =>\r\n                        Sk.misceval.chain(Sk.misceval.callsimOrSuspendArray(key, [i]), (i_compare) => {\r\n                            if (Sk.misceval.richCompareBool(i_compare, lowest_compare, \"Lt\")) {\r\n                                lowest = i;\r\n                                lowest_compare = i_compare;\r\n                            }\r\n                        })\r\n                    )\r\n                );\r\n            }\r\n        },\r\n        () => {\r\n            if (lowest === undefined) {\r\n                if ($default === null) {\r\n                    throw new Sk.builtin.ValueError(\"min() arg is an empty sequence\");\r\n                } else {\r\n                    lowest = $default;\r\n                }\r\n            }\r\n            return lowest;\r\n        }\r\n    );\r\n};\r\n\r\nSk.builtin.max = function max(args, kwargs) {\r\n    let iter;\r\n    const nargs = args.length;\r\n\r\n    if (!nargs) {\r\n        throw new Sk.builtin.TypeError(\"max expected 1 argument, got 0\");\r\n    }\r\n    const [$default, key] = Sk.abstr.copyKeywordsToNamedArgs(\"max\", [\"default\", \"key\"], [], kwargs, [null, Sk.builtin.none.none$]);\r\n\r\n    // if args is not a single iterable then default should not be included as a kwarg\r\n    if (nargs > 1 && $default !== null) {\r\n        throw new Sk.builtin.TypeError(\"Cannot specify a default for max() with multiple positional arguments\");\r\n    }\r\n\r\n    if (nargs === 1) {\r\n        iter = Sk.abstr.iter(args[0]);\r\n    } else {\r\n        iter = Sk.abstr.iter(new Sk.builtin.tuple(args));\r\n    }\r\n\r\n    if (!Sk.builtin.checkNone(key) && !Sk.builtin.checkCallable(key)) {\r\n        throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(key) + \"' object is not callable\");\r\n    }\r\n    let highest;\r\n    return Sk.misceval.chain(\r\n        iter.tp$iternext(true),\r\n        (i) => {\r\n            highest = i;\r\n            if (highest === undefined) {\r\n                return;\r\n            }\r\n            if (Sk.builtin.checkNone(key)) {\r\n                return Sk.misceval.iterFor(iter, (i) => {\r\n                    if (Sk.misceval.richCompareBool(i, highest, \"Gt\")) {\r\n                        highest = i;\r\n                    }\r\n                });\r\n            } else {\r\n                return Sk.misceval.chain(Sk.misceval.callsimOrSuspendArray(key, [highest]), (highest_compare) =>\r\n                    Sk.misceval.iterFor(iter, (i) =>\r\n                        Sk.misceval.chain(Sk.misceval.callsimOrSuspendArray(key, [i]), (i_compare) => {\r\n                            if (Sk.misceval.richCompareBool(i_compare, highest_compare, \"Gt\")) {\r\n                                highest = i;\r\n                                highest_compare = i_compare;\r\n                            }\r\n                        })\r\n                    )\r\n                );\r\n            }\r\n        },\r\n        () => {\r\n            if (highest === undefined) {\r\n                if ($default === null) {\r\n                    throw new Sk.builtin.ValueError(\"max() arg is an empty sequence\");\r\n                } else {\r\n                    highest = $default;\r\n                }\r\n            }\r\n            return highest;\r\n        }\r\n    );\r\n};\r\n\r\n// incase someone calls these functions via Sk.misceval.call\r\nSk.builtin.min.co_fastcall = Sk.builtin.max.co_fastcall = 1;\r\n\r\nSk.builtin.any = function any(iter) {\r\n    return Sk.misceval.chain(\r\n        Sk.misceval.iterFor(Sk.abstr.iter(iter), function (i) {\r\n            if (Sk.misceval.isTrue(i)) {\r\n                return new Sk.misceval.Break(Sk.builtin.bool.true$);\r\n            }\r\n        }),\r\n        (brValue) => brValue || Sk.builtin.bool.false$\r\n    );\r\n};\r\n\r\nSk.builtin.all = function all(iter) {\r\n    return Sk.misceval.chain(\r\n        Sk.misceval.iterFor(Sk.abstr.iter(iter), function (i) {\r\n            if (!Sk.misceval.isTrue(i)) {\r\n                return new Sk.misceval.Break(Sk.builtin.bool.false$);\r\n            }\r\n        }),\r\n        (brValue) => brValue || Sk.builtin.bool.true$\r\n    );\r\n};\r\n\r\nSk.builtin.sum = function sum(iter, start) {\r\n    var tot;\r\n    // follows the order of CPython checks\r\n    const it = Sk.abstr.iter(iter);\r\n    if (start === undefined) {\r\n        tot = new Sk.builtin.int_(0);\r\n    } else if (Sk.builtin.checkString(start)) {\r\n        throw new Sk.builtin.TypeError(\"sum() can't sum strings [use ''.join(seq) instead]\");\r\n    } else {\r\n        tot = start;\r\n    }\r\n\r\n    function fastSumInt() {\r\n        return Sk.misceval.iterFor(it, (i) => {\r\n            if (i.constructor === Sk.builtin.int_) {\r\n                tot = tot.nb$add(i);\r\n            } else if (i.constructor === Sk.builtin.float_) {\r\n                tot = tot.nb$float().nb$add(i);\r\n                return new Sk.misceval.Break(\"float\");\r\n            } else {\r\n                tot = Sk.abstr.numberBinOp(tot, i, \"Add\");\r\n                return new Sk.misceval.Break(\"slow\");\r\n            }\r\n        });\r\n    }\r\n\r\n    function fastSumFloat() {\r\n        return Sk.misceval.iterFor(it, (i) => {\r\n            if (i.constructor === Sk.builtin.float_ || i.constructor === Sk.builtin.int_) {\r\n                tot = tot.nb$add(i);\r\n            } else {\r\n                tot = Sk.abstr.numberBinOp(tot, i, \"Add\");\r\n                return new Sk.misceval.Break(\"slow\");\r\n            }\r\n        });\r\n    }\r\n\r\n    function slowSum() {\r\n        return Sk.misceval.iterFor(it, (i) => {\r\n            tot = Sk.abstr.numberBinOp(tot, i, \"Add\");\r\n        });\r\n    }\r\n\r\n    let sumType;\r\n    if (start === undefined || start.constructor === Sk.builtin.int_) {\r\n        sumType = fastSumInt();\r\n    } else if (start.constructor === Sk.builtin.float_) {\r\n        sumType = \"float\";\r\n    } else {\r\n        sumType = \"slow\";\r\n    }\r\n\r\n    return Sk.misceval.chain(\r\n        sumType,\r\n        (sumType) => {\r\n            if (sumType === \"float\") {\r\n                return fastSumFloat();\r\n            }\r\n            return sumType;\r\n        },\r\n        (sumType) => {\r\n            if (sumType === \"slow\") {\r\n                return slowSum();\r\n            }\r\n        },\r\n        () => tot\r\n    );\r\n};\r\n\r\nSk.builtin.zip = function zip() {\r\n    var el;\r\n    var tup;\r\n    var done;\r\n    var res;\r\n    var i;\r\n    var iters;\r\n    if (arguments.length === 0) {\r\n        return new Sk.builtin.list([]);\r\n    }\r\n\r\n    iters = [];\r\n    for (i = 0; i < arguments.length; i++) {\r\n        if (Sk.builtin.checkIterable(arguments[i])) {\r\n            iters.push(Sk.abstr.iter(arguments[i]));\r\n        } else {\r\n            throw new Sk.builtin.TypeError(\"argument \" + i + \" must support iteration\");\r\n        }\r\n    }\r\n    res = [];\r\n    done = false;\r\n    while (!done) {\r\n        tup = [];\r\n        for (i = 0; i < arguments.length; i++) {\r\n            el = iters[i].tp$iternext();\r\n            if (el === undefined) {\r\n                done = true;\r\n                break;\r\n            }\r\n            tup.push(el);\r\n        }\r\n        if (!done) {\r\n            res.push(new Sk.builtin.tuple(tup));\r\n        }\r\n    }\r\n    return new Sk.builtin.list(res);\r\n};\r\n\r\nSk.builtin.abs = function abs(x) {\r\n    if (x.nb$abs) {\r\n        return x.nb$abs();\r\n    }\r\n    throw new Sk.builtin.TypeError(\"bad operand type for abs(): '\" + Sk.abstr.typeName(x) + \"'\");\r\n};\r\n\r\n// fabs belongs in the math module but has been a Skulpt builtin since 41665a97d (2012).\r\n// Left in for backwards compatibility for now\r\nSk.builtin.fabs = function fabs(x) {\r\n    return Sk.builtin.abs(x);\r\n};\r\n\r\nSk.builtin.ord = function ord(x) {\r\n    if (Sk.builtin.checkString(x)) {\r\n        if ([...x.v].length !== 1 && x.sq$length() !== 1) {\r\n            // ^^ avoid the astral check unless necessary ^^\r\n            throw new Sk.builtin.TypeError(\"ord() expected a character, but string of length \" + x.v.length + \" found\");\r\n        }\r\n        return new Sk.builtin.int_(x.v.codePointAt(0));\r\n    } else if (Sk.builtin.checkBytes(x)) {\r\n        if (x.sq$length() !== 1) {\r\n            throw new Sk.builtin.TypeError(\"ord() expected a character, but string of length \" + x.v.length + \" found\");\r\n        }\r\n        return new Sk.builtin.int_(x.v[0]);\r\n    }\r\n    throw new Sk.builtin.TypeError(\"ord() expected a string of length 1, but \" + Sk.abstr.typeName(x) + \" found\");\r\n};\r\n\r\nSk.builtin.chr = function chr(x) {\r\n    if (!Sk.builtin.checkInt(x)) {\r\n        throw new Sk.builtin.TypeError(\"an integer is required\");\r\n    }\r\n    x = Sk.builtin.asnum$(x);\r\n    if (Sk.__future__.python3) {\r\n        if ((x < 0) || (x >= 0x110000)) {\r\n            throw new Sk.builtin.ValueError(\"chr() arg not in range(0x110000)\");\r\n        }\r\n    } else {\r\n        if ((x < 0) || (x >= 256)) {\r\n            throw new Sk.builtin.ValueError(\"chr() arg not in range(256)\");\r\n        }\r\n    }\r\n\r\n    return new Sk.builtin.str(String.fromCodePoint(x));\r\n};\r\n\r\nSk.builtin.unichr = function unichr(x) {\r\n    Sk.builtin.pyCheckArgsLen(\"unichr\", arguments.length, 1, 1);\r\n    if (!Sk.builtin.checkInt(x)) {\r\n        throw new Sk.builtin.TypeError(\"an integer is required\");\r\n    }\r\n    x = Sk.builtin.asnum$(x);\r\n\r\n    try {\r\n        return new Sk.builtin.str(String.fromCodePoint(x));\r\n    } catch (err) {\r\n        if (err instanceof RangeError) {\r\n            throw new Sk.builtin.ValueError(err.message);\r\n        }\r\n        throw err;\r\n    }\r\n};\r\n\r\n/**\r\n * This is a helper function and we already know that x is an int or has an nb$index slot\r\n */\r\nSk.builtin.int2str_ = function helper_(x, radix, prefix) {\r\n    let v = x.nb$index();\r\n    let isNegative = false;\r\n    if (typeof v === \"number\") {\r\n        isNegative = v < 0;\r\n        v = isNegative ? -v : v;\r\n    } else {\r\n        isNegative = JSBI.lessThan(v, JSBI.__ZERO);\r\n        v = isNegative ? JSBI.unaryMinus(v) : v;\r\n    }\r\n    let str = v.toString(radix);\r\n    if (isNegative) {\r\n        str = \"-\" + prefix + str;\r\n    } else {\r\n        str = prefix + str;\r\n    }\r\n    if (radix !== 2 && !Sk.__future__.python3 && (x instanceof Sk.builtin.lng || JSBI.__isBigInt(v))) {\r\n        str += \"L\";\r\n    }\r\n    return new Sk.builtin.str(str);\r\n};\r\n\r\nSk.builtin.hex = function hex(x) {\r\n    if (!Sk.misceval.isIndex(x)) {\r\n        throw new Sk.builtin.TypeError(\"hex() argument can't be converted to hex\");\r\n    }\r\n    return Sk.builtin.int2str_(x, 16, \"0x\");\r\n};\r\n\r\nSk.builtin.oct = function oct(x) {\r\n    if (!Sk.misceval.isIndex(x)) {\r\n        throw new Sk.builtin.TypeError(\"oct() argument can't be converted to hex\");\r\n    }\r\n    if (Sk.__future__.octal_number_literal) {\r\n        return Sk.builtin.int2str_(x, 8, \"0o\");\r\n    } else {\r\n        return Sk.builtin.int2str_(x, 8, \"0\");\r\n    }\r\n};\r\n\r\nSk.builtin.bin = function bin(x) {\r\n    if (!Sk.misceval.isIndex(x)) {\r\n        throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(x) + \"' object can't be interpreted as an index\");\r\n    }\r\n    return Sk.builtin.int2str_(x, 2, \"0b\");\r\n};\r\n\r\n\r\nSk.builtin.dir = function dir(obj) {\r\n    if (obj !== undefined) {\r\n        const obj_dir_func = Sk.abstr.lookupSpecial(obj, Sk.builtin.str.$dir);\r\n        return Sk.misceval.chain(Sk.misceval.callsimOrSuspendArray(obj_dir_func, []), (dir) => Sk.builtin.sorted(dir));\r\n        // now iter through the keys and check they are all stings\r\n    }\r\n    // then we want all the objects in the global scope\r\n    //todo\r\n    throw new Sk.builtin.NotImplementedError(\"skulpt does not yet support dir with no args\");\r\n};\r\n\r\nSk.builtin.repr = function repr(x) {\r\n    return x.$r();\r\n};\r\n\r\nSk.builtin.ascii = function ascii (x) {\r\n    return Sk.misceval.chain(x.$r(), (r) => {\r\n        let ret;\r\n        let i;\r\n        // Fast path\r\n        for (i=0; i < r.v.length; i++) {\r\n            if (r.v.charCodeAt(i) >= 0x7f) {\r\n                ret = r.v.substr(0, i);\r\n                break;\r\n            }\r\n        }\r\n        if (!ret) {\r\n            return r;\r\n        }\r\n        for (; i < r.v.length; i++) {\r\n            let c = r.v.charAt(i);\r\n            let cc = r.v.charCodeAt(i);\r\n\r\n            if (cc > 0x7f && cc <= 0xff) {\r\n                let ashex = cc.toString(16);\r\n                if (ashex.length < 2) {\r\n                    ashex = \"0\" + ashex;\r\n                }\r\n                ret += \"\\\\x\" + ashex;\r\n            } else if (cc > 0x7f && cc < 0xd800 || cc >= 0xe000) {\r\n                // BMP\r\n                ret += \"\\\\u\" + (\"000\"+cc.toString(16)).slice(-4);\r\n            } else if (cc >= 0xd800) {\r\n                // Surrogate pair stuff\r\n                let val = r.v.codePointAt(i);\r\n                i++;\r\n\r\n                val = val.toString(16);\r\n                let s = (\"0000000\"+val.toString(16));\r\n                if (val.length > 4) {\r\n                    ret += \"\\\\U\" + s.slice(-8);\r\n                } else {\r\n                    ret += \"\\\\u\" + s.slice(-4);\r\n                }\r\n            } else {\r\n                ret += c;\r\n            }\r\n        }\r\n        return new Sk.builtin.str(ret);\r\n    });\r\n};\r\n\r\nSk.builtin.open = function open(filename, mode, bufsize) {\r\n    if (mode === undefined) {\r\n        mode = new Sk.builtin.str(\"r\");\r\n    }\r\n    if (bufsize === undefined) {\r\n        bufsize = -1;\r\n    }\r\n\r\n    if (/\\+/.test(mode.v)) {\r\n        throw \"todo; haven't implemented read/write mode\";\r\n    } else if ((mode.v === \"w\" || mode.v === \"wb\" || mode.v === \"a\" || mode.v === \"ab\") && !Sk.nonreadopen) {\r\n        throw \"todo; haven't implemented non-read opens\";\r\n    }\r\n\r\n    return new Sk.builtin.file(filename, mode, bufsize);\r\n};\r\n\r\n\r\nSk.builtin.isinstance = function isinstance(obj, type) {\r\n    if (!Sk.builtin.checkClass(type) && !(type instanceof Sk.builtin.tuple)) {\r\n        throw new Sk.builtin.TypeError(\"isinstance() arg 2 must be a class, type, or tuple of classes and types\");\r\n    }\r\n\r\n    // Fast path\r\n    const act_type = obj.ob$type;\r\n    if (act_type === type) {\r\n        return Sk.builtin.bool.true$;\r\n    }\r\n    if (!(type instanceof Sk.builtin.tuple)) {\r\n        // attempt 1\r\n        if (act_type.$isSubType(type)) {\r\n            return Sk.builtin.bool.true$;\r\n        }\r\n        // fail so check if we have overriden __class__\r\n        const maybe_type = obj.tp$getattr(Sk.builtin.str.$class);\r\n        if (maybe_type == act_type) {\r\n            return Sk.builtin.bool.false$;\r\n        } else if (Sk.builtin.checkClass(maybe_type) && maybe_type.$isSubType(type)) {\r\n            return Sk.builtin.bool.true$;\r\n        }\r\n        return Sk.builtin.bool.false$;\r\n    }\r\n    // Handle tuple type argument\r\n    for (let i = 0; i < type.v.length; ++i) {\r\n        if (Sk.misceval.isTrue(Sk.builtin.isinstance(obj, type.v[i]))) {\r\n            return Sk.builtin.bool.true$;\r\n        }\r\n    }\r\n    return Sk.builtin.bool.false$;\r\n};\r\n\r\nSk.builtin.hash = function hash(obj) {\r\n    return new Sk.builtin.int_(Sk.abstr.objectHash(obj));\r\n};\r\n\r\nSk.builtin.getattr = function getattr(obj, pyName, default_) {\r\n    if (!Sk.builtin.checkString(pyName)) {\r\n        throw new Sk.builtin.TypeError(\"attribute name must be string\");\r\n    }\r\n    const res = Sk.misceval.tryCatch(\r\n        () => obj.tp$getattr(pyName, true),\r\n        (e) => {\r\n            if (e instanceof Sk.builtin.AttributeError) {\r\n                return undefined;\r\n            } else {\r\n                throw e;\r\n            }\r\n        }\r\n    );\r\n    return Sk.misceval.chain(res, (r) => {\r\n        if (r === undefined) {\r\n            if (default_ !== undefined) {\r\n                return default_;\r\n            }\r\n            throw new Sk.builtin.AttributeError(obj.sk$attrError() + \" has no attribute \" + Sk.misceval.objectRepr(pyName));\r\n        }\r\n        return r;\r\n    });\r\n};\r\n\r\nSk.builtin.setattr = function setattr(obj, pyName, value) {\r\n    // cannot set or del attr from builtin type\r\n    if (!Sk.builtin.checkString(pyName)) {\r\n        throw new Sk.builtin.TypeError(\"attribute name must be string\");\r\n    }\r\n    return Sk.misceval.chain(obj.tp$setattr(pyName, value, true), () => Sk.builtin.none.none$);\r\n};\r\n\r\nSk.builtin.raw_input = function (prompt) {\r\n    var lprompt = prompt ? prompt : \"\";\r\n\r\n    return Sk.misceval.chain(Sk.importModule(\"sys\", false, true), function (sys) {\r\n        if (Sk.inputfunTakesPrompt) {\r\n            return Sk.builtin.file.$readline(sys[\"$d\"][\"stdin\"], null, lprompt);\r\n        } else {\r\n            return Sk.misceval.chain(\r\n                undefined,\r\n                function () {\r\n                    return Sk.misceval.callsimOrSuspendArray(sys[\"$d\"][\"stdout\"][\"write\"], [sys[\"$d\"][\"stdout\"], new Sk.builtin.str(lprompt)]);\r\n                },\r\n                function () {\r\n                    return Sk.misceval.callsimOrSuspendArray(sys[\"$d\"][\"stdin\"][\"readline\"], [sys[\"$d\"][\"stdin\"]]);\r\n                }\r\n            );\r\n        }\r\n    });\r\n};\r\n\r\nSk.builtin.input = Sk.builtin.raw_input;\r\n\r\nSk.builtin.jseval = function jseval(evalcode) {\r\n    var result = Sk.global[\"eval\"](Sk.ffi.remapToJs(evalcode));\r\n    try {\r\n        return Sk.ffi.remapToPy(result);\r\n    } catch (err) {\r\n        if (err.constructor === Sk.asserts.AssertionError) {\r\n            return Sk.builtin.none.none$;\r\n        }\r\n\r\n        throw err;\r\n    }\r\n};\r\n\r\nSk.builtin.jsmillis = function jsmillis() {\r\n    var now = new Date();\r\n    return now.valueOf();\r\n};\r\n\r\nconst pyCode = Sk.abstr.buildNativeClass(\"code\", {\r\n    constructor: function code(filename, compiled) {\r\n        this.compiled = compiled; // old \"source\"\r\n        this.code = compiled.code;\r\n        this.filename = filename;\r\n    },\r\n    slots: {\r\n        tp$new(args, kwargs) {\r\n            throw new Sk.builtin.NotImplementedError(\"cannot construct a code object in skulpt\");\r\n        },\r\n        $r() {\r\n            return new Sk.builtin.str(\"<code object <module>, file \" + this.filename + \">\");\r\n        },\r\n    },\r\n});\r\n\r\n\r\nSk.builtin.compile = function (source, filename, mode, flags, dont_inherit, optimize) {\r\n    Sk.builtin.pyCheckType(\"source\", \"str\", Sk.builtin.checkString(source));\r\n    Sk.builtin.pyCheckType(\"filename\", \"str\", Sk.builtin.checkString(filename));\r\n    Sk.builtin.pyCheckType(\"mode\", \"str\", Sk.builtin.checkString(mode));\r\n    source = source.$jsstr();\r\n    filename = filename.$jsstr();\r\n    mode = mode.$jsstr();\r\n    return Sk.misceval.chain(Sk.compile(source, filename, mode, true, true), (co) => new pyCode(filename, co));\r\n};\r\n\r\n\r\nSk.builtin.eval = function (source, globals, locals) {\r\n    if (Sk.builtin.checkString(source)) {\r\n        source = source.$jsstr();\r\n    } else if (Sk.builtin.checkBytes(source)) {\r\n        throw new Sk.builtin.NotImplementedError(\"bytes for eval is not yet implemented in skulpt\");\r\n    }\r\n    if (typeof source === \"string\") {\r\n        source = source.trim();\r\n        const parse = Sk.parse(\"?\", source);\r\n        const ast = Sk.astFromParse(parse.cst, \"?\", parse.flags);\r\n        if (ast.body.length > 1 || !(ast.body[0] instanceof Sk.astnodes.Expr)) {\r\n            throw new Sk.builtin.SyntaxError(\"invalid syntax\");\r\n        }\r\n        source = \"__final_res__ = \" + source;\r\n    } else if (!(source instanceof pyCode)) {\r\n        throw new Sk.builtin.TypeError(\"eval() arg 1 must be a string, bytes or code object\");\r\n    }\r\n    return Sk.misceval.chain(Sk.builtin.exec(source, globals, locals), (new_locals) => {\r\n        const res = new_locals.__final_res__ || Sk.builtin.none.none$;\r\n        delete new_locals.__final_res__;\r\n        return res;\r\n    });\r\n};\r\n\r\nSk.builtin.map = function map(fun, seq) {\r\n    var retval = [];\r\n    var next;\r\n    var nones;\r\n    var args;\r\n    var argnum;\r\n    var i;\r\n    var iterables;\r\n    var combined;\r\n    Sk.builtin.pyCheckArgsLen(\"map\", arguments.length, 2);\r\n\r\n    if (arguments.length > 2) {\r\n        // Pack sequences into one list of Javascript Arrays\r\n\r\n        combined = [];\r\n        iterables = Array.prototype.slice.apply(arguments).slice(1);\r\n        for (i = 0; i < iterables.length; i++) {\r\n            if (!Sk.builtin.checkIterable(iterables[i])) {\r\n                argnum = parseInt(i, 10) + 2;\r\n                throw new Sk.builtin.TypeError(\"argument \" + argnum + \" to map() must support iteration\");\r\n            }\r\n            iterables[i] = Sk.abstr.iter(iterables[i]);\r\n        }\r\n\r\n        while (true) {\r\n            args = [];\r\n            nones = 0;\r\n            for (i = 0; i < iterables.length; i++) {\r\n                next = iterables[i].tp$iternext();\r\n                if (next === undefined) {\r\n                    args.push(Sk.builtin.none.none$);\r\n                    nones++;\r\n                } else {\r\n                    args.push(next);\r\n                }\r\n            }\r\n            if (nones !== iterables.length) {\r\n                combined.push(args);\r\n            } else {\r\n                // All iterables are done\r\n                break;\r\n            }\r\n        }\r\n        seq = new Sk.builtin.list(combined);\r\n    }\r\n\r\n    if (!Sk.builtin.checkIterable(seq)) {\r\n        throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(seq) + \"' object is not iterable\");\r\n    }\r\n\r\n    return Sk.misceval.chain(\r\n        Sk.misceval.iterFor(Sk.abstr.iter(seq), function (item) {\r\n            if (fun === Sk.builtin.none.none$) {\r\n                if (item instanceof Array) {\r\n                    // With None function and multiple sequences,\r\n                    // map should return a list of tuples\r\n                    item = new Sk.builtin.tuple(item);\r\n                }\r\n                retval.push(item);\r\n            } else {\r\n                if (!(item instanceof Array)) {\r\n                    // If there was only one iterable, convert to Javascript\r\n                    // Array for call to apply.\r\n                    item = [item];\r\n                }\r\n\r\n                return Sk.misceval.chain(Sk.misceval.callsimOrSuspendArray(fun, item), function (result) {\r\n                    retval.push(result);\r\n                });\r\n            }\r\n        }),\r\n        function () {\r\n            return new Sk.builtin.list(retval);\r\n        }\r\n    );\r\n};\r\n\r\nSk.builtin.reduce = function reduce(fun, seq, initializer) {\r\n    var item;\r\n    var accum_value;\r\n    var iter;\r\n    if (!Sk.builtin.checkIterable(seq)) {\r\n        throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(seq) + \"' object is not iterable\");\r\n    }\r\n\r\n    iter = Sk.abstr.iter(seq);\r\n    if (initializer === undefined) {\r\n        initializer = iter.tp$iternext();\r\n        if (initializer === undefined) {\r\n            throw new Sk.builtin.TypeError(\"reduce() of empty sequence with no initial value\");\r\n        }\r\n    }\r\n    accum_value = initializer;\r\n    for (item = iter.tp$iternext(); item !== undefined; item = iter.tp$iternext()) {\r\n        accum_value = Sk.misceval.callsimArray(fun, [accum_value, item]);\r\n    }\r\n\r\n    return accum_value;\r\n};\r\n\r\n/**\r\n *\r\n * @param {pyObject} iterable\r\n * @param {*=} cmp\r\n * @param {*=} key\r\n * @param {*=} reverse\r\n */\r\nSk.builtin.sorted = function sorted(iterable, cmp, key, reverse) {\r\n    const lst = Sk.misceval.arrayFromIterable(iterable, true);\r\n    return Sk.misceval.chain(lst, (L) => {\r\n        L = new Sk.builtin.list(L);\r\n        L.list$sort(cmp, key, reverse);\r\n        return L;\r\n    });\r\n};\r\n\r\nSk.builtin.filter = function filter(fun, iterable) {\r\n    var result;\r\n    var iter, item;\r\n    var retval;\r\n    var ret;\r\n    var add;\r\n    var ctor;\r\n    Sk.builtin.pyCheckArgsLen(\"filter\", arguments.length, 2, 2);\r\n    if (!Sk.builtin.checkIterable(iterable)) {\r\n        throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(iterable) + \"' object is not iterable\");\r\n    }\r\n    ctor = function () {\r\n        return [];\r\n    };\r\n    add = function (iter, item) {\r\n        iter.push(item);\r\n        return iter;\r\n    };\r\n    ret = function (iter) {\r\n        return new Sk.builtin.list(iter);\r\n    };\r\n\r\n    if (iterable.ob$type === Sk.builtin.str) {\r\n        ctor = function () {\r\n            return new Sk.builtin.str(\"\");\r\n        };\r\n        add = function (iter, item) {\r\n            return iter.sq$concat(item);\r\n        };\r\n        ret = function (iter) {\r\n            return iter;\r\n        };\r\n    } else if (iterable.ob$type === Sk.builtin.tuple) {\r\n        ret = function (iter) {\r\n            return new Sk.builtin.tuple(iter);\r\n        };\r\n    }\r\n\r\n    retval = ctor();\r\n\r\n    for (iter = Sk.abstr.iter(iterable), item = iter.tp$iternext(); item !== undefined; item = iter.tp$iternext()) {\r\n        if (fun === Sk.builtin.none.none$) {\r\n            result = new Sk.builtin.bool(item);\r\n        } else {\r\n            result = Sk.misceval.callsimArray(fun, [item]);\r\n        }\r\n\r\n        if (Sk.misceval.isTrue(result)) {\r\n            retval = add(retval, item);\r\n        }\r\n    }\r\n\r\n    return ret(retval);\r\n};\r\n\r\nSk.builtin.hasattr = function hasattr(obj, pyName) {\r\n    if (!Sk.builtin.checkString(pyName)) {\r\n        throw new Sk.builtin.TypeError(\"hasattr(): attribute name must be string\");\r\n    }\r\n    const res = Sk.misceval.tryCatch(\r\n        () => obj.tp$getattr(pyName, true),\r\n        (e) => {\r\n            if (e instanceof Sk.builtin.AttributeError) {\r\n                return undefined;\r\n            } else {\r\n                throw e;\r\n            }\r\n        }\r\n    );\r\n    return Sk.misceval.chain(res, (val) => (val === undefined ? Sk.builtin.bool.false$ : Sk.builtin.bool.true$));\r\n};\r\n\r\nSk.builtin.pow = function pow(v, w, z) {\r\n    // skulpt does support ternary slots\r\n    if (z === undefined || Sk.builtin.checkNone(z)) {\r\n        return Sk.abstr.numberBinOp(v, w, \"Pow\");\r\n    }\r\n    // only support a third argument if they're all the integers.\r\n    if (!(Sk.builtin.checkInt(v) && Sk.builtin.checkInt(w) && Sk.builtin.checkInt(z))) {\r\n        if (Sk.builtin.checkFloat(v) || Sk.builtin.checkComplex(v)) {\r\n            return v.nb$power(w, z); // these slots for float and complex throw the correct errors\r\n        }\r\n        throw new Sk.builtin.TypeError(\r\n            \"unsupported operand type(s) for ** or pow(): '\" + Sk.abstr.typeName(v) + \"', '\" + Sk.abstr.typeName(w) + \"', '\" + Sk.abstr.typeName(z) + \"'\"\r\n        );\r\n    }\r\n    return v.nb$power(w, z);\r\n};\r\n\r\nSk.builtin.quit = function quit(msg) {\r\n    var s = new Sk.builtin.str(msg).v;\r\n    throw new Sk.builtin.SystemExit(s);\r\n};\r\n\r\nSk.builtin.issubclass = function issubclass(c1, c2) {\r\n    if (!Sk.builtin.checkClass(c1)) {\r\n        throw new Sk.builtin.TypeError(\"issubclass() arg 1 must be a class\");\r\n    }\r\n    let c2_isClass = Sk.builtin.checkClass(c2);\r\n    if (!c2_isClass && !(c2 instanceof Sk.builtin.tuple)) {\r\n        throw new Sk.builtin.TypeError(\"issubclass() arg 2 must be a class or tuple of classes\");\r\n    }\r\n    if (c2_isClass) {\r\n        return c1.$isSubType(c2) ? Sk.builtin.bool.true$ : Sk.builtin.bool.false$;\r\n    }\r\n    // Handle tuple type argument\r\n    for (let i = 0; i < c2.v.length; ++i) {\r\n        if (Sk.misceval.isTrue(Sk.builtin.issubclass(c1, c2.v[i]))) {\r\n            return Sk.builtin.bool.true$;\r\n        }\r\n    }\r\n    return Sk.builtin.bool.false$;\r\n};\r\n\r\nSk.builtin.globals = function globals() {\r\n    var i, unmangled;\r\n    var ret = new Sk.builtin.dict([]);\r\n    for (i in Sk[\"globals\"]) {\r\n        unmangled = Sk.unfixReserved(i);\r\n        ret.mp$ass_subscript(new Sk.builtin.str(unmangled), Sk[\"globals\"][i]);\r\n    }\r\n\r\n    return ret;\r\n};\r\n\r\nSk.builtin.divmod = function divmod(a, b) {\r\n    return Sk.abstr.numberBinOp(a, b, \"DivMod\");\r\n};\r\n\r\n/**\r\n * Convert a value to a “formatted” representation, as controlled by format_spec. The interpretation of format_spec\r\n * will depend on the type of the value argument, however there is a standard formatting syntax that is used by most\r\n * built-in types: Format Specification Mini-Language.\r\n */\r\nSk.builtin.format = function format(value, format_spec) {\r\n    return Sk.abstr.objectFormat(value, format_spec);\r\n};\r\n\r\nconst idMap = new Map();\r\nlet _id = 0;\r\nSk.builtin.id = function (obj) {\r\n    const id = idMap.get(obj);\r\n    if (id !== undefined) {\r\n        return new Sk.builtin.int_(id);\r\n    }\r\n    idMap.set(obj, _id);\r\n    return new Sk.builtin.int_(_id++);\r\n};\r\n\r\nSk.builtin.bytearray = function bytearray() {\r\n    throw new Sk.builtin.NotImplementedError(\"bytearray is not yet implemented\");\r\n};\r\n\r\nSk.builtin.callable = function callable(obj) {\r\n    // check num of args\r\n\r\n    if (Sk.builtin.checkCallable(obj)) {\r\n        return Sk.builtin.bool.true$;\r\n    }\r\n    return Sk.builtin.bool.false$;\r\n};\r\n\r\nSk.builtin.delattr = function delattr(obj, attr) {\r\n    return Sk.builtin.setattr(obj, attr, undefined);\r\n};\r\n\r\nSk.builtin.execfile = function execfile() {\r\n    throw new Sk.builtin.NotImplementedError(\"execfile is not yet implemented\");\r\n};\r\n\r\n\r\nvar extractDict = function (obj) {\r\n    var ret = {};\r\n    var k, v, kAsJs, iter;\r\n    if (obj === undefined) {\r\n        return ret;\r\n    }\r\n    for (iter = obj.tp$iter(), k = iter.tp$iternext(); k !== undefined; k = iter.tp$iternext()) {\r\n        v = obj.mp$subscript(k);\r\n        if (v === undefined) {\r\n            v = null;\r\n        }\r\n        kAsJs = Sk.ffi.remapToJs(k);\r\n        // todo; assert that this is a reasonble lhs?\r\n        ret[Sk.fixReserved(kAsJs)] = v;\r\n    }\r\n    return ret;\r\n};\r\n\r\nvar mergeDict = function(obj1, obj2) {\r\n    var k, v, kAsJs, iter;\r\n    if (obj2 === undefined) {\r\n        return obj1;\r\n    }\r\n    for (iter = obj2.tp$iter(), k = iter.tp$iternext(); k !== undefined; k = iter.tp$iternext()) {\r\n        v = obj2.mp$subscript(k);\r\n        if (v === undefined) {\r\n            v = null;\r\n        }\r\n        kAsJs = Sk.ffi.remapToJs(k);\r\n        // todo; assert that this is a reasonble lhs?\r\n        obj1[Sk.fixReserved(kAsJs)] = v;\r\n    }\r\n    return obj1;\r\n};\r\n\r\nSk.builtin.exec = function exec(code, globals, locals) {\r\n    Sk.builtin.pyCheckArgs(\"exec\", arguments, 1, 3);\r\n\r\n    let filename = globals && globals.__file__;\r\n    if (filename !== undefined && Sk.builtin.checkString(filename)) {\r\n        filename = filename.toString();\r\n    } else if (code instanceof pyCode) {\r\n        filename = code.filename;\r\n    } else {\r\n        filename = \"<string>\";\r\n    }\r\n\r\n    if (Sk.builtin.checkString(code)) {\r\n        code = Sk.compile(code.$jsstr(), filename, \"exec\", true, true);\r\n    } else if (typeof code === \"string\") {\r\n        code = Sk.compile(code, filename, \"exec\", true, true);\r\n    } else if (!(code instanceof pyCode)) {\r\n        throw new Sk.builtin.TypeError(\"exec() arg 1 must be a string, bytes or code object\");\r\n    }\r\n\r\n    Sk.asserts.assert(\r\n        globals === undefined || globals.constructor === Object,\r\n        \"internal calls to exec should be called with a javascript object for globals\"\r\n    );\r\n    Sk.asserts.assert(\r\n        locals === undefined || locals.constructor === Object,\r\n        \"internal calls to exec should be called with a javascript object for locals\"\r\n    );\r\n\r\n    let backupGlobals, backupRG, caughtError;\r\n    return Sk.misceval.chain(\r\n        code,\r\n        (co) => {\r\n            if (!Sk.sysmodules.sq$contains(Sk.builtin.str.$sys)) {\r\n                Sk.importModule(\"sys\", false, true);\r\n            }\r\n            return co;\r\n        },\r\n        (co) => {\r\n            // Backup the \"retainGlobals\" flag\r\n            backupRG = Sk.retainGlobals;\r\n            // Make sure we remember the globals before we do anything\r\n            Sk.retainGlobals = true;\r\n            // Create a dictionary to hold the new temporary globals\r\n            //globalsCopy = extractDict(globals);\r\n            // Ensure certain defaults are available\r\n            if (!globals.__file__) {\r\n                globals.__file__ = Sk.ffi.remapToPy(filename);\r\n            }\r\n            if (!globals.__name__) {\r\n                globals.__name__ = Sk.ffi.remapToPy(filename);\r\n            }\r\n            if (!globals.__package__) {\r\n                globals.__package__ = Sk.builtin.none.none$;\r\n            }\r\n            // Swap the real globals for our freshly copied temporary globals\r\n            backupGlobals = Sk.globals;\r\n            Sk.globals = globals;\r\n            // Set up some error catching\r\n            caughtError = null;\r\n            // Guard against exceptions so we can recover gracefully\r\n            return Sk.misceval.tryCatch(() => {\r\n                let result = Sk.global[\"eval\"](co.code)(globals, locals);\r\n                // Ensure it terminates\r\n                while (result instanceof Sk.misceval.Suspension) {\r\n                    result = result.resume();\r\n                }\r\n                return result;\r\n            }, (e) => {\r\n                console.error(\"exec error:\", e, locals, globals);\r\n                caughtError = e;\r\n            });\r\n        },\r\n        (new_locals) => {\r\n            // Restore the Original globals\r\n            Sk.globals = backupGlobals;\r\n            // Copy over the temporary globals' data to the original globals we were given\r\n            /*for (let key in globalsCopy) {\r\n                if (globalsCopy.hasOwnProperty(key)) {\r\n                    const pykey = Sk.ffi.remapToPy(Sk.unfixReserved(key));\r\n                    Sk.builtin.dict.prototype.mp$ass_subscript.call(globals, pykey, globals[key]);\r\n                }\r\n            }*/\r\n            // And restore the retainGlobals flag\r\n            Sk.retainGlobals = backupRG;\r\n            // Throw any errors at this point in time\r\n            if (caughtError !== null) {\r\n                throw caughtError;\r\n            }\r\n            // Return new_locals internally for eval\r\n            return new_locals;\r\n        }\r\n    );\r\n};\r\n\r\nSk.builtin.help = function help() {\r\n    throw new Sk.builtin.NotImplementedError(\"help is not yet implemented\");\r\n};\r\n\r\nSk.builtin.iter = function iter(obj, sentinel) {\r\n    if (arguments.length === 1) {\r\n        return Sk.abstr.iter(obj);\r\n    } else {\r\n        return Sk.abstr.iter(new Sk.builtin.callable_iter_(obj, sentinel));\r\n    }\r\n};\r\n\r\nSk.builtin.locals = function locals() {\r\n    throw new Sk.builtin.NotImplementedError(\"locals is not yet implemented\");\r\n};\r\nSk.builtin.memoryview = function memoryview() {\r\n    throw new Sk.builtin.NotImplementedError(\"memoryview is not yet implemented\");\r\n};\r\n\r\nSk.builtin.next_ = function next_(iter, default_) {\r\n    if (!iter.tp$iternext) {\r\n        throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(iter) + \"' object is not an iterator\");\r\n    }\r\n    return Sk.misceval.chain(iter.tp$iternext(true), (nxt) => {\r\n        if (nxt === undefined) {\r\n            if (default_) {\r\n                return default_;\r\n            }\r\n            const v = iter.gi$ret;\r\n            // gi$ret is the original value that was thrown by the StopIteration\r\n            // (or returned by a generator)\r\n            // We've now lost the original StopIteration\r\n            // We make the assumption that it was probably called like\r\n            // raise StopIteration # or  StopIteration()\r\n            // rather than\r\n            // raise StopIteration(None)\r\n            if (v !== undefined && v !== Sk.builtin.none.none$) {\r\n                throw new Sk.builtin.StopIteration(v);\r\n            } else {\r\n                throw new Sk.builtin.StopIteration();\r\n            }\r\n        }\r\n        return nxt;\r\n    });\r\n};\r\n\r\nSk.builtin.reload = function reload() {\r\n    throw new Sk.builtin.NotImplementedError(\"reload is not yet implemented\");\r\n};\r\nSk.builtin.vars = function vars(obj) {\r\n    if (arguments.length === 1) {\r\n        if (obj.$d) {\r\n            return obj.$d;\r\n        } else {\r\n            throw new Sk.builtin.TypeError(\"vars() argument must have __dict__ attribute\");\r\n        }\r\n    } else {\r\n        throw new Sk.builtin.NotImplementedError(\"vars() is not yet implemented\");\r\n    }\r\n};\r\n\r\nSk.builtin.apply_ = function apply_() {\r\n    throw new Sk.builtin.NotImplementedError(\"apply is not yet implemented\");\r\n};\r\nSk.builtin.buffer = function buffer_() {\r\n    throw new Sk.builtin.NotImplementedError(\"buffer is not yet implemented\");\r\n};\r\nSk.builtin.coerce = function coerce() {\r\n    throw new Sk.builtin.NotImplementedError(\"coerce is not yet implemented\");\r\n};\r\nSk.builtin.intern = function intern() {\r\n    throw new Sk.builtin.NotImplementedError(\"intern is not yet implemented\");\r\n};\r\n\r\n/*\r\n Sk.builtinFiles = {};\r\n Sk.builtin.read = function read(x) {\r\n if (Sk.builtinFiles === undefined || Sk.builtinFiles[\"files\"][x] === undefined)\r\n throw \"File not found: '\" + x + \"'\";\r\n return Sk.builtinFiles[\"files\"][x];\r\n };\r\n Sk.builtinFiles = undefined;\r\n */\r\n","// Note: the hacky names on int, long, float have to correspond with the\r\n// uniquization that the compiler does for words that are reserved in\r\n// Javascript. This is a bit hokey.\r\n\r\nSk.builtins = {\r\n    \"round\": null,\r\n    \"len\": null,\r\n    \"min\": null,\r\n    \"max\": null,\r\n    \"sum\": null,\r\n    \"abs\": null,\r\n    \"fabs\": null,\r\n    \"ord\": null,\r\n    \"chr\": null,\r\n    \"hex\": null,\r\n    \"oct\": null,\r\n    \"bin\": null,\r\n    \"dir\": null,\r\n    \"repr\": null,\r\n    \"open\": null,\r\n    \"isinstance\": null,\r\n    \"hash\": null,\r\n    \"getattr\": null,\r\n    \"hasattr\": null,\r\n    \"id\": null,\r\n\r\n    //\"reduce\": new Sk.builtin.func(Sk.builtin.reduce),\r\n    \"sorted\": null,\r\n    \"any\": null,\r\n    \"all\": null,\r\n\r\n    // iterator objects if py2 mode we replace these with sk_methods\r\n    \"enumerate\": Sk.builtin.enumerate,\r\n    \"filter\": Sk.builtin.filter_,\r\n    \"map\": Sk.builtin.map_,\r\n    \"range\": Sk.builtin.range_,\r\n    \"reversed\": Sk.builtin.reversed,\r\n    \"zip\": Sk.builtin.zip_,\r\n\r\n    \"BaseException\": Sk.builtin.BaseException,\r\n    \"AttributeError\": Sk.builtin.AttributeError,\r\n    \"ValueError\": Sk.builtin.ValueError,\r\n    \"Exception\": Sk.builtin.Exception,\r\n    \"ZeroDivisionError\": Sk.builtin.ZeroDivisionError,\r\n    \"AssertionError\": Sk.builtin.AssertionError,\r\n    \"ImportError\": Sk.builtin.ImportError,\r\n    \"IndentationError\": Sk.builtin.IndentationError,\r\n    \"IndexError\": Sk.builtin.IndexError,\r\n    \"LookupError\"        : Sk.builtin.LookupError,\r\n    \"KeyError\": Sk.builtin.KeyError,\r\n    \"TypeError\": Sk.builtin.TypeError,\r\n    \"UnicodeDecodeError\" : Sk.builtin.UnicodeDecodeError,\r\n    \"UnicodeEncodeError\" : Sk.builtin.UnicodeEncodeError,\r\n    \"NameError\": Sk.builtin.NameError,\r\n    \"UnboundLocalError\"  : Sk.builtin.UnboundLocalError,\r\n    \"OSError\": Sk.builtin.OSError,\r\n    \"TimeoutError\": Sk.builtin.TimeoutError,\r\n    \"IOError\": Sk.builtin.IOError,\r\n    \"NotImplementedError\": Sk.builtin.NotImplementedError,\r\n    \"SystemExit\": Sk.builtin.SystemExit,\r\n    \"OverflowError\": Sk.builtin.OverflowError,\r\n    \"OperationError\": Sk.builtin.OperationError,\r\n    \"NegativePowerError\": Sk.builtin.NegativePowerError,\r\n    \"RuntimeError\": Sk.builtin.RuntimeError,\r\n\t\"RecursionError\": Sk.builtin.RecursionError,\r\n    \"StopIteration\": Sk.builtin.StopIteration,\r\n    \"SyntaxError\": Sk.builtin.SyntaxError,\r\n    \"SystemError\"        : Sk.builtin.SystemError,\r\n    \"KeyboardInterrupt\"  : Sk.builtin.KeyboardInterrupt,\r\n    \"EOFError\": Sk.builtin.EOFError,\r\n    \"MemoryError\": Sk.builtin.MemoryError,\r\n    \"ReferenceError\": Sk.builtin.ReferenceError,\r\n\r\n    \"float_$rw$\": Sk.builtin.float_,\r\n    \"int_$rw$\": Sk.builtin.int_,\r\n    \"bool\": Sk.builtin.bool,\r\n    \"complex\": Sk.builtin.complex,\r\n    \"dict\": Sk.builtin.dict,\r\n    \"file\": Sk.builtin.file,\r\n    \"frozenset\": Sk.builtin.frozenset,\r\n    \"function\": Sk.builtin.func,\r\n    \"generator\": Sk.builtin.generator,\r\n    \"list\": Sk.builtin.list,\r\n    \"long_$rw$\": Sk.builtin.lng,\r\n    \"method\": Sk.builtin.method,\r\n    \"object\": Sk.builtin.object,\r\n    \"slice\": Sk.builtin.slice,\r\n    \"str\": Sk.builtin.str,\r\n    \"set\": Sk.builtin.set,\r\n    \"tuple\": Sk.builtin.tuple,\r\n    \"type\": Sk.builtin.type,\r\n\r\n    \"input\": null,\r\n    \"raw_input\": new Sk.builtin.func(Sk.builtin.raw_input),\r\n    \"setattr\": null,\r\n    /*'read': Sk.builtin.read,*/\r\n    \"jseval\": Sk.builtin.jseval,\r\n    \"jsmillis\": Sk.builtin.jsmillis,\r\n    \"quit\": new Sk.builtin.func(Sk.builtin.quit),\r\n    \"exit\": new Sk.builtin.func(Sk.builtin.quit),\r\n    \"print\": null,\r\n    \"divmod\": null,\r\n    \"format\": null,\r\n    \"globals\": null,\r\n    \"issubclass\": null,\r\n    \"iter\": null,\r\n\r\n    // Functions below are not implemented\r\n    // \"bytearray\" : Sk.builtin.bytearray,\r\n    // \"callable\"  : Sk.builtin.callable,\r\n    // \"delattr\"   : Sk.builtin.delattr,\r\n    // \"eval_$rw$\" : Sk.builtin.eval_,\r\n    \"execfile\": Sk.builtin.execfile,\r\n    \"exec\": Sk.builtin.exec,\r\n    \"compile\": Sk.builtin.compile,\r\n\r\n    \"help\": Sk.builtin.help,\r\n    // \"locals\"    : Sk.builtin.locals,\r\n    \"memoryview\": Sk.builtin.memoryview,\r\n    // \"next\"      : Sk.builtin.next_,\r\n    // \"pow\"       : Sk.builtin.pow,\r\n    \"reload\": Sk.builtin.reload,\r\n    \"super_$rw$\": Sk.builtin.super_,\r\n    \"unichr\"    : new Sk.builtin.func(Sk.builtin.unichr),\r\n    \"vars\": Sk.builtin.vars,\r\n    \"apply_$rw$\": Sk.builtin.apply_,\r\n    \"buffer\": Sk.builtin.buffer,\r\n    \"coerce\": Sk.builtin.coerce,\r\n    \"intern\": Sk.builtin.intern,\r\n\r\n\r\n    \"property\": Sk.builtin.property,\r\n    \"classmethod\": Sk.builtin.classmethod,\r\n    \"staticmethod\": Sk.builtin.staticmethod,\r\n\r\n    \"Ellipsis\": Sk.builtin.Ellipsis\r\n};\r\n\r\nconst pyNone = Sk.builtin.none.none$;\r\nconst emptyTuple = new Sk.builtin.tuple();\r\nconst pyZero = new Sk.builtin.int_(0);\r\n\r\n\r\nSk.abstr.setUpModuleMethods(\"builtins\", Sk.builtins, {\r\n    // __build_class__: {\r\n    //     $meth: Sk.builtin.__build_class__,\r\n    //     $flags: {},\r\n    //     $textsig: null,\r\n    //     $doc: \"__build_class__(func, name, *bases, metaclass=None, **kwds) -> class\\n\\nInternal helper function used by the class statement.\"\r\n    // },\r\n\r\n    __import__: {\r\n        $meth(name, globals, _locals, formlist, level) {\r\n            if (!Sk.builtin.checkString(name)) {\r\n                throw new Sk.builtin.TypeError(\"__import__() argument 1 must be str, not \" + name.tp$name);\r\n            } else if (name === Sk.builtin.str.$empty && level.v === 0) {\r\n                throw new Sk.builtin.ValueError(\"Empty module name\");\r\n            }\r\n            // check globals - locals is just ignored __import__\r\n            globals = globLocToJs(globals, \"globals\") || {};\r\n            formlist = Sk.ffi.remapToJs(formlist);\r\n            level = Sk.ffi.remapToJs(level);\r\n\r\n            return Sk.builtin.__import__(name, globals, undefined, formlist, level);\r\n        },\r\n        $flags: {\r\n            NamedArgs: [\"name\", \"globals\", \"locals\", \"fromlist\", \"level\"],\r\n            Defaults: [pyNone, pyNone, emptyTuple, pyZero],\r\n        },\r\n        $textsig: null,\r\n        $doc: \"__import__(name, globals=None, locals=None, fromlist=(), level=0) -> module\\n\\nImport a module. Because this function is meant for use by the Python\\ninterpreter and not for general use, it is better to use\\nimportlib.import_module() to programmatically import a module.\\n\\nThe globals argument is only used to determine the context;\\nthey are not modified.  The locals argument is unused.  The fromlist\\nshould be a list of names to emulate ``from name import ...'', or an\\nempty list to emulate ``import name''.\\nWhen importing a module from a package, note that __import__('A.B', ...)\\nreturns package A when fromlist is empty, but its submodule B when\\nfromlist is not empty.  The level argument is used to determine whether to\\nperform absolute or relative imports: 0 is absolute, while a positive number\\nis the number of parent directories to search relative to the current module.\",\r\n    },\r\n\r\n    abs: {\r\n        $meth: Sk.builtin.abs,\r\n        $flags: {OneArg: true},\r\n        $textsig: \"($module, x, /)\",\r\n        $doc: \"Return the absolute value of the argument.\",\r\n    },\r\n\r\n    all: {\r\n        $meth: Sk.builtin.all,\r\n        $flags: {OneArg: true},\r\n        $textsig: \"($module, iterable, /)\",\r\n        $doc: \"Return True if bool(x) is True for all values x in the iterable.\\n\\nIf the iterable is empty, return True.\",\r\n    },\r\n\r\n    any: {\r\n        $meth: Sk.builtin.any,\r\n        $flags: {OneArg: true},\r\n        $textsig: \"($module, iterable, /)\",\r\n        $doc: \"Return True if bool(x) is True for any x in the iterable.\\n\\nIf the iterable is empty, return False.\",\r\n    },\r\n\r\n    ascii: {\r\n        $meth: Sk.builtin.ascii,\r\n        $flags: {OneArg: true},\r\n        $textsig: \"($module, obj, /)\",\r\n        $doc: \"Return an ASCII-only representation of an object.\\n\\nAs repr(), return a string containing a printable representation of an\\nobject, but escape the non-ASCII characters in the string returned by\\nrepr() using \\\\\\\\x, \\\\\\\\u or \\\\\\\\U escapes. This generates a string similar\\nto that returned by repr() in Python 2.\"\r\n    },\r\n\r\n    bin: {\r\n        $meth: Sk.builtin.bin,\r\n        $flags: {OneArg: true},\r\n        $textsig: \"($module, number, /)\",\r\n        $doc: \"Return the binary representation of an integer.\\n\\n   >>> bin(2796202)\\n   '0b1010101010101010101010'\",\r\n    },\r\n\r\n    // breakpoint: {\r\n    //     $meth: Sk.builtin.breakpoint,\r\n    //     $flags: {},\r\n    //     $textsig: null,\r\n    //     $doc: \"breakpoint(*args, **kws)\\n\\nCall sys.breakpointhook(*args, **kws).  sys.breakpointhook() must accept\\nwhatever arguments are passed.\\n\\nBy default, this drops you into the pdb debugger.\"\r\n    // },\r\n\r\n    callable: {\r\n        $meth: Sk.builtin.callable,\r\n        $flags: {OneArg: true},\r\n        $textsig: \"($module, obj, /)\",\r\n        $doc:\r\n            \"Return whether the object is callable (i.e., some kind of function).\\n\\nNote that classes are callable, as are instances of classes with a\\n__call__() method.\",\r\n    },\r\n\r\n    chr: {\r\n        $meth: Sk.builtin.chr,\r\n        $flags: {OneArg: true},\r\n        $textsig: \"($module, i, /)\",\r\n        $doc: \"Return a Unicode string of one character with ordinal i; 0 <= i <= 0x10ffff.\",\r\n    },\r\n\r\n    compile: {\r\n        $meth: Sk.builtin.compile,\r\n        $flags: {MinArgs: 3, MaxArgs:6},\r\n        $textsig: \"($module, /, source, filename, mode, flags=0,\\n        dont_inherit=False, optimize=-1)\",\r\n        $doc: \"Compile source into a code object that can be executed by exec() or eval().\\n\\nThe source code may represent a Python module, statement or expression.\\nThe filename will be used for run-time error messages.\\nThe mode must be 'exec' to compile a module, 'single' to compile a\\nsingle (interactive) statement, or 'eval' to compile an expression.\\nThe flags argument, if present, controls which future statements influence\\nthe compilation of the code.\\nThe dont_inherit argument, if true, stops the compilation inheriting\\nthe effects of any future statements in effect in the code calling\\ncompile; if absent or false these statements do influence the compilation,\\nin addition to any features explicitly specified.\"\r\n    },\r\n\r\n    delattr: {\r\n        $meth: Sk.builtin.delattr,\r\n        $flags: {MinArgs: 2, MaxArgs: 2},\r\n        $textsig: \"($module, obj, name, /)\",\r\n        $doc: \"Deletes the named attribute from the given object.\\n\\ndelattr(x, 'y') is equivalent to ``del x.y''\",\r\n    },\r\n\r\n    dir: {\r\n        $meth: Sk.builtin.dir,\r\n        $flags: {MinArgs: 0, MaxArgs: 1},\r\n        $textsig: null,\r\n        $doc:\r\n            \"dir([object]) -> list of strings\\n\\nIf called without an argument, return the names in the current scope.\\nElse, return an alphabetized list of names comprising (some of) the attributes\\nof the given object, and of attributes reachable from it.\\nIf the object supplies a method named __dir__, it will be used; otherwise\\nthe default dir() logic is used and returns:\\n  for a module object: the module's attributes.\\n  for a class object:  its attributes, and recursively the attributes\\n    of its bases.\\n  for any other object: its attributes, its class's attributes, and\\n    recursively the attributes of its class's base classes.\",\r\n    },\r\n\r\n    divmod: {\r\n        $meth: Sk.builtin.divmod,\r\n        $flags: {MinArgs: 2, MaxArgs: 2},\r\n        $textsig: \"($module, x, y, /)\",\r\n        $doc: \"Return the tuple (x//y, x%y).  Invariant: div*y + mod == x.\",\r\n    },\r\n\r\n    eval_$rw$: {\r\n        $name: \"eval\",\r\n        $meth: function (source, globals, locals) {\r\n            // check globals\r\n            const tmp_globals = globLocToJs(globals, \"globals\");\r\n            // check locals\r\n            const tmp_locals = globLocToJs(locals, \"locals\");\r\n            return Sk.misceval.chain(Sk.builtin.eval(source, tmp_globals, tmp_locals), (res) => {\r\n                reassignGlobLoc(globals, tmp_globals);\r\n                reassignGlobLoc(locals, tmp_locals);\r\n                return res;\r\n            });\r\n        },\r\n        $flags: {MinArgs: 1, MaxArgs: 3},\r\n        $textsig: \"($module, source, globals=None, locals=None, /)\",\r\n        $doc:\r\n            \"Evaluate the given source in the context of globals and locals.\\n\\nThe source may be a string representing a Python expression\\nor a code object as returned by compile().\\nThe globals must be a dictionary and locals can be any mapping,\\ndefaulting to the current globals and locals.\\nIf only globals is given, locals defaults to it.\",\r\n    },\r\n\r\n    exec: {\r\n        $meth: function (source, globals, locals) {\r\n            // check globals\r\n            const tmp_globals = globLocToJs(globals, \"globals\");\r\n            // check locals\r\n            const tmp_locals = globLocToJs(locals, \"locals\");\r\n            return Sk.misceval.chain(Sk.builtin.exec(source, tmp_globals, tmp_locals), (new_locals) => {\r\n                reassignGlobLoc(globals, tmp_globals);\r\n                reassignGlobLoc(locals, tmp_locals);\r\n                return Sk.builtin.none.none$;\r\n            });\r\n        },\r\n        $flags: {MinArgs:1, MaxArgs: 3},\r\n        $textsig: \"($module, source, globals=None, locals=None, /)\",\r\n        $doc:\r\n            \"Execute the given source in the context of globals and locals.\\n\\nThe source may be a string representing one or more Python statements\\nor a code object as returned by compile().\\nThe globals must be a dictionary and locals can be any mapping,\\ndefaulting to the current globals and locals.\\nIf only globals is given, locals defaults to it.\",\r\n    },\r\n\r\n    format: {\r\n        $meth: Sk.builtin.format,\r\n        $flags: {MinArgs: 1, MaxArgs: 2},\r\n        $textsig: \"($module, value, format_spec='', /)\",\r\n        $doc:\r\n            \"Return value.__format__(format_spec)\\n\\nformat_spec defaults to the empty string.\\nSee the Format Specification Mini-Language section of help('FORMATTING') for\\ndetails.\",\r\n    },\r\n\r\n    getattr: {\r\n        $meth: Sk.builtin.getattr,\r\n        $flags: {MinArgs: 2, MaxArgs: 3},\r\n        $textsig: null,\r\n        $doc:\r\n            \"getattr(object, name[, default]) -> value\\n\\nGet a named attribute from an object; getattr(x, 'y') is equivalent to x.y.\\nWhen a default argument is given, it is returned when the attribute doesn't\\nexist; without it, an exception is raised in that case.\",\r\n    },\r\n\r\n    globals: {\r\n        $meth: Sk.builtin.globals,\r\n        $flags: {NoArgs: true},\r\n        $textsig: \"($module, /)\",\r\n        $doc:\r\n            \"Return the dictionary containing the current scope's global variables.\\n\\nNOTE: Updates to this dictionary *will* affect name lookups in the current\\nglobal scope and vice-versa.\",\r\n    },\r\n\r\n    hasattr: {\r\n        $meth: Sk.builtin.hasattr,\r\n        $flags: {MinArgs: 2, MaxArgs: 2},\r\n        $textsig: \"($module, obj, name, /)\",\r\n        $doc:\r\n            \"Return whether the object has an attribute with the given name.\\n\\nThis is done by calling getattr(obj, name) and catching AttributeError.\",\r\n    },\r\n\r\n    hash: {\r\n        $meth: Sk.builtin.hash,\r\n        $flags: {OneArg: true},\r\n        $textsig: \"($module, obj, /)\",\r\n        $doc:\r\n            \"Return the hash value for the given object.\\n\\nTwo objects that compare equal must also have the same hash value, but the\\nreverse is not necessarily true.\",\r\n    },\r\n\r\n    hex: {\r\n        $meth: Sk.builtin.hex,\r\n        $flags: {OneArg: true},\r\n        $textsig: \"($module, number, /)\",\r\n        $doc: \"Return the hexadecimal representation of an integer.\\n\\n   >>> hex(12648430)\\n   '0xc0ffee'\",\r\n    },\r\n\r\n    id: {\r\n        $meth: Sk.builtin.id,\r\n        $flags: {OneArg: true},\r\n        $textsig: \"($module, obj, /)\",\r\n        $doc:\r\n            \"Return the identity of an object.\\n\\nThis is guaranteed to be unique among simultaneously existing objects.\\n(CPython uses the object's memory address.)\",\r\n    },\r\n\r\n    input: {\r\n        $meth: Sk.builtin.input,\r\n        $flags: {MinArgs: 0, MaxArgs: 1},\r\n        $textsig: \"($module, prompt=None, /)\",\r\n        $doc:\r\n            \"Read a string from standard input.  The trailing newline is stripped.\\n\\nThe prompt string, if given, is printed to standard output without a\\ntrailing newline before reading input.\\n\\nIf the user hits EOF (*nix: Ctrl-D, Windows: Ctrl-Z+Return), raise EOFError.\\nOn *nix systems, readline is used if available.\",\r\n    },\r\n\r\n    isinstance: {\r\n        $meth: Sk.builtin.isinstance,\r\n        $flags: {MinArgs: 2, MaxArgs: 2},\r\n        $textsig: \"($module, obj, class_or_tuple, /)\",\r\n        $doc:\r\n            \"Return whether an object is an instance of a class or of a subclass thereof.\\n\\nA tuple, as in ``isinstance(x, (A, B, ...))``, may be given as the target to\\ncheck against. This is equivalent to ``isinstance(x, A) or isinstance(x, B)\\nor ...`` etc.\",\r\n    },\r\n\r\n    issubclass: {\r\n        $meth: Sk.builtin.issubclass,\r\n        $flags: {MinArgs: 2, MaxArgs: 2},\r\n        $textsig: \"($module, cls, class_or_tuple, /)\",\r\n        $doc:\r\n            \"Return whether 'cls' is a derived from another class or is the same class.\\n\\nA tuple, as in ``issubclass(x, (A, B, ...))``, may be given as the target to\\ncheck against. This is equivalent to ``issubclass(x, A) or issubclass(x, B)\\nor ...`` etc.\",\r\n    },\r\n\r\n    iter: {\r\n        $meth: Sk.builtin.iter,\r\n        $flags: {MinArgs: 1, MaxArgs: 2},\r\n        $textsig: \"($module, iterable /)\",\r\n        $doc:\r\n            \"iter(iterable) -> iterator\\niter(callable, sentinel) -> iterator\\n\\nGet an iterator from an object.  In the first form, the argument must\\nsupply its own iterator, or be a sequence.\\nIn the second form, the callable is called until it returns the sentinel.\",\r\n    },\r\n\r\n    len: {\r\n        $meth: Sk.builtin.len,\r\n        $flags: {OneArg: true},\r\n        $textsig: \"($module, obj, /)\",\r\n        $doc: \"Return the number of items in a container.\",\r\n    },\r\n\r\n    locals: {\r\n        $meth: Sk.builtin.locals,\r\n        $flags: {NoArgs: true},\r\n        $textsig: \"($module, /)\",\r\n        $doc:\r\n            \"Return a dictionary containing the current scope's local variables.\\n\\nNOTE: Whether or not updates to this dictionary will affect name lookups in\\nthe local scope and vice-versa is *implementation dependent* and not\\ncovered by any backwards compatibility guarantees.\",\r\n    },\r\n\r\n    max: {\r\n        $meth: Sk.builtin.max,\r\n        $flags: {FastCall: true},\r\n        $textsig: null,\r\n        $doc:\r\n            \"max(iterable, *[, default=obj, key=func]) -> value\\nmax(arg1, arg2, *args, *[, key=func]) -> value\\n\\nWith a single iterable argument, return its biggest item. The\\ndefault keyword-only argument specifies an object to return if\\nthe provided iterable is empty.\\nWith two or more arguments, return the largest argument.\",\r\n    },\r\n\r\n    min: {\r\n        $meth: Sk.builtin.min,\r\n        $flags: {FastCall: true},\r\n        $textsig: null,\r\n        $doc:\r\n            \"min(iterable, *[, default=obj, key=func]) -> value\\nmin(arg1, arg2, *args, *[, key=func]) -> value\\n\\nWith a single iterable argument, return its smallest item. The\\ndefault keyword-only argument specifies an object to return if\\nthe provided iterable is empty.\\nWith two or more arguments, return the smallest argument.\",\r\n    },\r\n\r\n    next: {\r\n        $name: \"next\",\r\n        $meth: Sk.builtin.next_,\r\n        $flags: {MinArgs: 1, MaxArgs: 2},\r\n        $textsig: null,\r\n        $doc:\r\n            \"next(iterator[, default])\\n\\nReturn the next item from the iterator. If default is given and the iterator\\nis exhausted, it is returned instead of raising StopIteration.\",\r\n    },\r\n\r\n    oct: {\r\n        $meth: Sk.builtin.oct,\r\n        $flags: {OneArg: true},\r\n        $textsig: \"($module, number, /)\",\r\n        $doc: \"Return the octal representation of an integer.\\n\\n   >>> oct(342391)\\n   '0o1234567'\",\r\n    },\r\n\r\n    open: {\r\n        $meth: Sk.builtin.open,\r\n        $flags: {\r\n            MinArgs: 1,\r\n            MaxArgs: 3,\r\n            //NamedArgs: [\"file, mode, buffering, encoding, errors, newline, closefd, opener\"],\r\n            //Defaults: [new Sk.builtin.str(\"r\"), new Sk.builtin.int_(-1), Sk.builtin.none.none$, Sk.builtin.none.none$, Sk.builtin.none.none$, Sk.builtin.bool.true$, Sk.builtin.none.none$]\r\n        },\r\n        $textsig: null,\r\n        // $textsig: \"($module, /, file, mode='r', buffering=-1, encoding=None,\\n     errors=None, newline=None, closefd=True, opener=None)\",\r\n        // this is the python 2 documentation since we don't support the py3 version\r\n        $doc:\r\n            \"open(name[, mode[, buffering]]) -> file object\\n\\nOpen a file using the file() type, returns a file object.  This is the\\npreferred way to open a file.  See file.__doc__ for further information.\",\r\n    },\r\n\r\n    ord: {\r\n        $meth: Sk.builtin.ord,\r\n        $flags: {OneArg: true},\r\n        $textsig: \"($module, c, /)\",\r\n        $doc: \"Return the Unicode code point for a one-character string.\",\r\n    },\r\n\r\n    pow: {\r\n        $meth: Sk.builtin.pow,\r\n        $flags: {MinArgs: 2, MaxArgs: 3},\r\n        $textsig: \"($module, x, y, z=None, /)\",\r\n        $doc:\r\n            \"Equivalent to x**y (with two arguments) or x**y % z (with three arguments)\\n\\nSome types, such as ints, are able to use a more efficient algorithm when\\ninvoked using the three argument form.\",\r\n    },\r\n\r\n    print: {\r\n        $meth: Sk.builtin.print,\r\n        $flags: {FastCall: true},\r\n        $textsig: null,\r\n        $doc:\r\n            \"print(value, ..., sep=' ', end='\\\\n', file=sys.stdout, flush=False)\\n\\nPrints the values to a stream, or to sys.stdout by default.\\nOptional keyword arguments:\\nfile:  a file-like object (stream); defaults to the current sys.stdout.\\nsep:   string inserted between values, default a space.\\nend:   string appended after the last value, default a newline.\\nflush: whether to forcibly flush the stream.\",\r\n    },\r\n\r\n    repr: {\r\n        $meth: Sk.builtin.repr,\r\n        $flags: {OneArg: true},\r\n        $textsig: \"($module, obj, /)\",\r\n        $doc: \"Return the canonical string representation of the object.\\n\\nFor many object types, including most builtins, eval(repr(obj)) == obj.\",\r\n    },\r\n\r\n    round: {\r\n        $meth: Sk.builtin.round,\r\n        $flags: {\r\n            NamedArgs: [\"number\", \"ndigits\"],\r\n        },\r\n        $textsig: \"($module, /, number, ndigits=None)\",\r\n        $doc:\r\n            \"Round a number to a given precision in decimal digits.\\n\\nThe return value is an integer if ndigits is omitted or None.  Otherwise\\nthe return value has the same type as the number.  ndigits may be negative.\",\r\n    },\r\n\r\n    setattr: {\r\n        $meth: Sk.builtin.setattr,\r\n        $flags: {MinArgs: 3, MaxArgs: 3},\r\n        $textsig: \"($module, obj, name, value, /)\",\r\n        $doc: \"Sets the named attribute on the given object to the specified value.\\n\\nsetattr(x, 'y', v) is equivalent to ``x.y = v''\",\r\n    },\r\n\r\n    sorted: {\r\n        $meth: Sk.builtin.sorted,\r\n        $flags: {\r\n            NamedArgs: [null, \"cmp\", \"key\", \"reverse\"],\r\n            Defaults: [Sk.builtin.none.none$, Sk.builtin.none.none$, Sk.builtin.bool.false$],\r\n        }, // should be fast call leave for now\r\n        $textsig: \"($module, iterable, /, *, key=None, reverse=False)\",\r\n        $doc:\r\n            \"Return a new list containing all items from the iterable in ascending order.\\n\\nA custom key function can be supplied to customize the sort order, and the\\nreverse flag can be set to request the result in descending order.\",\r\n    },\r\n\r\n    sum: {\r\n        $meth: Sk.builtin.sum,\r\n        $flags: {\r\n            NamedArgs: [null, \"start\"],\r\n            Defaults: [new Sk.builtin.int_(0)],\r\n        },\r\n        $textsig: \"($module, iterable, /, start=0)\", //changed in python 3.8 start\r\n        $doc:\r\n            \"Return the sum of a 'start' value (default: 0) plus an iterable of numbers\\n\\nWhen the iterable is empty, return the start value.\\nThis function is intended specifically for use with numeric values and may\\nreject non-numeric types.\",\r\n    },\r\n\r\n    vars: {\r\n        $meth: Sk.builtin.vars,\r\n        $flags: {MinArgs: 0, MaxArgs: 1},\r\n        $textsig: null,\r\n        $doc: \"vars([object]) -> dictionary\\n\\nWithout arguments, equivalent to locals().\\nWith an argument, equivalent to object.__dict__.\",\r\n    },\r\n});\r\n\r\n// function used for exec and eval\r\nfunction globLocToJs(glob_loc, name) {\r\n    let tmp = undefined;\r\n    if (glob_loc === undefined || Sk.builtin.checkNone(glob_loc)) {\r\n        glob_loc = undefined;\r\n    } else if (!(glob_loc instanceof Sk.builtin.dict)) {\r\n        throw new Sk.builtin.TypeError(name + \" must be a dict or None, not \" + Sk.abstr.typeName(glob_loc));\r\n    } else {\r\n        tmp = {};\r\n        // we only support dicts here since actually we need to convert this to a hashmap for skulpts version of\r\n        // compiled code. Any old mapping won't do, it must be iterable!\r\n        glob_loc.$items().forEach(([key, val]) => {\r\n            if (Sk.builtin.checkString(key)) {\r\n                tmp[key.$mangled] = val;\r\n            }\r\n        });\r\n    }\r\n    return tmp;\r\n}\r\n\r\nfunction reassignGlobLoc(dict, obj) {\r\n    if (dict === undefined || Sk.builtin.checkNone(dict)) {\r\n        return;\r\n    }\r\n    for (let key in obj) {\r\n        // this isn't technically correct - if they use delete in the exec this breaks\r\n        dict.mp$ass_subscript(new Sk.builtin.str(Sk.unfixReserved(key)), obj[key]);\r\n}\r\n}\r\n\r\n\r\nSk.setupObjects = function (py3) {\r\n    if (py3) {\r\n        Sk.builtins[\"filter\"] = Sk.builtin.filter_;\r\n        Sk.builtins[\"map\"] = Sk.builtin.map_;\r\n        Sk.builtins[\"zip\"] = Sk.builtin.zip_;\r\n        Sk.builtins[\"range\"] = Sk.builtin.range_;\r\n        delete Sk.builtins[\"reduce\"];\r\n        delete Sk.builtins[\"xrange\"];\r\n        delete Sk.builtins[\"StandardError\"];\r\n        delete Sk.builtins[\"unicode\"];\r\n        delete Sk.builtins[\"basestring\"];\r\n        delete Sk.builtins[\"long_$rw$\"];\r\n        Sk.builtin.int_.prototype.$r = function () {\r\n            return new Sk.builtin.str(this.v.toString());\r\n        };\r\n        delete Sk.builtin.int_.prototype.tp$str;\r\n        delete Sk.builtin.bool.prototype.tp$str;\r\n        delete Sk.builtins[\"raw_input\"];\r\n        delete Sk.builtins[\"unichr\"];\r\n        delete Sk.builtin.str.prototype.decode;\r\n        Sk.builtins[\"bytes\"] = Sk.builtin.bytes;\r\n        Sk.builtins[\"ascii\"] = new Sk.builtin.sk_method(\r\n            {\r\n                $meth: Sk.builtin.ascii,\r\n                $flags: { OneArg: true },\r\n                $textsig: \"($module, obj, /)\",\r\n                $doc:\r\n                    \"Return an ASCII-only representation of an object.\\n\\nAs repr(), return a string containing a printable representation of an\\nobject, but escape the non-ASCII characters in the string returned by\\nrepr() using \\\\\\\\x, \\\\\\\\u or \\\\\\\\U escapes. This generates a string similar\\nto that returned by repr() in Python 2.\",\r\n            },\r\n            null,\r\n            \"builtins\"\r\n        );\r\n    } else {\r\n        Sk.builtins[\"range\"] = new Sk.builtin.sk_method(\r\n            {\r\n                $meth: Sk.builtin.range,\r\n                $name: \"range\",\r\n                $flags: {MinArgs: 1, MaxArgs: 3},\r\n            },\r\n            undefined,\r\n            \"builtins\"\r\n        );\r\n        Sk.builtins[\"xrange\"] = new Sk.builtin.sk_method(\r\n            {\r\n                $meth: Sk.builtin.xrange,\r\n                $name: \"xrange\",\r\n                $flags: {MinArgs: 1, MaxArgs: 3},\r\n            },\r\n            null,\r\n            \"builtins\"\r\n        );\r\n        Sk.builtins[\"reduce\"] = new Sk.builtin.sk_method(\r\n            {\r\n                $meth: Sk.builtin.reduce,\r\n                $name: \"reduce\",\r\n                $flags: { MinArgs: 2, MaxArgs: 3 },\r\n            },\r\n            null,\r\n            \"builtins\"\r\n        );\r\n        Sk.builtins[\"filter\"] = new Sk.builtin.func(Sk.builtin.filter);\r\n        Sk.builtins[\"map\"] = new Sk.builtin.func(Sk.builtin.map);\r\n        Sk.builtins[\"zip\"] = new Sk.builtin.func(Sk.builtin.zip);\r\n\r\n        Sk.builtins[\"StandardError\"] = Sk.builtin.Exception;\r\n        Sk.builtins[\"unicode\"] = Sk.builtin.str;\r\n        Sk.builtins[\"basestring\"] = Sk.builtin.str;\r\n        Sk.builtins[\"long_$rw$\"] = Sk.builtin.lng;\r\n        Sk.builtin.int_.prototype.$r = function () {\r\n            const v = this.v;\r\n            if (typeof v === \"number\") {\r\n                return new Sk.builtin.str(v.toString());\r\n            } else {\r\n                return new Sk.builtin.str(v.toString() + \"L\");\r\n            }\r\n        };\r\n        Sk.builtin.int_.prototype.tp$str = function () {\r\n            return new Sk.builtin.str(this.v.toString());\r\n        };\r\n        Sk.builtin.bool.prototype.tp$str = function () {\r\n            return this.$r();\r\n        };\r\n        Sk.builtins[\"raw_input\"] = new Sk.builtin.func(Sk.builtin.raw_input);\r\n        Sk.builtins[\"unichr\"] = new Sk.builtin.func(Sk.builtin.unichr);\r\n        Sk.builtin.str.prototype.decode = Sk.builtin.str.$py2decode;\r\n        delete Sk.builtins[\"bytes\"];\r\n        delete Sk.builtins[\"ascii\"];\r\n    }\r\n};\r\n\r\nSk.exportSymbol(\"Sk.setupObjects\", Sk.setupObjects);\r\nSk.exportSymbol(\"Sk.builtins\", Sk.builtins);\r\n","require(\"fastestsmallesttextencoderdecoder\");\r\n\r\n// Mapping from supported valid encodings to normalized encoding name\r\nconst supportedEncodings = {\r\n    utf: \"utf-8\",\r\n    utf8: \"utf-8\",\r\n    utf_8: \"utf-8\",\r\n    ascii: \"ascii\",\r\n};\r\n\r\nvar space_reg = /\\s+/g;\r\nvar underscore_hyphen_reg = /[_-]+/g;\r\nfunction normalizeEncoding(encoding) {\r\n    const normalized = encoding.replace(space_reg, \"\").replace(underscore_hyphen_reg, \"_\").toLowerCase();\r\n    const supported = supportedEncodings[normalized];\r\n    if (supported === undefined) {\r\n        return encoding;\r\n    } else {\r\n        return supported;\r\n    }\r\n}\r\nconst Encoder = new TextEncoder();\r\nconst Decoder = new TextDecoder();\r\n\r\n/**\r\n * @constructor\r\n * @param {undefined|Uint8Array|Array|number|string} source Using constructor with new should be a js object\r\n * @return {Sk.builtin.bytes}\r\n * @extends {Sk.builtin.object}\r\n */\r\nSk.builtin.bytes = Sk.abstr.buildNativeClass(\"bytes\", {\r\n    constructor: function bytes(source) {\r\n        if (!(this instanceof Sk.builtin.bytes)) {\r\n            throw new TypeError(\"bytes is a constructor use 'new'\");\r\n        }\r\n        // deal with internal calls\r\n        if (source === undefined) {\r\n            this.v = new Uint8Array();\r\n        } else if (source instanceof Uint8Array) {\r\n            this.v = source;\r\n        } else if (Array.isArray(source)) {\r\n            Sk.asserts.assert(\r\n                source.every((x) => x >= 0 && x <= 0xff),\r\n                \"bad internal call to bytes with array\"\r\n            );\r\n            this.v = new Uint8Array(source);\r\n        } else if (typeof source === \"string\") {\r\n            // fast path must be binary string https://developer.mozilla.org/en-US/docs/Web/API/DOMString/Binary\r\n            // i.e. the reverse of this.$jsstr();\r\n            let cc;\r\n            const uint8 = new Uint8Array(source.length);\r\n            const len = source.length;\r\n            for (let i = 0; i < len; i++) {\r\n                cc = source.charCodeAt(i);\r\n                if (cc > 0xff) {\r\n                    throw new Sk.builtin.UnicodeDecodeError(\"invalid string at index \" + i + \" (possibly contains a unicode character)\");\r\n                }\r\n                uint8[i] = cc;\r\n            }\r\n            this.v = uint8;\r\n        } else if (typeof source === \"number\") {\r\n            this.v = new Uint8Array(source);\r\n        } else {\r\n            throw new TypeError(`bad internal argument to bytes constructor (got '${typeof source}': ${source})`);\r\n        }\r\n    },\r\n    slots: /**@lends {Sk.builtin.bytes.prototype} */ {\r\n        tp$getattr: Sk.generic.getAttr,\r\n        tp$doc:\r\n            \"bytes(iterable_of_ints) -> bytes\\nbytes(string, encoding[, errors]) -> bytes\\nbytes(bytes_or_buffer) -> immutable copy of bytes_or_buffer\\nbytes(int) -> bytes object of size given by the parameter initialized with null bytes\\nbytes() -> empty bytes object\\n\\nConstruct an immutable array of bytes from:\\n  - an iterable yielding integers in range(256)\\n  - a text string encoded using the specified encoding\\n  - any object implementing the buffer API.\\n  - an integer\",\r\n        tp$new(args, kwargs) {\r\n            if (this !== Sk.builtin.bytes.prototype) {\r\n                return this.$subtype_new(args, kwargs);\r\n            }\r\n            kwargs = kwargs || [];\r\n            let source, pySource, dunderBytes, encoding, errors;\r\n            if (args.length <= 1 && +kwargs.length === 0) {\r\n                pySource = args[0];\r\n            } else {\r\n                [pySource, encoding, errors] = Sk.abstr.copyKeywordsToNamedArgs(\"bytes\", [null, \"pySource\", \"errors\"], args, kwargs);\r\n                ({ encoding, errors } = checkGetEncodingErrors(\"bytes\", encoding, errors));\r\n                if (!Sk.builtin.checkString(pySource)) {\r\n                    throw new Sk.builtin.TypeError(\"encoding or errors without a string argument\");\r\n                }\r\n                return strEncode(pySource, encoding, errors);\r\n            }\r\n\r\n            if (pySource === undefined) {\r\n                return new Sk.builtin.bytes();\r\n            } else if ((dunderBytes = Sk.abstr.lookupSpecial(pySource, Sk.builtin.str.$bytes)) !== undefined) {\r\n                const ret = Sk.misceval.callsimOrSuspendArray(dunderBytes, []);\r\n                return Sk.misceval.chain(ret, (bytesSource) => {\r\n                    if (!Sk.builtin.checkBytes(bytesSource)) {\r\n                        throw new Sk.builtin.TypeError(\"__bytes__ returned non-bytes (type \" + Sk.abstr.typeName(bytesSource) + \")\");\r\n                    }\r\n                    return bytesSource;\r\n                });\r\n            } else if (Sk.misceval.isIndex(pySource)) {\r\n                source = Sk.misceval.asIndexSized(pySource, Sk.builtin.OverflowError);\r\n                if (source < 0) {\r\n                    throw new Sk.builtin.ValueError(\"negative count\");\r\n                }\r\n                return new Sk.builtin.bytes(source);\r\n            } else if (Sk.builtin.checkBytes(pySource)) {\r\n                return new Sk.builtin.bytes(pySource.v);\r\n            } else if (Sk.builtin.checkString(pySource)) {\r\n                throw new Sk.builtin.TypeError(\"string argument without an encoding\");\r\n            } else if (Sk.builtin.checkIterable(pySource)) {\r\n                let source = [];\r\n                let r = Sk.misceval.iterFor(Sk.abstr.iter(pySource), (byte) => {\r\n                    const n = Sk.misceval.asIndexSized(byte);\r\n                    if (n < 0 || n > 255) {\r\n                        throw new Sk.builtin.ValueError(\"bytes must be in range(0, 256)\");\r\n                    }\r\n                    source.push(n);\r\n                });\r\n                return Sk.misceval.chain(r, () => new Sk.builtin.bytes(source));\r\n            }\r\n            throw new Sk.builtin.TypeError(\"cannot convert '\" + Sk.abstr.typeName(pySource) + \"' object into bytes\");\r\n        },\r\n        $r() {\r\n            let num;\r\n            let quote = \"'\";\r\n            const hasdbl = this.v.indexOf(34) !== -1;\r\n            let ret = \"\";\r\n\r\n            for (let i = 0; i < this.v.length; i++) {\r\n                num = this.v[i];\r\n                if (num < 9 || (num > 10 && num < 13) || (num > 13 && num < 32) || num > 126) {\r\n                    ret += makehexform(num);\r\n                } else if (num === 9 || num === 10 || num === 13 || num === 39 || num === 92) {\r\n                    switch (num) {\r\n                        case 9:\r\n                            ret += \"\\\\t\";\r\n                            break;\r\n                        case 10:\r\n                            ret += \"\\\\n\";\r\n                            break;\r\n                        case 13:\r\n                            ret += \"\\\\r\";\r\n                            break;\r\n                        case 39:\r\n                            if (hasdbl) {\r\n                                ret += \"\\\\'\";\r\n                            } else {\r\n                                ret += \"'\";\r\n                                quote = '\"';\r\n                            }\r\n                            break;\r\n                        case 92:\r\n                            ret += \"\\\\\\\\\";\r\n                            break;\r\n                    }\r\n                } else {\r\n                    ret += String.fromCharCode(num);\r\n                }\r\n            }\r\n            ret = \"b\" + quote + ret + quote;\r\n            return new Sk.builtin.str(ret);\r\n        },\r\n        tp$str() {\r\n            return this.$r();\r\n        },\r\n        tp$iter() {\r\n            return new bytes_iter_(this);\r\n        },\r\n        tp$richcompare(other, op) {\r\n            if (this === other && Sk.misceval.opAllowsEquality(op)) {\r\n                return true;\r\n            } else if (!(other instanceof Sk.builtin.bytes)) {\r\n                return Sk.builtin.NotImplemented.NotImplemented$;\r\n            }\r\n            const v = this.v;\r\n            const w = other.v;\r\n            if (v.length !== w.length && (op === \"Eq\" || op === \"NotEq\")) {\r\n                /* Shortcut: if the lengths differ, the bytes differ */\r\n                return op === \"Eq\" ? false : true;\r\n            }\r\n            let i;\r\n            const min_len = Math.min(v.length, w.length);\r\n            for (i = 0; i < min_len; i++) {\r\n                if (v[i] !== w[i]) {\r\n                    break; // we've found a different element\r\n                }\r\n            }\r\n            switch (op) {\r\n                case \"Lt\":\r\n                    return (i === min_len && v.length < w.length) || v[i] < w[i];\r\n                case \"LtE\":\r\n                    return (i === min_len && v.length <= w.length) || v[i] <= w[i];\r\n                case \"Eq\":\r\n                    return i === min_len;\r\n                case \"NotEq\":\r\n                    return i < min_len;\r\n                case \"Gt\":\r\n                    return (i === min_len && v.length > w.length) || v[i] > w[i];\r\n                case \"GtE\":\r\n                    return (i === min_len && v.length >= w.length) || v[i] >= w[i];\r\n            }\r\n        },\r\n        tp$hash() {\r\n            return new Sk.builtin.str(this.$jsstr()).tp$hash();\r\n        },\r\n        tp$as_sequence_or_mapping: true,\r\n        mp$subscript(index) {\r\n            if (Sk.misceval.isIndex(index)) {\r\n                let i = Sk.misceval.asIndexSized(index, Sk.builtin.IndexError);\r\n                if (i !== undefined) {\r\n                    if (i < 0) {\r\n                        i = this.v.length + i;\r\n                    }\r\n                    if (i < 0 || i >= this.v.length) {\r\n                        throw new Sk.builtin.IndexError(\"index out of range\");\r\n                    }\r\n                    return new Sk.builtin.int_(this.v[i]);\r\n                }\r\n            } else if (index instanceof Sk.builtin.slice) {\r\n                const ret = [];\r\n                index.sssiter$(this.v.length, (i) => {\r\n                    ret.push(this.v[i]);\r\n                });\r\n                return new Sk.builtin.bytes(new Uint8Array(ret));\r\n            }\r\n            throw new Sk.builtin.TypeError(\"byte indices must be integers or slices, not \" + Sk.abstr.typeName(index));\r\n        },\r\n        sq$length() {\r\n            return this.v.length;\r\n        },\r\n        sq$concat(other) {\r\n            if (!(other instanceof Sk.builtin.bytes)) {\r\n                throw new Sk.builtin.TypeError(\"can't concat \" + Sk.abstr.typeName(other) + \" to bytes\");\r\n            }\r\n            const ret = new Uint8Array(this.v.length + other.v.length);\r\n            let i;\r\n            for (i = 0; i < this.v.length; i++) {\r\n                ret[i] = this.v[i];\r\n            }\r\n            for (let j = 0; j < other.v.length; j++, i++) {\r\n                ret[i] = other.v[j];\r\n            }\r\n            return new Sk.builtin.bytes(ret);\r\n        },\r\n        sq$repeat(n) {\r\n            if (!Sk.misceval.isIndex(n)) {\r\n                throw new Sk.builtin.TypeError(\"can't multiply sequence by non-int of type '\" + Sk.abstr.typeName(n) + \"'\");\r\n            }\r\n            n = Sk.misceval.asIndexSized(n, Sk.builtin.OverflowError);\r\n            const len = n * this.v.length;\r\n            if (len > Number.MAX_SAFE_INTEGER) {\r\n                throw new Sk.builtin.OverflowError();\r\n            } else if (n <= 0) {\r\n                return new Sk.builtin.bytes();\r\n            }\r\n            const ret = new Uint8Array(len);\r\n            let j = 0;\r\n            while (j < len) {\r\n                for (let i = 0; i < this.v.length; i++) {\r\n                    ret[j++] = this.v[i];\r\n                }\r\n            }\r\n            return new Sk.builtin.bytes(ret);\r\n        },\r\n        sq$contains(tgt) {\r\n            return this.find$left(tgt) !== -1;\r\n        },\r\n        tp$as_number: true,\r\n        nb$remainder: Sk.builtin.str.prototype.nb$remainder,\r\n    },\r\n    proto: {\r\n        $jsstr() {\r\n            // returns binary string - not bidirectional for non ascii characters - use with caution\r\n            // i.e. new Sk.builtin.bytes(x.$jsstr()).v  may be different to x.v;\r\n            let ret = \"\";\r\n            for (let i = 0; i < this.v.length; i++) {\r\n                ret += String.fromCharCode(this.v[i]);\r\n            }\r\n            return ret;\r\n        },\r\n        get$tgt(tgt) {\r\n            if (tgt instanceof Sk.builtin.bytes) {\r\n                return tgt.v;\r\n            }\r\n            tgt = Sk.misceval.asIndexOrThrow(tgt, \"argument should be integer or bytes-like object, not {tp$name}\");\r\n            if (tgt < 0 || tgt > 0xff) {\r\n                throw new Sk.builtin.ValueError(\"bytes must be in range(0, 256)\");\r\n            }\r\n            return tgt;\r\n        },\r\n        get$raw(tgt) {\r\n            if (tgt instanceof Sk.builtin.bytes) {\r\n                return tgt.v;\r\n            }\r\n            throw new Sk.builtin.TypeError(\"a bytes-like object is required, not '\" + Sk.abstr.typeName(tgt) + \"'\");\r\n        },\r\n        get$splitArgs: checkSepMaxSplit,\r\n        find$left: mkFind(false),\r\n        find$right: mkFind(true),\r\n        find$subleft: function findSubLeft(uint8, start, end) {\r\n            end = end - uint8.length + 1;\r\n            let i = start;\r\n            while (i < end) {\r\n                if (uint8.every((val, j) => val === this.v[i + j])) {\r\n                    return i;\r\n                }\r\n                i++;\r\n            }\r\n            return -1;\r\n        },\r\n        find$subright(uint8, start, end) {\r\n            let i = end - uint8.length;\r\n            while (i >= start) {\r\n                if (uint8.every((val, j) => val === this.v[i + j])) {\r\n                    return i;\r\n                }\r\n                i--;\r\n            }\r\n            return -1;\r\n        },\r\n        $subtype_new(args, kwargs) {\r\n            const instance = new this.constructor();\r\n            // we call bytes new method with all the args and kwargs\r\n            const bytes_instance = Sk.builtin.bytes.prototype.tp$new(args, kwargs);\r\n            instance.v = bytes_instance.v;\r\n            return instance;\r\n        },\r\n        sk$asarray() {\r\n            const ret = [];\r\n            this.v.forEach((x) => {ret.push(new Sk.builtin.int_(x));});\r\n            return ret;\r\n        },\r\n        valueOf() {\r\n            return this.v;\r\n        },\r\n    },\r\n    flags: {\r\n        str$encode: strEncode,\r\n        $decode: bytesDecode,\r\n        check$encodeArgs: checkGetEncodingErrors,\r\n    },\r\n    methods: {\r\n        __getnewargs__: {\r\n            $meth() {\r\n                return new Sk.builtin.tuple(new Sk.builtin.bytes(this.v));\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc: null,\r\n        },\r\n        capitalize: {\r\n            $meth() {\r\n                const len = this.v.length;\r\n                if (len === 0) {\r\n                    return new Sk.builtin.bytes(this.v);\r\n                }\r\n                const final = new Uint8Array(len);\r\n                let val = this.v[0];\r\n                final[0] = islower(val) ? val - 32 : val;\r\n                for (let i = 1; i < len; i++) {\r\n                    val = this.v[i];\r\n                    final[i] = isupper(val) ? val + 32 : val;\r\n                }\r\n                return new Sk.builtin.bytes(final);\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc: \"B.capitalize() -> copy of B\\n\\nReturn a copy of B with only its first character capitalized (ASCII)\\nand the rest lower-cased.\",\r\n        },\r\n        center: {\r\n            $meth: mkJust(\"center\", false, true),\r\n            $flags: { MinArgs: 1, MaxArgs: 2 },\r\n            $textsig: null,\r\n            $doc:\r\n                \"B.center(width[, fillchar]) -> copy of B\\n\\nReturn B centered in a string of length width.  Padding is\\ndone using the specified fill character (default is a space).\",\r\n        },\r\n        count: {\r\n            $meth(tgt, start, end) {\r\n                tgt = this.get$tgt(tgt);\r\n                ({ start, end } = Sk.builtin.slice.startEnd$wrt(this, start, end));\r\n                let count = 0;\r\n                if (typeof tgt === \"number\") {\r\n                    for (let i = start; i < end; i++) {\r\n                        if (this.v[i] === tgt) {\r\n                            count++;\r\n                        }\r\n                    }\r\n                } else {\r\n                    const upto = end - tgt.length + 1;\r\n                    for (let i = start; i < upto; i++) {\r\n                        if (tgt.every((val, j) => val === this.v[i + j])) {\r\n                            count++;\r\n                            i += tgt.length - 1;\r\n                        }\r\n                    }\r\n                }\r\n                return new Sk.builtin.int_(count);\r\n            },\r\n            $flags: { MinArgs: 1, MaxArgs: 3 },\r\n            $textsig: null,\r\n            $doc:\r\n                \"B.count(sub[, start[, end]]) -> int\\n\\nReturn the number of non-overlapping occurrences of subsection sub in\\nbytes B[start:end].  Optional arguments start and end are interpreted\\nas in slice notation.\",\r\n        },\r\n        decode: {\r\n            $meth: bytesDecode,\r\n            $flags: { NamedArgs: [\"encoding\", \"errors\"] },\r\n            $textsig: \"($self, /, encoding='utf-8', errors='strict')\",\r\n            $doc:\r\n                \"Decode the bytes using the codec registered for encoding.\\n\\n  encoding\\n    The encoding with which to decode the bytes.\\n  errors\\n    The error handling scheme to use for the handling of decoding errors.\\n    The default is 'strict' meaning that decoding errors raise a\\n    UnicodeDecodeError. Other possible values are 'ignore' and 'replace'\\n    as well as any other name registered with codecs.register_error that\\n    can handle UnicodeDecodeErrors.\",\r\n        },\r\n        endswith: {\r\n            $meth: mkStartsEndsWith(\"endswith\", (subarray, tgt) => {\r\n                const start = subarray.length - tgt.length;\r\n                return start >= 0 && tgt.every((val, i) => val === subarray[start + i]);\r\n            }),\r\n            $flags: { MinArgs: 1, MaxArgs: 3 },\r\n            $textsig: null,\r\n            $doc:\r\n                \"B.endswith(suffix[, start[, end]]) -> bool\\n\\nReturn True if B ends with the specified suffix, False otherwise.\\nWith optional start, test B beginning at that position.\\nWith optional end, stop comparing B at that position.\\nsuffix can also be a tuple of bytes to try.\",\r\n        },\r\n        expandtabs: {\r\n            $meth(tabsize) {\r\n                tabsize = Sk.misceval.asIndexSized(tabsize, Sk.builtin.OverflowError, \"an integer is required (got type {tp$nam})\");\r\n                const final = [];\r\n                let linepos = 0;\r\n                for (let i = 0; i < this.v.length; i++) {\r\n                    const val = this.v[i];\r\n                    if (val === 9) {\r\n                        const inc = tabsize - (linepos % tabsize);\r\n                        final.push(...new Array(inc).fill(32));\r\n                        linepos += inc;\r\n                    } else if (val === 10 || val === 13) {\r\n                        final.push(val);\r\n                        linepos = 0;\r\n                    } else {\r\n                        final.push(val);\r\n                        linepos++;\r\n                    }\r\n                }\r\n                return new Sk.builtin.bytes(new Uint8Array(final));\r\n            },\r\n            $flags: { NamedArgs: [\"tabsize\"], Defaults: [8] },\r\n            $textsig: null,\r\n            $doc:\r\n                \"B.expandtabs(tabsize=8) -> copy of B\\n\\nReturn a copy of B where all tab characters are expanded using spaces.\\nIf tabsize is not given, a tab size of 8 characters is assumed.\",\r\n        },\r\n        find: {\r\n            $meth: function find(tgt, start, end) {\r\n                return new Sk.builtin.int_(this.find$left(tgt, start, end));\r\n            },\r\n            $flags: { MinArgs: 1, MaxArgs: 3 },\r\n            $textsig: null,\r\n            $doc:\r\n                \"B.find(sub[, start[, end]]) -> int\\n\\nReturn the lowest index in B where subsection sub is found,\\nsuch that sub is contained within B[start,end].  Optional\\narguments start and end are interpreted as in slice notation.\\n\\nReturn -1 on failure.\",\r\n        },\r\n        hex: {\r\n            $meth() {\r\n                let final = \"\";\r\n                for (let i = 0; i < this.v.length; i++) {\r\n                    final += this.v[i].toString(16).padStart(2, \"0\");\r\n                }\r\n                return new Sk.builtin.str(final);\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc: \"B.hex() -> string\\n\\nCreate a string of hexadecimal numbers from a bytes object.\\nExample: b'\\\\xb9\\\\x01\\\\xef'.hex() -> 'b901ef'.\",\r\n        },\r\n        index: {\r\n            $meth: function index(tgt, start, end) {\r\n                const val = this.find$left(tgt, start, end);\r\n                if (val === -1) {\r\n                    throw new Sk.builtin.ValueError(\"subsection not found\");\r\n                } else {\r\n                    return new Sk.builtin.int_(val);\r\n                }\r\n            },\r\n            $flags: { MinArgs: 1, MaxArgs: 3 },\r\n            $textsig: null,\r\n            $doc:\r\n                \"B.index(sub[, start[, end]]) -> int\\n\\nReturn the lowest index in B where subsection sub is found,\\nsuch that sub is contained within B[start,end].  Optional\\narguments start and end are interpreted as in slice notation.\\n\\nRaises ValueError when the subsection is not found.\",\r\n        },\r\n        isalnum: {\r\n            $meth: mkIsAll((val) => isdigit(val) || islower(val) || isupper(val)),\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc:\r\n                \"B.isalnum() -> bool\\n\\nReturn True if all characters in B are alphanumeric\\nand there is at least one character in B, False otherwise.\",\r\n        },\r\n        isalpha: {\r\n            $meth: mkIsAll((val) => (val >= 65 && val <= 90) || (val >= 97 && val <= 122)),\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc:\r\n                \"B.isalpha() -> bool\\n\\nReturn True if all characters in B are alphabetic\\nand there is at least one character in B, False otherwise.\",\r\n        },\r\n        isascii: {\r\n            $meth: mkIsAll((val) => val >= 0 && val <= 0x7f, true),\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc: \"B.isascii() -> bool\\n\\nReturn True if B is empty or all characters in B are ASCII,\\nFalse otherwise.\",\r\n        },\r\n        isdigit: {\r\n            $meth: mkIsAll(isdigit),\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc: \"B.isdigit() -> bool\\n\\nReturn True if all characters in B are digits\\nand there is at least one character in B, False otherwise.\",\r\n        },\r\n        islower: {\r\n            $meth: makeIsUpperLower(islower, isupper),\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc:\r\n                \"B.islower() -> bool\\n\\nReturn True if all cased characters in B are lowercase and there is\\nat least one cased character in B, False otherwise.\",\r\n        },\r\n        isspace: {\r\n            $meth: mkIsAll(isspace),\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc:\r\n                \"B.isspace() -> bool\\n\\nReturn True if all characters in B are whitespace\\nand there is at least one character in B, False otherwise.\",\r\n        },\r\n        istitle: {\r\n            $meth: function istitle() {\r\n                let inword = false;\r\n                let cased = false;\r\n                for (let i = 0; i < this.v.length; i++) {\r\n                    const val = this.v[i];\r\n                    if (isupper(val)) {\r\n                        if (inword) {\r\n                            return Sk.builtin.bool.false$;\r\n                        }\r\n                        inword = true;\r\n                        cased = true;\r\n                    } else if (islower(val)) {\r\n                        if (!inword) {\r\n                            return Sk.builtin.bool.false$;\r\n                        }\r\n                        cased = true;\r\n                    } else {\r\n                        inword = false;\r\n                    }\r\n                }\r\n                return cased ? Sk.builtin.bool.true$ : Sk.builtin.bool.false$;\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc:\r\n                \"B.istitle() -> bool\\n\\nReturn True if B is a titlecased string and there is at least one\\ncharacter in B, i.e. uppercase characters may only follow uncased\\ncharacters and lowercase characters only cased ones. Return False\\notherwise.\",\r\n        },\r\n        isupper: {\r\n            $meth: makeIsUpperLower(isupper, islower),\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc:\r\n                \"B.isupper() -> bool\\n\\nReturn True if all cased characters in B are uppercase and there is\\nat least one cased character in B, False otherwise.\",\r\n        },\r\n        join: {\r\n            $meth(iterable) {\r\n                const final = [];\r\n                let i = 0;\r\n                return Sk.misceval.chain(\r\n                    Sk.misceval.iterFor(Sk.abstr.iter(iterable), (item) => {\r\n                        if (!(item instanceof Sk.builtin.bytes)) {\r\n                            throw new Sk.builtin.TypeError(\r\n                                \"sequence item \" + i + \": expected a bytes-like object, \" + Sk.abstr.typeName(item) + \" found\"\r\n                            );\r\n                        }\r\n                        i++;\r\n                        if (final.length) {\r\n                            final.push(...this.v);\r\n                        }\r\n                        final.push(...item.v);\r\n                    }),\r\n                    () => new Sk.builtin.bytes(new Uint8Array(final))\r\n                );\r\n            },\r\n            $flags: { OneArg: true },\r\n            $textsig: \"($self, iterable_of_bytes, /)\",\r\n            $doc:\r\n                \"Concatenate any number of bytes objects.\\n\\nThe bytes whose method is called is inserted in between each pair.\\n\\nThe result is returned as a new bytes object.\\n\\nExample: b'.'.join([b'ab', b'pq', b'rs']) -> b'ab.pq.rs'.\",\r\n        },\r\n        ljust: {\r\n            $meth: mkJust(\"ljust\", false, false),\r\n            $flags: { MinArgs: 1, MaxArgs: 2 },\r\n            $textsig: null,\r\n            $doc:\r\n                \"B.ljust(width[, fillchar]) -> copy of B\\n\\nReturn B left justified in a string of length width. Padding is\\ndone using the specified fill character (default is a space).\",\r\n        },\r\n        lower: {\r\n            $meth: mkCaseSwitch((val) => (isupper(val) ? val + 32 : val)),\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc: \"B.lower() -> copy of B\\n\\nReturn a copy of B with all ASCII characters converted to lowercase.\",\r\n        },\r\n        lstrip: {\r\n            $meth: mkStrip(true, false),\r\n            $flags: { MinArgs: 0, MaxArgs: 1 },\r\n            $textsig: \"($self, bytes=None, /)\",\r\n            $doc: \"Strip leading bytes contained in the argument.\\n\\nIf the argument is omitted or None, strip leading  ASCII whitespace.\",\r\n        },\r\n        partition: {\r\n            $meth: mkPartition(false),\r\n            $flags: { OneArg: true },\r\n            $textsig: \"($self, sep, /)\",\r\n            $doc:\r\n                \"Partition the bytes into three parts using the given separator.\\n\\nThis will search for the separator sep in the bytes. If the separator is found,\\nreturns a 3-tuple containing the part before the separator, the separator\\nitself, and the part after it.\\n\\nIf the separator is not found, returns a 3-tuple containing the original bytes\\nobject and two empty bytes objects.\",\r\n        },\r\n        replace: {\r\n            $meth(oldB, newB, count) {\r\n                oldB = this.get$raw(oldB);\r\n                newB = this.get$raw(newB);\r\n                count = count === undefined ? -1 : Sk.misceval.asIndexSized(count, Sk.builtin.OverflowError);\r\n                count = count < 0 ? Infinity : count;\r\n                const final = [];\r\n                let found = 0,\r\n                    i = 0;\r\n                while (i < this.v.length && found < count) {\r\n                    const next = this.find$subleft(oldB, i, this.v.length);\r\n                    if (next === -1) {\r\n                        break;\r\n                    }\r\n                    for (let j = i; j < next; j++) {\r\n                        final.push(this.v[j]);\r\n                    }\r\n                    final.push(...newB);\r\n                    i = next + oldB.length;\r\n                    found++;\r\n                }\r\n                for (i; i < this.v.length; i++) {\r\n                    final.push(this.v[i]);\r\n                }\r\n                return new Sk.builtin.bytes(new Uint8Array(final));\r\n            },\r\n            $flags: { MinArgs: 2, MaxArgs: 3 },\r\n            $textsig: \"($self, old, new, count=-1, /)\",\r\n            $doc:\r\n                \"Return a copy with all occurrences of substring old replaced by new.\\n\\n  count\\n    Maximum number of occurrences to replace.\\n    -1 (the default value) means replace all occurrences.\\n\\nIf the optional argument count is given, only the first count occurrences are\\nreplaced.\",\r\n        },\r\n        rfind: {\r\n            $meth(tgt, start, end) {\r\n                return new Sk.builtin.int_(this.find$right(tgt, start, end));\r\n            },\r\n            $flags: { MinArgs: 1, MaxArgs: 3 },\r\n            $textsig: null,\r\n            $doc:\r\n                \"B.rfind(sub[, start[, end]]) -> int\\n\\nReturn the highest index in B where subsection sub is found,\\nsuch that sub is contained within B[start,end].  Optional\\narguments start and end are interpreted as in slice notation.\\n\\nReturn -1 on failure.\",\r\n        },\r\n        rindex: {\r\n            $meth: function rindex(tgt, start, end) {\r\n                const val = this.find$right(tgt, start, end);\r\n                if (val === -1) {\r\n                    throw new Sk.builtin.ValueError(\"subsection not found\");\r\n                } else {\r\n                    return new Sk.builtin.int_(val);\r\n                }\r\n            },\r\n            $flags: { MinArgs: 1, MaxArgs: 3 },\r\n            $textsig: null,\r\n            $doc:\r\n                \"B.rindex(sub[, start[, end]]) -> int\\n\\nReturn the highest index in B where subsection sub is found,\\nsuch that sub is contained within B[start,end].  Optional\\narguments start and end are interpreted as in slice notation.\\n\\nRaise ValueError when the subsection is not found.\",\r\n        },\r\n        rjust: {\r\n            $meth: mkJust(\"rjust\", true, false),\r\n            $flags: { MinArgs: 1, MaxArgs: 2 },\r\n            $textsig: null,\r\n            $doc:\r\n                \"B.rjust(width[, fillchar]) -> copy of B\\n\\nReturn B right justified in a string of length width. Padding is\\ndone using the specified fill character (default is a space)\",\r\n        },\r\n        rpartition: {\r\n            $meth: mkPartition(true),\r\n            $flags: { OneArg: true },\r\n            $textsig: \"($self, sep, /)\",\r\n            $doc:\r\n                \"Partition the bytes into three parts using the given separator.\\n\\nThis will search for the separator sep in the bytes, starting at the end. If\\nthe separator is found, returns a 3-tuple containing the part before the\\nseparator, the separator itself, and the part after it.\\n\\nIf the separator is not found, returns a 3-tuple containing two empty bytes\\nobjects and the original bytes object.\",\r\n        },\r\n        rsplit: {\r\n            $meth: function rSplit(sep, maxsplit) {\r\n                ({ sep, maxsplit } = this.get$splitArgs(sep, maxsplit));\r\n\r\n                const result = [];\r\n                let splits = 0,\r\n                    i = this.v.length;\r\n\r\n                if (sep !== null) {\r\n                    while (i >= 0 && splits < maxsplit) {\r\n                        const next = this.find$subright(sep, 0, i);\r\n                        if (next === -1) {\r\n                            break;\r\n                        }\r\n                        result.push(new Sk.builtin.bytes(this.v.subarray(next + sep.length, i)));\r\n                        i = next;\r\n                        splits++;\r\n                    }\r\n                    result.push(new Sk.builtin.bytes(this.v.subarray(0, i)));\r\n                } else {\r\n                    i--;\r\n                    while (splits < maxsplit) {\r\n                        while (isspace(this.v[i])) {\r\n                            i--;\r\n                        }\r\n                        if (i < 0) {\r\n                            break;\r\n                        }\r\n                        const index = i + 1;\r\n                        i--;\r\n                        while (i >= 0 && !isspace(this.v[i])) {\r\n                            i--;\r\n                        }\r\n                        result.push(new Sk.builtin.bytes(this.v.subarray(i + 1, index)));\r\n                        splits++;\r\n                    }\r\n                    if (i >= 0) {\r\n                        while (isspace(this.v[i])) {\r\n                            i--;\r\n                        }\r\n                        if (i >= 0) {\r\n                            result.push(new Sk.builtin.bytes(this.v.subarray(0, i + 1)));\r\n                        }\r\n                    }\r\n                }\r\n                return new Sk.builtin.list(result.reverse());\r\n            },\r\n            $flags: { NamedArgs: [\"sep\", \"maxsplit\"], Defaults: [Sk.builtin.none.none$, -1] },\r\n            $textsig: \"($self, /, sep=None, maxsplit=-1)\",\r\n            $doc:\r\n                \"Return a list of the sections in the bytes, using sep as the delimiter.\\n\\n  sep\\n    The delimiter according which to split the bytes.\\n    None (the default value) means split on ASCII whitespace characters\\n    (space, tab, return, newline, formfeed, vertical tab).\\n  maxsplit\\n    Maximum number of splits to do.\\n    -1 (the default value) means no limit.\\n\\nSplitting is done starting at the end of the bytes and working to the front.\",\r\n        },\r\n        rstrip: {\r\n            $meth: mkStrip(false, true),\r\n            $flags: { MinArgs: 0, MaxArgs: 1 },\r\n            $textsig: \"($self, bytes=None, /)\",\r\n            $doc: \"Strip trailing bytes contained in the argument.\\n\\nIf the argument is omitted or None, strip trailing ASCII whitespace.\",\r\n        },\r\n        split: {\r\n            $meth: function Split(sep, maxsplit) {\r\n                ({ sep, maxsplit } = this.get$splitArgs(sep, maxsplit));\r\n\r\n                const result = [];\r\n                const mylen = this.v.length;\r\n                let splits = 0,\r\n                    i = 0;\r\n\r\n                if (sep !== null) {\r\n                    while (i < mylen && splits < maxsplit) {\r\n                        const next = this.find$subleft(sep, i, mylen);\r\n                        if (next === -1) {\r\n                            break;\r\n                        }\r\n                        result.push(new Sk.builtin.bytes(this.v.subarray(i, next)));\r\n                        i = next + sep.length;\r\n                        splits++;\r\n                    }\r\n                    result.push(new Sk.builtin.bytes(this.v.subarray(i, mylen)));\r\n                } else {\r\n                    while (splits < maxsplit) {\r\n                        while (isspace(this.v[i])) {\r\n                            i++;\r\n                        }\r\n                        if (i === mylen) {\r\n                            break;\r\n                        }\r\n                        const index = i;\r\n                        i++;\r\n                        while (i < mylen && !isspace(this.v[i])) {\r\n                            i++;\r\n                        }\r\n                        result.push(new Sk.builtin.bytes(this.v.subarray(index, i)));\r\n                        splits++;\r\n                    }\r\n                    if (i < mylen) {\r\n                        while (isspace(this.v[i])) {\r\n                            i++;\r\n                        }\r\n                        if (i < mylen) {\r\n                            result.push(new Sk.builtin.bytes(this.v.subarray(i, mylen)));\r\n                        }\r\n                    }\r\n                }\r\n                return new Sk.builtin.list(result);\r\n            },\r\n            $flags: { NamedArgs: [\"sep\", \"maxsplit\"], Defaults: [Sk.builtin.none.none$, -1] },\r\n            $textsig: \"($self, /, sep=None, maxsplit=-1)\",\r\n            $doc:\r\n                \"Return a list of the sections in the bytes, using sep as the delimiter.\\n\\n  sep\\n    The delimiter according which to split the bytes.\\n    None (the default value) means split on ASCII whitespace characters\\n    (space, tab, return, newline, formfeed, vertical tab).\\n  maxsplit\\n    Maximum number of splits to do.\\n    -1 (the default value) means no limit.\",\r\n        },\r\n        splitlines: {\r\n            $meth(keepends) {\r\n                keepends = Sk.misceval.isTrue(keepends);\r\n                const final = [];\r\n                let sol = 0;\r\n                let eol;\r\n                let i = 0;\r\n                const len = this.v.length;\r\n                while (i < len) {\r\n                    const val = this.v[i];\r\n                    if (val === 13) {\r\n                        // \\r\r\n                        const rn = this.v[i + 1] === 10; // \\r\\n\r\n                        if (keepends) {\r\n                            eol = rn ? i + 2 : i + 1;\r\n                        } else {\r\n                            eol = i;\r\n                        }\r\n                        final.push(new Sk.builtin.bytes(this.v.subarray(sol, eol)));\r\n                        i = sol = rn ? i + 2 : i + 1;\r\n                    } else if (val === 10) {\r\n                        // \\n\r\n                        eol = keepends ? i + 1 : i;\r\n                        final.push(new Sk.builtin.bytes(this.v.subarray(sol, eol)));\r\n                        i = sol = i + 1;\r\n                    } else {\r\n                        i++;\r\n                    }\r\n                }\r\n                if (sol < len) {\r\n                    final.push(new Sk.builtin.bytes(this.v.subarray(sol, len)));\r\n                }\r\n                return new Sk.builtin.list(final);\r\n            },\r\n            $flags: { NamedArgs: [\"keepends\"], Defaults: [false] },\r\n            $textsig: \"($self, /, keepends=False)\",\r\n            $doc:\r\n                \"Return a list of the lines in the bytes, breaking at line boundaries.\\n\\nLine breaks are not included in the resulting list unless keepends is given and\\ntrue.\",\r\n        },\r\n        startswith: {\r\n            $meth: mkStartsEndsWith(\"startswith\", (subarray, tgt) => tgt.length <= subarray.length && tgt.every((val, i) => val === subarray[i])),\r\n            $flags: { MinArgs: 1, MaxArgs: 3 },\r\n            $textsig: null,\r\n            $doc:\r\n                \"B.startswith(prefix[, start[, end]]) -> bool\\n\\nReturn True if B starts with the specified prefix, False otherwise.\\nWith optional start, test B beginning at that position.\\nWith optional end, stop comparing B at that position.\\nprefix can also be a tuple of bytes to try.\",\r\n        },\r\n        strip: {\r\n            $meth: mkStrip(true, true),\r\n            $flags: { MinArgs: 0, MaxArgs: 1 },\r\n            $textsig: \"($self, bytes=None, /)\",\r\n            $doc:\r\n                \"Strip leading and trailing bytes contained in the argument.\\n\\nIf the argument is omitted or None, strip leading and trailing ASCII whitespace.\",\r\n        },\r\n        swapcase: {\r\n            $meth: mkCaseSwitch((val) => (isupper(val) ? val + 32 : islower(val) ? val - 32 : val)),\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc: \"B.swapcase() -> copy of B\\n\\nReturn a copy of B with uppercase ASCII characters converted\\nto lowercase ASCII and vice versa.\",\r\n        },\r\n        title: {\r\n            $meth() {\r\n                const len = this.v.length;\r\n                const final = new Uint8Array(len);\r\n                let inword = false;\r\n                for (let i = 0; i < len; i++) {\r\n                    const val = this.v[i];\r\n                    if (isupper(val)) {\r\n                        final[i] = inword ? val + 32 : val;\r\n                        inword = true;\r\n                    } else if (islower(val)) {\r\n                        final[i] = inword ? val : val - 32;\r\n                        inword = true;\r\n                    } else {\r\n                        final[i] = val;\r\n                        inword = false;\r\n                    }\r\n                }\r\n                return new Sk.builtin.bytes(final);\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc:\r\n                \"B.title() -> copy of B\\n\\nReturn a titlecased version of B, i.e. ASCII words start with uppercase\\ncharacters, all remaining cased characters have lowercase.\",\r\n        },\r\n        // translate: {\r\n        //     $meth() {\r\n        //         throw new Sk.builtin.NotImplementedError(\"translate() bytes method not implemented in Skulpt\");\r\n        //     },\r\n        //     $flags: { NoArgs: true },\r\n        //     $textsig: \"($self, table, /, delete=b'')\",\r\n        //     $doc:\r\n        //         \"Return a copy with each character mapped by the given translation table.\\n\\n  table\\n    Translation table, which must be a bytes object of length 256.\\n\\nAll characters occurring in the optional argument delete are removed.\\nThe remaining characters are mapped through the given translation table.\",\r\n        // },\r\n        upper: {\r\n            $meth: mkCaseSwitch((val) => (islower(val) ? val - 32 : val)),\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc: \"B.upper() -> copy of B\\n\\nReturn a copy of B with all ASCII characters converted to uppercase.\",\r\n        },\r\n        zfill: {\r\n            $meth(width) {\r\n                width = Sk.misceval.asIndexSized(width, Sk.builtin.IndexError);\r\n                const fill_len = width - this.v.length;\r\n                if (fill_len <= 0) {\r\n                    return new Sk.builtin.bytes(this.v);\r\n                }\r\n                const final = new Uint8Array(width);\r\n                let i = 0,\r\n                    j;\r\n                if (this.v[0] === 43 || this.v[0] === 45) {\r\n                    final[0] = this.v[0];\r\n                    i++;\r\n                }\r\n                final.fill(48, i, i + fill_len);\r\n                for (j = i, i = i + fill_len; i < width; i++, j++) {\r\n                    final[i] = this.v[j];\r\n                }\r\n                return new Sk.builtin.bytes(final);\r\n            },\r\n            $flags: { OneArg: true },\r\n            $textsig: null,\r\n            $doc:\r\n                \"B.zfill(width) -> copy of B\\n\\nPad a numeric string B with zeros on the left, to fill a field\\nof the specified width.  B is never truncated.\",\r\n        },\r\n    },\r\n    classmethods: {\r\n        fromhex: {\r\n            $meth: function fromhex(string) {\r\n                if (!Sk.builtin.checkString(string)) {\r\n                    throw new Sk.builtin.TypeError(\"fromhex() argument must be str, not \" + Sk.abstr.typeName(string));\r\n                }\r\n                string = string.$jsstr();\r\n                const spaces = /\\s+/g;\r\n                const ishex = /^[abcdefABCDEF0123456789]{2}$/;\r\n                const final = [];\r\n                let index = 0;\r\n                function pushOrThrow(upto) {\r\n                    for (let i = index; i < upto; i += 2) {\r\n                        let s = string.substr(i, 2);\r\n                        if (!ishex.test(s)) {\r\n                            throw new Sk.builtin.ValueError(\"non-hexadecimal number found in fromhex() arg at position \" + (i + 1));\r\n                        }\r\n                        final.push(parseInt(s, 16));\r\n                    }\r\n                }\r\n                let match;\r\n                while ((match = spaces.exec(string)) !== null) {\r\n                    pushOrThrow(match.index);\r\n                    index = spaces.lastIndex;\r\n                }\r\n                pushOrThrow(string.length);\r\n                return new this(final);\r\n            },\r\n            $flags: { OneArg: true },\r\n            $textsig: \"($type, string, /)\",\r\n            $doc:\r\n                \"Create a bytes object from a string of hexadecimal numbers.\\n\\nSpaces between two numbers are accepted.\\nExample: bytes.fromhex('B9 01EF') -> b'\\\\\\\\xb9\\\\\\\\x01\\\\\\\\xef'.\",\r\n        },\r\n    },\r\n});\r\n\r\nfunction checkGetEncodingErrors(funcname, encoding, errors) {\r\n    // check the types of encoding and errors\r\n    if (encoding === undefined) {\r\n        encoding = \"utf-8\";\r\n    } else if (!Sk.builtin.checkString(encoding)) {\r\n        throw new Sk.builtin.TypeError(\r\n            funcname + \"() argument \" + (\"bytesstr\".includes(funcname) ? 2 : 1) + \" must be str not \" + Sk.abstr.typeName(encoding)\r\n        );\r\n    } else {\r\n        encoding = encoding.$jsstr();\r\n    }\r\n    if (errors === undefined) {\r\n        errors = \"strict\";\r\n    } else if (!Sk.builtin.checkString(errors)) {\r\n        throw new Sk.builtin.TypeError(\r\n            funcname + \"() argument \" + (\"bytesstr\".includes(funcname) ? 3 : 2) + \" must be str not \" + Sk.abstr.typeName(errors)\r\n        );\r\n    } else {\r\n        errors = errors.$jsstr();\r\n    }\r\n    return { encoding: encoding, errors: errors };\r\n}\r\n\r\nfunction strEncode(pyStr, encoding, errors) {\r\n    const source = pyStr.$jsstr();\r\n    encoding = normalizeEncoding(encoding);\r\n    if (!(errors === \"strict\" || errors === \"ignore\" || errors === \"replace\")) {\r\n        throw new Sk.builtin.NotImplementedError(\"'\" + errors + \"' error handling not implemented in Skulpt\");\r\n    }\r\n    let uint8;\r\n    if (encoding === \"ascii\") {\r\n        uint8 = encodeAscii(source, errors);\r\n    } else if (encoding === \"utf-8\") {\r\n        uint8 = Encoder.encode(source);\r\n    } else {\r\n        throw new Sk.builtin.LookupError(\"unknown encoding: \" + encoding);\r\n    }\r\n    return new Sk.builtin.bytes(uint8);\r\n}\r\n\r\nfunction encodeAscii(source, errors) {\r\n    const data = [];\r\n    for (let i in source) {\r\n        const val = source.charCodeAt(i);\r\n        if (val > 0x7f) {\r\n            if (errors === \"strict\") {\r\n                const hexval = makehexform(val);\r\n                throw new Sk.builtin.UnicodeEncodeError(\r\n                    \"'ascii' codec can't encode character '\" + hexval + \"' in position \" + i + \": ordinal not in range(128)\"\r\n                );\r\n            } else if (errors === \"replace\") {\r\n                data.push(63); // \"?\"\r\n            }\r\n        } else {\r\n            data.push(val);\r\n        }\r\n    }\r\n    return new Uint8Array(data);\r\n}\r\n\r\nfunction makehexform(num) {\r\n    var leading;\r\n    if (num <= 265) {\r\n        leading = \"\\\\x\";\r\n    } else {\r\n        leading = \"\\\\u\";\r\n    }\r\n    num = num.toString(16);\r\n    if (num.length === 3) {\r\n        num = num.slice(1, 3);\r\n    }\r\n    if (num.length === 1) {\r\n        num = leading + \"0\" + num;\r\n    } else {\r\n        num = leading + num;\r\n    }\r\n    return num;\r\n}\r\n\r\nfunction decodeAscii(source, errors) {\r\n    let final = \"\";\r\n    for (let i = 0; i < source.length; i++) {\r\n        const val = source[i];\r\n        if (val > 0x7f) {\r\n            if (errors === \"strict\") {\r\n                throw new Sk.builtin.UnicodeDecodeError(\r\n                    \"'ascii' codec can't decode byte 0x\" + val.toString(16) + \" in position \" + i + \": ordinal not in range(128)\"\r\n                );\r\n            } else if (errors === \"replace\") {\r\n                final += String.fromCharCode(65533);\r\n            }\r\n        } else {\r\n            final += String.fromCharCode(val);\r\n        }\r\n    }\r\n    return final;\r\n}\r\n\r\nfunction decodeUtf(source, errors) {\r\n    const string = Decoder.decode(source);\r\n    if (errors === \"replace\") {\r\n        return string;\r\n    } else if (errors === \"strict\") {\r\n        const i = string.indexOf(\"�\");\r\n        if (i === -1) {\r\n            return string;\r\n        }\r\n        throw new Sk.builtin.UnicodeDecodeError(\r\n            \"'utf-8' codec can't decode byte 0x\" + source[i].toString(16) + \" in position \" + i + \": invalid start byte\"\r\n        );\r\n    }\r\n    return string.replace(/�/g, \"\");\r\n}\r\n\r\nfunction bytesDecode(encoding, errors) {\r\n    ({ encoding, errors } = checkGetEncodingErrors(\"decode\", encoding, errors));\r\n    encoding = normalizeEncoding(encoding);\r\n\r\n    if (!(errors === \"strict\" || errors === \"ignore\" || errors === \"replace\")) {\r\n        throw new Sk.builtin.NotImplementedError(\"'\" + errors + \"' error handling not implemented in Skulpt\");\r\n    }\r\n\r\n    let jsstr;\r\n    if (encoding === \"ascii\") {\r\n        jsstr = decodeAscii(this.v, errors);\r\n    } else if (encoding === \"utf-8\") {\r\n        jsstr = decodeUtf(this.v, errors);\r\n    } else {\r\n        throw new Sk.builtin.LookupError(\"unknown encoding: \" + encoding);\r\n    }\r\n    return new Sk.builtin.str(jsstr);\r\n}\r\n\r\nfunction mkStartsEndsWith(funcname, is_match) {\r\n    return function (prefix, start, end) {\r\n        if (!(prefix instanceof Sk.builtin.bytes || prefix instanceof Sk.builtin.tuple)) {\r\n            throw new Sk.builtin.TypeError(funcname + \" first arg must be bytes or a tuple of bytes, not \" + Sk.abstr.typeName(prefix));\r\n        }\r\n        ({ start, end } = Sk.builtin.slice.startEnd$wrt(this, start, end));\r\n        if (end < start) {\r\n            return Sk.builtin.bool.false$;\r\n        }\r\n        const slice = this.v.subarray(start, end);\r\n\r\n        if (prefix instanceof Sk.builtin.tuple) {\r\n            for (let iter = Sk.abstr.iter(prefix), item = iter.tp$iternext(); item !== undefined; item = iter.tp$iternext()) {\r\n                item = this.get$raw(item);\r\n                if (is_match(slice, item)) {\r\n                    return Sk.builtin.bool.true$;\r\n                }\r\n            }\r\n            return Sk.builtin.bool.false$;\r\n        } else {\r\n            return is_match(slice, prefix.v) ? Sk.builtin.bool.true$ : Sk.builtin.bool.false$;\r\n        }\r\n    };\r\n}\r\n\r\nfunction mkFind(isReversed) {\r\n    return function find(tgt, start, end) {\r\n        tgt = this.get$tgt(tgt);\r\n        ({ start, end } = Sk.builtin.slice.startEnd$wrt(this, start, end));\r\n        if (end < start) {\r\n            return -1;\r\n        }\r\n        let idx;\r\n        if (typeof tgt === \"number\") {\r\n            idx = isReversed ? this.v.lastIndexOf(tgt, end - 1) : this.v.indexOf(tgt, start);\r\n            return idx >= start && idx < end ? idx : -1;\r\n        }\r\n        if (isReversed) {\r\n            return this.find$subright(tgt, start, end);\r\n        } else {\r\n            return this.find$subleft(tgt, start, end);\r\n        }\r\n    };\r\n}\r\n\r\nfunction mkPartition(isReversed) {\r\n    return function partition(sep) {\r\n        sep = this.get$raw(sep);\r\n        let pos;\r\n        if (isReversed) {\r\n            pos = this.find$subright(sep, 0, this.v.length);\r\n            if (pos < 0) {\r\n                return new Sk.builtin.tuple([new Sk.builtin.bytes(), new Sk.builtin.bytes(), this]);\r\n            }\r\n        } else {\r\n            pos = this.find$subleft(sep, 0, this.v.length);\r\n            if (pos < 0) {\r\n                return new Sk.builtin.tuple([this, new Sk.builtin.bytes(), new Sk.builtin.bytes()]);\r\n            }\r\n        }\r\n        return new Sk.builtin.tuple([\r\n            new Sk.builtin.bytes(this.v.subarray(0, pos)),\r\n            new Sk.builtin.bytes(sep),\r\n            new Sk.builtin.bytes(this.v.subarray(pos + sep.length)),\r\n        ]);\r\n    };\r\n}\r\n\r\nfunction mkStrip(isLeft, isRight) {\r\n    return function stripBytes(chars) {\r\n        let strip_chrs;\r\n        if (chars === undefined || chars === Sk.builtin.none.none$) {\r\n            // default is to remove ASCII whitespace\r\n            strip_chrs = new Uint8Array([9, 10, 11, 12, 13, 32, 133]);\r\n        } else {\r\n            strip_chrs = this.get$raw(chars);\r\n        }\r\n        let start = 0,\r\n            end = this.v.length;\r\n        if (isLeft) {\r\n            while (start < end && strip_chrs.includes(this.v[start])) {\r\n                start++;\r\n            }\r\n        }\r\n        if (isRight) {\r\n            while (end > start && strip_chrs.includes(this.v[end - 1])) {\r\n                end--;\r\n            }\r\n        }\r\n        const final = new Uint8Array(end - start);\r\n        for (let i = 0; i < final.length; i++) {\r\n            final[i] = this.v[i + start];\r\n        }\r\n        return new Sk.builtin.bytes(final);\r\n    };\r\n}\r\n\r\nfunction mkJust(funcname, isRight, isCenter) {\r\n    return function justify(width, fillbyte) {\r\n        if (fillbyte === undefined) {\r\n            fillbyte = 32;\r\n        } else if (!(fillbyte instanceof Sk.builtin.bytes) || fillbyte.v.length != 1) {\r\n            throw new Sk.builtin.TypeError(funcname + \"() argument 2 must be a byte string of length 1, not \" + Sk.abstr.typeName(fillbyte));\r\n        } else {\r\n            fillbyte = fillbyte.v[0];\r\n        }\r\n        const mylen = this.v.length;\r\n        width = Sk.misceval.asIndexSized(width, Sk.builtin.OverflowError);\r\n        if (width <= mylen) {\r\n            return new Sk.builtin.bytes(this.v);\r\n        }\r\n        const final = new Uint8Array(width);\r\n        let fill1, fill2;\r\n        if (isCenter) {\r\n            fill1 = Math.floor((width - mylen) / 2);\r\n            fill2 = (width - mylen) % 2 ? fill1 + 1 : fill1;\r\n        } else if (isRight) {\r\n            fill1 = width - mylen;\r\n            fill2 = 0;\r\n        } else {\r\n            fill1 = 0;\r\n            fill2 = width - mylen;\r\n        }\r\n        final.fill(fillbyte, 0, fill1);\r\n        for (let i = 0; i < mylen; i++) {\r\n            final[i + fill1] = this.v[i];\r\n        }\r\n        final.fill(fillbyte, width - fill2);\r\n        return new Sk.builtin.bytes(final);\r\n    };\r\n}\r\n\r\nfunction isspace(val) {\r\n    return (val >= 9 && val <= 13) || val === 32;\r\n}\r\nfunction islower(val) {\r\n    return val >= 97 && val <= 122;\r\n}\r\nfunction isupper(val) {\r\n    return val >= 65 && val <= 90;\r\n}\r\nfunction isdigit(val) {\r\n    return val >= 48 && val <= 57;\r\n}\r\n\r\nfunction checkSepMaxSplit(sep, maxsplit) {\r\n    maxsplit = Sk.misceval.asIndexSized(maxsplit, Sk.builtin.OverflowError);\r\n    maxsplit = maxsplit < 0 ? Infinity : maxsplit;\r\n\r\n    sep = Sk.builtin.checkNone(sep) ? null : this.get$raw(sep);\r\n    if (sep !== null && !sep.length) {\r\n        throw new Sk.builtin.ValueError(\"empty separator\");\r\n    }\r\n    return { sep: sep, maxsplit: maxsplit };\r\n}\r\n\r\nfunction mkIsAll(passTest, passesZero) {\r\n    return function isAll() {\r\n        if (this.v.length === 0) {\r\n            return passesZero ? Sk.builtin.bool.true$ : Sk.builtin.bool.false$;\r\n        }\r\n        return this.v.every((val) => passTest(val)) ? Sk.builtin.bool.true$ : Sk.builtin.bool.false$;\r\n    };\r\n}\r\n\r\nfunction makeIsUpperLower(passTest, failTest) {\r\n    return function () {\r\n        let flag = false;\r\n        for (let i = 0; i < this.v.length; i++) {\r\n            if (failTest(this.v[i])) {\r\n                return Sk.builtin.bool.false$;\r\n            }\r\n            if (!flag && passTest(this.v[i])) {\r\n                flag = true;\r\n            }\r\n        }\r\n        return flag ? Sk.builtin.bool.true$ : Sk.builtin.bool.false$;\r\n    };\r\n}\r\n\r\nfunction mkCaseSwitch(switchCase) {\r\n    return function lowerUpperSwapCase() {\r\n        const final = new Uint8Array(this.v.length);\r\n        for (let i = 0; i < this.v.length; i++) {\r\n            final[i] = switchCase(this.v[i]);\r\n        }\r\n        return new Sk.builtin.bytes(final);\r\n    };\r\n}\r\n\r\n/**\r\n * @constructor\r\n * @param {Sk.builtin.bytes} bytes\r\n */\r\nvar bytes_iter_ = Sk.abstr.buildIteratorClass(\"bytes_iterator\", {\r\n    constructor: function bytes_iter_(bytes) {\r\n        this.$index = 0;\r\n        this.$seq = bytes.v;\r\n    },\r\n    iternext() {\r\n        const next = this.$seq[this.$index++];\r\n        if (next === undefined) {\r\n            return undefined;\r\n        }\r\n        return new Sk.builtin.int_(next);\r\n    },\r\n    methods: {\r\n        __length_hint__: Sk.generic.iterLengthHintWithArrayMethodDef,\r\n    },\r\n    flags: { sk$unacceptableBase: true },\r\n});\r\n\r\nSk.exportSymbol(\"Sk.builtin.bytes\", Sk.builtin.bytes);\r\n","/**\r\n * Check arguments to Python functions to ensure the correct number of\r\n * arguments are passed.\r\n *\r\n * @param {string} name the name of the function\r\n * @param {Object} args the args passed to the function\r\n * @param {number} minargs the minimum number of allowable arguments\r\n * @param {number=} maxargs optional maximum number of allowable\r\n * arguments (default: Infinity)\r\n * @param {boolean=} kwargs optional true if kwargs, false otherwise\r\n * (default: false)\r\n * @param {boolean=} free optional true if free vars, false otherwise\r\n * (default: false)\r\n */\r\nSk.builtin.pyCheckArgs = function (name, args, minargs, maxargs, kwargs, free) {\r\n    var nargs = args.length;\r\n    var msg = \"\";\r\n\r\n    if (maxargs === undefined) {\r\n        maxargs = Infinity;\r\n    }\r\n    if (kwargs) {\r\n        nargs -= 1;\r\n    }\r\n    if (free) {\r\n        nargs -= 1;\r\n    }\r\n    if (nargs < minargs || nargs > maxargs) {\r\n        if (minargs === maxargs) {\r\n            msg = name + \"() takes exactly \" + minargs + \" arguments\";\r\n        } else if (nargs < minargs) {\r\n            msg = name + \"() takes at least \" + minargs + \" arguments\";\r\n        } else if (minargs > 0) {\r\n            msg = name + \"() takes at most \" + maxargs + \" arguments\";\r\n        } else {\r\n            msg = name + \"() takes no arguments\";\r\n        }\r\n        msg += \" (\" + nargs + \" given)\";\r\n        throw new Sk.builtin.TypeError(msg);\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.builtin.pyCheckArgs\", Sk.builtin.pyCheckArgs);\r\n\r\n/**\r\n * Check arguments to Python functions to ensure the correct number of\r\n * arguments are passed.\r\n *\r\n * @param {string} name the name of the function\r\n * @param {number} nargs the args passed to the function\r\n * @param {number} minargs the minimum number of allowable arguments\r\n * @param {number=} maxargs optional maximum number of allowable\r\n * arguments (default: Infinity)\r\n * @param {boolean=} kwargs optional true if kwargs, false otherwise\r\n * (default: false)\r\n * @param {boolean=} free optional true if free vars, false otherwise\r\n * (default: false)\r\n */\r\nSk.builtin.pyCheckArgsLen = function (name, nargs, minargs, maxargs, kwargs, free) {\r\n    var msg = \"\";\r\n\r\n    if (maxargs === undefined) {\r\n        maxargs = Infinity;\r\n    }\r\n    if (kwargs) {\r\n        nargs -= 1;\r\n    }\r\n    if (free) {\r\n        nargs -= 1;\r\n    }\r\n    if (nargs < minargs || nargs > maxargs) {\r\n        if (minargs === maxargs) {\r\n            msg = name + \"() takes exactly \" + minargs + \" arguments\";\r\n        } else if (nargs < minargs) {\r\n            msg = name + \"() takes at least \" + minargs + \" arguments\";\r\n        } else {\r\n            msg = name + \"() takes at most \" + maxargs + \" arguments\";\r\n        }\r\n        msg += \" (\" + nargs + \" given)\";\r\n        throw new Sk.builtin.TypeError(msg);\r\n    }\r\n};\r\n\r\n/**\r\n * Check type of argument to Python functions.\r\n *\r\n * @param {string} name the name of the argument\r\n * @param {string} exptype string of the expected type name\r\n * @param {boolean} check truthy if type check passes, falsy otherwise\r\n */\r\nSk.builtin.pyCheckType = function (name, exptype, check) {\r\n    if (!check) {\r\n        throw new Sk.builtin.TypeError(name + \" must be a \" + exptype);\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.builtin.pyCheckType\", Sk.builtin.pyCheckType);\r\n\r\n/**\r\n * @function\r\n * @param {*} arg\r\n *\r\n * @description\r\n * Does the arg have a valid `__getitem__` method?\r\n */\r\nSk.builtin.checkSequence = function (arg) {\r\n    return arg != null && arg.mp$subscript !== undefined;\r\n};\r\nSk.exportSymbol(\"Sk.builtin.checkSequence\", Sk.builtin.checkSequence);\r\n\r\n/**\r\n * @description\r\n * Use this to test whether or not a Python object is iterable.  You should **not** rely\r\n * on the presence of tp$iter on the object as a good test, as it could be a user defined\r\n * class with `__iter__` defined or ``__getitem__``  This tests for all of those cases\r\n *\r\n * Note in most cases it will be more pragmatic to simply call {@link Sk.abstr.iter} which will\r\n * throw the appropriate error if the pyObject is not iterable. \r\n *\r\n * @param arg {Object}   A Python object\r\n * @returns {boolean} true if the object is iterable\r\n */\r\nSk.builtin.checkIterable = function (arg) {\r\n    if (arg === undefined) {\r\n                return false;\r\n            }\r\n    if (arg.tp$iter) {\r\n        const iter = arg.tp$iter();\r\n        return iter.tp$iternext !== undefined;\r\n        }\r\n    return arg.mp$subscript !== undefined;\r\n};\r\nSk.exportSymbol(\"Sk.builtin.checkIterable\", Sk.builtin.checkIterable);\r\n\r\n/**\r\n * @function\r\n * @param {*} obj\r\n */\r\nSk.builtin.checkCallable = function (obj) {\r\n    // takes care of builtin functions and methods, builtins\r\n    return obj != null && obj.tp$call !== undefined;\r\n};\r\n\r\n/**\r\n * @function\r\n * @description\r\n * Is the object an instance of {@link Sk.builtin.int_} or {@link Sk.builtin.float_}\r\n *\r\n * @param {*} arg\r\n */\r\nSk.builtin.checkNumber = function (arg) {\r\n    return typeof arg === \"number\" || arg instanceof Sk.builtin.int_ || arg instanceof Sk.builtin.float_ || arg instanceof Sk.builtin.lng;\r\n};\r\nSk.exportSymbol(\"Sk.builtin.checkNumber\", Sk.builtin.checkNumber);\r\n\r\n/**\r\n * @description\r\n * Is the arg an instance of {@link Sk.builtin.complex}\r\n */\r\nSk.builtin.checkComplex = function (arg) {\r\n    return arg instanceof Sk.builtin.complex;\r\n};\r\nSk.exportSymbol(\"Sk.builtin.checkComplex\", Sk.builtin.checkComplex);\r\n\r\n/**\r\n * @description\r\n * Supports both JS Number and pyObject\r\n * @param {*} arg\r\n */\r\nSk.builtin.checkInt = function (arg) {\r\n    return arg instanceof Sk.builtin.int_ || (typeof arg === \"number\" && Number.isInteger(arg));\r\n};\r\nSk.exportSymbol(\"Sk.builtin.checkInt\", Sk.builtin.checkInt);\r\n\r\n/**\r\n * @description\r\n * Is the arg an instance of {@link Sk.builtin.float_}\r\n * @param {*} arg\r\n */\r\nSk.builtin.checkFloat = function (arg) {\r\n    return arg instanceof Sk.builtin.float_;\r\n};\r\nSk.exportSymbol(\"Sk.builtin.checkFloat\", Sk.builtin.checkFloat);\r\n\r\n/**\r\n * @description\r\n * Is the arg an instance of {@link Sk.builtin.str}\r\n * @param {*} arg\r\n */\r\nSk.builtin.checkString = function (arg) {\r\n    return arg instanceof Sk.builtin.str;\r\n};\r\nSk.exportSymbol(\"Sk.builtin.checkString\", Sk.builtin.checkString);\r\n\r\n/**\r\n * @description\r\n * Is the arg an instance of {@link Sk.builtin.bytes}\r\n * @param {*} arg \r\n */\r\nSk.builtin.checkBytes = function (arg) {\r\n    return arg instanceof Sk.builtin.bytes;\r\n};\r\n\r\n\r\n/**\r\n * Is the arg an instance of {@link Sk.builtin.type}\r\n * @param {*} arg\r\n */\r\nSk.builtin.checkClass = function (arg) {\r\n    return arg instanceof Sk.builtin.type;\r\n};\r\nSk.exportSymbol(\"Sk.builtin.checkClass\", Sk.builtin.checkClass);\r\n\r\n/**\r\n * @description\r\n * Is the arg an instance of {@link Sk.builtin.bool}\r\n * @param {*} arg\r\n */\r\nSk.builtin.checkBool = function (arg) {\r\n    return arg instanceof Sk.builtin.bool;\r\n};\r\nSk.exportSymbol(\"Sk.builtin.checkBool\", Sk.builtin.checkBool);\r\n\r\nSk.builtin.checkNone = function (arg) {\r\n    return arg === Sk.builtin.none.none$;\r\n};\r\nSk.exportSymbol(\"Sk.builtin.checkNone\", Sk.builtin.checkNone);\r\n\r\n/**\r\n * @description\r\n * Is the arg callable?\r\n * @param {*} arg\r\n */\r\nSk.builtin.checkFunction = function (arg) {\r\n    return arg != null && arg.tp$call !== undefined;\r\n};\r\nSk.exportSymbol(\"Sk.builtin.checkFunction\", Sk.builtin.checkFunction);\r\n\r\nSk.builtin.checkDataDescr = function (arg) {\r\n    return arg && arg.tp$descr_set !== undefined;\r\n};\r\nSk.exportSymbol(\"Sk.builtin.checkDataDescr\", Sk.builtin.checkDataDescr);\r\n\r\n/**\r\n * @description\r\n * Is the arg ain instance of {@link Sk.builtin.set} or {@link Sk.builtin.frozenset}\r\n * @param {*} arg\r\n */\r\nSk.builtin.checkAnySet = function (arg) {\r\n    return arg instanceof Sk.builtin.set || arg instanceof Sk.builtin.frozenset;\r\n};\r\n\r\nSk.builtin.checkMapping = function (arg) {\r\n    return (\r\n        arg instanceof Sk.builtin.dict ||\r\n        arg instanceof Sk.builtin.mappingproxy ||\r\n        (arg != null && arg.mp$subscript !== undefined && Sk.abstr.lookupSpecial(arg, Sk.builtin.str.$keys) !== undefined)\r\n    );\r\n};","/** @param {...*} x */\r\nvar out;\r\n\r\nSk.gensymcount = 0;\r\n\r\n/**\r\n * @constructor\r\n * @param {string} filename\r\n * @param {SymbolTable} st\r\n * @param {number} flags\r\n * @param {boolean=} canSuspend whether compiled code can suspend\r\n * @param {string=} sourceCodeForAnnotation used to add original source to listing if desired\r\n */\r\nfunction Compiler(filename, st, flags, canSuspend, sourceCodeForAnnotation) {\r\n    this.filename = filename;\r\n    this.st = st;\r\n    this.flags = flags;\r\n    this.canSuspend = canSuspend;\r\n    this.interactive = false;\r\n    this.nestlevel = 0;\r\n\r\n    this.u = null;\r\n    this.consts = {};\r\n    this.stack = [];\r\n\r\n    this.result = [];\r\n\r\n    // this.gensymcount = 0;\r\n\r\n    this.allUnits = [];\r\n\r\n    this.source = sourceCodeForAnnotation ? sourceCodeForAnnotation.split(\"\\n\") : false;\r\n    this.retainComments = false;\r\n}\r\n\r\n/**\r\n * @constructor\r\n *\r\n * Stuff that changes on entry/exit of code blocks. must be saved and restored\r\n * when returning to a block.\r\n *\r\n * Corresponds to the body of a module, class, or function.\r\n *\r\n * Effectively a frame.\r\n */\r\n\r\nfunction CompilerUnit() {\r\n    this.ste = null;\r\n    this.name = null;\r\n    this.canSuspend = false;\r\n    this.doesSuspend = false;\r\n\r\n    this.private_ = null;\r\n    this.firstlineno = 0;\r\n    this.lineno = 0;\r\n    this.linenoSet = false;\r\n    this.localnames = [];\r\n\r\n    this.localtemps = [];\r\n    this.tempsToSave = [];\r\n\r\n    this.blocknum = 0;\r\n    this.blocks = [];\r\n    this.curblock = 0;\r\n\r\n    //this.consts = {};\r\n\r\n    this.scopename = null;\r\n\r\n    this.prefixCode = \"\";\r\n    this.varDeclsCode = \"\";\r\n    this.switchCode = \"\";\r\n    this.suffixCode = \"\";\r\n\r\n    // stack of where to go on a break\r\n    this.breakBlocks = [];\r\n    // stack of where to go on a continue\r\n    this.continueBlocks = [];\r\n    this.exceptBlocks = [];\r\n    // state of where to go on a return\r\n    this.finallyBlocks = [];\r\n}\r\n\r\nfunction get_context(ctx) {\r\n    return [ctx.lineno, ctx.col_offset, ctx.end_lineno, ctx.end_col_offset ];\r\n}\r\n\r\nCompilerUnit.prototype.activateScope = function () {\r\n    var self = this;\r\n\r\n    out = function () {\r\n        var i;\r\n        var b = self.blocks[self.curblock];\r\n        if (b._next === null) {\r\n            for (i = 0; i < arguments.length; ++i) {\r\n                b.push(arguments[i]);\r\n            }\r\n        }\r\n        // TODO: Warn about unreachable code after an unconditional jump?\r\n    };\r\n};\r\n\r\nCompiler.prototype.getSourceLine = function (lineno) {\r\n    Sk.asserts.assert(this.source);\r\n    return this.source[lineno - 1];\r\n};\r\n\r\nCompiler.prototype.annotateSource = function (ast, shouldStep) {\r\n    var i;\r\n    var col_offset;\r\n    var lineno;\r\n    var sourceLine;\r\n    if (this.source) {\r\n        const astName = ast._astname;\r\n        lineno = ast.lineno;\r\n        col_offset = ast.col_offset;\r\n        sourceLine = this.getSourceLine(lineno);\r\n        Sk.asserts.assert(ast.lineno !== undefined && ast.col_offset !== undefined);\r\n        let isDocstring = !!(ast.constructor === Sk.astnodes.Expr &&\r\n                             ast.value.constructor === Sk.astnodes.Str);\r\n        // Do not trace the standard library\r\n        if (shouldStep && (!this.filename ||\r\n            !this.filename.startsWith(\"src/lib/\"))) {\r\n            out(\"\\n$currLineNo=\", lineno, \";$currColNo=\", col_offset, \";\");\r\n            // TODO: Make filename a module-global, and update it via that quickly.\r\n            // JSON.stringify(sourceLine)\r\n            let chompedLine = sourceLine;\r\n            if (chompedLine.length > 24) {chompedLine = chompedLine.substr(0, 24)+\"...\";}\r\n            out(\"Sk.currFilename=$fname;$currSource=\", JSON.stringify(chompedLine), \";\");\r\n            out(`Sk.afterSingleExecution && Sk.afterSingleExecution($gbl,$getLocals(),${lineno}, ${col_offset}, $fname, ${isDocstring}, '${astName}');\\n`);\r\n        }\r\n    }\r\n};\r\n\r\nCompiler.prototype.gensym = function (hint) {\r\n    hint = hint || \"\";\r\n    hint = \"$\" + hint;\r\n    hint += Sk.gensymcount++;\r\n    return hint;\r\n};\r\n\r\nCompiler.prototype.niceName = function (roughName) {\r\n    return this.gensym(roughName.replace(\"<\", \"\").replace(\">\", \"\").replace(\" \", \"_\"));\r\n};\r\n\r\nvar reservedWords_ = Sk.builtin.str.reservedWords_; // defined in str.js\r\n\r\n\r\nfunction fixReserved(name) {\r\n    if (reservedWords_[name] === undefined) {\r\n        return name;\r\n    }\r\n    return name + \"_$rw$\";\r\n}\r\n\r\nfunction unfixReserved(name) {\r\n    return name.replace(/_\\$rw\\$$/, \"\");\r\n}\r\n\r\nfunction mangleName(priv, ident) {\r\n    var name = ident.v;\r\n    var strpriv = null;\r\n\r\n\r\n    if (priv === null || name === null || name.charAt(0) !== \"_\" || name.charAt(1) !== \"_\") {\r\n        return ident;\r\n    }\r\n    // don't mangle __id__\r\n    if (name.charAt(name.length - 1) === \"_\" && name.charAt(name.length - 2) === \"_\") {\r\n        return ident;\r\n    }\r\n    // don't mangle classes that are all _ (obscure much?)\r\n    strpriv = priv.v;\r\n    strpriv.replace(/_/g, \"\");\r\n    if (strpriv === \"\") {\r\n        return ident;\r\n    }\r\n\r\n    strpriv = priv.v;\r\n    strpriv.replace(/^_*/, \"\");\r\n    strpriv = new Sk.builtin.str(\"_\" + strpriv + name);\r\n    return strpriv;\r\n}\r\n\r\n/**\r\n * @param {...*} rest\r\n */\r\nCompiler.prototype.makeConstant = function (rest) {\r\n    var i;\r\n    var v;\r\n    var val = \"\";\r\n    var cval;\r\n\r\n    // Construct constant value\r\n    for (i = 0; i < arguments.length; ++i) {\r\n        val += arguments[i];\r\n    }\r\n\r\n    // Check if we've already defined this exact constant\r\n    for (var constant in this.consts) {\r\n        if (this.consts.hasOwnProperty(constant)) {\r\n            cval = this.consts[constant];\r\n            if (cval == val) {\r\n                // We have, just use it\r\n                return constant;\r\n            }\r\n        }\r\n    }\r\n\r\n    // We have not, build new one\r\n    v = \"$moduleConstants\" + \".\" + this.gensym(\"_\");\r\n    this.consts[v] = val;\r\n    return v;\r\n};\r\n\r\n/**\r\n * @param {string} hint basename for gensym\r\n * @param {...*} rest\r\n */\r\nCompiler.prototype._gr = function (hint, rest) {\r\n    var i;\r\n    var v = this.gensym(hint);\r\n    this.u.localtemps.push(v);\r\n    out(\"var \", v, \"=\");\r\n    for (i = 1; i < arguments.length; ++i) {\r\n        out(arguments[i]);\r\n    }\r\n    out(\";\");\r\n    return v;\r\n};\r\n\r\n/**\r\n * Function to test if an interrupt should occur if the program has been running for too long.\r\n * This function is executed at every test/branch operation.\r\n */\r\nCompiler.prototype.outputInterruptTest = function () { // Added by RNL\r\n    var output = \"\";\r\n    if (Sk.execLimit !== null || Sk.yieldLimit !== null && this.u.canSuspend) {\r\n        output += \"var $dateNow = Date.now();\";\r\n        //output += \"console.log($dateNow, Sk.execStart, Sk.execPaused, Sk.execPausedAmount, $dateNow-Sk.execStart-Sk.execPausedAmount, Sk.execLimit, );\";\r\n        if (Sk.execLimit !== null) {\r\n            //output += (\"if (Sk.execLimit !== null && $dateNow - Sk.execStart - Sk.execPausedAmount > Sk.execLimit){\" +\r\n            //    \"throw new Sk.builtin.TimeoutError(Sk.timeoutMsg())}\");\r\n            output += \"Sk.misceval.timeoutCheck($dateNow);\";\r\n        }\r\n        if (Sk.yieldLimit !== null && this.u.canSuspend) {\r\n            output += \"if ($dateNow - Sk.lastYield > Sk.yieldLimit) {\";\r\n            output += \"var $susp = $saveSuspension($mys(), $fname,$currLineNo,$currColNo, $currSource);\";\r\n            output += \"$susp.$blk = $blk;\";\r\n            output += \"$susp.optional = true;\";\r\n            output += \"return $susp;\";\r\n            output += \"}\";\r\n            this.u.doesSuspend = true;\r\n        }\r\n    }\r\n    return output;\r\n};\r\n\r\nCompiler.prototype._jumpfalse = function (test, block) {\r\n    var cond = this._gr(\"jfalse\", \"(\", test, \"===false||!Sk.misceval.isTrue(\", test, \"))\");\r\n    out(\"if(\", cond, \"){/*test failed */$blk=\", block, \";continue;}\");\r\n};\r\n\r\nCompiler.prototype._jumpundef = function (test, block) {\r\n    out(\"if(\", test, \"===undefined){$blk=\", block, \";continue;}\");\r\n};\r\n\r\nCompiler.prototype._jumpnotundef = function (test, block) {\r\n    out(\"if(\", test, \"!==undefined){$blk=\", block, \";continue;}\");\r\n};\r\n\r\nCompiler.prototype._jumptrue = function (test, block) {\r\n    var cond = this._gr(\"jtrue\", \"(\", test, \"===true||Sk.misceval.isTrue(\", test, \"))\");\r\n    out(\"if(\", cond, \"){/*test passed */$blk=\", block, \";continue;}\");\r\n};\r\n\r\nCompiler.prototype._jump = function (block) {\r\n    if (this.u.blocks[this.u.curblock]._next === null) {\r\n        out(\"$blk=\", block, \";\");\r\n        this.u.blocks[this.u.curblock]._next = block;\r\n    }\r\n};\r\n\r\n/**\r\n * @param {Object=} e Object with keys 'lineno' and 'col_offset'\r\n */\r\nCompiler.prototype._checkSuspension = function (e) {\r\n    var retblk;\r\n    if (this.u.canSuspend) {\r\n\r\n        retblk = this.newBlock(\"function return or resume suspension\");\r\n        this._jump(retblk);\r\n        this.setBlock(retblk);\r\n\r\n        e = e || {lineno: \"$currLineNo\", col_offset: \"$currColNo\", source: \"$currSource\"};\r\n\r\n        out(\"if ($ret && $ret.$isSuspension) { return $saveSuspension($ret,$fname,\" + e.lineno + \",\" + e.col_offset + \",\" + e.source + \"); }\");\r\n\r\n        this.u.doesSuspend = true;\r\n        this.u.tempsToSave = this.u.tempsToSave.concat(this.u.localtemps);\r\n\r\n    } else {\r\n        out(\"if ($ret && $ret.$isSuspension) { $ret = Sk.misceval.retryOptionalSuspensionOrThrow($ret); }\");\r\n    }\r\n};\r\nCompiler.prototype.cunpackstarstoarray = function (elts, permitEndOnly) {\r\n    if (!elts || elts.length == 0) {\r\n        return \"[]\";\r\n    }\r\n\r\n    let hasStars = false;\r\n    // If there are no stars, we have a nice fast path here\r\n    for (let elt of elts) {\r\n        if (permitEndOnly && hasStars) {\r\n            throw new Sk.builtin.SyntaxError(\"Extended argument unpacking is not permitted in Python 2\");\r\n        }\r\n        if (elt.constructor === Sk.astnodes.Starred) {\r\n            hasStars = true;\r\n        }\r\n    }\r\n\r\n    if (hasStars) {\r\n        // Slow path\r\n        let arr = this._gr(\"unpack\", \"[]\");\r\n        for (let elt of elts) {\r\n            if (elt.constructor !== Sk.astnodes.Starred) {\r\n                out(arr, \".push(\", this.vexpr(elt), \");\");\r\n            } else {\r\n                out(\"$ret = Sk.misceval.iterFor(Sk.abstr.iter(\", this.vexpr(elt.value), \"), function(e) { \", arr, \".push(e); });\");\r\n                this._checkSuspension();\r\n            }\r\n        }\r\n        return arr;\r\n    } else {\r\n        // Fast path\r\n        return \"[\" + elts.map((expr) => this.vexpr(expr)).join(\",\") + \"]\";\r\n    }\r\n};\r\n\r\nCompiler.prototype.ctuplelistorset = function (e, data, tuporlist) {\r\n    var i;\r\n    var items;\r\n    var item;\r\n    var allconsts;\r\n    Sk.asserts.assert(tuporlist === \"tuple\" || tuporlist === \"list\" || tuporlist === \"set\");\r\n\r\n    let hasStars = false;\r\n    let starIdx;\r\n    for (i = 0; i < e.elts.length; i++) {\r\n        if (e.elts[i].constructor === Sk.astnodes.Starred) {\r\n            hasStars = true;\r\n            starIdx = i;\r\n            break;\r\n        }\r\n    }\r\n\r\n    if (e.ctx === Sk.astnodes.Store) {\r\n        if (hasStars) {\r\n            if (!Sk.__future__.python3) {\r\n                throw new Sk.builtin.SyntaxError(\"assignment unpacking with stars is not supported in Python 2\", this.filename, e.lineno);\r\n            }\r\n            for (i = starIdx + 1; i < e.elts.length; i++) {\r\n                if (e.elts[i].constructor === Sk.astnodes.Starred) {\r\n                    throw new Sk.builtin.SyntaxError(\"multiple starred expressions in assignment\", this.filename, e.lineno, ...get_context(e));\r\n                }\r\n        }\r\n        }\r\n        const breakIdx = hasStars ? starIdx : e.elts.length;\r\n        const numvals = hasStars ? e.elts.length - 1 : breakIdx;\r\n        out(\"$ret = Sk.abstr.sequenceUnpack(\" + data + \",\" + breakIdx + \",\" + numvals + \", \" + hasStars + \");\");\r\n        this._checkSuspension();\r\n        items = this._gr(\"items\", \"$ret\");\r\n        \r\n        for (i = 0; i < e.elts.length; ++i) {\r\n            if (i === starIdx) {\r\n                this.vexpr(e.elts[i].value, items + \"[\" + i + \"]\");\r\n            } else {\r\n            this.vexpr(e.elts[i], items + \"[\" + i + \"]\");\r\n        }\r\n        }\r\n    } else if (e.ctx === Sk.astnodes.Load || tuporlist === \"set\") {\r\n        //because set's can't be assigned to.\r\n\r\n        if (hasStars) {\r\n            if (!Sk.__future__.python3) {\r\n                throw new Sk.builtin.SyntaxError(\"List packing with stars is not supported in Python 2\");\r\n            }\r\n            return this._gr(\"load\" + tuporlist, \"new Sk.builtins['\", tuporlist, \"'](\", this.cunpackstarstoarray(e.elts), \")\");\r\n        } else if (tuporlist === \"tuple\") {\r\n            allconsts = true;\r\n            items = [];\r\n            for (i = 0; i < e.elts.length; ++i) {\r\n                item = this.vexpr(e.elts[i]);\r\n\r\n                // The following is an ugly check to see if item was\r\n                // turned into a constant.  As vexpr returns a string,\r\n                // this requires seeing if \"$const\" is contained\r\n                // within it.  A better solution would require a\r\n                // change to vexpr, which would be more invasive.\r\n                if (allconsts && (item.indexOf(\"$const\") == -1)) {\r\n                    allconsts = false;\r\n                }\r\n                items.push(item);\r\n            }\r\n\r\n            if (allconsts) {\r\n                return this.makeConstant(\"new Sk.builtin.tuple([\" + items + \"])\");\r\n            } else {\r\n                for (i = 0; i < items.length; ++i) {\r\n                    items[i] = this._gr(\"elem\", items[i]);\r\n                }\r\n                return this._gr(\"load\" + tuporlist, \"new Sk.builtins['\", tuporlist, \"']([\", items, \"])\");\r\n            }\r\n        } else {\r\n            items = [];\r\n            for (i = 0; i < e.elts.length; ++i) {\r\n                items.push(this._gr(\"elem\", this.vexpr(e.elts[i])));\r\n            }\r\n            return this._gr(\"load\" + tuporlist, \"new Sk.builtins['\", tuporlist, \"']([\", items, \"])\");\r\n        }\r\n    }\r\n};\r\n\r\nCompiler.prototype.csubdict = function(e, begin, end) {\r\n    const items = [];\r\n    for (let i = begin; i < end; i++) {\r\n            items.push(this.vexpr(e.keys[i]));\r\n        items.push(this.vexpr(e.values[i])); \r\n    }\r\n    return this._gr(\"loaddict\", \"new Sk.builtins['dict']([\", items, \"])\");\r\n}\r\n\r\nCompiler.prototype.cdict = function (e) {\r\n    let have_dict = 0;\r\n    let is_unpacking = false;\r\n    const n = e.values ? e.values.length : 0;\r\n    let elements = 0;\r\n    let main_dict;\r\n    let sub_dict;\r\n\r\n    for (let i = 0; i<n; i++) {\r\n        is_unpacking = e.keys[i] === null;\r\n        if (is_unpacking) {\r\n            if (elements) {\r\n                sub_dict = this.csubdict(e, i-elements, i);\r\n                if (have_dict) {\r\n                    out(main_dict, \".dict$merge(\", sub_dict, \");\");\r\n                    // update the current dict (this won't suspend)\r\n                } else {\r\n                    main_dict = sub_dict;\r\n                    have_dict = 1;\r\n                }\r\n                elements = 0;\r\n            }\r\n            if (have_dict === 0) {\r\n                main_dict = this._gr(\"loaddict\", \"new Sk.builtins.dict([])\");\r\n                have_dict = 1;\r\n            }\r\n            sub_dict = this.vexpr(e.values[i]);\r\n            out(\"$ret = \", main_dict, \".dict$merge(\", sub_dict, \");\");\r\n            this._checkSuspension(e);\r\n            // could suspend\r\n        } else {\r\n            elements ++;\r\n        }\r\n    }\r\n    if (elements) {\r\n        sub_dict = this.csubdict(e, n-elements, n)\r\n        if (have_dict) {\r\n            out(main_dict, \".dict$merge(\", sub_dict, \");\");\r\n            // update the current dict (this won't suspend)\r\n        } else {\r\n            main_dict = sub_dict;\r\n            have_dict = 1;\r\n        }\r\n    }\r\n    if (have_dict === 0) {\r\n        // add op buildmap\r\n        main_dict = this._gr(\"loaddict\", \"new Sk.builtins.dict([])\");\r\n    }\r\n    return main_dict;\r\n};\r\n\r\nCompiler.prototype.clistcomp = function (e) {\r\n    Sk.asserts.assert(e instanceof Sk.astnodes.ListComp);\r\n    var tmp = this._gr(\"_compr\", \"new Sk.builtins['list']([])\"); // note: _ is impt. for hack in name mangling (same as cpy)\r\n    return this.ccompgen(\"list\", tmp, e.generators, 0, e.elt, null, e);\r\n};\r\n\r\nCompiler.prototype.cdictcomp = function (e) {\r\n    Sk.asserts.assert(e instanceof Sk.astnodes.DictComp);\r\n    var tmp = this._gr(\"_dcompr\", \"new Sk.builtins.dict([])\");\r\n    return this.ccompgen(\"dict\", tmp, e.generators, 0, e.value, e.key, e);\r\n};\r\n\r\nCompiler.prototype.csetcomp = function (e) {\r\n    Sk.asserts.assert(e instanceof Sk.astnodes.SetComp);\r\n    var tmp = this._gr(\"_setcompr\", \"new Sk.builtins.set([])\");\r\n    return this.ccompgen(\"set\", tmp, e.generators, 0, e.elt, null, e);\r\n};\r\n\r\nCompiler.prototype.ccompgen = function (type, tmpname, generators, genIndex, value, key, e) {\r\n    var start = this.newBlock(type + \" comp start\");\r\n    var skip = this.newBlock(type + \" comp skip\");\r\n    var anchor = this.newBlock(type + \" comp anchor\");\r\n\r\n    var l = generators[genIndex];\r\n    var toiter = this.vexpr(l.iter);\r\n    var iter = this._gr(\"iter\", \"Sk.abstr.iter(\", toiter, \")\");\r\n    var lvalue;\r\n    var lkey;\r\n    var ifres;\r\n    var i;\r\n    var target;\r\n    var nexti;\r\n    var n;\r\n\r\n    this._jump(start);\r\n    this.setBlock(start);\r\n\r\n    // load targets\r\n    out(\"$ret = Sk.abstr.iternext(\", iter, \", true);\");\r\n\r\n    this._checkSuspension(e);\r\n\r\n    nexti = this._gr(\"next\", \"$ret\");\r\n    this._jumpundef(nexti, anchor); // todo; this should be handled by StopIteration\r\n    target = this.vexpr(l.target, nexti);\r\n\r\n    n = l.ifs ? l.ifs.length : 0;\r\n    for (i = 0; i < n; ++i) {\r\n        ifres = this.vexpr(l.ifs[i]);\r\n        this._jumpfalse(ifres, start);\r\n    }\r\n\r\n    if (++genIndex < generators.length) {\r\n        this.ccompgen(type, tmpname, generators, genIndex, value, key, e);\r\n    }\r\n\r\n    if (genIndex >= generators.length) {\r\n        lvalue = this.vexpr(value);\r\n        if (type === \"dict\") {\r\n            lkey = this.vexpr(key);\r\n            out(tmpname, \".mp$ass_subscript(\", lkey, \",\", lvalue, \");\");\r\n        } else if (type === \"list\") {\r\n            out(tmpname, \".v.push(\", lvalue, \");\"); // todo;\r\n        } else if (type === \"set\") {\r\n            out(tmpname, \".v.mp$ass_subscript(\", lvalue, \", true);\");\r\n        }\r\n        this._jump(skip);\r\n        this.setBlock(skip);\r\n    }\r\n\r\n    this._jump(start);\r\n\r\n    this.setBlock(anchor);\r\n\r\n    return tmpname;\r\n};\r\n\r\nCompiler.prototype.cyield = function (e) {\r\n    if (this.u.ste.blockType !== Sk.SYMTAB_CONSTS.FunctionBlock) {\r\n        throw new Sk.builtin.SyntaxError(\"'yield' outside function\", this.filename, e.lineno, ...get_context(e));\r\n    }\r\n    var val = \"Sk.builtin.none.none$\",\r\n        nextBlock;\r\n    if (e.value) {\r\n        val = this.vexpr(e.value);\r\n    }\r\n    nextBlock = this.newBlock(\"after yield\");\r\n    // return a pair: resume target block and yielded value\r\n    out(\"return [/*resume*/\", nextBlock, \",/*ret*/\", val, \"];\");\r\n    this.setBlock(nextBlock);\r\n    return \"$gen.gi$sentvalue\"; // will either be none if none sent, or the value from gen.send(value)\r\n};\r\n\r\nCompiler.prototype.cyieldfrom = function (e) {\r\n    if (this.u.ste.blockType !== Sk.SYMTAB_CONSTS.FunctionBlock) {\r\n        throw new Sk.builtin.SyntaxError(\"'yield' outside function\", this.filename, e.lineno, ...get_context(e));\r\n    }\r\n    let iterable = this.vexpr(e.value);\r\n    // get the iterator we are yielding from and store it\r\n    iterable = this._gr(\"iter\", \"Sk.abstr.iter(\", iterable, \")\");\r\n    out(\"$gen.\" + iterable + \"=\", iterable, \";\");\r\n    var afterIter = this.newBlock(\"after iter\");\r\n    var afterBlock = this.newBlock(\"after yield from\");\r\n    this._jump(afterIter);\r\n    this.setBlock(afterIter);\r\n    var retval = this.gensym(\"retval\");\r\n    // We may have entered this block resuming from a yield\r\n    // So get the iterable stored on $gen.\r\n    out(iterable, \"=$gen.\", iterable, \";\");\r\n    out(\"var \", retval, \";\");\r\n    // fast path -> we're sending None (not sending a value)\r\n    // or we use gen.tp$iternext(true, val) (see generator.js) which is the equivalent of gen.send(val)\r\n    out(\"if ($gen.gi$sentvalue === Sk.builtin.none.none$ || \" + iterable + \".constructor === Sk.builtin.generator) {\");\r\n    out(    \"$ret=\", iterable, \".tp$iternext(true, $gen.gi$sentvalue);\");\r\n    out(\"} else {\");\r\n    var send = this.makeConstant(\"new Sk.builtin.str('send');\");\r\n    // slow path -> get the send method of the non-generator iterator and call it\r\n    // throw anything other than a StopIteration\r\n    out(    \"$ret=Sk.misceval.tryCatch(\");\r\n    out(        \"function(){\");\r\n    out(            \"return Sk.misceval.callsimOrSuspendArray(Sk.abstr.gattr(\", iterable, \",\", send, \"), [$gen.gi$sentvalue]);},\");\r\n    out(        \"function (e) { \");\r\n    out(            \"if (e instanceof Sk.builtin.StopIteration) { \");\r\n    out(                    iterable ,\".gi$ret = e.$value;\");\r\n                            // store the return value on the iterator\r\n                            // otherwise we lose it beause iterator code in skulpt relies on returning undefined;\r\n                            // one day maybe we can use the js .next protocol {value: ret, done: true} ;-)\r\n    out(                    \"return undefined;\");\r\n    out(            \"} else { throw e; }\");\r\n    out(        \"}\");\r\n    out(    \");\");\r\n    out(\"}\");\r\n    this._checkSuspension(e);\r\n    out(retval, \"=$ret;\");\r\n    // if the iterator is done (undefined) and we still have an unused sent value, it will be in `[iterable].gi$ret`, so we grab it from there and move on from the `yield from` (\"afterBlock\")\r\n    out(\"if(\", retval, \"===undefined) {\");\r\n    out(    \"$gen.gi$sentvalue=$gen.\" + iterable + \".gi$ret;\");\r\n    out(    \"$blk=\", afterBlock, \";continue;\");\r\n    out(\"}\");\r\n    out(\"return [/*resume*/\", afterIter, \",/*ret*/\", retval, \"];\");\r\n    this.setBlock(afterBlock);\r\n    return \"$gen.gi$sentvalue\"; // will either be none if none sent, or the value retuned from gen.send(value)\r\n};\r\n\r\nCompiler.prototype.ccompare = function (e) {\r\n    var res;\r\n    var rhs;\r\n    var i;\r\n    var fres;\r\n    var done;\r\n    var n;\r\n    var cur;\r\n    Sk.asserts.assert(e.ops.length === e.comparators.length);\r\n    cur = this.vexpr(e.left);\r\n    n = e.ops.length;\r\n    done = this.newBlock(\"done\");\r\n    fres = this._gr(\"compareres\", \"null\");\r\n\r\n    for (i = 0; i < n; ++i) {\r\n        rhs = this.vexpr(e.comparators[i]);\r\n        out(\"$ret = Sk.misceval.richCompareBool(\", cur, \",\", rhs, \",'\", e.ops[i].prototype._astname, \"', true);\");\r\n        this._checkSuspension(e);\r\n        out(fres, \"=Sk.builtin.bool($ret);\");\r\n        this._jumpfalse(\"$ret\", done);\r\n        cur = rhs;\r\n    }\r\n    this._jump(done);\r\n    this.setBlock(done);\r\n    return fres;\r\n};\r\n\r\nCompiler.prototype.ccall = function (e) {\r\n    var func = this.vexpr(e.func);\r\n    var kwarray = null;\r\n    // Okay, here's the deal. We have some set of positional args\r\n    // and we need to unpack them. We have some set of keyword args\r\n    // and we need to unpack those too. Then we make a call.\r\n    // The existing Sk.misceval.call() and .apply() signatures do not\r\n    // help us here; we do it by hand.\r\n\r\n    let positionalArgs = this.cunpackstarstoarray(e.args, !Sk.__future__.python3);\r\n    let keywordArgs = \"undefined\";\r\n\r\n    if (e.keywords && e.keywords.length > 0) {\r\n        let hasStars = false;\r\n        kwarray = [];\r\n        for (let kw of e.keywords) {\r\n            if (hasStars && !Sk.__future__.python3) {\r\n                throw new Sk.builtin.SyntaxError(\"Advanced unpacking of function arguments is not supported in Python 2\");\r\n            }\r\n            if (kw.arg) {\r\n                kwarray.push(\"'\" + kw.arg.v + \"'\");\r\n                kwarray.push(this.vexpr(kw.value));\r\n            } else {\r\n                hasStars = true;\r\n            }\r\n        }\r\n        keywordArgs = \"[\" + kwarray.join(\",\") + \"]\";\r\n        if (hasStars) {\r\n            keywordArgs = this._gr(\"keywordArgs\", keywordArgs);\r\n            for (let kw of e.keywords) {\r\n                if (!kw.arg) {\r\n                    out(\"$ret = Sk.abstr.mappingUnpackIntoKeywordArray(\", keywordArgs, \",\", this.vexpr(kw.value), \",\", func, \");\");\r\n                    this._checkSuspension();\r\n                }\r\n            }\r\n        }\r\n    }\r\n\r\n    if (Sk.__future__.super_args && e.func.id && e.func.id.v === \"super\" && positionalArgs === \"[]\") {\r\n        // make sure there is a self variable\r\n        // note that it's part of the js API spec: https://developer.mozilla.org/en/docs/Web/API/Window/self\r\n        // so we should probably add self to the mangling\r\n        // TODO: feel free to ignore the above\r\n        //out(\"if (typeof self === \\\"undefined\\\" || self.toString().indexOf(\\\"Window\\\") > 0) { throw new Sk.builtin.RuntimeError(\\\"super(): no arguments\\\") };\");\r\n        out(\"if (typeof self === \\\"undefined\\\" || self===window) { throw new Sk.builtin.RuntimeError(\\\"super(): no arguments\\\") };\");\r\n        positionalArgs = \"[__class__,self]\";\r\n    }\r\n    out(\"$ret = (\", func, \".tp$call)?\", func, \".tp$call(\", positionalArgs, \",\", keywordArgs, \") : Sk.misceval.applyOrSuspend(\", func, \",undefined,undefined,\", keywordArgs, \",\", positionalArgs, \");\");\r\n\r\n    this._checkSuspension(e);\r\n\r\n    return this._gr(\"call\", \"$ret\");\r\n};\r\n\r\nCompiler.prototype.cslice = function (s) {\r\n    var step;\r\n    var high;\r\n    var low;\r\n    Sk.asserts.assert(s instanceof Sk.astnodes.Slice);\r\n    if (Sk.__future__.python3) {\r\n        low = s.lower ? this.vexpr(s.lower) : \"Sk.builtin.none.none$\";\r\n        high = s.upper ? this.vexpr(s.upper) : \"Sk.builtin.none.none$\";\r\n        step = s.step ? this.vexpr(s.step) : \"Sk.builtin.none.none$\";\r\n    } else {\r\n        // This implements Python 2's idea of slice literals, which is...idiosyncratic.\r\n        // The rules for when you get None, and when you get an arbitrary integer (0 or maxint)\r\n        // seem pretty arbitrary. Python 3's are much saner.\r\n        low = s.lower ? this.vexpr(s.lower) : s.step ? \"Sk.builtin.none.none$\" : \"new Sk.builtin.int_(0)\"; // todo;ideally, these numbers would be constants\r\n        high = s.upper ? this.vexpr(s.upper) : s.step ? \"Sk.builtin.none.none$\" : \"new Sk.builtin.int_(2147483647)\";\r\n        step = s.step ? this.vexpr(s.step) : \"Sk.builtin.none.none$\";\r\n    }\r\n    return this._gr(\"slice\", \"new Sk.builtins['slice'](\", low, \",\", high, \",\", step, \")\");\r\n};\r\n\r\nCompiler.prototype.eslice = function (dims) {\r\n    var i;\r\n    var dimSubs, subs;\r\n    Sk.asserts.assert(dims instanceof Array);\r\n    dimSubs = [];\r\n    for (i = 0; i < dims.length; i++) {\r\n        dimSubs.push(this.vslicesub(dims[i]));\r\n    }\r\n    return this._gr(\"extslice\", \"new Sk.builtins['tuple']([\", dimSubs, \"])\");\r\n};\r\n\r\nCompiler.prototype.vslicesub = function (s) {\r\n    var subs;\r\n    switch (s.constructor) {\r\n        case Sk.astnodes.Index:\r\n            subs = this.vexpr(s.value);\r\n            break;\r\n        case Sk.astnodes.Slice:\r\n            subs = this.cslice(s);\r\n            break;\r\n        case Sk.astnodes.Ellipsis:\r\n            Sk.asserts.fail(\"todo compile.js Ellipsis;\");\r\n            break;\r\n        case Sk.astnodes.ExtSlice:\r\n            subs = this.eslice(s.dims);\r\n            break;\r\n        default:\r\n            Sk.asserts.fail(\"invalid subscript kind\");\r\n    }\r\n    return subs;\r\n};\r\n\r\nCompiler.prototype.vslice = function (s, ctx, obj, dataToStore) {\r\n    var subs = this.vslicesub(s);\r\n    return this.chandlesubscr(ctx, obj, subs, dataToStore);\r\n};\r\n\r\nCompiler.prototype.chandlesubscr = function (ctx, obj, subs, data) {\r\n    if (ctx === Sk.astnodes.Load || ctx === Sk.astnodes.AugLoad) {\r\n        out(\"$ret = Sk.abstr.objectGetItem(\", obj, \",\", subs, \", true);\");\r\n        this._checkSuspension();\r\n        return this._gr(\"lsubscr\", \"$ret\");\r\n    } else if (ctx === Sk.astnodes.Store || ctx === Sk.astnodes.AugStore) {\r\n        out(\"$ret = Sk.abstr.objectSetItem(\", obj, \",\", subs, \",\", data, \", true);\");\r\n        this._checkSuspension();\r\n    } else if (ctx === Sk.astnodes.Del) {\r\n        out(\"Sk.abstr.objectDelItem(\", obj, \",\", subs, \");\");\r\n    } else {\r\n        Sk.asserts.fail(\"handlesubscr fail\");\r\n    }\r\n};\r\n\r\nCompiler.prototype.cboolop = function (e) {\r\n    var expres;\r\n    var i;\r\n    var retval;\r\n    var n;\r\n    var s;\r\n    var end;\r\n    var ifFailed;\r\n    var jtype;\r\n    Sk.asserts.assert(e instanceof Sk.astnodes.BoolOp);\r\n    if (e.op === Sk.astnodes.And) {\r\n        jtype = this._jumpfalse;\r\n    } else {\r\n        jtype = this._jumptrue;\r\n    }\r\n    end = this.newBlock(\"end of boolop\");\r\n    s = e.values;\r\n    n = s.length;\r\n    for (i = 0; i < n; ++i) {\r\n        expres = this.vexpr(s[i]);\r\n        if (i === 0) {\r\n            retval = this._gr(\"boolopsucc\", expres);\r\n        }\r\n        out(retval, \"=\", expres, \";\");\r\n        jtype.call(this, expres, end);\r\n    }\r\n    this._jump(end);\r\n    this.setBlock(end);\r\n    return retval;\r\n};\r\n\r\n\r\nCompiler.prototype.cjoinedstr = function (e) {\r\n    let ret;\r\n    Sk.asserts.assert(e instanceof Sk.astnodes.JoinedStr);\r\n\r\n    for (let s of e.values) {\r\n        let v = this.vexpr(s);\r\n        if (!ret) {\r\n            ret = this._gr(\"joinedstr\", v);\r\n        } else {\r\n            out(ret, \"=\", ret, \".sq$concat(\", v, \");\");\r\n        }\r\n    }\r\n\r\n    if (!ret) {\r\n        ret = \"Sk.builtin.str.$emptystr\";\r\n    }\r\n\r\n    return ret;\r\n};\r\n\r\nCompiler.prototype.cformattedvalue = function (e) {\r\n    let value = this.vexpr(e.value);\r\n    switch (e.conversion) {\r\n        case \"s\":\r\n            value = this._gr(\"value\", \"new Sk.builtin.str(\", value, \")\");\r\n            break;\r\n        case \"a\":\r\n            value = this._gr(\"value\", \"Sk.builtin.ascii(\",value,\")\");\r\n            break;\r\n        case \"r\":\r\n            value = this._gr(\"value\", \"Sk.builtin.repr(\", value, \")\");\r\n            break;\r\n    }\r\n    let formatSpec = (e.format_spec ? this.vexpr(e.format_spec) : \"Sk.builtin.str.$emptystr\");\r\n    return this._gr(\"formatted\", \"Sk.abstr.objectFormat(\" + value + \",\" + formatSpec + \")\");\r\n};\r\n\r\nfunction getJsLiteralForString(s) {\r\n    let r = \"\\\"\";\r\n    for (let i = 0; i < s.length; i++) {\r\n        let c = s.charCodeAt(i);\r\n        // Escape quotes, anything before space, and anything non-ASCII\r\n        if (c == 0x0a) {\r\n            r += \"\\\\n\";\r\n        } else if (c == 92) {\r\n            r += \"\\\\\\\\\";\r\n        } else if (c == 34 || c < 32 || c >= 0x7f && c < 0x100) {\r\n            r += \"\\\\x\" + (\"0\" + c.toString(16)).substr(-2);\r\n        } else if (c >= 0x100) {\r\n            r += \"\\\\u\" + (\"000\" + c.toString(16)).substr(-4);\r\n        } else {\r\n            r += s.charAt(i);\r\n        }\r\n    }\r\n    r += \"\\\"\";\r\n    return r;\r\n}\r\n\r\n/**\r\n *\r\n * compiles an expression. to 'return' something, it'll gensym a var and store\r\n * into that var so that the calling code doesn't have avoid just pasting the\r\n * returned name.\r\n *\r\n * @param {Object} e\r\n * @param {string=} data data to store in a store operation\r\n * @param {Object=} augvar var to load/store to for augmented assignments like '+='.\r\n *                  (already vexpr'ed, so we can evaluate it once and reuse for both load and store ops)\r\n * @param {Object=} augsubs precomputed subscript for augmented assignments like '+='.\r\n *                  (already vexpr'ed, so we can evaluate it once and reuse for both load and store ops)\r\n */\r\nCompiler.prototype.vexpr = function (e, data, augvar, augsubs) {\r\n    var mangled, mname;\r\n    var val;\r\n    var result;\r\n    var nStr; // used for preserving signs for floats (zeros)\r\n    if (e.lineno > this.u.lineno) {\r\n        this.u.lineno = e.lineno;\r\n        this.u.linenoSet = false;\r\n    }\r\n    //this.annotateSource(e);\r\n    switch (e.constructor) {\r\n        case Sk.astnodes.BoolOp:\r\n            return this.cboolop(e);\r\n        case Sk.astnodes.BinOp:\r\n            return this._gr(\"binop\", \"Sk.abstr.numberBinOp(\", this.vexpr(e.left), \",\", this.vexpr(e.right), \",'\", e.op.prototype._astname, \"')\");\r\n        case Sk.astnodes.UnaryOp:\r\n            return this._gr(\"unaryop\", \"Sk.abstr.numberUnaryOp(\", this.vexpr(e.operand), \",'\", e.op.prototype._astname, \"')\");\r\n        case Sk.astnodes.Lambda:\r\n            return this.clambda(e);\r\n        case Sk.astnodes.IfExp:\r\n            return this.cifexp(e);\r\n        case Sk.astnodes.Dict:\r\n            return this.cdict(e);\r\n        case Sk.astnodes.ListComp:\r\n            return this.clistcomp(e);\r\n        case Sk.astnodes.DictComp:\r\n            return this.cdictcomp(e);\r\n        case Sk.astnodes.SetComp:\r\n            return this.csetcomp(e);\r\n        case Sk.astnodes.GeneratorExp:\r\n            return this.cgenexp(e);\r\n        case Sk.astnodes.Yield:\r\n            return this.cyield(e);\r\n        case Sk.astnodes.YieldFrom:\r\n            return this.cyieldfrom(e);\r\n        case Sk.astnodes.Compare:\r\n            return this.ccompare(e);\r\n        case Sk.astnodes.Call:\r\n            result = this.ccall(e);\r\n            // After the function call, we've returned to this line\r\n            this.annotateSource(e, true);\r\n            return result;\r\n        case Sk.astnodes.Num:\r\n            if (typeof e.n === \"number\") {\r\n                return e.n;\r\n            } else if (e.n instanceof Sk.builtin.lng) {\r\n                return this.makeConstant(\"new Sk.builtin.lng('\" + e.n.v.toString() + \"')\");\r\n            } else if (e.n instanceof Sk.builtin.int_) {\r\n                if (typeof e.n.v === \"number\") {\r\n                    return this.makeConstant(\"new Sk.builtin.int_(\" + e.n.v + \")\");\r\n                }\r\n                return this.makeConstant(\"new Sk.builtin.int_('\" + e.n.v.toString() + \"')\");\r\n            } else if (e.n instanceof Sk.builtin.float_) {\r\n                // Preserve sign of zero for floats\r\n                nStr = e.n.v === 0 && 1 / e.n.v === -Infinity ? \"-0\" : e.n.v;\r\n                return this.makeConstant(\"new Sk.builtin.float_(\" + nStr + \")\");\r\n            } else if (e.n instanceof Sk.builtin.complex) {\r\n                // preserve sign of zero here too\r\n                var real_val = e.n.real === 0 && 1 / e.n.real === -Infinity ? \"-0\" : e.n.real;\r\n                var imag_val = e.n.imag === 0 && 1 / e.n.imag === -Infinity ? \"-0\" : e.n.imag;\r\n                return this.makeConstant(\"new Sk.builtin.complex(\" + real_val + \", \" + imag_val + \")\");\r\n            }\r\n            Sk.asserts.fail(\"unhandled Num type\");\r\n        case Sk.astnodes.Bytes:\r\n            if (Sk.__future__.python3) {\r\n                const source = [];\r\n                const str = e.s.$jsstr();\r\n                for (let i = 0; i < str.length; i++) {\r\n                    source.push(str.charCodeAt(i));\r\n                }\r\n                return this.makeConstant(\"new Sk.builtin.bytes([\", source.join(\", \"), \"])\");\r\n            }\r\n            // else fall through and make a string instead\r\n        case Sk.astnodes.Str:\r\n            return this.makeConstant(\"new Sk.builtin.str(\", getJsLiteralForString(e.s.$jsstr()), \")\");\r\n        case Sk.astnodes.Attribute:\r\n            if (e.ctx !== Sk.astnodes.AugLoad && e.ctx !== Sk.astnodes.AugStore) {\r\n                val = this.vexpr(e.value);\r\n            }\r\n            mangled = e.attr[\"$r\"]().v;\r\n            mangled = mangled.substring(1, mangled.length - 1);\r\n            mangled = mangleName(this.u.private_, new Sk.builtin.str(mangled)).v;\r\n            mname = this.makeConstant(\"new Sk.builtin.str('\" + mangled + \"')\");\r\n            switch (e.ctx) {\r\n                case Sk.astnodes.AugLoad:\r\n                    out(\"$ret = \", augvar, \".tp$getattr(\", mname, \", true);\");\r\n                    this._checkSuspension(e);\r\n                    out(\"\\nif ($ret === undefined) {\");\r\n                    out(\"\\nthrow new Sk.builtin.AttributeError(\", augvar, \".sk$attrError() + \\\" has no attribute '\\\" + \", mname,\".$jsstr() + \\\"'\\\");\");\r\n                    out(\"\\n};\");\r\n                    return this._gr(\"lattr\", \"$ret\");\r\n                case Sk.astnodes.Load:\r\n                    out(\"$ret = \", val, \".tp$getattr(\", mname, \", true);\");\r\n                    this._checkSuspension(e);\r\n                    out(\"\\nif ($ret === undefined) {\");\r\n                    out(\"\\nthrow new Sk.builtin.AttributeError(\", val, \".sk$attrError() + \\\" has no attribute '\\\" + \", mname,\".$jsstr() + \\\"'\\\");\");\r\n                    out(\"\\n};\");\r\n                    return this._gr(\"lattr\", \"$ret\");\r\n                case Sk.astnodes.AugStore:\r\n                    // To be more correct, we shouldn't sattr() again if the in-place update worked.\r\n                    // At the time of writing (26/Feb/2015), Sk.abstr.numberInplaceBinOp never returns undefined,\r\n                    // so this will never *not* execute. But it could, if Sk.abstr.numberInplaceBinOp were fixed.\r\n                    out(\"$ret = undefined;\");\r\n                    out(\"if(\", data, \"!==undefined){\");\r\n                    out(\"$ret = \", augvar, \".tp$setattr(\", mname, \",\", data, \", true);\");\r\n                    out(\"}\");\r\n                    this._checkSuspension(e);\r\n                    break;\r\n                case Sk.astnodes.Store:\r\n                    out(\"$ret = \", val, \".tp$setattr(\", mname, \",\", data, \", true);\");\r\n                    this._checkSuspension(e);\r\n                    break;\r\n                case Sk.astnodes.Del:\r\n                    out(\"$ret = \", val, \".tp$setattr(\", mname, \", undefined, true);\");\r\n                    this._checkSuspension(e);\r\n                    break;\r\n                case Sk.astnodes.Param:\r\n                default:\r\n                    Sk.asserts.fail(\"invalid attribute expression\");\r\n            }\r\n            break;\r\n        case Sk.astnodes.Subscript:\r\n            switch (e.ctx) {\r\n                case Sk.astnodes.AugLoad:\r\n                    out(\"$ret = Sk.abstr.objectGetItem(\", augvar, \",\", augsubs, \", true);\");\r\n                    this._checkSuspension(e);\r\n                    return this._gr(\"gitem\", \"$ret\");\r\n                case Sk.astnodes.Load:\r\n                case Sk.astnodes.Store:\r\n                case Sk.astnodes.Del:\r\n                    return this.vslice(e.slice, e.ctx, this.vexpr(e.value), data);\r\n                case Sk.astnodes.AugStore:\r\n                    // To be more correct, we shouldn't sattr() again if the in-place update worked.\r\n                    // At the time of writing (26/Feb/2015), Sk.abstr.numberInplaceBinOp never returns undefined,\r\n                    // so this will never *not* execute. But it could, if Sk.abstr.numberInplaceBinOp were fixed.\r\n\r\n                    out(\"$ret=undefined;\");\r\n                    out(\"if(\", data, \"!==undefined){\");\r\n                    out(\"$ret=Sk.abstr.objectSetItem(\", augvar, \",\", augsubs, \",\", data, \", true)\");\r\n                    out(\"}\");\r\n                    this._checkSuspension(e);\r\n                    break;\r\n                case Sk.astnodes.Param:\r\n                default:\r\n                    Sk.asserts.fail(\"invalid subscript expression\");\r\n            }\r\n            break;\r\n        case Sk.astnodes.Name:\r\n            return this.nameop(e.id, e.ctx, data);\r\n        case Sk.astnodes.NameConstant:\r\n            if (e.ctx === Sk.astnodes.Store || e.ctx === Sk.astnodes.AugStore || e.ctx === Sk.astnodes.Del) {\r\n                throw new Sk.builtin.SyntaxError(\"can not assign to a constant name\", this.filename, e.lineno, ...get_context(e));\r\n            }\r\n\r\n            switch (e.value) {\r\n                case Sk.builtin.none.none$:\r\n                    return \"Sk.builtin.none.none$\";\r\n                case Sk.builtin.bool.true$:\r\n                    return \"Sk.builtin.bool.true$\";\r\n                case Sk.builtin.bool.false$:\r\n                    return \"Sk.builtin.bool.false$\";\r\n                default:\r\n                    Sk.asserts.fail(\"invalid named constant\");\r\n            }\r\n            break;\r\n        case Sk.astnodes.List:\r\n            return this.ctuplelistorset(e, data, \"list\");\r\n        case Sk.astnodes.Tuple:\r\n            return this.ctuplelistorset(e, data, \"tuple\");\r\n        case Sk.astnodes.Set:\r\n            return this.ctuplelistorset(e, data, \"set\");\r\n        case Sk.astnodes.Starred:\r\n            switch (e.ctx) {\r\n                case Sk.astnodes.Store:\r\n                    /* In all legitimate cases, the Starred node was already replaced\r\n                     * by compiler_list/compiler_tuple. XXX: is that okay? */\r\n                    throw new Sk.builtin.SyntaxError(\"starred assignment target must be in a list or tuple\", this.filename, e.lineno, ...get_context(e));\r\n                default:\r\n                    throw new Sk.builtin.SyntaxError(\"can't use starred expression here\", this.filename, e.lineno, ...get_context(e));\r\n            }\r\n        case Sk.astnodes.JoinedStr:\r\n            return this.cjoinedstr(e);\r\n        case Sk.astnodes.FormattedValue:\r\n            return this.cformattedvalue(e);\r\n        case Sk.astnodes.Ellipsis:\r\n            return this.makeConstant(\"Sk.builtin.Ellipsis\");\r\n        default:\r\n            Sk.asserts.fail(\"unhandled case \" + e.constructor.name + \" vexpr\");\r\n    }\r\n};\r\n\r\n/**\r\n * @param {Array.<Object>} exprs\r\n * @param {Array.<string>=} data\r\n */\r\nCompiler.prototype.vseqexpr = function (exprs, data) {\r\n    var i;\r\n    var ret;\r\n    Sk.asserts.assert(data === undefined || exprs.length === data.length);\r\n    ret = [];\r\n\r\n    // if (exprs.length === 1 && exprs[0].constructor === Sk.astnodes.Starred) {\r\n    //     exprs = exprs[0].value;\r\n    // }\r\n\r\n    for (i = 0; i < exprs.length; ++i) {\r\n        ret.push(this.vexpr(exprs[i], data === undefined ? undefined : data[i]));\r\n    }\r\n    return ret;\r\n};\r\n\r\n\r\nCompiler.prototype.cannassign = function (s) {\r\n    const target = s.target;\r\n    let val = s.value;\r\n    // perform the actual assignment first\r\n    if (val) {\r\n        val = this.vexpr(s.value);\r\n        this.vexpr(target, val);\r\n    }\r\n    switch (target.constructor) {\r\n        case Sk.astnodes.Name:\r\n            if (s.simple && (this.u.ste.blockType === Sk.SYMTAB_CONSTS.ClassBlock || this.u.ste.blockType == Sk.SYMTAB_CONSTS.ModuleBlock)) {\r\n                this.u.hasAnnotations = true;\r\n                const val = this.vexpr(s.annotation);\r\n                let mangled = mangleName(this.u.private_, target.id).v;\r\n                const key = this.makeConstant(\"new Sk.builtin.str('\" + mangled + \"')\");\r\n                this.chandlesubscr(Sk.astnodes.Store, \"$loc.__annotations__\", key, val);\r\n            }\r\n    }\r\n};\r\n\r\n\r\nCompiler.prototype.caugassign = function (s) {\r\n    var to;\r\n    var augsub;\r\n    var res;\r\n    var val;\r\n    var aug;\r\n    var auge;\r\n    var e;\r\n    Sk.asserts.assert(s instanceof Sk.astnodes.AugAssign);\r\n    e = s.target;\r\n    switch (e.constructor) {\r\n        case Sk.astnodes.Attribute:\r\n            to = this.vexpr(e.value);\r\n            auge = new Sk.astnodes.Attribute(e.value, e.attr, Sk.astnodes.AugLoad, e.lineno, e.col_offset, e.end_lineno, e.end_col_offset);\r\n            aug = this.vexpr(auge, undefined, to);\r\n            val = this.vexpr(s.value);\r\n            res = this._gr(\"inplbinopattr\", \"Sk.abstr.numberInplaceBinOp(\", aug, \",\", val, \",'\", s.op.prototype._astname, \"')\");\r\n            auge.ctx = Sk.astnodes.AugStore;\r\n            return this.vexpr(auge, res, to);\r\n        case Sk.astnodes.Subscript:\r\n            // Only compile the subscript value once\r\n            to = this.vexpr(e.value);\r\n            augsub = this.vslicesub(e.slice);\r\n            auge = new Sk.astnodes.Subscript(e.value, augsub, Sk.astnodes.AugLoad, e.lineno, e.col_offset, e.end_lineno, e.end_col_offset);\r\n            aug = this.vexpr(auge, undefined, to, augsub);\r\n            val = this.vexpr(s.value);\r\n            res = this._gr(\"inplbinopsubscr\", \"Sk.abstr.numberInplaceBinOp(\", aug, \",\", val, \",'\", s.op.prototype._astname, \"')\");\r\n            auge.ctx = Sk.astnodes.AugStore;\r\n            return this.vexpr(auge, res, to, augsub);\r\n        case Sk.astnodes.Name:\r\n            to = this.nameop(e.id, Sk.astnodes.Load);\r\n            val = this.vexpr(s.value);\r\n            res = this._gr(\"inplbinop\", \"Sk.abstr.numberInplaceBinOp(\", to, \",\", val, \",'\", s.op.prototype._astname, \"')\");\r\n            return this.nameop(e.id, Sk.astnodes.Store, res);\r\n        default:\r\n            Sk.asserts.fail(\"unhandled case in augassign\");\r\n    }\r\n};\r\n\r\n/**\r\n * optimize some constant exprs. returns 0 if always false, 1 if always true or -1 otherwise.\r\n */\r\nCompiler.prototype.exprConstant = function (e) {\r\n    switch (e.constructor) {\r\n        case Sk.astnodes.Num:\r\n            return Sk.misceval.isTrue(e.n) ? 1 : 0;\r\n        case Sk.astnodes.Str:\r\n            return Sk.misceval.isTrue(e.s) ? 1 : 0;\r\n        case Sk.astnodes.Name:\r\n        // todo; do __debug__ test here if opt\r\n        default:\r\n            return -1;\r\n    }\r\n};\r\n\r\nCompiler.prototype.newBlock = function (name) {\r\n    var ret = this.u.blocknum++;\r\n    this.u.blocks[ret] = [];\r\n    this.u.blocks[ret]._name = name || \"<unnamed>\";\r\n    this.u.blocks[ret]._next = null;\r\n    return ret;\r\n};\r\nCompiler.prototype.setBlock = function (n) {\r\n    Sk.asserts.assert(n >= 0 && n < this.u.blocknum);\r\n    this.u.curblock = n;\r\n};\r\n\r\nCompiler.prototype.pushBreakBlock = function (n) {\r\n    Sk.asserts.assert(n >= 0 && n < this.u.blocknum);\r\n    this.u.breakBlocks.push(n);\r\n};\r\nCompiler.prototype.popBreakBlock = function () {\r\n    this.u.breakBlocks.pop();\r\n};\r\n\r\nCompiler.prototype.pushContinueBlock = function (n) {\r\n    Sk.asserts.assert(n >= 0 && n < this.u.blocknum);\r\n    this.u.continueBlocks.push(n);\r\n};\r\nCompiler.prototype.popContinueBlock = function () {\r\n    this.u.continueBlocks.pop();\r\n};\r\n\r\nCompiler.prototype.pushExceptBlock = function (n) {\r\n    Sk.asserts.assert(n >= 0 && n < this.u.blocknum);\r\n    this.u.exceptBlocks.push(n);\r\n};\r\nCompiler.prototype.popExceptBlock = function () {\r\n    this.u.exceptBlocks.pop();\r\n};\r\n\r\nCompiler.prototype.pushFinallyBlock = function (n) {\r\n    Sk.asserts.assert(n >= 0 && n < this.u.blocknum);\r\n    Sk.asserts.assert(this.u.breakBlocks.length === this.u.continueBlocks.length);\r\n    this.u.finallyBlocks.push({blk: n, breakDepth: this.u.breakBlocks.length});\r\n};\r\nCompiler.prototype.popFinallyBlock = function () {\r\n    this.u.finallyBlocks.pop();\r\n};\r\nCompiler.prototype.peekFinallyBlock = function () {\r\n    return (this.u.finallyBlocks.length > 0) ? this.u.finallyBlocks[this.u.finallyBlocks.length - 1] : undefined;\r\n};\r\n\r\nCompiler.prototype.setupExcept = function (eb) {\r\n    out(\"$exc.push(\", eb, \");\");\r\n    //this.pushExceptBlock(eb);\r\n};\r\n\r\nCompiler.prototype.endExcept = function () {\r\n    out(\"$exc.pop();\");\r\n};\r\n\r\nCompiler.prototype.getLocals = function (unit) {\r\n    var name;\r\n    var output;\r\n    var i;\r\n    var have = {};\r\n    //print(\"args\", unit.name.v, JSON.stringify(unit.argnames));\r\n    for (i = 0; unit.argnames && i < unit.argnames.length; ++i) {\r\n        have[unit.argnames[i]] = true;\r\n    }\r\n    //unit.localnames.sort();\r\n    output = [];\r\n    //console.log(unit.localnames, unit.argnames);\r\n    for (i = 0; i < unit.localnames.length; ++i) {\r\n        name = unit.localnames[i];\r\n        if (have[name] === undefined) {\r\n            output.push(name);\r\n            have[name] = true;\r\n        }\r\n    }\r\n    return output;\r\n};\r\n\r\nCompiler.prototype.outputLocals = function (unit, localNames) {\r\n    const varnames = localNames.join(\",\");\r\n    if (localNames.length > 0) {\r\n        return \"var \" + varnames + \"; /* locals */\";\r\n    }\r\n    return \"\";\r\n}\r\n\r\nCompiler.prototype.outputSuspensionHelpers = function (unit) {\r\n    var i, t;\r\n    var localSaveCode = [];\r\n    var localsToSave = unit.localnames.concat(unit.tempsToSave);\r\n    var seenTemps = {};\r\n\r\n    var localsToSaveWithoutDuplicates = [];\r\n    for (i = 0; i < localsToSave.length; i++) {\r\n        t = localsToSave[i];\r\n        if (seenTemps[t] === undefined) {\r\n            localsToSaveWithoutDuplicates.push(t);\r\n            seenTemps[t] = true;\r\n        }\r\n    }\r\n    localsToSave = localsToSaveWithoutDuplicates;\r\n\r\n\r\n    var hasCell = unit.ste.blockType === Sk.SYMTAB_CONSTS.FunctionBlock && unit.ste.childHasFree;\r\n    var output = (localsToSave.length > 0 ? (\"var \" + localsToSave.join(\",\") + \";\") : \"\");\r\n    output += \"var $wakeFromSuspension = function() {\" +\r\n        \"var susp = \" + unit.scopename + \".$wakingSuspension; \" + unit.scopename + \".$wakingSuspension = undefined;\" +\r\n        \"$blk=susp.$blk; $loc=susp.$loc; $gbl=susp.$gbl; $exc=susp.$exc; $err=susp.$err; $postfinally=susp.$postfinally;\" +\r\n        \"$currLineNo=susp.$lineno;$currColNo=susp.$colno;$currSource=susp.$source;Sk.lastYield=Date.now();\" +\r\n        //\"console.log('WAKEY', $fname, $loc, $gbl, $exc, $exc.length, $currColNo, $currLineNo, $err, $currSource,$blk);\" +\r\n        (hasCell ? \"$cell=susp.$cell;\" : \"\");\r\n\r\n    for (i = 0; i < localsToSave.length; i++) {\r\n        t = localsToSave[i];\r\n        output += t + \"=susp.$tmps.\" + t + \";\";\r\n    }\r\n\r\n    output += (\"try {\" +\r\n        \"$ret=susp.child.resume();\" +\r\n        this.handleTraceback(false, unit.scopename) +\r\n        // Close out function\r\n        \";\");\r\n\r\n    for (i = 0; i < localsToSave.length; i++) {\r\n        t = localsToSave[i];\r\n        localSaveCode.push(\"\\\"\" + t + \"\\\":\" + t);\r\n    }\r\n\r\n    output += \"var $mys = function(){return {data: {type: 'Sk.yield'}, resume: function(){} } };\";\r\n    output += \"var $saveSuspension = function($child, $filename, $lineno, $colno, $source) {\" +\r\n        //\"var susp = new Sk.misceval.Suspension(); susp.child=$child;\" +\r\n        \"var susp = Sk.misceval.injectSusp($child,$blk,$loc,$gbl,$exc,$err,$postfinally,$filename,$lineno,$colno,$source,{\" + localSaveCode.join(\",\") + \"});\"+\r\n        \"susp.resume=function(){\" + unit.scopename + \".$wakingSuspension=susp; return \" + unit.scopename + \"(\" + (unit.ste.generator ? \"$gen\" : \"\") + \"); };\" +\r\n        /*\"susp.data=susp.child.data;susp.$blk=$blk;susp.$loc=$loc;susp.$gbl=$gbl;susp.$exc=$exc;susp.$err=$err;susp.$postfinally=$postfinally;\" +\r\n        \"susp.$filename=$filename;susp.$lineno=$lineno;susp.$colno=$colno;susp.source=$source;\" +\r\n        \"susp.optional=susp.child.optional;\" +*/\r\n        (hasCell ? \"susp.$cell=$cell;\" : \"\") +\r\n        //\"susp.$tmps={\" + localSaveCode.join(\",\") + \"};\" +\r\n        \"return susp;\" +\r\n        \"};\";\r\n\r\n    return output;\r\n};\r\n\r\nCompiler.prototype.getLocalGetter = function(unit, localNames) {\r\n    return `var $getLocals=()=>({$cell,${localNames.join(\",\")}});`;\r\n};\r\n\r\nCompiler.prototype.outputAllUnits = function () {\r\n    var i;\r\n    var blocks;\r\n    var unit;\r\n    var j;\r\n    var ret = \"\";\r\n    var block;\r\n    var generatedBlocks;\r\n    for (j = 0; j < this.allUnits.length; ++j) {\r\n        unit = this.allUnits[j];\r\n        ret += unit.prefixCode;\r\n        var localNames = this.getLocals(unit);\r\n        ret += this.outputLocals(unit, localNames);\r\n        if (unit.doesSuspend) {\r\n            ret += this.outputSuspensionHelpers(unit);\r\n        }\r\n        ret += this.getLocalGetter(unit, unit.localnames);\r\n        ret += unit.varDeclsCode;\r\n        ret += unit.switchCode;\r\n        blocks = unit.blocks;\r\n        generatedBlocks = Object.create(null);\r\n        for (i = 0; i < blocks.length; ++i) {\r\n            block = i;\r\n            if (block in generatedBlocks) {\r\n                continue;\r\n            }\r\n            while (true) {\r\n                generatedBlocks[block] = true;\r\n\r\n                ret += \"case \" + block + \": /* --- \" + blocks[block]._name + \" --- */\";\r\n                ret += blocks[block].join(\"\");\r\n\r\n                if (blocks[block]._next !== null) {\r\n                    if (!(blocks[block]._next in generatedBlocks)) {\r\n                        ret += \"/* allowing case fallthrough */\";\r\n                        block = blocks[block]._next;\r\n                    } else {\r\n                        ret += \"/* jump */ continue;\";\r\n                        break;\r\n                    }\r\n                } else {\r\n                    // Shouldn't really be possible to hit this\r\n                    //ret += \"throw new Sk.builtin.SystemError('internal error: unterminated block');\";\r\n                    break;\r\n                }\r\n            }\r\n        }\r\n        ret += unit.suffixCode;\r\n    }\r\n    return ret;\r\n};\r\n\r\nCompiler.prototype.cif = function (s) {\r\n    var test;\r\n    var next;\r\n    var end;\r\n    var constant;\r\n    Sk.asserts.assert(s instanceof Sk.astnodes.If);\r\n    constant = this.exprConstant(s.test);\r\n    if (constant === 0) {\r\n        if (s.orelse && s.orelse.length > 0) {\r\n            this.vseqstmt(s.orelse);\r\n        }\r\n    } else if (constant === 1) {\r\n        this.vseqstmt(s.body);\r\n    } else {\r\n        end = this.newBlock(\"end of if\");\r\n        if (s.orelse && s.orelse.length > 0) {\r\n            next = this.newBlock(\"next branch of if\");\r\n        }\r\n\r\n        test = this.vexpr(s.test);\r\n\r\n        if (s.orelse && s.orelse.length > 0) {\r\n            this._jumpfalse(test, next);\r\n            this.vseqstmt(s.body);\r\n            this._jump(end);\r\n\r\n            this.setBlock(next);\r\n            this.vseqstmt(s.orelse);\r\n        } else {\r\n            this._jumpfalse(test, end);\r\n            this.vseqstmt(s.body);\r\n        }\r\n        this._jump(end);\r\n        this.setBlock(end);\r\n    }\r\n\r\n};\r\n\r\nCompiler.prototype.cwhile = function (s) {\r\n    var body;\r\n    var orelse;\r\n    var next;\r\n    var top;\r\n    var constant = this.exprConstant(s.test);\r\n    if (constant === 0) {\r\n        if (s.orelse) {\r\n            this.vseqstmt(s.orelse);\r\n        }\r\n    } else {\r\n        top = this.newBlock(\"while test\");\r\n        this._jump(top);\r\n        this.setBlock(top);\r\n\r\n        next = this.newBlock(\"after while\");\r\n        orelse = s.orelse.length > 0 ? this.newBlock(\"while orelse\") : null;\r\n        body = this.newBlock(\"while body\");\r\n\r\n        this.annotateSource(s, true);\r\n        this._jumpfalse(this.vexpr(s.test), orelse ? orelse : next);\r\n        this._jump(body);\r\n\r\n        this.pushBreakBlock(next);\r\n        this.pushContinueBlock(top);\r\n\r\n        this.setBlock(body);\r\n\r\n        if ((Sk.debugging || Sk.killableWhile) && this.u.canSuspend) {\r\n            var suspType = \"Sk.delay\";\r\n            var debugBlock = this.newBlock(\"debug breakpoint for line \" + s.lineno);\r\n            out(\"if (Sk.breakpoints('\" + this.filename + \"',\" + s.lineno + \",\" + s.col_offset + \")) {\",\r\n                \"var $susp = $saveSuspension({data: {type: '\" + suspType + \"'}, resume: function() {}}, '\" + this.filename + \"',\" + s.lineno + \",\" + s.col_offset + \",\" + s.source + \");\",\r\n                \"$susp.$blk = \" + debugBlock + \";\",\r\n                \"$susp.optional = true;\",\r\n                \"return $susp;\",\r\n                \"}\");\r\n            this._jump(debugBlock);\r\n            this.setBlock(debugBlock);\r\n            this.u.doesSuspend = true;\r\n        }\r\n\r\n        this.vseqstmt(s.body);\r\n\r\n        this._jump(top);\r\n\r\n        this.popContinueBlock();\r\n        this.popBreakBlock();\r\n\r\n        if (s.orelse.length > 0) {\r\n            this.setBlock(orelse);\r\n            this.vseqstmt(s.orelse);\r\n            this._jump(next);\r\n        }\r\n\r\n        this.setBlock(next);\r\n    }\r\n};\r\n\r\nCompiler.prototype.cfor = function (s) {\r\n    var target;\r\n    var nexti;\r\n    var iter;\r\n    var toiter;\r\n    var start = this.newBlock(\"for start\");\r\n    var cleanup = this.newBlock(\"for cleanup\");\r\n    var end = this.newBlock(\"for end\");\r\n\r\n    this.pushBreakBlock(end);\r\n    this.pushContinueBlock(start);\r\n\r\n    // get the iterator\r\n    toiter = this.vexpr(s.iter);\r\n    if (this.u.ste.generator) {\r\n        // if we're in a generator, we have to store the iterator to a local\r\n        // so it's preserved (as we cross blocks here and assume it survives)\r\n        iter = \"$loc.\" + this.gensym(\"iter\");\r\n        out(iter, \"=Sk.abstr.iter(\", toiter, \");\");\r\n    } else {\r\n        iter = this._gr(\"iter\", \"Sk.abstr.iter(\", toiter, \")\");\r\n        this.u.tempsToSave.push(iter); // Save it across suspensions\r\n    }\r\n\r\n    this._jump(start);\r\n\r\n    this.setBlock(start);\r\n\r\n    // load targets\r\n    out(\"$ret = Sk.abstr.iternext(\", iter, (this.u.canSuspend ? \", true\" : \", false\"), \");\");\r\n\r\n    this._checkSuspension(s);\r\n\r\n    nexti = this._gr(\"next\", \"$ret\");\r\n    this._jumpundef(nexti, cleanup); // todo; this should be handled by StopIteration\r\n    target = this.vexpr(s.target, nexti);\r\n\r\n    if ((Sk.debugging || Sk.killableFor) && this.u.canSuspend) {\r\n        var suspType = \"Sk.delay\";\r\n        var debugBlock = this.newBlock(\"debug breakpoint for line \" + s.lineno);\r\n        out(\"if (Sk.breakpoints('\" + this.filename + \"',\" + s.lineno + \",\" + s.col_offset + \")) {\",\r\n            \"var $susp = $saveSuspension({data: {type: '\" + suspType + \"'}, resume: function() {}}, '\" + this.filename + \"',\" + s.lineno + \",\" + s.col_offset + \",\" + s.source + \");\",\r\n            \"$susp.$blk = \" + debugBlock + \";\",\r\n            \"$susp.optional = true;\",\r\n            \"return $susp;\",\r\n            \"}\");\r\n        this._jump(debugBlock);\r\n        this.setBlock(debugBlock);\r\n        this.u.doesSuspend = true;\r\n    }\r\n\r\n    // execute body\r\n    this.vseqstmt(s.body);\r\n\r\n    // jump to top of loop\r\n    this._jump(start);\r\n\r\n    this.setBlock(cleanup);\r\n    this.popContinueBlock();\r\n    this.popBreakBlock();\r\n\r\n    this.vseqstmt(s.orelse);\r\n    this._jump(end);\r\n\r\n    this.setBlock(end);\r\n};\r\n\r\nCompiler.prototype.craise = function (s) {\r\n    if (s.exc) {\r\n        var exc = this._gr(\"exc\", this.vexpr(s.exc));\r\n        // This is tricky - we're supporting both the weird-ass semantics\r\n        // of the Python 2 \"raise (exc), (inst), (tback)\" version,\r\n        // plus the sensible Python \"raise (exc) from (cause)\".\r\n        // ast.js takes care of ensuring that you can only use the right one\r\n        // for the Python version you're using.\r\n\r\n        var instantiatedException = this.newBlock(\"exception now instantiated\");\r\n        var isClass = this._gr(\"isclass\", exc + \".prototype instanceof Sk.builtin.BaseException\");\r\n        this._jumpfalse(isClass, instantiatedException);\r\n        //this._jumpfalse(instantiatedException, isClass);\r\n\r\n        // Instantiate exc with inst\r\n        if (s.inst) {\r\n            var inst = this._gr(\"inst\", this.vexpr(s.inst));\r\n            out(\"if(!(\", inst, \" instanceof Sk.builtin.tuple)) {\",\r\n                inst, \"= new Sk.builtin.tuple([\", inst, \"]);\",\r\n                \"}\");\r\n            out(\"$ret = Sk.misceval.callsimOrSuspendArray(\", exc, \",\", inst, \".v);\");\r\n        } else {\r\n            out(\"$ret = Sk.misceval.callsimOrSuspend(\", exc, \");\");\r\n        }\r\n        this._checkSuspension(s);\r\n        out(exc, \"=$ret;\");\r\n\r\n        this._jump(instantiatedException);\r\n\r\n        this.setBlock(instantiatedException);\r\n\r\n        // TODO TODO TODO set cause appropriately\r\n        // (and perhaps traceback for py2 if we care before it gets fully deprecated)\r\n        //out(\"Sk.execStack.pop();\");\r\n        out(\"if (\", exc, \" instanceof Sk.builtin.BaseException) {throw \",exc,\";} else {throw new Sk.builtin.TypeError('exceptions must derive from BaseException');};\");\r\n    } else {\r\n        // re-raise\r\n        //out(\"Sk.execStack.pop();\");\r\n        out(\"throw $err;\");\r\n    }\r\n};\r\n\r\nCompiler.prototype.outputFinallyCascade = function (thisFinally) {\r\n    var nextFinally;\r\n\r\n    // What do we do when we're done executing a 'finally' block?\r\n    // Normally you just fall off the end. If we're 'return'ing,\r\n    // 'continue'ing or 'break'ing, $postfinally tells us what to do.\r\n    //\r\n    // But we might be in a nested pair of 'finally' blocks. If so, we need\r\n    // to work out whether to jump to the outer finally block.\r\n    //\r\n    // (NB we do NOT deal with re-raising exceptions here. That's handled\r\n    // elsewhere, because 'with' does special things with exceptions.)\r\n\r\n    if (this.u.finallyBlocks.length == 0) {\r\n        // No nested 'finally' block. Easy.\r\n        out(\"if($postfinally!==undefined) { if ($postfinally.returning) { return $postfinally.returning; } else { $blk=$postfinally.gotoBlock; $postfinally=undefined; continue; } }\");\r\n    } else {\r\n\r\n        // OK, we're nested. Do we jump straight to the outer 'finally' block?\r\n        // Depends on how we got here here.\r\n\r\n        // Normal execution ($postfinally===undefined)? No, we're done here.\r\n\r\n        // Returning ($postfinally.returning)? Yes, we want to execute all the\r\n        // 'finally' blocks on the way out.\r\n\r\n        // Breaking ($postfinally.isBreak)? It depends. Is the outer 'finally'\r\n        // block inside or outside the loop we're breaking out of? We compare\r\n        // its breakDepth to ours to find out. If we're at the same breakDepth,\r\n        // we're both inside the innermost loop, so we both need to execute.\r\n        // ('continue' is the same thing as 'break' for us)\r\n\r\n        nextFinally = this.peekFinallyBlock();\r\n\r\n        out(\"if($postfinally!==undefined) {\",\r\n            \"if ($postfinally.returning\",\r\n            (nextFinally.breakDepth == thisFinally.breakDepth) ? \"|| $postfinally.isBreak\" : \"\", \") {\",\r\n\r\n            \"$blk=\", nextFinally.blk, \";continue;\",\r\n            \"} else {\",\r\n            \"$blk=$postfinally.gotoBlock;$postfinally=undefined;continue;\",\r\n            \"}\",\r\n            \"}\");\r\n    }\r\n};\r\n\r\nCompiler.prototype.ctry = function (s) {\r\n    var check;\r\n    var next;\r\n    var handlertype;\r\n    var handler;\r\n    var end;\r\n    var orelse;\r\n    var unhandled;\r\n    var i;\r\n    var n = s.handlers.length;\r\n\r\n    var finalBody, finalExceptionHandler, finalExceptionToReRaise;\r\n    var thisFinally;\r\n\r\n    if (s.finalbody) {\r\n        finalBody = this.newBlock(\"finalbody\");\r\n        finalExceptionHandler = this.newBlock(\"finalexh\");\r\n        finalExceptionToReRaise = this._gr(\"finally_reraise\", \"undefined\");\r\n\r\n        this.u.tempsToSave.push(finalExceptionToReRaise);\r\n        this.pushFinallyBlock(finalBody);\r\n        thisFinally = this.peekFinallyBlock();\r\n        this.setupExcept(finalExceptionHandler);\r\n    }\r\n\r\n    // Create a block for each except clause\r\n    var handlers = [];\r\n    for (i = 0; i < n; ++i) {\r\n        handlers.push(this.newBlock(\"except_\" + i + \"_\"));\r\n    }\r\n\r\n    unhandled = this.newBlock(\"unhandled\");\r\n    orelse = this.newBlock(\"orelse\");\r\n    end = this.newBlock(\"end\");\r\n\r\n    if (handlers.length != 0) {\r\n        this.setupExcept(handlers[0]);\r\n    }\r\n    this.vseqstmt(s.body);\r\n    if (handlers.length != 0) {\r\n        this.endExcept();\r\n    }\r\n    this._jump(orelse);\r\n\r\n    for (i = 0; i < n; ++i) {\r\n        this.setBlock(handlers[i]);\r\n        handler = s.handlers[i];\r\n        if (!handler.type && i < n - 1) {\r\n            throw new Sk.builtin.SyntaxError(\"default 'except:' must be last\", this.filename, handler.lineno, ...get_context(handler));\r\n        }\r\n\r\n        if (handler.type) {\r\n            // should jump to next handler if err not isinstance of handler.type\r\n            handlertype = this.vexpr(handler.type);\r\n            next = (i == n - 1) ? unhandled : handlers[i + 1];\r\n\r\n            // var isinstance = this.nameop(new Sk.builtin.str(\"isinstance\"), Load));\r\n            // var check = this._gr('call', \"Sk.misceval.callsimArray(\", isinstance, \", [$err, \", handlertype, \"])\");\r\n\r\n            check = this._gr(\"instance\", \"Sk.misceval.isTrue(Sk.builtin.isinstance($err, \", handlertype, \"))\");\r\n            this._jumpfalse(check, next);\r\n        }\r\n\r\n        if (handler.name) {\r\n            this.vexpr(handler.name, \"$err\");\r\n        }\r\n\r\n        this.vseqstmt(handler.body);\r\n\r\n        this._jump(end);\r\n    }\r\n\r\n    // If no except clause catches exception, throw it again\r\n    this.setBlock(unhandled);\r\n    out(\"throw $err;\");\r\n\r\n    this.setBlock(orelse);\r\n    this.vseqstmt(s.orelse);\r\n    this._jump(end);\r\n\r\n    this.setBlock(end);\r\n    // End of the try/catch/else segment\r\n    if (s.finalbody) {\r\n        this.endExcept();\r\n\r\n        this._jump(finalBody);\r\n\r\n        this.setBlock(finalExceptionHandler);\r\n        // Exception handling also goes to the finally body,\r\n        // stashing the original exception to re-raise\r\n        out(finalExceptionToReRaise, \"=$err;\");\r\n        this._jump(finalBody);\r\n\r\n        this.setBlock(finalBody);\r\n        this.popFinallyBlock();\r\n        this.vseqstmt(s.finalbody);\r\n        // If finalbody executes normally, AND we have an exception\r\n        // to re-raise, we raise it.\r\n        out(\"if(\", finalExceptionToReRaise, \"!==undefined) { throw \", finalExceptionToReRaise, \";}\");\r\n\r\n        this.outputFinallyCascade(thisFinally);\r\n        // Else, we continue from here.\r\n    }\r\n};\r\n\r\nCompiler.prototype.cwith = function (s, itemIdx) {\r\n    var mgr, exit, value, exception;\r\n    var exceptionHandler = this.newBlock(\"withexh\"), tidyUp = this.newBlock(\"withtidyup\");\r\n    var carryOn = this.newBlock(\"withcarryon\");\r\n    var thisFinallyBlock;\r\n\r\n    // NB this does not *quite* match the semantics in PEP 343, which\r\n    // specifies \"exit = type(mgr).__exit__\" rather than getattr()ing,\r\n    // presumably for performance reasons.\r\n\r\n    mgr = this._gr(\"mgr\", this.vexpr(s.items[itemIdx].context_expr));\r\n\r\n    // exit = mgr.__exit__\r\n    out(\"$ret = Sk.abstr.lookupSpecial(\",mgr,\",Sk.builtin.str.$exit);\");\r\n    this._checkSuspension(s);\r\n    exit = this._gr(\"exit\", \"$ret\");\r\n    this.u.tempsToSave.push(exit);\r\n\r\n    // value = mgr.__enter__()\r\n    out(\"$ret = Sk.abstr.lookupSpecial(\",mgr,\",Sk.builtin.str.$enter);\");\r\n    this._checkSuspension(s);\r\n    out(\"$ret = $ret != null && Sk.misceval.callsimOrSuspendArray($ret);\");\r\n    this._checkSuspension(s);\r\n    value = this._gr(\"value\", \"$ret\");\r\n\r\n    // try:\r\n    this.pushFinallyBlock(tidyUp);\r\n    thisFinallyBlock = this.u.finallyBlocks[this.u.finallyBlocks.length - 1];\r\n    this.setupExcept(exceptionHandler);\r\n\r\n    //    VAR = value\r\n    if (s.items[itemIdx].optional_vars) {\r\n        this.nameop(s.items[itemIdx].optional_vars.id, Sk.astnodes.Store, value);\r\n    }\r\n\r\n    //    (try body)\r\n\r\n    if (itemIdx + 1 < s.items.length) {\r\n        // \"with\" statements with multiple items (context managers) are\r\n        // treated as nested \"with\" statements\r\n        this.cwith(s, itemIdx + 1);\r\n    } else {\r\n        this.vseqstmt(s.body);\r\n    }\r\n\r\n    this.endExcept();\r\n    this._jump(tidyUp);\r\n\r\n    // except:\r\n    this.setBlock(exceptionHandler);\r\n\r\n    //   if not exit(*sys.exc_info()):\r\n    //     raise\r\n    out(\"$ret = \", exit, \"!=null && Sk.misceval.applyOrSuspend(\", exit, \",undefined,Sk.builtin.getExcInfo($err),undefined,[]);\");\r\n    this._checkSuspension(s);\r\n    this._jumptrue(\"$ret\", carryOn);\r\n    out(\"throw $err;\");\r\n\r\n    // finally: (kinda. NB that this is a \"finally\" that doesn't run in the\r\n    //           exception case!)\r\n    this.setBlock(tidyUp);\r\n    this.popFinallyBlock();\r\n\r\n    //   exit(None, None, None)\r\n    out(\"$ret = \", exit, \"!=null && Sk.misceval.callsimOrSuspendArray(\", exit, \",[Sk.builtin.none.none$,Sk.builtin.none.none$,Sk.builtin.none.none$]);\");\r\n    this._checkSuspension(s);\r\n    // Ignore $ret.\r\n\r\n    this.outputFinallyCascade(thisFinallyBlock);\r\n\r\n    this._jump(carryOn);\r\n\r\n    this.setBlock(carryOn);\r\n};\r\n\r\nCompiler.prototype.cassert = function (s) {\r\n    /* todo; warnings method\r\n     if (s.test instanceof Tuple && s.test.elts.length > 0)\r\n     Sk.warn(\"assertion is always true, perhaps remove parentheses?\");\r\n     */\r\n\r\n    var test = this.vexpr(s.test);\r\n    var end = this.newBlock(\"end\");\r\n    this._jumptrue(test, end);\r\n    // todo; exception handling\r\n    // maybe replace with Sk.asserts.fail?? or just an alert?\r\n    out(\"throw new Sk.builtin.AssertionError(\", s.msg ? this.vexpr(s.msg) : \"\", \");\");\r\n    this.setBlock(end);\r\n};\r\n\r\nCompiler.prototype.cimportas = function (name, asname, mod) {\r\n    var attr;\r\n    var src = name.v;\r\n    var dotLoc = src.indexOf(\".\");\r\n    //print(\"src\", src);\r\n    //print(\"dotLoc\", dotLoc);\r\n    var cur = mod;\r\n    if (dotLoc !== -1) {\r\n        // if there's dots in the module name, __import__ will have returned\r\n        // the top-level module. so, we need to extract the actual module by\r\n        // getattr'ing up through the names, and then storing the leaf under\r\n        // the name it was to be imported as.\r\n        src = src.substr(dotLoc + 1);\r\n        //print(\"src now\", src);\r\n        while (dotLoc !== -1) {\r\n            dotLoc = src.indexOf(\".\");\r\n            attr = dotLoc !== -1 ? src.substr(0, dotLoc) : src;\r\n            cur = this._gr(\"lattr\", \"Sk.abstr.gattr(\", cur, \", new Sk.builtin.str('\", attr, \"'))\");\r\n            src = src.substr(dotLoc + 1);\r\n        }\r\n    }\r\n    return this.nameop(asname, Sk.astnodes.Store, cur);\r\n};\r\n\r\nCompiler.prototype.cimport = function (s) {\r\n    var lastDot;\r\n    var tmp;\r\n    var mod;\r\n    var alias;\r\n    var i;\r\n    var n = s.names.length;\r\n    for (i = 0; i < n; ++i) {\r\n        alias = s.names[i];\r\n        out(\"$ret = Sk.builtin.__import__(\", alias.name[\"$r\"]().v, \",$gbl,$loc,[],\", (Sk.__future__.absolute_import ? 0 : -1), \",true);\");\r\n\r\n        this._checkSuspension(s);\r\n\r\n        mod = this._gr(\"module\", \"$ret\");\r\n\r\n        if (alias.asname) {\r\n            this.cimportas(alias.name, alias.asname, mod);\r\n        } else {\r\n            tmp = alias.name;\r\n            lastDot = tmp.v.indexOf(\".\");\r\n            if (lastDot !== -1) {\r\n                tmp = new Sk.builtin.str(tmp.v.substr(0, lastDot));\r\n            }\r\n            this.nameop(tmp, Sk.astnodes.Store, mod);\r\n        }\r\n    }\r\n};\r\n\r\nCompiler.prototype.cfromimport = function (s) {\r\n    var storeName;\r\n    var got;\r\n    var alias;\r\n    var aliasOut;\r\n    var mod;\r\n    var i;\r\n    var n = s.names.length;\r\n    var names = [];\r\n    var level = s.level;\r\n    if (level == 0 && !Sk.__future__.absolute_import) {\r\n        level = -1;\r\n    }\r\n    for (i = 0; i < n; ++i) {\r\n        names[i] = \"'\" + fixReserved(s.names[i].name.v) + \"'\";\r\n    }\r\n    out(\"$ret = Sk.builtin.__import__(\", s.module[\"$r\"]().v, \",$gbl,$loc,[\", names, \"],\", level, \",true);\");\r\n\r\n    this._checkSuspension(s);\r\n\r\n    //out(\"print('__import__ returned ' + $ret);\");\r\n    //out(\"for (var x in $ret) { print(x); }\");\r\n    mod = this._gr(\"module\", \"$ret\");\r\n    for (i = 0; i < n; ++i) {\r\n        alias = s.names[i];\r\n        aliasOut = \"'\" + alias.name.v + \"'\";\r\n        if (i === 0 && alias.name.v === \"*\") {\r\n            Sk.asserts.assert(n === 1);\r\n            out(\"Sk.importStar(\", mod, \",$loc, $gbl);\");\r\n            return;\r\n        }\r\n\r\n        //out(\"print(\\\"getting Sk.abstr.gattr(\", mod, \",\", alias.name[\"$r\"]().v, \")\\\");\");\r\n        got = this._gr(\"item\", \"Sk.abstr.gattr(\", mod, \", new Sk.builtin.str(\", aliasOut, \"), undefined)\");\r\n        //out(\"print('got');\");\r\n        storeName = alias.name;\r\n        if (alias.asname) {\r\n            storeName = alias.asname;\r\n        }\r\n        this.nameop(storeName, Sk.astnodes.Store, got);\r\n    }\r\n};\r\n\r\n/**\r\n * builds a code object (js function) for various constructs. used by def,\r\n * lambda, generator expressions. it isn't used for class because it seemed\r\n * different enough.\r\n *\r\n * handles:\r\n * - setting up a new scope\r\n * - decorators (if any)\r\n * - defaults setup\r\n * - setup for cell and free vars\r\n * - setup and modification for generators\r\n *\r\n * @param {Object} n ast node to build for\r\n * @param {Sk.builtin.str} coname name of code object to build\r\n * @param {Array} decorator_list ast of decorators if any\r\n * @param {Sk.astnodes.arguments_} args arguments to function, if any\r\n * @param {Function} callback called after setup to do actual work of function\r\n * @param {Sk.builtin.str=} class_for_super\r\n *\r\n * @returns the name of the newly created function or generator object.\r\n *\r\n */\r\nCompiler.prototype.buildcodeobj = function (n, coname, decorator_list, args, callback, class_for_super) {\r\n    var containingHasFree;\r\n    var frees;\r\n    var argnamesarr = [];\r\n    var start;\r\n    var kw;\r\n    var maxargs;\r\n    var minargs;\r\n    var id;\r\n    var argname;\r\n    var offset;\r\n    var cells;\r\n    var locals;\r\n    var i;\r\n    var funcArgs;\r\n    var entryBlock;\r\n    var hasCell;\r\n    var hasFree;\r\n    var isGenerator;\r\n    var scopename;\r\n    var decos = [];\r\n    var defaults = [];\r\n    var kw_defaults = [];\r\n    var vararg = null;\r\n    var kwarg = null;\r\n\r\n    // decorators and defaults have to be evaluated out here before we enter\r\n    // the new scope. we output the defaults and attach them to this code\r\n    // object, but only once we know the name of it (so we do it after we've\r\n    // exited the scope near the end of this function).\r\n    if (decorator_list) {\r\n        decos = this.vseqexpr(decorator_list);\r\n    }\r\n    if (args && args.defaults) {\r\n        defaults = this.vseqexpr(args.defaults);\r\n    }\r\n\r\n    const func_annotations = this.cannotations(args, n.returns);\r\n\r\n    if (args && args.kw_defaults) {\r\n        kw_defaults = args.kw_defaults.map(e => e ? this.vexpr(e) : \"undefined\");\r\n    }\r\n    if (args && args.vararg) {\r\n        vararg = args.vararg;\r\n    }\r\n    if (args && args.kwarg) {\r\n        kwarg = args.kwarg;\r\n    }\r\n    if (!Sk.__future__.python3 && args && args.kwonlyargs && args.kwonlyargs.length != 0) {\r\n        throw new Sk.builtin.SyntaxError(\"Keyword-only arguments are not supported in Python 2\");\r\n    }\r\n\r\n    //\r\n    // enter the new scope, and create the first block\r\n    //\r\n    scopename = this.enterScope(coname, n, n.lineno, this.canSuspend, coname.v);\r\n\r\n    isGenerator = this.u.ste.generator;\r\n    hasFree = this.u.ste.hasFree;\r\n    hasCell = this.u.ste.childHasFree;\r\n\r\n    entryBlock = this.newBlock(\"codeobj entry\");\r\n\r\n    //\r\n    // the header of the function, and arguments\r\n    //\r\n    this.u.prefixCode = \"var \" + scopename + \"=(function \" + this.niceName(coname.v) + \"$(\";\r\n\r\n    funcArgs = [];\r\n    if (isGenerator) {\r\n        // TODO make generators deal with arguments properly\r\n        if (kwarg) {\r\n            throw new Sk.builtin.SyntaxError(coname.v + \"(): keyword arguments in generators not supported\",\r\n                                             this.filename, n.lineno, ...get_context(n));\r\n        }\r\n        if (vararg) {\r\n            throw new Sk.builtin.SyntaxError(coname.v + \"(): variable number of arguments in generators not supported\",\r\n                                             this.filename, n.lineno, ...get_context(n));\r\n        }\r\n        funcArgs.push(\"$gen\");\r\n    } else {\r\n        if (kwarg) {\r\n            funcArgs.push(\"$kwa\");\r\n            this.u.tempsToSave.push(\"$kwa\");\r\n        }\r\n        for (i = 0; args && i < args.args.length; ++i) {\r\n            funcArgs.push(this.nameop(args.args[i].arg, Sk.astnodes.Param));\r\n        }\r\n        for (i = 0; args && args.kwonlyargs && i < args.kwonlyargs.length; ++i) {\r\n            funcArgs.push(this.nameop(args.kwonlyargs[i].arg, Sk.astnodes.Param));\r\n        }\r\n        if (vararg) {\r\n            funcArgs.push(this.nameop(args.vararg.arg, Sk.astnodes.Param));\r\n        }\r\n    }\r\n    // Are we using the new fast-call mechanism, where the\r\n    // function we define implements the tp$call interface?\r\n    // (Right now we haven't migrated generators because they're\r\n    // a mess, but if this works we can move everything over)\r\n    let fastCall = !isGenerator;\r\n\r\n    if (hasFree) {\r\n        if (!fastCall) {\r\n            funcArgs.push(\"$free\");\r\n        }\r\n        this.u.tempsToSave.push(\"$free\");\r\n    }\r\n\r\n    let argString;\r\n    if (fastCall) {\r\n        argString = \"$posargs,$kwargs\";\r\n    } else {\r\n        argString = funcArgs.join(\",\");\r\n    }\r\n    this.u.prefixCode += argString;\r\n\r\n    this.u.prefixCode += \"){\";\r\n\r\n    if (isGenerator) {\r\n        this.u.prefixCode += \"\\n// generator\\n\";\r\n    }\r\n    if (hasFree) {\r\n        this.u.prefixCode += \"\\n// has free\\n\";\r\n    }\r\n    if (hasCell) {\r\n        this.u.prefixCode += \"\\n// has cell\\n\";\r\n    }\r\n\r\n    if (fastCall) {\r\n        this.u.prefixCode += \"\\n// fast call\\n\";\r\n    }\r\n\r\n    //\r\n    // set up standard dicts/variables\r\n    //\r\n    locals = \"{}\";\r\n    if (isGenerator) {\r\n        entryBlock = \"$gen.gi$resumeat\";\r\n        locals = \"$gen.gi$locals\";\r\n    }\r\n    cells = \",$cell={}\";\r\n    if (hasCell) {\r\n        if (isGenerator) {\r\n            cells = \",$cell=$gen.gi$cells\";\r\n        }\r\n    }\r\n\r\n    // note special usage of 'this' to avoid having to slice globals into\r\n    // all function invocations in call\r\n    // (fastcall doesn't need to do this, as 'this' is the func object)\r\n    this.u.varDeclsCode += \"var $blk=\" + entryBlock + \",$exc=[],$loc=\" + locals + cells + \",$gbl=\" +(fastCall?\"this.func_globals\":\"this\") + ((fastCall&&hasFree)?\",$free=this.func_closure\":\"\") + \",$err=undefined,$ret=undefined,$postfinally=undefined,$currLineNo=undefined,$currColNo=undefined,$currSource=undefined;\";\r\n    if (Sk.execLimit !== null) {\r\n        this.u.varDeclsCode += \"Sk.misceval.startTimer();\";\r\n    }\r\n    if (Sk.yieldLimit !== null && this.u.canSuspend) {\r\n        this.u.varDeclsCode += \"Sk.misceval.resetYield();\";\r\n    }\r\n\r\n    //\r\n    // If there is a suspension, resume from it. Otherwise, initialise\r\n    // parameters appropriately.\r\n    //\r\n    this.u.varDeclsCode += \"var $waking=false; if (\"+scopename+\".$wakingSuspension!==undefined) { $wakeFromSuspension(); $waking=true; } else {\";\r\n\r\n    if (fastCall) {\r\n        // Resolve our arguments from $posargs+$kwargs.\r\n        // If we're posargs-only, we can handle the fast path\r\n        // without even calling out\r\n        if (!kwarg && !vararg && (!args || !args.kwonlyargs || args.kwonlyargs.length === 0)) {\r\n            this.u.varDeclsCode += \"var $args = ((!$kwargs || $kwargs.length===0) && $posargs.length===\" + funcArgs.length + \") ? $posargs : this.$resolveArgs($posargs,$kwargs)\";\r\n        } else {\r\n            this.u.varDeclsCode += \"\\nvar $args = this.$resolveArgs($posargs,$kwargs)\\n\";\r\n        }\r\n        for (let i = 0; i < funcArgs.length; i++) {\r\n            this.u.varDeclsCode += \",\" + funcArgs[i] + \"=$args[\" + i + \"]\";\r\n        }\r\n        this.u.varDeclsCode += \";\\n\";\r\n    }\r\n\r\n\r\n    // TODO update generators to do their arg checks in outside generated code,\r\n    // like functions do\r\n    //\r\n    // this could potentially get removed if generators would learn to deal with args, kw, kwargs, varargs\r\n    // initialize default arguments. we store the values of the defaults to\r\n    // this code object as .$defaults just below after we exit this scope.\r\n    //\r\n    if (isGenerator && defaults.length > 0) {\r\n        // defaults have to be \"right justified\" so if there's less defaults\r\n        // than args we offset to make them match up (we don't need another\r\n        // correlation in the ast)\r\n        offset = args.args.length - defaults.length;\r\n        for (i = 0; i < defaults.length; ++i) {\r\n            argname = this.nameop(args.args[i + offset].arg, Sk.astnodes.Param);\r\n            this.u.varDeclsCode += \"if(\" + argname + \"===undefined)\" + argname + \"=\" + scopename + \".$defaults[\" + i + \"];\";\r\n        }\r\n    }\r\n\r\n    //\r\n    // copy all parameters that are also cells into the cells dict. this is so\r\n    // they can be accessed correctly by nested scopes.\r\n    //\r\n    for (i = 0; args && i < args.args.length; ++i) {\r\n        id = args.args[i].arg;\r\n        if (this.isCell(id)) {\r\n            let mangled = fixReserved(mangleName(this.u.private_, id).v);\r\n            this.u.varDeclsCode += \"$cell.\" + mangled + \"=\" + mangled + \";\";\r\n        }\r\n    }\r\n    for (i = 0; args && args.kwonlyargs && i < args.kwonlyargs.length; ++i) {\r\n        id = args.kwonlyargs[i].arg;\r\n        if (this.isCell(id)) {\r\n            let mangled = fixReserved(mangleName(this.u.private_, id).v);\r\n            this.u.varDeclsCode += \"$cell.\" + mangled + \"=\" + mangled + \";\";\r\n        }\r\n    }\r\n    if (vararg && this.isCell(vararg.arg)) {\r\n        let mangled = fixReserved(mangleName(this.u.private_, vararg.arg).v);\r\n        this.u.varDeclsCode += \"$cell.\" + mangled + \"=\" + mangled + \";\";\r\n    }\r\n\r\n    //\r\n    // initialize kwarg, if any\r\n    //\r\n    if (kwarg) {\r\n        this.u.localnames.push(kwarg.arg.v);\r\n        this.u.varDeclsCode += kwarg.arg.v + \"=new Sk.builtins['dict']($kwa);\";\r\n        if (this.isCell(kwarg.arg)) {\r\n            let mangled = fixReserved(mangleName(this.u.private_, kwarg.arg).v);\r\n            this.u.varDeclsCode += \"$cell.\" + mangled + \"=\" + mangled + \";\";\r\n        }\r\n    }\r\n\r\n    //\r\n    // close the else{} block from the wakingSuspension check\r\n    //\r\n    this.u.varDeclsCode += \"}\";\r\n\r\n    // inject __class__ cell when running python3\r\n    if (Sk.__future__.python3 && class_for_super) {\r\n        this.u.varDeclsCode += \"let __class__=$gbl.\" + class_for_super.v + \";\";\r\n    }\r\n    \r\n    // Begin stack entry\r\n    //this.u.prefixCode += `Sk.execStack.push([\"${coname.v}\", {${this.u.localnames.join(\",\")}}]);`;\r\n\r\n    // finally, set up the block switch that the jump code expects\r\n    //\r\n    // Old switch code\r\n    // this.u.switchCode += \"while(true){switch($blk){\";\r\n    // this.u.suffixCode = \"}break;}});\";\r\n\r\n    // New switch code to catch exceptions\r\n    this.u.switchCode = \"while(true){try{\";\r\n    this.u.switchCode += this.outputInterruptTest();\r\n    this.u.switchCode += \"switch($blk){\";\r\n    this.u.suffixCode = \"}\" + this.handleTraceback(true, coname.v);\r\n    this.u.suffixCode += \"});\";\r\n\r\n    // Track that we are about to call the function\r\n    if (this.filename && !this.filename.startsWith(\"src/lib/\")) {\r\n        out(\"Sk.beforeCall && Sk.beforeCall('\"+coname.$jsstr()+\"',\"+argString+\");\");\r\n    }\r\n\r\n    //\r\n    // jump back to the handler so it can do the main actual work of the\r\n    // function\r\n    //\r\n    callback.call(this, scopename);\r\n\r\n    //\r\n    // get a list of all the argument names (used to attach to the code\r\n    // object, and also to allow us to declare only locals that aren't also\r\n    // parameters).\r\n    if (args) {\r\n        for (let arg of args.args) {\r\n            argnamesarr.push(arg.arg.v);\r\n        }\r\n        for (let arg of args.kwonlyargs || []) {\r\n            argnamesarr.push(arg.arg.v);\r\n        }\r\n\r\n        // store to unit so we know what local variables not to declare\r\n        this.u.argnames = argnamesarr;\r\n    }\r\n\r\n    //\r\n    // and exit the code object scope\r\n    //\r\n    this.exitScope();\r\n\r\n    //\r\n    // attach the default values we evaluated at the beginning to the code\r\n    // object so that it can get at them to set any arguments that are left\r\n    // unset.\r\n    //\r\n    if (defaults.length > 0) {\r\n        out(scopename, \".$defaults=[\", defaults.join(\",\"), \"];\");\r\n    }\r\n    if (args && args.kwonlyargs && args.kwonlyargs.length > 0) {\r\n        out(scopename, \".co_argcount=\", args.args.length, \";\");\r\n        out(scopename, \".co_kwonlyargcount=\", args.kwonlyargs.length, \";\");\r\n        out(scopename, \".$kwdefs=[\", kw_defaults.join(\",\"), \"];\");\r\n    }\r\n\r\n    if (decos.length > 0) {\r\n        out(scopename, \".$decorators=[\", decos.join(\",\"), \"];\");\r\n    }\r\n\r\n    //\r\n    // attach co_varnames (only the argument names) for keyword argument\r\n    // binding.\r\n    //\r\n    if (argnamesarr.length > 0) {\r\n        out(scopename, \".co_varnames=['\", argnamesarr.join(\"','\"), \"'];\");\r\n    } else {\r\n        out(scopename, \".co_varnames=[];\");\r\n    }\r\n\r\n    //\r\n    // Skulpt doesn't have \"co_consts\", so record the docstring (or\r\n    // None) in the \"co_docstring\" property of the code object, ready\r\n    // for use by the Sk.builtin.func constructor.\r\n    //\r\n    out(scopename, \".co_docstring=\", this.cDocstringOfCode(n), \";\");\r\n\r\n    //\r\n    // attach flags\r\n    //\r\n    if (kwarg) {\r\n        out(scopename, \".co_kwargs=1;\");\r\n    }\r\n    if (vararg) {\r\n        out(scopename, \".co_varargs=1;\");\r\n    }\r\n    if (!isGenerator) {\r\n        out(scopename, \".co_fastcall=1;\");\r\n    }\r\n\r\n    //\r\n    // build either a 'function' or 'generator'. the function is just a simple\r\n    // constructor call. the generator is more complicated. it needs to make a\r\n    // new generator every time it's called, so the thing that's returned is\r\n    // actually a function that makes the generator (and passes arguments to\r\n    // the function onwards to the generator). this should probably actually\r\n    // be a function object, rather than a js function like it is now. we also\r\n    // have to build the argument names to pass to the generator because it\r\n    // needs to store all locals into itself so that they're maintained across\r\n    // yields.\r\n    //\r\n    // todo; possibly this should be outside?\r\n    //\r\n    frees = \"\";\r\n    if (hasFree) {\r\n        frees = \",$cell\";\r\n        // if the scope we're in where we're defining this one has free\r\n        // vars, they may also be cell vars, so we pass those to the\r\n        // closure too.\r\n        containingHasFree = this.u.ste.hasFree;\r\n        if (containingHasFree) {\r\n            frees += \",$free\";\r\n        }\r\n    }\r\n    if (isGenerator) {\r\n        // Keyword and variable arguments are not currently supported in generators.\r\n        // The call to pyCheckArgs assumes they can't be true.\r\n        if (args && args.args.length > 0) {\r\n            return this._gr(\"gener\", \"new Sk.builtins['function']((function(){var $origargs=Array.prototype.slice.call(arguments);Sk.builtin.pyCheckArgsLen(\\\"\",\r\n                            coname.v, \"\\\",arguments.length,\", args.args.length - defaults.length, \",\", args.args.length,\r\n                            \");return new Sk.builtins['generator'](\", scopename, \",$gbl,$origargs\", frees, \");}))\");\r\n        } else {\r\n            return this._gr(\"gener\", \"new Sk.builtins['function']((function(){Sk.builtin.pyCheckArgsLen(\\\"\", coname.v,\r\n                            \"\\\",arguments.length,0,0);return new Sk.builtins['generator'](\", scopename, \",$gbl,[]\", frees, \");}))\");\r\n        }\r\n    } else {\r\n        let funcobj;\r\n        if (decos.length > 0) {\r\n            out(\"$ret = new Sk.builtins['function'](\", scopename, \",$gbl\", frees, \");\");\r\n            for (let decorator of decos.reverse()) {\r\n                out(\"$ret = Sk.misceval.callsimOrSuspendArray(\", decorator, \",[$ret]);\");\r\n                this._checkSuspension();\r\n            }\r\n            funcobj = this._gr(\"funcobj\", \"$ret\");\r\n        } else {\r\n            funcobj = this._gr(\"funcobj\", \"new Sk.builtins['function'](\", scopename, \",$gbl\", frees, \")\");\r\n        }\r\n        if (func_annotations) {\r\n            out(funcobj, \".func_annotations=\", func_annotations, \";\");\r\n        }\r\n\r\n        return funcobj;\r\n    }\r\n};\r\n\r\n\r\nCompiler.prototype.cargannotation = function (id, annotation, ann_dict) {\r\n    if (annotation) {\r\n        const mangled = mangleName(this.u.private_, id).v;\r\n        // var scope = this.u.ste.getScope(mangled);\r\n        ann_dict.push(`'${mangled}'`);\r\n        ann_dict.push(this.vexpr(annotation));\r\n    }\r\n};\r\n\r\nCompiler.prototype.cargannotations = function (args, ann_dict) {\r\n    if (!args) {\r\n        return;\r\n    }\r\n    for (let i = 0; i < args.length; i++) {\r\n        const arg = args[i];\r\n        this.cargannotation(arg.arg, arg.annotation, ann_dict);\r\n    }\r\n};\r\n\r\nconst return_str = new Sk.builtin.str(\"return\");\r\n\r\nCompiler.prototype.cannotations = function (args, returns) {\r\n    const ann_dict = [];\r\n    if (args) {\r\n        this.cargannotations(args.posonlyargs, ann_dict);\r\n        this.cargannotations(args.args, ann_dict);\r\n        if (args.vararg && args.vararg.annotation) {\r\n            this.cargannotation(args.vararg.arg, args.vararg.annotation, ann_dict);\r\n        }\r\n        this.cargannotations(args.kwonlyargs, ann_dict);\r\n        if (args.kwarg && args.kwarg.annotation) {\r\n            this.cargannotation(args.kwarg.arg, args.kwarg.annotation, ann_dict);\r\n        }\r\n    }\r\n    if (returns) {\r\n        this.cargannotation(return_str, returns, ann_dict);\r\n    }\r\n    if (ann_dict.length === 0) {\r\n        return;\r\n    }\r\n    // return as kw dict like list.\r\n    // This will get turned into a dict when requested in python code\r\n    // see func.js;\r\n    return \"[\" + ann_dict.join(\",\") + \"]\";\r\n};\r\n\r\n/** JavaScript for the docstring of the given body, or null if the\r\n * body has no docstring.\r\n */\r\nCompiler.prototype.maybeCDocstringOfBody = function(body) {\r\n    if (body.length === 0)  // Don't think this can happen?\r\n        return null;\r\n\r\n    const stmt_0 = body[0];\r\n    if (stmt_0.constructor !== Sk.astnodes.Expr)\r\n        return null;\r\n\r\n    const expr = stmt_0.value;\r\n    if (expr.constructor !== Sk.astnodes.Str)\r\n        return null;\r\n\r\n    return this.vexpr(expr);\r\n};\r\n\r\n/** JavaScript for the docstring of the given node.  Only called from\r\n * buildcodeobj(), and expects a FunctionDef, Lambda, or GeneratorExp\r\n * node.  We give a \"None\" docstring to a GeneratorExp node, although\r\n * it is not carried over to the final generator; this is harmless.\r\n */\r\nCompiler.prototype.cDocstringOfCode = function(node) {\r\n    switch (node.constructor) {\r\n    case Sk.astnodes.AsyncFunctionDef:  // For when it's supported\r\n    case Sk.astnodes.FunctionDef:\r\n        return (\r\n            this.maybeCDocstringOfBody(node.body)\r\n            || \"Sk.builtin.none.none$\"\r\n        );\r\n\r\n    case Sk.astnodes.Lambda:\r\n    case Sk.astnodes.GeneratorExp:\r\n        return \"Sk.builtin.none.none$\";\r\n\r\n    default:\r\n        Sk.asserts.fail(`unexpected node kind ${node.constructor.name}`);\r\n    }\r\n}\r\n\r\nCompiler.prototype.cfunction = function (s, class_for_super) {\r\n    var funcorgen;\r\n    //let filename = this.filename;\r\n    Sk.asserts.assert(s instanceof Sk.astnodes.FunctionDef);\r\n    funcorgen = this.buildcodeobj(s, s.name, s.decorator_list, s.args, function (scopename) {\r\n        this.vseqstmt(s.body);\r\n        out(\"return Sk.builtin.none.none$;\"); // if we fall off the bottom, we want the ret to be None\r\n    }, class_for_super);\r\n    this.nameop(s.name, Sk.astnodes.Store, funcorgen);\r\n};\r\n\r\nCompiler.prototype.clambda = function (e) {\r\n    var func;\r\n    Sk.asserts.assert(e instanceof Sk.astnodes.Lambda);\r\n    func = this.buildcodeobj(e, new Sk.builtin.str(\"<lambda>\"), null, e.args, function (scopename) {\r\n        var val = this.vexpr(e.body);\r\n        out(\"return \", val, \";\");\r\n    });\r\n    return func;\r\n};\r\n\r\nCompiler.prototype.cifexp = function (e) {\r\n    var next = this.newBlock(\"next of ifexp\");\r\n    var end = this.newBlock(\"end of ifexp\");\r\n    var ret = this._gr(\"res\", \"null\");\r\n\r\n    var test = this.vexpr(e.test);\r\n    this._jumpfalse(test, next);\r\n\r\n    out(ret, \"=\", this.vexpr(e.body), \";\");\r\n    this._jump(end);\r\n\r\n    this.setBlock(next);\r\n    out(ret, \"=\", this.vexpr(e.orelse), \";\");\r\n    this._jump(end);\r\n\r\n    this.setBlock(end);\r\n    return ret;\r\n};\r\n\r\nCompiler.prototype.cgenexpgen = function (generators, genIndex, elt) {\r\n    var velt;\r\n    var ifres;\r\n    var i;\r\n    var n;\r\n    var target;\r\n    var nexti;\r\n    var toiter;\r\n    var start = this.newBlock(\"start for \" + genIndex);\r\n    var skip = this.newBlock(\"skip for \" + genIndex);\r\n    var ifCleanup = this.newBlock(\"if cleanup for \" + genIndex);\r\n    var end = this.newBlock(\"end for \" + genIndex);\r\n\r\n    var ge = generators[genIndex];\r\n\r\n    var iter;\r\n    if (genIndex === 0) {\r\n        // the outer most iterator is evaluated in the scope outside so we\r\n        // have to evaluate it outside and store it into the generator as a\r\n        // local, which we retrieve here.\r\n        iter = \"$loc.$iter0\";\r\n    } else {\r\n        toiter = this.vexpr(ge.iter);\r\n        iter = \"$loc.\" + this.gensym(\"iter\");\r\n        out(iter, \"=\", \"Sk.abstr.iter(\", toiter, \");\");\r\n    }\r\n    this._jump(start);\r\n    this.setBlock(start);\r\n\r\n    this.annotateSource(elt, true);\r\n\r\n    // load targets\r\n    out(\"$ret = Sk.abstr.iternext(\", iter, (this.u.canSuspend ? \", true\" : \", false\"), \");\");\r\n\r\n    this._checkSuspension(elt);\r\n\r\n    nexti = this._gr(\"next\", \"$ret\");\r\n    this._jumpundef(nexti, end); // todo; this should be handled by StopIteration\r\n    target = this.vexpr(ge.target, nexti);\r\n\r\n    n = ge.ifs ? ge.ifs.length : 0;\r\n    for (i = 0; i < n; ++i) {\r\n        this.annotateSource(ge.ifs[i], true);\r\n\r\n        ifres = this.vexpr(ge.ifs[i]);\r\n        this._jumpfalse(ifres, start);\r\n    }\r\n\r\n    if (++genIndex < generators.length) {\r\n        this.cgenexpgen(generators, genIndex, elt);\r\n    }\r\n\r\n    if (genIndex >= generators.length) {\r\n        this.annotateSource(elt, true);\r\n\r\n        velt = this.vexpr(elt);\r\n        out(\"return [\", skip, \"/*resume*/,\", velt, \"/*ret*/];\");\r\n        this.setBlock(skip);\r\n    }\r\n\r\n    this._jump(start);\r\n\r\n    this.setBlock(end);\r\n\r\n    if (genIndex === 1) {\r\n        out(\"return Sk.builtin.none.none$;\");\r\n    }\r\n};\r\n\r\nCompiler.prototype.cgenexp = function (e) {\r\n    var gen = this.buildcodeobj(e, new Sk.builtin.str(\"<genexpr>\"), null, null, function (scopename) {\r\n        this.cgenexpgen(e.generators, 0, e.elt);\r\n    });\r\n\r\n    // call the generator maker to get the generator. this is kind of dumb,\r\n    // but the code builder builds a wrapper that makes generators for normal\r\n    // function generators, so we just do it outside (even just new'ing it\r\n    // inline would be fine).\r\n    var gener = this._gr(\"gener\", \"Sk.misceval.callsimArray(\", gen, \");\");\r\n    // stuff the outermost iterator into the generator after evaluating it\r\n    // outside of the function. it's retrieved by the fixed name above.\r\n    out(gener, \".gi$locals.$iter0=Sk.abstr.iter(\", this.vexpr(e.generators[0].iter), \");\");\r\n    return gener;\r\n};\r\n\r\n\r\nCompiler.prototype.cclass = function (s) {\r\n    var wrapped;\r\n    var entryBlock;\r\n    var scopename;\r\n    var bases;\r\n    var decos;\r\n    Sk.asserts.assert(s instanceof Sk.astnodes.ClassDef);\r\n\r\n    decos = this.vseqexpr(s.decorator_list);\r\n\r\n    bases = this.vseqexpr(s.bases);\r\n\r\n    scopename = this.enterScope(s.name, s, s.lineno, s.name.v);\r\n    entryBlock = this.newBlock(\"class entry\");\r\n\r\n    this.u.prefixCode = \"var \" + scopename + \"=(function $\" + s.name.v + \"$class_outer($globals,$locals,$cell){var $gbl=$globals,$loc=$locals,$free=$globals;\";\r\n    this.u.switchCode += \"(function $\" + s.name.v + \"$_closure($cell){\";\r\n    this.u.switchCode += \"var $blk=\" + entryBlock + \",$exc=[],$ret=undefined,$postfinally=undefined,$currLineNo=undefined,$currColNo=undefined;$currSource=undefined;\";\r\n\r\n    if (Sk.execLimit !== null) {\r\n        this.u.switchCode += \"Sk.misceval.startTimer();\";\r\n    }\r\n    if (Sk.yieldLimit !== null && this.u.canSuspend) {\r\n        this.u.switchCode += \"Sk.misceval.resetYield();\";\r\n    }\r\n\r\n    this.u.switchCode += \"while(true){try{\";\r\n    this.u.switchCode += this.outputInterruptTest();\r\n    this.u.switchCode += \"switch($blk){\";\r\n    this.u.suffixCode = \"}\" + this.handleTraceback(true, s.name.v);\r\n    /*this.u.suffixCode = (\"}}catch(err){ if (err instanceof Sk.builtin.TimeoutError) {\"+\r\n        \"Sk.execStart = Date.now();Sk.execPaused=0\"+\r\n        \"} if (!(err instanceof Sk.builtin.BaseException)) {\"+\r\n        \" err = new Sk.builtin.ExternalError(err);\"+\r\n        \"} err.traceback.push({lineno: $currLineNo, colno: $currColNo, filename: '\" + this.filename + \"'});\"+\r\n        \"if ($exc.length>0) { $err = err; $blk=$exc.pop(); continue; } else { throw err; }}}\");*/\r\n    this.u.suffixCode += \"}).call(null, $cell);});\";\r\n\r\n    this.u.private_ = s.name;\r\n\r\n    this.cbody(s.body, s.name);\r\n    out(\"return;\");\r\n\r\n    // build class\r\n\r\n    // apply decorators\r\n\r\n    this.exitScope();\r\n\r\n    // todo; metaclass\r\n    out(\"$ret = Sk.misceval.buildClass($gbl,\", scopename, \",\", s.name[\"$r\"]().v, \",[\", bases, \"], $cell);\");\r\n\r\n    // apply decorators\r\n\r\n    for (let decorator of decos) {\r\n        out(\"$ret = Sk.misceval.callsimOrSuspendArray(\", decorator, \", [$ret]);\");\r\n        this._checkSuspension();\r\n    }\r\n\r\n    // store our new class under the right name\r\n    this.nameop(s.name, Sk.astnodes.Store, \"$ret\");\r\n};\r\n\r\nCompiler.prototype.ccontinue = function (s) {\r\n    var nextFinally = this.peekFinallyBlock(), gotoBlock;\r\n    if (this.u.continueBlocks.length == 0) {\r\n        throw new Sk.builtin.SyntaxError(\"'continue' outside loop\", this.filename, s.lineno, ...get_context(s));\r\n    }\r\n    // todo; continue out of exception blocks\r\n    gotoBlock = this.u.continueBlocks[this.u.continueBlocks.length - 1];\r\n    Sk.asserts.assert(this.u.breakBlocks.length === this.u.continueBlocks.length);\r\n    if (nextFinally && nextFinally.breakDepth == this.u.continueBlocks.length) {\r\n        out(\"$postfinally={isBreak:true,gotoBlock:\", gotoBlock, \"};\");\r\n    } else {\r\n        this._jump(gotoBlock);\r\n    }\r\n};\r\n\r\nCompiler.prototype.cbreak = function (s) {\r\n    var nextFinally = this.peekFinallyBlock(), gotoBlock;\r\n\r\n    if (this.u.breakBlocks.length === 0) {\r\n        throw new Sk.builtin.SyntaxError(\"'break' outside loop\", this.filename, s.lineno, ...get_context(s));\r\n    }\r\n    gotoBlock = this.u.breakBlocks[this.u.breakBlocks.length - 1];\r\n    if (nextFinally && nextFinally.breakDepth == this.u.breakBlocks.length) {\r\n        out(\"$postfinally={isBreak:true,gotoBlock:\", gotoBlock, \"};\");\r\n    } else {\r\n        this._jump(gotoBlock);\r\n    }\r\n};\r\n\r\n/**\r\n * compiles a statement\r\n * @param {Object} s\r\n * @param {Sk.builtin.str=} class_for_super\r\n */\r\nCompiler.prototype.vstmt = function (s, class_for_super) {\r\n    var i;\r\n    var val;\r\n    var n;\r\n    var debugBlock;\r\n    this.u.lineno = s.lineno;\r\n    this.u.linenoSet = false;\r\n    this.u.localtemps = [];\r\n\r\n    if (Sk.debugging && this.u.canSuspend) {\r\n        debugBlock = this.newBlock(\"debug breakpoint for line \" + s.lineno);\r\n        out(\"if (Sk.breakpoints('\" + this.filename + \"',\" + s.lineno + \",\" + s.col_offset + \")) {\",\r\n            \"var $susp = $saveSuspension({data: {type: 'Sk.debug'}, resume: function() {}}, '\" + this.filename + \"',\" + s.lineno + \",\" + s.col_offset + \",\" + s.source + \");\",\r\n            \"$susp.$blk = \" + debugBlock + \";\",\r\n            \"$susp.optional = true;\",\r\n            \"return $susp;\",\r\n            \"}\");\r\n        this._jump(debugBlock);\r\n        this.setBlock(debugBlock);\r\n        this.u.doesSuspend = true;\r\n    }\r\n\r\n    this.annotateSource(s, true);\r\n\r\n    switch (s.constructor) {\r\n        case Sk.astnodes.FunctionDef:\r\n            this.cfunction(s, class_for_super);\r\n            break;\r\n        case Sk.astnodes.ClassDef:\r\n            this.cclass(s);\r\n            break;\r\n        case Sk.astnodes.Return:\r\n            if (this.u.ste.blockType !== Sk.SYMTAB_CONSTS.FunctionBlock) {\r\n                throw new Sk.builtin.SyntaxError(\"'return' outside function\", this.filename, s.lineno, ...get_context(s));\r\n            }\r\n            val = s.value ? this.vexpr(s.value) : \"Sk.builtin.none.none$\";\r\n            // Track that we are about to call the function\r\n            if (this.filename && !this.filename.startsWith(\"src/lib/\")) {\r\n                out(\"Sk.beforeReturn && Sk.beforeReturn(\"+val+\");\");\r\n            }\r\n            //out(\"Sk.execStack.pop();\");\r\n            if (this.u.finallyBlocks.length == 0) {\r\n                out(\"return \", val, \";\");\r\n            } else {\r\n                out(\"$postfinally={returning:\", val, \"};\");\r\n                this._jump(this.peekFinallyBlock().blk);\r\n            }\r\n            break;\r\n        case Sk.astnodes.Delete:\r\n            this.vseqexpr(s.targets);\r\n            break;\r\n        case Sk.astnodes.Assign:\r\n            n = s.targets.length;\r\n            val = this.vexpr(s.value);\r\n            for (i = 0; i < n; ++i) {\r\n                this.vexpr(s.targets[i], val);\r\n            }\r\n            break;\r\n        case Sk.astnodes.AnnAssign:\r\n            return this.cannassign(s);\r\n        case Sk.astnodes.AugAssign:\r\n            return this.caugassign(s);\r\n        case Sk.astnodes.Print:\r\n            this.cprint(s);\r\n            break;\r\n        case Sk.astnodes.For:\r\n            return this.cfor(s);\r\n        case Sk.astnodes.While:\r\n            return this.cwhile(s);\r\n        case Sk.astnodes.If:\r\n            return this.cif(s);\r\n        case Sk.astnodes.Raise:\r\n            return this.craise(s);\r\n        case Sk.astnodes.Try:\r\n            return this.ctry(s);\r\n        case Sk.astnodes.With:\r\n            return this.cwith(s, 0);\r\n        case Sk.astnodes.Assert:\r\n            return this.cassert(s);\r\n        case Sk.astnodes.Import:\r\n            return this.cimport(s);\r\n        case Sk.astnodes.ImportFrom:\r\n            return this.cfromimport(s);\r\n        case Sk.astnodes.Global:\r\n            break;\r\n        case Sk.astnodes.Expr:\r\n            // TODO: Check if str, then decide if we retain string literal comments\r\n            if (this.retainComments || s.value.constructor !== Sk.astnodes.Str) {\r\n                this.vexpr(s.value);\r\n            }\r\n            break;\r\n        case Sk.astnodes.Pass:\r\n            break;\r\n        case Sk.astnodes.Break:\r\n            this.cbreak(s);\r\n            break;\r\n        case Sk.astnodes.Continue:\r\n            this.ccontinue(s);\r\n            break;\r\n        case Sk.astnodes.Debugger:\r\n            out(\"debugger;\");\r\n            break;\r\n        default:\r\n            Sk.asserts.fail(\"unhandled case in vstmt: \" + JSON.stringify(s));\r\n    }\r\n};\r\n\r\nCompiler.prototype.vseqstmt = function (stmts) {\r\n    var i;\r\n    for (i = 0; i < stmts.length; ++i) {\r\n        this.vstmt(stmts[i]);\r\n    }\r\n};\r\n\r\nvar OP_FAST = 0;\r\nvar OP_GLOBAL = 1;\r\nvar OP_DEREF = 2;\r\nvar OP_NAME = 3;\r\nvar D_NAMES = 0;\r\nvar D_FREEVARS = 1;\r\nvar D_CELLVARS = 2;\r\n\r\nCompiler.prototype.isCell = function (name) {\r\n    var mangled = fixReserved(mangleName(this.u.private_, name).v);\r\n    var scope = this.u.ste.getScope(mangled);\r\n    var dict = null;\r\n    return scope === Sk.SYMTAB_CONSTS.CELL;\r\n\r\n};\r\n\r\n/**\r\n * @param {Sk.builtin.str} name\r\n * @param {Object} ctx\r\n * @param {string=} dataToStore\r\n */\r\nCompiler.prototype.nameop = function (name, ctx, dataToStore) {\r\n    var v;\r\n    var mangledNoPre;\r\n    var dict;\r\n    var scope;\r\n    var optype;\r\n    var op;\r\n    var mangled;\r\n    if ((ctx === Sk.astnodes.Store || ctx === Sk.astnodes.AugStore || ctx === Sk.astnodes.Del) && name.v === \"__debug__\") {\r\n        // TODO: add in context\r\n        throw new Sk.builtin.SyntaxError(\"can not assign to __debug__\", this.filename, this.u.lineno, ...get_context(this.u));\r\n    }\r\n    Sk.asserts.assert(name.v !== \"None\");\r\n\r\n    if (name.v === \"NotImplemented\") {\r\n        return \"Sk.builtin.NotImplemented.NotImplemented$\";\r\n    }\r\n\r\n    mangled = mangleName(this.u.private_, name).v;\r\n    // Have to do this before looking it up in the scope\r\n    mangled = fixReserved(mangled);\r\n    op = 0;\r\n    optype = OP_NAME;\r\n    scope = this.u.ste.getScope(mangled);\r\n    dict = null;\r\n    switch (scope) {\r\n        case Sk.SYMTAB_CONSTS.FREE:\r\n            dict = \"$free\";\r\n            optype = OP_DEREF;\r\n            break;\r\n        case Sk.SYMTAB_CONSTS.CELL:\r\n            dict = \"$cell\";\r\n            optype = OP_DEREF;\r\n            break;\r\n        case Sk.SYMTAB_CONSTS.LOCAL:\r\n            // can't do FAST in generators or at module/class scope\r\n            if (this.u.ste.blockType === Sk.SYMTAB_CONSTS.FunctionBlock && !this.u.ste.generator) {\r\n                optype = OP_FAST;\r\n            }\r\n            break;\r\n        case Sk.SYMTAB_CONSTS.GLOBAL_IMPLICIT:\r\n            if (this.u.ste.blockType === Sk.SYMTAB_CONSTS.FunctionBlock) {\r\n                optype = OP_GLOBAL;\r\n            }\r\n            break;\r\n        case Sk.SYMTAB_CONSTS.GLOBAL_EXPLICIT:\r\n            optype = OP_GLOBAL;\r\n        default:\r\n            break;\r\n    }\r\n\r\n\r\n    //print(\"mangled\", mangled);\r\n    // TODO TODO TODO todo; import * at global scope failing here\r\n    Sk.asserts.assert(scope || name.v.charAt(1) === \"_\");\r\n\r\n    // in generator or at module scope, we need to store to $loc, rather that\r\n    // to actual JS stack variables.\r\n    mangledNoPre = mangled;\r\n    if (this.u.ste.generator || this.u.ste.blockType !== Sk.SYMTAB_CONSTS.FunctionBlock) {\r\n        mangled = \"$loc.\" + mangled;\r\n    } else if (optype === OP_FAST || optype === OP_NAME) {\r\n        this.u.localnames.push(mangled);\r\n    }\r\n\r\n    switch (optype) {\r\n        case OP_FAST:\r\n            switch (ctx) {\r\n                case Sk.astnodes.Load:\r\n                case Sk.astnodes.Param:\r\n                    // Need to check that it is bound!\r\n                    // out(\"Sk.misceval.checkUnbound(\"+mangled+\", '\"+mangled+\"');\");\r\n                    //out(\"if (\", mangled, \" === undefined) { throw new Sk.builtin.UnboundLocalError('local variable \\\\\\'\", mangled, \"\\\\\\' referenced before assignment'); }\\n\");\r\n                    out(\"if (\", mangled, \" === undefined) { $ule('\", mangled, \"') }\\n\");\r\n                    return mangled;\r\n                case Sk.astnodes.Store:\r\n                    out(mangled, \"=\", dataToStore, \";\");\r\n                    break;\r\n                case Sk.astnodes.Del:\r\n                    out(\"delete \", mangled, \";\");\r\n                    break;\r\n                default:\r\n                    Sk.asserts.fail(\"unhandled\");\r\n            }\r\n            break;\r\n        case OP_NAME:\r\n            switch (ctx) {\r\n                case Sk.astnodes.Load:\r\n                    // can't be || for loc.x = 0 or null\r\n                    return this._gr(\"loadname\", mangled, \"!==undefined?\", mangled, \":Sk.misceval.loadname('\", mangledNoPre, \"',$gbl);\");\r\n                case Sk.astnodes.Store:\r\n                    out(mangled, \"=\", dataToStore, \";\");\r\n                    break;\r\n                case Sk.astnodes.Del:\r\n                    out(\"delete \", mangled, \";\");\r\n                    break;\r\n                case Sk.astnodes.Param:\r\n                    return mangled;\r\n                default:\r\n                    Sk.asserts.fail(\"unhandled\");\r\n            }\r\n            break;\r\n        case OP_GLOBAL:\r\n            switch (ctx) {\r\n                case Sk.astnodes.Load:\r\n                    return this._gr(\"loadgbl\", \"Sk.misceval.loadname('\", mangledNoPre, \"',$gbl)\");\r\n                case Sk.astnodes.Store:\r\n                    out(\"$gbl.\", mangledNoPre, \"=\", dataToStore, \";\");\r\n                    break;\r\n                case Sk.astnodes.Del:\r\n                    out(\"delete $gbl.\", mangledNoPre);\r\n                    break;\r\n                default:\r\n                    Sk.asserts.fail(\"unhandled case in name op_global\");\r\n            }\r\n            break;\r\n        case OP_DEREF:\r\n            switch (ctx) {\r\n                case Sk.astnodes.Load:\r\n                    return dict + \".\" + mangledNoPre;\r\n                case Sk.astnodes.Store:\r\n                    out(dict, \".\", mangledNoPre, \"=\", dataToStore, \";\");\r\n                    break;\r\n                case Sk.astnodes.Param:\r\n                    return mangledNoPre;\r\n                default:\r\n                    Sk.asserts.fail(\"unhandled case in name op_deref\");\r\n            }\r\n            break;\r\n        default:\r\n            Sk.asserts.fail(\"unhandled case\");\r\n    }\r\n};\r\n\r\n/**\r\n * @param {Sk.builtin.str} name\r\n * @param {Object} key\r\n * @param {number} lineno\r\n * @param {boolean=} canSuspend\r\n * @param {String=} hint\r\n */\r\nCompiler.prototype.enterScope = function (name, key, lineno, canSuspend, hint) {\r\n    var scopeName;\r\n    var u = new CompilerUnit();\r\n    u.ste = this.st.getStsForAst(key);\r\n    u.name = name;\r\n    u.firstlineno = lineno;\r\n    u.canSuspend = canSuspend || false;\r\n\r\n    if (this.u && this.u.private_) {\r\n        u.private_ = this.u.private_;\r\n    }\r\n\r\n    this.stack.push(this.u);\r\n    this.allUnits.push(u);\r\n    hint = hint || \"\";\r\n    hint = hint.replace(/[\\<\\>\\/\\.]/g, \"_\");\r\n    scopeName = this.gensym(\"scope\"+hint);\r\n    u.scopename = scopeName;\r\n\r\n    this.u = u;\r\n    this.u.activateScope();\r\n\r\n    this.nestlevel++;\r\n\r\n    return scopeName;\r\n};\r\n\r\nCompiler.prototype.exitScope = function () {\r\n    var mangled;\r\n    var prev = this.u;\r\n    this.nestlevel--;\r\n    if (this.stack.length - 1 >= 0) {\r\n        this.u = this.stack.pop();\r\n    } else {\r\n        this.u = null;\r\n    }\r\n    if (this.u) {\r\n        this.u.activateScope();\r\n    }\r\n\r\n    if (prev.name.v !== \"<module>\") {// todo; hacky\r\n        mangled = prev.name[\"$r\"]().v;\r\n        mangled = mangled.substring(1, mangled.length - 1);\r\n        // mangled = fixReserved(mangled);\r\n        let mname = this.makeConstant(\"new Sk.builtin.str('\" + mangled + \"')\");\r\n        out(prev.scopename, \".co_name=\"+mname+\";\");\r\n        if (this.stack.length && this.u.ste.blockType == \"class\") {\r\n            const classname = this.u.name.v;\r\n            out(prev.scopename, \".co_qualname=new Sk.builtins.str('\" + classname + \".\" + mangled + \"');\");\r\n        }\r\n    }\r\n    for (var constant in prev.consts) {\r\n        if (prev.consts.hasOwnProperty(constant)) {\r\n            prev.suffixCode += constant + \" = \" + prev.consts[constant] + \";\";\r\n        }\r\n    }\r\n};\r\n\r\n/**\r\n * @param {Array} stmts\r\n * @param {Sk.builtin.str=} class_for_super\r\n */\r\nCompiler.prototype.cbody = function (stmts, class_for_super) {\r\n    var i = 0;\r\n\r\n    // If we have a docstring, then assign it to __doc__, and skip over\r\n    // the expression when properly compiling the rest of the body.  This\r\n    // happens for class and module bodies.\r\n    //\r\n    const maybeDocstring = this.maybeCDocstringOfBody(stmts);\r\n    if (maybeDocstring !== null) {\r\n        out(\"$loc.__doc__ = \", maybeDocstring, \";\");\r\n        i = 1;\r\n    }\r\n\r\n    for (; i < stmts.length; ++i) {\r\n        this.vstmt(stmts[i], class_for_super);\r\n    }\r\n    /* Every annotated class and module should have __annotations__. */\r\n    if (this.u.hasAnnotations) {\r\n        this.u.varDeclsCode += \"$loc.__annotations__ || ($loc.__annotations__ = new Sk.builtin.dict());\";\r\n    }\r\n};\r\n\r\nCompiler.prototype.cprint = function (s) {\r\n    var i;\r\n    var n;\r\n    var dest;\r\n    Sk.asserts.assert(s instanceof Sk.astnodes.Print);\r\n    dest = \"null\";\r\n    if (s.dest) {\r\n        dest = this.vexpr(s.dest);\r\n    }\r\n\r\n    n = s.values.length;\r\n    // todo; dest disabled\r\n    for (i = 0; i < n; ++i) {\r\n        out(\"$ret = Sk.misceval.print_(\", /*dest, ',',*/ \"new Sk.builtins['str'](\", this.vexpr(s.values[i]), \").v);\");\r\n        this._checkSuspension(s);\r\n    }\r\n    if (s.nl) {\r\n        out(\"$ret = Sk.misceval.print_(\", /*dest, ',*/ \"\\\"\\\\n\\\");\");\r\n        this._checkSuspension(s);\r\n    }\r\n\r\n};\r\n\r\nCompiler.prototype.cmod = function (mod) {\r\n    //print(\"-----\");\r\n    //print(Sk.astDump(mod));\r\n    var modf = this.enterScope(new Sk.builtin.str(\"<module>\"), mod, 0, this.canSuspend, this.filename);\r\n\r\n    var entryBlock = this.newBlock(\"module entry\");\r\n    this.u.prefixCode = \"var \" + modf + \"=(function($forcegbl, $forceloc){\";\r\n    this.u.varDeclsCode =\r\n        \"var $gbl = $forcegbl || {}, $blk=\" + entryBlock +\r\n        \",$exc=[],$loc=$forceloc || $gbl,$cell={},$err=undefined;\" +\r\n        \"$loc.__file__=new Sk.builtins.str($fname);\" +\r\n        \"var $ret=undefined,$postfinally=undefined,$currLineNo=undefined,$currColNo=undefined;$currSource=undefined;\";\r\n\r\n    if (Sk.execLimit !== null) {\r\n        this.u.varDeclsCode += \"Sk.misceval.startTimer();\";\r\n    }\r\n\r\n    if (Sk.yieldLimit !== null && this.u.canSuspend) {\r\n        this.u.varDeclsCode += \"Sk.misceval.resetYield();\";\r\n    }\r\n\r\n    this.u.varDeclsCode += \"var $waking=false; if (\" + modf + \".$wakingSuspension!==undefined) { $wakeFromSuspension(); $waking=true; }\" +\r\n        \"if (Sk.retainGlobals) {\" +\r\n        //\"    if (Sk.globals) { $gbl = Sk.globals; Sk.globals = $gbl; $loc = $gbl; }\" +\r\n        \"    if (Sk.globals) { $gbl = Sk.globals; Sk.globals = $gbl; $loc = $gbl; $loc.__file__=new Sk.builtins.str($fname);}\" +\r\n        \"    else { Sk.globals = $gbl; }\" +\r\n        \"} else { Sk.globals = $gbl; }\";\r\n\r\n    // Add the try block that pops the try/except stack if one exists\r\n    // Github Issue #38\r\n    // Google Code Issue: 109 / 114\r\n\r\n    // Old code:\r\n    //this.u.switchCode = \"while(true){switch($blk){\";\r\n    //this.u.suffixCode = \"}}});\";\r\n\r\n    // New Code:\r\n    this.u.switchCode = \"while(true){try{\";\r\n    this.u.switchCode += this.outputInterruptTest();\r\n    this.u.switchCode += \"switch($blk){\";\r\n    this.u.suffixCode = \"}\" + this.handleTraceback(true, \"<module>\");\r\n    this.u.suffixCode += \"});\";\r\n    //this.u.suffixCode += \"}catch(err){ if (err instanceof Sk.builtin.TimeoutError) { Sk.execStart = Date.now();Sk.execPaused=0} if (!(err instanceof Sk.builtin.BaseException)) { err = new Sk.builtin.ExternalError(err); } err.traceback.push({lineno: $currLineNo, colno: $currColNo, filename: '\"+this.filename+\"'}); if ($exc.length>0) { $err = err; $blk=$exc.pop(); continue; } else { throw err; }} } });\";\r\n\r\n    // Note - this change may need to be adjusted for all the other instances of\r\n    // switchCode and suffixCode in this file.  Not knowing how to test those\r\n    // other cases I left them alone.   At least the changes to\r\n    // setupExcept and endExcept will insure that the generated JavaScript\r\n    // will be syntactically correct.  The worst that will happen is that when\r\n    // code in a try block blows up, we will not know to run the except block.\r\n    // The other problem is that we might catch something that is really an internal\r\n    // error - it might be nice to add code in the above catch block that looked at\r\n    // the kind of exception and only popped the stack for exceptions that are\r\n    // from the original code rather than artifacts of some code generation or\r\n    // exeution environment error.  We at least err on the side of exceptions\r\n    // being revealed to the user.  drchuck - Wed Jan 23 19:20:18 EST 2013\r\n\r\n    switch (mod.constructor) {\r\n        case Sk.astnodes.Module:\r\n            this.cbody(mod.body);\r\n            out(\"return $loc;\");\r\n            break;\r\n        default:\r\n            Sk.asserts.fail(\"todo; unhandled case in compilerMod\");\r\n    }\r\n    this.exitScope();\r\n\r\n    this.result.push(this.outputAllUnits());\r\n    return modf;\r\n};\r\n\r\nCompiler.prototype.handleTraceback = function (doContinue, scopeName) {\r\n    doContinue = doContinue ? \"continue\" : \"\";\r\n    return \"}catch(err){\" +\r\n        \"err=Sk.misceval.handleTraceback(err,$currLineNo,$currColNo,$currSource,$fname,'\" + scopeName + \"');\" +\r\n        \"if($exc.length>0){$err=err;$blk=$exc.pop();\" + doContinue + \"}else{throw err;}}}\";\r\n};\r\n\r\n/**\r\n * @param {string} source the code\r\n * @param {string} filename where it came from\r\n * @param {string} mode one of 'exec', 'eval', or 'single'\r\n * @param {boolean=} canSuspend if the generated code supports suspension\r\n * @param {boolean=} annotate Whether or not to annotate the source code\r\n */\r\nSk.compile = function (source, filename, mode, canSuspend, annotate) {\r\n    //print(\"FILE:\", filename);\r\n    // __future__ flags can be set from code\r\n    // (with \"from __future__ import ...\" statements),\r\n    // so make a temporary object that can be edited.\r\n    var savedFlags = Sk.__future__;\r\n    Sk.__future__ = Object.create(Sk.__future__);\r\n\r\n    var parse = Sk.parse(filename, source);\r\n    var ast = Sk.astFromParse(parse.cst, filename, parse.flags);\r\n    // console.log(JSON.stringify(ast, undefined, 2));\r\n\r\n    // compilers flags, later we can add other ones too\r\n    var flags = {};\r\n    flags.cf_flags = parse.flags;\r\n\r\n\r\n    var st = Sk.symboltable(ast, filename);\r\n    var c = new Compiler(filename, st, flags.cf_flags, canSuspend, annotate ? source : false); // todo; CO_xxx\r\n    var funcname = c.cmod(ast);\r\n\r\n    // Restore the global __future__ flags\r\n    Sk.__future__ = savedFlags;\r\n\r\n    var shortCutConstants = \"const $fname='\" + filename + \"',$moduleConstants={},$ule=Sk.misceval.errorUL;\";\r\n    var constantDefinitions = [];\r\n    for (var constant in c.consts) {\r\n        if (c.consts.hasOwnProperty(constant)) {\r\n            constantDefinitions.push(constant + \" = \" + c.consts[constant] + \";\");\r\n        }\r\n    }\r\n\r\n    var ret = (\"$compiledmod = function() {\" +\r\n        shortCutConstants +\r\n        c.result.join(\"\") +\r\n        constantDefinitions.join(\"\") +\r\n        \"\\nreturn \" + funcname + \";}();\");\r\n    return {\r\n        funcname: \"$compiledmod\",\r\n        code    : ret,\r\n        filename: filename,\r\n    };\r\n};\r\n\r\nSk.exportSymbol(\"Sk.compile\", Sk.compile);\r\n\r\nSk.resetCompiler = function () {\r\n    Sk.gensymcount = 0;\r\n};\r\n\r\nSk.exportSymbol(\"Sk.resetCompiler\", Sk.resetCompiler);\r\n\r\nSk.fixReserved = fixReserved;\r\nSk.exportSymbol(\"Sk.fixReserved\", Sk.fixReserved);\r\n\r\nSk.unfixReserved = unfixReserved;\r\nSk.exportSymbol(\"Sk.unfixReserved\", Sk.unfixReserved);\r\n\r\nSk.mangleName = mangleName;\r\nSk.exportSymbol(\"Sk.mangleName\", Sk.mangleName);\r\n\r\nSk.reservedWords_ = reservedWords_;\r\nSk.exportSymbol(\"Sk.reservedWords_\", Sk.reservedWords_);\r\n","/**\r\n * @description\r\n * see [Cpython complex_new](https://hg.python.org/cpython/file/f0e2caad4200/Objects/complexobject.c#l911)\r\n * @constructor\r\n * @param {number} real part of the complex number\r\n * @param {number} imag part of the complex number\r\n *\r\n * Prefering here == instead of ===, otherwise also undefined has to be matched explicitly\r\n * @extends {Sk.builtin.object}\r\n *\r\n */\r\nSk.builtin.complex = Sk.abstr.buildNativeClass(\"complex\", {\r\n    constructor: function complex(real, imag) {\r\n        Sk.asserts.assert(this instanceof Sk.builtin.complex, \"bad call to complex constructor, use 'new'\");\r\n        this.real = real;\r\n        this.imag = imag;\r\n    },\r\n    slots: /**@lends {Sk.builtin.complex.prototype}*/{\r\n        tp$as_number: true,\r\n        tp$doc:\r\n            \"Create a complex number from a real part and an optional imaginary part.\\n\\nThis is equivalent to (real + imag*1j) where imag defaults to 0.\",\r\n        tp$hash() {\r\n            // _PyHASH_IMAG refers to _PyHASH_MULTIPLIER which refers to 1000003\r\n            const real_hash = new Sk.builtin.float_(this.real).tp$hash();\r\n            const imag_hash = new Sk.builtin.float_(this.imag).tp$hash();\r\n            const v = imag_hash * 1003 + real_hash;\r\n            if (Sk.builtin.int_.withinThreshold(v)) {\r\n                return v;\r\n            }\r\n            return new Sk.builtin.int_(JSBI.BigInt(v)).tp$hash();\r\n        },\r\n        tp$getattr: Sk.generic.getAttr,\r\n        tp$new(args, kwargs) {\r\n            args = Sk.abstr.copyKeywordsToNamedArgs(\"complex\", [\"real\", \"imag\"], args, kwargs, [null, null]);\r\n            return complex_from_py.call(this, args[0], args[1]);\r\n        },\r\n        tp$richcompare(w, op) {\r\n            if (op !== \"Eq\" && op !== \"NotEq\") {\r\n                if (Sk.builtin.checkNumber(w) || _complex_check(w)) {\r\n                    throw new Sk.builtin.TypeError(\"no ordering relation is defined for complex numbers\");\r\n                }\r\n                return Sk.builtin.NotImplemented.NotImplemented$;\r\n            }\r\n            return complexNumberSlot(function (a_real, a_imag, b_real, b_imag) {\r\n                const equal = a_real == b_real && a_imag == b_imag;\r\n                return op === \"Eq\" ? equal : !equal;\r\n            }, true).call(this, w);\r\n        },\r\n        $r() {\r\n            return complex_format(this, null, \"g\");\r\n        },\r\n\r\n        // number slots\r\n        nb$int() {\r\n            throw new Sk.builtin.TypeError(\"can't convert complex to int\");\r\n        },\r\n        nb$long() {\r\n            throw new Sk.builtin.TypeError(\"can't convert complex to long\");\r\n        },\r\n        nb$float() {\r\n            throw new Sk.builtin.TypeError(\"can't convert complex to float\");\r\n        },\r\n        nb$positive() {\r\n            return new Sk.builtin.complex(this.real, this.imag);\r\n        },\r\n        nb$negative() {\r\n            return new Sk.builtin.complex(-this.real, -this.imag);\r\n        },\r\n        nb$bool() {\r\n            return this.real || this.imag;\r\n        },\r\n        nb$add: complexNumberSlot((a_real, a_imag, b_real, b_imag) => {\r\n            return new Sk.builtin.complex(a_real + b_real, a_imag + b_imag);\r\n        }),\r\n        nb$subtract: complexNumberSlot((a_real, a_imag, b_real, b_imag) => {\r\n            return new Sk.builtin.complex(a_real - b_real, a_imag - b_imag);\r\n        }),\r\n        nb$reflected_subtract: complexNumberSlot((a_real, a_imag, b_real, b_imag) => {\r\n            return new Sk.builtin.complex(b_real - a_real, b_imag - a_imag);\r\n        }),\r\n        nb$multiply: complexNumberSlot((a_real, a_imag, b_real, b_imag) => {\r\n            return new Sk.builtin.complex(b_real * a_real - b_imag * a_imag, a_real * b_imag + a_imag * b_real);\r\n        }),\r\n        nb$divide: complexNumberSlot(divide),\r\n        nb$reflected_divide: complexNumberSlot((a_real, a_imag, b_real, b_imag) => {\r\n            return divide(b_real, b_imag, a_real, a_imag);\r\n        }),\r\n        nb$floor_divide(other) {\r\n            throw new Sk.builtin.TypeError(\"can't take floor of complex number.\");\r\n        },\r\n        nb$reflected_floor_divide(other) {\r\n            throw new Sk.builtin.TypeError(\"can't take floor of complex number.\");\r\n        },\r\n        nb$remainder(other) {\r\n            throw new Sk.builtin.TypeError(\"can't mod complex numbers.\");\r\n        },\r\n        nb$reflected_remainder(other) {\r\n            throw new Sk.builtin.TypeError(\"can't mod complex numbers.\");\r\n        },\r\n        nb$divmod(other) {\r\n            throw new Sk.builtin.TypeError(\"can't take floor or mod of complex number.\");\r\n        },\r\n        nb$power(other, z) {\r\n            if (z != null && !Sk.builtin.checkNone(z)) {\r\n                throw new Sk.builtin.ValueError(\"complex modulo\");\r\n            }\r\n            return power.call(this, other);\r\n        },\r\n\r\n        nb$abs() {\r\n            const _real = this.real;\r\n            const _imag = this.imag;\r\n            if (!_is_finite(_real) || !_is_finite(_imag)) {\r\n                /* C99 rules: if either the real or the imaginary part is an\r\n                   infinity, return infinity, even if the other part is a\r\n                   NaN.\r\n                */\r\n                if (_is_infinity(_real)) {\r\n                    return new Sk.builtin.float_(Math.abs(_real));\r\n                } else if (_is_infinity(_imag)) {\r\n                    return new Sk.builtin.float_(Math.abs(_imag));\r\n                }\r\n                /* either the real or imaginary part is a NaN,\r\n                   and neither is infinite. Result should be NaN. */\r\n                return new Sk.builtin.float_(NaN);\r\n            }\r\n            const result = Math.hypot(_real, _imag);\r\n            if (!_is_finite(result)) {\r\n                throw new Sk.builtin.OverflowError(\"absolute value too large\");\r\n            }\r\n            return new Sk.builtin.float_(result);\r\n        },\r\n    },\r\n    getsets: {\r\n        real: {\r\n            $get() {\r\n                return new Sk.builtin.float_(this.real);\r\n            },\r\n            $doc: \"the real part of a complex number\",\r\n        },\r\n        imag: {\r\n            $get() {\r\n                return new Sk.builtin.float_(this.imag);\r\n            },\r\n            $doc: \"the imaginary part of a complex number\",\r\n        },\r\n    },\r\n    methods: /**@lends {Sk.builtin.complex.prototype}*/{\r\n        conjugate: {\r\n            $meth() {\r\n                return new Sk.builtin.complex(this.real, -this.imag);\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: null,\r\n            $doc: \"complex.conjugate() -> complex\\n\\nReturn the complex conjugate of its argument. (3-4j).conjugate() == 3+4j.\",\r\n        },\r\n        __getnewargs__: {\r\n            $meth() {\r\n                return new Sk.builtin.tuple([new Sk.builtin.float_(this.real), new Sk.builtin.float_(this.imag)]);\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: null,\r\n            $doc: Sk.builtin.none.none$,\r\n        },\r\n        __format__: {\r\n            $meth(format_spec) {\r\n                if (Sk.builtin.checkString(format_spec)) {\r\n                    // currently just returns not implemented.\r\n                    return _PyComplex_FormatAdvanced(this, format_spec);\r\n                }\r\n                throw new Sk.builtin.TypeError(\"__format__ requires str\");\r\n            },\r\n            $flags: {OneArg: true},\r\n            $textsig: null,\r\n            $doc: \"complex.__format__() -> str\\n\\nConvert to a string according to format_spec.\",\r\n        },\r\n    },\r\n});\r\n\r\nSk.exportSymbol(\"Sk.builtin.complex\", Sk.builtin.complex);\r\n\r\n/**\r\n * @function\r\n *\r\n * @description\r\n * returns a Number if the object passed as a __float__ method\r\n * Otherwise throws an error\r\n *\r\n * @param {Sk.builtin.object} op\r\n *\r\n * @ignore\r\n */\r\nfunction PyFloat_AsDouble(op) {\r\n    let v = op.v;\r\n    if (typeof v === \"number\") {\r\n        return v;\r\n    } else if (op.nb$float) {\r\n        v = op.nb$float();\r\n    }\r\n    if (v === undefined) {\r\n        throw new Sk.builtin.TypeError(\"a float is required\");\r\n    }\r\n    return v.v;\r\n}\r\n\r\n/**\r\n * @function\r\n *\r\n * @description\r\n * checks and tries the __complex__ method\r\n * throws an error if this returns a non complex object\r\n * returns null if that function does not exist\r\n *\r\n *\r\n * @param {Sk.builtin.object} op\r\n *\r\n * @ignore\r\n */\r\nfunction try_complex_special_method(op) {\r\n    // the lookup special method does already all the magic\r\n    if (op == null) {\r\n        return null;\r\n    }\r\n    const f = Sk.abstr.lookupSpecial(op, Sk.builtin.str.$complex);\r\n    if (f !== undefined) {\r\n        // method on builtin, provide this arg\r\n        return Sk.misceval.callsimArray(f, []);\r\n    }\r\n    return null;\r\n}\r\n\r\n/**\r\n * @function\r\n *\r\n * @description\r\n * copied here for easy access\r\n * checks whether the argument is an instance of Sk.builtin.complex\r\n *\r\n * @return {boolean}\r\n *\r\n * @param {Sk.builtin.object} op\r\n * @ignore\r\n */\r\nconst _complex_check = Sk.builtin.checkComplex;\r\n\r\n/**\r\n * @function\r\n *\r\n * @description\r\n * this is the logic for tp$new\r\n *\r\n * @param {Sk.builtin.object} real\r\n * @param {Sk.builtin.object} imag\r\n *\r\n * @ignore\r\n */\r\nfunction complex_from_py(real, imag) {\r\n    let tmp; // pyObject\r\n    // var nbr, nbi; // real, imag as numbers\r\n    const cr = {}; // PyComplexObject\r\n    const ci = {}; // PyComplexObject\r\n    let cr_is_complex = false;\r\n    let ci_is_complex = false;\r\n\r\n    let r = real;\r\n    let i = imag;\r\n\r\n    // handle case if passed in arguments are of type complex\r\n    if (r != null && r.constructor === Sk.builtin.complex && i == null) {\r\n        // subtypes are handled later;\r\n        return r;\r\n    }\r\n\r\n    if (Sk.builtin.checkString(r)) {\r\n        if (i != null) {\r\n            throw new Sk.builtin.TypeError(\"complex() can't take second arg if first is a string\");\r\n        }\r\n        return Sk.builtin.complex.complex_subtype_from_string(r, this);\r\n    }\r\n\r\n    if (i != null && Sk.builtin.checkString(i)) {\r\n        throw new Sk.builtin.TypeError(\"complex() second arg can't be a string\");\r\n    }\r\n\r\n    // try_complex_special_method\r\n    tmp = try_complex_special_method(r);\r\n    if (tmp != null && tmp !== Sk.builtin.NotImplemented.NotImplemented$) {\r\n        if (!_complex_check(tmp)) {\r\n            throw new Sk.builtin.TypeError(\"__complex__ should return a complex object\");\r\n        }\r\n        r = tmp;\r\n    }\r\n\r\n    // just a temporary function to match cpython\r\n    function check_number(nb) {\r\n        return nb.nb$float !== undefined;\r\n    }\r\n\r\n    if (r != null) {\r\n        if (!check_number(r)) {\r\n            throw new Sk.builtin.TypeError(\"complex() first argument must be a string or a number, not '\" + Sk.abstr.typeName(r) + \"'\");\r\n        }\r\n    }\r\n\r\n    if (i != null) {\r\n        if (!check_number(i)) {\r\n            throw new Sk.builtin.TypeError(\"complex() second argument must be a number, not '\" + Sk.abstr.typeName(r) + \"'\");\r\n        }\r\n    }\r\n\r\n    /* If we get this far, then the \"real\" and \"imag\" parts should\r\n       both be treated as numbers, and the constructor should return a\r\n       complex number equal to (real + imag*1j).\r\n\r\n       Note that we do NOT assume the input to already be in canonical\r\n       form; the \"real\" and \"imag\" parts might themselves be complex\r\n       numbers, which slightly complicates the code below. */\r\n    if (r == null) {\r\n        cr.real = 0.0;\r\n        cr.imag = 0.0;\r\n    } else if (_complex_check(r)) {\r\n        /* Note that if r is of a complex subtype, we're only\r\n        retaining its real & imag parts here, and the return\r\n        value is (properly) of the builtin complex type. */\r\n        cr.real = r.real;\r\n        cr.imag = r.imag;\r\n        cr_is_complex = true;\r\n    } else {\r\n        /* The \"real\" part really is entirely real, and contributes\r\n        nothing in the imaginary direction.\r\n        Just treat it as a double. */\r\n        cr.real = PyFloat_AsDouble(r);\r\n        cr.imag = 0.0;\r\n    }\r\n\r\n    if (i == null) {\r\n        ci.real = 0.0;\r\n        ci.imag = 0.0;\r\n    } else if (_complex_check(i)) {\r\n        ci.real = i.real;\r\n        ci.imag = i.imag;\r\n        ci_is_complex = true;\r\n    } else {\r\n        /* The \"imag\" part really is entirely imaginary, and\r\n        contributes nothing in the real direction.\r\n        Just treat it as a double. */\r\n        ci.real = PyFloat_AsDouble(i);\r\n        ci.imag = 0.0;\r\n    }\r\n\r\n    /*  If the input was in canonical form, then the \"real\" and \"imag\"\r\n    parts are real numbers, so that ci.imag and cr.imag are zero.\r\n    We need this correction in case they were not real numbers. */\r\n\r\n    if (ci_is_complex === true) {\r\n        cr.real -= ci.imag;\r\n    }\r\n\r\n    if (cr_is_complex === true) {\r\n        ci.real += cr.imag;\r\n    }\r\n    return complex_subtype_from_doubles(cr.real, ci.real, this);\r\n}\r\n\r\n/**\r\n * @function\r\n *\r\n * @return {Sk.builtin.complex} an instance of complex - could be a subtype's instance\r\n *\r\n * @param {number} real\r\n * @param {number} imag\r\n * @param {Object} type_prototype Sk.builtin.complex.prototype\r\n * @ignore\r\n */\r\nfunction complex_subtype_from_doubles(real, imag, type_prototype) {\r\n    if (type_prototype === Sk.builtin.complex.prototype) {\r\n        return new Sk.builtin.complex(real, imag);\r\n    } else {\r\n        const instance = new type_prototype.constructor();\r\n        Sk.builtin.complex.call(instance, real, imag);\r\n        return instance;\r\n    }\r\n}\r\n\r\nconst invalidUnderscores = /_[eE]|[eE]_|\\._|_\\.|[+-]_|_j|j_/;\r\nconst validUnderscores = /_(?=[^_])/g;\r\n/**\r\n *\r\n * @function\r\n * @description Parses a string repr of a complex number\r\n * @param {*} val \r\n * @param {Object=} type_prototype \r\n * We leave this as Sk.builtin.complex since it is called by the compiler\r\n * @ignore\r\n */\r\nSk.builtin.complex.complex_subtype_from_string = function (val, type_prototype) {\r\n    type_prototype = type_prototype || Sk.builtin.complex.prototype;\r\n    var index;\r\n    var start;\r\n    var val_wws;              // val with removed beginning ws and (\r\n    var x = 0.0,\r\n        y = 0.0; // real, imag parts\r\n    var got_bracket = false;  // flag for braces\r\n    var len;                  // total length of val\r\n    var match;                // regex result\r\n\r\n    // first check if val is javascript string or python string\r\n    if (Sk.builtin.checkString(val)) {\r\n        val = Sk.ffi.remapToJs(val);\r\n    } else if (typeof val !== \"string\") {\r\n        throw new TypeError(\"provided unsupported string-alike argument\");\r\n    }\r\n\r\n    /* This is an python specific error, this does not do any harm in js, but we want\r\n     * to be as close to the orginial impl. as possible.\r\n     *\r\n     * Check also for empty strings. They are not allowed.\r\n     */\r\n    if (val.indexOf(\"\\0\") !== -1 || val.length === 0 || val === \"\") {\r\n        throw new Sk.builtin.ValueError(\"complex() arg is a malformed string\");\r\n    }\r\n\r\n    // transform to unicode\r\n    // ToDo: do we need this?\r\n    index = 0; // first char\r\n\r\n    // do some replacements for javascript floats\r\n    val = val.replace(/inf|infinity/gi, \"Infinity\");\r\n    val = val.replace(/nan/gi, \"NaN\");\r\n\r\n    /* position on first nonblank */\r\n    start = 0;\r\n    while (val[index] === \" \") {\r\n        index++;\r\n    }\r\n\r\n    if (val[index] === \"(\") {\r\n        /* skip over possible bracket from repr(). */\r\n        got_bracket = true;\r\n        index++;\r\n        while (val[index] === \" \") {\r\n            index++;\r\n        }\r\n    }\r\n\r\n    if (val.indexOf(\"_\") !== -1) {\r\n        if (invalidUnderscores.test(val)) {\r\n            throw new Sk.builtin.ValueError(\"could not convert string to complex: '\" + val + \"'\");\r\n        }\r\n\r\n        val = val.charAt(0) + val.substring(1).replace(validUnderscores, \"\");\r\n    }\r\n\r\n    /* a valid complex string usually takes one of the three forms:\r\n\r\n        <float>                - real part only\r\n        <float>j               - imaginary part only\r\n        <float><signed-float>j - real and imaginary parts\r\n\r\n        where <float> represents any numeric string that's accepted by the\r\n        float constructor (including 'nan', 'inf', 'infinity', etc.), and\r\n        <signed-float> is any string of the form <float> whose first character\r\n        is '+' or '-'.\r\n\r\n        For backwards compatibility, the extra forms\r\n\r\n          <float><sign>j\r\n          <sign>j\r\n          j\r\n\r\n        are also accepted, though support for these forms my be removed from\r\n        a future version of Python.\r\n     *      This is a complete regular expression for matching any valid python floats, e.g.:\r\n     *          - 1.0\r\n     *          - 0.\r\n     *          - .1\r\n     *          - nan/inf/infinity\r\n     *          - +-1.0\r\n     *          - +3.E-3\r\n     *\r\n     *      In order to work, this pattern requires only lower case characters\r\n     *      There is case insensitive group option in js.\r\n     *\r\n     *      the [eE] could be refactored to soley e\r\n     */\r\n    var float_regex2 = /^(?:[+-]?(?:(?:(?:\\d*\\.\\d+)|(?:\\d+\\.?))(?:[eE][+-]?\\d+)?|NaN|Infinity))/;\r\n    val_wws = val.substr(index); // val with removed whitespace and \"(\"\r\n\r\n    /* first try to match a float at the beginning */\r\n    match = val_wws.match(float_regex2);\r\n    if (match !== null) {\r\n        // one of the first 4 cases\r\n        index += match[0].length;\r\n\r\n        /* <float>j */\r\n        if (val[index] === \"j\" || val[index] === \"J\") {\r\n            y = parseFloat(match[0]);\r\n            index++;\r\n        } else if (val[index] === \"+\" || val[index] === \"-\") {\r\n            /* <float><signed-float>j | <float><sign>j */\r\n            x = parseFloat(match[0]);\r\n\r\n            match = val.substr(index).match(float_regex2);\r\n            if (match !== null) {\r\n                /* <float><signed-float>j */\r\n                y = parseFloat(match[0]);\r\n                index += match[0].length;\r\n            } else {\r\n                /* <float><sign>j */\r\n                y = val[index] === \"+\" ? 1.0 : -1.0;\r\n                index++;\r\n            }\r\n\r\n            if (val[index] !== \"j\" && val[index] !== \"J\") {\r\n                throw new Sk.builtin.ValueError(\"complex() arg is malformed string\");\r\n            }\r\n\r\n            index++;\r\n        } else {\r\n            /* <float> */\r\n            x = parseFloat(match[0]);\r\n        }\r\n    } else {\r\n        // maybe <sign>j or j\r\n        match = match = val_wws.match(/^([+-]?[jJ])/);\r\n        if (match !== null) {\r\n            if (match[0].length === 1) {\r\n                y = 1.0; // must be j\r\n            } else {\r\n                y = match[0][0] === \"+\" ? 1.0 : -1.0;\r\n            }\r\n\r\n            index += match[0].length;\r\n        }\r\n    }\r\n\r\n    while (val[index] === \" \") {\r\n        index++;\r\n    }\r\n\r\n    if (got_bracket) {\r\n        /* if there was an opening parenthesis, then the corresponding\r\n           closing parenthesis should be right here */\r\n        if (val[index] !== \")\") {\r\n            throw new Sk.builtin.ValueError(\"complex() arg is malformed string\");\r\n        }\r\n\r\n        index++;\r\n\r\n        while (val[index] === \" \") {\r\n            index++;\r\n        }\r\n    }\r\n\r\n    /* we should now be at the end of the string */\r\n    if (val.length !== index) {\r\n        throw new Sk.builtin.ValueError(\"complex() arg is malformed string\");\r\n    }\r\n\r\n    // return here complex number parts\r\n    return complex_subtype_from_doubles(x, y, type_prototype);\r\n};\r\n\r\n/**\r\n *\r\n * @function\r\n * @description\r\n *\r\n * A helper function for converting a big int to a number or throwing OverFlow\r\n * @ignore\r\n */\r\nfunction fromBigIntToNumberOrOverflow(big) {\r\n    const x = parseFloat(JSBI.toNumber(big));\r\n    if (x == Infinity || x == -Infinity) {\r\n        //trying to convert a large js string to a float\r\n        throw new Sk.builtin.OverflowError(\"int too large to convert to float\");\r\n    }\r\n    return x;\r\n}\r\n\r\n/**\r\n *\r\n * @function\r\n * @description\r\n * A wrapper to do the checks before passing the this.real, this.imag, other.real, other.imag\r\n * to the number function\r\n * @ignore\r\n * @param {function(number, number, number, number)} f \r\n * @param {boolean=} suppressOverflow\r\n */\r\nfunction complexNumberSlot(f, suppressOverflow) {\r\n    return function (other) {\r\n        const a_real = this.real;\r\n        const a_imag = this.imag;\r\n        let b_real = other.real;\r\n        let b_imag;\r\n        const other_v = other.v;\r\n        if (typeof b_real === \"number\") {\r\n            b_imag = other.imag;\r\n        } else if (typeof other_v === \"number\") {\r\n            b_real = other_v;\r\n            b_imag = 0.0;\r\n        } else if (JSBI.__isBigInt(other_v)) {\r\n            if (suppressOverflow === undefined) {\r\n                b_real = fromBigIntToNumberOrOverflow(other_v);\r\n            } else {\r\n                b_real = other_v.toString(); // weird case for tp_richcompare\r\n            }\r\n            b_imag = 0.0;\r\n        } else {\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        }\r\n\r\n        return f(a_real, a_imag, b_real, b_imag);\r\n    };\r\n}\r\n\r\nfunction divide(a_real, a_imag, b_real, b_imag) {\r\n    let ratio, denom, real, imag;\r\n    const abs_b_real = Math.abs(b_real);\r\n    const abs_b_imag = Math.abs(b_imag);\r\n    if (abs_b_real >= abs_b_imag) {\r\n        // divide tops and bottom by b_real\r\n        if (abs_b_real === 0.0) {\r\n            throw new Sk.builtin.ZeroDivisionError(\"complex division by zero\");\r\n        } else {\r\n            ratio = b_imag / b_real;\r\n            denom = b_real + b_imag * ratio;\r\n            real = (a_real + a_imag * ratio) / denom;\r\n            imag = (a_imag - a_real * ratio) / denom;\r\n        }\r\n    } else if (abs_b_imag >= abs_b_real) {\r\n        // divide tops and bottom by b.imag\r\n        ratio = b_real / b_imag;\r\n        denom = b_real * ratio + b_imag;\r\n        Sk.asserts.assert(b_imag !== 0.0);\r\n        real = (a_real * ratio + a_imag) / denom;\r\n        imag = (a_imag * ratio - a_real) / denom;\r\n    } else {\r\n        // At least one of b.real or b.imag is a NaN\r\n        real = NaN;\r\n        imag = NaN;\r\n    }\r\n\r\n    return new Sk.builtin.complex(real, imag);\r\n}\r\n\r\nconst power = complexNumberSlot((a_real, a_imag, b_real, b_imag) => {\r\n    const int_exponent = b_real | 0; // js convert to int\r\n    if (b_imag === 0.0 && b_real === int_exponent) {\r\n        return c_powi(a_real, a_imag, int_exponent);\r\n    } else {\r\n        return c_pow(a_real, a_imag, b_real, b_imag);\r\n    }\r\n});\r\n\r\n// power of complex a and complex exponent b\r\nfunction c_pow(a_real, a_imag, b_real, b_imag) {\r\n    let len, phase, real, imag;\r\n\r\n    if (b_real === 0.0 && b_imag === 0.0) {\r\n        real = 1.0;\r\n        imag = 0.0;\r\n    } else if (a_real === 0.0 && a_imag === 0.0) {\r\n        if (b_imag !== 0.0 || b_real < 0.0) {\r\n            throw new Sk.builtin.ZeroDivisionError(\"complex division by zero\");\r\n        }\r\n\r\n        real = 0.0;\r\n        imag = 0.0;\r\n    } else {\r\n        const vabs = Math.hypot(a_real, a_imag);\r\n        len = Math.pow(vabs, b_real);\r\n        const at = Math.atan2(a_imag, a_real);\r\n        phase = at * b_real;\r\n\r\n        if (b_imag !== 0.0) {\r\n            len /= Math.exp(at * b_imag);\r\n            phase += b_imag * Math.log(vabs);\r\n        }\r\n\r\n        real = len * Math.cos(phase);\r\n        imag = len * Math.sin(phase);\r\n    }\r\n    return new Sk.builtin.complex(real, imag);\r\n}\r\n\r\n// power of complex x and integer exponent n\r\nfunction c_powi(a_real, a_imag, n) {\r\n    if (n > 100 || n < -100) {\r\n        return c_pow(a_real, a_imag, n, 0.0);\r\n    } else if (n > 0) {\r\n        return c_powu(a_real, a_imag, n);\r\n    } else {\r\n        //  return c_quot(c_1,c_powu(x,-n));\r\n        const r = c_powu(a_real, a_imag, -n);\r\n        return divide(1.0, 0.0, r.real, r.imag);\r\n    }\r\n}\r\n\r\nfunction c_powu(a_real, a_imag, n) {\r\n    var r, p; // Py_complex\r\n    let mask = 1;\r\n    r = new Sk.builtin.complex(1.0, 0.0);\r\n    p = new Sk.builtin.complex(a_real, a_imag);\r\n\r\n    while (mask > 0 && n >= mask) {\r\n        if (n & mask) {\r\n            r = new Sk.builtin.complex(r.real * p.real - r.imag * p.imag, r.real * p.imag + p.real * r.imag);\r\n        }\r\n\r\n        mask <<= 1;\r\n        p = new Sk.builtin.complex(p.real * p.real - p.imag * p.imag, 2 * p.real * p.imag);\r\n    }\r\n\r\n    return r;\r\n}\r\n\r\n/**\r\n * Internal format function for repr and str\r\n * It is not intended for __format__ calls\r\n *\r\n * This functions assumes, that v is always instance of Sk.builtin.complex\r\n * @ignore\r\n */\r\nfunction complex_format(v, precision, format_code) {\r\n    function copysign(a, b) {\r\n        let sign;\r\n        if (b) {\r\n            sign = b < 0 ? -1 : 1;\r\n        } else {\r\n            sign = 1 / b < 0 ? -1 : 1;\r\n        }\r\n        return sign * Math.abs(a);\r\n    }\r\n\r\n    let result; // pyObject\r\n\r\n    let pre = \"\";\r\n    let im = \"\";\r\n    let re = null;\r\n    let lead = \"\";\r\n    let tail = \"\";\r\n    const real = v.real;\r\n    const imag = v.imag;\r\n\r\n    if (real === 0.0 && copysign(1.0, real) == 1.0) {\r\n        re = \"\";\r\n        im = PyOS_double_to_string(imag, format_code, precision, 0, null);\r\n        // im = imag;\r\n    } else {\r\n        /* Format imaginary part with sign, real part without */\r\n        pre = PyOS_double_to_string(real, format_code, precision, 0, null);\r\n        re = pre;\r\n\r\n        im = PyOS_double_to_string(imag, format_code, precision, PyOS_double_to_string.Py_DTSF_SIGN, null);\r\n\r\n        if (imag === 0 && 1 / imag === -Infinity && im && im[0] !== \"-\") {\r\n            im = \"-\" + im; // force negative zero sign\r\n        }\r\n\r\n        lead = \"(\";\r\n        tail = \")\";\r\n    }\r\n\r\n    result = \"\" + lead + re + im + \"j\" + tail; // concat all parts\r\n    return new Sk.builtin.str(result);\r\n}\r\n\r\n/**\r\n * https://hg.python.org/cpython/file/3cf2990d19ab/Objects/complexobject.c#l907\r\n * also see _PyComplex_FormatAdvanced\r\n * @ignore\r\n */\r\nfunction _PyComplex_FormatAdvanced(self, format_spec) {\r\n    throw new Sk.builtin.NotImplementedError(\"__format__ is not implemented for complex type.\");\r\n}\r\n\r\n/**\r\n Return true if float or double are is neither infinite nor NAN, else false\r\n Value is already a Javascript object\r\n @ignore\r\n */\r\nfunction _is_finite(val) {\r\n    return Number.isFinite(val);\r\n}\r\n\r\nfunction _is_infinity(val) {\r\n    return val === Infinity || val === -Infinity;\r\n}\r\n\r\n/**\r\n * Convert a double val to a string using supplied format_code, precision, and flags.\r\n *\r\n * format_code must be one of 'e', 'E', 'f', 'F', 'g', 'G' or 'r'. For 'r', the supplied precision must be 0 and is ignored. The 'r' format code specifies the standard repr() format.\r\n *\r\n * flags can be zero or more of the values Py_DTSF_SIGN, Py_DTSF_ADD_DOT_0, or Py_DTSF_ALT, or-ed together:\r\n *\r\n * Py_DTSF_SIGN means to always precede the returned string with a sign character, even if val is non-negative.\r\n * Py_DTSF_ADD_DOT_0 means to ensure that the returned string will not look like an integer.\r\n * Py_DTSF_ALT means to apply “alternate” formatting rules. See the documentation for the PyOS_snprintf() '#' specifier for details.\r\n * If ptype is non-NULL, then the value it points to will be set to one of Py_DTST_FINITE, Py_DTST_INFINITE, or Py_DTST_NAN, signifying that val is a finite number, an\r\n * infinite number, or not a number, respectively.\r\n * @ignore\r\n */\r\nfunction PyOS_double_to_string(val, format_code, precision, flags, type) {\r\n    let buf,\r\n        t,\r\n        upper = false;\r\n    // Validate format code, and map upper and lower case\r\n    switch (format_code) {\r\n        case \"e\": /* exponent */\r\n        case \"f\": /* fixed */\r\n        case \"g\" /* general */:\r\n            break;\r\n        case \"E\":\r\n            upper = true;\r\n            format_code = \"e\";\r\n            break;\r\n        case \"F\":\r\n            upper = true;\r\n            format_code = \"f\";\r\n            break;\r\n        case \"r\" /* repr format */:\r\n            // Supplied precision is unused, must be 0.\r\n            if (precision !== 0) {\r\n                throw new Error(\"Bad internall call\"); // only happens when somebody messes up calling this in js\r\n            }\r\n            // repr() precision is 17 significant decimal digits\r\n            precision = 17;\r\n            format_code = \"g\";\r\n            break;\r\n        default:\r\n            throw new Error(\"Bad internall call\");\r\n    }\r\n    // no need for buffer size calculation like in cpython\r\n    // Handle nan and inf\r\n    if (isNaN(val)) {\r\n        buf = \"nan\";\r\n        t = PyOS_double_to_string.Py_DTST_NAN;\r\n    } else if (val === Infinity) {\r\n        buf = \"inf\";\r\n        t = PyOS_double_to_string.Py_DTST_INFINITE;\r\n    } else if (val === -Infinity) {\r\n        buf = \"-inf\";\r\n        t = PyOS_double_to_string.Py_DTST_INFINITE;\r\n    } else {\r\n        t = PyOS_double_to_string.Py_DTST_FINITE;\r\n        if (flags & PyOS_double_to_string.Py_DTSF_ADD_DOT_0) {\r\n            format_code = \"g\"; // \"Z\"; _PyOS_ascii_formatd converts \"Z\" to \"g\"\r\n        }\r\n        // ToDo: call snprintf here\r\n        // ToDo: call ascii_formatd\r\n        var format_str = \"%\";\r\n        format_str += flags & PyOS_double_to_string.Py_DTSF_ALT ? \"#\" : \"\";\r\n\r\n        if (precision != null) {\r\n            format_str += \".\";\r\n            format_str += precision;\r\n        }\r\n\r\n        format_str += format_code;\r\n        format_str = new Sk.builtin.str(format_str);\r\n        /**\r\n         * We can call nb$remainder with val, because it gets unwrapped and it doesn't matter if it is\r\n         * already a javascript number. If we do not pass a float, we can't distinguish between ints and floats\r\n         * and therefore we can't adjust the sign of the zero accordingly\r\n         */\r\n        buf = format_str.nb$remainder(new Sk.builtin.float_(val));\r\n        buf = buf.v; // get javascript string\r\n    }\r\n    /**\r\n     * Add sign when requested. It's convenient (esp. when formatting complex numbers) to\r\n     * include sign even for inf and nan.\r\n     */\r\n    if (flags & PyOS_double_to_string.Py_DTSF_SIGN && buf[0] !== \"-\") {\r\n        buf = \"+\" + buf;\r\n    }\r\n    if (upper) {\r\n        // Convert to upper case\r\n        buf = buf.toUpperCase();\r\n    }\r\n    return buf;\r\n}\r\n\r\n/* PyOS_double_to_string's \"flags\" parameter can be set to 0 or more of: */\r\nPyOS_double_to_string.Py_DTSF_SIGN = 0x01; // always add the sign\r\nPyOS_double_to_string.Py_DTSF_ADD_DOT_0 = 0x02; // if the result is an integer add \".0\"\r\nPyOS_double_to_string.Py_DTSF_ALT = 0x04; // \"alternate\" formatting. it's format_code specific\r\n\r\n/* PyOS_double_to_string's \"type\", if non-NULL, will be set to one of: */\r\nPyOS_double_to_string.Py_DTST_FINITE = 0;\r\nPyOS_double_to_string.Py_DTST_INFINITE = 1;\r\nPyOS_double_to_string.Py_DTST_NAN = 2;\r\n","\r\n\r\n/* Constants used for kwargs */\r\n\r\n// String constants\r\nSk.builtin.str.$empty = new Sk.builtin.str(\"\");\r\nSk.builtin.str.$emptystr = Sk.builtin.str.$empty;\r\n\r\nSk.builtin.str.$utf8 = new Sk.builtin.str(\"utf-8\");\r\nSk.builtin.str.$ascii = new Sk.builtin.str(\"ascii\");\r\n\r\nSk.builtin.str.$default_factory = new Sk.builtin.str(\"default_factory\");\r\nSk.builtin.str.$imag = new Sk.builtin.str(\"imag\");\r\nSk.builtin.str.$real = new Sk.builtin.str(\"real\");\r\n\r\nSk.builtin.str.$abs = new Sk.builtin.str(\"__abs__\");\r\nSk.builtin.str.$bytes = new Sk.builtin.str(\"__bytes__\");\r\nSk.builtin.str.$call = new Sk.builtin.str(\"__call__\");\r\nSk.builtin.str.$class = new Sk.builtin.str(\"__class__\");\r\nSk.builtin.str.$class_getitem = new Sk.builtin.str(\"__class_getitem__\");\r\nSk.builtin.str.$cmp = new Sk.builtin.str(\"__cmp__\");\r\nSk.builtin.str.$complex = new Sk.builtin.str(\"__complex__\");\r\nSk.builtin.str.$contains = new Sk.builtin.str(\"__contains__\");\r\nSk.builtin.str.$copy = new Sk.builtin.str(\"__copy__\");\r\nSk.builtin.str.$dict = new Sk.builtin.str(\"__dict__\");\r\nSk.builtin.str.$dir = new Sk.builtin.str(\"__dir__\");\r\nSk.builtin.str.$doc = new Sk.builtin.str(\"__doc__\");\r\nSk.builtin.str.$enter = new Sk.builtin.str(\"__enter__\");\r\nSk.builtin.str.$eq = new Sk.builtin.str(\"__eq__\");\r\nSk.builtin.str.$exit = new Sk.builtin.str(\"__exit__\");\r\nSk.builtin.str.$import = new Sk.builtin.str(\"__import__\");\r\nSk.builtin.str.$index = new Sk.builtin.str(\"__index__\");\r\nSk.builtin.str.$init = new Sk.builtin.str(\"__init__\");\r\nSk.builtin.str.$int_ = new Sk.builtin.str(\"__int__\");\r\nSk.builtin.str.$iter = new Sk.builtin.str(\"__iter__\");\r\nSk.builtin.str.$file = new Sk.builtin.str(\"__file__\");\r\nSk.builtin.str.$float_ = new Sk.builtin.str(\"__float__\");\r\nSk.builtin.str.$format = new Sk.builtin.str(\"__format__\");\r\nSk.builtin.str.$ge = new Sk.builtin.str(\"__ge__\");\r\nSk.builtin.str.$getattr = new Sk.builtin.str(\"__getattr__\");\r\nSk.builtin.str.$getattribute = new Sk.builtin.str(\"__getattribute__\");\r\nSk.builtin.str.$getitem = new Sk.builtin.str(\"__getitem__\");\r\nSk.builtin.str.$gt = new Sk.builtin.str(\"__gt__\");\r\nSk.builtin.str.$keys = new Sk.builtin.str(\"keys\");\r\nSk.builtin.str.$le = new Sk.builtin.str(\"__le__\");\r\nSk.builtin.str.$len = new Sk.builtin.str(\"__len__\");\r\nSk.builtin.str.$length_hint = new Sk.builtin.str(\"__length_hint__\");\r\nSk.builtin.str.$loader = new Sk.builtin.str(\"__loader__\");\r\nSk.builtin.str.$lt = new Sk.builtin.str(\"__lt__\");\r\nSk.builtin.str.$module = new Sk.builtin.str(\"__module__\");\r\nSk.builtin.str.$missing = new Sk.builtin.str(\"__missing__\");\r\nSk.builtin.str.$name = new Sk.builtin.str(\"__name__\");\r\nSk.builtin.str.$ne = new Sk.builtin.str(\"__ne__\");\r\nSk.builtin.str.$new = new Sk.builtin.str(\"__new__\");\r\nSk.builtin.str.$next = new Sk.builtin.str(\"__next__\");\r\nSk.builtin.str.$path = new Sk.builtin.str(\"__path__\");\r\nSk.builtin.str.$package = new Sk.builtin.str(\"__package__\");\r\nSk.builtin.str.$qualname = new Sk.builtin.str(\"__qualname__\");\r\nSk.builtin.str.$repr = new Sk.builtin.str(\"__repr__\");\r\nSk.builtin.str.$reversed = new Sk.builtin.str(\"__reversed__\");\r\nSk.builtin.str.$round = new Sk.builtin.str(\"__round__\");\r\nSk.builtin.str.$setattr = new Sk.builtin.str(\"__setattr__\");\r\nSk.builtin.str.$setitem = new Sk.builtin.str(\"__setitem__\");\r\nSk.builtin.str.$str = new Sk.builtin.str(\"__str__\");\r\nSk.builtin.str.$trunc = new Sk.builtin.str(\"__trunc__\");\r\nSk.builtin.str.$write = new Sk.builtin.str(\"write\");\r\nSk.builtin.str.$sys = new Sk.builtin.str(\"sys\");\r\n\r\nSk.misceval.op2method_ = {\r\n    \"Eq\": Sk.builtin.str.$eq,\r\n    \"NotEq\": Sk.builtin.str.$ne,\r\n    \"Gt\": Sk.builtin.str.$gt,\r\n    \"GtE\": Sk.builtin.str.$ge,\r\n    \"Lt\": Sk.builtin.str.$lt,\r\n    \"LtE\": Sk.builtin.str.$le\r\n};\r\n\r\n","/**\r\n * @function\r\n * @param {string} type_name\r\n * @param {string|undefined} repr_name\r\n * @param {Function} descr_constructor\r\n *\r\n * @returns {FunctionConstructor}\r\n */\r\nfunction buildDescriptor(type_name, repr_name, descr_options) {\r\n    const descr = Sk.abstr.buildNativeClass(type_name, {\r\n        constructor: descr_options.constructor,\r\n        slots: Object.assign({\r\n            tp$getattr: Sk.generic.getAttr,\r\n            $r: descriptorRepr,\r\n        }, descr_options.slots),\r\n        getsets: Object.assign(descr_options.getsets || {}, descriptorGetsets),\r\n        proto: /**@lends {descr_object.prototype}*/ Object.assign(descr_options.proto || {}, {\r\n            d$repr_name: repr_name || type_name,\r\n            d$check: descriptorCheck,\r\n            d$set_check: descriptorSetCheck,\r\n        }),\r\n        flags: { sk$unacceptableBase: true },\r\n    });\r\n    return descr;\r\n}\r\n\r\nfunction descriptorCheck(obj) {\r\n    if (obj == null) {\r\n        return this;\r\n    } else if (!obj.ob$type.$isSubType(this.d$type)) {\r\n        throw new Sk.builtin.TypeError(\r\n            \"descriptor '\" +\r\n            this.d$name +\r\n            \"' requires a '\" +\r\n            this.d$type.prototype.tp$name +\r\n            \"' object but received a '\" +\r\n            Sk.abstr.typeName(obj) +\r\n            \"' object\"\r\n        );\r\n    }\r\n    return;\r\n}\r\n\r\nfunction descriptorSetCheck(obj) {\r\n    if (!obj.ob$type.$isSubType(this.d$type)) {\r\n        throw new Sk.builtin.TypeError(\r\n            \"descriptor '\" +\r\n            this.d$name +\r\n            \"' requires a '\" +\r\n            this.d$type.prototype.tp$name +\r\n            \"' object but received a '\" +\r\n            Sk.abstr.typeName(obj) +\r\n            \"' object\"\r\n        );\r\n    }\r\n}\r\n\r\nfunction descriptorRepr() {\r\n    return new Sk.builtin.str(\"<\" + this.d$repr_name + \" '\" + this.d$name + \"' of '\" + this.d$type.prototype.tp$name + \"' objects>\");\r\n}\r\n\r\nconst descriptorGetsets = {\r\n    __doc__: {\r\n        $get() {\r\n            return this.d$def.$doc ? new Sk.builtin.str(this.d$def.$doc) : Sk.builtin.none.none$;\r\n        },\r\n    },\r\n    __objclass__: {\r\n        $get() {\r\n            return this.d$type;\r\n        },\r\n    },\r\n    __name__: {\r\n        $get() {\r\n            return new Sk.builtin.str(this.d$name);\r\n        },\r\n    },\r\n};\r\n\r\nconst descrTextSig = {\r\n    __text_signature__: {\r\n        $get() {\r\n            return this.d$def.$textsig ? new Sk.builtin.str(this.d$def.$textsig) : Sk.builtin.none.none$;\r\n        },\r\n    },\r\n};\r\n\r\n/**\r\n * @constructor\r\n * @param {typeObject} type_obj\r\n * @param {Object} gsd\r\n * @extends {Sk.builtin.object}\r\n */\r\nSk.builtin.getset_descriptor = buildDescriptor(\"getset_descriptor\", undefined, {\r\n    constructor: function getset_descr(typeobj, getset_def) {\r\n        this.d$def = getset_def;\r\n        this.$get = getset_def.$get;\r\n        this.$set = getset_def.$set;\r\n    this.d$type = typeobj;\r\n        this.d$name = getset_def.$name;\r\n    },\r\n    slots: {\r\n        tp$descr_get(obj, type) {\r\n    let ret;\r\n    if ((ret = this.d$check(obj))) {\r\n        return ret;\r\n    }\r\n    if (this.$get !== undefined) {\r\n        return this.$get.call(obj);\r\n    }\r\n\r\n            throw new Sk.builtin.AttributeError(\r\n                \"getset_descriptor '\" + this.d$name + \"' of '\" + this.d$type.prototype.tp$name + \"' objects is not readable\"\r\n            );\r\n        },\r\n        tp$descr_set(obj, value) {\r\n    this.d$set_check(obj);\r\n\r\n    if (this.$set !== undefined) {\r\n        return this.$set.call(obj, value);\r\n    }\r\n            throw new Sk.builtin.AttributeError(\"attribute '\" + this.d$name + \"' of '\" + this.d$type.prototype.tp$name + \"' objects is readonly\");\r\n        },\r\n    },\r\n});\r\n\r\n/**\r\n * @param {typeObject} type_obj\r\n * @param {Object} method\r\n * @extends {descr_object}\r\n */\r\nSk.builtin.method_descriptor = buildDescriptor(\"method_descriptor\", \"method\", {\r\n    constructor: function method_descriptor(typeobj, method_def) {\r\n    this.d$def = method_def;\r\n    this.$meth = method_def.$meth; //useful for internal fast calls\r\n    this.d$type = typeobj;\r\n    this.d$name = method_def.$name || \"<native JS>\";\r\n    const flags = method_def.$flags || {};\r\n    this.$flags = flags;\r\n    if (flags.FastCall && flags.NoKwargs) {\r\n        this.tp$call = this.$methodFastCallNoKwargs;\r\n    } else if (flags.FastCall) {\r\n        this.tp$call = this.$methodFastCall;\r\n    } else if (flags.NoArgs) {\r\n        this.tp$call = this.$methodCallNoArgs;\r\n    } else if (flags.OneArg) {\r\n        this.tp$call = this.$methodCallOneArg;\r\n    } else if (flags.NamedArgs) {\r\n        this.tp$call = this.$methodCallNamedArgs;\r\n    } else if (flags.MinArgs !== undefined) {\r\n        this.tp$call = this.$methodCallMinArgs;\r\n    } else {\r\n        // for legacy methods that haven't defined flags yet\r\n        this.func_code = method_def.$meth;\r\n        this.tp$call = this.$defaultCall;\r\n        this.$memoiseFlags = Sk.builtin.func.prototype.$memoiseFlags;\r\n        this.$resolveArgs = Sk.builtin.func.prototype.$resolveArgs;\r\n    }\r\n    },\r\n    slots: {\r\n        tp$call(args, kwargs) {\r\n    return this.tp$call(args, kwargs);\r\n        },\r\n        tp$descr_get(obj, type) {\r\n            let ret;\r\n            if ((ret = this.d$check(obj))) {\r\n                return ret;\r\n            }\r\n            return new Sk.builtin.sk_method(this.d$def, obj);\r\n        },\r\n    },\r\n    getsets: descrTextSig,\r\n    proto: {\r\n        $methodFastCall(args, kwargs) {\r\n    const self = args.shift();\r\n    this.m$checkself(self);\r\n    return this.$meth.call(self, args, kwargs);\r\n        },\r\n        $methodFastCallNoKwargs(args, kwargs) {\r\n    const self = args.shift();\r\n    this.m$checkself(self);\r\n    Sk.abstr.checkNoKwargs(this.d$name, kwargs);\r\n    return this.$meth.call(self, args);\r\n        },\r\n        $methodCallNoArgs(args, kwargs) {\r\n    const self = args.shift();\r\n    this.m$checkself(self);\r\n    Sk.abstr.checkNoArgs(this.d$name, args, kwargs);\r\n    return this.$meth.call(self);\r\n        },\r\n        $methodCallOneArg(args, kwargs) {\r\n    const self = args.shift();\r\n    this.m$checkself(self);\r\n    Sk.abstr.checkOneArg(this.d$name, args, kwargs);\r\n    return this.$meth.call(self, args[0]);\r\n        },\r\n        $methodCallNamedArgs(args, kwargs) {\r\n    const self = args.shift();\r\n    this.m$checkself(self);\r\n    args = Sk.abstr.copyKeywordsToNamedArgs(this.d$name, this.$flags.NamedArgs, args, kwargs, this.$flags.Defaults);\r\n    return this.$meth.call(self, ...args);\r\n        },\r\n        $methodCallMinArgs(args, kwargs) {\r\n    const self = args.shift();\r\n    this.m$checkself(self);\r\n    Sk.abstr.checkNoKwargs(this.d$name, kwargs);\r\n    Sk.abstr.checkArgsLen(this.d$name, args, this.$flags.MinArgs, this.$flags.MaxArgs);\r\n    return this.$meth.call(self, ...args);\r\n        },\r\n        $defaultCall(args, kwargs) {\r\n    this.m$checkself(args[0]);\r\n    return Sk.builtin.func.prototype.tp$call.call(this, args, kwargs);\r\n        },\r\n        m$checkself(self) {\r\n    if (self === undefined) {\r\n                throw new Sk.builtin.TypeError(\r\n                    \"descriptor '\" + this.d$name + \"' of '\" + this.d$type.prototype.tp$name + \"' object needs an argument\"\r\n                );\r\n    }\r\n    this.d$check(self);\r\n    },\r\n    },\r\n});\r\n\r\n/**\r\n * @constructor\r\n * @extends {descr_object}\r\n *\r\n * @param {typeObject} type_obj\r\n * @param {Object} wrapper_base\r\n * @param {Function} wrapped\r\n */\r\nSk.builtin.wrapper_descriptor = buildDescriptor(\"wrapper_descriptor\", \"slot wrapper\", {\r\n    constructor: function wrapper_descriptor(typeobj, slot_def, wrapped) {\r\n    this.d$def = slot_def;\r\n    this.d$type = typeobj;\r\n    this.d$name = wrapped.$name = slot_def.$name;\r\n    this.d$wrapped = wrapped;\r\n    },\r\n    slots: {\r\n        tp$descr_get(obj, type) {\r\n            let ret;\r\n            if ((ret = this.d$check(obj))) {\r\n                return ret;\r\n            }\r\n            return new Sk.builtin.method_wrapper(this, obj);\r\n        },\r\n        tp$call(args, kwargs) {\r\n    // make sure the first argument is acceptable as self\r\n    if (args.length < 1) {\r\n                throw new Sk.builtin.TypeError(\r\n                    \"descriptor '\" + this.d$name + \"' of '\" + this.d$type.prototype.tp$name + \"' object needs an argument\"\r\n                );\r\n    }\r\n    const self = args.shift();\r\n    if (!self.ob$type.$isSubType(this.d$type)) {\r\n        throw new Sk.builtin.TypeError(\r\n            \"descriptor '\" +\r\n            this.d$name +\r\n            \"' requires a '\" +\r\n            this.d$type.prototype.tp$name +\r\n            \"' object but received a '\" +\r\n            Sk.abstr.typeName(self) +\r\n            \"'\"\r\n        );\r\n    }\r\n    return this.raw$call(self, args, kwargs);\r\n        },\r\n    },\r\n    proto: {\r\n        raw$call(self, args, kwargs) {\r\n            // the base might have some flags I guess... see cpython version in descr.c\r\n            this.d$wrapped.$name = this.d$name; // hack since some slots use the same function (__setattr__, __delattr__)\r\n    return this.d$def.$wrapper.call(this.d$wrapped, self, args, kwargs);\r\n        },\r\n    },\r\n});\r\n\r\n/**\r\n * @constructor\r\n * @extends {descr_object}\r\n * @param {Sk.builtin.wrapper_descriptor} type_obj\r\n * @param wrapper_base\r\n */\r\nSk.builtin.method_wrapper = buildDescriptor(\"method_wrapper\", undefined, {\r\n    constructor: function method_wrapper(wrapper_descr, self) {\r\n    this.m$descr = wrapper_descr;\r\n    this.m$self = self;\r\n    this.d$def = wrapper_descr.d$def;\r\n    this.d$name = wrapper_descr.d$name;\r\n    this.d$type = wrapper_descr.d$type;\r\n    },\r\n    slots: {\r\n        tp$call(args, kwargs) {\r\n    return this.m$descr.raw$call(this.m$self, args, kwargs);\r\n        },\r\n        tp$richcompare(other, op) {\r\n            if ((op !== \"Eq\" && op !== \"NotEq\") || !(other instanceof Sk.builtin.method_wrapper)) {\r\n                return Sk.builtin.NotImplemented.NotImplemented$;\r\n            }\r\n            let eq = this.m$self === other.m$self && this.m$descr === other.m$descr;\r\n            return op === \"Eq\" ? eq : !eq;\r\n        },\r\n        $r() {\r\n    return new Sk.builtin.str(\"<method-wrapper '\" + this.d$name + \"' of \" + Sk.abstr.typeName(this.m$self) + \" object>\");\r\n        },\r\n    },\r\n    getsets: {\r\n        __self__: {\r\n            $get() {\r\n        return this.m$self;\r\n    },\r\n        },\r\n    },\r\n});\r\n\r\n/**\r\n *\r\n * @constructor\r\n * @extends {descr_object}\r\n * @param {typeObject} typeobj\r\n * @param {Object} method_def\r\n *\r\n * @description\r\n * This is for classmethods in Native Js Classes, not for \"f = classmethod(f)\" in Python\r\n * See dict.fromkeys for a native example\r\n *\r\n */\r\nSk.builtin.classmethod_descriptor = buildDescriptor(\"classmethod_descriptor\", \"method\", {\r\n    constructor: function classmethod_descriptor(typeobj, method_def) {\r\n    this.d$def = method_def;\r\n    this.$meth = method_def.$meth; //useful for internal fast calls\r\n    this.d$type = typeobj;\r\n    this.d$name = method_def.$name || \"<native JS>\";\r\n    },\r\n    slots: {\r\n        tp$call(args, kwargs) {\r\n    if (args.length < 1) {\r\n                throw new Sk.builtin.TypeError(\r\n                    \"descriptor '\" + this.d$name + \"' of '\" + this.d$type.prototype.tp$name + \"' object needs an argument\"\r\n                );\r\n    }\r\n    const self = args.shift();\r\n    const bound = this.tp$descr_get(null, self);\r\n    return bound.tp$call(args, kwargs);\r\n        },\r\n        tp$descr_get(obj, type, canSuspend) {\r\n    if (type === undefined) {\r\n        if (obj !== null) {\r\n            type = type || obj.ob$type;\r\n        } else {\r\n            throw new Sk.builtin.TypeError(\r\n                \"descriptor '\" + this.d$name + \"' for type '\" + this.d$type.prototype.tp$name + \"' needs an object or a type\"\r\n            );\r\n        }\r\n    }\r\n    if (type.ob$type !== Sk.builtin.type) {\r\n        throw new Sk.builtin.TypeError(\r\n            \"descriptor '\" +\r\n            this.d$name +\r\n            \"' for type '\" +\r\n            this.d$type.prototype.tp$name +\r\n            \"' needs a type not a '\" +\r\n            Sk.abstr.typeName(type) +\r\n            \"' as arg 2\"\r\n        );\r\n    }\r\n\r\n    if (!type.$isSubType(this.d$type)) {\r\n        throw new Sk.builtin.TypeError(\r\n            \"descriptor '\" +\r\n            this.d$name +\r\n            \"' requires a '\" +\r\n            this.d$type.prototype.tp$name +\r\n            \"' object but received a '\" +\r\n            Sk.abstr.typeName(type) +\r\n            \"' object\"\r\n        );\r\n    }\r\n            return new Sk.builtin.sk_method(this.d$def, type);\r\n        },\r\n    },\r\n    getsets: descrTextSig,\r\n});\r\n\r\n\r\n[\r\n    Sk.builtin.method_descriptor,\r\n    Sk.builtin.getset_descriptor,\r\n    Sk.builtin.wrapper_descriptor,\r\n    Sk.builtin.method_wrapper,\r\n    Sk.builtin.classmethod_descriptor,\r\n].forEach((cls) => {\r\n    Sk.abstr.setUpSlots(cls);\r\n    Sk.abstr.setUpMethods(cls);\r\n    Sk.abstr.setUpGetSets(cls);\r\n});","/** @typedef {Sk.builtin.object} */ var pyObject;\r\n/** @typedef {Sk.builtin.type|Function} */ var typeObject;\r\n\r\n/**\r\n * @constructor\r\n * @extends {Sk.builtin.object}\r\n * @param {Array=} L A javascript array of key value pairs - All elements should be pyObjects\r\n *\r\n * @description\r\n * call with an array of key value pairs\r\n * Do not use this function to convert a JS object to a dict\r\n * Instead use {@link Sk.ffi.remapToPy}\r\n *\r\n *\r\n */\r\nSk.builtin.dict = Sk.abstr.buildNativeClass(\"dict\", {\r\n    constructor: function dict(L) {\r\n        // calling new Sk.builtin.dict is an internal method that requires an array of key value pairs\r\n        if (L === undefined) {\r\n            L = [];\r\n        }\r\n        Sk.asserts.assert(Array.isArray(L) && L.length % 2 === 0 && this instanceof Sk.builtin.dict, \"bad call to dict constructor\");\r\n\r\n        this.size = 0;\r\n        this.entries = Object.create(null);\r\n        this.buckets = {};\r\n        for (let i = 0; i < L.length; i += 2) {\r\n            this.set$item(L[i], L[i + 1]);\r\n        }\r\n        this.in$repr = false;\r\n        this.$version = 0; // change version number anytime the keys change\r\n    },\r\n    slots: /**@lends {Sk.builtin.dict.prototype}*/{\r\n        tp$getattr: Sk.generic.getAttr,\r\n        tp$as_sequence_or_mapping: true,\r\n        tp$as_number: true,\r\n        tp$hash: Sk.builtin.none.none$,\r\n        tp$doc:\r\n            \"dict() -> new empty dictionary\\ndict(mapping) -> new dictionary initialized from a mapping object's\\n    (key, value) pairs\\ndict(iterable) -> new dictionary initialized as if via:\\n    d = {}\\n    for k, v in iterable:\\n        d[k] = v\\ndict(**kwargs) -> new dictionary initialized with the name=value pairs\\n    in the keyword argument list.  For example:  dict(one=1, two=2)\",\r\n        $r() {\r\n            if (this.in$repr) {\r\n                // prevents recursively calling repr;\r\n                return new Sk.builtin.str(\"{...}\");\r\n            }\r\n            this.in$repr = true;\r\n            // iterate over the keys - we don't use the dict iterator or mp$subscript here\r\n            const ret = this.$items().map(([key, val]) => Sk.misceval.objectRepr(key) + \": \" + Sk.misceval.objectRepr(val));\r\n            this.in$repr = false;\r\n            return new Sk.builtin.str(\"{\" + ret.join(\", \") + \"}\");\r\n        },\r\n        tp$new: Sk.generic.new,\r\n        tp$init(args, kwargs) {\r\n            return this.update$common(args, kwargs, \"dict\");\r\n        },\r\n        tp$iter() {\r\n            return new dict_iter_(this);\r\n        },\r\n        tp$richcompare(other, op) {\r\n            let res;\r\n            if (!(other instanceof Sk.builtin.dict) || (op !== \"Eq\" && op !== \"NotEq\")) {\r\n                return Sk.builtin.NotImplemented.NotImplemented$;\r\n            }\r\n                if (other === this) {\r\n                    res = true;\r\n                } else if (this.size !== other.size) {\r\n                    res = false;\r\n                } else {\r\n                let otherv;\r\n                res = this.$items().every(([key, val]) => {\r\n                    otherv = other.mp$lookup(key);\r\n                    return otherv !== undefined && (otherv === val || Sk.misceval.richCompareBool(val, otherv, \"Eq\"));\r\n                });\r\n                }\r\n            return op === \"Eq\" ? res : !res;\r\n        },\r\n        // as number slot\r\n        nb$or(other) {\r\n            if (!(other instanceof Sk.builtin.dict)) {\r\n                return Sk.builtin.NotImplemented.NotImplemented$;\r\n                }\r\n            const dict = this.dict$copy();\r\n            dict.dict$merge(other);\r\n            return dict;\r\n        },\r\n        nb$reflected_or(other) {\r\n            if (!(other instanceof Sk.builtin.dict)) {\r\n                return Sk.builtin.NotImplemented.NotImplemented$;\r\n            }\r\n            // dict or is not commutative so must define reflected slot here.\r\n            const dict = other.dict$copy();\r\n            dict.dict$merge(this);\r\n            return dict;\r\n        },\r\n        nb$inplace_or(other) {\r\n            return Sk.misceval.chain(this.update$onearg(other), () => this);\r\n        },\r\n        // sequence or mapping slots\r\n        sq$length() {\r\n            return this.get$size();\r\n        },\r\n        sq$contains(ob) {\r\n            return this.mp$lookup(ob) !== undefined;\r\n        },\r\n        mp$subscript(key, canSuspend) {\r\n            const res = this.mp$lookup(key);\r\n            if (res !== undefined) {\r\n                // Found in dictionary\r\n                return res;\r\n            }\r\n            let missing = Sk.abstr.lookupSpecial(this, Sk.builtin.str.$missing);\r\n            if (missing !== undefined) {\r\n                const ret = Sk.misceval.callsimOrSuspendArray(missing, [key]);\r\n                return canSuspend ? ret : Sk.misceval.retryOptionalSuspensionOrThrow(ret);\r\n            }\r\n            throw new Sk.builtin.KeyError(key);\r\n        },\r\n        mp$ass_subscript(key, value) {\r\n            if (value === undefined) {\r\n                const item = this.pop$item(key);\r\n                if (item === undefined) {\r\n                    throw new Sk.builtin.KeyError(key);\r\n                }\r\n            } else {\r\n                this.set$item(key, value);\r\n            }\r\n        },\r\n    },\r\n    methods: /**@lends {Sk.builtin.dict.prototype}*/{\r\n        __reversed__: {\r\n            $meth() {\r\n                return new dict_reverse_iter_(this);\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: null,\r\n            $doc: \"Return a reverse iterator over the dict keys.\",\r\n        },\r\n        get: {\r\n            $meth(key, d) {\r\n                return this.mp$lookup(key) || d || Sk.builtin.none.none$;\r\n            },\r\n            $flags: {MinArgs: 1, MaxArgs: 2},\r\n            $textsig: \"($self, key, default=None, /)\",\r\n            $doc: \"Return the value for key if key is in the dictionary, else default.\",\r\n        },\r\n        setdefault: {\r\n            $meth(key, default_) {\r\n                // logic could be simpler here but some tests dictate we can't do too many lookups\r\n                let item;\r\n                const hash = getHash(key);\r\n                item = typeof hash === \"string\" ? this.entries[hash] : this.get$bucket_item(key, hash);\r\n                if (item !== undefined) {\r\n                    return item[1];\r\n                }\r\n                default_ = default_ || Sk.builtin.none.none$;\r\n                if (typeof hash === \"string\") {\r\n                    this.entries[hash] = [key, default_];\r\n                } else {\r\n                    this.set$bucket_item(key, default_, hash);\r\n                }\r\n                this.size++;\r\n                this.$version++;\r\n                return default_;\r\n            },\r\n            $flags: {MinArgs: 1, MaxArgs: 2},\r\n            $textsig: \"($self, key, default=None, /)\",\r\n            $doc:\r\n                \"Insert key with a value of default if key is not in the dictionary.\\n\\nReturn the value for key if key is in the dictionary, else default.\",\r\n        },\r\n        pop: {\r\n            $meth(key, d) {\r\n                const item = this.pop$item(key);\r\n                    if (item !== undefined) {\r\n                    return item[1];\r\n                }\r\n                // Not found in dictionary\r\n                if (d !== undefined) {\r\n                    return d;\r\n                }\r\n                throw new Sk.builtin.KeyError(key);\r\n            },\r\n            $flags: {MinArgs: 1, MaxArgs: 2},\r\n            $textsig: null,\r\n            $doc:\r\n                \"D.pop(k[,d]) -> v, remove specified key and return the corresponding value.\\nIf key is not found, d is returned if given, otherwise KeyError is raised\",\r\n        },\r\n        popitem: {\r\n            $meth() {\r\n                // not particularly efficent but we get allkeys as an array to iter anyway\r\n                const size = this.get$size();\r\n                if (size === 0) {\r\n                    throw new Sk.builtin.KeyError(\"popitem(): dictionary is empty\");\r\n                }\r\n                const [key, val] = this.$items()[size - 1];\r\n                this.pop$item(key);\r\n                return new Sk.builtin.tuple([key, val]);\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: null,\r\n            $doc: \"D.popitem() -> (k, v), remove and return some (key, value) pair as a\\n2-tuple; but raise KeyError if D is empty.\",\r\n        },\r\n        keys: {\r\n            $meth() {\r\n                return new dict_keys(this);\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: null,\r\n            $doc: \"D.keys() -> a set-like object providing a view on D's keys\",\r\n        },\r\n        items: {\r\n            $meth() {\r\n                return new dict_items(this);\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: null,\r\n            $doc: \"D.items() -> a set-like object providing a view on D's items\",\r\n        },\r\n        values: {\r\n            $meth() {\r\n                return new dict_values(this);\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: null,\r\n            $doc: \"D.values() -> an object providing a view on D's values\",\r\n        },\r\n        update: {\r\n            $meth(args, kwargs) {\r\n                return Sk.misceval.chain(this.update$common(args, kwargs, \"update\"), () => Sk.builtin.none.none$);\r\n            },\r\n            $flags: {FastCall: true},\r\n            $textsig: null,\r\n            $doc:\r\n                \"D.update([E, ]**F) -> None.  Update D from dict/iterable E and F.\\nIf E is present and has a .keys() method, then does:  for k in E: D[k] = E[k]\\nIf E is present and lacks a .keys() method, then does:  for k, v in E: D[k] = v\\nIn either case, this is followed by: for k in F:  D[k] = F[k]\",\r\n        },\r\n        clear: {\r\n            $meth() {\r\n                this.size = 0;\r\n                this.$version++;\r\n                this.entries = Object.create(null);\r\n                this.buckets = {};\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: null,\r\n            $doc: \"D.clear() -> None.  Remove all items from D.\",\r\n        },\r\n        copy: {\r\n            $meth() {\r\n                return this.dict$copy();\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: null,\r\n            $doc: \"D.copy() -> a shallow copy of D\",\r\n        },\r\n    },\r\n    classmethods: /**@lends {Sk.builtin.dict.prototype}*/ Object.assign({\r\n        fromkeys: {\r\n            $meth: function fromkeys(seq, value) {\r\n                value = value || Sk.builtin.none.none$;\r\n                let dict = this === Sk.builtin.dict ? new this() : this.tp$call([], []);\r\n                return Sk.misceval.chain(\r\n                    dict,\r\n                    (d) => {\r\n                        dict = d;\r\n                        return Sk.misceval.iterFor(Sk.abstr.iter(seq), (key) => {\r\n                            return dict.mp$ass_subscript(key, value, true);\r\n                        });\r\n                    },\r\n                    () => dict\r\n                );\r\n            },\r\n            $flags: { MinArgs: 1, MaxArgs: 2 },\r\n            $textsig: \"($type, iterable, value=None, /)\",\r\n            $doc: \"Create a new dictionary with keys from iterable and values set to value.\",\r\n        },\r\n    }, Sk.generic.classGetItem),\r\n    proto: /**@lends {Sk.builtin.dict.prototype}*/ {\r\n        quick$lookup,\r\n        mp$lookup,\r\n        get$size() {\r\n            // can't be overridden by subclasses so we use this for the dict key iterator\r\n            return this.size;\r\n        },\r\n        sk$asarray() {\r\n            return Object.values(this.entries).map((item) => item[0]);\r\n        },\r\n        update$common,\r\n        update$onearg(arg) {\r\n            if (arg instanceof Sk.builtin.dict || Sk.abstr.lookupSpecial(arg, Sk.builtin.str.$keys) !== undefined) {\r\n                return this.dict$merge(arg);\r\n            } else {\r\n                return this.dict$merge_seq(arg);\r\n            }\r\n        },\r\n        dict$copy() {\r\n            const newCopy = new Sk.builtin.dict([]);\r\n            newCopy.size = this.size;\r\n            const entries = Object.entries(this.entries); // do it this way for mappingproxy\r\n            for (let i in entries) {\r\n                const key = entries[i][0];\r\n                const item = entries[i][1];\r\n                newCopy.entries[key] = [item[0], item[1]];\r\n            }\r\n            let bucket, this_bucket;\r\n            for (let i in this.buckets) {\r\n                this_bucket = this.buckets[i];\r\n                newCopy.buckets[i] = bucket = [];\r\n                for (let j = 0; j < this_bucket.length; j++) {\r\n                    bucket.push(newCopy.entries[\"#\" + i + \"_\" + j]);\r\n                }\r\n            }\r\n            return newCopy;\r\n        },\r\n        $items() {\r\n            return Object.values(this.entries);\r\n        },\r\n        set$item,\r\n        get$bucket_item,\r\n        pop$bucket_item,\r\n        set$bucket_item,\r\n        pop$item,\r\n        dict$merge,\r\n        dict$merge_seq,\r\n    },\r\n});\r\n\r\nfunction getHash(key) {\r\n    let key_hash = key.$savedKeyHash;\r\n    if (key_hash !== undefined) {\r\n        return key_hash;\r\n    }\r\n    key_hash = Sk.abstr.objectHash(key);\r\n    return key_hash;\r\n}\r\n\r\n/**\r\n * @private\r\n * @param {Sk.builtin.str} pyName\r\n * @this {Sk.builtin.dict}\r\n * \r\n * this is hot code!\r\n */\r\nfunction quick$lookup(pyName) {\r\n    /**@type {string} */\r\n    var key_hash = pyName.$savedKeyHash;\r\n    var item = this.entries[key_hash];\r\n    if (item !== undefined) {\r\n        return item[1];\r\n    }\r\n    return;\r\n};\r\n\r\n/**\r\n * NB:\r\n * We could put the following methods on the proto in the above object literal\r\n * but they're quite long so we keep them below for readability\r\n * @ignore\r\n */\r\n\r\n/**\r\n * @function\r\n * @param {pyObject} key - key to get item for\r\n * @param {string} hash_value - hash_value from the key\r\n *\r\n * @description\r\n * fast call - if we have a str then we can guarantee that it's in the bucket\r\n * so we compare strings quickly rather than reaching out to richcompareBool\r\n *\r\n * @return {pyObject|undefined} the item if found or undefined if not found\r\n * @private\r\n */\r\nfunction get$bucket_item(key, hash_value) {\r\n    const bucket = this.buckets[hash_value];\r\n    if (bucket === undefined) {\r\n        return;\r\n    }\r\n    let item;\r\n    for (let i = 0; i < bucket.length; i++) {\r\n        item = bucket[i];\r\n        if (item === undefined) {\r\n            continue;\r\n        }\r\n        if (item[0] === key || Sk.misceval.richCompareBool(key, item[0], \"Eq\")) {\r\n            return item;\r\n        }\r\n    }\r\n    return;\r\n};\r\n\r\n/**\r\n * @function\r\n * @param {pyObject} key\r\n * @param {string} hash_value\r\n *\r\n * @return undefined if no key was found\r\n * or the item if the key was in the bucket\r\n * also removes the item from entries\r\n * @private\r\n */\r\nfunction pop$bucket_item(key, hash_value) {\r\n    const bucket = this.buckets[hash_value];\r\n    let bucket_key, item;\r\n    if (bucket === undefined) {\r\n        return undefined;\r\n    }\r\n    for (let i = 0; i < bucket.length; i++) {\r\n        item = bucket[i];\r\n        if (item === undefined) {\r\n            continue;\r\n        }\r\n        if (item[0] === key || Sk.misceval.richCompareBool(key, item[0], \"Eq\")) {\r\n            const key_hash = \"#\" + hash_value + \"_\" + i;\r\n            delete this.entries[key_hash];\r\n            bucket[i] = undefined;\r\n            if (bucket.every((x) => x === undefined)) {\r\n                delete this.buckets[hash_value];\r\n            }\r\n            return item;\r\n        }\r\n    }\r\n    return;\r\n};\r\n\r\n/**\r\n * @function\r\n * @param {Sk.builtin.object} key\r\n * @param {Sk.builtin.object} value\r\n * @param {string} hash_value\r\n *\r\n * @description\r\n * given a key and a hash_value will find a free slot or append to the list of slots for a given hash_value\r\n * then will set the item in the entries and return the item\r\n * Note this should only be called and immediately preceded by assigning the value to the rhs\r\n *\r\n * @private\r\n */\r\nfunction set$bucket_item(key, value, hash_value) {\r\n    let key_hash,\r\n        bucket = this.buckets[hash_value];\r\n    const item = [key, value];\r\n    if (bucket === undefined) {\r\n        this.buckets[hash_value] = [item];\r\n        key_hash = \"#\" + hash_value + \"_\" + 0;\r\n    } else {\r\n        // we might have a freeslot from deleting an item\r\n        const free_slot_idx = bucket.indexOf(undefined);\r\n        if (free_slot_idx !== -1) {\r\n            key_hash = \"#\" + hash_value + \"_\" + free_slot_idx;\r\n            bucket[free_slot_idx] = item;\r\n        } else {\r\n            key_hash = \"#\" + hash_value + \"_\" + bucket.length;\r\n            bucket.push(item);\r\n        }\r\n    }\r\n    this.entries[key_hash] = item;\r\n};\r\n\r\n/**\r\n * @function\r\n * @param {Sk.builtin.object} key - want to check if the key is inside the dict\r\n *\r\n * @return undefined if no key was found\r\n * or the item[1] (value) if the key was found\r\n * @private\r\n */\r\nfunction mp$lookup(key) {\r\n    let item;\r\n    const hash = getHash(key);\r\n    if (typeof hash === \"string\") {\r\n        item = this.entries[hash];\r\n    } else {\r\n        // then we have a base hash so this is non string;\r\n        item = this.get$bucket_item(key, hash);\r\n    }\r\n    if (item !== undefined) {\r\n        return item[1];\r\n    }\r\n    // Not found in dictionary\r\n    return undefined;\r\n};\r\n\r\n/**\r\n * @function\r\n *\r\n * @param {Sk.builtin.dict} b or dictlike object (anything with a keys method)\r\n *\r\n * @description\r\n * this function mimics the cpython implementation, which is also the reason for the\r\n * almost similar code, this may be changed in future\r\n *\r\n * Note we don't use mp$ass_subscript since that slot might be overridden by a subclass\r\n * Instead we use this.set$item which is the dict implementation of mp$ass_subscript\r\n * @private\r\n */\r\nfunction dict$merge(b) {\r\n    // we don't use mp$ass_subscript incase a subclass overrides __setitem__ we just ignore that like Cpython does\r\n    // so use this.set$item instead which can't be overridden by a subclass\r\n    if (b.tp$iter === Sk.builtin.dict.prototype.tp$iter) {\r\n        // fast way used\r\n        const keys = b.tp$iter();\r\n        for (let key = keys.tp$iternext(); key !== undefined; key = keys.tp$iternext()) {\r\n            const v = b.mp$subscript(key);\r\n            this.set$item(key, v);\r\n        }\r\n    } else {\r\n        // generic slower way for a subclass that has overriden the tp$iter method\r\n        // or other mapping types like mapping proxy\r\n        const keyfunc = Sk.abstr.lookupSpecial(b, Sk.builtin.str.$keys);\r\n        if (keyfunc === undefined) {\r\n            throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(b) + \"' object is not a mapping\");\r\n            }\r\n\r\n        return Sk.misceval.chain(Sk.misceval.callsimOrSuspendArray(keyfunc), (keys) =>\r\n            Sk.misceval.iterFor(Sk.abstr.iter(keys), (key) =>\r\n                Sk.misceval.chain(Sk.abstr.objectGetItem(b, key, true), (v) => {\r\n                    this.set$item(key, v);\r\n                })\r\n            )\r\n        );\r\n    }\r\n};\r\n\r\n/**\r\n * @function\r\n *\r\n * @param {Array} args\r\n * @param {Array} kwargs\r\n * @param {string} func_name for error messages\r\n *\r\n * @description\r\n *\r\n *   update() accepts either another dictionary object or an iterable of key/value pairs (as tuples or other iterables of length two).\r\n *   If keyword arguments are specified, the dictionary is then updated with those key/value pairs: d.update(red=1, blue=2).\r\n *   https://hg.python.org/cpython/file/4ff865976bb9/Objects/dictobject.c\r\n *\r\n * this function is called by both __init__ and update\r\n * We check that there is only 1 arg\r\n *\r\n * if arg is a dict like object we call dict$merge (must have a keys attribute)\r\n * otherwise call dict$merge_seq\r\n *\r\n * finally put the kwargs in the dict.\r\n * @private\r\n *\r\n */\r\nfunction update$common(args, kwargs, func_name) {\r\n    Sk.abstr.checkArgsLen(func_name, args, 0, 1);\r\n    const arg = args[0];\r\n    let ret;\r\n    if (arg !== undefined) {\r\n        ret = this.update$onearg(arg);\r\n    }\r\n    return Sk.misceval.chain(ret, () => {\r\n        if (kwargs) {\r\n            for (let i = 0; i < kwargs.length; i += 2) {\r\n                this.set$item(new Sk.builtin.str(kwargs[i]), kwargs[i + 1]);\r\n            }\r\n        }\r\n        return;\r\n    });\r\n};\r\n\r\n/**\r\n * @function\r\n *\r\n * @param {pyObject} arg\r\n *\r\n * @description\r\n * iterate over a sequence like object\r\n * check the next value has length 2\r\n * and then set the key value pair in\r\n * @private\r\n *\r\n */\r\nfunction dict$merge_seq(arg) {\r\n    let idx = 0;\r\n    return Sk.misceval.iterFor(Sk.abstr.iter(arg), (i) => {\r\n        if (!Sk.builtin.checkIterable(i)) {\r\n            throw new Sk.builtin.TypeError(\"cannot convert dictionary update sequence element #\" + idx + \" to a sequence\");\r\n        }\r\n            const seq = Sk.misceval.arrayFromIterable(i);\r\n            if (seq.length !== 2) {\r\n                throw new Sk.builtin.ValueError(\"dictionary update sequence element #\" + idx + \" has length \" + seq.length + \"; 2 is required\");\r\n            }\r\n        this.set$item(seq[0], seq[1]);\r\n        idx++;\r\n    });\r\n};\r\n\r\n/**\r\n * @function\r\n *\r\n * @param {pyObject} key should be a python object\r\n * @param {pyObject} value\r\n *\r\n * @description\r\n * sets the item from a key, value\r\n * @private\r\n *\r\n */\r\nfunction set$item(key, value) {\r\n    const hash = getHash(key);\r\n    let item;\r\n    if (typeof hash === \"string\") {\r\n        // we have a string so pass it to the dictionary\r\n        item = this.entries[hash];\r\n        if (item === undefined) {\r\n            this.entries[hash] = [key, value];\r\n            this.size++;\r\n            this.$version++;\r\n        } else {\r\n            item[1] = value;\r\n    }\r\n    } else {\r\n        item = this.get$bucket_item(key, hash);\r\n    if (item === undefined) {\r\n            this.set$bucket_item(key, value, hash);\r\n            this.size++;\r\n            this.$version++;\r\n    } else {\r\n            item[1] = value;\r\n        }\r\n    }\r\n};\r\n\r\n/**\r\n * @function\r\n *\r\n * @param {Sk.builtin.object} key\r\n *\r\n * @description\r\n * deletes an item in the dictionary\r\n * @private\r\n *\r\n */\r\nfunction pop$item(key) {\r\n    const hash = getHash(key);\r\n    let item;\r\n    if (typeof hash === \"string\") {\r\n        item = this.entries[hash];\r\n        delete this.entries[hash];\r\n    } else {\r\n        item = this.pop$bucket_item(key, hash);\r\n    }\r\n    if (item !== undefined) {\r\n        this.size--;\r\n        this.$version++;\r\n        return item;\r\n    }\r\n    // Not found in dictionary\r\n    return undefined;\r\n};\r\n\r\n\r\n/******** Start of Dict Views ********/\r\n\r\nfunction as_set(self) {\r\n    return new Sk.builtin.set(Sk.misceval.arrayFromIterable(self));\r\n}\r\nfunction checkAnyView(view) {\r\n    return view instanceof dict_keys || view instanceof dict_items;\r\n}\r\nfunction all_contained_in(self, other) {\r\n    for (let it = Sk.abstr.iter(self), i = it.tp$iternext(); i !== undefined; i = it.tp$iternext()) {\r\n        if (!Sk.abstr.sequenceContains(other, i)) {\r\n            return false;\r\n        }\r\n    }\r\n    return true;\r\n}\r\n\r\n// compile shared slots\r\nconst dict_view_slots = {\r\n    tp$getattr: Sk.generic.getAttr,\r\n    tp$as_number: true,\r\n    tp$as_sequence_or_mapping: true,\r\n    tp$hash: Sk.builtin.none.none$,\r\n    $r() {\r\n        if (this.in$repr) {\r\n            // prevent recursively calling oneself\r\n            return new Sk.builtin.str(\"...\");\r\n        }\r\n        this.in$repr = true;\r\n        let ret = Sk.misceval.arrayFromIterable(this);\r\n        ret = ret.map((x) => Sk.misceval.objectRepr(x));\r\n        this.in$repr = false;\r\n        return new Sk.builtin.str(Sk.abstr.typeName(this) + \"([\" + ret.join(\", \") + \"])\");\r\n    },\r\n    tp$richcompare(other, op) {\r\n        if (!(Sk.builtin.checkAnySet(other) || checkAnyView(other))) {\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        }\r\n        const len_self = this.sq$length();\r\n        const len_other = other.sq$length();\r\n        switch (op) {\r\n            case \"NotEq\":\r\n            case \"Eq\":\r\n                let res;\r\n                if (this === other) {\r\n                    res = true;\r\n                } else if (len_self === len_other) {\r\n                    res = all_contained_in(this, other);\r\n                }\r\n                return op === \"NotEq\" ? !res : res;\r\n            case \"Lt\":\r\n                return len_self < len_other && all_contained_in(this, other);\r\n            case \"LtE\":\r\n                return len_self <= len_other && all_contained_in(this, other);\r\n            case \"Gt\":\r\n                return len_self > len_other && all_contained_in(other, this);\r\n            case \"GtE\":\r\n                return len_self >= len_other && all_contained_in(other, this);\r\n        }\r\n    },\r\n    nb$subtract(other) {\r\n        const set = as_set(this);\r\n        return set.difference.$meth.call(set, other);\r\n    },\r\n    nb$and(other) {\r\n        const set = as_set(this);\r\n        return set.intersection.$meth.call(set, other);\r\n    },\r\n    nb$or(other) {\r\n        const set = as_set(this);\r\n        return set.union.$meth.call(set, other);\r\n    },\r\n    nb$xor(other) {\r\n        const set = as_set(this);\r\n        return set.symmetric_difference.$meth.call(set, other);\r\n    },\r\n    sq$length() {\r\n        return this.dict.get$size();\r\n    },\r\n};\r\n\r\nfunction buildDictView(typename, slots, reverse_method) {\r\n    const options = {\r\n        constructor: function dict_view(dict) {\r\n            if (arguments.length !== 1) {\r\n                throw new Sk.builtin.TypeError(\"cannot create '\" + Sk.abstr.typeName(this) + \"' instances\");\r\n            }\r\n            this.dict = dict;\r\n            this.in$repr = false;\r\n        },\r\n    };\r\n    options.slots = Object.assign(slots, dict_view_slots);\r\n    options.methods = {\r\n        isdisjoint: {\r\n            $meth(other) {\r\n                const set = as_set(this);\r\n                return set.isdisjoint.$meth.call(set, other);\r\n            },\r\n            $flags: { OneArg: true },\r\n            $textsig: null,\r\n            $doc: \"Return True if the view and the given iterable have a null intersection.\",\r\n        },\r\n        __reversed__: {\r\n            $meth: reverse_method,\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc: \"Return a reverse iterator over the dict keys.\",\r\n        },\r\n    };\r\n    options.flags = {\r\n        sk$acceptable_as_base: false,\r\n};\r\n    if (typename === \"dict_values\") {\r\n        // dict_values doesn't have number or richcompare slots\r\n        delete options.slots.tp$as_number;\r\n        delete options.slots.tp$richcompare;\r\n    }\r\n    return Sk.abstr.buildNativeClass(typename, options);\r\n}\r\n\r\nvar dict_keys = buildDictView(\r\n    \"dict_keys\",\r\n    {\r\n        sq$contains(key) {\r\n            return this.dict.mp$lookup(key) !== undefined;\r\n        },\r\n        tp$iter() {\r\n            return new dict_iter_(this.dict);\r\n        },\r\n    },\r\n    function __reverse__() {\r\n        return new dict_reverse_iter_(this.dict);\r\n    }\r\n);\r\n\r\nvar dict_values = buildDictView(\r\n    \"dict_values\",\r\n    {\r\n        tp$iter() {\r\n            return new dict_valueiter_(this.dict);\r\n        },\r\n    },\r\n    function __reverse__() {\r\n        return new dict_reverse_valueiter_(this.dict);\r\n    }\r\n);\r\n\r\nvar dict_items = buildDictView(\r\n    \"dict_items\",\r\n    {\r\n        sq$contains(item) {\r\n            if (!(item instanceof Sk.builtin.tuple && item.sq$length() === 2)) {\r\n                return false;\r\n            }\r\n            const key = item.mp$subscript(new Sk.builtin.int_(0));\r\n            const value = item.mp$subscript(new Sk.builtin.int_(1));\r\n            const found = this.dict.mp$lookup(key);\r\n            if (found === undefined) {\r\n                return false;\r\n            }\r\n            return found === value || Sk.misceval.richCompareBool(found, value, \"Eq\");\r\n        },\r\n        tp$iter() {\r\n            return new dict_itemiter_(this.dict);\r\n        },\r\n    },\r\n    function __reverse__() {\r\n        return new dict_reverse_itemiter_(this.dict);\r\n    }\r\n);\r\n\r\n/**\r\n * @param {string} typename\r\n * @param {Function} iternext\r\n * @param {Function=} constructor\r\n */\r\nfunction buildDictIterClass(typename, iternext, reversed) {\r\n    return Sk.abstr.buildIteratorClass(typename, {\r\n        constructor: function dict_iter_constructor(dict) {\r\n            this.$index = 0;\r\n            this.$orig = dict;\r\n            this.tp$iternext = () => {\r\n                // only set up the array on the first iteration\r\n                this.$seq = dict.$items();\r\n                this.$version = dict.$version;\r\n                if (reversed) {\r\n                    this.$seq = this.$seq.reverse();\r\n                }\r\n                this.tp$iternext = this.constructor.prototype.tp$iternext;\r\n                return this.tp$iternext();\r\n            };\r\n        },\r\n        iternext: iternext,\r\n        methods: {\r\n            __length_hint__: Sk.generic.iterLengthHintWithArrayMethodDef,\r\n        },\r\n        flags: { sk$unacceptableBase: true },\r\n        proto: { next$item: itemIterNextCheckSize },\r\n    });\r\n}\r\n\r\nfunction itemIterNextCheckSize() {\r\n    if (this.$version !== this.$orig.$version) {\r\n        if (this.$seq.length !== this.$orig.get$size()) {\r\n            throw new Sk.builtin.RuntimeError(\"dict changed size during iteration\");\r\n        }\r\n        throw new Sk.builtin.RuntimeError(\"dictionary keys changed during iteration\");\r\n    }\r\n    return this.$seq[this.$index++];\r\n}\r\n\r\n/**\r\n * @constructor\r\n * @param {Sk.builtin.dict} dict\r\n */\r\nvar dict_iter_ = buildDictIterClass(\"dict_keyiterator\", function () {\r\n    const item = this.next$item();\r\n    return item && item[0];\r\n});\r\n\r\n/**\r\n * @constructor\r\n * @param {Sk.builtin.dict} dict\r\n */\r\nvar dict_itemiter_ = buildDictIterClass(\"dict_itemiterator\", function () {\r\n    const item = this.next$item();\r\n    return item && new Sk.builtin.tuple([item[0], item[1]]);\r\n});\r\n\r\n/**\r\n * @constructor\r\n * @param {Sk.builtin.dict} dict\r\n */\r\nvar dict_valueiter_ = buildDictIterClass(\"dict_valueiterator\", function () {\r\n    const item = this.next$item();\r\n    return item && item[1];\r\n});\r\n\r\nvar dict_reverse_iter_ = buildDictIterClass(\"dict_reversekeyiterator\", dict_iter_.prototype.tp$iternext, true);\r\nvar dict_reverse_itemiter_ = buildDictIterClass(\"dict_reverseitemiterator\", dict_itemiter_.prototype.tp$iternext, true);\r\nvar dict_reverse_valueiter_ = buildDictIterClass(\"dict_reversevalueiterator\", dict_valueiter_.prototype.tp$iternext, true);\r\n\r\n/**\r\n * Py2 methods\r\n * @private\r\n */\r\nSk.builtin.dict.py2$methods = {\r\n    has_key: {\r\n        $name: \"has_key\",\r\n        $flags: {OneArg: true},\r\n        $meth(k) {\r\n            return new Sk.builtin.bool(this.sq$contains(k));\r\n        },\r\n        $doc: \"D.has_key(k) -> True if D has a key k, else False\",\r\n    },\r\n    keys: {\r\n        $name: \"keys\",\r\n        $meth() {\r\n            return new Sk.builtin.list(this.sk$asarray());\r\n        },\r\n        $flags: {NoArgs: true},\r\n        $textsig: null,\r\n        $doc: \"D.keys() -> a set-like object providing a view on D's keys\",\r\n    },\r\n    items: {\r\n        $name: \"items\",\r\n        $meth() {\r\n            return new Sk.builtin.list(this.$items().map(([key, val]) => new Sk.builtin.tuple([key, val])));\r\n        },\r\n        $flags: {NoArgs: true},\r\n        $textsig: null,\r\n        $doc: \"D.items() -> a set-like object providing a view on D's items\",\r\n    },\r\n    values: {\r\n        $name: \"values\",\r\n        $meth() {\r\n            return new Sk.builtin.list(this.$items().map(([_, val]) => val));\r\n        },\r\n        $flags: {NoArgs: true},\r\n        $textsig: null,\r\n        $doc: \"D.values() -> an object providing a view on D's values\",\r\n    },\r\n};\r\n","const dict$views = {\r\n    KEYS: \"dict_keys\",\r\n    VALUES: \"dict_values\",\r\n    ITEMS: \"dict_items\",\r\n};\r\n\r\nfunction buildDictView(typename) {\r\n    const dict_view_options = {};\r\n    dict_view_options.constructor = function (dict) {\r\n        this.dict = dict;\r\n    };\r\n    dict_view_options.slots = {\r\n        tp$getattr: Sk.generic.getAttr,\r\n        tp$as_number: true,\r\n        tp$as_sequence_or_mapping: true,\r\n        tp$hash: Sk.builtin.none.none$,\r\n        $r: function () {\r\n            if (this.$entered_repr !== undefined) {\r\n                // prevent recursively calling oneself\r\n                return new Sk.builtin.str(\"...\");\r\n            }\r\n            this.$entered_repr = true;\r\n            const L = Sk.misceval.arrayFromIterable(this);\r\n            const res = Sk.misceval.objectRepr(new Sk.builtin.list(L));\r\n            this.$entered_repr = undefined;\r\n            return new Sk.builtin.str(Sk.abstr.typeName(this) + \"(\" + res + \")\");\r\n        },\r\n        tp$richcompare: function () {\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        },\r\n        tp$iter: function () {\r\n            if (this.tp$name === dict$views.KEYS) {\r\n                return new Sk.builtin.dict_iter_(this.dict);\r\n            } else if (this.tp$name === dict$views.VALUES) {\r\n                return new Sk.builtin.dict_valueiter_(this.dict);\r\n            } else if (this.tp$name === dict$views.ITEMS) {\r\n                return new Sk.builtin.dict_itemiter_(this.dict);\r\n            }\r\n        },\r\n        nb$subtract: function () {\r\n            // TODO\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        },\r\n        nb$and: function () {\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        },\r\n        nb$or: function () {\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        },\r\n        nb$xor: function () {\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        },\r\n\r\n        sq$length: function () {\r\n            return this.dict.get$size();\r\n        },\r\n        sq$contains: function (item) {\r\n            var iter, key, value, pair;\r\n            if (this.tp$name === dict$views.KEYS) {\r\n                return this.dict.mp$lookup(item) !== undefined;\r\n            } else if (this.tp$name === dict$views.VALUES) {\r\n                for (iter = Sk.abstr.iter(this.dict), key = iter.tp$iternext(); key !== undefined; key = iter.tp$iternext()) {\r\n                    value = this.dict.mp$subscript(key);\r\n                    if (value === undefined) {\r\n                        value = null;\r\n                    }\r\n                    if (Sk.misceval.isTrue(Sk.misceval.richCompareBool(value, item, \"Eq\"))) {\r\n                        return true;\r\n                    }\r\n                }\r\n                return false;\r\n            } else if (this.tp$name === dict$views.ITEMS) {\r\n                if (item.mp$subscript && item.sq$length && item.sq$length() === 2) {\r\n                    key = item.mp$subscript(new Sk.builtin.int_(0));\r\n                    value = this.dict.mp$lookup(key);\r\n                    if (value !== undefined) {\r\n                        pair = new Sk.builtin.tuple([key, value]);\r\n                        if (Sk.misceval.isTrue(Sk.misceval.richCompareBool(pair, item, \"Eq\"))) {\r\n                            return true;\r\n                        }\r\n                    }\r\n                }\r\n                return false;\r\n            }\r\n        },\r\n    };\r\n    dict_view_options.methods = {\r\n        isdisjoint: {\r\n            $meth: function () {\r\n                return Sk.builtin.NotImplemented.NotImplemented$;\r\n            },\r\n            $flags: {},\r\n            $textsig: null,\r\n            $doc: \"Return True if the view and the given iterable have a null intersection.\",\r\n        },\r\n        __reversed__: {\r\n            $meth: function () {\r\n                if (this.tp$name === dict$views.KEYS) {\r\n                    return new Sk.builtin.dict_reverse_iter_(this.dict);\r\n                } else if (this.tp$name === dict$views.ITEMS) {\r\n                    return new Sk.builtin.dict_reverse_itemiter_(this.dict);\r\n                } else if (this.tp$name === dict$views.VALUES) {\r\n                    return new Sk.builtin.dict_reverse_valueiter_(this.dict);\r\n                }\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: null,\r\n            $doc: \"Return a reverse iterator over the dict keys.\",\r\n        },\r\n    };\r\n    dict_view_options.flags = {\r\n        sk$acceptable_as_base: false,\r\n    };\r\n\r\n    return Sk.abstr.buildNativeClass(typename, dict_view_options);\r\n}\r\n\r\nSk.builtin.dict_keys = buildDictView(\"dict_keys\");\r\nSk.builtin.dict_values = buildDictView(\"dict_values\");\r\nSk.builtin.dict_items = buildDictView(\"dict_items\");\r\n\r\nfunction dict_iter_constructor(dict) {\r\n    this.$index = 0;\r\n    this.$seq = dict.sk$asarray();\r\n    this.$orig = dict;\r\n}\r\n\r\n/**\r\n * @param {string} typename \r\n * @param {Function} iternext \r\n * @param {Function=} constructor \r\n */\r\nfunction buildDictIterClass(typename, iternext, constructor) {\r\n    return Sk.abstr.buildIteratorClass(typename, {\r\n        constructor:\r\n            constructor ||\r\n            function (dict) {\r\n                dict_iter_constructor.call(this, dict);\r\n            },\r\n        iternext: iternext,\r\n        methods: {\r\n            __length_hint__: Sk.generic.iterLengthHintWithArrayMethodDef,\r\n        },\r\n        flags: {sk$acceptable_as_base_class: false},\r\n    });\r\n}\r\n\r\n/**\r\n * @constructor\r\n * @param {Sk.builtin.dict} dict\r\n */\r\nSk.builtin.dict_iter_ = buildDictIterClass(\"dict_keyiterator\", Sk.generic.iterNextWithArrayCheckSize);\r\n\r\nfunction dict_iter_get_value_or_throw() {\r\n    const key = Sk.generic.iterNextWithArrayCheckSize.call(this);\r\n    if (key === undefined) {\r\n        return key;\r\n    }\r\n    const res = this.$orig.mp$lookup(key);\r\n    if (res !== undefined) {\r\n        return res;\r\n    }\r\n    // some what of a hack since we don't dynamically get keys unlike Python\r\n    throw new Sk.builtin.RuntimeError(Sk.misceval.objectRepr(key) + \" removed during iteration\");\r\n}\r\n\r\n/**\r\n * @constructor\r\n * @param {Sk.builtin.dict} dict\r\n */\r\nSk.builtin.dict_valueiter_ = buildDictIterClass(\"dict_valueiterator\", function () {\r\n    return dict_iter_get_value_or_throw.call(this);\r\n});\r\n\r\n/**\r\n * @constructor\r\n * @param {Sk.builtin.dict} dict\r\n */\r\nSk.builtin.dict_itemiter_ = buildDictIterClass(\"dict_itemiterator\", function __next__() {\r\n    const idx = this.$index;\r\n    const val = dict_iter_get_value_or_throw.call(this);\r\n    if (val === undefined) {\r\n        return val;\r\n    }\r\n    return new Sk.builtin.tuple([this.$seq[idx], val]);\r\n});\r\n\r\nfunction dict_reverse_iter_constructor(dict) {\r\n    dict_iter_constructor.call(this, dict);\r\n    this.$seq.reverse();\r\n}\r\n\r\nSk.builtin.dict_reverse_iter_ = buildDictIterClass(\"dict_reversekeyiterator\", Sk.generic.iterNextWithArrayCheckSize, function (dict) {\r\n    dict_reverse_iter_constructor.call(this, dict);\r\n});\r\n\r\nSk.builtin.dict_reverse_itemiter_ = buildDictIterClass(\"dict_reverseitemiterator\", Sk.builtin.dict_itemiter_.prototype.tp$iternext, function (dict) {\r\n    dict_reverse_iter_constructor.call(this, dict);\r\n});\r\n\r\nSk.builtin.dict_reverse_valueiter_ = buildDictIterClass(\"dict_reversevalueiterator\", Sk.builtin.dict_valueiter_.prototype.tp$iternext, function (dict) {\r\n    dict_reverse_iter_constructor.call(this, dict);\r\n});\r\n","/**\r\n * @constructor\r\n * @param {pyObject} iterable\r\n * @param {number|string=} start\r\n * @extends Sk.builtin.object\r\n */\r\nSk.builtin.enumerate = Sk.abstr.buildIteratorClass(\"enumerate\", {\r\n    constructor: function enumerate(iterable, start) {\r\n    if (!(this instanceof Sk.builtin.enumerate)) {\r\n            throw TypeError(\"Failed to construct 'enumerate': Please use the 'new' operator\");\r\n        }\r\n        this.$iterable = iterable;\r\n    this.$index = start;\r\n        return this;\r\n    },\r\n    iternext(canSuspend) {\r\n        const ret = Sk.misceval.chain(this.$iterable.tp$iternext(canSuspend), (i) => {\r\n            if (i === undefined) {\r\n            return undefined;\r\n        }\r\n            return new Sk.builtin.tuple([new Sk.builtin.int_(this.$index++), i]);\r\n        });\r\n        return canSuspend ? ret : Sk.misceval.retryOptionalSuspensionOrThrow(ret);\r\n    },\r\n    slots: {\r\n        tp$doc:\r\n            \"Return an enumerate object.\\n\\n  iterable\\n    an object supporting iteration\\n\\nThe enumerate object yields pairs containing a count (from start, which\\ndefaults to zero) and a value yielded by the iterable argument.\\n\\nenumerate is useful for obtaining an indexed list:\\n    (0, seq[0]), (1, seq[1]), (2, seq[2]), ...\",\r\n        tp$new(args, kwargs) {\r\n            let [iterable, start] = Sk.abstr.copyKeywordsToNamedArgs(\"enumerate\", [\"iterable\", \"start\"], args, kwargs, [new Sk.builtin.int_(0)]);\r\n            iterable = Sk.abstr.iter(iterable);\r\n            start = Sk.misceval.asIndexOrThrow(start);\r\n            if (this === Sk.builtin.enumerate.prototype) {\r\n                return new Sk.builtin.enumerate(iterable, start);\r\n            } else {\r\n                const instance = new this.constructor();\r\n                Sk.builtin.enumerate.call(instance, iterable, start);\r\n                return instance;\r\n            }\r\n        },\r\n    },\r\n    classmethods: Sk.generic.classGetItem,\r\n});\r\nSk.exportSymbol(\"Sk.builtin.enumerate\", Sk.builtin.enumerate);","/**\r\n * Base namespace for Skulpt. This is the only symbol that Skulpt adds to the\r\n * global namespace. Other user accessible symbols are noted and described\r\n * below.\r\n */\r\n\r\n/**\r\n *\r\n * Set various customizable parts of Skulpt.\r\n *\r\n * output: Replacable output redirection (called from print, etc.).\r\n * read: Replacable function to load modules with (called via import, etc.)\r\n * sysargv: Setable to emulate arguments to the script. Should be an array of JS\r\n * strings.\r\n * syspath: Setable to emulate PYTHONPATH environment variable (for finding\r\n * modules). Should be an array of JS strings.\r\n * nonreadopen: Boolean - set to true to allow non-read file operations\r\n * fileopen: Optional function to call any time a file is opened\r\n * filewrite: Optional function to call when writing to a file\r\n *\r\n * Any variables that aren't set will be left alone.\r\n */\r\n\r\nSk.bool_check = function (variable, name) {\r\n    if (variable === undefined || variable === null || typeof variable !== \"boolean\") {\r\n        throw new Error(\"must specify \" + name + \" and it must be a boolean\");\r\n    }\r\n};\r\n\r\n/**\r\n * Please use python3 flag to control new behavior that is different\r\n * between Python 2/3, rather than adding new flags.\r\n */\r\n\r\nSk.python2 = {\r\n    print_function: false,\r\n    division: false,\r\n    absolute_import: null,\r\n    unicode_literals: false,\r\n    // skulpt specific\r\n    python3: false,\r\n    class_repr: false,\r\n    inherit_from_object: false,\r\n    super_args: false,\r\n    octal_number_literal: false,\r\n    bankers_rounding: false,\r\n    python_version: false,\r\n    dunder_next: false,\r\n    dunder_round: false,\r\n    exceptions: false,\r\n    no_long_type: false,\r\n    ceil_floor_int: false,\r\n    silent_octal_literal: true,\r\n};\r\n\r\nSk.python3 = {\r\n    print_function: true,\r\n    division: true,\r\n    absolute_import: null,\r\n    unicode_literals: true,\r\n    // skulpt specific\r\n    python3: true,\r\n    class_repr: true,\r\n    inherit_from_object: true,\r\n    super_args: true,\r\n    octal_number_literal: true,\r\n    bankers_rounding: true,\r\n    python_version: true,\r\n    dunder_next: true,\r\n    dunder_round: true,\r\n    exceptions: true,\r\n    no_long_type: true,\r\n    ceil_floor_int: true,\r\n    silent_octal_literal: false,\r\n};\r\n\r\nSk.configure = function (options) {\r\n    \"use strict\";\r\n    Sk.output = options[\"output\"] || Sk.output;\r\n    Sk.asserts.assert(typeof Sk.output === \"function\");\r\n\r\n    Sk.debugout = options[\"debugout\"] || Sk.debugout;\r\n    Sk.asserts.assert(typeof Sk.debugout === \"function\");\r\n\r\n    Sk.uncaughtException = options[\"uncaughtException\"] || Sk.uncaughtException;\r\n    Sk.asserts.assert(typeof Sk.uncaughtException === \"function\");\r\n\r\n    Sk.read = options[\"read\"] || Sk.read;\r\n    Sk.asserts.assert(typeof Sk.read === \"function\");\r\n\r\n    Sk.nonreadopen = options[\"nonreadopen\"] || false;\r\n    Sk.asserts.assert(typeof Sk.nonreadopen === \"boolean\");\r\n\r\n    Sk.fileopen = options[\"fileopen\"] || undefined;\r\n    Sk.asserts.assert(typeof Sk.fileopen === \"function\" || typeof Sk.fileopen === \"undefined\");\r\n\r\n    Sk.filewrite = options[\"filewrite\"] || undefined;\r\n    Sk.asserts.assert(typeof Sk.filewrite === \"function\" || typeof Sk.filewrite === \"undefined\");\r\n\r\n    Sk.timeoutMsg = options[\"timeoutMsg\"] || Sk.timeoutMsg;\r\n    Sk.asserts.assert(typeof Sk.timeoutMsg === \"function\");\r\n    Sk.exportSymbol(\"Sk.timeoutMsg\", Sk.timeoutMsg);\r\n\r\n    Sk.sysargv = options[\"sysargv\"] || Sk.sysargv;\r\n    Sk.asserts.assert(Sk.isArrayLike(Sk.sysargv));\r\n\r\n    Sk.__future__ = options[\"__future__\"] || Sk.python3;\r\n\r\n    Sk.bool_check(Sk.__future__.print_function, \"Sk.__future__.print_function\");\r\n    Sk.bool_check(Sk.__future__.division, \"Sk.__future__.division\");\r\n    Sk.bool_check(Sk.__future__.unicode_literals, \"Sk.__future__.unicode_literals\");\r\n    Sk.bool_check(Sk.__future__.class_repr, \"Sk.__future__.class_repr\");\r\n    Sk.bool_check(Sk.__future__.inherit_from_object, \"Sk.__future__.inherit_from_object\");\r\n    Sk.bool_check(Sk.__future__.super_args, \"Sk.__future__.super_args\");\r\n    Sk.bool_check(Sk.__future__.octal_number_literal, \"Sk.__future__.octal_number_literal\");\r\n    Sk.bool_check(Sk.__future__.bankers_rounding, \"Sk.__future__.bankers_rounding\");\r\n    Sk.bool_check(Sk.__future__.python_version, \"Sk.__future__.python_version\");\r\n    Sk.bool_check(Sk.__future__.dunder_next, \"Sk.__future__.dunder_next\");\r\n    Sk.bool_check(Sk.__future__.dunder_round, \"Sk.__future__.dunder_round\");\r\n    Sk.bool_check(Sk.__future__.exceptions, \"Sk.__future__.exceptions\");\r\n    Sk.bool_check(Sk.__future__.no_long_type, \"Sk.__future__.no_long_type\");\r\n    Sk.bool_check(Sk.__future__.ceil_floor_int, \"Sk.__future__.ceil_floor_int\");\r\n    Sk.bool_check(Sk.__future__.silent_octal_literal, \"Sk.__future__.silent_octal_literal\");\r\n\r\n    // in __future__ add checks for absolute_import\r\n\r\n    Sk.imageProxy = options[\"imageProxy\"] || \"http://localhost:8080/320x\";\r\n    Sk.asserts.assert(typeof Sk.imageProxy === \"string\" || typeof Sk.imageProxy === \"function\");\r\n\r\n    Sk.BottleSiteTarget = options[\"BottleSiteTarget\"] || \"#website\";\r\n    Sk.asserts.assert(typeof Sk.BottleSiteTarget === \"string\" || typeof Sk.BottleSiteTarget === \"function\");\r\n\r\n    Sk.inputfun = options[\"inputfun\"] || Sk.inputfun;\r\n    Sk.asserts.assert(typeof Sk.inputfun === \"function\");\r\n\r\n    Sk.inputfunTakesPrompt = options[\"inputfunTakesPrompt\"] || false;\r\n    Sk.asserts.assert(typeof Sk.inputfunTakesPrompt === \"boolean\");\r\n\r\n    Sk.retainGlobals = options[\"retainglobals\"] || options[\"retainGlobals\"] || false;\r\n    Sk.asserts.assert(typeof Sk.retainGlobals === \"boolean\");\r\n\r\n    Sk.debugging = options[\"debugging\"] || false;\r\n    Sk.asserts.assert(typeof Sk.debugging === \"boolean\");\r\n\r\n    Sk.killableWhile = options[\"killableWhile\"] || false;\r\n    Sk.asserts.assert(typeof Sk.killableWhile === \"boolean\");\r\n\r\n    Sk.killableFor = options[\"killableFor\"] || false;\r\n    Sk.asserts.assert(typeof Sk.killableFor === \"boolean\");\r\n\r\n    Sk.signals = typeof options[\"signals\"] !== undefined ? options[\"signals\"] : null;\r\n    if (Sk.signals === true) {\r\n        Sk.signals = {\r\n            listeners: [],\r\n            addEventListener(handler) {\r\n                Sk.signals.listeners.push(handler);\r\n            },\r\n            removeEventListener(handler) {\r\n                var index = Sk.signals.listeners.indexOf(handler);\r\n                if (index >= 0) {\r\n                    Sk.signals.listeners.splice(index, 1); // Remove items\r\n                }\r\n            },\r\n            signal(signal, data) {\r\n                for (var i = 0; i < Sk.signals.listeners.length; i++) {\r\n                    Sk.signals.listeners[i].call(null, signal, data);\r\n                }\r\n            },\r\n        };\r\n    } else {\r\n        Sk.signals = null;\r\n    }\r\n    Sk.asserts.assert(typeof Sk.signals === \"object\");\r\n\r\n    Sk.breakpoints =\r\n        options[\"breakpoints\"] ||\r\n        function () {\r\n            return true;\r\n        };\r\n    Sk.asserts.assert(typeof Sk.breakpoints === \"function\");\r\n\r\n    Sk.setTimeout = options[\"setTimeout\"];\r\n    if (Sk.setTimeout === undefined) {\r\n        if (typeof setTimeout === \"function\") {\r\n            Sk.setTimeout = function (func, delay) {\r\n                setTimeout(func, delay);\r\n            };\r\n        } else {\r\n            Sk.setTimeout = function (func, delay) {\r\n                func();\r\n            };\r\n        }\r\n    }\r\n    Sk.asserts.assert(typeof Sk.setTimeout === \"function\");\r\n\r\n    if (\"execLimit\" in options) {\r\n        Sk.execLimit = options[\"execLimit\"];\r\n    }\r\n\r\n    if (\"yieldLimit\" in options) {\r\n        Sk.yieldLimit = options[\"yieldLimit\"];\r\n    }\r\n\r\n    if (options[\"syspath\"]) {\r\n        Sk.syspath = options[\"syspath\"];\r\n        Sk.asserts.assert(Sk.isArrayLike(Sk.syspath));\r\n        // assume that if we're changing syspath we want to force reimports.\r\n        // not sure how valid this is, perhaps a separate api for that.\r\n        Sk.realsyspath = undefined;\r\n        Sk.sysmodules = new Sk.builtin.dict([]);\r\n    }\r\n\r\n    Sk.misceval.softspace_ = false;\r\n\r\n    Sk.switch_version(Sk.__future__.python3);\r\n\r\n    Sk.builtin.str.$next = Sk.__future__.python3 ? new Sk.builtin.str(\"__next__\") : new Sk.builtin.str(\"next\");\r\n\r\n    Sk.setupOperators(Sk.__future__.python3);\r\n    Sk.setupDunderMethods(Sk.__future__.python3);\r\n\r\n    Sk.setupObjects(Sk.__future__.python3);\r\n};\r\n\r\nSk.exportSymbol(\"Sk.configure\", Sk.configure);\r\n\r\n/*\r\n * Replaceable handler for uncaught exceptions\r\n */\r\nSk.uncaughtException = function (err) {\r\n    throw err;\r\n};\r\n\r\n/*\r\n * Replaceable handler for uncaught exceptions\r\n */\r\nSk.uncaughtException = function (err) {\r\n    throw err;\r\n};\r\nSk.exportSymbol(\"Sk.uncaughtException\", Sk.uncaughtException);\r\n\r\n/*\r\n *      Replaceable message for message timeouts\r\n */\r\nSk.timeoutMsg = function () {\r\n    return \"Program exceeded run time limit.\";\r\n};\r\nSk.exportSymbol(\"Sk.timeoutMsg\", Sk.timeoutMsg);\r\n\r\n\r\n/**\r\n * If the timer needs to be paused, store it here.\r\n * @type {number}\r\n */\r\nSk.execPaused = 0;\r\nSk.execPausedAmount = 0;\r\n\r\n/*\r\n *  Hard execution timeout, throws an error. Set to null to disable\r\n */\r\nSk.execLimit = Number.POSITIVE_INFINITY;\r\n\r\n/*\r\n *  Soft execution timeout, returns a Suspension. Set to null to disable\r\n */\r\nSk.yieldLimit = Number.POSITIVE_INFINITY;\r\n\r\n/*\r\n * Keep track of stack somehow?\r\n */\r\nSk.execStack = [];\r\n\r\n/*\r\n * Replacable output redirection (called from print, etc).\r\n */\r\nSk.output = function (x) {\r\n};\r\n\r\n/*\r\n * Replacable function to load modules with (called via import, etc.)\r\n * todo; this should be an async api\r\n */\r\nSk.read = function (x) {\r\n    if (Sk.builtinFiles === undefined || Sk.builtinFiles[\"files\"][x] === undefined) {\r\n        throw \"File not found: '\" + x + \"'\";\r\n    }\r\n\r\n    return Sk.builtinFiles[\"files\"][x];\r\n};\r\n\r\n/*\r\n * Setable to emulate arguments to the script. Should be array of JS strings.\r\n */\r\nSk.sysargv = [];\r\n\r\n// lame function for sys module\r\nSk.getSysArgv = function () {\r\n    return Sk.sysargv;\r\n};\r\nSk.exportSymbol(\"Sk.getSysArgv\", Sk.getSysArgv);\r\n\r\n/**\r\n * Setable to emulate PYTHONPATH environment variable (for finding modules).\r\n * Should be an array of JS strings.\r\n */\r\nSk.syspath = [];\r\n\r\nSk.inBrowser = Sk.global[\"document\"] !== undefined;\r\n\r\nSk.afterSingleExecution = function (args) {\r\n};\r\nSk.exportSymbol(\"Sk.afterSingleExecution\", Sk.afterSingleExecution);\r\n\r\n/**\r\n * Internal function used for debug output.\r\n * @param {...} args\r\n */\r\nSk.debugout = function (args) {\r\n};\r\n\r\n(function () {\r\n    // set up some sane defaults based on availability\r\n    if (Sk.global[\"write\"] !== undefined) {\r\n        Sk.output = Sk.global[\"write\"];\r\n    } else if (Sk.global[\"console\"] !== undefined && Sk.global[\"console\"][\"log\"] !== undefined) {\r\n        Sk.output = function (x) {\r\n            Sk.global[\"console\"][\"log\"](x);\r\n        };\r\n    } else if (Sk.global[\"print\"] !== undefined) {\r\n        Sk.output = Sk.global[\"print\"];\r\n    }\r\n    if (Sk.global[\"console\"] !== undefined && Sk.global[\"console\"][\"log\"] !== undefined) {\r\n        Sk.debugout = function (x) {\r\n            Sk.global[\"console\"][\"log\"](x);\r\n        };\r\n    } else if (Sk.global[\"print\"] !== undefined) {\r\n        Sk.debugout = Sk.global[\"print\"];\r\n    }\r\n})();\r\n\r\nSk.inputfun = function (args) {\r\n    return window.prompt(args);\r\n};\r\n\r\n/**\r\n * currently can't seem to remove these functions without a serious slow down of 2x\r\n */\r\nSk.setup_method_mappings = function () {\r\n};\r\nSk.setupDictIterators = function (python3) {\r\n};\r\n\r\nSk.switch_version = function (py3) {\r\n    const methods_to_map = {\r\n        float_: {\r\n            method_names: [\"__round__\"],\r\n            2: [false],\r\n            3: [true],\r\n        },\r\n        int_: {\r\n            method_names: [\"__round__\"],\r\n            2: [false],\r\n            3: [true],\r\n        },\r\n        list: {\r\n            method_names: [\"clear\", \"copy\", \"sort\"],\r\n            2: [false, false, true],\r\n            3: [true, true, true],\r\n        },\r\n        dict: {\r\n            method_names: [\"has_key\", \"keys\", \"items\", \"values\"],\r\n            2: [true, true, true, true],\r\n            3: [false, true, true, true],\r\n        },\r\n    };\r\n\r\n    for (let klass_name in methods_to_map) {\r\n        const klass = Sk.builtin[klass_name];\r\n        const method_names = methods_to_map[klass_name].method_names;\r\n        const in_py3 = methods_to_map[klass_name][3];\r\n\r\n        // if we're not changing to py2 and we have no py3$methods then don't continue since these methods exist by default\r\n        if (py3 && klass.py3$methods === undefined) {\r\n            return;\r\n        } else if (klass.py3$methods === undefined) {\r\n            // Set up py3$methods if we haven't done so already\r\n            klass.py3$methods = {};\r\n            for (let i = 0; i < method_names.length; i++) {\r\n                const method_name = method_names[i];\r\n                if (!in_py3[i]) {\r\n                    continue;\r\n                }\r\n                klass.py3$methods[method_name] = klass.prototype[method_name].d$def;\r\n            }\r\n        }\r\n        let in_version, new_methods;\r\n        if (py3) {\r\n            in_version = in_py3;\r\n            new_methods = klass.py3$methods;\r\n        } else {\r\n            in_version = methods_to_map[klass_name][2];\r\n            new_methods = klass.py2$methods;\r\n        }\r\n        for (let i = 0; i < method_names.length; i++) {\r\n            const method_name = method_names[i];\r\n            delete klass.prototype[method_name];\r\n            if (in_version[i]) {\r\n                klass.prototype[method_name] = new Sk.builtin.method_descriptor(klass, new_methods[method_name]);\r\n            }\r\n        }\r\n    }\r\n};\r\n\r\nSk.exportSymbol(\"Sk.__future__\", Sk.__future__);\r\nSk.exportSymbol(\"Sk.inputfun\", Sk.inputfun);\r\n","/*\r\n * The filename, line number, and column number of exceptions are\r\n * stored within the exception object.  Note that not all exceptions\r\n * clearly report the column number.  To customize the exception\r\n * message to use any/all of these fields, you can either modify\r\n * tp$str below to print the desired message, or use them in the\r\n * skulpt wrapper (i.e., runit) to present the exception message.\r\n */\r\n\r\n\r\n\r\n/**\r\n * @constructor\r\n * @param {...} args Typically called with a single string argument\r\n */\r\nconst BaseException = Sk.abstr.buildNativeClass(\"BaseException\", {\r\n    constructor: function BaseException(arg, ...tb) {\r\n        // internally args is either a string\r\n        Sk.asserts.assert(this instanceof BaseException, \"bad call to exception constructor, use 'new'\");\r\n        // for all internal calls only the first argument is included in args\r\n        if (typeof arg === \"string\") {\r\n            arg = new Sk.builtin.str(arg);\r\n        }\r\n        this.args = new Sk.builtin.tuple(arg ? [arg] : []);\r\n        // if we have tb args then it's an internal call indicating the pre instantiated traceback\r\n        // we should probably change this at some point because this only happens with SyntaxErrors\r\n        this.traceback = tb.length >= 2 ? [{ filename: tb[0] || \"<unknown>\", text: tb[1], lineno: tb[2] }] : [];\r\n        this._full_traceback = tb;\r\n        this.feedback = Sk.builtin.none.none$;\r\n        this.__cause__ = Sk.builtin.none.none$;\r\n        this.__context__ = Sk.builtin.none.none$;\r\n        this.__suppress_context__ = Sk.builtin.none.none$;\r\n        this.$d = new Sk.builtin.dict();\r\n    },\r\n    slots: /**@lends {BaseException}*/ {\r\n        tp$getattr: Sk.generic.getAttr,\r\n        tp$doc: \"Common base class for all exceptions\",\r\n        tp$new: BaseExc_new,\r\n        tp$init: BaseExc_init,\r\n        $r() {\r\n            let ret = this.tp$name;\r\n            ret += \"(\" + this.args.v.map((x) => Sk.misceval.objectRepr(x)).join(\", \") + \")\";\r\n            return new Sk.builtin.str(ret);\r\n        },\r\n        tp$str: BaseExc_str,\r\n    },\r\n    getsets: /**@lends {BaseException}*/ {\r\n        args: {\r\n            $get() {\r\n                return this.args;\r\n            },\r\n            $set(v) {\r\n                checkDeleting(v, \"args\");\r\n                this.args = new Sk.builtin.tuple(v);\r\n            },\r\n        },\r\n        __dict__: Sk.generic.getSetDict,\t\r\n        __cause__: {\r\n            $get: function () { return this.__cause__; },\r\n            $set: function(v) { this.__cause__ = v; }\r\n        },\r\n        feedback: {\r\n            $get: function () { return this.feedback; },\r\n            $set: function(v) { this.feedback = v; }\r\n        },\r\n        __context__: {\r\n            $get: function () { return this.__context__; },\r\n            $set: function(v) { this.__context__ = v; }\r\n        },\r\n        __suppress_context__: {\r\n            $get: function () { return this.__suppress_context__; },\r\n            $set: function(v) { this.__suppress_context__ = v; }\r\n        }\r\n    },\r\n    proto: /**@lends {BaseException}*/ {\r\n        toString() {\r\n            let ret = this.tp$name;\r\n            ret += \": \" + this.tp$str().v;\r\n\r\n            if (this.traceback.length !== 0) {\r\n                ret += \" on line \" + this.traceback[0].lineno;\r\n            } else {\r\n                ret += \" at <unknown>\";\r\n            }\r\n\r\n            if (this.args.v.length > 4) {\r\n                ret += \"\\n\" + this.args.v[4].v + \"\\n\";\r\n                for (let i = 0; i < this.args.v[3]; ++i) {\r\n                    ret += \" \";\r\n                }\r\n                ret += \"^\\n\";\r\n            }\r\n\r\n            return ret;\r\n        }\r\n    }\r\n});\r\n\r\n// will be used when we implement other getsets\r\nfunction checkDeleting(v, name) {\r\n    if (v === undefined) {\r\n        throw new Sk.builtin.TypeError(`${name} may not be deleted`);\r\n    }\r\n}\r\n\r\nfunction BaseExc_new(args, kws) {\r\n    const instance = new this.constructor();\r\n    if (this.ht$type) {\r\n        BaseException.call(instance);\r\n    }\r\n    // called from python so do the args here\r\n    instance.args = new Sk.builtin.tuple(args.slice(0));\r\n    return instance;\r\n}\r\n\r\nfunction BaseExc_init(args, kws) {\r\n    Sk.abstr.checkNoKwargs(Sk.abstr.typeName(this), kws);\r\n    this.args = new Sk.builtin.tuple(args.slice(0));\r\n}\r\n\r\nfunction BaseExc_str() {\r\n    if (this.args.v.length <= 1) {\r\n        return new Sk.builtin.str(this.args.v[0]);\r\n    }\r\n    return this.args.$r();\r\n}\r\n\r\nfunction complexExtends(base, name, doc, init, descriptors, str) {\r\n    descriptors || (descriptors = []);\r\n    const flags = init ? {} : { sk$solidBase: false };\r\n    const slots = { tp$init: init || BaseExc_init, tp$doc: doc };\r\n    if (str) {\r\n        slots.tp$str = str;\r\n    }\r\n\r\n    return Sk.abstr.buildNativeClass(name, {\r\n        base,\r\n        constructor: function pyExc(...args) {\r\n            base.apply(this, args);\r\n            descriptors.forEach((getset, i) => {\r\n                this[\"$\" + getset] = Sk.ffi.remapToPy(args[i]);\r\n            });\r\n        },\r\n        slots,\r\n        getsets: Object.fromEntries(\r\n            descriptors.map((getset) => [\r\n                getset,\r\n                {\r\n                    $get() {\r\n                        return this[\"$\" + getset] || Sk.builtin.none.none$;\r\n                    },\r\n                    $set(v) {\r\n                        this[\"$\" + getset] = v || Sk.builtin.none.none$;\r\n                    },\r\n                },\r\n            ])\r\n        ),\r\n        flags,\r\n    });\r\n}\r\n\r\nfunction simpleExtends(base, name, doc) {\r\n    const tp$init = base.prototype.tp$init;\r\n    const slots = { tp$doc: doc, tp$init };\r\n    if (tp$init === BaseExc_init) {\r\n        slots.tp$new = BaseExc_new;\r\n    }\r\n    return Sk.abstr.buildNativeClass(name, {\r\n        base,\r\n        constructor: function pyExc(...args) {\r\n            base.apply(this, args);\r\n        },\r\n        slots,\r\n        flags: {\r\n            sk$solidBase: false,\r\n        },\r\n    });\r\n}\r\n\r\nconst SystemExit = simpleExtends(BaseException, \"SystemExit\", \"Request to exit from the interpreter.\");\r\nconst KeyboardInterrupt = simpleExtends(BaseException, \"KeyboardInterrupt\", \"Program interrupted by user.\");\r\nconst GeneratorExit = simpleExtends(BaseException, \"GeneratorExit\", \"Request that a generator exit.\");\r\n\r\nconst Exception = simpleExtends(BaseException, \"Exception\", \"Common base class for all non-exit exceptions.\");\r\n\r\nconst StopIteration = complexExtends(\r\n    Exception,\r\n    \"StopIteration\",\r\n    \"Signal the end from iterator.__next__().\",\r\n    function init(args, kws) {\r\n        BaseExc_init.call(this, args, kws);\r\n        this.$value = args[0] || Sk.builtin.none.none$;\r\n    },\r\n    [\"value\"]\r\n);\r\n\r\nconst StopAsyncIteration = simpleExtends(Exception, \"StopAsyncIteration\", \"Signal the end from iterator.__anext__().\");\r\n\r\nconst ArithmeticError = simpleExtends(Exception, \"ArithmeticError\", \"Base class for arithmetic errors.\");\r\nconst FloatingPointError = simpleExtends(ArithmeticError, \"FloatingPointError\", \"Floating point operation failed.\");\r\nconst OverflowError = simpleExtends(ArithmeticError, \"OverflowError\", \"Result too large to be represented.\");\r\nconst ZeroDivisionError = simpleExtends(\r\n    ArithmeticError,\r\n    \"ZeroDivisionError\",\r\n    \"Second argument to a division or modulo operation was zero.\"\r\n);\r\nconst AssertionError = simpleExtends(Exception, \"AssertionError\", \"Assertion failed.\");\r\nconst AttributeError = simpleExtends(Exception, \"AttributeError\", \"Attribute not found.\");\r\nconst BufferError = simpleExtends(Exception, \"BufferError\", \"Buffer error.\");\r\nconst EOFError = simpleExtends(Exception, \"EOFError\", \"Read beyond end of file.\");\r\n\r\nconst ImportError = complexExtends(\r\n    Exception,\r\n    \"ImportError\",\r\n    \"Import can't find module, or can't find name in module.\",\r\n    function init(args, kws) {\r\n        BaseExc_init.call(this, args);\r\n        const [name, path] = Sk.abstr.copyKeywordsToNamedArgs(\"ImportError\", [\"name\", \"path\"], [], kws);\r\n        this.$name = name;\r\n        this.$path = path;\r\n        if (args.length === 1) {\r\n            this.$msg = args[0];\r\n        }\r\n    },\r\n    [\"msg\", \"name\", \"path\"],\r\n    function str() {\r\n        if (Sk.builtin.checkString(this.$msg)) {\r\n            return this.$msg;\r\n        }\r\n        return BaseExc_str.call(this);\r\n    }\r\n);\r\n\r\nconst ModuleNotFoundError = simpleExtends(ImportError, \"ModuleNotFoundError\", \"Module not found.\");\r\n\r\nconst LookupError = simpleExtends(Exception, \"LookupError\", \"Base class for lookup errors.\");\r\nconst IndexError = simpleExtends(LookupError, \"IndexError\", \"Sequence index out of range.\");\r\nconst KeyError = complexExtends(LookupError, \"KeyError\", \"Mapping key not found.\", null, null, function str() {\r\n    if (this.args.v.length === 1) {\r\n        return this.args.v[0].$r(); // prevents printing an empty string\r\n    }\r\n    return BaseExc_str.call(this);\r\n});\r\n\r\nconst MemoryError = simpleExtends(Exception, \"MemoryError\", \"Out of memory.\");\r\n\r\nconst NameError = simpleExtends(Exception, \"NameError\", \"Name not found globally.\");\r\nconst UnboundLocalError = simpleExtends(\r\n    NameError,\r\n    \"UnboundLocalError\",\r\n    \"Local name referenced but not bound to a value.\"\r\n);\r\n\r\nconst OSError = complexExtends(Exception, \"OSError\", \"Base class for I/O related errors.\", function (args, kws) {\r\n    BaseExc_init.call(this, args, kws);\r\n});\r\n// const BlockingIOError = simpleExtends(OSError, \"BlockingIOError\", \"I/O operation would block.\");\r\n// const ChildProcessError = simpleExtends(OSError, \"ChildProcessError\", \"Child process error.\");\r\n// const ConnectionError = simpleExtends(OSError, \"ConnectionError\", \"Connection error.\");\r\n// const BrokenPipeError = simpleExtends(ConnectionError, \"BrokenPipeError\", \"Broken pipe.\");\r\n// const ConnectionAbortedError = simpleExtends(ConnectionError, \"ConnectionAbortedError\", \"Connection aborted.\");\r\n// const ConnectionRefusedError = simpleExtends(ConnectionError, \"ConnectionRefusedError\", \"Connection refused.\");\r\n// const ConnectionResetError = simpleExtends(ConnectionError, \"ConnectionResetError\", \"Connection reset.\");\r\n// const FileExistsError = simpleExtends(OSError, \"FileExistsError\", \"File already exists.\");\r\nconst FileNotFoundError = simpleExtends(OSError, \"FileNotFoundError\", \"File not found.\");\r\n// const InterruptedError = simpleExtends(OSError, \"InterruptedError\", \"Interrupted by signal.\");\r\n// const IsADirectoryError = simpleExtends(OSError, \"IsADirectoryError\", \"Operation doesn't work on directories.\");\r\n// const NotADirectoryError = simpleExtends(OSError, \"NotADirectoryError\", \"Operation only works on directories.\");\r\n// const PermissionError = simpleExtends(OSError, \"PermissionError\", \"Not enough permissions.\");\r\n// const ProcessLookupError = simpleExtends(OSError, \"ProcessLookupError\", \"Process not found.\");\r\nconst TimeoutError = simpleExtends(OSError, \"TimeoutError\", \"Timeout expired.\");\r\n\r\nconst ReferenceError = simpleExtends(Exception, \"ReferenceError\", \"Weak ref proxy used after referent went away.\");\r\n\r\nconst RuntimeError = simpleExtends(Exception, \"RuntimeError\", \"Unspecified run-time error.\");\r\nconst NotImplementedError = simpleExtends(\r\n    RuntimeError,\r\n    \"NotImplementedError\",\r\n    \"Method or function hasn't been implemented yet.\"\r\n);\r\nconst RecursionError = simpleExtends(RuntimeError, \"RecursionError\", \"Recursion limit exceeded.\");\r\n\r\nconst SyntaxError = complexExtends(\r\n    Exception,\r\n    \"SyntaxError\",\r\n    \"Invalid syntax.\",\r\n    function init(args, kws) {\r\n        // TODO: this doesn't actually get called any more??\r\n        BaseExc_init.call(this, args, kws);\r\n        if (args.length >= 1) {\r\n            this.$msg = args[0];\r\n        }\r\n        if (args.length === 2) {\r\n            const info = new Sk.builtin.tuple(args[1]).v;\r\n            this.$filename = info[0];\r\n            this.$lineno = info[1];\r\n            //console.debug(this, info);\r\n            // if info[2] is an array, then we break it up\r\n            if (Array.isArray(info[2].v)) {\r\n                if (Array.isArray(info[2].v[0].v)) {\r\n                    // Nested array?\r\n                    this.$offset = info[2].v[0].v[1];\r\n                    this.$end_lineno = info[2].v[1].v[0];\r\n                    this.$end_offset = info[2].v[1].v[1];\r\n                } else {\r\n                    // Flat array\r\n                    this.$offset = info[2].v[1];\r\n                    this.$end_lineno = info[2].v[2];\r\n                    this.$end_offset = info[2].v[3];\r\n                }\r\n            } else {\r\n                this.$offset = info[2];\r\n                this.$end_lineno = info[1];\r\n                this.$end_offset = info[2];\r\n            }\r\n            /*this.$offset = info[2].v[0].v[1];\r\n            this.$end_lineno = info[2].v[1].v[0];\r\n            this.$end_offset = info[2].v[1].v[1];*/\r\n            this.$text = info[3];\r\n            // TODO: acbart this just makes the traceback work for now, not actually getting the data yet\r\n        }\r\n    },\r\n    [\"msg\", \"filename\", \"text\", \"lineno\", \"offset\", \"end_lineno\", \"end_offset\" /*\"print_file_and_line\"*/],\r\n    function str() {\r\n        return BaseExc_str.call(this);\r\n    }\r\n);\r\nconst IndentationError = simpleExtends(SyntaxError, \"IndentationError\", \"Improper indentation.\");\r\nconst TabError = simpleExtends(IndentationError, \"TabError\", \"Improper mixture of spaces and tabs.\");\r\n\r\nconst SystemError = simpleExtends(Exception, \"SystemError\", \"Internal error in the Skulpt interpreter.\");\r\n\r\nconst TypeError = simpleExtends(Exception, \"TypeError\", \"Inappropriate argument type.\");\r\nconst ValueError = simpleExtends(Exception, \"ValueError\", \"Inappropriate argument value (of correct type).\");\r\n\r\nconst UnicodeError = simpleExtends(ValueError, \"UnicodeError\", \"Unicode related error.\");\r\n// these have some extra args - for now just keep them as simple extends\r\nconst UnicodeDecodeError = simpleExtends(UnicodeError, \"UnicodeDecodeError\", \"Unicode decoding error.\");\r\nconst UnicodeEncodeError = simpleExtends(UnicodeError, \"UnicodeEncodeError\", \"Unicode encoding error.\");\r\n// const UnicodeTranslateError = simpleExtends(UnicodeError, \"UnicodeTranslateError\", \"Unicode translation error.\");\r\n\r\n/**@todo we should support warnings */\r\n// const Warning = simpleExtends(Exception, \"Warning\", \"Base class for warning categories.\");\r\n// const DeprecationWarning = simpleExtends(Warning, \"DeprecationWarning\", \"Base class for warnings about deprecated features.\");\r\n// const PendingDeprecationWarning = simpleExtends(Warning, \"PendingDeprecationWarning\", \"Base class for warnings about features which will be deprecated\\nin the future.\");\r\n// const RuntimeWarning = simpleExtends(Warning, \"RuntimeWarning\", \"Base class for warnings about dubious runtime behavior.\");\r\n// const SyntaxWarning = simpleExtends(Warning, \"SyntaxWarning\", \"Base class for warnings about dubious syntax.\");\r\n// const UserWarning = simpleExtends(Warning, \"UserWarning\", \"Base class for warnings generated by user code.\");\r\n// const FutureWarning = simpleExtends(Warning, \"FutureWarning\", \"Base class for warnings about constructs that will change semantically\\nin the future.\");\r\n// const ImportWarning = simpleExtends(Warning, \"ImportWarning\", \"Base class for warnings about probable mistakes in module imports\");\r\n// const UnicodeWarning = simpleExtends(Warning, \"UnicodeWarning\", \"Base class for warnings about Unicode related problems, mostly\\nrelated to conversion problems.\");\r\n// const BytesWarning = simpleExtends(Warning, \"BytesWarning\", \"Base class for warnings about bytes and buffer related problems, mostly\\nrelated to conversion from str or comparing to str.\");\r\n// const ResourceWarning = simpleExtends(Warning, \"ResourceWarning\", \"Base class for warnings about resource usage.\");\r\n\r\nconst pyExc = {\r\n    BaseException,\r\n    SystemExit,\r\n    KeyboardInterrupt,\r\n    GeneratorExit,\r\n    Exception,\r\n    StopIteration,\r\n    StopAsyncIteration,\r\n    ArithmeticError,\r\n    FloatingPointError,\r\n    OverflowError,\r\n    ZeroDivisionError,\r\n    AssertionError,\r\n    AttributeError,\r\n    BufferError,\r\n    EOFError,\r\n    ImportError,\r\n    ModuleNotFoundError,\r\n    LookupError,\r\n    IndexError,\r\n    KeyError,\r\n    MemoryError,\r\n    NameError,\r\n    UnboundLocalError,\r\n    OSError,\r\n    IOError: OSError,\r\n    // BlockingIOError,\r\n    // ChildProcessError,\r\n    // ConnectionError,\r\n    // BrokenPipeError,\r\n    // ConnectionAbortedError,\r\n    // ConnectionRefusedError,\r\n    // ConnectionResetError,\r\n    // FileExistsError,\r\n    FileNotFoundError,\r\n    // InterruptedError,\r\n    // IsADirectoryError,\r\n    // NotADirectoryError,\r\n    // PermissionError,\r\n    // ProcessLookupError,\r\n    TimeoutError,\r\n    ReferenceError,\r\n    RuntimeError,\r\n    NotImplementedError,\r\n    RecursionError,\r\n    SyntaxError,\r\n    IndentationError,\r\n    TabError,\r\n    SystemError,\r\n    TypeError,\r\n    ValueError,\r\n    UnicodeError,\r\n    UnicodeDecodeError,\r\n    UnicodeEncodeError,\r\n    // UnicodeTranslateError,\r\n    // Warning,\r\n    // DeprecationWarning,\r\n    // PendingDeprecationWarning,\r\n    // RuntimeWarning,\r\n    // SyntaxWarning,\r\n    // UserWarning,\r\n    // FutureWarning,\r\n    // ImportWarning,\r\n    // UnicodeWarning,\r\n    // BytesWarning,\r\n    // ResourceWarning,\r\n};\r\n\r\nObject.assign(Sk.builtin, pyExc);\r\n\r\n\r\nSk.builtin.SuspensionError = simpleExtends(Exception, \"SuspensionError\", \"Unsupported Suspension in code.\");\r\n\r\nSk.builtin.ExternalError = Sk.abstr.buildNativeClass(\"ExternalError\", {\r\n    constructor: function ExternalError(...args) {\r\n        this.nativeError = args[0];\r\n        if (!Sk.builtin.checkString(this.nativeError)) {\r\n            args[0] = this.nativeError.toString();\r\n            if (args[0].startsWith(\"RangeError: Maximum call\")) {\r\n                args[0] = \"Maximum call stack size exceeded\";\r\n                return new RecursionError(...args);\r\n            }\r\n        }\r\n        Exception.apply(this, args);\r\n    },\r\n    base: Exception,\r\n});\r\n\r\n\r\n/**\r\n * @constructor\r\n */\r\nSk.builtin.frame = function (trace) {\r\n    if (!(this instanceof Sk.builtin.frame)) {\r\n        return new Sk.builtin.frame(trace);\r\n    }\r\n    this.trace = trace;\r\n    this.__class__ = Sk.builtin.frame;\r\n    return this;\r\n};\r\n\r\nSk.abstr.setUpInheritance(\"frame\", Sk.builtin.frame, Sk.builtin.object);\r\n\r\nSk.builtin.frame.prototype.tp$getattr = function (name) {\r\n    if (name != null && (Sk.builtin.checkString(name) || typeof name === \"string\")) {\r\n        var _name = name;\r\n\r\n        // get javascript string\r\n        if (Sk.builtin.checkString(name)) {\r\n            _name = Sk.ffi.remapToJs(name);\r\n        }\r\n\r\n        let line = this.trace.source;\r\n        if (line == null) {\r\n            if (this.trace.filename != null && this.trace.lineno != null) {\r\n                if (Sk.parse.linecache[this.trace.filename]) {\r\n                    line = Sk.parse.linecache[this.trace.filename][this.trace.lineno-1];\r\n                }\r\n            }\r\n        }\r\n\r\n        switch (_name) {\r\n            case \"f_back\":\r\n                return Sk.builtin.none.none$;\r\n            case \"f_builtins\":\r\n                return Sk.builtin.none.none$;\r\n            case \"f_code\":\r\n                return Sk.builtin.none.none$;\r\n            case \"f_globals\":\r\n                return Sk.builtin.none.none$;\r\n            case \"f_lasti\":\r\n                return Sk.builtin.none.none$;\r\n            case \"f_lineno\":\r\n                return Sk.ffi.remapToPy(this.trace.lineno);\r\n            case \"f_line\":\r\n                return Sk.ffi.remapToPy(line);\r\n            case \"f_locals\":\r\n                return Sk.builtin.none.none$;\r\n            case \"f_trace\":\r\n                return Sk.builtin.none.none$;\r\n            case \"co_filename\":\r\n                return Sk.ffi.remapToPy(this.trace.filename);\r\n            case \"co_name\":\r\n                return Sk.ffi.remapToPy(this.trace.scope);\r\n        }\r\n    }\r\n\r\n    // if we have not returned yet, try the genericgetattr\r\n    return Sk.builtin.object.prototype.GenericGetAttr(name);\r\n};\r\nSk.builtin.frame.prototype[\"$r\"] = function () {\r\n    return new Sk.builtin.str(\"<frame object>\");\r\n};\r\nSk.exportSymbol(\"Sk.builtin.frame\", Sk.builtin.frame);\r\n\r\n/**\r\n * @constructor\r\n * @param {Object} err\r\n */\r\nSk.builtin.traceback = function (trace) {\r\n    if (!(this instanceof Sk.builtin.traceback)) {\r\n        return new Sk.builtin.traceback(trace);\r\n    }\r\n\r\n    this.trace = trace;\r\n\r\n    const lineno = Array.isArray(trace.lineno) ? trace.lineno[2] : trace.lineno || -1;\r\n\r\n    this.tb_lineno = new Sk.builtin.int_(lineno);\r\n    // TODO: Hack, you know this isn't right\r\n    this.tb_frame = new Sk.builtin.frame(trace);\r\n    this.tb_source = new Sk.builtin.str(trace.source || \"(Missing Source Code)\");\r\n\r\n    //tb_frame, tb_lasti, tb_lineno, tb_next\r\n\r\n    this.__class__ = Sk.builtin.traceback;\r\n\r\n    return this;\r\n};\r\n\r\nSk.abstr.setUpInheritance(\"traceback\", Sk.builtin.traceback, Sk.builtin.object);\r\nSk.builtin.traceback.fromList = function (traces) {\r\n    var current = Sk.builtin.traceback(traces[0]),\r\n        first = current;\r\n    for (var i = 1; i < traces.length; i++) {\r\n        current.tb_next = Sk.builtin.traceback(traces[i]);\r\n        current = current.tb_next;\r\n    }\r\n    current.tb_next = Sk.builtin.none.none$;\r\n    return first;\r\n};\r\nSk.builtin.traceback.prototype.tp$getattr = function (name) {\r\n    if (name != null && (Sk.builtin.checkString(name) || typeof name === \"string\")) {\r\n        var _name = name;\r\n\r\n        // get javascript string\r\n        if (Sk.builtin.checkString(name)) {\r\n            _name = Sk.ffi.remapToJs(name);\r\n        }\r\n\r\n        switch (_name) {\r\n            case \"tb_lineno\":\r\n            case \"tb_source\":\r\n            case \"tb_frame\":\r\n            case \"tb_next\":\r\n                return this[_name];\r\n        }\r\n    }\r\n\r\n    // if we have not returned yet, try the genericgetattr\r\n    return Sk.builtin.object.prototype.GenericGetAttr(name);\r\n};\r\nSk.builtin.traceback.prototype[\"$r\"] = function () {\r\n    return new Sk.builtin.str(\"<traceback object>\");\r\n};\r\nSk.exportSymbol(\"Sk.builtin.traceback\", Sk.builtin.traceback);\r\n\r\n\r\n// TODO: Extract into sys.exc_info(). Work out how the heck\r\n// to find out what exceptions are being processed by parent stack frames...\r\nSk.builtin.getExcInfo = function (e) {\r\n    const v = [e.ob$type || Sk.builtin.none.none$, e, Sk.builtin.none.none$];\r\n    // TODO create a Traceback object for the third tuple element\r\n\r\n    return new Sk.builtin.tuple(v);\r\n};\r\n","/**\r\n * @namespace Sk.ffi\r\n *\r\n */\r\n\r\nSk.ffi = Sk.ffi || {};\r\n\r\n/**\r\n * maps from Javascript Object/Array/string to Python dict/list/str.\r\n *\r\n * only works on basic objects that are being used as storage, doesn't handle\r\n * functions, etc.\r\n */\r\nSk.ffi.remapToPy = function (obj) {\r\n    var k;\r\n    var kvs;\r\n    var i;\r\n    var arr;\r\n\r\n    if (obj === null || typeof obj === \"undefined\") {\r\n        return Sk.builtin.none.none$;\r\n    }\r\n\r\n    if (obj.ob$type) {\r\n        return obj;\r\n    }\r\n\r\n    if (obj instanceof Sk.misceval.Suspension) {\r\n        return obj;\r\n    }\r\n\r\n    if (Object.prototype.toString.call(obj) === \"[object Array]\") {\r\n        arr = [];\r\n        for (i = 0; i < obj.length; ++i) {\r\n            arr.push(Sk.ffi.remapToPy(obj[i]));\r\n        }\r\n        return new Sk.builtin.list(arr);\r\n    }\r\n\r\n    if (typeof obj === \"object\") {\r\n        kvs = [];\r\n        for (k in obj) {\r\n            kvs.push(Sk.ffi.remapToPy(k));\r\n            kvs.push(Sk.ffi.remapToPy(obj[k]));\r\n        }\r\n        return new Sk.builtin.dict(kvs);\r\n    }\r\n\r\n    if (typeof obj === \"string\") {\r\n        return new Sk.builtin.str(obj);\r\n    }\r\n\r\n    if (typeof obj === \"number\") {\r\n        return Sk.builtin.assk$(obj);\r\n    }\r\n\r\n    if (typeof obj === \"boolean\") {\r\n        return new Sk.builtin.bool(obj);\r\n    } else if (typeof obj === \"undefined\") {\r\n        return Sk.builtin.none.none$;\r\n    }\r\n\r\n    if (typeof obj === \"function\") {\r\n        return new Sk.builtin.func(obj);\r\n    }\r\n\r\n    Sk.asserts.fail(\"unhandled remap type \" + typeof (obj));\r\n};\r\nSk.exportSymbol(\"Sk.ffi.remapToPy\", Sk.ffi.remapToPy);\r\n\r\n/**\r\n * Maps from Python dict/list/str/number to Javascript Object/Array/string/number.\r\n *\r\n * If obj is a\r\n *\r\n * @param obj {Object}  Any Python object (except a function)\r\n *\r\n */\r\nSk.ffi.remapToJs = function (obj) {\r\n    var i;\r\n    var kAsJs;\r\n    var ret;\r\n    if (obj instanceof Sk.builtin.dict) {\r\n        ret = {};\r\n        obj.$items().forEach(([key, val]) => {\r\n            kAsJs = Sk.ffi.remapToJs(key);\r\n            // todo; assert that this is a reasonble lhs?\r\n            ret[kAsJs] = Sk.ffi.remapToJs(val);\r\n        });\r\n        return ret;\r\n    } else if (obj instanceof Sk.builtin.list || obj instanceof Sk.builtin.tuple) {\r\n        ret = [];\r\n        for (i = 0; i < obj.v.length; ++i) {\r\n            ret.push(Sk.ffi.remapToJs(obj.v[i]));\r\n        }\r\n        return ret;\r\n    } else if (obj instanceof Sk.builtin.bool) {\r\n        return obj.v ? true : false;\r\n    } else if (obj instanceof Sk.builtin.int_) {\r\n        return Sk.builtin.asnum$(obj);\r\n    } else if (obj instanceof Sk.builtin.float_) {\r\n        return Sk.builtin.asnum$(obj);\r\n    } else if (obj instanceof Sk.builtin.lng) {\r\n        return Sk.builtin.asnum$(obj);\r\n    } else if (typeof obj === \"number\" || typeof obj === \"boolean\" || typeof obj === \"string\") {\r\n        return obj;\r\n    } else if (obj === undefined) {\r\n        return undefined;\r\n    } else {\r\n        return obj.v;\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.ffi.remapToJs\", Sk.ffi.remapToJs);\r\n\r\nSk.ffi.callback = function (fn) {\r\n    if (fn === undefined) {\r\n        return fn;\r\n    }\r\n    return function () {\r\n        return Sk.misceval.apply(fn, undefined, undefined, undefined, Array.prototype.slice.call(arguments, 0));\r\n    };\r\n};\r\nSk.exportSymbol(\"Sk.ffi.callback\", Sk.ffi.callback);\r\n\r\nSk.ffi.stdwrap = function (type, towrap) {\r\n    var inst = new type();\r\n    inst[\"v\"] = towrap;\r\n    return inst;\r\n};\r\nSk.exportSymbol(\"Sk.ffi.stdwrap\", Sk.ffi.stdwrap);\r\n\r\n/**\r\n * for when the return type might be one of a variety of basic types.\r\n * number|string, etc.\r\n */\r\nSk.ffi.basicwrap = function (obj) {\r\n    if (obj instanceof Sk.builtin.int_) {\r\n        return Sk.builtin.asnum$(obj);\r\n    }\r\n    if (obj instanceof Sk.builtin.float_) {\r\n        return Sk.builtin.asnum$(obj);\r\n    }\r\n    if (obj instanceof Sk.builtin.lng) {\r\n        return Sk.builtin.asnum$(obj);\r\n    }\r\n    if (typeof obj === \"number\" || typeof obj === \"boolean\") {\r\n        return obj;\r\n    }\r\n    if (typeof obj === \"string\") {\r\n        return new Sk.builtin.str(obj);\r\n    }\r\n    Sk.asserts.fail(\"unexpected type for basicwrap\");\r\n};\r\nSk.exportSymbol(\"Sk.ffi.basicwrap\", Sk.ffi.basicwrap);\r\n\r\nSk.ffi.unwrapo = function (obj) {\r\n    if (obj === undefined) {\r\n        return undefined;\r\n    }\r\n    return obj[\"v\"];\r\n};\r\nSk.exportSymbol(\"Sk.ffi.unwrapo\", Sk.ffi.unwrapo);\r\n\r\nSk.ffi.unwrapn = function (obj) {\r\n    if (obj === null) {\r\n        return null;\r\n    }\r\n    return obj[\"v\"];\r\n};\r\nSk.exportSymbol(\"Sk.ffi.unwrapn\", Sk.ffi.unwrapn);\r\n","var STDOUT_FILENO = 1;\r\nvar STDIN_FILENO = 0;\r\nvar STDERR_FILENO = 2;\r\n\r\n/**\r\n * @constructor\r\n * @param {Sk.builtin.str} name\r\n * @param {Sk.builtin.str} mode\r\n * @param {Object} buffering\r\n */\r\nSk.builtin.file = function (name, mode, buffering) {\r\n    var i;\r\n    var elem;\r\n\r\n    if (!(this instanceof Sk.builtin.file)) {\r\n        return new Sk.builtin.file(name, mode, buffering);\r\n    }\r\n\r\n    this.mode = mode;\r\n    this.name = Sk.ffi.remapToJs(name);\r\n    this.closed = false;\r\n\r\n    if (this.name === \"/dev/stdout\") {\r\n        this.data$ = Sk.builtin.none.none$;\r\n        this.fileno = STDOUT_FILENO;\r\n    } else if (this.name === \"/dev/stdin\") {\r\n        this.fileno = STDIN_FILENO;\r\n    } else if (this.name === \"/dev/stderr\") {\r\n        this.fileno = STDERR_FILENO;\r\n    } else {\r\n        if (Sk.inBrowser) {  // todo:  Maybe provide a replaceable function for non-import files\r\n            this.fileno = 10;\r\n            this.data$ = Sk.inBrowser(this.name);\r\n            this.lineList = this.data$.split(\"\\n\");\r\n        } else {\r\n            this.fileno = 11;\r\n            this.data$ = Sk.read(name.v);\r\n            this.lineList = this.data$.split(\"\\n\");\r\n            this.lineList = this.lineList.slice(0, -1);\r\n        }\r\n\r\n        //for (i in this.lineList) {\r\n        for (let i=0; i < this.lineList.length-1; i+= 1) {\r\n            this.lineList[i] = this.lineList[i] + \"\\n\";\r\n        }\r\n        this.currentLine = 0;\r\n    }\r\n    this.pos$ = 0;\r\n\r\n\t// TODONEW: Is this necessary?\r\n    this.__class__ = Sk.builtin.file;\r\n\r\n    if (Sk.fileopen && this.fileno >= 10) {\r\n        Sk.fileopen(this);\r\n    }\r\n\r\n    return this;\r\n};\r\n\r\nSk.abstr.setUpInheritance(\"file\", Sk.builtin.file, Sk.builtin.object);\r\nSk.abstr.setUpBuiltinMro(Sk.builtin.file);\r\n\r\nSk.builtin.file.prototype[\"$r\"] = function () {\r\n    return new Sk.builtin.str(\"<\" +\r\n        (this.closed ? \"closed\" : \"open\") +\r\n        \"file '\" +\r\n        this.name +\r\n        \"', mode '\" +\r\n        Sk.ffi.remapToJs(this.mode) +\r\n        \"'>\");\r\n};\r\n\r\nSk.builtin.file.prototype.tp$iter = function () {\r\n    var allLines = this.lineList;\r\n    var that = this;\r\n    //var currentLine = this.currentLine;\r\n\r\n    var ret =\r\n        {\r\n            tp$iter: function () {\r\n                return ret;\r\n            },\r\n            $obj: this,\r\n            $index: this.currentLine,\r\n            $lines: allLines,\r\n            tp$iternext: function () {\r\n                if (that.currentLine >= ret.$lines.length) {\r\n                    return undefined;\r\n                }\r\n                return new Sk.builtin.str(ret.$lines[that.currentLine++]);\r\n            }\r\n        };\r\n    return ret;\r\n};\r\n\r\nSk.abstr.setUpSlots(Sk.builtin.file);\r\n\r\nSk.builtin.file.prototype[\"__enter__\"] = new Sk.builtin.func(function __enter__(self) {\r\n    return self;\r\n});\r\n\r\nSk.builtin.file.prototype[\"__exit__\"] = new Sk.builtin.func(function __exit__(self) {\r\n    return Sk.misceval.callsimArray(Sk.builtin.file.prototype[\"close\"], [self]);\r\n});\r\n\r\n\r\n\r\nSk.builtin.file.prototype[\"close\"] = new Sk.builtin.func(function close(self) {\r\n    self.closed = true;\r\n    return Sk.builtin.none.none$;\r\n});\r\n\r\nSk.builtin.file.prototype[\"flush\"] = new Sk.builtin.func(function flush(self) {\r\n});\r\n\r\nSk.builtin.file.prototype[\"fileno\"] = new Sk.builtin.func(function fileno(self) {\r\n    return this.fileno;\r\n}); // > 0, not 1/2/3\r\n\r\nSk.builtin.file.prototype[\"isatty\"] = new Sk.builtin.func(function isatty(self) {\r\n    return false;\r\n});\r\n\r\nSk.builtin.file.prototype[\"read\"] = new Sk.builtin.func(function read(self, size) {\r\n    var ret;\r\n    var len = self.data$.length;\r\n    var l_size;\r\n    if (self.closed) {\r\n        throw new Sk.builtin.ValueError(\"I/O operation on closed file\");\r\n    }\r\n\r\n    if (size === undefined) {\r\n        l_size = len;\r\n    } else {\r\n        l_size = Sk.ffi.remapToJs(size);\r\n    }\r\n\r\n    ret = new Sk.builtin.str(self.data$.substr(self.pos$, l_size));\r\n    if (size === undefined) {\r\n        self.pos$ = len;\r\n    } else {\r\n        self.pos$ += Sk.ffi.remapToJs(size);\r\n    }\r\n    if (self.pos$ >= len) {\r\n        self.pos$ = len;\r\n    }\r\n\r\n    return ret;\r\n});\r\n\r\nSk.builtin.file.$readline = function (self, size, prompt) {\r\n    if (self.fileno === 0) {\r\n        var x, susp;\r\n\r\n        var lprompt = Sk.ffi.remapToJs(prompt);\r\n\r\n        lprompt = lprompt ? lprompt : \"\";\r\n\r\n        Sk.misceval.pauseTimer();\r\n        x = Sk.inputfun(lprompt);\r\n\r\n        if (x instanceof Promise || (x && typeof x.then === \"function\")) {\r\n            susp = new Sk.misceval.Suspension();\r\n\r\n            susp.resume = function () {\r\n                if (susp.data.error) {\r\n                    throw susp.data.error;\r\n                }\r\n\r\n                Sk.misceval.unpauseTimer();\r\n                return new Sk.builtin.str(susp.data.result);\r\n            };\r\n\r\n            susp.data = {\r\n                type: \"Sk.promise\",\r\n                promise: x\r\n            };\r\n\r\n            return susp;\r\n        } else {\r\n            Sk.misceval.unpauseTimer();\r\n            return new Sk.builtin.str(x);\r\n        }\r\n    } else {\r\n        var line = \"\";\r\n        if (self.currentLine < self.lineList.length) {\r\n            line = self.lineList[self.currentLine];\r\n            self.currentLine++;\r\n        }\r\n        return new Sk.builtin.str(line);\r\n    }\r\n};\r\n\r\nSk.builtin.file.prototype[\"readline\"] = new Sk.builtin.func(function readline(self, size) {\r\n    return Sk.builtin.file.$readline(self, size, undefined);\r\n});\r\n\r\nSk.builtin.file.prototype[\"readlines\"] = new Sk.builtin.func(function readlines(self, sizehint) {\r\n    if (self.fileno === 0) {\r\n        return new Sk.builtin.NotImplementedError(\"readlines ins't implemented because the web doesn't support Ctrl+D\");\r\n    }\r\n\r\n    var i;\r\n    var arr = [];\r\n    for (i = self.currentLine; i < self.lineList.length; i++) {\r\n        arr.push(new Sk.builtin.str(self.lineList[i]));\r\n    }\r\n    return new Sk.builtin.list(arr);\r\n});\r\n\r\nSk.builtin.file.prototype[\"seek\"] = new Sk.builtin.func(function seek(self, offset, whence) {\r\n    var l_offset = Sk.ffi.remapToJs(offset);\r\n\r\n    if (whence === undefined) {\r\n        whence = 0;\r\n    }\r\n    if (whence === 0) {\r\n        self.pos$ = l_offset;\r\n    } else if (whence == 1) {\r\n        self.pos$ = self.data$.length + l_offset;\r\n    } else if (whence == 2) {\r\n        self.pos$ = self.data$.length + l_offset;\r\n    }\r\n\r\n    return Sk.builtin.none.none$;\r\n});\r\n\r\nSk.builtin.file.prototype[\"tell\"] = new Sk.builtin.func(function tell(self) {\r\n    return Sk.ffi.remapToPy(self.pos$);\r\n});\r\n\r\nSk.builtin.file.prototype[\"truncate\"] = new Sk.builtin.func(function truncate(self, size) {\r\n    Sk.asserts.fail();\r\n});\r\n\r\nSk.builtin.file.prototype[\"write\"] = new Sk.builtin.func(function write(self, str) {\r\n    var mode = Sk.ffi.remapToJs(self.mode);\r\n    if (mode === \"w\" || mode === \"wb\" || mode === \"a\" || mode === \"ab\") {\r\n        if (Sk.filewrite) {\r\n            if (self.closed) {\r\n                throw new Sk.builtin.ValueError(\"I/O operation on closed file\");\r\n            }\r\n\r\n            if (self.fileno === 1) {\r\n                Sk.output(Sk.ffi.remapToJs(str));\r\n            } else {\r\n                Sk.filewrite(self, str);\r\n            }\r\n        } else {\r\n            if (self.fileno === 1) {\r\n                Sk.output(Sk.ffi.remapToJs(str));\r\n            } else {\r\n                Sk.asserts.fail();\r\n            }\r\n        }\r\n    } else {\r\n        throw new Sk.builtin.IOError(\"File not open for writing\");\r\n    }\r\n\r\n    return Sk.builtin.none.none$;\r\n});\r\n\r\n\r\nSk.exportSymbol(\"Sk.builtin.file\", Sk.builtin.file);\r\n","/**\r\n * @constructor\r\n * @param {pyObject} func\r\n * @param {pyObject} iterable\r\n * @extends Sk.builtin.object\r\n */\r\nSk.builtin.filter_ = Sk.abstr.buildIteratorClass(\"filter\", {\r\n    constructor: function filter_(func, iterable) {\r\n        this.$func = func;\r\n        this.$iterable = iterable;\r\n    },\r\n    iternext(canSuspend) {\r\n        // iterate over iterable until we pass the predicate\r\n        // this.chcek$filter either returns the item or undefined\r\n        const ret = Sk.misceval.iterFor(this.$iterable, (i) =>\r\n            Sk.misceval.chain(this.check$filter(i), (i) => (i ? new Sk.misceval.Break(i) : undefined))\r\n        );\r\n        return canSuspend ? ret : Sk.misceval.retryOptionalSuspensionOrThrow(ret);\r\n    },\r\n    slots: {\r\n        tp$doc:\r\n            \"Return an iterator yielding those items of iterable for which function(item)\\nis true. If function is None, return the items that are true.\",\r\n        tp$new(args, kwargs) {\r\n            let [func, iterable] = Sk.abstr.copyKeywordsToNamedArgs(\"filter\", [\"predicate\", \"iterable\"], args, kwargs, []);\r\n            func = Sk.builtin.checkNone(func) ? null : func;\r\n            iterable = Sk.abstr.iter(iterable);\r\n            // in theory you could subclass\r\n            if (this === Sk.builtin.filter_.prototype) {\r\n                return new Sk.builtin.filter_(func, iterable);\r\n        } else {\r\n                const instance = new this.constructor();\r\n                Sk.builtin.filter_.call(instance, func, iterable);\r\n                return instance;\r\n            }\r\n        },\r\n    },\r\n    proto: {\r\n        check$filter(item) {\r\n            let res;\r\n            if (this.$func === null) {\r\n                res = item;\r\n            } else {\r\n                res = Sk.misceval.callsimOrSuspendArray(this.$func, [item]);\r\n        }\r\n            return Sk.misceval.chain(res, (ret) => (Sk.misceval.isTrue(ret) ? item : undefined));\r\n        },\r\n    },\r\n});\r\n\r\nSk.exportSymbol(\"Sk.builtin.filter_\", Sk.builtin.filter_);","/** @typedef {Sk.builtin.object} */ var pyObject;\r\n\r\nconst hashMap = Object.create(null, {\r\n    Infinity: { value: 314159 },\r\n    \"-Infinity\": { value: -314159 },\r\n    NaN: { value: 0 },\r\n});\r\n\r\n/**\r\n * @constructor\r\n * @extends {Sk.builtin.object}\r\n *\r\n * @param {number} x only be called with a JS number\r\n *\r\n * @return {Sk.builtin.float_} Python float\r\n */\r\nSk.builtin.float_ = Sk.abstr.buildNativeClass(\"float\", {\r\n    constructor: function float_(x) {\r\n        Sk.asserts.assert(this instanceof Sk.builtin.float_, \"bad call to float use 'new'\");\r\n        if (typeof x === \"number\") {\r\n            this.v = x;\r\n        } else if (x === undefined) {\r\n            this.v = 0.0;\r\n        } else if (typeof x === \"string\") {\r\n            // be careful with converting a string as it could result in infinity\r\n            this.v = parseFloat(x);\r\n        } else if (x.nb$float) {\r\n            return x.nb$float(); // allow this as a slow path\r\n        } else {\r\n            Sk.asserts.fail(\"bad argument to float constructor\");\r\n        }\r\n    },\r\n    slots: /**@lends {Sk.builtin.float_.prototype} */{\r\n        tp$getattr: Sk.generic.getAttr,\r\n        tp$as_number: true,\r\n        tp$doc: \"Convert a string or number to a floating point number, if possible.\",\r\n        tp$hash() {\r\n            const v = this.v;\r\n            let hash = hashMap[v];\r\n            if (hash !== undefined) {\r\n                return hash;\r\n            } else if (Number.isInteger(v)) {\r\n                hash = this.nb$int().tp$hash();\r\n            } else {\r\n                hash = Math.floor(Math.random() * Number.MAX_SAFE_INTEGER - Number.MAX_SAFE_INTEGER / 2);\r\n            }\r\n            hashMap[this.v] = hash;\r\n            return hash;\r\n        },\r\n        $r() {\r\n            return new Sk.builtin.str(this.str$(10, true));\r\n        },\r\n        tp$new(args, kwargs) {\r\n            if (kwargs && kwargs.length) {\r\n                throw new Sk.builtin.TypeError(\"float() takes no keyword arguments\");\r\n            } else if (args && args.length > 1) {\r\n                throw new Sk.builtin.TypeError(\"float expected at most 1 arguments, got \" + args.length);\r\n            }\r\n            const arg = args[0];\r\n            let x;\r\n            // is args always an empty list?\r\n            if (arg === undefined) {\r\n                x = new Sk.builtin.float_(0.0);\r\n            } else if (arg.nb$float) {\r\n                x = arg.nb$float();\r\n            } else if (Sk.builtin.checkString(arg)) {\r\n                x = _str_to_float(arg.v);\r\n            }\r\n            if (x === undefined) {\r\n                throw new Sk.builtin.TypeError(\"float() argument must be a string or a number\");\r\n            }\r\n            if (this === Sk.builtin.float_.prototype) {\r\n                return x;\r\n            } else {\r\n                const instance = new this.constructor();\r\n                instance.v = x.v;\r\n                return instance;\r\n            }\r\n        },\r\n\r\n        // number slots\r\n        nb$int() {\r\n            let v = this.v;\r\n            if (!Number.isFinite(v)) {\r\n                if (v === Infinity || v === -Infinity) {\r\n                    throw new Sk.builtin.OverflowError(\"cannot convert float infinity to integer\");\r\n                }\r\n                throw new Sk.builtin.ValueError(\"cannot convert float NaN to integer\");\r\n            }\r\n            if (v < 0) {\r\n                v = Math.ceil(v);\r\n            } else {\r\n                v = Math.floor(v);\r\n            }\r\n            if (Sk.builtin.int_.withinThreshold(v)) {\r\n                return new Sk.builtin.int_(v);\r\n            } else {\r\n                return new Sk.builtin.int_(JSBI.BigInt(v));\r\n            }\r\n        },\r\n        nb$float: cloneSelf,\r\n        nb$long() {\r\n            return new Sk.builtin.lng(this.nb$int().v);\r\n        },\r\n        nb$add: numberSlot((v, w) => new Sk.builtin.float_(v + w)),\r\n\r\n        nb$subtract: numberSlot((v, w) => new Sk.builtin.float_(v - w)),\r\n        nb$reflected_subtract: numberSlot((v, w) => new Sk.builtin.float_(w - v)),\r\n\r\n        nb$multiply: numberSlot((v, w) => new Sk.builtin.float_(v * w)),\r\n\r\n        nb$divide: numberSlot(divide),\r\n        nb$reflected_divide: numberSlot((v, w) => divide(w, v)),\r\n\r\n        nb$floor_divide: numberSlot(floordivide),\r\n        nb$reflected_floor_divide: numberSlot((v, w) => floordivide(w, v)),\r\n\r\n        nb$remainder: numberSlot(remainder),\r\n        nb$reflected_remainder: numberSlot((v, w) => remainder(w, v)),\r\n\r\n        nb$divmod: numberSlot((v, w) => new Sk.builtin.tuple([floordivide(v, w), remainder(v, w)])),\r\n        nb$reflected_divmod: numberSlot((v, w) => new Sk.builtin.tuple([floordivide(w, v), remainder(w, v)])),\r\n\r\n        nb$power: ternarySlot(power),\r\n        nb$reflected_power: ternarySlot((v, w) => power(w, v)),\r\n\r\n        nb$abs() {\r\n            return new Sk.builtin.float_(Math.abs(this.v));\r\n        },\r\n        nb$negative() {\r\n            return new Sk.builtin.float_(-this.v);\r\n        },\r\n        nb$positive() {\r\n            return new Sk.builtin.float_(this.v);\r\n        },\r\n        nb$bool() {\r\n            return this.v !== 0;\r\n        },\r\n        nb$isnegative() {\r\n            return this.v < 0;\r\n        },\r\n        nb$ispositive() {\r\n            return this.v >= 0;\r\n        },\r\n        ob$eq: compareSlot((v, w) => v == w, JSBI.EQ),\r\n        ob$ne: compareSlot((v, w) => v != w, JSBI.NE),\r\n        ob$gt: compareSlot((v, w) => v > w, JSBI.GT),\r\n        ob$ge: compareSlot((v, w) => v >= w, JSBI.GE),\r\n        ob$lt: compareSlot((v, w) => v < w, JSBI.LT),\r\n        ob$le: compareSlot((v, w) => v <= w, JSBI.LE),\r\n    },\r\n    getsets:  /**@lends {Sk.builtin.float_.prototype} */{\r\n        real: {\r\n            $get: cloneSelf,\r\n            $doc: \"the real part of a complex number\",\r\n        },\r\n        imag: {\r\n            $get() {\r\n                return new Sk.builtin.float_(0.0);\r\n            },\r\n            $doc: \"the imaginary part of a complex number\",\r\n        },\r\n    },\r\n    methods:  /**@lends {Sk.builtin.float_.prototype} */{\r\n        conjugate: {\r\n            $meth: cloneSelf,\r\n            $flags: {NoArgs: true},\r\n            $textsig: \"($self, /)\",\r\n            $doc: \"Return self, the complex conjugate of any float.\",\r\n        },\r\n        __trunc__: {\r\n            $meth() {\r\n                return this.nb$int();\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: \"($self, /)\",\r\n            $doc: \"Return the Integral closest to x between 0 and x.\",\r\n        },\r\n        __round__: {\r\n            $meth(ndigits) {\r\n                return this.round$(ndigits);\r\n            },\r\n            $flags: {MinArgs: 0, MaxArgs: 1},\r\n            $textsig: \"($self, ndigits=None, /)\",\r\n            $doc: \"Return the Integral closest to x, rounding half toward even.\\n\\nWhen an argument is passed, work like built-in round(x, ndigits).\",\r\n        },\r\n        as_integer_ratio: {\r\n            $meth() {\r\n                if (!Number.isFinite(this.v)) {\r\n                    if (Number.isNaN(this.v)) {\r\n                        throw new Sk.builtin.ValueError(\"cannot convert NaN to integer ratio\");\r\n                    }\r\n                    throw new Sk.builtin.OverflowError(\"cannot convert Infinity to integer ratio\");\r\n                }\r\n                let [float_part, exponent] = frexp(this.v);\r\n                for (let i=0; i<300 && float_part != Math.floor(float_part) ; i++) {\r\n                    float_part *= 2.0;\r\n                    exponent--;\r\n                }\r\n                const py_exp = new Sk.builtin.int_(Math.abs(exponent));\r\n                let numerator = new Sk.builtin.int_(float_part);\r\n                let denominator = new Sk.builtin.int_(1);\r\n                if (exponent > 0) {\r\n                    numerator = numerator.nb$lshift(py_exp);\r\n                } else {\r\n                    denominator = denominator.nb$lshift(py_exp);\r\n                }\r\n                return new Sk.builtin.tuple([numerator, denominator]);\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: \"($self, /)\",\r\n            $doc:\r\n                \"Return integer ratio.\\n\\nReturn a pair of integers, whose ratio is exactly equal to the original float\\nand with a positive denominator.\\n\\nRaise OverflowError on infinities and a ValueError on NaNs.\\n\\n>>> (10.0).as_integer_ratio()\\n(10, 1)\\n>>> (0.0).as_integer_ratio()\\n(0, 1)\\n>>> (-.25).as_integer_ratio()\\n(-1, 4)\",\r\n        },\r\n        // hex: {\r\n        //     $meth: methods.hex,\r\n        //     $flags: { NoArgs: true },\r\n        //     $textsig: \"($self, /)\",\r\n        //     $doc:\r\n        //         \"Return a hexadecimal representation of a floating-point number.\\n\\n>>> (-0.1).hex()\\n'-0x1.999999999999ap-4'\\n>>> 3.14159.hex()\\n'0x1.921f9f01b866ep+1'\",\r\n        // },\r\n        is_integer: {\r\n            $meth() {\r\n                return new Sk.builtin.bool(Number.isInteger(this.v));\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: \"($self, /)\",\r\n            $doc: \"Return True if the float is an integer.\",\r\n        },\r\n        __getnewargs__: {\r\n            $meth() {\r\n                return new Sk.builtin.tuple([this]);\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: \"($self, /)\",\r\n            $doc: Sk.builtin.none.none$,\r\n        },\r\n        __format__: {\r\n            $meth: Sk.formatting.mkNumber__format__(true),\r\n            $flags: {OneArg: true},\r\n            $textsig: \"($self, format_spec, /)\",\r\n            $doc: Sk.builtin.none.none$,\r\n        },\r\n    },\r\n});\r\n\r\nfunction frexp(arg) {\r\n    const res = [arg, 0];\r\n    if (arg === 0.0) {\r\n        return res;\r\n    }\r\n    const absArg = Math.abs(arg);\r\n    let exp = Math.max(-1023, Math.floor(Math.log2(absArg)) + 1);\r\n    let m = absArg * Math.pow(2, -exp);\r\n    // These while loops compensate for rounding errors that sometimes occur because of ECMAScript's Math.log2's undefined precision\r\n    // and also works around the issue of Math.pow(2, -exp) === Infinity when exp <= -1024\r\n    while (m < 0.5) {\r\n        m *= 2;\r\n        exp--;\r\n    }\r\n    while (m >= 1) {\r\n        m *= 0.5;\r\n        exp++;\r\n    }\r\n    if (arg < 0) {\r\n        m = -m;\r\n    }\r\n    res[0] = m;\r\n    res[1] = exp;\r\n    return res;\r\n}\r\nconst invalidUnderscores = /_[eE]|[eE]_|\\._|_\\.|[+-]_|__/;\r\nconst validUnderscores = /_(?=[^_])/g;\r\nfunction _str_to_float(str) {\r\n    let ret;\r\n    let tmp = str;\r\n    if (str.indexOf(\"_\") !== -1) {\r\n        if (invalidUnderscores.test(str)) {\r\n            throw new Sk.builtin.ValueError(\"could not convert string to float: '\" + str + \"'\");\r\n        }\r\n        tmp = str.charAt(0) + str.substring(1).replace(validUnderscores, \"\");\r\n    }\r\n\r\n    if (str.match(/^-inf$/i)) {\r\n        ret = -Infinity;\r\n    } else if (str.match(/^[+]?inf$/i)) {\r\n        ret = Infinity;\r\n    } else if (str.match(/^[-+]?nan$/i)) {\r\n        ret = NaN;\r\n    } else if (!isNaN(tmp)) {\r\n        ret = parseFloat(tmp);\r\n        if (Number.isNaN(ret)) {\r\n            ret = undefined;\r\n        }\r\n    }\r\n    if (ret === undefined) {\r\n        throw new Sk.builtin.ValueError(\"could not convert string to float: \" + Sk.misceval.objectRepr(new Sk.builtin.str(str)));\r\n    }\r\n    return new Sk.builtin.float_(ret);\r\n}\r\n\r\nfunction cloneSelf() {\r\n    return new Sk.builtin.float_(this.v);\r\n}\r\n\r\n/**\r\n * Checks for float subtypes, though skulpt does not allow to\r\n * extend them for now.\r\n *\r\n * Javascript function, returns Javascript object.\r\n * @param {Object} op The object to check as subtype.\r\n * @return {boolean} true if op is a subtype of Sk.builtin.float_, false otherwise\r\n */\r\nSk.builtin.float_.PyFloat_Check = function (op) {\r\n    if (op === undefined) {\r\n        return false;\r\n    }\r\n    // this is a little bit hacky\r\n    // ToDo: subclassable builtins do not require this\r\n    if (Sk.builtin.checkNumber(op)) {\r\n        return true;\r\n    }\r\n    if (Sk.builtin.checkFloat(op)) {\r\n        return true;\r\n    }\r\n    if (op.ob$type.$isSubType(Sk.builtin.float_)) {\r\n        return true;\r\n    }\r\n    return false;\r\n};\r\n\r\n\r\n/**\r\n * Returns this instance's value as a string formatted using fixed-point notation.\r\n *\r\n * Javascript function, returns Javascript object.\r\n *\r\n * @param  {Object|number} x The numer of digits to appear after the decimal point.\r\n * @return {string}   The string representation of this instance's value.\r\n */\r\nSk.builtin.float_.prototype.toFixed = function (x) {\r\n    x = Sk.builtin.asnum$(x);\r\n    return this.v.toFixed(x);\r\n};\r\n\r\nfunction numberSlot(f) {\r\n    return function (other) {\r\n        const v = this.v;\r\n        let w = other.v;\r\n        if (typeof w === \"number\") {\r\n            // pass\r\n        } else if (JSBI.__isBigInt(w)) {\r\n            w = fromBigIntToNumberOrOverflow(w);\r\n        } else {\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        }\r\n        return f(v, w);\r\n    };\r\n}\r\n\r\nfunction compareSlot(doCompare, JSBI_ALT) {\r\n    return function (other) {\r\n        const v = this.v;\r\n        const w = other.v;\r\n        if (typeof w === \"number\") {\r\n            // pass\r\n        } else if (!JSBI.__isBigInt(w)) {\r\n            // not a number or a bigint\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        } else if (JSBI_ALT !== undefined) {\r\n            // if we're here we have JSBI.BigInt rather than a window.BigInt\r\n            // use the JSBI.EQ, JSBI.NE functions which are faster for comparisons\r\n            // use ==, >= etc will compare the strings which is not what we want\r\n            // if we have a window.BigInt just use ==, >= etc i.e. fall through to doCompare\r\n            return JSBI_ALT(v, w);\r\n        }\r\n        return doCompare(v, w);\r\n    };\r\n}\r\n\r\nfunction ternarySlot(f) {\r\n    const binSlot = numberSlot(f);\r\n    return function (other, z) {\r\n        if (z !== undefined && !Sk.builtin.checkNone(z)) {\r\n            throw new Sk.builtin.TypeError(\"pow() 3rd argument not allowed unless all arguments are integers\");\r\n        }\r\n        return binSlot.call(this, other);\r\n    };\r\n}\r\n\r\nfunction divide(v, w) {\r\n    if (w === 0) {\r\n        throw new Sk.builtin.ZeroDivisionError(\"integer division or modulo by zero\");\r\n    }\r\n    if (v === Infinity) {\r\n        if (w === Infinity || v === -Infinity) {\r\n            return new Sk.builtin.float_(NaN);\r\n        } else if (w < 0) {\r\n            return new Sk.builtin.float_(-Infinity);\r\n        } else {\r\n            return new Sk.builtin.float_(Infinity);\r\n        }\r\n    }\r\n    if (v === -Infinity) {\r\n        if (w === Infinity || v === -Infinity) {\r\n            return new Sk.builtin.float_(NaN);\r\n        } else if (w < 0) {\r\n            return new Sk.builtin.float_(Infinity);\r\n        } else {\r\n            return new Sk.builtin.float_(-Infinity);\r\n        }\r\n    }\r\n    return new Sk.builtin.float_(v / w);\r\n}\r\n\r\nfunction floordivide(v, w) {\r\n    if (v === Infinity || v === -Infinity) {\r\n        return new Sk.builtin.float_(NaN);\r\n    }\r\n    if (w === 0) {\r\n        throw new Sk.builtin.ZeroDivisionError(\"integer division or modulo by zero\");\r\n    }\r\n\r\n    if (w === Infinity) {\r\n        if (v < 0) {\r\n            return new Sk.builtin.float_(-1);\r\n        } else {\r\n            return new Sk.builtin.float_(0);\r\n        }\r\n    }\r\n    if (w === -Infinity) {\r\n        if (v < 0 || v !== 0) {\r\n            return new Sk.builtin.float_(0);\r\n        } else {\r\n            return new Sk.builtin.float_(-1);\r\n        }\r\n    }\r\n    return new Sk.builtin.float_(Math.floor(v / w));\r\n}\r\n\r\nfunction remainder(v, w) {\r\n    if (w === 0) {\r\n        throw new Sk.builtin.ZeroDivisionError(\"integer division or modulo by zero\");\r\n    }\r\n    if (v === 0) {\r\n        return new Sk.builtin.float_(0);\r\n    }\r\n    if (w === Infinity) {\r\n        if (v === Infinity || this.v === -Infinity) {\r\n            return new Sk.builtin.float_(NaN);\r\n        } else if (v > 0) {\r\n            return new Sk.builtin.float_(v);\r\n        } else {\r\n            return new Sk.builtin.float_(Infinity);\r\n        }\r\n    }\r\n\r\n    //  Javacript logic on negatives doesn't work for Python... do this instead\r\n    let tmp = v % w;\r\n\r\n    if (v < 0) {\r\n        if (w > 0 && tmp < 0) {\r\n            tmp = tmp + w;\r\n        }\r\n    } else {\r\n        if (w < 0 && tmp !== 0) {\r\n            tmp = tmp + w;\r\n        }\r\n    }\r\n    if (tmp === 0) {\r\n        if (w < 0) {\r\n            tmp = -0.0; // otherwise the sign gets lost by javascript modulo\r\n        } else if (Infinity / tmp === -Infinity) {\r\n            tmp = 0.0;\r\n        }\r\n    }\r\n    return new Sk.builtin.float_(tmp);\r\n}\r\n\r\nfunction power(v, w) {\r\n    if (v < 0 && w % 1 !== 0) {\r\n        throw new Sk.builtin.ValueError(\"negative number cannot be raised to a fractional power\");\r\n    }\r\n    if (v === 0 && w < 0) {\r\n        throw new Sk.builtin.ZeroDivisionError(\"0.0 cannot be raised to a negative power\");\r\n    }\r\n\r\n    const result = Math.pow(v, w);\r\n\r\n    if (Math.abs(result) === Infinity && Math.abs(v) !== Infinity && Math.abs(w) !== Infinity) {\r\n        throw new Sk.builtin.OverflowError(\"Numerical result out of range\");\r\n    }\r\n    return new Sk.builtin.float_(result);\r\n}\r\n\r\n/**\r\n * Round this instance to a given number of digits, or zero if omitted.\r\n *\r\n * Implements `__round__` dunder method.\r\n *\r\n * Javascript function, returns Python object.\r\n *\r\n * @param  {pyObject=} ndigits The number of digits after the decimal point to which to round.\r\n * @return {Sk.builtin.float_|Sk.builtin.int_} The rounded float.\r\n * \r\n */\r\nSk.builtin.float_.prototype.round$ = function (ndigits) {\r\n    var result, multiplier, number, num10, rounded, bankRound, ndigs;\r\n    number = Sk.builtin.asnum$(this);\r\n    if (ndigits === undefined) {\r\n        ndigs = 0;\r\n    } else {\r\n        ndigs = Sk.misceval.asIndexSized(ndigits);\r\n    }\r\n\r\n    if (Sk.__future__.bankers_rounding) {\r\n        num10 = number * Math.pow(10, ndigs);\r\n        rounded = Math.round(num10);\r\n        bankRound = (num10 > 0 ? num10 : -num10) % 1 === 0.5 ? (0 === rounded % 2 ? rounded : rounded - 1) : rounded;\r\n        result = bankRound / Math.pow(10, ndigs);\r\n        if (ndigits === undefined) {\r\n            return new Sk.builtin.int_(result);\r\n        } else {\r\n            return new Sk.builtin.float_(result);\r\n        }\r\n    } else {\r\n        multiplier = Math.pow(10, ndigs);\r\n        result = Math.round(number * multiplier) / multiplier;\r\n\r\n        return new Sk.builtin.float_(result);\r\n    }\r\n};\r\n\r\n/**\r\n * Convert this instance's value to a Javascript string.\r\n *\r\n * Javascript function, returns Javascript object.\r\n *\r\n * @param {number} base The base of the value.\r\n * @param {boolean} sign true if the value should be signed, false otherwise.\r\n * @return {string} The Javascript string representation of this instance.\r\n */\r\nSk.builtin.float_.prototype.str$ = function (base, sign) {\r\n    var post;\r\n    var pre;\r\n    var idx;\r\n    var tmp;\r\n    var work;\r\n\r\n    if (isNaN(this.v)) {\r\n        return \"nan\";\r\n    }\r\n\r\n    if (sign === undefined) {\r\n        sign = true;\r\n    }\r\n\r\n    if (this.v == Infinity) {\r\n        return \"inf\";\r\n    }\r\n    if (this.v == -Infinity && sign) {\r\n        return \"-inf\";\r\n    }\r\n    if (this.v == -Infinity && !sign) {\r\n        return \"inf\";\r\n    }\r\n\r\n    work = sign ? this.v : Math.abs(this.v);\r\n\r\n    if (base === undefined || base === 10) {\r\n        if (Sk.__future__.python3) {\r\n            tmp = work.toPrecision(16);\r\n        } else {\r\n            tmp = work.toPrecision(12);\r\n        }\r\n\r\n        // transform fractions with 4 or more leading zeroes into exponents\r\n        idx = tmp.indexOf(\".\");\r\n        pre = work.toString().slice(0, idx);\r\n        post = work.toString().slice(idx);\r\n\r\n        if (pre.match(/^-?0$/) && post.slice(1).match(/^0{4,}/)) {\r\n            if (tmp.length < 12) {\r\n                tmp = work.toExponential();\r\n            } else {\r\n                tmp = work.toExponential(11);\r\n            }\r\n        }\r\n\r\n        if (tmp.indexOf(\"e\") < 0 && tmp.indexOf(\".\") >= 0) {\r\n            while (tmp.charAt(tmp.length - 1) == \"0\") {\r\n                tmp = tmp.substring(0, tmp.length - 1);\r\n            }\r\n            if (tmp.charAt(tmp.length - 1) == \".\") {\r\n                tmp = tmp + \"0\";\r\n            }\r\n        }\r\n\r\n        tmp = tmp.replace(new RegExp(\"\\\\.0+e\"), \"e\", \"i\");\r\n        // make exponent two digits instead of one (ie e+09 not e+9)\r\n        tmp = tmp.replace(/(e[-+])([1-9])$/, \"$10$2\");\r\n        // remove trailing zeroes before the exponent\r\n        tmp = tmp.replace(/0+(e.*)/, \"$1\");\r\n    } else {\r\n        tmp = work.toString(base);\r\n    }\r\n\r\n    // restore negative zero sign\r\n    if (this.v === 0 && 1 / this.v === -Infinity) {\r\n        tmp = \"-\" + tmp;\r\n    }\r\n\r\n    if (tmp.indexOf(\".\") < 0 && tmp.indexOf(\"E\") < 0 && tmp.indexOf(\"e\") < 0) {\r\n        tmp = tmp + \".0\";\r\n    }\r\n\r\n    return tmp;\r\n};\r\n\r\n\r\nSk.builtin.float_.py2$methods = {};\r\n\r\nfunction fromBigIntToNumberOrOverflow(big) {\r\n    const x = parseFloat(JSBI.toNumber(big));\r\n    if (x == Infinity || x == -Infinity) {\r\n        //trying to convert a large js string to a float\r\n        throw new Sk.builtin.OverflowError(\"int too large to convert to float\");\r\n    }\r\n    return x;\r\n}\r\n","// Implement the default \"format specification mini-language\"\r\n// for numbers and strings\r\n// https://docs.python.org/3.7/library/string.html#formatspec\r\n\r\nconst FORMAT_SPEC_REGEX = /^(?:(.)?([<\\>\\=\\^]))?([\\+\\-\\s])?(#)?(0)?(\\d+)?(,|_)?(?:\\.(\\d+))?([bcdeEfFgGnosxX%])?$/;\r\nconst FMT = {\r\n    FILL_CHAR: 1,\r\n    FILL_ALIGN: 2,\r\n    SIGN: 3,\r\n    ALT_FORM: 4,\r\n    ZERO_PAD: 5,\r\n    FIELD_WIDTH: 6,\r\n    COMMA: 7,\r\n    PRECISION: 8,\r\n    CONVERSION_TYPE: 9\r\n};\r\n\r\nSk.formatting = {};\r\n\r\nlet handleWidth = function (m, r, prefix, isNumber) {\r\n    // print(prefix);\r\n    Sk.asserts.assert(typeof (r) === \"string\");\r\n\r\n    if (m[FMT.FIELD_WIDTH]) {\r\n        let fieldWidth = parseInt(m[FMT.FIELD_WIDTH], 10);\r\n        let fillChar = m[FMT.FILL_CHAR] || (m[FMT.ZERO_PAD] ? \"0\" : \" \");\r\n        let fillAlign = m[FMT.FILL_ALIGN] || (m[FMT.ZERO_PAD] ? \"=\" : isNumber ? \">\" : \"<\");\r\n        let nFill = fieldWidth - (r.length + (prefix ? prefix.length : 0));\r\n\r\n        if (nFill <= 0) {\r\n            return prefix + r;\r\n        }\r\n\r\n        let fill = fillChar.repeat(nFill);\r\n\r\n        switch (fillAlign) {\r\n            case \"=\":\r\n                if (m[FMT.CONVERSION_TYPE] === \"s\") {\r\n                    throw new Sk.builtin.ValueError(\"'=' alignment not allowed in string format specifier\");\r\n                }\r\n                return prefix + fill + r;\r\n            case \">\":\r\n                return fill + prefix + r;\r\n            case \"<\":\r\n                return prefix + r + fill;\r\n            case \"^\":\r\n                let idx = Math.floor(nFill / 2);\r\n                return fill.substring(0, idx) + prefix + r + fill.substring(idx);\r\n        }\r\n    }\r\n    return prefix + r;\r\n};\r\n\r\nlet signForNeg = function (m, neg) {\r\n    return neg ? \"-\" :\r\n        (m[FMT.SIGN] === \"+\") ? \"+\" :\r\n        (m[FMT.SIGN] === \" \") ? \" \" : \"\";\r\n};\r\n\r\nconst thousandSep = /\\B(?=(\\d{3})+(?!\\d))/g;\r\nconst otherBaseSep = /\\B(?=([A-Za-z0-9]{4})+(?![A-Za-z0-9]))/g;\r\n\r\nlet handleInteger = function (m, n, base) {\r\n    // TODO: Do we need to tolerate float inputs for integer conversions?\r\n    // Python doesn't, but I'm guessing this is something to do with JS's\r\n    // int/float ambiguity\r\n    Sk.asserts.assert(n instanceof Sk.builtin.int_ || n instanceof Sk.builtin.lng);\r\n\r\n    if (m[FMT.PRECISION]) {\r\n        throw new Sk.builtin.ValueError(\"Precision not allowed in integer format\");\r\n    }\r\n\r\n    let r = n.str$(base, false);\r\n    let neg = n.nb$isnegative();\r\n\r\n    let prefix = signForNeg(m, neg);\r\n\r\n    if (m[FMT.ALT_FORM]) {\r\n        if (base === 16) {\r\n            prefix += \"0x\";\r\n        } else if (base === 8) {\r\n            prefix += \"0o\";\r\n        } else if (base === 2) {\r\n            prefix += \"0b\";\r\n        }\r\n    }\r\n\r\n    const conversionType = m[FMT.CONVERSION_TYPE];\r\n    if (conversionType === \"X\") {\r\n        r = r.toUpperCase(); // floats convert nan to NAN\r\n    }\r\n\r\n    if (m[FMT.CONVERSION_TYPE] === \"n\") {\r\n        r = (+r).toLocaleString();\r\n    } else if (m[FMT.COMMA]) {\r\n        const parts = r.split(\".\");\r\n        const sep = m[FMT.COMMA];\r\n        if (sep === \",\" && base !== 10) {\r\n            throw new Sk.builtin.ValueError(`Cannot specify ',' with '${conversionType}'`);\r\n        }\r\n        parts[0] = parts[0].replace(base === 10 ? thousandSep : otherBaseSep , sep);\r\n        r = parts.join(\".\");\r\n    }\r\n\r\n    return handleWidth(m, r, prefix, true);\r\n};\r\n\r\n// Common implementation of __format__ for Python number objects\r\nlet formatNumber = function (num, formatSpec, isFractional) {\r\n    if (!formatSpec) { // empty or undefined\r\n        return num.str$(10, true);\r\n    }\r\n    let m = formatSpec.match(FORMAT_SPEC_REGEX);\r\n    if (!m) {\r\n        throw new Sk.builtin.ValueError(\"Invalid format specifier\");\r\n    }\r\n\r\n    let conversionType = m[FMT.CONVERSION_TYPE];\r\n    if (!conversionType) {\r\n        conversionType = (isFractional ? \"g\" : \"d\");\r\n    }\r\n\r\n    let validConversions = isFractional ? \"fFeEgG%\" : \"bcdoxXnfFeEgG%\";\r\n    if (validConversions.indexOf(conversionType) == -1) {\r\n        throw new Sk.builtin.ValueError(\"Unknown format code '\" + m[FMT.CONVERSION_TYPE] + \"' for object of type '\" + Sk.abstr.typeName(num) + \"'\");\r\n    }\r\n\r\n    switch (conversionType) {\r\n        case \"d\":\r\n        case \"n\":\r\n            return handleInteger(m, num, 10);\r\n        case \"x\":\r\n        case \"X\":\r\n            return handleInteger(m, num, 16);\r\n        case \"o\":\r\n            return handleInteger(m, num, 8);\r\n        case \"b\":\r\n            return handleInteger(m, num, 2);\r\n        case \"c\": {\r\n            if (m[FMT.SIGN]) {\r\n                throw new Sk.builtin.ValueError(\"Sign not allowed with integer format specifier 'c'\");\r\n            }\r\n            if (m[FMT.ALT_FORM]) {\r\n                throw new Sk.builtin.ValueError(\"Alternate form not allowed with integer format specifier 'c'\");\r\n            }\r\n            if (m[FMT.COMMA]) {\r\n                throw new Sk.builtin.ValueError(\"Cannot specify ',' with 'c'\");\r\n            }\r\n            if (m[FMT.PRECISION]) {\r\n                throw new Sk.builtin.ValueError(\"Cannot specify ',' with 'c'\");\r\n            }\r\n            return handleWidth(m, String.fromCodePoint(Sk.builtin.asnum$(num)), \"\", true);\r\n        };\r\n\r\n        case \"f\":\r\n        case \"F\":\r\n        case \"e\":\r\n        case \"E\":\r\n        case \"g\":\r\n        case \"G\": {\r\n            if (m[FMT.ALT_FORM]) {\r\n                throw new Sk.builtin.ValueError(\"Alternate form (#) not allowed in float format specifier\");\r\n            }\r\n            let convValue = Sk.builtin.asnum$(num);\r\n            if (typeof convValue === \"string\") {\r\n                convValue = Number(convValue);\r\n            }\r\n            if (convValue === Infinity) {\r\n                return handleWidth(m, \"inf\", \"\", true);\r\n            }\r\n            if (convValue === -Infinity) {\r\n                return handleWidth(m, \"inf\", \"-\", true);\r\n            }\r\n            if (isNaN(convValue)) {\r\n                return handleWidth(m, \"nan\", \"\", true);\r\n            }\r\n            let neg = false;\r\n            if (convValue < 0) {\r\n                convValue = -convValue;\r\n                neg = true;\r\n            }\r\n            let convName = [\"toExponential\", \"toFixed\", \"toPrecision\"][\"efg\".indexOf(conversionType.toLowerCase())];\r\n            let precision = m[FMT.PRECISION] ? parseInt(m[FMT.PRECISION], 10) : 6;\r\n            let result = (convValue)[convName](precision);\r\n            if (\"EFG\".indexOf(conversionType) !== -1) {\r\n                result = result.toUpperCase();\r\n            }\r\n            // Python's 'g' does not show trailing 0s\r\n            if (conversionType.toLowerCase() === \"g\" || !m[FMT.CONVERSION_TYPE]) {\r\n                let trailingZeros = result.match(/\\.(\\d*[1-9])?(0+)$/);\r\n                if (trailingZeros) {\r\n                    let [_, hasMoreDigits, zs] = trailingZeros;\r\n                    // Python's default conversion shows at least one trailing zero\r\n                    result = result.slice(0, hasMoreDigits ? -zs.length : -(zs.length + 1));\r\n                }\r\n                if (result.indexOf(\".\") == -1 && !m[FMT.CONVERSION_TYPE]) {\r\n                    result += \".0\";\r\n                }\r\n            }\r\n            if (conversionType.toLowerCase()===\"e\") {\r\n                result = result.replace(/^([-+]?[0-9]*\\.?[0-9]+[eE][-+]?)([0-9])?$/, \"$10$2\");\r\n            }\r\n            if (m[FMT.COMMA]) {\r\n                var parts = result.toString().split(\".\");\r\n                parts[0] = parts[0].replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\r\n                result = parts.join(\".\");\r\n            }\r\n\r\n            return handleWidth(m, result, signForNeg(m, neg), true);\r\n        };\r\n\r\n        case \"%\": {\r\n            if (m[FMT.ALT_FORM]) {\r\n                throw new Sk.builtin.ValueError(\"Alternate form (#) not allowed with format specifier '%'\");\r\n            }\r\n            let convValue = Sk.builtin.asnum$(num);\r\n            if (typeof convValue === \"string\") {\r\n                convValue = Number(convValue);\r\n            }\r\n            if (convValue === Infinity) {\r\n                return handleWidth(m, \"inf%\", \"\", true);\r\n            }\r\n            if (convValue === -Infinity) {\r\n                return handleWidth(m, \"inf%\", \"-\", true);\r\n            }\r\n            if (isNaN(convValue)) {\r\n                return handleWidth(m, \"nan%\", \"\", true);\r\n            }\r\n            let neg = false;\r\n            if (convValue < 0) {\r\n                convValue = -convValue;\r\n                neg = true;\r\n            }\r\n            let precision = m[FMT.PRECISION] ? parseInt(m[FMT.PRECISION], 10) : 6;\r\n            let result = (convValue * 100.0).toFixed(precision) + \"%\";\r\n            return handleWidth(m, result, signForNeg(m, neg), true);\r\n        };\r\n\r\n        default:\r\n            throw new Sk.builtin.ValueError(\"Unknown format code '\" + m[FMT.CONVERSION_TYPE] + \"'\");\r\n    }\r\n};\r\n\r\nSk.formatting.mkNumber__format__ = (isFractional) => function (format_spec) {\r\n    if (!Sk.builtin.checkString(format_spec)) {\r\n        throw new Sk.builtin.TypeError(\"format() argument 2 must be str, not \" + Sk.abstr.typeName(format_spec));\r\n    }\r\n    return new Sk.builtin.str(formatNumber(this, format_spec.$jsstr(), isFractional));\r\n};\r\n\r\nfunction formatString(format_spec) {\r\n    if (!Sk.builtin.checkString(format_spec)) {\r\n        throw new Sk.builtin.TypeError(\"format() argument 2 must be str, not \" + Sk.abstr.typeName(format_spec));\r\n    }\r\n\r\n    let m = format_spec.$jsstr().match(FORMAT_SPEC_REGEX);\r\n    if (m[FMT.CONVERSION_TYPE] && m[FMT.CONVERSION_TYPE] !== \"s\") {\r\n        throw new Sk.builtin.ValueError(\"Unknown format code '\" + m[FMT.CONVERSION_TYPE] + \"' for object of type 'str'\");\r\n    }\r\n\r\n    if (m[FMT.SIGN]) {\r\n        throw new Sk.builtin.ValueError(\"Sign not allowed in string format specifier\");\r\n    }\r\n\r\n    if (m[FMT.ALT_FORM]) {\r\n        throw new Sk.builtin.ValueError(\"Alternate form (#) not allowed with string format specifier\");\r\n    }\r\n\r\n    if (m[FMT.COMMA]) {\r\n        throw new Sk.builtin.ValueError(\"Cannot specify ',' with 's'\");\r\n    }\r\n\r\n    let value = this.v;\r\n\r\n    if (m[FMT.PRECISION]) {\r\n        value = value.substring(0, m[FMT.PRECISION]);\r\n    }\r\n\r\n    return new Sk.builtin.str(handleWidth(m, value, \"\", false));\r\n};\r\n\r\n// str.format() implementation\r\nfunction format(args, kwargs) {\r\n    // following PEP 3101\r\n    kwargs = kwargs || [];\r\n    const arg_dict = {};\r\n    const regex = /{(((?:\\d+)|(?:\\w+))?((?:\\.(\\w+))|(?:\\[((?:\\d+)|(?:\\w+))\\])?))?(?:\\!([rs]))?(?:\\:([^}]*))?}/g;\r\n    // ex: {o.name!r:*^+#030,.9b}\r\n    // Field 1, Field_name, o.name\r\n    // Field 2, arg_name, o\r\n    // Field 3, attribute_name/Element_index , .name\r\n    // Field 4, Attribute name, name\r\n    // Field 5, element_index, [0]\r\n    // Field 6, conversion, r\r\n    // Field 7, format_spec,*^+#030,.9b\r\n\r\n    // Detect empty/int/complex name\r\n    // retrive field value\r\n    // hand off format spec\r\n    // return resulting spec to function\r\n    for (let i = 0; i < kwargs.length; i += 2) {\r\n        arg_dict[kwargs[i]] = kwargs[i + 1];\r\n        }\r\n    for (let i in args) {\r\n        arg_dict[i] = args[i];\r\n    }\r\n\r\n    let index = 0;\r\n    function replFunc (substring, field_name, arg_name, attr_name, attribute_name, element_index, conversion, format_spec, offset, str_whole) {\r\n        let value;\r\n\r\n        if (element_index !== undefined && element_index !== \"\") {\r\n            let container = arg_dict[arg_name];\r\n            if (container.constructor === Array) {\r\n                value = container[element_index];\r\n            } else if (/^\\d+$/.test(element_index)) {\r\n                value = Sk.abstr.objectGetItem(container, new Sk.builtin.int_(parseInt(element_index, 10)), false);\r\n            } else {\r\n                value = Sk.abstr.objectGetItem(container, new Sk.builtin.str(element_index), false);\r\n            }\r\n            index++;\r\n        } else if (attribute_name !== undefined && attribute_name !== \"\") {\r\n            value = Sk.abstr.gattr(arg_dict[arg_name || index++], new Sk.builtin.str(attribute_name));\r\n        } else if (arg_name !== undefined && arg_name !== \"\") {\r\n            value = arg_dict[arg_name];\r\n        } else if (field_name === undefined || field_name === \"\") {\r\n            value = arg_dict[index];\r\n            index++;\r\n        } else if (\r\n            field_name instanceof Sk.builtin.int_ ||\r\n            field_name instanceof Sk.builtin.float_ ||\r\n            field_name instanceof Sk.builtin.lng ||\r\n            /^\\d+$/.test(field_name)\r\n        ) {\r\n            value = arg_dict[field_name];\r\n            index++;\r\n        }\r\n\r\n        if (conversion === \"s\") {\r\n            value = new Sk.builtin.str(value);\r\n        } else if (conversion === \"r\") {\r\n            value = Sk.builtin.repr(value);\r\n        } else if (conversion !== \"\" && conversion !== undefined) {\r\n            throw new Sk.builtin.ValueError(\"Unknown conversion specifier \" + conversion);\r\n        }\r\n        // TODO \"!a\" I guess?\r\n\r\n        return Sk.abstr.objectFormat(value, new Sk.builtin.str(format_spec)).$jsstr();\r\n    };\r\n\r\n    const ret = this.v.replace(regex, replFunc);\r\n    return new Sk.builtin.str(ret);\r\n};\r\n\r\nSk.formatting.format = format;\r\nSk.formatting.formatString = formatString;","/**\r\n * @constructor\r\n * Sk.builtin.func\r\n *\r\n * @description\r\n * This function converts a Javascript function into a Python object that is callable.  Or just\r\n * think of it as a Python function rather than a Javascript function now.  This is an important\r\n * distinction in skulpt because once you have Python function you cannot just call it.\r\n * You must now use Sk.misceval.callsim to call the Python function.\r\n *\r\n * @param {Function} code the javascript implementation of this function\r\n * @param {Object=} globals the globals where this function was defined.\r\n * Can be undefined (which will be stored as null) for builtins. (is\r\n * that ok?)\r\n * @param {Object=} closure dict of free variables\r\n * @param {Object=} closure2 another dict of free variables that will be\r\n * merged into 'closure'. there's 2 to simplify generated code (one is $free,\r\n * the other is $cell)\r\n *\r\n * closure is the cell variables from the parent scope that we need to close\r\n * over. closure2 is the free variables in the parent scope that we also might\r\n * need to access.\r\n *\r\n * NOTE: co_varnames and co_name are defined by compiled code only, so we have\r\n * to access them via dict-style lookup for closure.\r\n *\r\n */\r\nSk.builtin.func = Sk.abstr.buildNativeClass(\"function\", {\r\n    constructor: function func(code, globals, closure, closure2) {\r\n        Sk.asserts.assert(this instanceof Sk.builtin.func, \"builtin func should be called as a class with `new`\");\r\n\r\n        this.func_code = code;\r\n        this.func_globals = globals || null;\r\n\r\n        this.$name = (code.co_name && code.co_name.v) || code.name || \"<native JS>\";\r\n        this.$d = Sk.builtin.dict ? new Sk.builtin.dict() : undefined;\r\n        this.$doc = code.co_docstring || Sk.builtin.none.none$;\r\n        this.$module = (Sk.globals && Sk.globals[\"__name__\"]) || Sk.builtin.none.none$;\r\n        this.$qualname = (code.co_qualname && code.co_qualname.v) || this.$name;\r\n\r\n        if (closure2 !== undefined) {\r\n            // todo; confirm that modification here can't cause problems\r\n            for (let k in closure2) {\r\n                closure[k] = closure2[k];\r\n            }\r\n        }\r\n        this.func_closure = closure;\r\n        this.func_annotations = null;\r\n        this.$memoiseFlags();\r\n        this.memoised = code.co_fastcall || null;\r\n        if (code.co_fastcall) {\r\n            this.tp$call = code.bind(this);\r\n        } else {\r\n            this.tp$call = Sk.builtin.func.prototype.tp$call.bind(this); // keep func the same shape\r\n        }\r\n\r\n    },\r\n    slots: {\r\n        tp$getattr: Sk.generic.getAttr,\r\n        tp$descr_get(obj, objtype) {\r\n            if (obj === null) {\r\n                return this;\r\n            }\r\n            return new Sk.builtin.method(this, obj);\r\n        },\r\n        $r() {\r\n            return new Sk.builtin.str(\"<function \" + this.$qualname + \">\");\r\n        },\r\n        tp$call(posargs, kw) {\r\n            // Property reads from func_code are slooow, but\r\n            // the existing external API allows setup first, so as a\r\n            // hack we delay this initialisation.\r\n            // TODO change the external API to require all the co_vars\r\n            // to be supplied at construction time!\r\n            if (!this.memoised) {\r\n                this.$memoiseFlags();\r\n                this.memoised = true;\r\n            }\r\n\r\n            // Fast path for JS-native functions (which should be implemented\r\n            // in a separate tp$call, really)\r\n            if (this.co_argcount === undefined && this.co_varnames === undefined && !this.co_kwargs && !this.func_closure) {\r\n                // It's a JS function with no type info, don't hang around\r\n                // resolving anything.\r\n                if (kw && kw.length !== 0) {\r\n                    throw new Sk.builtin.TypeError(this.$name + \"() takes no keyword arguments\");\r\n                }\r\n                return this.func_code.apply(this.func_globals, posargs);\r\n            }\r\n            // end js fast path\r\n\r\n            let args = this.$resolveArgs(posargs, kw);\r\n            if (this.func_closure) {\r\n                args.push(this.func_closure);\r\n            }\r\n            // note: functions expect 'this' to be globals to avoid having to\r\n            // slice/unshift onto the main args\r\n            return this.func_code.apply(this.func_globals, args);\r\n        },\r\n    },\r\n    getsets: {\r\n        __name__: {\r\n            $get() {\r\n                return new Sk.builtin.str(this.$name);\r\n            },\r\n            $set(value) {\r\n                if (!Sk.builtin.checkString(value)) {\r\n                    throw new Sk.builtin.TypeError(\"__name__ must be set to a string object\");\r\n                }\r\n                this.$name = value.$jsstr();\r\n            },\r\n        },\r\n        __qualname__: {\r\n            $get() {\r\n                return new Sk.builtin.str(this.$qualname);\r\n            },\r\n            $set(value) {\r\n                if (!Sk.builtin.checkString(value)) {\r\n                    throw new Sk.builtin.TypeError(\"__qualname__ must be set to a string object\");\r\n                }\r\n                this.$qualname = value.$jsstr();\r\n            },\r\n        },\r\n        __dict__: Sk.generic.getSetDict,\r\n        __annotations__: {\r\n            $get() {\r\n                if (this.func_annotations === null) {\r\n                    this.func_annotations = new Sk.builtin.dict([]);\r\n                } else if (Array.isArray(this.func_annotations)) {\r\n                    this.func_annotations = Sk.abstr.keywordArrayToPyDict(this.func_annotations);\r\n                }\r\n                return this.func_annotations;\r\n            },\r\n            $set(v) {\r\n                if (v === undefined || Sk.builtin.checkNone(v)) {\r\n                    this.func_annotations = new Sk.builtin.dict([]);\r\n                } else if (v instanceof Sk.builtin.dict) {\r\n                    this.func_annotations = v;\r\n                } else {\r\n                    throw new Sk.builtin.TypeError(\"__annotations__ must be set to a dict object\");\r\n                }\r\n            }\r\n        },\r\n        __defaults__: {\r\n            $get() {\r\n                return new Sk.builtin.tuple(this.$defaults);\r\n            }, // technically this is a writable property but we'll leave it as read-only for now\r\n        },\r\n        __doc__: {\r\n            $get() {\r\n                return this.$doc;\r\n            },\r\n            $set(v) {\r\n                // The value the user is setting __doc__ to can be any Python\r\n                // object.  If we receive 'undefined' then the user is deleting\r\n                // __doc__, which is allowed and results in __doc__ being None.\r\n                this.$doc = v || Sk.builtin.none.none$;\r\n            },\r\n        },\r\n        __module__: {\r\n            $get() {\r\n                return this.$module;\r\n        },\r\n            $set(v) {\r\n                this.$module = v || Sk.builtin.none.none$;\r\n            }\r\n        }\r\n    },\r\n    proto: {\r\n        $memoiseFlags() {\r\n            this.co_varnames = this.func_code.co_varnames;\r\n            this.co_argcount = this.func_code.co_argcount;\r\n            if (this.co_argcount === undefined && this.co_varnames) {\r\n                this.co_argcount = this.co_argcount = this.co_varnames.length;\r\n            }\r\n            this.co_kwonlyargcount = this.func_code.co_kwonlyargcount || 0;\r\n            this.co_varargs = this.func_code.co_varargs;\r\n            this.co_kwargs = this.func_code.co_kwargs;\r\n            this.$defaults = this.func_code.$defaults || [];\r\n            this.$kwdefs = this.func_code.$kwdefs || [];\r\n        },\r\n        $resolveArgs,\r\n\r\n    }\r\n});\r\n\r\n\r\nfunction $resolveArgs(posargs, kw) {\r\n    // The rest of this function is a logical Javascript port of\r\n    // _PyEval_EvalCodeWithName, and follows its logic,\r\n    // plus fast-paths imported from _PyFunction_FastCall* as marked\r\n\r\n    let co_argcount = this.co_argcount;\r\n\r\n    if (co_argcount === undefined) {\r\n        co_argcount = this.co_varnames ? this.co_varnames.length : posargs.length;\r\n    }\r\n    let varnames = this.co_varnames || [];\r\n    let co_kwonlyargcount = this.co_kwonlyargcount || 0;\r\n    let totalArgs = co_argcount + co_kwonlyargcount;\r\n\r\n    // Fast path from _PyFunction_FastCallDict\r\n    if (co_kwonlyargcount === 0 && !this.co_kwargs && (!kw || kw.length === 0) && !this.co_varargs) {\r\n        if (posargs.length == co_argcount) {\r\n            return posargs;\r\n        } else if (posargs.length === 0 && this.$defaults &&\r\n            this.$defaults.length === co_argcount) {\r\n            for (let i = 0; i != this.$defaults.length; i++) {\r\n                posargs[i] = this.$defaults[i];\r\n            }\r\n            return posargs;\r\n        }\r\n    }\r\n    // end fast path from _PyFunction_FastCallDict\r\n\r\n\r\n\r\n    let kwargs;\r\n\r\n    /* Create a NOT-a-dictionary for keyword parameters (**kwargs) */\r\n    if (this.co_kwargs) {\r\n        kwargs = [];\r\n    }\r\n\r\n    /* Copy positional arguments into arguments to our JS function*/\r\n    let nposargs = posargs.length;\r\n    let args = (posargs.length <= co_argcount) ? posargs : posargs.slice(0, co_argcount);\r\n\r\n\r\n    /* Pack other positional arguments into the *args argument */\r\n    if (this.co_varargs) {\r\n        let vararg = (posargs.length > args.length) ? posargs.slice(args.length) : [];\r\n        args[totalArgs] = new Sk.builtin.tuple(vararg);\r\n    } else if (nposargs > co_argcount) {\r\n        throw new Sk.builtin.TypeError(this.$name + \"() takes \" + co_argcount + \" positional argument\" + (co_argcount == 1 ? \"\" : \"s\") + \" but \" + nposargs + (nposargs == 1 ? \" was \" : \" were \") + \" given\");\r\n    }\r\n\r\n    /* Handle keyword arguments */\r\n    if (kw) {\r\n        if (this.func_code[\"no_kw\"]) {\r\n            throw new Sk.builtin.TypeError(this.$name + \"() takes no keyword arguments\");\r\n        }\r\n\r\n        for (let i = 0; i < kw.length; i += 2) {\r\n            let name = kw[i]; // JS string\r\n            let value = kw[i + 1]; // Python value\r\n            let idx = varnames.indexOf(name);\r\n\r\n            if (idx >= 0) {\r\n                if (args[idx] !== undefined) {\r\n                    throw new Sk.builtin.TypeError(this.$name + \"() got multiple values for argument '\" + name + \"'\");\r\n                }\r\n                args[idx] = value;\r\n            } else if (kwargs) {\r\n                kwargs.push(new Sk.builtin.str(name), value);\r\n            } else {\r\n                throw new Sk.builtin.TypeError(this.$name + \"() got an unexpected keyword argument '\" + name + \"'\");\r\n            }\r\n        }\r\n    }\r\n\r\n    /* \"Check the number of positional arguments\" (which only checks for too many)\r\n       has been handled before keywords */\r\n\r\n    /* Add missing positional arguments (copy default values from defs)\r\n       (also checks for missing args where no defaults) */\r\n    {\r\n        let defaults = this.$defaults || [];\r\n        let i = 0, missing = [], missingUnnamed = false;\r\n        // Positional args for which we *don't* have a default\r\n        let defaultStart = co_argcount - defaults.length;\r\n        for (; i < defaultStart; i++) {\r\n            if (args[i] === undefined) {\r\n                missing.push(varnames[i]);\r\n                if (varnames[i] === undefined) {\r\n                    missingUnnamed = true;\r\n                }\r\n            }\r\n        }\r\n        if (missing.length != 0 && (this.co_argcount || this.co_varnames)) {\r\n            throw new Sk.builtin.TypeError(\r\n                this.$name +\r\n                    \"() missing \" +\r\n                    missing.length +\r\n                    \" required argument\" +\r\n                    (missing.length == 1 ? \"\" : \"s\") +\r\n                    (missingUnnamed ? \"\" : \": \" + missing.map((x) => \"'\" + x + \"'\").join(\", \"))\r\n            );\r\n        }\r\n        for (; i < co_argcount; i++) {\r\n            if (args[i] === undefined) {\r\n                args[i] = defaults[i - defaultStart];\r\n            }\r\n        }\r\n    }\r\n\r\n    /* Add missing keyword arguments (copy default values from kwdefs) */\r\n\r\n    if (co_kwonlyargcount > 0) {\r\n        let missing = [];\r\n        let kwdefs = this.$kwdefs;\r\n\r\n        for (let i = co_argcount; i < totalArgs; i++) {\r\n            if (args[i] === undefined) {\r\n                if (kwdefs[i - co_argcount] !== undefined) {\r\n                    args[i] = kwdefs[i - co_argcount];\r\n                } else {\r\n                    missing.push(varnames[i]);\r\n                }\r\n            }\r\n        }\r\n        if (missing.length !== 0) {\r\n            throw new Sk.builtin.TypeError(this.$name + \"() missing \" + missing.length + \" required keyword argument\" + (missing.length == 1 ? \"\" : \"s\") + \": \" + missing.join(\", \"));\r\n        }\r\n    }\r\n\r\n    if (this.func_closure) {\r\n        // todo; OK to modify?\r\n        if (varnames) {\r\n            // Make sure all default arguments are in args before adding closure\r\n            for (let i = args.length; i < varnames.length; i++) {\r\n                args.push(undefined);\r\n            }\r\n        }\r\n    }\r\n\r\n    if (kwargs) {\r\n        args.unshift(kwargs);\r\n    }\r\n\r\n    return args;\r\n};\r\n\r\n","/**\r\n * @constructor\r\n * @param {Function} code javascript code object for the function\r\n * @param {Object} globals where this function was defined\r\n * @param {Object} args arguments to the original call (stored into locals for\r\n * the generator to reenter)\r\n * @param {Object=} closure dict of free variables\r\n * @param {Object=} closure2 another dict of free variables that will be\r\n * merged into 'closure'. there's 2 to simplify generated code (one is $free,\r\n * the other is $cell)\r\n *\r\n * co_varnames and co_name come from generated code, must access as dict.\r\n */\r\nSk.builtin.generator = Sk.abstr.buildIteratorClass(\"generator\", {\r\n    constructor: function generator(code, globals, args, closure, closure2) {\r\n    var k;\r\n    var i;\r\n    if (!code) {\r\n        return;\r\n    } // ctor hack\r\n\r\n    if (!(this instanceof Sk.builtin.generator)) {\r\n            throw new TypeError(\"bad internal call to generator, use 'new'\");\r\n    }\r\n\r\n\r\n    this.func_code = code;\r\n    this.func_globals = globals || null;\r\n        this.gi$running = false;\r\n        this.gi$resumeat = 0;\r\n        this.gi$sentvalue = Sk.builtin.none.none$;\r\n        this.gi$locals = {};\r\n        this.gi$cells = {};\r\n    if (args.length > 0) {\r\n        // store arguments into locals because they have to be maintained\r\n        // too. 'fast' var lookups are locals in generator functions.\r\n            for (i = 0; i < code.co_varnames.length; ++i) {\r\n                this.gi$locals[code.co_varnames[i]] = args[i];\r\n        }\r\n    }\r\n    if (closure2 !== undefined) {\r\n        // todo; confirm that modification here can't cause problems\r\n        for (k in closure2) {\r\n            closure[k] = closure2[k];\r\n        }\r\n    }\r\n    //print(JSON.stringify(closure));\r\n    this.func_closure = closure;\r\n    },\r\n    slots: {\r\n        $r() {\r\n            return new Sk.builtin.str(\"<generator object \" + this.func_code.co_name.v + \">\");\r\n        },\r\n    },\r\n    iternext(canSuspend, yielded) {\r\n    var ret;\r\n    var args;\r\n    var self = this;\r\n        if (this.gi$running) {\r\n            throw new Sk.builtin.ValueError(\"generator already executing\");\r\n        }\r\n    this[\"gi$running\"] = true;\r\n    if (yielded === undefined) {\r\n        yielded = Sk.builtin.none.none$;\r\n    }\r\n    this[\"gi$sentvalue\"] = yielded;\r\n\r\n    // note: functions expect 'this' to be globals to avoid having to\r\n    // slice/unshift onto the main args\r\n    args = [this];\r\n    if (this.func_closure) {\r\n        args.push(this.func_closure);\r\n    }\r\n    ret = this.func_code.apply(this.func_globals, args);\r\n    return (function finishIteration(ret) {\r\n        if (ret instanceof Sk.misceval.Suspension) {\r\n            if (canSuspend) {\r\n                return new Sk.misceval.Suspension(finishIteration, ret);\r\n            } else {\r\n                ret = Sk.misceval.retryOptionalSuspensionOrThrow(ret);\r\n            }\r\n        }\r\n        //print(\"ret\", JSON.stringify(ret));\r\n        self[\"gi$running\"] = false;\r\n        Sk.asserts.assert(ret !== undefined);\r\n            if (Array.isArray(ret)) {\r\n            // returns a pair: resume target and yielded value\r\n            self[\"gi$resumeat\"] = ret[0];\r\n            ret = ret[1];\r\n        } else {\r\n            // todo; StopIteration\r\n                self.gi$ret = ret;\r\n            return undefined;\r\n        }\r\n        //print(\"returning:\", JSON.stringify(ret));\r\n        return ret;\r\n    })(ret);\r\n    },\r\n    methods: {\r\n        send: {\r\n            $meth(value) {\r\n                return Sk.misceval.chain(this.tp$iternext(true, value), (ret) => {\r\n                    if (ret === undefined) {\r\n                        const v = this.gi$ret;\r\n                        // this is a weird quirk - and only for printing purposes StopIteration(None) vs StopIteration()\r\n                        // .value ends up being None. But the repr prints the args we pass to StopIteration.\r\n                        // See tests in test_yield_from and search for StopIteration()\r\n                        throw v !== undefined && v !== Sk.builtin.none.none$ ? new Sk.builtin.StopIteration(v) : new Sk.builtin.StopIteration();\r\n                    }\r\n                    return ret;\r\n                });\r\n            },\r\n            $flags: { OneArg: true },\r\n            $doc: \"send(arg) -> send 'arg' into generator,\\nreturn next yielded value or raise StopIteration.\",\r\n        },\r\n    },\r\n});\r\nSk.exportSymbol(\"Sk.builtin.generator\", Sk.builtin.generator);\r\n\r\n/**\r\n * Creates a generator with the specified next function and additional\r\n * instance data. Useful in Javascript-implemented modules to implement\r\n * the __iter__ method.\r\n */\r\nSk.builtin.makeGenerator = function (next, data) {\r\n    var key;\r\n    var gen = new Sk.builtin.generator(null, null, null);\r\n    gen.tp$iternext = next;\r\n\r\n    for (key in data) {\r\n        if (data.hasOwnProperty(key)) {\r\n            gen[key] = data[key];\r\n        }\r\n    }\r\n\r\n    return gen;\r\n};\r\nSk.exportSymbol(\"Sk.builtin.makeGenerator\", Sk.builtin.makeGenerator);\r\n","/**\r\n * @namespace Sk.generic\r\n *\r\n * @description\r\n * Some useful default methods for native classes\r\n *\r\n */\r\nSk.generic = {};\r\n\r\n/** @typedef {Sk.builtin.object} */ var pyObject;\r\n/** @typedef {Sk.builtin.type|Function} */ var typeObject;\r\n\r\n/**\r\n * @method\r\n *\r\n * @param {Sk.builtin.str} pyName Python string name of the attribute\r\n * @param {boolean=} canSuspend Can we return a suspension?\r\n *\r\n * @description\r\n * The default implementation of __getattribute__. This is used by most instances and will be inherited from object.\r\n *\r\n * If undefined is returned by this method then the object has no attribute\r\n * It is the responsibility of the user to throw the error.\r\n * Currently this is thrown in Sk.abstr.gattr or directly in compile code\r\n *\r\n * @return {Sk.builtin.object|undefined}\r\n */\r\nSk.generic.getAttr = function __getattribute__(pyName, canSuspend) {\r\n    let f;\r\n    const type = this.ob$type;\r\n    const descr = type.$typeLookup(pyName);\r\n    // look in the type for a descriptor\r\n    if (descr !== undefined) {\r\n        f = descr.tp$descr_get;\r\n        if (f !== undefined && descr.tp$descr_set !== undefined) {\r\n            // then we're a data descriptor\r\n            return f.call(descr, this, type, canSuspend);\r\n        }\r\n    }\r\n\r\n    const dict = this.$d;\r\n\r\n    if (dict !== undefined) {\r\n        const res = dict.quick$lookup(pyName);\r\n        if (res !== undefined) {\r\n            return res;\r\n        }\r\n    }\r\n    if (f !== undefined) {\r\n        return f.call(descr, this, type, canSuspend);\r\n    }\r\n    if (descr !== undefined) {\r\n        return descr;\r\n    }\r\n    return;\r\n};\r\nSk.exportSymbol(\"Sk.generic.getAttr\", Sk.generic.getAttr);\r\n\r\n/**\r\n * @method\r\n *\r\n * @description\r\n * The default implementation of __setattr__/__delattr__ used by most instance objects\r\n * There is no return value for this function\r\n * An error will be thrown if no attribute exists\r\n *\r\n * A value=undefined signifies that the attribute is to be deleted\r\n *\r\n * @param {Sk.builtin.str} pyName\r\n * @param {Sk.builtin.object|undefined} value\r\n * @param {boolean=} canSuspend ? can this function suspend\r\n * @return {undefined}\r\n */\r\nSk.generic.setAttr = function __setattr__(pyName, value, canSuspend) {\r\n    const descr = this.ob$type.$typeLookup(pyName);\r\n    // otherwise, look in the type for a descr\r\n    if (descr !== undefined && descr !== null) {\r\n        const f = descr.tp$descr_set;\r\n        // todo; is this the right lookup priority for data descriptors?\r\n        if (f) {\r\n            return f.call(descr, this, value, canSuspend);\r\n        }\r\n    }\r\n\r\n    const dict = this.$d;\r\n    if (dict !== undefined) {\r\n        if (dict.mp$ass_subscript) {\r\n            if (value !== undefined) {\r\n                return dict.mp$ass_subscript(pyName, value);\r\n            } else {\r\n                try {\r\n                    return dict.mp$ass_subscript(pyName);\r\n                } catch (e) {\r\n                    if (e instanceof Sk.builtin.KeyError) {\r\n                        throw new Sk.builtin.AttributeError(\"'\" + Sk.abstr.typeName(this) + \"' object has no attribute '\" + pyName.$jsstr() + \"'\");\r\n                    }\r\n                    throw e;\r\n                }\r\n            }\r\n        } else if (typeof dict === \"object\") {\r\n            const jsMangled = pyName.$mangled;\r\n            if (value !== undefined) {\r\n                dict[jsMangled] = value;\r\n                return;\r\n            } else if (dict[jsMangled] !== undefined) {\r\n                delete dict[jsMangled];\r\n                return;\r\n            }\r\n        }\r\n    }\r\n    throw new Sk.builtin.AttributeError(this.sk$attrError() + \" has no attribute '\" + pyName.$jsstr() + \"'\");\r\n};\r\nSk.exportSymbol(\"Sk.generic.setAttr\", Sk.generic.setAttr);\r\n\r\n\r\n/**\r\n * @method\r\n *\r\n * @description\r\n * The default implementation of tp$new for builtin type objects that are mutable\r\n * args and kwargs are ignored\r\n * either a new instance of the builtin is returned or an instance of a subtype\r\n *\r\n * @see {Sk.builtin.type.prototype.tp$new}\r\n *\r\n * @param {typeObject} builtin \r\n */\r\nSk.generic.new = function (builtin) {\r\n    const genericNew = function __new__(args, kwargs) {\r\n        // this = prototype of an sk$type object.\r\n        if (this.constructor === builtin) {\r\n            return new this.constructor();\r\n        } else {\r\n            const instance = new this.constructor();\r\n            // now we want to apply instance to the builtin\r\n            builtin.call(instance);\r\n            return instance;\r\n        }\r\n    };\r\n    return genericNew;\r\n};\r\n\r\n/**\r\n * @method\r\n *\r\n * @description\r\n * method definitaion for __new__ that wraps tp$new\r\n * typically called by subtypes using super().__new__(args, kwargs)\r\n *\r\n * the algorithm follows Cpython\r\n *\r\n * @see {Sk.slots.__new__}\r\n *\r\n */\r\nSk.generic.newMethodDef = {\r\n    $meth(args, kwargs) {\r\n        // this = a type object\r\n        let this_name, subs_name;\r\n        const native_type_proto = this.prototype;\r\n\r\n        if (args.length < 1) {\r\n            this_name = native_type_proto.tp$name;\r\n            throw new Sk.builtin.TypeError(this_name + \".__new__(): not enough arguments\");\r\n        }\r\n\r\n        const subtype = args.shift();\r\n\r\n        if (subtype.sk$type === undefined) {\r\n            this_name = native_type_proto.tp$name;\r\n            throw new Sk.builtin.TypeError(this_name + \"__new__(X): X is not a type object (\" + Sk.abstr.typeName(subtype) + \")\");\r\n        }\r\n\r\n        if (!subtype.$isSubType(this)) {\r\n            this_name = native_type_proto.tp$name;\r\n            subs_name = subtype.prototype.tp$name;\r\n            throw new Sk.builtin.TypeError(this_name + \".__new__(\" + subs_name + \"): \" + subs_name + \" is not a subtype of \" + this_name);\r\n        }\r\n        /* from CPython: Check that the use doesn't do something silly and unsafe like\r\n       object.__new__(dict).  To do this, we check that the\r\n       most derived base that's not a heap type is this type. */\r\n\r\n        /**@todo is  prototypical inheritance fine here - i think it is because of the best base algorithm*/\r\n        const static_proto = subtype.prototype.sk$staticNew.prototype;\r\n\r\n        if (static_proto.tp$new !== native_type_proto.tp$new) {\r\n            this_name = native_type_proto.tp$name;\r\n            subs_name = subtype.prototype.tp$name;\r\n            const suitable = static_proto.tp$name;\r\n            throw new Sk.builtin.TypeError(this_name + \".__new__(\" + subs_name + \") is not safe, use \" + suitable + \".__new__()\");\r\n        }\r\n        return native_type_proto.tp$new.call(subtype.prototype, args, kwargs);\r\n    },\r\n    $flags: {FastCall: true},\r\n    $textsig: \"($type, *args, **kwargs)\",\r\n    $name: \"__new__\",\r\n};\r\n\r\n/**\r\n * @description\r\n * used by most iterators that return self\r\n *\r\n * @function\r\n */\r\nSk.generic.selfIter = function __iter__() {\r\n    return this;\r\n};\r\n\r\n/**\r\n * @method\r\n *\r\n * @description\r\n * the $seq of the iterator must be an array\r\n * $orig must be provided and must have a get$size private method\r\n * note we do not use sq$length since this can be override by subclasses\r\n *\r\n * typically used by mutable iterators like dict_iter_ and set_iter_\r\n */\r\nSk.generic.iterNextWithArrayCheckSize = function __next__() {\r\n    if (this.$seq.length !== this.$orig.get$size()) {\r\n        const error_name = this.tp$name.split(\"_\")[0];\r\n        throw new Sk.builtin.RuntimeError(error_name + \" changed size during iteration\");\r\n    } else if (this.$index >= this.$seq.length) {\r\n        return undefined;\r\n    }\r\n    return this.$seq[this.$index++];\r\n};\r\n\r\n/**\r\n * @method\r\n *\r\n * @description\r\n * the $seq of the iterator must be an array\r\n */\r\nSk.generic.iterNextWithArray = function __next__() {\r\n    const next = this.$seq[this.$index++];\r\n    if (next === undefined) {\r\n        this.tp$iternext = () => undefined; // consumed iterator\r\n    }\r\n    return next;\r\n};\r\n\r\n/**\r\n * @method\r\n *\r\n * @description\r\n * compares the $seq.length to the $index\r\n */\r\nSk.generic.iterLengthHintWithArrayMethodDef = {\r\n    $meth: function __length_hint__() {\r\n        return new Sk.builtin.int_(this.$seq.length - this.$index);\r\n    },\r\n    $flags: {NoArgs: true},\r\n};\r\n\r\n/**\r\n * @method\r\n *\r\n * @description\r\n * returns the current index\r\n */\r\nSk.generic.iterReverseLengthHintMethodDef = {\r\n    $meth: function __length_hint__() {\r\n        return new Sk.builtin.int_(this.$index);\r\n    },\r\n    $flags: {NoArgs: true},\r\n};\r\n\r\n\r\n/**\r\n * @description\r\n * typical implementation of `__dict__` for type objects that support it\r\n */\r\nSk.generic.getSetDict = {\r\n    $get() {\r\n        return this.$d;\r\n    },\r\n    $set(value) {\r\n        if (value === undefined) {\r\n            throw new Sk.builtin.TypeError(\"cannot delete __dict__\");\r\n        } else if (value instanceof Sk.builtin.dict) {\r\n            this.$d = value;\r\n        } else {\r\n            throw new Sk.builtin.TypeError(\"__dict__ must be set to a dictionary, not a '\" + Sk.abstr.typeName(value) + \"'\");\r\n        }\r\n    },\r\n    $doc: \"dictionary for instance variables (if defined)\",\r\n    $name: \"__dict__\",\r\n};\r\n\r\n/**\r\n * Logic used by seq and tuple to do rich comparisons\r\n */\r\nSk.generic.seqCompare = function (other, op) {\r\n    if (this === other && Sk.misceval.opAllowsEquality(op)) {\r\n        return true;\r\n    }\r\n    // w not a tuple\r\n    if (!(other instanceof this.sk$builtinBase)) {\r\n        return Sk.builtin.NotImplemented.NotImplemented$;\r\n    }\r\n    const v = this.v;\r\n    const w = other.v;\r\n    let i;\r\n    if (v.length !== w.length && (op === \"Eq\" || op === \"NotEq\")) {\r\n        /* Shortcut: if the lengths differ, the tuples differ */\r\n        return op === \"Eq\" ? false : true;\r\n    }\r\n    for (i = 0; i < v.length && i < w.length; ++i) {\r\n        if (!(v[i] === w[i] || Sk.misceval.richCompareBool(v[i], w[i], \"Eq\"))) {\r\n            break;\r\n        }\r\n    }\r\n    const vl = v.length; // it's possible for list lengths to have changed during iteration!\r\n    const wl = w.length;\r\n    if (i >= vl || i >= wl) {\r\n        // no more items to compare, compare sizes\r\n        switch (op) {\r\n            case \"Lt\":\r\n                return vl < wl;\r\n            case \"LtE\":\r\n                return vl <= wl;\r\n            case \"Eq\":\r\n                return vl === wl;\r\n            case \"NotEq\":\r\n                return vl !== wl;\r\n            case \"Gt\":\r\n                return vl > wl;\r\n            case \"GtE\":\r\n                return vl >= wl;\r\n            default:\r\n                Sk.asserts.fail();\r\n        }\r\n    }\r\n\r\n    // we have an item that's different\r\n    // shortcuts for eq/not\r\n    if (op === \"Eq\") {\r\n        return false;\r\n    }\r\n    if (op === \"NotEq\") {\r\n        return true;\r\n    }\r\n\r\n    // or, compare the differing element using the proper operator\r\n    return Sk.misceval.richCompareBool(v[i], w[i], op);\r\n};\r\n\r\n\r\nSk.generic.classGetItem = {\r\n    __class_getitem__: {\r\n        $meth(args) {\r\n            return new Sk.builtin.GenericAlias(this, args);\r\n        },\r\n        $flags: { OneArg: true },\r\n    },\r\n};","Sk.builtin.GenericAlias = Sk.abstr.buildNativeClass(\"types.GenericAlias\", {\r\n    constructor: function GenericAlias(origin, args) {\r\n        this.$origin = origin;\r\n        if (!(args instanceof Sk.builtin.tuple)) {\r\n            args = new Sk.builtin.tuple([args]);\r\n        }\r\n        this.$args = args;\r\n        this.$params = null;\r\n    },\r\n    slots: {\r\n        tp$new(args, kwargs) {\r\n            Sk.abstr.checkNoKwargs(\"GenericAlias\", kwargs);\r\n            Sk.abstr.checkArgsLen(\"GenericAlias\", args, 2, 2);\r\n            return new Sk.builtin.GenericAlias(args[0], args[1]);\r\n        },\r\n        tp$getattr(pyName, canSuspend) {\r\n            if (Sk.builtin.checkString(pyName)) {\r\n                if (!this.attr$exc.includes(pyName)) {\r\n                    return this.$origin.tp$getattr(pyName, canSuspend);\r\n                }\r\n            }\r\n            return Sk.generic.getAttr.call(this, pyName, canSuspend);\r\n        },\r\n        $r() {\r\n            const origin_repr = this.ga$repr(this.$origin);\r\n            let arg_repr = \"\";\r\n            this.$args.v.forEach((arg, i) => {\r\n                arg_repr += i > 0 ? \", \" : \"\";\r\n                arg_repr += this.ga$repr(arg);\r\n            });\r\n            if (!arg_repr) {\r\n                arg_repr = \"()\";\r\n            }\r\n            return new Sk.builtin.str(origin_repr + \"[\" + arg_repr + \"]\");\r\n        },\r\n        tp$doc: \"Represent a PEP 585 generic type\\n\\nE.g. for t = list[int], t.origin is list and t.args is (int,).\",\r\n        tp$hash() {\r\n            const h0 = Sk.abstr.objectHash(this.$origin);\r\n            if (h0 == -1) {\r\n                return -1;\r\n            }\r\n            const h1 = Sk.abstr.objectHash(this.$args);\r\n            if (h1 == -1) {\r\n                return -1;\r\n            }\r\n            return h0 ^ h1;\r\n        },\r\n        tp$call(args, kwargs) {\r\n            const obj = Sk.misceval.callsimArray(this.$origin, args, kwargs);\r\n            try {\r\n                obj.tp$setattr(new Sk.builtin.str(\"__orig_class__\"), this);\r\n            } catch (e) {\r\n                if (!(e instanceof Sk.builtin.AttributeError) && !(e instanceof Sk.builtin.TypeError)) {\r\n                    throw e;\r\n                }\r\n            }\r\n            return obj;\r\n        },\r\n        tp$richcompare(other, op) {\r\n            if (!(other instanceof Sk.builtin.GenericAlias) || (op !== \"Eq\" && op !== \"NotEq\")) {\r\n                return Sk.builtin.NotImplemented.NotImplemented$;\r\n            }\r\n            const eq = Sk.misceval.richCompareBool(this.$origin, other.$origin, \"Eq\");\r\n            if (!eq) {\r\n                return op === \"Eq\" ? eq : !eq;\r\n            }\r\n            const res = Sk.misceval.richCompareBool(this.$args, other.$args, \"Eq\");\r\n            return op === \"Eq\" ? res : !res;\r\n        },\r\n        tp$as_sequence_or_mapping: true,\r\n        mp$subscript(item) {\r\n            if (this.$params === null) {\r\n                this.mk$params();\r\n            }\r\n            const nparams = this.$params.sq$length();\r\n            if (nparams === 0) {\r\n                throw new Sk.builtin.TypeError(\"There are no type variables left in \" + Sk.misceval.objectRepr(this));\r\n            }\r\n\r\n            /**@todo the following only makes sense when we do typing*/\r\n\r\n            // const is_tuple = item instanceof Sk.builtin.tuple;\r\n            // if (is_tuple) {\r\n            //     const nitems = item.sq$length();\r\n            //     if (nitems !== nparams) {\r\n            //         throw new Sk.builtin.TypeError(\"Too \" + (nitems > nparams ? \"many\" : \"few\") + \" arguments for \" + Sk.misceval.objectRepr(this));\r\n            //     }\r\n            // }\r\n            // const args = this.$args.v;\r\n            // const new_args = [];\r\n            // args.forEach((arg) => {\r\n            //     if (this.is$typevar(arg)) {\r\n            //         const iparam = this.tuple$index(this.$params.v, arg);\r\n            //         if (is_tuple) {\r\n            //             arg = item.v[iparam];\r\n            //         } else {\r\n            //             arg = item;\r\n            //         }\r\n            //     }\r\n            //     new_args.push(arg);\r\n            // });\r\n            // const res = new Sk.builtin.GenericAlias(this.$origin, new Sk.builtin.tuple(new_args));\r\n            // return res;\r\n        },\r\n    },\r\n    methods: {\r\n        __mro_entries__: {\r\n            $meth() {\r\n                return new Sk.builtin.tuple([this.$origin]);\r\n            },\r\n            $flags: { NoArgs: true },\r\n        },\r\n        __instancecheck__: {\r\n            $meth(_) {\r\n                throw new Sk.builtin.TypeError(\"isinstance() argument 2 cannot be a parameterized generic\");\r\n            },\r\n            $flags: { OneArg: true },\r\n        },\r\n        __subclasscheck__: {\r\n            $meth(_) {\r\n                throw new Sk.builtin.TypeError(\"issubclass() argument 2 cannot be a parameterized generic\");\r\n            },\r\n            $flags: { OneArg: true },\r\n        },\r\n    },\r\n    getsets: {\r\n        __parameters__: {\r\n            $get() {\r\n                if (this.$params === null) {\r\n                    this.mk$params();\r\n                }\r\n                return this.$params;\r\n            },\r\n            $doc: \"Type variables in the GenericAlias.\",\r\n        },\r\n        __origin__: {\r\n            $get() {\r\n                return this.$origin;\r\n            },\r\n        },\r\n        __args__: {\r\n            $get() {\r\n                return this.$args;\r\n            },\r\n        },\r\n    },\r\n    proto: {\r\n        // functions here match similar functions in Objects/genericaliasobject.c\r\n        mk$params() {\r\n            const arg_arr = this.$args.v;\r\n            const params = [];\r\n            arg_arr.forEach((t) => {\r\n                if (this.is$typevar(t)) {\r\n                    if (this.tuple$index(params, t) < 0) {\r\n                        params.push(t);\r\n                    }\r\n                }\r\n            });\r\n            this.$params = new Sk.builtin.tuple(params);\r\n        },\r\n        tuple$index(tup_arr, item) {\r\n            return tup_arr.indexOf(item);\r\n        },\r\n        is$typevar(type) {\r\n            if (type.tp$name !== \"TypeVar\") {\r\n                return false;\r\n            }\r\n            const module = Sk.abstr.lookupSpecial(type, Sk.builtin.str.$module);\r\n            if (module === undefined) {\r\n                // throw some sort of error but all objects have __module_ so we shouldn't be here.\r\n                throw Sk.builtin.RuntimeError(\"found object withought a __module__\");\r\n            }\r\n            return module.toString() === \"typing\";\r\n        },\r\n        ga$repr(item) {\r\n            if (item === Sk.builtin.Ellipsis) {\r\n                return \"...\";\r\n            }\r\n            if (Sk.abstr.lookupSpecial(item, this.str$orig)) {\r\n                if (Sk.abstr.lookupSpecial(item, this.str$args)) {\r\n                    return Sk.misceval.objectRepr(item);\r\n                }\r\n            }\r\n            const qualname = Sk.abstr.lookupSpecial(item, Sk.builtin.str.$qualname);\r\n            if (qualname === undefined) {\r\n                return Sk.misceval.objectRepr(item);\r\n            }\r\n            const mod = Sk.abstr.lookupSpecial(item, Sk.builtin.str.$module);\r\n            if (mod === undefined || Sk.builtin.checkNone(mod)) {\r\n                return Sk.misceval.objectRepr(item);\r\n            } else if (mod.toString() === \"builtins\") {\r\n                return qualname.toString();\r\n            }\r\n            return mod.toString() + \".\" + qualname.toString();\r\n        },\r\n        str$orig: new Sk.builtin.str(\"__origin__\"),\r\n        str$args: new Sk.builtin.str(\"__args__\"),\r\n        attr$exc: [\r\n            \"__origin__\",\r\n            \"__args__\",\r\n            \"__parameters__\",\r\n            \"__mro_entries__\",\r\n            \"__reduce_ex__\", // needed so we don't look up object.__reduce_ex__\r\n            \"__reduce__\",\r\n        ].map((x) => new Sk.builtin.str(x)),\r\n    },\r\n});\r\n","/**\r\n * @namespace Sk\r\n *\r\n */\r\n\r\n// this is stored into sys specially, rather than created by sys\r\nSk.sysmodules = new Sk.builtin.dict([]);\r\nSk.realsyspath = undefined;\r\n\r\n/**\r\n * Retrieves sysmodules, going through any artificial sys modules that we may have.\r\n * @returns {Object}\r\n */\r\nSk.getSysModulesPolitely = function() {\r\n    let sysmodules = Sk.sysmodules;\r\n    try {\r\n        let sys = sysmodules.mp$subscript(new Sk.builtin.str(\"sys\"));\r\n        if (sys != undefined) {\r\n            sysmodules = sys.tp$getattr(new Sk.builtin.str(\"modules\"));\r\n        }\r\n    } catch (x) {}\r\n    return sysmodules;\r\n}\r\n\r\n/**\r\n * @param {string} name to look for\r\n * @param {string} ext extension to use (.py or .js)\r\n * @param {Object=} searchPath an iterable set of path strings\r\n */\r\nSk.importSearchPathForName = function (name, ext, searchPath) {\r\n    var fn;\r\n    var j;\r\n    var fns = [];\r\n    var nameAsPath = name.replace(/\\./g, \"/\");\r\n    var it, i;\r\n\r\n    var tryPathAndBreakOnSuccess = function (filename, packagePath) {\r\n        return Sk.misceval.chain(\r\n            Sk.misceval.tryCatch(function () {\r\n                return Sk.read(filename);\r\n            }, function(e) { /* Exceptions signal \"not found\" */ }),\r\n            function (code) {\r\n                if (code !== undefined) {\r\n                    // This will cause the iterFor() to return the specified value\r\n                    return new Sk.misceval.Break({filename: filename, code: code, packagePath: packagePath});\r\n                }\r\n            }\r\n        );\r\n    };\r\n\r\n    if (searchPath === undefined) {\r\n        searchPath = Sk.realsyspath;\r\n    }\r\n\r\n    return Sk.misceval.iterFor(searchPath.tp$iter(), function (pathStr) {\r\n        // For each element of path, try loading the module, and if that\r\n        // doesn't work, try the corresponding package.\r\n        return Sk.misceval.chain(\r\n            tryPathAndBreakOnSuccess(pathStr.v + \"/\" + nameAsPath + ext, false), // module\r\n            function (r) {\r\n                return r ? r : tryPathAndBreakOnSuccess(pathStr.v + \"/\" + nameAsPath + \"/__init__\" + ext,\r\n                                                        pathStr.v + \"/\" + nameAsPath); // package\r\n            }\r\n        );\r\n    });\r\n};\r\n\r\n/**\r\n * Complete any initialization of Python classes which relies on internal\r\n * dependencies.\r\n *\r\n * type, object, super, nonetype, notimplemented\r\n * getset_descr, method_descr, wrapper_descr, method_wrapper\r\n *\r\n * __doc__ for the above + classmethod, property, staticmethod\r\n *\r\n */\r\nSk.doOneTimeInitialization = function (canSuspend) {\r\n    function setUpClass(klass) {\r\n        const proto = klass.prototype;\r\n        if (!proto.hasOwnProperty(\"sk$slots\")) {\r\n            // sk$slots was set to null during setUpSlots\r\n            // if this flag is not set then we setUpSlots using the klass prototype\r\n            Sk.abstr.setUpSlots(klass);\r\n        }\r\n        if (!proto.hasOwnProperty(\"tp$mro\")) {\r\n            Sk.abstr.setUpBuiltinMro(klass);\r\n        }\r\n        if (proto.hasOwnProperty(\"tp$getsets\") && proto.tp$getsets != null) {\r\n            Sk.abstr.setUpGetSets(klass);\r\n        }\r\n        if (proto.hasOwnProperty(\"tp$methods\") && proto.tp$methods != null) {\r\n            Sk.abstr.setUpMethods(klass);\r\n        }\r\n        if (!proto.hasOwnProperty(\"__doc__\") && proto.hasOwnProperty(\"tp$doc\")) {\r\n            // a few klasses had slots setup before str was initialized so we add them here\r\n            proto.__doc__ = new Sk.builtin.str(proto.tp$doc);\r\n        }\r\n    };\r\n    for (let x in Sk.builtins) {\r\n        const obj = Sk.builtins[x];\r\n        if (obj instanceof Sk.builtin.type) {\r\n            setUpClass(obj);\r\n        }\r\n    }\r\n};\r\n\r\n/**\r\n * currently only pull once from Sk.syspath. User might want to change\r\n * from js or from py.\r\n */\r\nSk.importSetUpPath = function (canSuspend) {\r\n    var i;\r\n    var paths;\r\n    if (!Sk.realsyspath) {\r\n        paths = [\r\n            new Sk.builtin.str(\"src/builtin\"),\r\n            new Sk.builtin.str(\"src/lib\"),\r\n            new Sk.builtin.str(\".\")\r\n        ];\r\n        for (i = 0; i < Sk.syspath.length; ++i) {\r\n            paths.push(new Sk.builtin.str(Sk.syspath[i]));\r\n        }\r\n        Sk.realsyspath = new Sk.builtin.list(paths);\r\n\r\n        Sk.doOneTimeInitialization(canSuspend);\r\n    }\r\n};\r\n\r\n/**\r\n * @param {string} name name of module to import\r\n * @param {boolean=} dumpJS whether to output the generated js code\r\n * @param {string=} modname what to call the module after it's imported if\r\n * it's to be renamed (i.e. __main__)\r\n * @param {string=} suppliedPyBody use as the body of the text for the module\r\n * rather than Sk.read'ing it.\r\n * @param {Object=} relativeToPackage perform import relative to this package\r\n * @param {boolean=} returnUndefinedOnTopLevelNotFound return 'undefined' rather than throwing ImportError if the *first* load failed\r\n * @param {boolean=} canSuspend whether we may return a Suspension object\r\n */\r\nSk.importModuleInternal_ = function (name, dumpJS, modname, suppliedPyBody, relativeToPackage, returnUndefinedOnTopLevelNotFound, canSuspend) {\r\n\r\n    if (name === \"pedal.sandbox.timeout\") {\r\n        suppliedPyBody = \"def timeout(delay, func, *args, **kwargs):\\n    return func(*args, **kwargs)\";\r\n    }\r\n\r\n    //dumpJS = true;\r\n    var filename;\r\n    var prev;\r\n    var parentModName;\r\n    var parentModule;\r\n    var modNameSplit;\r\n    var ret;\r\n    var module;\r\n    var topLevelModuleToReturn = null;\r\n    var relativePackageName = relativeToPackage !== undefined ? relativeToPackage.tp$getattr(Sk.builtin.str.$name) : undefined;\r\n    var absolutePackagePrefix = relativePackageName !== undefined ? relativePackageName.v + \".\" : \"\";\r\n    var searchPath = relativeToPackage !== undefined ? relativeToPackage.tp$getattr(Sk.builtin.str.$path) : undefined;\r\n    Sk.importSetUpPath(canSuspend);\r\n\r\n    if (relativeToPackage && !relativePackageName) {\r\n        if (returnUndefinedOnTopLevelNotFound) {\r\n            return undefined;\r\n        } else {\r\n            throw new Sk.builtin.ValueError(\"Attempted to import relative to invalid package (no name)\");\r\n        }\r\n    }\r\n\r\n    // if no module name override, supplied, use default name\r\n    if (modname === undefined) {\r\n        modname = absolutePackagePrefix + name;\r\n    }\r\n\r\n    modNameSplit = name.split(\".\");\r\n\r\n    if (modNameSplit.length > 1) {\r\n        // if we're a module inside a package (i.e. a.b.c), then we'll need to return the\r\n        // top-level package ('a'). recurse upwards on our parent, importing\r\n        // all parent packages. so, here we're importing 'a.b', which will in\r\n        // turn import 'a', and then return 'a' eventually.\r\n        parentModName = modNameSplit.slice(0, modNameSplit.length - 1).join(\".\");\r\n        topLevelModuleToReturn = Sk.importModuleInternal_(parentModName, dumpJS, undefined, undefined, relativeToPackage, returnUndefinedOnTopLevelNotFound, canSuspend);\r\n    }\r\n\r\n    let sysmodules = Sk.getSysModulesPolitely();\r\n\r\n    ret = Sk.misceval.chain(topLevelModuleToReturn, function (topLevelModuleToReturn_) {\r\n        topLevelModuleToReturn = topLevelModuleToReturn_;\r\n\r\n        // if leaf is already in sys.modules, early out\r\n        try {\r\n            prev = sysmodules.quick$lookup(new Sk.builtin.str(modname));\r\n            //prev = sysmodules.mp$subscript(new Sk.builtin.str(modname));\r\n            // if we're a dotted module, return the top level, otherwise ourselves\r\n            if (prev !== undefined) {\r\n                return topLevelModuleToReturn || prev;\r\n            }\r\n        } catch (x) {\r\n            console.error(\"WAIT\", x);\r\n            // not in sys.modules, continue\r\n        }\r\n\r\n        return Sk.misceval.chain(undefined, function () {\r\n            var codeAndPath, co, googClosure;\r\n            var searchFileName = name;\r\n            var result;\r\n\r\n            // If we're inside a package, look search using its __path__\r\n            if (modNameSplit.length > 1) {\r\n                if (!topLevelModuleToReturn) {\r\n                    return undefined;\r\n                }\r\n                parentModule = sysmodules.mp$subscript(new Sk.builtin.str(absolutePackagePrefix + parentModName));\r\n                searchFileName = modNameSplit[modNameSplit.length - 1];\r\n                searchPath = parentModule.tp$getattr(Sk.builtin.str.$path);\r\n            }\r\n\r\n            // otherwise:\r\n            // - create module object\r\n            // - add module object to sys.modules\r\n            // - compile source to (function(){...});\r\n            // - run module and set the module locals returned to the module __dict__\r\n            module = new Sk.builtin.module();\r\n\r\n            if (typeof suppliedPyBody === \"string\") {\r\n                filename = name + \".py\";\r\n                co = Sk.compile(suppliedPyBody, filename, \"exec\", canSuspend, true);\r\n            } else {\r\n                co = Sk.misceval.chain(undefined, function () {\r\n                    // If an onBeforeImport method is supplied, call it and if\r\n                    // the result is false or a string, prevent the import.\r\n                    // This allows for a user to conditionally prevent the usage\r\n                    // of certain libraries.\r\n                    if (Sk.onBeforeImport && typeof Sk.onBeforeImport === \"function\") {\r\n                        return Sk.onBeforeImport(name);\r\n                    }\r\n\r\n                    return;\r\n                }, function (result) {\r\n                    if (result === false) {\r\n                        throw new Sk.builtin.ImportError(\"Importing \" + name + \" is not allowed\");\r\n                    } else if (typeof result === \"string\") {\r\n                        throw new Sk.builtin.ImportError(result);\r\n                    }\r\n\r\n                    // Try loading as a builtin (i.e. already in JS) module, then try .py files\r\n                    return Sk.importSearchPathForName(searchFileName, \".js\", searchPath);\r\n                }, function (codeAndPath) {\r\n                    if (codeAndPath) {\r\n                        return {\r\n                            funcname: \"$builtinmodule\", code: codeAndPath.code,\r\n                            filename: codeAndPath.filename, packagePath: codeAndPath.packagePath\r\n                        };\r\n                    } else {\r\n                        return Sk.misceval.chain(Sk.importSearchPathForName(searchFileName, \".py\", searchPath), function (codeAndPath_) {\r\n                            codeAndPath = codeAndPath_; // We'll want it in a moment\r\n                            if (codeAndPath) {\r\n                                return Sk.compile(codeAndPath.code, codeAndPath.filename, \"exec\", canSuspend, true);\r\n                            }\r\n                        }, function (co) {\r\n                            if (co) {\r\n                                co.packagePath = codeAndPath.packagePath;\r\n                                return co;\r\n                            }\r\n                        });\r\n                    }\r\n                });\r\n\r\n            }\r\n            return co;\r\n\r\n        }, function (co) {\r\n\r\n            var finalcode;\r\n            var withLineNumbers;\r\n            var modscope;\r\n\r\n            if (!co) {\r\n                return undefined;\r\n            }\r\n\r\n            // Now we know this module exists, we can add it to the cache\r\n            sysmodules.mp$ass_subscript(new Sk.builtin.str(modname), module);\r\n\r\n            module.$js = co.code; // todo; only in DEBUG?\r\n            finalcode = co.code;\r\n\r\n            if (filename == null) {\r\n                filename = co.filename;\r\n            }\r\n\r\n            if (Sk.dateSet == null || !Sk.dateSet) {\r\n                finalcode = \"Sk.execStart = Sk.lastYield = new Date();\\n\" + co.code;\r\n                Sk.dateSet = true;\r\n            }\r\n\r\n            // if (!COMPILED)\r\n            // {\r\n            if (dumpJS) {\r\n                withLineNumbers = function (code) {\r\n                    var j;\r\n                    var pad;\r\n                    var width;\r\n                    var i;\r\n                    var beaut = Sk.js_beautify(code);\r\n                    var lines = beaut.split(\"\\n\");\r\n                    for (i = 1; i <= lines.length; ++i) {\r\n                        width = (\"\" + i).length;\r\n                        pad = \"\";\r\n                        for (j = width; j < 5; ++j) {\r\n                            pad += \" \";\r\n                        }\r\n                        lines[i - 1] = \"/* \" + pad + i + \" */ \" + lines[i - 1];\r\n                    }\r\n                    return lines.join(\"\\n\");\r\n                };\r\n                finalcode = withLineNumbers(finalcode);\r\n                Sk.debugout(finalcode);\r\n            }\r\n            // }\r\n\r\n            finalcode += \"\\n\" + co.funcname + \";\";\r\n\r\n            modscope = Sk.global[\"eval\"](finalcode);\r\n\r\n            module[\"$d\"] = {\r\n                \"__name__\": new Sk.builtin.str(modname),\r\n                \"__doc__\": Sk.builtin.none.none$,\r\n                \"__package__\": co.packagePath ? new Sk.builtin.str(modname) :\r\n                parentModName ? new Sk.builtin.str(absolutePackagePrefix + parentModName) :\r\n                relativePackageName ? relativePackageName : Sk.builtin.none.none$\r\n            };\r\n            if (co.packagePath) {\r\n                module[\"$d\"][\"__path__\"] = new Sk.builtin.tuple([new Sk.builtin.str(co.packagePath)]);\r\n            }\r\n\r\n            let r = modscope(module[\"$d\"]);\r\n            return r;\r\n\r\n        }, function (modlocs) {\r\n            var i;\r\n\r\n            if (modlocs === undefined) {\r\n                if (returnUndefinedOnTopLevelNotFound && !topLevelModuleToReturn) {\r\n                    return undefined;\r\n                } else {\r\n                    throw new Sk.builtin.ImportError(\"No module named \" + name);\r\n                }\r\n            }\r\n\r\n            // Some builtin modules replace their globals entirely.\r\n            // For their benefit, we copy over any of the standard\r\n            // dunder-values they didn't supply.\r\n            if (modlocs !== module[\"$d\"]) {\r\n                for (i in module[\"$d\"]) {\r\n                    if (!modlocs[i]) {\r\n                        modlocs[i] = module[\"$d\"][i];\r\n                    }\r\n                }\r\n                module[\"$d\"] = modlocs;\r\n            }\r\n\r\n            // If an onAfterImport method is defined on the global Sk\r\n            // then call it now after a library has been successfully imported\r\n            // and compiled.\r\n            if (Sk.onAfterImport && typeof Sk.onAfterImport === \"function\") {\r\n                try {\r\n                    Sk.onAfterImport(name);\r\n                } catch (e) {\r\n                }\r\n            }\r\n\r\n            if (topLevelModuleToReturn) {\r\n                // if we were a dotted name, then we want to return the top-most\r\n                // package. we store ourselves into our parent as an attribute\r\n                parentModule.tp$setattr(new Sk.builtin.str(modNameSplit[modNameSplit.length - 1]), module);\r\n                //print(\"import returning parent module, modname\", modname, \"__name__\", toReturn.tp$getattr(\"__name__\").v);\r\n                return topLevelModuleToReturn;\r\n            }\r\n\r\n            if (relativeToPackage) {\r\n                relativeToPackage.tp$setattr(new Sk.builtin.str(name), module);\r\n            }\r\n\r\n            //print(\"name\", name, \"modname\", modname, \"returning leaf\");\r\n            // otherwise we return the actual module that we just imported\r\n            return module;\r\n        });\r\n    });\r\n\r\n    return canSuspend ? ret : Sk.misceval.retryOptionalSuspensionOrThrow(ret);\r\n};\r\n\r\n/**\r\n * @param {string} name the module name\r\n * @param {boolean=} dumpJS print out the js code after compilation for debugging\r\n * @param {boolean=} canSuspend can this function suspend and return a Suspension object?\r\n */\r\nSk.importModule = function (name, dumpJS, canSuspend) {\r\n    return Sk.importModuleInternal_(name, dumpJS, undefined, undefined, undefined, false, canSuspend);\r\n};\r\n\r\nSk.importMain = function (name, dumpJS, canSuspend) {\r\n    Sk.dateSet = false;\r\n    Sk.filesLoaded = false;\r\n    // Added to reset imports\r\n    Sk.sysmodules = new Sk.builtin.dict([]);\r\n    Sk.realsyspath = undefined;\r\n    Sk.execStack = [];\r\n\r\n    Sk.resetCompiler();\r\n\r\n    return Sk.importModuleInternal_(name, dumpJS, \"__main__\", undefined, undefined, false, canSuspend);\r\n};\r\n\r\n/**\r\n * **Run Python Code in Skulpt**\r\n *\r\n * When you want to hand Skulpt a string corresponding to a Python program this is the function.\r\n *\r\n * @param name {string}  File name to use for messages related to this run\r\n * @param dumpJS {boolean} print out the compiled javascript\r\n * @param body {string} Python Code\r\n * @param canSuspend {boolean}  Use Suspensions for async execution\r\n * @param sysmodules {object} An existing sysmodules to reuse.\r\n *\r\n */\r\nSk.importMainWithBody = function (name, dumpJS, body, canSuspend, sysmodules) {\r\n    Sk.dateSet = false;\r\n    Sk.filesLoaded = false;\r\n    // Added to reset imports\r\n    if (sysmodules === undefined) {\r\n        Sk.sysmodules = new Sk.builtin.dict([]);\r\n    } else {\r\n        Sk.sysmodules = sysmodules;\r\n    }\r\n    Sk.realsyspath = undefined;\r\n    Sk.execPausedAmount = 0;\r\n    Sk.execPaused = 0;\r\n    Sk.execStack = [];\r\n\r\n    Sk.resetCompiler();\r\n\r\n    return Sk.importModuleInternal_(name, dumpJS, \"__main__\", body, undefined, false, canSuspend);\r\n};\r\n\r\n/**\r\n * Imports internal python files into the `__builtin__` module. Used during startup\r\n * to compile and import all *.py files from the src/ directory.\r\n *\r\n * @param name {string}  File name to use for messages related to this run\r\n * @param dumpJS {boolean} print out the compiled javascript\r\n * @param body {string} Python Code\r\n * @param canSuspend {boolean}  Use Suspensions for async execution\r\n *\r\n */\r\nSk.importBuiltinWithBody = function (name, dumpJS, body, canSuspend) {\r\n    return Sk.importModuleInternal_(name, dumpJS, \"__builtin__.\" + name, body, undefined, false, canSuspend);\r\n};\r\n\r\nSk.builtin.__import__ = function (name, globals, locals, fromlist, level, askeyword=false) {\r\n    //print(\"Importing: \", JSON.stringify(name), JSON.stringify(fromlist), level);\r\n    //if (name == \"\") { debugger; }\r\n\r\n    // TODO: Need to check if there is a builtins with the name __import__\r\n    if (askeyword && Sk.globals[\"__builtins__\"] !== undefined) {\r\n        builtinModuleVersion = Sk.globals[\"__builtins__\"].mp$lookup(Sk.builtin.str.$import);\r\n        if (builtinModuleVersion !== undefined) {\r\n            if (globals && !Sk.builtin.checkNone(globals) && !(globals instanceof Sk.builtin.dict)) {\r\n                globals = new Sk.builtin.dict(Object.entries(globals).flatMap(\r\n                    ([key, value]) => [Sk.ffi.remapToPy(key), value]\r\n                ));\r\n            }\r\n            return Sk.misceval.callsimOrSuspend(builtinModuleVersion, new Sk.builtin.str(name), globals, locals, Sk.ffi.remapToPy(fromlist), Sk.ffi.remapToPy(level));\r\n        }\r\n    }\r\n\r\n    // Save the Sk.globals variable importModuleInternal_ may replace it when it compiles\r\n    // a Python language module.\r\n    var saveSk = Sk.globals;\r\n\r\n    // If passed in a PyString, then turn it into a JS string.\r\n    if (Sk.builtin.checkString(name)) {\r\n        name = name.v;\r\n    }\r\n\r\n    // If we don't have the globals, then fetch them forth.\r\n    if (globals === undefined) {\r\n        globals = Sk.globals;\r\n    }\r\n\r\n    // This might be a relative import, so first we get hold of the module object\r\n    // representing this module's package (so we can search its __path__).\r\n    // module.__package__ contains its name, so we use that to look it up in sys.modules.\r\n\r\n    var relativeToPackage;\r\n    var relativeToPackageName;\r\n    var relativeToPackageNames;\r\n\r\n    if (level === undefined) {\r\n        level = Sk.__future__.absolute_import ? 0 : -1;\r\n    }\r\n\r\n    if (level !== 0 && globals[\"__package__\"] && globals[\"__package__\"] !== Sk.builtin.none.none$) {\r\n        relativeToPackageName = globals[\"__package__\"].v;\r\n        if (relativeToPackageName && level > 0) {\r\n            // Trim <level> packages off the end\r\n            relativeToPackageNames = relativeToPackageName.split(\".\");\r\n            if (level - 1 >= relativeToPackageNames.length) {\r\n                throw new Sk.builtin.ValueError(\"Attempted relative import beyond toplevel package\");\r\n            }\r\n            relativeToPackageNames.length -= level - 1;\r\n            relativeToPackageName = relativeToPackageNames.join(\".\");\r\n        }\r\n        try {\r\n            relativeToPackage = Sk.sysmodules.mp$subscript(new Sk.builtin.str(relativeToPackageName));\r\n        } catch (e) {\r\n            relativeToPackageName = undefined;\r\n        }\r\n    }\r\n\r\n    if (level > 0 && relativeToPackage === undefined) {\r\n        throw new Sk.builtin.ValueError(\"Attempted relative import in non-package\");\r\n    }\r\n\r\n    //console.log(\"&*(\", name);\r\n    var dottedName = name.split(\".\");\r\n    var firstDottedName = dottedName[0];\r\n\r\n    return Sk.misceval.chain(undefined, function () {\r\n        // Attempt local load first (and just fall through to global\r\n        // case if level == -1 and we fail to load the top-level package)\r\n        if (level !== 0 && relativeToPackage !== undefined) {\r\n            if (name === \"\") {\r\n                // \"from .. import ...\"\r\n                return relativeToPackage;\r\n            } else {\r\n                return Sk.importModuleInternal_(name, undefined, relativeToPackageName + \".\" + name, undefined, relativeToPackage, level == -1, true);\r\n            }\r\n        }\r\n    }, function (ret) {\r\n        if (ret === undefined) {\r\n            // Either it was always a global import, or it was an\r\n            // either-way import that just fell through.\r\n            relativeToPackage = undefined;\r\n            relativeToPackageName = undefined;\r\n            return Sk.importModuleInternal_(name, undefined, undefined, undefined, undefined, false, true);\r\n        } else {\r\n            return ret;\r\n        }\r\n    }, function (ret) {\r\n        // We might also have to load modules named by the fromlist.\r\n        // If there is no fromlist, we have reached the end of the lookup, return\r\n        if (!fromlist || fromlist.length === 0) {\r\n            return ret;\r\n        } else {\r\n            // try to load from-names as modules from the file system\r\n            // if they are not present on the module itself\r\n            var i;\r\n            var fromName;\r\n            var leafModule, rootModule;\r\n            var importChain;\r\n\r\n            let sysmodules = Sk.getSysModulesPolitely();\r\n\r\n            leafModule = sysmodules.mp$subscript(\r\n                new Sk.builtin.str((relativeToPackageName || \"\") +\r\n                    ((relativeToPackageName && name) ? \".\" : \"\") +\r\n                    name));\r\n            rootModule = sysmodules.mp$subscript(new Sk.builtin.str(firstDottedName));\r\n\r\n            for (i = 0; i < fromlist.length; i++) {\r\n                fromName = fromlist[i];\r\n\r\n                // \"ret\" is the module we're importing from\r\n                // Only import from file system if we have not found the fromName in the current module\r\n                if (fromName != \"*\" && leafModule.tp$getattr(new Sk.builtin.str(fromName)) === undefined) {\r\n                    importChain = Sk.misceval.chain(importChain,\r\n                                                    Sk.importModuleInternal_.bind(null, fromName, undefined, undefined, undefined, leafModule, true, true)\r\n                    );\r\n                }\r\n            }\r\n\r\n            return Sk.misceval.chain(importChain, function () {\r\n                // if there's a fromlist we want to return the leaf module\r\n                // (ret), not the toplevel namespace\r\n                Sk.asserts.assert(leafModule);\r\n                //console.log(\"LEAF MODULE:\", leafModule, sysmodules, relativeToPackageName, name, firstDottedName, rootModule, fromlist);\r\n                //return leafModule;\r\n                return leafModule;\r\n            });\r\n        }\r\n\r\n    }, function (ret) {\r\n        if (saveSk !== Sk.globals) {\r\n            Sk.globals = saveSk;\r\n        }\r\n        return ret;\r\n    });\r\n};\r\n\r\nSk.importStar = function (module, loc, global) {\r\n    var __all__ = module.tp$getattr(new Sk.builtin.str(\"__all__\"));\r\n\r\n    if (__all__) {\r\n        // TODO this does not support naming *modules* in __all__,\r\n        // only variables\r\n        for (let it = Sk.abstr.iter(__all__), i = it.tp$iternext();\r\n            i !== undefined; i = it.tp$iternext()) {\r\n\r\n            loc[i.v] = Sk.abstr.gattr(module, i);\r\n        }\r\n    } else {\r\n        let props = Object[\"getOwnPropertyNames\"](module[\"$d\"]);\r\n        for (let i in props) {\r\n            if (props[i].charAt(0) != \"_\") {\r\n                loc[props[i]] = module[\"$d\"][props[i]];\r\n            }\r\n        }\r\n    }\r\n};\r\n\r\nSk.exportSymbol(\"Sk.importMain\", Sk.importMain);\r\nSk.exportSymbol(\"Sk.importMainWithBody\", Sk.importMainWithBody);\r\nSk.exportSymbol(\"Sk.importBuiltinWithBody\", Sk.importBuiltinWithBody);\r\nSk.exportSymbol(\"Sk.builtin.__import__\", Sk.builtin.__import__);\r\nSk.exportSymbol(\"Sk.importStar\", Sk.importStar);","/**\r\n *\r\n * @constructor\r\n * @extends {Sk.builtin.object}\r\n * @description\r\n * Function should only be called with a JS number|BigInt|String\r\n * If the number is a string then the size will be checked to determined whether it should be a number or BigInt\r\n * It assumed that a number passed it is within `Number.MaxSafeInteger`\r\n * Similarly if a BigInt is passed it is assumed that this is larger than `Number.MaxSafeInteger`\r\n * Internal code like `float.nb$int` checks the resulting JS instance before calling `new Sk.builtin.int_`\r\n *\r\n * @param  {number|JSBI|string=} x\r\n *\r\n */\r\nSk.builtin.int_ = Sk.abstr.buildNativeClass(\"int\", {\r\n    constructor: function int_(x) {\r\n        Sk.asserts.assert(this instanceof Sk.builtin.int_, \"bad call to int use 'new'\");\r\n        let v;\r\n        if (typeof x === \"number\" || JSBI.__isBigInt(x)) {\r\n            v = x;\r\n        } else if (x === undefined) {\r\n            v = 0;\r\n        } else if (typeof x === \"string\") {\r\n            v = stringToNumberOrBig(x);\r\n        } else if (x.nb$int) {\r\n            return x.nb$int(); // allow this as a slow path\r\n        } else {\r\n            Sk.asserts.fail(\"bad argument to int constructor\");\r\n        }\r\n        this.v = v;\r\n    },\r\n    slots: /** @lends {Sk.builtin.int_.prototype}*/{\r\n        tp$as_number: true,\r\n        tp$doc: \"int(x=0) -> integer\\nint(x, base=10) -> integer\\n\\nConvert a number or string to an integer, or return 0 if no arguments\\nare given.  If x is a number, return x.__int__().  For floating point\\nnumbers, this truncates towards zero.\\n\\nIf x is not a number or if base is given, then x must be a string,\\nbytes, or bytearray instance representing an integer literal in the\\ngiven base.  The literal can be preceded by '+' or '-' and be surrounded\\nby whitespace.  The base defaults to 10.  Valid bases are 0 and 2-36.\\nBase 0 means to interpret the base from the string as an integer literal.\\n>>> int('0b100', base=0)\\n4\",\r\n        $r() {\r\n            return new Sk.builtin.str(this.v.toString());\r\n        },\r\n        tp$hash() {\r\n            const v = this.v;\r\n            return typeof v === \"number\" ? v : JSBI.toNumber(JSBI.remainder(v, JSBI.__MAX_SAFE));\r\n        },\r\n        tp$new(args, kwargs) {\r\n            let x, base;\r\n            if (args.length + (kwargs ? kwargs.length : 0) === 1) {\r\n                x = args[0];\r\n                base = Sk.builtin.none.none$;\r\n            } else {\r\n                args = Sk.abstr.copyKeywordsToNamedArgs(\"int\", [null, \"base\"], args, kwargs, [\r\n                    new Sk.builtin.int_(0),\r\n                    Sk.builtin.none.none$,\r\n                ]);\r\n                x = args[0];\r\n                base = args[1];\r\n            }\r\n            x = getInt(x, base);\r\n\r\n            if (this === Sk.builtin.int_.prototype) {\r\n                return x;\r\n            } else {\r\n                const instance = new this.constructor();\r\n                instance.v = x.v;\r\n                return instance;\r\n            }\r\n        },\r\n        tp$getattr: Sk.generic.getAttr,\r\n        ob$eq: compareSlot((v, w) => v == w, JSBI.equal),\r\n        ob$ne: compareSlot((v, w) => v != w, JSBI.notEqual),\r\n        ob$gt: compareSlot((v, w) => v > w, JSBI.greaterThan),\r\n        ob$ge: compareSlot((v, w) => v >= w, JSBI.greaterThanOrEqual),\r\n        ob$lt: compareSlot((v, w) => v < w, JSBI.lessThan),\r\n        ob$le: compareSlot((v, w) => v <= w, JSBI.lessThanOrEqual),\r\n\r\n        nb$int: cloneSelf,\r\n        nb$index() {\r\n            return this.v;\r\n        },\r\n        nb$float() {\r\n            const v = this.v;\r\n            if (typeof v === \"number\") {\r\n                return new Sk.builtin.float_(v);\r\n            } else {\r\n                const x = parseFloat(JSBI.toNumber(v));\r\n                if (x === Infinity || x === -Infinity) {\r\n                    throw new Sk.builtin.OverflowError(\"int too large to convert to float\");\r\n                }\r\n                return new Sk.builtin.float_(x);\r\n            }\r\n        },\r\n        nb$isnegative() {\r\n            const v = this.v;\r\n            return typeof v === \"number\" ? v < 0 : JSBI.lessThan(v, JSBI.__ZERO);\r\n        },\r\n        nb$ispositive() {\r\n            const v = this.v;\r\n            return typeof v === \"number\" ? v >= 0 : JSBI.greaterThanOrEqual(v, JSBI.__ZERO);\r\n        },\r\n        nb$bool() {\r\n            return this.v !== 0; // should be fine not to check BigInt here\r\n        },\r\n\r\n        nb$positive: cloneSelf,\r\n\r\n        nb$negative: numberUnarySlot((v) => -v, JSBI.unaryMinus),\r\n\r\n        nb$add: numberSlot(\r\n            (v, w) => v + w,\r\n            (v, w) => JSBI.numberIfSafe(JSBI.add(v, w))\r\n        ),\r\n        nb$subtract: numberSlot(\r\n            (v, w) => v - w,\r\n            (v, w) => JSBI.numberIfSafe(JSBI.subtract(v, w))\r\n        ),\r\n        nb$multiply: numberSlot((v, w) => v * w, JSBI.multiply),\r\n        nb$divide: trueDivide,\r\n        nb$floor_divide: numberDivisionSlot((v, w) => Math.floor(v / w), BigIntFloorDivide),\r\n        nb$remainder: numberDivisionSlot(\r\n            (v, w) => v - Math.floor(v / w) * w,\r\n            (v, w) => JSBI.subtract(v, JSBI.multiply(w, BigIntFloorDivide(v, w)))\r\n        ),\r\n        nb$divmod(other) {\r\n            const floor = this.nb$floor_divide(other);\r\n            const remainder = this.nb$remainder(other);\r\n            if (\r\n                floor === Sk.builtin.NotImplemented.NotImplemented$ ||\r\n                remainder === Sk.builtin.NotImplemented.NotImplemented$\r\n            ) {\r\n                return Sk.builtin.NotImplemented.NotImplemented$;\r\n            }\r\n            return new Sk.builtin.tuple([floor, remainder]);\r\n        },\r\n        nb$and: numberBitSlot((v, w) => v & w, JSBI.bitwiseAnd),\r\n        nb$or: numberBitSlot((v, w) => v | w, JSBI.bitwiseOr),\r\n        nb$xor: numberBitSlot((v, w) => v ^ w, JSBI.bitwiseXor),\r\n\r\n        nb$abs: numberUnarySlot(Math.abs, BigIntAbs),\r\n\r\n        nb$lshift: numberShiftSlot((v, w) => {\r\n                const tmp = v * 2 * shiftconsts[w];\r\n                if (numberOrStringWithinThreshold(tmp)) {\r\n                    return tmp;\r\n                }\r\n            return undefined; // fall through to using BigInt shift\r\n        }, JSBI.leftShift),\r\n        nb$rshift: numberShiftSlot(\r\n            (v, w) => {\r\n                // Avoid forced signed 32 bit conversion and just divide.\r\n                Math.floor(v / shiftconsts[w + 1]);\r\n            },\r\n            (v, w) => JSBI.numberIfSafe(JSBI.signedRightShift(v, w))\r\n        ),\r\n\r\n        nb$invert: numberUnarySlot(\r\n            (v) => (Math.abs(v) < 2 ** 31 ? ~v : undefined),\r\n            (v) => JSBI.numberIfSafe(JSBI.bitwiseNot(v))\r\n        ),\r\n        nb$power(other, mod) {\r\n            let ret;\r\n            if (mod === undefined) {\r\n                // pass\r\n            } else if (Sk.builtin.checkNone(mod)) {\r\n                mod = undefined;\r\n            }\r\n            if (!(other instanceof Sk.builtin.int_) || (mod !== undefined && !(mod instanceof Sk.builtin.int_))) {\r\n                return Sk.builtin.NotImplemented.NotImplemented$;\r\n            }\r\n            const wNeg = other.nb$isnegative();\r\n            if (wNeg && mod === undefined) {\r\n                return this.nb$float().nb$power(other.nb$float());\r\n            }\r\n                let v = this.v;\r\n                let w = other.v;\r\n                if (typeof v === \"number\" && typeof w === \"number\") {\r\n                const power = Math.pow(v, w);\r\n                    if (numberOrStringWithinThreshold(power)) {\r\n                    ret = new Sk.builtin.int_(power);\r\n                    if (mod === undefined) {\r\n                        return ret;\r\n                    }\r\n                }\r\n                }\r\n                if (mod !== undefined) {\r\n                if (wNeg) {\r\n                    /** @todo - python 3.8 supports this - https://github.com/python/cpython/pull/13266 */\r\n                    throw new Sk.builtin.ValueError(\r\n                        \"pow() 2nd argument cannot be negative when 3rd argument specified\"\r\n                    );\r\n                } else if (mod.v === 0) {\r\n                    throw new Sk.builtin.ValueError(\"pow() 3rd argument cannot be 0\");\r\n                    }\r\n                if (ret !== undefined) {\r\n                    return ret.nb$remainder(mod);\r\n                }\r\n                return new Sk.builtin.int_(JSBI.powermod(bigUp(v), bigUp(w), bigUp(mod.v)));\r\n            }\r\n            // if we're here then we've fallen through so do bigint exponentiate\r\n            return new Sk.builtin.int_(JSBI.exponentiate(bigUp(v), bigUp(w)));\r\n        },\r\n        nb$long() {\r\n            return new Sk.builtin.lng(this.v);\r\n        },\r\n    },\r\n    getsets: /** @lends {Sk.builtin.int_.prototype}*/{\r\n        real: {\r\n            $get: cloneSelf,\r\n            $doc: \"the real part of a complex number\",\r\n        },\r\n        imag: {\r\n            $get() {\r\n                return new Sk.builtin.int_(0);\r\n            },\r\n            $doc: \"the imaginary part of a complex number\",\r\n        },\r\n    },\r\n    methods: /** @lends {Sk.builtin.int_.prototype}*/{\r\n        conjugate: {\r\n            $meth: cloneSelf,\r\n            $flags: {NoArgs: true},\r\n            $textsig: null,\r\n            $doc: \"Returns self, the complex conjugate of any int.\",\r\n        },\r\n        bit_length: {\r\n            $meth() {\r\n                let v = this.v;\r\n                if (v === 0) {\r\n                    return new Sk.builtin.int_(0);\r\n                }\r\n                v = typeof v === \"number\" ? Math.abs(v) : BigIntAbs(v);\r\n                return new Sk.builtin.int_(v.toString(2).length);\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: \"($self, /)\",\r\n            $doc: \"Number of bits necessary to represent self in binary.\\n\\n>>> bin(37)\\n'0b100101'\\n>>> (37).bit_length()\\n6\",\r\n        },\r\n        to_bytes: {\r\n            $meth() {\r\n                throw new Sk.builtin.NotImplementedError(\"Not yet implemented in Skulpt\");\r\n            },\r\n            $flags: {FastCall: true},\r\n            $textsig: \"($self, /, length, byteorder, *, signed=False)\",\r\n            $doc: \"Return an array of bytes representing an integer.\\n\\n  length\\n    Length of bytes object to use.  An OverflowError is raised if the\\n    integer is not representable with the given number of bytes.\\n  byteorder\\n    The byte order used to represent the integer.  If byteorder is 'big',\\n    the most significant byte is at the beginning of the byte array.  If\\n    byteorder is 'little', the most significant byte is at the end of the\\n    byte array.  To request the native byte order of the host system, use\\n    `sys.byteorder' as the byte order value.\\n  signed\\n    Determines whether two's complement is used to represent the integer.\\n    If signed is False and a negative integer is given, an OverflowError\\n    is raised.\",\r\n        },\r\n        __trunc__: {\r\n            $meth: cloneSelf,\r\n            $flags: {NoArgs: true},\r\n            $textsig: null,\r\n            $doc: \"Truncating an Integral returns itself.\",\r\n        },\r\n        __floor__: {\r\n            $meth: cloneSelf,\r\n            $flags: {NoArgs: true},\r\n            $textsig: null,\r\n            $doc: \"Flooring an Integral returns itself.\",\r\n        },\r\n        __ceil__: {\r\n            $meth: cloneSelf,\r\n            $flags: {NoArgs: true},\r\n            $textsig: null,\r\n            $doc: \"Ceiling of an Integral returns itself.\",\r\n        },\r\n        __round__: {\r\n            $meth(ndigits) {\r\n                return this.round$(ndigits);\r\n            },\r\n            $flags: {MinArgs: 0, MaxArgs: 1},\r\n            $textsig: null,\r\n            $doc: \"Rounding an Integral returns itself.\\nRounding with an ndigits argument also returns an integer.\",\r\n        },\r\n        __getnewargs__: {\r\n            $meth() {\r\n                return new Sk.builtin.tuple([new Sk.builtin.int_(this.v)]);\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: \"($self, /)\",\r\n            $doc: Sk.builtin.none.none$,\r\n        },\r\n        __format__: {\r\n            $meth: Sk.formatting.mkNumber__format__(false),\r\n            $flags: {OneArg: true},\r\n            $textsig: \"($self, format_spec, /)\",\r\n            $doc: Sk.builtin.none.none$,\r\n        },\r\n    },\r\n    proto: /** @lends {Sk.builtin.int_.prototype}*/{\r\n        str$(base, sign) {\r\n            let tmp;\r\n            if (base === undefined || base === 10) {\r\n                tmp = this.v.toString();\r\n            } else {\r\n                tmp = this.v.toString(base);\r\n            }\r\n            if (sign || sign === undefined) {\r\n                return tmp;\r\n            } else if (tmp[0] === \"-\") {\r\n                tmp = tmp.substring(1);\r\n            }\r\n            return tmp;\r\n        },\r\n        round$(ndigits) {\r\n            if (ndigits === undefined) {\r\n                ndigits = 0;\r\n            } else {\r\n                ndigits = Sk.misceval.asIndexSized(ndigits);\r\n            }\r\n            const v = this.v;\r\n            if (ndigits >= 0) {\r\n                return new Sk.builtin.int_(v);\r\n            }\r\n            if (typeof v !== \"number\") {\r\n                return BigIntRound(v, ndigits);\r\n            }\r\n            const multiplier = Math.pow(10, -ndigits);\r\n            if (multiplier / 10 > Math.abs(v)) {\r\n                return new Sk.builtin.int_(0);\r\n            }\r\n            if (!Sk.__future__.bankers_rounding) {\r\n                return new Sk.builtin.int_(Math.round(v / multiplier) * multiplier);\r\n            }\r\n                const num10 = v / multiplier;\r\n                const rounded = Math.round(num10);\r\n            const bankRound =\r\n                (num10 > 0 ? num10 : -num10) % 1 === 0.5 ? (0 === rounded % 2 ? rounded : rounded - 1) : rounded;\r\n                const result = bankRound * multiplier;\r\n                return new Sk.builtin.int_(result);\r\n        },\r\n    },\r\n});\r\n\r\nSk.exportSymbol(\"Sk.builtin.int_\", Sk.builtin.int_);\r\n/**\r\n * A function that will return either a number or a BigInt\r\n *\r\n * There are two functions passed to this slot the quick function where both int values are number\r\n * and the JSBI.BigInt version of the same function\r\n * The fall through case where one or both of the int values is a bigint\r\n * @ignore\r\n *\r\n * @private\r\n *\r\n * @param {Function} number_func\r\n * @param {Function} bigint_func\r\n */\r\nfunction numberSlot(number_func, bigint_func) {\r\n    /**\r\n     * @this {Sk.builtin.int_}\r\n     *\r\n     * @param {Sk.builtin.int_|Sk.builtin.object} other\r\n    * @return {Sk.builtin.int_|Sk.builtin.NotImplemented}\r\n     */\r\n    return function (other) {\r\n        if (!(other instanceof Sk.builtin.int_)) {\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        }\r\n            /**@type {number|JSBI} */\r\n            let v = this.v;\r\n            /**@type {number|JSBI} */\r\n            let w = other.v;\r\n            if (typeof v === \"number\" && typeof w === \"number\") {\r\n                const res = number_func(v, w);\r\n                if (numberOrStringWithinThreshold(res)) {\r\n                    return new Sk.builtin.int_(res);\r\n                }\r\n            }\r\n            v = bigUp(v);\r\n            w = bigUp(w);\r\n            return new Sk.builtin.int_(bigint_func(v, w));\r\n    };\r\n}\r\n\r\nfunction compareSlot(number_func, bigint_func) {\r\n    return function (other) {\r\n        if (!(other instanceof Sk.builtin.int_)) {\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        }\r\n            let v = this.v;\r\n            let w = other.v;\r\n            if (typeof v === \"number\" && typeof w === \"number\") {\r\n                return number_func(v, w);\r\n            }\r\n            v = bigUp(v);\r\n            w = bigUp(w);\r\n            return bigint_func(v, w);\r\n    };\r\n}\r\n\r\n/**\r\n *\r\n * @param {function(number): number} number_func\r\n * @param {function(JSBI): JSBI} bigint_func\r\n * @ignore\r\n *\r\n */\r\nfunction numberUnarySlot(number_func, bigint_func) {\r\n    /**\r\n     * @this {Sk.builtin.int_}\r\n     * @return {Sk.builtin.int_}\r\n     */\r\n    function doUnarySlot() {\r\n        let v = this.v;\r\n        if (typeof v === \"number\") {\r\n            const res = number_func(v);\r\n            if (res !== undefined) {\r\n                return new Sk.builtin.int_(res);\r\n            }\r\n            v = bigUp(v);\r\n        }\r\n        // fallthrough\r\n        return new Sk.builtin.int_(bigint_func(v));\r\n    }\r\n    return doUnarySlot;\r\n}\r\n\r\nfunction cloneSelf() {\r\n    return new Sk.builtin.int_(this.v);\r\n}\r\n\r\nconst DBL_MANT_DIG = Math.log2(Number.MAX_SAFE_INTEGER);\r\nconst DBL_MAX_EXP = JSBI.BigInt(Math.floor(Math.log2(Number.MAX_VALUE)));\r\nconst DBL_MIN_EXP = Math.ceil(Math.log2(Number.MIN_VALUE));\r\nconst BIG_2 = JSBI.BigInt(2);\r\nconst BIG_1 = JSBI.BigInt(1);\r\nconst DBL_MIN_OVERFLOW = JSBI.subtract(\r\n    JSBI.exponentiate(BIG_2, DBL_MAX_EXP),\r\n    JSBI.exponentiate(BIG_2, JSBI.subtract(DBL_MAX_EXP, JSBI.add(JSBI.BigInt(DBL_MANT_DIG), BIG_1)))\r\n);\r\n\r\nfunction trueDivide(other) {\r\n    if (!Sk.__future__.python3) {\r\n        return this.nb$floor_divide(other);\r\n    }\r\n    if (!(other instanceof Sk.builtin.int_)) {\r\n        return Sk.builtin.NotImplemented.NotImplemented$;\r\n    }\r\n    let v = this.v;\r\n    let w = other.v;\r\n    if (w === 0) {\r\n        throw new Sk.builtin.ZeroDivisionError(\"division by zero\");\r\n    }\r\n    if (typeof v === \"number\" && typeof w === \"number\") {\r\n        return new Sk.builtin.float_(v / w);\r\n    }\r\n\r\n    // slow case do what we gotta do\r\n    // algorithm taken from test_long.py\r\n    v = bigUp(v);\r\n    w = bigUp(w);\r\n    const negative = JSBI.lessThan(JSBI.bitwiseXor(v, w), JSBI.__ZERO);\r\n    if (JSBI.equal(v, JSBI.__ZERO)) {\r\n        return new Sk.builtin.float_(negative ? -0.0 : 0.0);\r\n    }\r\n    v = BigIntAbs(v);\r\n    w = BigIntAbs(w);\r\n    if (JSBI.greaterThanOrEqual(v, JSBI.multiply(DBL_MIN_OVERFLOW, w))) {\r\n        throw new Sk.builtin.OverflowError(\"int/int too large to represent as a float\");\r\n    }\r\n    let diff = v.toString(2).length - w.toString(2).length;\r\n    const absBigDiff = JSBI.BigInt(diff < 0 ? -diff : diff);\r\n\r\n    if (\r\n        (diff >= 0 && JSBI.greaterThanOrEqual(v, JSBI.multiply(JSBI.exponentiate(BIG_2, absBigDiff), w))) ||\r\n        (diff < 0 && JSBI.greaterThanOrEqual(JSBI.multiply(v, JSBI.exponentiate(BIG_2, absBigDiff)), w))\r\n    ) {\r\n        diff += 1;\r\n    }\r\n    const exp = Math.max(diff, DBL_MIN_EXP) - DBL_MANT_DIG;\r\n    v = JSBI.leftShift(v, JSBI.BigInt(Math.max(-exp, 0)));\r\n    w = JSBI.leftShift(w, JSBI.BigInt(Math.max(exp, 0)));\r\n\r\n    let q = JSBI.divide(v, w);\r\n    const r = JSBI.remainder(v, w);\r\n\r\n    const doubleR = JSBI.multiply(BIG_2, r);\r\n    if (JSBI.greaterThan(doubleR, w) || (JSBI.equal(doubleR, w) && JSBI.equal(JSBI.remainder(q, BIG_2), BIG_1))) {\r\n        q = JSBI.add(q, BIG_1);\r\n    }\r\n    q = JSBI.toNumber(q);\r\n    if (q === Infinity || q === -Infinity) {\r\n        throw new Sk.builtin.OverflowError(\"int/int too large to represent as a float\");\r\n    }\r\n    let res = q * Math.pow(2, exp);\r\n    res = negative ? -res : res;\r\n    return new Sk.builtin.float_(res);\r\n}\r\n\r\nfunction numberDivisionSlot(number_func, bigint_func) {\r\n    return function (other) {\r\n        if (!(other instanceof Sk.builtin.int_)) {\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        }\r\n            let v = this.v;\r\n            let w = other.v;\r\n            if (w === 0) {\r\n                throw new Sk.builtin.ZeroDivisionError(\"integer division or modulo by zero\");\r\n            }\r\n            if (typeof v === \"number\" && typeof w === \"number\") {\r\n                // it's integer division so no need to check if the number got bigger!\r\n                return new Sk.builtin.int_(number_func(v, w));\r\n            }\r\n            v = bigUp(v);\r\n            w = bigUp(w);\r\n        return new Sk.builtin.int_(JSBI.numberIfSafe(bigint_func(v, w)));\r\n    };\r\n}\r\n\r\nfunction numberShiftSlot(number_func, bigint_func) {\r\n    return function (other) {\r\n        if (!(other instanceof Sk.builtin.int_)) {\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n            }\r\n        const wNeg = other.nb$isnegative();\r\n        if (wNeg) {\r\n                    throw new Sk.builtin.ValueError(\"negative shift count\");\r\n                }\r\n        let v = this.v;\r\n        if (v === 0) {\r\n            return new Sk.builtin.int_(0);\r\n                    }\r\n        let w = other.v;\r\n        if (typeof v === \"number\" && typeof w === \"number\" && w < 53) {\r\n            // we use the shiftconsts below in the implementation for << and >>\r\n            const ret = number_func(v, w);\r\n            if (ret !== undefined) {\r\n                return new Sk.builtin.int_(ret);\r\n                }\r\n            }\r\n            v = bigUp(v);\r\n        w = bigUp(w);\r\n        return new Sk.builtin.int_(bigint_func(v, w)); // can't convert if safe for leftshift\r\n    };\r\n}\r\n\r\nfunction numberBitSlot(number_func, bigint_func) {\r\n    return function (other) {\r\n        if (!(other instanceof Sk.builtin.int_)) {\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        }\r\n            let v = this.v;\r\n            let w = other.v;\r\n        if (typeof v === \"number\" && typeof w === \"number\" && Math.abs(v) < 2 ** 31 && Math.abs(w) < 2 ** 31) {\r\n            return new Sk.builtin.int_(number_func(v, w));\r\n            }\r\n            v = bigUp(v);\r\n            w = bigUp(w);\r\n        return new Sk.builtin.int_(JSBI.numberIfSafe(bigint_func(v, w)));\r\n    };\r\n}\r\n\r\nfunction BigIntAbs(v) {\r\n    return JSBI.lessThan(v, JSBI.__ZERO) ? JSBI.unaryMinus(v) : v;\r\n}\r\n\r\nfunction BigIntFloorDivide(v, w) {\r\n    if (JSBI.greaterThanOrEqual(JSBI.bitwiseXor(v, w), JSBI.__ZERO)) {\r\n        return JSBI.divide(v, w);\r\n    }\r\n    // make the numerator smaller and then subtract 1 from the answer to round down.\r\n    if (JSBI.lessThan(v, JSBI.__ZERO)) {\r\n        v = JSBI.add(v, BIG_1);\r\n    } else {\r\n        v = JSBI.subtract(v, BIG_1);\r\n    }\r\n    return JSBI.subtract(JSBI.divide(v, w), BIG_1);\r\n}\r\n\r\nfunction BigIntRound(v, ndigits) {\r\n    // Get absolute versions. We'll deal with the negatives later.\r\n    const isNeg = JSBI.lessThan(v, JSBI.__ZERO);\r\n    if (isNeg) {\r\n        v = JSBI.unaryMinus(v);\r\n    }\r\n    const BigMultiplier = JSBI.exponentiate(JSBI.BigInt(10), JSBI.unaryMinus(JSBI.BigInt(ndigits)));\r\n\r\n    let result = JSBI.divide(v, BigMultiplier);\r\n    const rem = JSBI.remainder(v, BigMultiplier);\r\n\r\n    // if remainder > half divisor\r\n    const doubleRem = JSBI.multiply(rem, BIG_2);\r\n    if (JSBI.greaterThan(doubleRem, BigMultiplier)) {\r\n        result = JSBI.add(result, BIG_1);\r\n        // We should have rounded up instead of down.\r\n    } else if (JSBI.equal(doubleRem, BigMultiplier)) {\r\n        // If the remainder is exactly half the divisor, it means that the result is\r\n        // exactly in between two numbers and we need to apply a specific rounding\r\n        // method.\r\n        if (!Sk.__future__.bankers_rounding) {\r\n            result = JSBI.add(result, BIG_1);\r\n        } else if (JSBI.equal(JSBI.remainder(result, BIG_2), BIG_1)) {\r\n            // Add 1 if result is odd to get an even return value\r\n            result = JSBI.add(result, BIG_1);\r\n        }\r\n    }\r\n\r\n    result = JSBI.multiply(result, BigMultiplier);\r\n    if (isNeg) {\r\n        result = JSBI.unaryMinus(result);\r\n    }\r\n    return new Sk.builtin.int_(result);\r\n}\r\n\r\nconst validUnderscores = /_(?=[^_])/g;\r\n/**\r\n * Takes a JavaScript string and returns a number using the parser and negater\r\n *  functions (for int/long right now)\r\n * @param  {string} s       Javascript string to convert to a number.\r\n * @param  {number|string=} base    The base of the number.\r\n */\r\nSk.str2number = function (s, base) {\r\n    var origs = s,\r\n        neg = false,\r\n        i,\r\n        ch,\r\n        val;\r\n    // strip whitespace from ends\r\n    // s = s.trim();\r\n    s = s.replace(/^\\s+|\\s+$/g, \"\");\r\n\r\n    // check for minus sign\r\n    if (s.charAt(0) === \"-\") {\r\n        neg = true;\r\n        s = s.substring(1);\r\n    }\r\n\r\n    // check for plus sign\r\n    if (s.charAt(0) === \"+\") {\r\n        s = s.substring(1);\r\n    }\r\n\r\n    if (base === null || base === undefined) {\r\n        base = 10;\r\n    } // default radix is 10, not dwim\r\n    if (base < 2 || base > 36) {\r\n        if (base !== 0) {\r\n            throw new Sk.builtin.ValueError(\"int() base must be >= 2 and <= 36\");\r\n        }\r\n    }\r\n    if (typeof base === \"string\") {\r\n        base = Number(base); // keep closure happy for parseInt\r\n    }\r\n\r\n    if (s.substring(0, 2).toLowerCase() === \"0x\") {\r\n        if (base === 16 || base === 0) {\r\n            s = s.substring(2);\r\n            base = 16;\r\n        } else if (base < 34) {\r\n            throw new Sk.builtin.ValueError(\"invalid literal for int() with base \" + base + \": '\" + origs + \"'\");\r\n        }\r\n    } else if (s.substring(0, 2).toLowerCase() === \"0b\") {\r\n        if (base === 2 || base === 0) {\r\n            s = s.substring(2);\r\n            base = 2;\r\n        } else if (base < 12) {\r\n            throw new Sk.builtin.ValueError(\"invalid literal for int() with base \" + base + \": '\" + origs + \"'\");\r\n        }\r\n    } else if (s.substring(0, 2).toLowerCase() === \"0o\") {\r\n        if (base === 8 || base === 0) {\r\n            s = s.substring(2);\r\n            base = 8;\r\n        } else if (base < 25) {\r\n            throw new Sk.builtin.ValueError(\"invalid literal for int() with base \" + base + \": '\" + origs + \"'\");\r\n        }\r\n    } else if (s.charAt(0) === \"0\") {\r\n        if (s === \"0\") {\r\n            return 0;\r\n        }\r\n        if (base === 8 || base === 0) {\r\n            base = 8;\r\n        }\r\n    }\r\n\r\n    if (base === 0) {\r\n        base = 10;\r\n    }\r\n\r\n    if (s.indexOf(\"_\") !== -1) {\r\n        if (s.indexOf(\"__\") !== -1) {\r\n            throw new Sk.builtin.ValueError(\"invalid literal for int() with base \" + base + \": '\" + origs + \"'\");\r\n        }\r\n\r\n        if (base !== 10) {\r\n            s = s.replace(validUnderscores, \"\");\r\n        } else {\r\n            // avoid replacing initial `_` if present\r\n            // workaround since closure-compiler errors on lookbehinds\r\n            s = s.charAt(0) + s.substring(1).replace(validUnderscores, \"\");\r\n        }\r\n    }\r\n\r\n    if (s.length === 0) {\r\n        throw new Sk.builtin.ValueError(\"invalid literal for int() with base \" + base + \": '\" + origs + \"'\");\r\n    }\r\n\r\n    // check all characters are valid\r\n    for (i = 0; i < s.length; i = i + 1) {\r\n        ch = s.charCodeAt(i);\r\n        val = base;\r\n        if (ch >= 48 && ch <= 57) {\r\n            // 0-9\r\n            val = ch - 48;\r\n        } else if (ch >= 65 && ch <= 90) {\r\n            // A-Z\r\n            val = ch - 65 + 10;\r\n        } else if (ch >= 97 && ch <= 122) {\r\n            // a-z\r\n            val = ch - 97 + 10;\r\n        }\r\n\r\n        if (val >= base) {\r\n            throw new Sk.builtin.ValueError(\"invalid literal for int() with base \" + base + \": '\" + origs + \"'\");\r\n        }\r\n    }\r\n\r\n    if (neg) {\r\n        s = \"-\" + s;\r\n    }\r\n    val = parseInt(s, base);\r\n    if (numberOrStringWithinThreshold(val)) {\r\n        return val; // will convert our string to a number\r\n    }\r\n    return fromStrToBigWithBase(s, base);\r\n};\r\n\r\nSk.builtin.int_.py2$methods = {};\r\n\r\n/**\r\n * \r\n * @param {string} s \r\n * @param {number=} base \r\n */\r\nSk.longFromStr = function (s, base) {\r\n    if (Sk.__future__.python3) {\r\n    return new Sk.builtin.int_(stringToNumberOrBig(s));\r\n    } else {\r\n        const num = Sk.str2number(s, base);\r\n        return new Sk.builtin.lng(num);\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.longFromStr\", Sk.longFromStr);\r\n\r\n\r\nfunction numberOrStringWithinThreshold(v) {\r\n    return v <= Number.MAX_SAFE_INTEGER && v >= -Number.MAX_SAFE_INTEGER;\r\n}\r\n\r\nSk.builtin.int_.withinThreshold = numberOrStringWithinThreshold;\r\n\r\nfunction stringToNumberOrBig(s) {\r\n    if (s <= Number.MAX_SAFE_INTEGER && s >= -Number.MAX_SAFE_INTEGER) {\r\n        return +s;\r\n    }\r\n    return JSBI.BigInt(s);\r\n}\r\n\r\nSk.builtin.int_.stringToNumberOrBig = stringToNumberOrBig;\r\nfunction bigUp(v) {\r\n    if (typeof v === \"number\") {\r\n        return JSBI.BigInt(v);\r\n    }\r\n    return v;\r\n}\r\n\r\n\r\nfunction getInt(x, base) {\r\n    let func, res;\r\n    // if base is not of type int, try calling .__index__\r\n    if (base !== Sk.builtin.none.none$) {\r\n        base = Sk.misceval.asIndexOrThrow(base);\r\n    } else {\r\n        base = null;\r\n    }\r\n\r\n    if (x instanceof Sk.builtin.str) {\r\n        if (base === null) {\r\n            base = 10;\r\n        }\r\n        return new Sk.builtin.int_(Sk.str2number(x.v, base));\r\n    } else if (base !== null) {\r\n        throw new Sk.builtin.TypeError(\"int() can't convert non-string with explicit base\");\r\n    } else if (x.nb$int) {\r\n        return x.nb$int();\r\n    }\r\n\r\n    if ((func = Sk.abstr.lookupSpecial(x, Sk.builtin.str.$trunc))) {\r\n        res = Sk.misceval.callsimArray(func, []);\r\n        // check return type of magic methods\r\n        if (!Sk.builtin.checkInt(res)) {\r\n            throw new Sk.builtin.TypeError(\r\n                Sk.builtin.str.$trunc.$jsstr() + \" returned non-Integral (type \" + Sk.abstr.typeName(x) + \")\"\r\n            );\r\n        }\r\n        return new Sk.builtin.int_(res.v);\r\n    }\r\n\r\n    throw new Sk.builtin.TypeError(\r\n        \"int() argument must be a string, a bytes-like object or a number, not '\" + Sk.abstr.typeName(x) + \"'\"\r\n    );\r\n}\r\n\r\n/**\r\n *\r\n * We don't need to check the string has valid digits since str2number did that for us\r\n * @param {*} s\r\n * @param {*} base\r\n * @ignore\r\n */\r\nfunction fromStrToBigWithBase(s, base) {\r\n    let neg = false;\r\n    if (s[0] === \"-\") {\r\n        neg = true;\r\n        s = s.substring(1);\r\n    }\r\n    base = JSBI.BigInt(base);\r\n    let power = BIG_1;\r\n    let num = JSBI.__ZERO;\r\n    let toadd, val;\r\n    for (let i = s.length - 1; i >= 0; i--) {\r\n        val = s.charCodeAt(i);\r\n        if (val >= 48 && val <= 57) {\r\n            // 0-9\r\n            val = val - 48;\r\n        } else if (val >= 65 && val <= 90) {\r\n            // A-Z\r\n            val = val - 65 + 10;\r\n        } else if (val >= 97 && val <= 122) {\r\n            // a-z\r\n            val = val - 97 + 10;\r\n        }\r\n        toadd = JSBI.multiply(JSBI.BigInt(val), power);\r\n        num = JSBI.add(num, toadd);\r\n        power = JSBI.multiply(power, base);\r\n    }\r\n    if (neg) {\r\n        num = JSBI.multiply(num, JSBI.BigInt(-1));\r\n    }\r\n    return num;\r\n}\r\n\r\nconst shiftconsts = [\r\n    0.5, 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288,\r\n    1048576, 2097152, 4194304, 8388608, 16777216, 33554432, 67108864, 134217728, 268435456, 536870912, 1073741824,\r\n    2147483648, 4294967296, 8589934592, 17179869184, 34359738368, 68719476736, 137438953472, 274877906944,\r\n    549755813888, 1099511627776, 2199023255552, 4398046511104, 8796093022208, 17592186044416, 35184372088832,\r\n    70368744177664, 140737488355328, 281474976710656, 562949953421312, 1125899906842624, 2251799813685248,\r\n    4503599627370496, 9007199254740992,\r\n];\r\n\r\n\r\n/**\r\n * @constructor\r\n *\r\n * @description\r\n * This is only for backward compatibility with py2. \r\n * We take the approach of using a trivial subclass with int and overriding a few methods\r\n *\r\n * @param {number|string|JSBI} x \r\n * @extends {Sk.builtin.int_}\r\n * @ignore\r\n */\r\nSk.builtin.lng = Sk.abstr.buildNativeClass(\"long\", {\r\n    base: Sk.builtin.int_, // not technically correct but makes backward compatibility easy\r\n    constructor: function lng (x) {\r\n        Sk.builtin.int_.call(this, x);\r\n    },\r\n    slots: /** @lends {Sk.builtin.lng.prototype} */{\r\n        $r() {\r\n            return new Sk.builtin.str(this.v.toString() + \"L\");\r\n        },\r\n        tp$as_number: true,\r\n        nb$negative() {\r\n            return new Sk.builtin.lng(intProto.nb$negative.call(this).v);\r\n        },\r\n        nb$positive() {\r\n            return new Sk.builtin.lng(intProto.nb$positive.call(this).v);\r\n        },\r\n    },\r\n});\r\n\r\nconst intProto = Sk.builtin.int_.prototype;\r\n","Sk.internalPy={\"files\":{\"src/classmethod.py\":\"class classmethod(object):\\n    \\\"Emulate PyClassMethod_Type() in Objects/funcobject.c\\\"\\n\\n    def __init__(self, f):\\n        self.f = f\\n\\n    def __get__(self, obj, klass=None):\\n        if klass is None:\\n            klass = type(obj)\\n\\n        def newfunc(*args):\\n            return self.f(klass, *args)\\n\\n        return newfunc\\n\",\"src/property.py\":\"class property(object):\\n    \\\"Emulate PyProperty_Type() in Objects/descrobject.c\\\"\\n\\n    def __init__(self, fget=None, fset=None, fdel=None, doc=None):\\n        self.fget = fget\\n        self.fset = fset\\n        self.fdel = fdel\\n        if doc is None and fget is not None:\\n            if hasattr(fget, '__doc__'):\\n                doc = fget.__doc__\\n            else:\\n                doc = None\\n        self.__doc__ = doc\\n\\n    def __get__(self, obj, objtype=None):\\n        if obj is None:\\n            return self\\n        if self.fget is None:\\n            raise AttributeError(\\\"unreadable attribute\\\")\\n        return self.fget(obj)\\n\\n    def __set__(self, obj, value):\\n        if self.fset is None:\\n            raise AttributeError(\\\"can't set attribute\\\")\\n        self.fset(obj, value)\\n\\n    def __delete__(self, obj):\\n        if self.fdel is None:\\n            raise AttributeError(\\\"can't delete attribute\\\")\\n        self.fdel(obj)\\n\\n    def getter(self, fget):\\n        return type(self)(fget, self.fset, self.fdel, self.__doc__)\\n\\n    def setter(self, fset):\\n        return type(self)(self.fget, fset, self.fdel, self.__doc__)\\n\\n    def deleter(self, fdel):\\n        return type(self)(self.fget, self.fset, fdel, self.__doc__)\\n\",\"src/staticmethod.py\":\"class staticmethod(object):\\n    \\\"Emulate PyStaticMethod_Type() in Objects/funcobject.c\\\"\\n\\n    def __init__(self, f):\\n        self.f = f\\n\\n    def __get__(self, obj, objtype=None):\\n        return self.f\\n\"}}","/**\r\n * @constructor\r\n * @param {Array} L\r\n *\r\n * @extends {Sk.builtin.object}\r\n */\r\nSk.builtin.list = Sk.abstr.buildNativeClass(\"list\", {\r\n    constructor: function list(L) {\r\n        // this is an internal function and should be called with an array object\r\n        if (L === undefined) {\r\n            L = [];\r\n        } else if (!Array.isArray(L)) {\r\n            L = Sk.misceval.arrayFromIterable(L);\r\n            // internal calls to constructor can't suspend - avoid using this;\r\n        }\r\n        Sk.asserts.assert(this instanceof Sk.builtin.list, \"bad call to list, use 'new' with an Array of python objects\");\r\n        this.v = L;\r\n        this.in$repr = false;\r\n    },\r\n    slots: /** @lends {Sk.builtin.list.prototype}*/ {\r\n        tp$getattr: Sk.generic.getAttr,\r\n        tp$as_sequence_or_mapping: true,\r\n        tp$hash: Sk.builtin.none.none$,\r\n        tp$doc:\r\n            \"Built-in mutable sequence.\\n\\nIf no argument is given, the constructor creates a new empty list.\\nThe argument must be an iterable if specified.\",\r\n        tp$new: Sk.generic.new,\r\n        tp$init(args, kwargs) {\r\n            // this will be an Sk.builtin.list.prototype or a sk$klass.prototype that inherits from Sk.builtin.list.prototype\r\n            Sk.abstr.checkNoKwargs(\"list\", kwargs);\r\n            Sk.abstr.checkArgsLen(\"list\", args, 0, 1);\r\n            return Sk.misceval.chain(Sk.misceval.arrayFromIterable(args[0], true), (L) => {\r\n                this.v = L;\r\n            });\r\n        },\r\n        $r() {\r\n            if (this.in$repr) {\r\n                return new Sk.builtin.str(\"[...]\");\r\n            }\r\n            this.in$repr = true;\r\n            const ret = this.v.map((x) => Sk.misceval.objectRepr(x));\r\n            this.in$repr = false;\r\n            return new Sk.builtin.str(\"[\" + ret.join(\", \") + \"]\");\r\n        },\r\n        tp$richcompare: Sk.generic.seqCompare,\r\n        tp$iter() {\r\n            return new list_iter_(this);\r\n        },\r\n\r\n        // sequence and mapping slots\r\n        sq$length() {\r\n            return this.v.length;\r\n        },\r\n        sq$concat(other) {\r\n            if (!(other instanceof Sk.builtin.list)) {\r\n                throw new Sk.builtin.TypeError(\"can only concatenate list to list\");\r\n            }\r\n            return new Sk.builtin.list(this.v.concat(other.v));\r\n        },\r\n        sq$contains(item) {\r\n            for (let it = this.tp$iter(), i = it.tp$iternext(); i !== undefined; i = it.tp$iternext()) {\r\n                if (i === item || Sk.misceval.richCompareBool(i, item, \"Eq\")) {\r\n                    return true;\r\n                }\r\n            }\r\n            return false;\r\n        },\r\n        sq$repeat(n) {\r\n            if (!Sk.misceval.isIndex(n)) {\r\n                throw new Sk.builtin.TypeError(\"can't multiply sequence by non-int of type '\" + Sk.abstr.typeName(n) + \"'\");\r\n            }\r\n            n = Sk.misceval.asIndexSized(n, Sk.builtin.OverflowError);\r\n            if (n * this.v.length > Number.MAX_SAFE_INTEGER) {\r\n                throw new Sk.builtin.OverflowError();\r\n            }\r\n            const ret = [];\r\n            for (let i = 0; i < n; i++) {\r\n                for (let j = 0; j < this.v.length; j++) {\r\n                    ret.push(this.v[j]);\r\n                }\r\n            }\r\n            return new Sk.builtin.list(ret);\r\n        },\r\n        mp$subscript(index) {\r\n            if (Sk.misceval.isIndex(index)) {\r\n                let i = Sk.misceval.asIndexSized(index, Sk.builtin.IndexError);\r\n                i = this.list$inRange(i, \"list index out of range\");\r\n                return this.v[i];\r\n            } else if (index instanceof Sk.builtin.slice) {\r\n                const ret = [];\r\n                index.sssiter$(this.v.length, (i) => {\r\n                    ret.push(this.v[i]);\r\n                });\r\n                return new Sk.builtin.list(ret);\r\n            }\r\n            throw new Sk.builtin.TypeError(\"list indices must be integers or slices, not \" + Sk.abstr.typeName(index));\r\n        },\r\n        mp$ass_subscript(index, value) {\r\n            if (value === undefined) {\r\n                this.del$subscript(index);\r\n            } else {\r\n                this.ass$subscript(index, value);\r\n            }\r\n        },\r\n        sq$inplace_concat(other) {\r\n            if (other === this) {\r\n                // prevent an infinite loop\r\n                this.v.push(...this.v);\r\n            return this;\r\n            }\r\n            return Sk.misceval.chain(\r\n                Sk.misceval.iterFor(Sk.abstr.iter(other), (i) => {\r\n                    this.v.push(i);\r\n                }),\r\n                () => this\r\n            );\r\n        },\r\n        sq$inplace_repeat(n) {\r\n            if (!Sk.misceval.isIndex(n)) {\r\n                throw new Sk.builtin.TypeError(\"can't multiply sequence by non-int of type '\" + Sk.abstr.typeName(n) + \"'\");\r\n            }\r\n            n = Sk.misceval.asIndexSized(n, Sk.builtin.OverflowError);\r\n            const len = this.v.length;\r\n            if (n <= 0) {\r\n                this.v.length = 0;\r\n            } else if (n * len > Number.MAX_SAFE_INTEGER) {\r\n                throw new Sk.builtin.OverflowError();\r\n            }\r\n\r\n            for (let i = 1; i < n; i++) {\r\n                for (let j = 0; j < len; j++) {\r\n                    this.v.push(this.v[j]);\r\n                }\r\n            }\r\n            return this;\r\n        },\r\n    },\r\n    methods: /** @lends {Sk.builtin.list.prototype}*/ {\r\n        __reversed__: {\r\n            $meth() {\r\n                return new reverselist_iter_(this);\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: \"($self, /)\",\r\n            $doc: \"Return a reverse iterator over the list.\",\r\n        },\r\n        clear: {\r\n            $meth() {\r\n                this.v.length = 0;\r\n                return Sk.builtin.none.none$;\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: \"($self, /)\",\r\n            $doc: \"Remove all items from list.\",\r\n        },\r\n        copy: {\r\n            $meth() {\r\n                return new Sk.builtin.list(this.v.slice(0));\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: \"($self, /)\",\r\n            $doc: \"Return a shallow copy of the list.\",\r\n        },\r\n        append: {\r\n            $meth(item) {\r\n                this.v.push(item);\r\n                return Sk.builtin.none.none$;\r\n            },\r\n            $flags: {OneArg: true},\r\n            $textsig: \"($self, object, /)\",\r\n            $doc: \"Append object to the end of the list.\",\r\n        },\r\n        insert: {\r\n            $meth(i, x) {\r\n                i = Sk.misceval.asIndexSized(i, Sk.builtin.OverflowError);\r\n                const { start } = Sk.builtin.slice.startEnd$wrt(this, i);\r\n                this.v.splice(start, 0, x);\r\n                return Sk.builtin.none.none$;\r\n            },\r\n            $flags: {MinArgs: 2, MaxArgs: 2},\r\n            $textsig: \"($self, index, object, /)\",\r\n            $doc: \"Insert object before index.\",\r\n        },\r\n        extend: {\r\n            $meth(iterable) {\r\n                if (iterable === this) {\r\n                    // prevent an infinite loop\r\n                    this.v = this.v.concat(this.v);\r\n                    return Sk.builtin.none.none$;\r\n                }\r\n                return Sk.misceval.chain(\r\n                \t// TODONEW: Check for performance issue, optimize with concat\r\n                    Sk.misceval.iterFor(Sk.abstr.iter(iterable), (i) => {\r\n                        this.v.push(i);\r\n                    }),\r\n                    () => Sk.builtin.none.none$\r\n                );\r\n            },\r\n            $flags: {OneArg: true},\r\n            $textsig: \"($self, iterable, /)\",\r\n            $doc: \"Extend list by appending elements from the iterable.\",\r\n        },\r\n        pop: {\r\n            $meth(i) {\r\n                if (i === undefined) {\r\n                    i = this.v.length - 1;\r\n                } else {\r\n                    i = Sk.misceval.asIndexSized(i, Sk.builtin.OverflowError);\r\n                }\r\n                i = this.list$inRange(i, \"pop index out of range\");\r\n                const res = this.v[i];\r\n                this.v.splice(i, 1);\r\n                return res;\r\n            },\r\n            $flags: {MinArgs: 0, MaxArgs: 1},\r\n            $textsig: \"($self, index=-1, /)\",\r\n            $doc: \"Remove and return item at index (default last).\\n\\nRaises IndexError if list is empty or index is out of range.\",\r\n        },\r\n        remove: {\r\n            $meth(item) {\r\n                const i = this.list$indexOf(item);\r\n                if (i === -1) {\r\n                    throw new Sk.builtin.ValueError(\"list.remove(x): x not in list\");\r\n                }\r\n                this.v.splice(i, 1);\r\n                return Sk.builtin.none.none$;\r\n            },\r\n            $flags: {OneArg: true},\r\n            $textsig: \"($self, value, /)\",\r\n            $doc: \"Remove first occurrence of value.\\n\\nRaises ValueError if the value is not present.\",\r\n        },\r\n        sort: {\r\n            $meth(args, kwargs) {\r\n                if (args.length) {\r\n                    throw new Sk.builtin.TypeError(\"sort() takes no positional arguments\");\r\n                }\r\n                const [key, reverse] = Sk.abstr.copyKeywordsToNamedArgs(\"sort\", [\"key\", \"reverse\"], args, kwargs, [\r\n                    Sk.builtin.none.none$,\r\n                    Sk.builtin.bool.false$,\r\n                ]);\r\n                return this.list$sort(undefined, key, reverse);\r\n            },\r\n            $flags: {FastCall: true},\r\n            $textsig: \"($self, /, *, key=None, reverse=False)\",\r\n            $doc: \"Stable sort *IN PLACE*.\",\r\n        },\r\n        index: {\r\n            $meth(value, start, stop) {\r\n                if ((start !== undefined && !Sk.misceval.isIndex(start)) || (stop !== undefined && !Sk.misceval.isIndex(stop))) {\r\n                    // unusually can't have None here so check this first...\r\n                    throw new Sk.builtin.TypeError(\"slice indices must be integers or have an __index__ method\");\r\n                }\r\n                const i = this.list$indexOf(value, start, stop);\r\n                if (i === -1) {\r\n                    throw new Sk.builtin.ValueError(Sk.misceval.objectRepr(value) + \" is not in list\");\r\n                }\r\n                return new Sk.builtin.int_(i);\r\n            },\r\n            $flags: {MinArgs: 1, MaxArgs: 3},\r\n            $textsig: \"($self, value, start=0, stop=sys.maxsize, /)\",\r\n            $doc: \"Return first index of value.\\n\\nRaises ValueError if the value is not present.\",\r\n        },\r\n        count: {\r\n            $meth(item) {\r\n                let count = 0;\r\n                const len = this.v.length;\r\n                for (let i = 0; i < len; i++) {\r\n                    if (this.v[i] === item || Sk.misceval.richCompareBool(this.v[i], item, \"Eq\")) {\r\n                        count += 1;\r\n                    }\r\n                }\r\n                return new Sk.builtin.int_(count);\r\n            },\r\n            $flags: {OneArg: true},\r\n            $textsig: \"($self, value, /)\",\r\n            $doc: \"Return number of occurrences of value.\",\r\n        },\r\n        reverse: {\r\n            $meth() {\r\n                this.list$reverse();\r\n                return Sk.builtin.none.none$;\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: \"($self, /)\",\r\n            $doc: \"Reverse *IN PLACE*.\",\r\n        },\r\n    },\r\n    classmethods: Sk.generic.classGetItem,\r\n    proto: /** @lends {Sk.builtin.list.prototype}*/ {\r\n        sk$asarray() {\r\n            return this.v.slice(0);\r\n        },\r\n        list$sort,\r\n        list$inRange(i, msg) {\r\n            if (i < 0) {\r\n                i += this.v.length;\r\n            }\r\n            if (i >= 0 && i < this.v.length) {\r\n                return i;\r\n            }\r\n            throw new Sk.builtin.IndexError(msg);\r\n        },\r\n        list$indexOf(item, start, end) {\r\n            ({ start, end } = Sk.builtin.slice.startEnd$wrt(this, start, end));\r\n            for (let i = start; i < end && i < this.v.length; i++) {\r\n                if (this.v[i] === item || Sk.misceval.richCompareBool(this.v[i], item, \"Eq\")) {\r\n                    return i;\r\n        }\r\n            }\r\n            return -1;\r\n        },\r\n        list$reverse() {\r\n            this.v.reverse();\r\n        },\r\n        ass$subscript(index, value) {\r\n            if (Sk.misceval.isIndex(index)) {\r\n                this.ass$index(index, value);\r\n    } else if (index instanceof Sk.builtin.slice) {\r\n                const { start, stop, step } = index.slice$indices(this.v.length);\r\n                if (step === 1) {\r\n                    this.ass$slice(start, stop, value);\r\n        } else {\r\n                    this.ass$ext_slice(index, value);\r\n            }\r\n            } else {\r\n                throw new Sk.builtin.TypeError(\"list indices must be integers or slices, not \" + Sk.abstr.typeName(index));\r\n            }\r\n        },\r\n        ass$index(index, value) {\r\n            let i = Sk.misceval.asIndexSized(index, Sk.builtin.IndexError);\r\n            i = this.list$inRange(i, \"list assignment index out of range\");\r\n            this.v[i] = value;\r\n        },\r\n        ass$slice(start, stop, iterable) {\r\n            if (!Sk.builtin.checkIterable(iterable)) {\r\n                throw new Sk.builtin.TypeError(\"can only assign an iterable\");\r\n        }\r\n            const vals = Sk.misceval.arrayFromIterable(iterable);\r\n            this.v.splice(start, stop - start, ...vals);\r\n        },\r\n        ass$ext_slice(slice, iterable) {\r\n            const indices = [];\r\n            slice.sssiter$(this.v.length, (i) => {\r\n                indices.push(i);\r\n            });\r\n            if (!Sk.builtin.checkIterable(iterable)) {\r\n                throw new Sk.builtin.TypeError(\"must assign iterable to extended slice\");\r\n    }\r\n            const vals = Sk.misceval.arrayFromIterable(iterable);\r\n            if (indices.length !== vals.length) {\r\n                throw new Sk.builtin.ValueError(\"attempt to assign sequence of size \" + vals.length + \" to extended slice of size \" + indices.length);\r\n            }\r\n            for (let i = 0; i < indices.length; i++) {\r\n                this.v.splice(indices[i], 1, vals[i]);\r\n        }\r\n        },\r\n        del$subscript(index) {\r\n            if (Sk.misceval.isIndex(index)) {\r\n                this.del$index(index);\r\n    } else if (index instanceof Sk.builtin.slice) {\r\n                const { start, stop, step } = index.slice$indices(this.v.length);\r\n                if (step === 1) {\r\n                    this.del$slice(start, stop);\r\n        } else {\r\n                    this.del$ext_slice(index, step > 0 ? 1 : 0);\r\n    }\r\n            } else {\r\n    throw new Sk.builtin.TypeError(\"list indices must be integers, not \" + Sk.abstr.typeName(index));\r\n    }\r\n        },\r\n        del$index(index) {\r\n            let i = Sk.misceval.asIndexSized(index, Sk.builtin.IndexError);\r\n            i = this.list$inRange(i, \"list assignment index out of range\");\r\n            this.v.splice(i, 1);\r\n        },\r\n        del$slice(start, stop) {\r\n            this.v.splice(start, stop - start);\r\n        },\r\n        del$ext_slice(slice, offdir) {\r\n            let dec = 0; // offset of removal for next index (because we'll have removed, but the iterator is giving orig indices)\r\n            slice.sssiter$(this.v.length, (i) => {\r\n                this.v.splice(i - dec, 1);\r\n                dec += offdir;\r\n            });\r\n        },\r\n    },\r\n});\r\n\r\nSk.exportSymbol(\"Sk.builtin.list\", Sk.builtin.list);\r\n\r\n/**\r\n * @function\r\n * \r\n * @param {?=} cmp optional (not supported in py3)\r\n * @param {?=} key optional (keyword only argument in py3)\r\n * @param {?=} reverse optional (keyword only argument in py3)\r\n * \r\n * @private\r\n */\r\nfunction list$sort(cmp, key, reverse) {\r\n    const has_key = key != null && key !== Sk.builtin.none.none$;\r\n    const has_cmp = cmp != null && cmp !== Sk.builtin.none.none$;\r\n    let rev, item;\r\n    if (reverse === undefined) {\r\n        rev = false;\r\n    } else if (!Sk.builtin.checkInt(reverse)) {\r\n        throw new Sk.builtin.TypeError(\"an integer is required\");\r\n    } else {\r\n        rev = Sk.misceval.isTrue(reverse);\r\n    }\r\n    const timsort = new Sk.builtin.timSort(this);\r\n\r\n    this.v = [];\r\n    const zero = new Sk.builtin.int_(0);\r\n\r\n    if (has_key) {\r\n        if (has_cmp) {\r\n            timsort.lt = function (a, b) {\r\n                var res = Sk.misceval.callsimArray(cmp, [a[0], b[0]]);\r\n                return Sk.misceval.richCompareBool(res, zero, \"Lt\");\r\n            };\r\n        } else {\r\n            timsort.lt = function (a, b) {\r\n                return Sk.misceval.richCompareBool(a[0], b[0], \"Lt\");\r\n            };\r\n        }\r\n        for (let i = 0; i < timsort.listlength; i++) {\r\n            item = timsort.list.v[i];\r\n            const keyvalue = Sk.misceval.callsimArray(key, [item]);\r\n            timsort.list.v[i] = [keyvalue, item];\r\n        }\r\n    } else if (has_cmp) {\r\n        timsort.lt = function (a, b) {\r\n            var res = Sk.misceval.callsimArray(cmp, [a, b]);\r\n            return Sk.misceval.richCompareBool(res, zero, \"Lt\");\r\n        };\r\n    }\r\n\r\n    if (rev) {\r\n        timsort.list.list$reverse();\r\n    }\r\n\r\n    timsort.sort();\r\n\r\n    if (rev) {\r\n        timsort.list.list$reverse();\r\n    }\r\n\r\n    if (has_key) {\r\n        for (let j = 0; j < timsort.listlength; j++) {\r\n            item = timsort.list.v[j][1];\r\n            timsort.list.v[j] = item;\r\n        }\r\n    }\r\n\r\n    const mucked = this.sq$length() > 0;\r\n\r\n    this.v = timsort.list.v;\r\n\r\n    if (mucked) {\r\n        throw new Sk.builtin.ValueError(\"list modified during sort\");\r\n    }\r\n\r\n    return Sk.builtin.none.none$;\r\n};\r\n\r\nSk.builtin.list.py2$methods = {\r\n    sort: {\r\n        $name: \"sort\",\r\n        $meth(args, kwargs) {\r\n            const [cmp, key, reverse] = Sk.abstr.copyKeywordsToNamedArgs(\"sort\", [\"cmp\", \"key\", \"reverse\"], args, kwargs, [\r\n                Sk.builtin.none.none$,\r\n                Sk.builtin.none.none$,\r\n                Sk.builtin.bool.false$,\r\n            ]);\r\n            return this.list$sort(cmp, key, reverse);\r\n        },\r\n        $flags: {\r\n            FastCall: true, // named args might be better here but one of the args is pyFalse\r\n            // and bool class does not exist yet. So use FastCall instead.\r\n        },\r\n        $textsig: \"($self, cmp=None, key=None, reverse=False)\",\r\n        $doc: \"Stable sort *IN PLACE*.\",\r\n    },\r\n};\r\n\r\n/**\r\n * @constructor\r\n * @extends {Sk.builtin.object}\r\n * @param {Sk.builtin.list} lst\r\n * @private\r\n */\r\nvar list_iter_ = Sk.abstr.buildIteratorClass(\"list_iterator\", {\r\n    constructor: function list_iter_(lst) {\r\n        this.$index = 0;\r\n        this.$seq = lst.v;\r\n    },\r\n    iternext: Sk.generic.iterNextWithArray,\r\n    methods: {\r\n        __length_hint__: Sk.generic.iterLengthHintWithArrayMethodDef,\r\n    },\r\n    flags: { sk$unacceptableBase: true },\r\n});\r\n\r\n/**\r\n * @constructor\r\n * @extends {Sk.builtin.object}\r\n * @param {Sk.builtin.list} lst\r\n * @private\r\n */\r\nvar reverselist_iter_ = Sk.abstr.buildIteratorClass(\"list_reverseiterator\", {\r\n    constructor: function reverselist_iter_(lst) {\r\n        this.$index = lst.v.length - 1;\r\n        this.$seq = lst.v;\r\n    },\r\n    iternext() {\r\n        const item = this.$seq[this.$index--];\r\n        if (item === undefined) {\r\n            this.tp$iternext = () => undefined;\r\n            return undefined;\r\n        }\r\n        return item;\r\n    },\r\n    methods: {\r\n        __length_hint__: Sk.generic.iterReverseLengthHintMethodDef,\r\n    },\r\n    flags: { sk$unacceptableBase: true },\r\n});\r\n","/* jshint ignore:start */\r\n\r\n// This file list is only used for testing.\r\n// It should be kept in sync with ../skulpt.py.\r\n// Order is important!\r\n\r\nrequire(\"./util.js\");\r\n\r\n// Global support functions\r\nSk.global[\"strftime\"] = require(\"strftime\");\r\nrequire(\"../support/polyfills/JSBI\");\r\nrequire(\"../support/polyfills/es6\");\r\nrequire(\"setimmediate\");\r\n\r\n// Skulpt\r\nrequire(\"assert\");\r\nrequire(\"./env.js\");\r\nrequire(\"./type.js\");\r\nrequire(\"./generic.js\");\r\nrequire(\"./check.js\");\r\nrequire(\"./abstract.js\");\r\nrequire(\"./object.js\");\r\nrequire(\"./slotdefs.js\");\r\nrequire(\"./descr.js\");\r\n// can only setUpMethods / setUpGetsets / setUpSlots from now.\r\nrequire(\"./sk_method.js\");\r\n// can only do setUpSlots with tp$new from now since __new__ is a sk_method\r\n[Sk.builtin.object, Sk.builtin.type].forEach((cls) => {\r\n    Sk.abstr.setUpSlots(cls);\r\n    Sk.abstr.setUpMethods(cls);\r\n    Sk.abstr.setUpGetSets(cls);\r\n});\r\nrequire(\"./nonetype\");\r\nrequire(\"./formatting.js\");\r\nrequire(\"./str.js\");\r\n\r\n[Sk.builtin.str, Sk.builtin.none, Sk.builtin.NotImplemented, Sk.builtin.object].forEach((cls) => {\r\n    const cls_proto = cls.prototype;\r\n    cls_proto.__doc__ = cls_proto.hasOwnProperty(\"tp$doc\") ? new Sk.builtin.str(cls_proto.tp$doc) : Sk.builtin.none.none$;\r\n});\r\n\r\nrequire(\"./function.js\");\r\nrequire(\"./builtin.js\");\r\nrequire(\"./errors.js\");\r\nrequire(\"./method.js\");\r\nrequire(\"./misceval.js\");\r\nrequire(\"./simple_iterators.js\");\r\nrequire(\"./list.js\");\r\nrequire(\"./str.js\");\r\nrequire(\"./formatting.js\");\r\nrequire(\"./bytes.js\");\r\nrequire(\"./tuple.js\");\r\nrequire(\"./dict.js\");\r\nrequire(\"./dictviews.js\");\r\nrequire(\"./mappingproxy.js\");\r\nrequire(\"./property_class_static.js\");\r\nrequire(\"./int.js\");\r\nrequire(\"./bool.js\");\r\nrequire(\"./float.js\");\r\nrequire(\"./complex.js\");\r\nrequire(\"./slice.js\");\r\nrequire(\"./set.js\");\r\nrequire(\"./print.js\");\r\nrequire(\"./module.js\");\r\nrequire(\"./structseq.js\");\r\nrequire(\"./generator.js\");\r\nrequire(\"./file.js\");\r\nrequire(\"./ffi.js\");\r\nrequire(\"./range.js\");\r\nrequire(\"./enumerate.js\");\r\nrequire(\"./filter.js\");\r\nrequire(\"./map.js\");\r\nrequire(\"./reversed.js\");\r\nrequire(\"./zip.js\");\r\nrequire(\"./token.js\");\r\nrequire(\"./tokenize.js\");\r\nrequire(\"../gen/parse_tables.js\");\r\nrequire(\"./parser.js\");\r\nrequire(\"../gen/astnodes.js\");\r\nrequire(\"./ast.js\");\r\nrequire(\"./symtable.js\");\r\nrequire(\"./compile.js\");\r\nrequire(\"./import.js\");\r\nrequire(\"./timsort.js\");\r\nrequire(\"./super.js\");\r\nrequire(\"./generic_alias.js\");\r\nrequire(\"./builtindict.js\");\r\nrequire(\"./constants.js\");\r\nrequire(\"./internalpython.js\");\r\n\r\n/* jshint ignore:end */\r\n","/**\r\n * @constructor\r\n * @param {Sk.builtin.func} func\r\n * @param {Array} array of iterators\r\n * @extends Sk.builtin.object\r\n */\r\nSk.builtin.map_ = Sk.abstr.buildIteratorClass(\"map\", {\r\n    constructor: function map_(func, iters) {\r\n        this.$func = func;\r\n        this.$iters = iters;\r\n    },\r\n    iternext(canSuspend) {\r\n        const args = [];\r\n        const ret = Sk.misceval.chain(\r\n            Sk.misceval.iterArray(this.$iters, (it) =>\r\n                Sk.misceval.chain(it.tp$iternext(canSuspend), (i) => {\r\n                    if (i === undefined) {\r\n                        return new Sk.misceval.Break(true);\r\n                    }\r\n                    args.push(i);\r\n                })\r\n            ),\r\n            (endmap) => (endmap ? undefined : Sk.misceval.callsimOrSuspendArray(this.$func, args))\r\n        );\r\n        return canSuspend ? ret : Sk.misceval.retryOptionalSuspensionOrThrow(ret);\r\n    },\r\n    slots: {\r\n        tp$doc:\r\n            \"map(func, *iterables) --> map object\\n\\nMake an iterator that computes the function using arguments from\\neach of the iterables.  Stops when the shortest iterable is exhausted.\",\r\n        tp$new(args, kwargs) {\r\n            if (this === Sk.builtin.map_.prototype) {\r\n                Sk.abstr.checkNoKwargs(\"map\", kwargs);\r\n            }\r\n            Sk.abstr.checkArgsLen(\"map\", args, 2);\r\n            const func = args[0];\r\n            const iters = [];\r\n            for (let i = 1; i < args.length; i++) {\r\n                iters.push(Sk.abstr.iter(args[i]));\r\n        }\r\n            if (this === Sk.builtin.map_.prototype) {\r\n                return new Sk.builtin.map_(func, iters);\r\n                } else {\r\n                const instance = new this.constructor();\r\n                Sk.builtin.map_.call(instance, func, iters);\r\n                return instance;\r\n            }\r\n        },\r\n    },\r\n});\r\n\r\nSk.exportSymbol(\"Sk.builtin.map_\", Sk.builtin.map_);\r\n","/**\r\n *\r\n * @constructor\r\n *\r\n * @param {Object} d\r\n *\r\n * @description\r\n * This should be called with the prototype of a type object\r\n * It returns a mapping proxy\r\n * useful for when we do typeobject.__dict__\r\n * or module.__dict__ since a module $d is an object literal\r\n *\r\n * Internally this should be called with an object literal\r\n * from python this can be called with a dict instance (or @todo other mapping type)\r\n *\r\n * For internal object literals we create a dict object whose internal representation of\r\n * this.entries is created on the fly (when requested)\r\n *\r\n * We could potentially memoise the entries for static objects (builtin types @todo)\r\n * The problem with memoising for all type objects is that the mappingproxy\r\n * is a live view of the mapping rather than a static copy\r\n *\r\n * ```python\r\n * >>> x = A.__dict__\r\n * >>> A.foo = 'bar'\r\n * >>> x['foo']\r\n * 'bar'\r\n * ```\r\n *\r\n */\r\nSk.builtin.mappingproxy = Sk.abstr.buildNativeClass(\"mappingproxy\", {\r\n    constructor: function mappingproxy(d) {\r\n        Sk.asserts.assert(this instanceof Sk.builtin.mappingproxy, \"bad call to mapping proxy, use 'new'\");\r\n        this.mapping = new Sk.builtin.dict([]);\r\n        if (d !== undefined) {\r\n            // internal call so d is an object literal\r\n            // adust this.mapping.entries to be a custom getter\r\n            // allowing support for dynamic object literals\r\n            customEntriesGetter(this.mapping, d);\r\n        }\r\n    },\r\n    slots: {\r\n        tp$getattr: Sk.generic.getAttr,\r\n        tp$as_sequence_or_mapping: true,\r\n        tp$hash: Sk.builtin.none.none$,\r\n        tp$new(args, kwargs) {\r\n            Sk.abstr.checkNoKwargs(\"mappingproxy\", kwargs);\r\n            Sk.abstr.checkOneArg(\"mappingproxy\", args, kwargs);\r\n            const mapping = args[0];\r\n            if (!Sk.builtin.checkMapping(mapping)) {\r\n                throw new Sk.builtin.TypeError(\"mappingproxy() argument must be a mapping, not \" + Sk.abstr.typeName(mapping));\r\n            }\r\n            const mp = new Sk.builtin.mappingproxy();\r\n            mp.mapping = mapping;\r\n            return mp;\r\n        },\r\n        tp$richcompare(other, op) {\r\n            return Sk.misceval.richCompareBool(this.mapping, other, op);\r\n        },\r\n        tp$str() {\r\n            return this.mapping.tp$str();\r\n        },\r\n        $r() {\r\n            return new Sk.builtin.str(\"mappingproxy(\" + Sk.misceval.objectRepr(this.mapping) + \")\");\r\n        },\r\n        mp$subscript(key, canSuspend) {\r\n            return this.mapping.mp$subscript(key, canSuspend);\r\n    },\r\n        sq$contains(key) {\r\n            return this.mapping.sq$contains(key);\r\n    },\r\n        sq$length() {\r\n            return this.mapping.sq$length();\r\n        },\r\n        tp$iter() {\r\n            return this.mapping.tp$iter();\r\n        },\r\n        tp$as_number: true,\r\n        nb$or(other) {\r\n            if (other instanceof Sk.builtin.mappingproxy) {\r\n                other = other.mapping;\r\n            }\r\n            return Sk.abstr.numberBinOp(this.mapping, other, \"BitOr\");\r\n        },\r\n        nb$reflected_or(other) {\r\n            if (other instanceof Sk.builtin.mappingproxy) {\r\n                other = other.mapping;\r\n            }\r\n            return Sk.abstr.numberBinOp(other, this.mapping, \"BitOr\");\r\n        },\r\n        nb$inplace_or(other) {\r\n            throw new Sk.builtin.TypeError(\"'|=' is not supported by \" + Sk.abstr.typeName(this) + \"; use '|' instead\");\r\n        },\r\n    },\r\n    methods: {\r\n        get: {\r\n            $meth(args, kwargs) {\r\n                return Sk.misceval.callsimArray(this.mapping.tp$getattr(this.str$get), args, kwargs);\r\n            },\r\n            $flags: { FastCall: true },\r\n            $textsig: null,\r\n            $doc: \"D.get(k[,d]) -> D[k] if k in D, else d.  d defaults to None.\",\r\n        },\r\n        keys: {\r\n            $meth() {\r\n                return Sk.misceval.callsimArray(this.mapping.tp$getattr(this.str$keys), []);\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc: \"D.keys() -> a set-like object providing a view on D's keys\",\r\n        },\r\n        items: {\r\n            $meth() {\r\n                return Sk.misceval.callsimArray(this.mapping.tp$getattr(this.str$items), []);\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc: \"D.items() -> a set-like object providing a view on D's items\",\r\n        },\r\n        values: {\r\n            $meth() {\r\n                return Sk.misceval.callsimArray(this.mapping.tp$getattr(this.str$values), []);\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc: \"D.values() -> a set-like object providing a view on D's values\",\r\n        },\r\n        copy: {\r\n            $meth() {\r\n                return Sk.misceval.callsimArray(this.mapping.tp$getattr(this.str$copy), []);\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc: \"D.copy() -> a shallow copy of D\",\r\n        },\r\n    },\r\n    classmethods: Sk.generic.classGetItem,\r\n    proto: {\r\n        str$get: new Sk.builtin.str(\"get\"),\r\n        str$copy: new Sk.builtin.str(\"copy\"),\r\n        str$keys: new Sk.builtin.str(\"keys\"),\r\n        str$items: new Sk.builtin.str(\"items\"),\r\n        str$values: new Sk.builtin.str(\"values\"),\r\n        mp$lookup(key) {\r\n            return this.mapping.mp$lookup(key);\r\n        },\r\n    },\r\n    flags: {\r\n        sk$unacceptableBase: true,\r\n    },\r\n});\r\n\r\nfunction customEntriesGetter(mapping, d) {\r\n    Object.defineProperties(mapping, {\r\n        entries: {\r\n            get: () => {\r\n                const entries = Object.create(null);\r\n                Object.entries(d).forEach(([key, val]) => {\r\n                    key = Sk.unfixReserved(key);\r\n                    if (!key.includes(\"$\")) {\r\n                        key = new Sk.builtin.str(key);\r\n                        entries[key.$savedKeyHash] = [key, val];\r\n                    }\r\n                });\r\n                return entries;\r\n            },\r\n            configurable: true,\r\n        },\r\n        size: {\r\n            get: () => {\r\n                return Object.keys(d)\r\n                    .map((k) => Sk.unfixReserved(k))\r\n                    .filter((k) => !k.includes(\"$\")).length;\r\n            },\r\n            configurable: true,\r\n        },\r\n    });\r\n}\r\n","/**\r\n * @constructor\r\n *\r\n * @param {Sk.builtin.func} func\r\n * @param {Sk.builtin.object} self\r\n *\r\n */\r\nSk.builtin.method = Sk.abstr.buildNativeClass(\"method\", {\r\n    constructor: function method(func, self) {\r\n        Sk.asserts.assert(this instanceof Sk.builtin.method, \"bad call to method constructor, use 'new'\");\r\n        this.im_func = func;\r\n        this.im_self = self;\r\n        this.im_call = func.tp$call;\r\n    },\r\n    slots: {\r\n        $r() {\r\n            const def_name = \"?\";\r\n            let name = this.im_func.tp$getattr(Sk.builtin.str.$qualname) || this.im_func.tp$getattr(Sk.builtin.str.$name);\r\n            name = (name && name.v) || def_name;\r\n            return new Sk.builtin.str(\"<bound method \" + name + \" of \" + Sk.misceval.objectRepr(this.im_self) + \">\");\r\n        },\r\n        tp$hash() {\r\n            const selfhash = Sk.abstr.objectHash(this.im_self);\r\n            const funchash = Sk.abstr.objectHash(this.im_func);\r\n            return selfhash + funchash;\r\n        },\r\n        tp$call(args, kwargs) {\r\n            var im_call = this.im_call;\r\n            if (im_call === undefined) {\r\n                throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(this.im_func) + \"' object is not callable\");\r\n            }\r\n            args = [this.im_self, ...args];\r\n            return im_call.call(this.im_func, args, kwargs);\r\n        },\r\n        tp$new(args, kwargs) {\r\n            Sk.abstr.checkNoKwargs(\"method\", kwargs);\r\n            Sk.abstr.checkArgsLen(\"method\", args, 2, 2);\r\n            const func = args[0];\r\n            const self = args[1];\r\n            if (!Sk.builtin.checkCallable(func)) {\r\n                throw new Sk.builtin.TypeError(\"first argument must be callable\");\r\n            }\r\n            if (Sk.builtin.checkNone(self)) {\r\n                throw new Sk.builtin.TypeError(\"self must not be None\");\r\n            }\r\n            return new Sk.builtin.method(func, self);\r\n        },\r\n        tp$richcompare(other, op) {\r\n            if ((op != \"Eq\" && op != \"NotEq\") || !(other instanceof Sk.builtin.method)) {\r\n                return Sk.builtin.NotImplemented.NotImplemented$;\r\n            }\r\n            let eq;\r\n            try {\r\n                eq = Sk.misceval.richCompareBool(this.im_self, other.im_self, \"Eq\", false) && this.im_func == other.im_func;\r\n            } catch (x) {\r\n                eq = false;\r\n            }\r\n            if (op == \"Eq\") {\r\n                return eq;\r\n            } else {\r\n                return !eq;\r\n            }\r\n        },\r\n        tp$descr_get(obj, obtype) {\r\n            return this;\r\n        },\r\n        tp$getattr(pyName, canSuspend) {\r\n            const descr = Sk.abstr.lookupSpecial(this, pyName);\r\n            if (descr !== undefined) {\r\n                    return descr;\r\n                }\r\n            return this.im_func.tp$getattr(pyName, canSuspend);\r\n        },\r\n    },\r\n    getsets: {\r\n        __func__: {\r\n            $get() {\r\n                return this.im_func;\r\n            },\r\n        },\r\n        __self__: {\r\n            $get() {\r\n                return this.im_self;\r\n            },\r\n        },\r\n        __doc__: {\r\n            $get() {\r\n                return this.im_func.tp$getattr(Sk.builtin.str.$doc);\r\n            },\r\n        },\r\n    },\r\n    flags: { sk$unacceptableBase: true },\r\n});\r\n","/**\r\n * @namespace Sk.misceval\r\n *\r\n * @description\r\n * Various function protocols that include suspension aware options\r\n * As well as handling some common pyObject operations to Javascript\r\n *\r\n */\r\nSk.misceval = {};\r\n\r\n/** @typedef {Sk.builtin.object}*/ var pyObject;\r\n\r\n/*\r\n  Suspension object format:\r\n  {resume: function() {...}, // the continuation - returns either another suspension or the return value\r\n   data: <copied down from innermost level>,\r\n   optional: <if true, can be resumed immediately (eg debug stops)>,\r\n   child: <Suspension, or null if we are the innermost level>,\r\n   $blk: <>, $loc: <>, $gbl: <>, $exc: <>, $err: <>, [$cell: <>],\r\n  }\r\n*/\r\n\r\n/**\r\n * @description\r\n * Hi kids lets make a suspension...\r\n *\r\n * @constructor\r\n * @param {function(?)=} resume A function to be called on resume. child is resumed first and its return value is passed to this function.\r\n * @param {Object=} child A child suspension. 'optional' will be copied from here if supplied.\r\n * @param {Object=} data Data attached to this suspension. Will be copied from child if not supplied.\r\n */\r\nSk.misceval.Suspension = function Suspension(resume, child, data) {\r\n    this.$isSuspension = true;\r\n    if (resume !== undefined && child !== undefined) {\r\n        this.resume = function () {\r\n            return resume(child.resume());\r\n        };\r\n    }\r\n    this.child = child;\r\n    this.optional = child !== undefined && child.optional;\r\n    if (data === undefined && child !== undefined) {\r\n        this.data = child.data;\r\n    } else {\r\n        this.data = data;\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.misceval.Suspension\", Sk.misceval.Suspension);\r\n\r\n/**\r\n * @description\r\n * Well this seems pretty obvious by the name what it should do..\r\n *\r\n * @param {Sk.misceval.Suspension} susp\r\n * @param {string=} message\r\n */\r\nSk.misceval.retryOptionalSuspensionOrThrow = function (susp, message) {\r\n    while (susp instanceof Sk.misceval.Suspension) {\r\n        if (!susp.optional) {\r\n            const err = new Sk.builtin.SuspensionError(message || \"Cannot call a function that blocks or suspends here\");\r\n            let prev_susp = susp;\r\n            const tb = [];\r\n            while (prev_susp != null) {\r\n                if (prev_susp.$lineno) {\r\n                    // compile code added attributes so fill the traceback\r\n                    tb.push({ filename: prev_susp.$filename, lineno: prev_susp.$lineno, colno: prev_susp.$colno });\r\n                }\r\n                prev_susp = prev_susp.child;\r\n            }\r\n            tb.reverse();\r\n            err.traceback.push(...tb);\r\n            throw err;\r\n        }\r\n        susp = susp.resume();\r\n    }\r\n    return susp;\r\n};\r\nSk.exportSymbol(\"Sk.misceval.retryOptionalSuspensionOrThrow\", Sk.misceval.retryOptionalSuspensionOrThrow);\r\n\r\n/**\r\n * @description\r\n * Check if the given object is valid to use as an index. Only ints, or if the object has an `__index__` method.\r\n *\r\n * @param {pyObject} o - typically an {@link Sk.builtin.int_} legacy code might use a js number\r\n * @returns {boolean}\r\n */\r\nSk.misceval.isIndex = function (o) {\r\n    return o !== null && o !== undefined && (o.nb$index !== undefined || (typeof o === \"number\" && Number.isInteger(o)));\r\n};\r\nSk.exportSymbol(\"Sk.misceval.isIndex\", Sk.misceval.isIndex);\r\n\r\n\r\nfunction asIndex(index) {\r\n    if (index === null || index === undefined) {\r\n        return;\r\n    } else if (index.nb$index) {\r\n        return index.nb$index(); // this slot will check the return value is a number / JSBI.BigInt.\r\n    } else if (typeof index === \"number\" && Number.isInteger(index)) {\r\n        return index;\r\n    }\r\n};\r\n\r\nfunction asIndexOrThrow(index, msg) {\r\n    const i = asIndex(index);\r\n    if (i !== undefined) {\r\n        return i;\r\n    }\r\n    msg = msg || \"'{tp$name}' object cannot be interpreted as an integer\";\r\n    msg = msg.replace(\"{tp$name}\", Sk.abstr.typeName(index));\r\n    throw new Sk.builtin.TypeError(msg);\r\n}\r\n\r\n/**\r\n * \r\n * @param {*} index \r\n * \r\n * @description\r\n * will return an integer javascript number\r\n * if the value is larger than Number.MAX_SAFE_INTEGER will return a BigInt\r\n * if the object passed is not a valid indexable object then it will return undefined\r\n * if you want to throw an error instead of returning undefined use {@link Sk.misceval.asIndexOrThrow}\r\n * If you know you want a number and not a BigInt - use {@link Sk.misceval.asIndexSized}\r\n */\r\nSk.misceval.asIndex = asIndex;\r\n\r\n\r\n/**\r\n * \r\n * @param {*} index \r\n * @param {Sk.builtin.Exception=} Err provided an excption type if you wish to throw an exception\r\n * @param {string} msg an option message if the index passed is not a valid indexable object\r\n * \r\n * @description\r\n * this function will always return a `Number` whose size is less than `Number.MAX_SAFE_INTEGER`\r\n * If you provide an err then this function will throw an error if the index is larger than `Number.MAX_SAFE_INTEGER`\r\n */\r\nSk.misceval.asIndexSized = function (index, Err, msg) {\r\n    const i = asIndexOrThrow(index, msg);\r\n    if (typeof i === \"number\") {\r\n        return i; // integer v property will by a javascript number if it is index sized\r\n    }\r\n    if (Err == null) {\r\n        return JSBI.lessThan(i, JSBI.__ZERO) ? -Number.MAX_SAFE_INTEGER : Number.MAX_SAFE_INTEGER;\r\n    }\r\n    throw new Err(\"cannot fit '\" + Sk.abstr.typeName(index) + \"' into an index-sized integer\");\r\n};\r\n\r\n/**\r\n * @function\r\n *\r\n * @param {pyObject|number} index - typically an {@link Sk.builtin.int_} legacy code might use a js number \r\n * @param {string=} msg - an optional message when throwing the TypeError\r\n * @throws {Sk.builtin.TypeError}\r\n *\r\n * @description\r\n * requires a pyObject - returns a string or integer depending on the size.\r\n * throws a TypeError that the object cannot be interpreted as an index\r\n * can provide a custom message\r\n * include {tp$name} in the custom message which will be replaced by the typeName of the object\r\n * \r\n * - converts the `Sk.builtin.int_`\r\n * - if the number is too large to be safe returns a string\r\n * @returns {number|BigInt|JSBI} \r\n */\r\nSk.misceval.asIndexOrThrow = asIndexOrThrow;\r\n\r\n/**\r\n * return u[v:w]\r\n * @ignore\r\n */\r\nSk.misceval.applySlice = function (u, v, w, canSuspend) {\r\n    return Sk.abstr.objectGetItem(u, new Sk.builtin.slice(v, w, null), canSuspend);\r\n};\r\nSk.exportSymbol(\"Sk.misceval.applySlice\", Sk.misceval.applySlice);\r\n\r\n/**\r\n * u[v:w] = x\r\n * @ignore\r\n */\r\nSk.misceval.assignSlice = function (u, v, w, x, canSuspend) {\r\n    const slice = new Sk.builtin.slice(v, w);\r\n    if (x === null) {\r\n        return Sk.abstr.objectDelItem(u, slice);\r\n    } else {\r\n        return Sk.abstr.objectSetItem(u, slice, x, canSuspend);\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.misceval.assignSlice\", Sk.misceval.assignSlice);\r\n\r\n/**\r\n * Note that this does no validation, just coercion.\r\n */\r\nSk.misceval.arrayFromArguments = function (args) {\r\n    // If args is not a single thing return as is\r\n    var it, i;\r\n    var res;\r\n    var arg;\r\n    if (args.length != 1) {\r\n        return args;\r\n    }\r\n    arg = args[0];\r\n    if (arg instanceof Sk.builtin.set) {\r\n        // this is a Sk.builtin.set\r\n        arg = arg.tp$iter().$obj;\r\n    } else if (arg instanceof Sk.builtin.dict) {\r\n        // this is a Sk.builtin.list\r\n        arg = Sk.builtin.dict.prototype[\"keys\"].func_code(arg);\r\n    }\r\n\r\n    // shouldn't else if here as the above may output lists to arg.\r\n    if (arg instanceof Sk.builtin.list || arg instanceof Sk.builtin.tuple) {\r\n        return arg.v;\r\n    } else if (Sk.builtin.checkIterable(arg)) {\r\n        // handle arbitrary iterable (strings, generators, etc.)\r\n        res = [];\r\n        for (it = Sk.abstr.iter(arg), i = it.tp$iternext(); i !== undefined; i = it.tp$iternext()) {\r\n            res.push(i);\r\n        }\r\n        return res;\r\n    }\r\n\r\n    throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(arg) + \"' object is not iterable\");\r\n};\r\nSk.exportSymbol(\"Sk.misceval.arrayFromArguments\", Sk.misceval.arrayFromArguments);\r\n\r\n\r\n/**\r\n * \r\n * @constructor\r\n * \r\n * @param {Function} fn\r\n * @param {boolean=} [handlesOwnSuspensions=false] - Does it handle its own suspension?\r\n * \r\n * @description\r\n * Create a generic Python iterator that repeatedly calls a given JS function\r\n * until it returns 'undefined'. This function is useful for user defined Native classes\r\n * \r\n * @example\r\n * // some immutable tuple like class where the v property is an array\r\n * MyClass.prototype.tp$iter = function() {\r\n *   let i = 0;\r\n *   const len = this.v.length;\r\n *   return new Sk.miscival.iterator(() => i >= len ? this.v[i++] : undefined);\r\n * }\r\n * @extends {Sk.builtin.object}\r\n * \r\n */\r\nSk.misceval.iterator = Sk.abstr.buildIteratorClass(\"iterator\", {\r\n    constructor : function iterator (fn, handlesOwnSuspensions) {\r\n        this.tp$iternext = handlesOwnSuspensions ? fn : function (canSuspend) {\r\n            let x = fn();\r\n            if (canSuspend || !x.$isSuspension) {\r\n                return x;\r\n            } else {\r\n                return Sk.misceval.retryOptionalSuspensionOrThrow(x);\r\n            }\r\n        };\r\n    }, \r\n    iternext: function (canSuspend) { /* keep slot __next__ happy */\r\n        return this.tp$iternext(canSuspend);\r\n    },\r\n    flags: { sk$unacceptableBase: true },\r\n});\r\n\r\n/**\r\n * for reversed comparison: Gt -> Lt, etc.\r\n * @ignore\r\n */\r\nSk.misceval.swappedOp_ = {\r\n    Eq: \"Eq\",\r\n    NotEq: \"NotEq\",\r\n    Lt: \"GtE\",\r\n    LtE: \"Gt\",\r\n    Gt: \"LtE\",\r\n    GtE: \"Lt\",\r\n    Is: \"IsNot\",\r\n    IsNot: \"Is\",\r\n    In_: \"NotIn\",\r\n    NotIn: \"In_\",\r\n};\r\n\r\nSk.misceval.opSymbols = {\r\n    Eq: \"==\",\r\n    NotEq: \"!=\",\r\n    Lt: \"<\",\r\n    LtE: \"<=\",\r\n    Gt: \">\",\r\n    GtE: \">=\",\r\n    Is: \"is\",\r\n    IsNot: \"is not\",\r\n    In_: \"in\",\r\n    NotIn: \"not in\",\r\n};\r\n\r\n/**\r\n * @function\r\n *\r\n * @param {pyObject} v\r\n * @param {pyObject} w\r\n * @param {string} op - `Eq`, `NotEq`, `Lt`, `LtE`, `Gt`, `GtE`, `Is`, `IsNot`, `In_`, `NotIn`\r\n * @param {boolean=} canSuspend\r\n *\r\n * @returns {boolean}\r\n *\r\n * @todo This implementation overrides the return value from a user defined dunder method since it returns a boolean\r\n * whereas Python will return the user defined return value.\r\n *\r\n * @throws {Sk.builtin.TypeError}\r\n */\r\nSk.misceval.richCompareBool = function (v, w, op, canSuspend) {\r\n    // v and w must be Python objects. will return Javascript true or false for internal use only\r\n    // if you want to return a value from richCompareBool to Python you must wrap as Sk.builtin.bool first\r\n    Sk.asserts.assert(v.sk$object && w.sk$object, \"JS object passed to richCompareBool\");\r\n    var ret,\r\n        swapped_shortcut,\r\n        shortcut;\r\n\r\n    const v_type = v.ob$type;\r\n    const w_type = w.ob$type;\r\n    const w_is_subclass = w_type !== v_type && w_type.sk$baseClass === undefined && w_type.$isSubType(v_type);\r\n\r\n    // Python 2 has specific rules when comparing two different builtin types\r\n    // currently, this code will execute even if the objects are not builtin types\r\n    // but will fall through and not return anything in this section\r\n    if (!Sk.__future__.python3 && v_type !== w_type && (op === \"GtE\" || op === \"Gt\" || op === \"LtE\" || op === \"Lt\")) {\r\n        // note: sets are omitted here because they can only be compared to other sets\r\n        const numeric_types = [Sk.builtin.float_, Sk.builtin.int_, Sk.builtin.lng, Sk.builtin.bool];\r\n        const sequence_types = [\r\n            Sk.builtin.dict,\r\n            Sk.builtin.enumerate,\r\n            Sk.builtin.filter_,\r\n            Sk.builtin.list,\r\n            Sk.builtin.map_,\r\n            Sk.builtin.str,\r\n            Sk.builtin.tuple,\r\n            Sk.builtin.zip_,\r\n        ];\r\n\r\n        const v_num_type = numeric_types.indexOf(v_type);\r\n        const v_seq_type = sequence_types.indexOf(v_type);\r\n        const w_num_type = numeric_types.indexOf(w_type);\r\n        const w_seq_type = sequence_types.indexOf(w_type);\r\n\r\n        // NoneTypes are considered less than any other type in Python\r\n        // note: this only handles comparing NoneType with any non-NoneType.\r\n        // Comparing NoneType with NoneType is handled further down.\r\n        if (v === Sk.builtin.none.none$) {\r\n            switch (op) {\r\n                case \"Lt\":\r\n                    return true;\r\n                case \"LtE\":\r\n                    return true;\r\n                case \"Gt\":\r\n                    return false;\r\n                case \"GtE\":\r\n                    return false;\r\n            }\r\n        }\r\n\r\n        if (w === Sk.builtin.none.none$) {\r\n            switch (op) {\r\n                case \"Lt\":\r\n                    return false;\r\n                case \"LtE\":\r\n                    return false;\r\n                case \"Gt\":\r\n                    return true;\r\n                case \"GtE\":\r\n                    return true;\r\n            }\r\n        }\r\n\r\n        // numeric types are always considered smaller than sequence types in Python\r\n        if (v_num_type !== -1 && w_seq_type !== -1) {\r\n            switch (op) {\r\n                case \"Lt\":\r\n                    return true;\r\n                case \"LtE\":\r\n                    return true;\r\n                case \"Gt\":\r\n                    return false;\r\n                case \"GtE\":\r\n                    return false;\r\n            }\r\n        }\r\n\r\n        if (v_seq_type !== -1 && w_num_type !== -1) {\r\n            switch (op) {\r\n                case \"Lt\":\r\n                    return false;\r\n                case \"LtE\":\r\n                    return false;\r\n                case \"Gt\":\r\n                    return true;\r\n                case \"GtE\":\r\n                    return true;\r\n            }\r\n        }\r\n\r\n        // in Python, different sequence types are ordered alphabetically\r\n        // by name so that dict < list < str < tuple\r\n        if (v_seq_type !== -1 && w_seq_type !== -1) {\r\n            switch (op) {\r\n                case \"Lt\":\r\n                    return v_seq_type < w_seq_type;\r\n                case \"LtE\":\r\n                    return v_seq_type <= w_seq_type;\r\n                case \"Gt\":\r\n                    return v_seq_type > w_seq_type;\r\n                case \"GtE\":\r\n                    return v_seq_type >= w_seq_type;\r\n            }\r\n        }\r\n    }\r\n\r\n    // handle identity and membership comparisons\r\n    if (op === \"Is\") {\r\n        if (v_type === w_type) {\r\n            if (v === w) {\r\n                return true;\r\n            } else if (v_type === Sk.builtin.float_) {\r\n                return v.v === w.v;\r\n            } else if (v_type === Sk.builtin.int_) {\r\n                if (typeof v.v === \"number\" && typeof v.v === \"number\") {\r\n                    return v.v === w.v;\r\n                }\r\n                return JSBI.equal(JSBI.BigInt(v.v), JSBI.BigInt(w.v));\r\n            }\r\n        }\r\n        return false;\r\n    }\r\n\r\n    if (op === \"IsNot\") {\r\n        if (v_type !== w_type) {\r\n            return true;\r\n        } else if (v_type === Sk.builtin.float_) {\r\n            return v.v !== w.v;\r\n        } else if (v_type === Sk.builtin.int_) {\r\n            if (typeof v.v === \"number\" && typeof v.v === \"number\") {\r\n                return v.v !== w.v;\r\n            }\r\n            return JSBI.notEqual(JSBI.BigInt(v.v), JSBI.BigInt(w.v));\r\n        }\r\n        return v !== w;\r\n    }\r\n\r\n    if (op === \"In\") {\r\n        return Sk.misceval.chain(Sk.abstr.sequenceContains(w, v, canSuspend), Sk.misceval.isTrue);\r\n    }\r\n    if (op === \"NotIn\") {\r\n        return Sk.misceval.chain(Sk.abstr.sequenceContains(w, v, canSuspend), function (x) {\r\n            return !Sk.misceval.isTrue(x);\r\n        });\r\n    }\r\n\r\n    // Call Javascript shortcut method if exists for either object\r\n\r\n    var op2shortcut = {\r\n        \"Eq\"   : \"ob$eq\",\r\n        \"NotEq\": \"ob$ne\",\r\n        \"Gt\"   : \"ob$gt\",\r\n        \"GtE\"  : \"ob$ge\",\r\n        \"Lt\"   : \"ob$lt\",\r\n        \"LtE\"  : \"ob$le\"\r\n    };\r\n\r\n    shortcut = op2shortcut[op];\r\n    // similar rules apply as with binops - prioritize the reflected ops of subtypes\r\n    // but different to binop - even if the swapped op is the same as the parent still call it\r\n    if (w_is_subclass) {\r\n        swapped_shortcut = op2shortcut[Sk.misceval.swappedOp_[op]];\r\n        if ((ret = w[swapped_shortcut](v)) !== Sk.builtin.NotImplemented.NotImplemented$) {\r\n            return Sk.misceval.isTrue(ret);\r\n        }\r\n    }\r\n    if ((ret = v[shortcut](w)) !== Sk.builtin.NotImplemented.NotImplemented$) {\r\n        return Sk.misceval.isTrue(ret);\r\n    // techincally this is not correct along with the compile code see #1252\r\n        // richcompare slots could return any pyObject ToDo - would require changing compile code\r\n    }\r\n\r\n    if (!w_is_subclass) {\r\n    swapped_shortcut = op2shortcut[Sk.misceval.swappedOp_[op]];\r\n    if ((ret = w[swapped_shortcut](v)) !== Sk.builtin.NotImplemented.NotImplemented$) {\r\n        return Sk.misceval.isTrue(ret);\r\n    }\r\n    }\r\n\r\n    if (!Sk.__future__.python3) {\r\n        const vcmp = Sk.abstr.lookupSpecial(v, Sk.builtin.str.$cmp);\r\n        if (vcmp) {\r\n            try {\r\n                ret = Sk.misceval.callsimArray(vcmp, [w]);\r\n                if (Sk.builtin.checkNumber(ret)) {\r\n                    ret = Sk.builtin.asnum$(ret);\r\n                    if (op === \"Eq\") {\r\n                        return ret === 0;\r\n                    } else if (op === \"NotEq\") {\r\n                        return ret !== 0;\r\n                    } else if (op === \"Lt\") {\r\n                        return ret < 0;\r\n                    } else if (op === \"Gt\") {\r\n                        return ret > 0;\r\n                    } else if (op === \"LtE\") {\r\n                        return ret <= 0;\r\n                    } else if (op === \"GtE\") {\r\n                        return ret >= 0;\r\n                    }\r\n                }\r\n\r\n                if (ret !== Sk.builtin.NotImplemented.NotImplemented$) {\r\n                    throw new Sk.builtin.TypeError(\"comparison did not return an int\");\r\n                }\r\n            } catch (e) {\r\n                throw new Sk.builtin.TypeError(\"comparison did not return an int\");\r\n            }\r\n        }\r\n        const wcmp = Sk.abstr.lookupSpecial(w, Sk.builtin.str.$cmp);\r\n        if (wcmp) {\r\n            // note, flipped on return value and call\r\n            try {\r\n                ret = Sk.misceval.callsimArray(wcmp, [v]);\r\n                if (Sk.builtin.checkNumber(ret)) {\r\n                    ret = Sk.builtin.asnum$(ret);\r\n                    if (op === \"Eq\") {\r\n                        return ret === 0;\r\n                    } else if (op === \"NotEq\") {\r\n                        return ret !== 0;\r\n                    } else if (op === \"Lt\") {\r\n                        return ret > 0;\r\n                    } else if (op === \"Gt\") {\r\n                        return ret < 0;\r\n                    } else if (op === \"LtE\") {\r\n                        return ret >= 0;\r\n                    } else if (op === \"GtE\") {\r\n                        return ret <= 0;\r\n                    }\r\n                }\r\n\r\n                if (ret !== Sk.builtin.NotImplemented.NotImplemented$) {\r\n                    throw new Sk.builtin.TypeError(\"comparison did not return an int\");\r\n                }\r\n            } catch (e) {\r\n                throw new Sk.builtin.TypeError(\"comparison did not return an int\");\r\n            }\r\n        }\r\n        // handle special cases for comparing None with None or Bool with Bool\r\n        if (v === Sk.builtin.none.none$ && w === Sk.builtin.none.none$) {\r\n            // Javascript happens to return the same values when comparing null\r\n            // with null or true/false with true/false as Python does when\r\n            // comparing None with None or True/False with True/False\r\n\r\n            if (op === \"Eq\") {\r\n                return v.v === w.v;\r\n            }\r\n            if (op === \"NotEq\") {\r\n                return v.v !== w.v;\r\n            }\r\n            if (op === \"Gt\") {\r\n                return v.v > w.v;\r\n            }\r\n            if (op === \"GtE\") {\r\n                return v.v >= w.v;\r\n            }\r\n            if (op === \"Lt\") {\r\n                return v.v < w.v;\r\n            }\r\n            if (op === \"LtE\") {\r\n                return v.v <= w.v;\r\n            }\r\n        }\r\n    }\r\n\r\n    // handle equality comparisons for any remaining objects\r\n    if (op === \"Eq\") {\r\n        return v === w;\r\n    }\r\n    if (op === \"NotEq\") {\r\n        return v !== w;\r\n    }\r\n\r\n    const vname = Sk.abstr.typeName(v);\r\n    const wname = Sk.abstr.typeName(w);\r\n    throw new Sk.builtin.TypeError(\"'\" + Sk.misceval.opSymbols[op] + \"' not supported between instances of '\" + vname + \"' and '\" + wname + \"'\");\r\n    //throw new Sk.builtin.ValueError(\"don't know how to compare '\" + vname + \"' and '\" + wname + \"'\");\r\n};\r\nSk.exportSymbol(\"Sk.misceval.richCompareBool\", Sk.misceval.richCompareBool);\r\n\r\n\r\n/**\r\n * @function\r\n * @description\r\n * calls the __repr__ of a pyObject or returns `<unknown>` if a JS object was passed\r\n * @param {*} obj\r\n * @returns {string}\r\n *\r\n */\r\nSk.misceval.objectRepr = function (obj) {\r\n    Sk.asserts.assert(obj !== undefined, \"trying to repr undefined\");\r\n    if (obj !== null && obj.$r) {\r\n        return obj.$r().v;\r\n    } else {\r\n        try {\r\n            // str goes through the common javascript cases or throws a TypeError;\r\n            return new Sk.builtin.str(obj).v;\r\n        } catch (e) {\r\n            if (e instanceof Sk.builtin.TypeError) {\r\n                return \"<unknown>\";\r\n            } else {\r\n                throw e;\r\n            }\r\n        }\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.misceval.objectRepr\", Sk.misceval.objectRepr);\r\n\r\nSk.misceval.opAllowsEquality = function (op) {\r\n    switch (op) {\r\n        case \"LtE\":\r\n        case \"Eq\":\r\n        case \"GtE\":\r\n            return true;\r\n    }\r\n    return false;\r\n};\r\nSk.exportSymbol(\"Sk.misceval.opAllowsEquality\", Sk.misceval.opAllowsEquality);\r\n\r\n\r\n/**\r\n * @function\r\n * @description\r\n * Decides whether a pyObject is True or not\r\n * @returns {boolean}\r\n * @param {*} x\r\n */\r\nSk.misceval.isTrue = function (x) {\r\n    if (x === true || x === Sk.builtin.bool.true$) {\r\n        return true;\r\n    }\r\n    if (x === false || x === Sk.builtin.bool.false$) {\r\n        return false;\r\n    }\r\n    if (x === null || x === undefined) {\r\n        return false;\r\n    }\r\n    if (x.nb$bool) {\r\n        return x.nb$bool(); // the slot wrapper takes care of converting to js Boolean\r\n    }\r\n    if (x.sq$length) {\r\n        // the slot wrapper takes care of the error message and converting to js int\r\n        return x.sq$length() !== 0;\r\n    }\r\n    return Boolean(x);\r\n};\r\nSk.exportSymbol(\"Sk.misceval.isTrue\", Sk.misceval.isTrue);\r\n\r\nSk.misceval.softspace_ = false;\r\nSk.misceval.print_ = function (x) {\r\n    var s;\r\n\r\n    function isspace(c) {\r\n        return c === \"\\n\" || c === \"\\t\" || c === \"\\r\";\r\n    }\r\n\r\n    if (Sk.misceval.softspace_) {\r\n        if (x !== \"\\n\") {\r\n            Sk.output(\" \");\r\n        }\r\n        Sk.misceval.softspace_ = false;\r\n    }\r\n\r\n    s = new Sk.builtin.str(x);\r\n\r\n    return Sk.misceval.chain(\r\n        Sk.importModule(\"sys\", false, true),\r\n        function (sys) {\r\n            return Sk.misceval.apply(sys[\"$d\"][\"stdout\"][\"write\"], undefined, undefined, undefined, [sys[\"$d\"][\"stdout\"], s]);\r\n        },\r\n        function () {\r\n            if (s.v.length === 0 || !isspace(s.v[s.v.length - 1]) || s.v[s.v.length - 1] === \" \") {\r\n                Sk.misceval.softspace_ = true;\r\n            }\r\n        }\r\n    );\r\n};\r\nSk.exportSymbol(\"Sk.misceval.print_\", Sk.misceval.print_);\r\n\r\n/**\r\n * @function\r\n * @description\r\n * Get a python object from a given namespace\r\n * @param {string} name\r\n * @param {Object=} other generally globals\r\n * @example\r\n * Sk.misceval.loadname(\"foo\", Sk.globals);\r\n */\r\nSk.misceval.loadname = function (name, other) {\r\n    var builtinModuleVersion, bi;\r\n    var v = other[name];\r\n    if (v !== undefined) {\r\n        if (typeof v === \"function\" && v.sk$object === undefined) {\r\n            return v();\r\n        }\r\n        return v;\r\n    }\r\n\r\n    // Check if we've overridden the builtin via the builtin's module\r\n    //console.log(\"MISCEVAL\", other, other[\"__builtins__\"], name);\r\n    //console.log(Object.keys(other));\r\n    //console.log(\"CONSIDERING LOADING\", name, Object.keys(other), Object.keys(Sk.globals), Sk.globals === other);\r\n    if (other[\"__builtins__\"] !== undefined) {\r\n        builtinModuleVersion = other[\"__builtins__\"].mp$lookup(new Sk.builtin.str(name));\r\n        if (builtinModuleVersion !== undefined) {\r\n            return builtinModuleVersion;\r\n        }\r\n    }\r\n\r\n    bi = Sk.builtins[name];\r\n    if (bi !== undefined) {\r\n        return bi;\r\n    }\r\n\r\n    throw new Sk.builtin.NameError(\"name '\" + Sk.unfixReserved(name) + \"' is not defined\");\r\n};\r\nSk.exportSymbol(\"Sk.misceval.loadname\", Sk.misceval.loadname);\r\n\r\n/**\r\n *\r\n * Notes on necessity for 'call()':\r\n *\r\n * Classes are callable in python to create an instance of the class. If\r\n * we're calling \"C()\" we cannot tell at the call site whether we're\r\n * calling a standard function, or instantiating a class.\r\n *\r\n * JS does not support user-level callables. So, we can't use the normal\r\n * prototype hierarchy to make the class inherit from a 'class' type\r\n * where the various tp$getattr, etc. methods would live.\r\n *\r\n * Instead, we must copy all the methods from the prototype of our class\r\n * type onto every instance of the class constructor function object.\r\n * That way, both \"C()\" and \"C.tp$getattr(...)\" can still work. This is\r\n * of course quite expensive.\r\n *\r\n * The alternative would be to indirect all calls (whether classes or\r\n * regular functions) through something like C.$call(...). In the case\r\n * of class construction, $call could then call the constructor after\r\n * munging arguments to pass them on. This would impose a penalty on\r\n * regular function calls unfortunately, as they would have to do the\r\n * same thing.\r\n *\r\n * Note that the same problem exists for function objects too (a \"def\"\r\n * creates a function object that also has properties). It just happens\r\n * that attributes on classes in python are much more useful and common\r\n * that the attributes on functions.\r\n *\r\n * Also note, that for full python compatibility we have to do the $call\r\n * method because any python object could have a __call__ method which\r\n * makes the python object callable too. So, unless we were to make\r\n * *all* objects simply (function(){...}) and use the dict to create\r\n * hierarchy, there would be no way to call that python user function. I\r\n * think I'm prepared to sacrifice __call__ support, or only support it\r\n * post-ECMA5 or something.\r\n *\r\n * Is using (function(){...}) as the only object type too crazy?\r\n * Probably. Better or worse than having two levels of function\r\n * invocation for every function call?\r\n *\r\n * For a class `C' with instance `inst' we have the following cases:\r\n *\r\n * 1. C.attr\r\n *\r\n * 2. C.staticmeth()\r\n *\r\n * 3. x = C.staticmeth; x()\r\n *\r\n * 4. inst = C()\r\n *\r\n * 5. inst.attr\r\n *\r\n * 6. inst.meth()\r\n *\r\n * 7. x = inst.meth; x()\r\n *\r\n * 8. inst(), where C defines a __call__\r\n *\r\n * Because in general these are accomplished by a helper function\r\n * (tp$getattr/setattr/slice/ass_slice/etc.) it seems appropriate to add\r\n * a call that generally just calls through, but sometimes handles the\r\n * unusual cases. Once ECMA-5 is more broadly supported we can revisit\r\n * and hopefully optimize.\r\n *\r\n * @param {Object} func the thing to call\r\n * @param {Object=} kwdict **kwargs\r\n * @param {Object=} varargseq **args\r\n * @param {Object=} kws keyword args or undef\r\n * @param {...*} args stuff to pass it\r\n *\r\n *\r\n * @todo I think all the above is out of date.\r\n * @ignore\r\n */\r\nSk.misceval.call = function (func, kwdict, varargseq, kws, args) {\r\n    args = Array.prototype.slice.call(arguments, 4);\r\n    // todo; possibly inline apply to avoid extra stack frame creation\r\n    return Sk.misceval.apply(func, kwdict, varargseq, kws, args);\r\n};\r\nSk.exportSymbol(\"Sk.misceval.call\", Sk.misceval.call);\r\n\r\n/**\r\n * @param {?Object} suspensionHandlers\r\n * @param {Object} func the thing to call\r\n * @param {Object=} kwdict **kwargs\r\n * @param {Object=} varargseq **args\r\n * @param {Object=} kws keyword args or undef\r\n * @param {...*} args stuff to pass it\r\n *\r\n *\r\n * @todo I think all the above is out of date.\r\n */\r\n\r\nSk.misceval.callAsync = function (suspensionHandlers, func, kwdict, varargseq, kws, args) {\r\n    args = Array.prototype.slice.call(arguments, 5);\r\n    // todo; possibly inline apply to avoid extra stack frame creation\r\n    return Sk.misceval.applyAsync(suspensionHandlers, func, kwdict, varargseq, kws, args);\r\n};\r\nSk.exportSymbol(\"Sk.misceval.callAsync\", Sk.misceval.callAsync);\r\n\r\nSk.misceval.callOrSuspend = function (func, kwdict, varargseq, kws, args) {\r\n    args = Array.prototype.slice.call(arguments, 4);\r\n    // todo; possibly inline apply to avoid extra stack frame creation\r\n    return Sk.misceval.applyOrSuspend(func, kwdict, varargseq, kws, args);\r\n};\r\nSk.exportSymbol(\"Sk.misceval.callOrSuspend\", Sk.misceval.callOrSuspend);\r\n\r\n/**\r\n * @param {Object} func the thing to call\r\n * @param {...*} args stuff to pass it\r\n * @ignore\r\n */\r\nSk.misceval.callsim = function (func, args) {\r\n    args = Array.prototype.slice.call(arguments, 1);\r\n    return Sk.misceval.apply(func, undefined, undefined, undefined, args);\r\n};\r\nSk.exportSymbol(\"Sk.misceval.callsim\", Sk.misceval.callsim);\r\n\r\n/**\r\n * @param {Object=} func the thing to call\r\n * @param {Array=} args an array of arguments to pass to the func\r\n * @param {Array=} kws an array of string/pyObject pairs to pass to the func as kwargs\r\n *\r\n * @description\r\n * Call a pyObject - if the object is not callable will throw a TypeError\r\n * Requires args to be a Javascript array.\r\n * kws should be an array of string/pyObject pairs as key/values\r\n */\r\nSk.misceval.callsimArray = function (func, args, kws) {\r\n    args = args || [];\r\n    return Sk.misceval.retryOptionalSuspensionOrThrow(Sk.misceval.callsimOrSuspendArray(func, args, kws));\r\n};\r\nSk.exportSymbol(\"Sk.misceval.callsimArray\", Sk.misceval.callsimArray);\r\n\r\n/**\r\n * @param {?Object} suspensionHandlers any custom suspension handlers\r\n * @param {Object} func the thing to call\r\n * @param {...*} args stuff to pass it\r\n */\r\nSk.misceval.callsimAsync = function (suspensionHandlers, func, args) {\r\n    args = Array.prototype.slice.call(arguments, 2);\r\n    return Sk.misceval.applyAsync(suspensionHandlers, func, undefined, undefined, undefined, args);\r\n};\r\nSk.exportSymbol(\"Sk.misceval.callsimAsync\", Sk.misceval.callsimAsync);\r\n\r\n/**\r\n * @param {Object} func the thing to call\r\n * @param {...*} args stuff to pass it\r\n * @deprecated\r\n * @ignore\r\n */\r\nSk.misceval.callsimOrSuspend = function (func, args) {\r\n    args = Array.prototype.slice.call(arguments, 1);\r\n    return Sk.misceval.applyOrSuspend(func, undefined, undefined, undefined, args);\r\n};\r\nSk.exportSymbol(\"Sk.misceval.callsimOrSuspend\", Sk.misceval.callsimOrSuspend);\r\n\r\n/**\r\n * @description\r\n * Does the same thing as callsimOrSuspend without expensive call to\r\n * Array.slice.  Requires args+kws to be Javascript arrays.\r\n * The preferred method for calling a pyObject. \r\n *\r\n * @param {Object=} func the thing to call\r\n * @param {Array=} args an array of arguments to pass to the func\r\n * @param {Array=} kws an array of keyword arguments to pass to the func\r\n *\r\n */\r\nSk.misceval.callsimOrSuspendArray = function (func, args, kws) {\r\n    args = args || [];\r\n    if (func !== undefined && func.tp$call) {\r\n        return func.tp$call(args, kws);\r\n    } else {\r\n        // Slow path handles things like calling native JS fns\r\n        // (perhaps we should stop supporting that), and weird\r\n        // detection of the __call__ method (everything should use tp$call)\r\n        return Sk.misceval.applyOrSuspend(func, undefined, undefined, kws, args);\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.misceval.callsimOrSuspendArray\", Sk.misceval.callsimOrSuspendArray);\r\n\r\n/**\r\n * Wrap Sk.misceval.applyOrSuspend, but throw an error if we suspend\r\n * @ignore\r\n */\r\nSk.misceval.apply = function (func, kwdict, varargseq, kws, args) {\r\n    var r = Sk.misceval.applyOrSuspend(func, kwdict, varargseq, kws, args);\r\n    if (r instanceof Sk.misceval.Suspension) {\r\n        return Sk.misceval.retryOptionalSuspensionOrThrow(r);\r\n    } else {\r\n        return r;\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.misceval.apply\", Sk.misceval.apply);\r\n\r\n/**\r\n * Wraps anything that can return an Sk.misceval.Suspension, and returns a\r\n * JS Promise with the result. Also takes an object map of suspension handlers:\r\n * pass in {\"suspType\": function (susp) {} }, and your function will be called\r\n * with the Suspension object if susp.type==\"suspType\". The type \"*\" will match\r\n * all otherwise unhandled suspensions.\r\n *\r\n * A suspension handler should return a Promise yielding the return value of\r\n * r.resume() - ie, either the final return value of this call or another\r\n * Suspension. That is, the null suspension handler is:\r\n *\r\n *     function handler(susp) {\r\n *       return new Promise(function(resolve, reject) {\r\n *         try {\r\n *           resolve(susp.resume());\r\n *         } catch(e) {\r\n *           reject(e);\r\n *         }\r\n *       });\r\n *     }\r\n *\r\n * Alternatively, a handler can return null to perform the default action for\r\n * that suspension type.\r\n *\r\n * (Note: do *not* call asyncToPromise() in a suspension handler; this will\r\n * create a new Promise object for each such suspension that occurs)\r\n *\r\n * asyncToPromise() returns a Promise that will be resolved with the final\r\n * return value, or rejected with an exception if one is thrown.\r\n *\r\n * @param{function()} suspendablefn returns either a result or a Suspension\r\n * @param{Object=} suspHandlers an object map of suspension handlers\r\n */\r\nSk.misceval.asyncToPromise = function (suspendablefn, suspHandlers) {\r\n    return new Promise(function (resolve, reject) {\r\n        try {\r\n            var r = suspendablefn();\r\n\r\n            (function handleResponse(r) {\r\n                try {\r\n                    // jsh*nt insists these be defined outside the loop\r\n                    var resume = function () {\r\n                        try {\r\n                            handleResponse(r.resume());\r\n                        } catch (e) {\r\n                            reject(e);\r\n                        }\r\n                    };\r\n                    var resumeWithData = function resolved(x) {\r\n                        try {\r\n                            r.data[\"result\"] = x;\r\n                            resume();\r\n                        } catch (e) {\r\n                            reject(e);\r\n                        }\r\n                    };\r\n                    var resumeWithError = function rejected(e) {\r\n                        try {\r\n                            r.data[\"error\"] = e;\r\n                            resume();\r\n                        } catch (ex) {\r\n                            reject(ex);\r\n                        }\r\n                    };\r\n\r\n                    while (r instanceof Sk.misceval.Suspension) {\r\n                        var handler = suspHandlers && (suspHandlers[r.data[\"type\"]] || suspHandlers[\"*\"]);\r\n\r\n                        if (handler) {\r\n                            var handlerPromise = handler(r);\r\n                            if (handlerPromise) {\r\n                                handlerPromise.then(handleResponse, reject);\r\n                                return;\r\n                            }\r\n                        }\r\n\r\n                        if (r.data[\"type\"] == \"Sk.promise\") {\r\n                            r.data[\"promise\"].then(resumeWithData, resumeWithError);\r\n                            return;\r\n                        } else if (r.data[\"type\"] == \"Sk.yield\") {\r\n                            // Assumes all yields are optional, as Sk.setTimeout might\r\n                            // not be able to yield.\r\n                            //Sk.setTimeout(resume, 0);\r\n                            Sk.global[\"setImmediate\"](resume);\r\n                            return;\r\n                        } else if (r.data[\"type\"] == \"Sk.delay\") {\r\n                            //Sk.setTimeout(resume, 1);\r\n                            Sk.global[\"setImmediate\"](resume);\r\n                            return;\r\n                        } else if (r.optional) {\r\n                            // Unhandled optional suspensions just get\r\n                            // resumed immediately, and we go around the loop again.\r\n                            r = r.resume();\r\n                        } else {\r\n                            // Unhandled, non-optional suspension.\r\n                            throw new Sk.builtin.SuspensionError(\"Unhandled non-optional suspension of type '\" + r.data[\"type\"] + \"'\");\r\n                        }\r\n                    }\r\n\r\n                    resolve(r);\r\n                } catch (e) {\r\n                    reject(e);\r\n                }\r\n            })(r);\r\n        } catch (e) {\r\n            reject(e);\r\n        }\r\n    });\r\n};\r\nSk.exportSymbol(\"Sk.misceval.asyncToPromise\", Sk.misceval.asyncToPromise);\r\n\r\nSk.misceval.applyAsync = function (suspHandlers, func, kwdict, varargseq, kws, args) {\r\n    return Sk.misceval.asyncToPromise(function () {\r\n        return Sk.misceval.applyOrSuspend(func, kwdict, varargseq, kws, args);\r\n    }, suspHandlers);\r\n};\r\nSk.exportSymbol(\"Sk.misceval.applyAsync\", Sk.misceval.applyAsync);\r\n\r\n/**\r\n * Chain together a set of functions, each of which might return a value or\r\n * an Sk.misceval.Suspension. Each function is called with the return value of\r\n * the preceding function, but does not see any suspensions. If a function suspends,\r\n * Sk.misceval.chain() returns a suspension that will resume the chain once an actual\r\n * return value is available.\r\n *\r\n * The idea is to allow a Promise-like chaining of possibly-suspending steps without\r\n * repeating boilerplate suspend-and-resume code.\r\n *\r\n * For example, imagine we call Sk.misceval.chain(x, f).\r\n *  - If x is a value, we return f(x).\r\n *  - If x is a suspension, we suspend. We will suspend and resume until we get a\r\n *    return value, and then we will return f(<resumed-value).\r\n * This can be expanded to an arbitrary number of functions\r\n * (eg Sk.misceval.chain(x, f, g), which is equivalent to chain(chain(x, f), g).)\r\n * @template T\r\n * @param {T}              initialValue\r\n * @param {...function(T)} chainedFns\r\n */\r\n\r\nSk.misceval.chain = function (initialValue, chainedFns) {\r\n    // We try to minimse overhead when nothing suspends (the common case)\r\n    var i = 1,\r\n        value = initialValue,\r\n        j,\r\n        fs;\r\n\r\n    while (true) {\r\n        if (i == arguments.length) {\r\n            return value;\r\n        }\r\n        if (value && value.$isSuspension) {\r\n            break;\r\n        } // oops, slow case\r\n        value = arguments[i](value);\r\n        i++;\r\n    }\r\n\r\n    // Okay, we've suspended at least once, so we're taking the slow(er) path.\r\n\r\n    // Copy our remaining arguments into an array (inline, because passing\r\n    // \"arguments\" out of a function kills the V8 optimiser).\r\n    // (discussion: https://github.com/skulpt/skulpt/pull/552)\r\n    fs = new Array(arguments.length - i);\r\n\r\n    for (j = 0; j < arguments.length - i; j++) {\r\n        fs[j] = arguments[i + j];\r\n    }\r\n\r\n    j = 0;\r\n\r\n    return (function nextStep(r) {\r\n        while (j < fs.length) {\r\n            if (r instanceof Sk.misceval.Suspension) {\r\n                return new Sk.misceval.Suspension(nextStep, r);\r\n            }\r\n\r\n            r = fs[j](r);\r\n            j++;\r\n        }\r\n\r\n        return r;\r\n    })(value);\r\n};\r\nSk.exportSymbol(\"Sk.misceval.chain\", Sk.misceval.chain);\r\n\r\n/**\r\n * Catch any exceptions thrown by a function, or by resuming any suspension it\r\n * returns.\r\n *\r\n *     var result = Sk.misceval.tryCatch(asyncFunc, function(err) {\r\n *       console.log(err);\r\n *     });\r\n *\r\n * Because exceptions are returned asynchronously aswell you can't catch them\r\n * with a try/catch. That's what this function is for.\r\n */\r\nSk.misceval.tryCatch = function (tryFn, catchFn) {\r\n    var r;\r\n\r\n    try {\r\n        r = tryFn();\r\n    } catch (e) {\r\n        return catchFn(e);\r\n    }\r\n\r\n    if (r instanceof Sk.misceval.Suspension) {\r\n        var susp = new Sk.misceval.Suspension(undefined, r);\r\n        susp.resume = function () {\r\n            return Sk.misceval.tryCatch(r.resume, catchFn);\r\n        };\r\n        return susp;\r\n    } else {\r\n        return r;\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.misceval.tryCatch\", Sk.misceval.tryCatch);\r\n\r\n/**\r\n * @function\r\n * @description\r\n * Perform a suspension-aware for-each on an iterator, without\r\n * blowing up the stack.\r\n * forFn() is called for each element in the iterator, with two\r\n * arguments: the current element and the previous return value\r\n * of forFn() (or initialValue on the first call). In this way,\r\n * iterFor() can be used as a simple for loop, or alternatively\r\n * as a 'reduce' operation. The return value of the final call to\r\n * forFn() will be the return value of iterFor() (after all\r\n * suspensions are resumed, that is; if the iterator is empty then\r\n * initialValue will be returned.)\r\n *\r\n * The iteration can be terminated early, by returning\r\n * an instance of Sk.misceval.Break. If an argument is given to\r\n * the Sk.misceval.Break() constructor, that value will be\r\n * returned from iterFor(). It is therefore possible to use\r\n * iterFor() on infinite iterators.\r\n *\r\n * @param {*} iter\r\n * @param {function(pyObject,*=)} forFn\r\n * @param {*=} initialValue\r\n */\r\nSk.misceval.iterFor = function (iter, forFn, initialValue) {\r\n    var prevValue = initialValue;\r\n\r\n    var breakOrIterNext = function (r) {\r\n        prevValue = r;\r\n        return r instanceof Sk.misceval.Break ? r : iter.tp$iternext(true);\r\n    };\r\n\r\n    return (function nextStep(i) {\r\n        while (i !== undefined) {\r\n            if (i instanceof Sk.misceval.Suspension) {\r\n                return new Sk.misceval.Suspension(nextStep, i);\r\n            }\r\n\r\n            if (i === Sk.misceval.Break || i instanceof Sk.misceval.Break) {\r\n                return i.brValue;\r\n            }\r\n\r\n            i = Sk.misceval.chain(forFn(i, prevValue), breakOrIterNext);\r\n        }\r\n        return prevValue;\r\n    })(iter.tp$iternext(true));\r\n};\r\nSk.exportSymbol(\"Sk.misceval.iterFor\", Sk.misceval.iterFor);\r\n\r\n\r\n/**\r\n * @function\r\n * @description\r\n * \r\n * As per iterFor but with an array rather than a python iterable\r\n * Useful for iterating over args where doing so could result in a suspension\r\n *\r\n * @param {Array} args\r\n * @param {function(pyObject,*=)} forFn\r\n * @param {*=} initialValue\r\n */\r\nSk.misceval.iterArray = function (args, forFn, initialValue) {\r\n    Sk.asserts.assert(Array.isArray(args), \"iterArgs requires an array\");\r\n    let i = 0;\r\n    return Sk.misceval.iterFor({tp$iternext: () => args[i++]}, forFn, initialValue);\r\n};\r\n\r\n/**\r\n * @function\r\n *\r\n * @description\r\n * Convert a Python iterable into a javascript array\r\n *\r\n * @param {pyObject} iterable\r\n * @param {boolean=} canSuspend - Can this function suspend\r\n *\r\n * @returns {!Array}\r\n */\r\nSk.misceval.arrayFromIterable = function (iterable, canSuspend) {\r\n    if (iterable === undefined) {\r\n        return [];\r\n    }\r\n    if (iterable.ht$type === undefined && iterable.sk$asarray !== undefined) {\r\n        // use sk$asarray only if we're a builtin\r\n        return iterable.sk$asarray();\r\n    }\r\n    const L = [];\r\n    const ret = Sk.misceval.chain(\r\n        Sk.misceval.iterFor(Sk.abstr.iter(iterable), (i) => {\r\n        L.push(i);\r\n        }),\r\n        () => L\r\n    );\r\n    return canSuspend ? ret : Sk.misceval.retryOptionalSuspensionOrThrow(ret);\r\n};\r\n\r\n/**\r\n * A special value to return from an iterFor() function,\r\n * to abort the iteration. Optionally supply a value for iterFor() to return\r\n * (defaults to 'undefined')\r\n *\r\n * @constructor\r\n * @param {*=}  brValue\r\n */\r\nSk.misceval.Break = function (brValue) {\r\n    if (!(this instanceof Sk.misceval.Break)) {\r\n        return new Sk.misceval.Break(brValue);\r\n    }\r\n\r\n    this.brValue = brValue;\r\n};\r\nSk.exportSymbol(\"Sk.misceval.Break\", Sk.misceval.Break);\r\n\r\n/**\r\n * same as Sk.misceval.call except args is an actual array, rather than\r\n * varargs.\r\n * @deprecated\r\n * @ignore\r\n */\r\nSk.misceval.applyOrSuspend = function (func, kwdict, varargseq, kws, args) {\r\n    var fcall;\r\n    var it, i;\r\n\r\n    if (func == null || func === Sk.builtin.none.none$) {\r\n        throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(func) + \"' object is not callable\");\r\n    }\r\n\r\n    if (typeof func === \"function\" && func.tp$call === undefined) {\r\n        func = new Sk.builtin.func(func);\r\n    }\r\n\r\n    fcall = func.tp$call;\r\n    if (fcall !== undefined) {\r\n        if (varargseq) {\r\n            for (it = varargseq.tp$iter(), i = it.tp$iternext(); i !== undefined; i = it.tp$iternext()) {\r\n                args.push(i);\r\n            }\r\n        }\r\n\r\n        if (kwdict) {\r\n            for (it = Sk.abstr.iter(kwdict), i = it.tp$iternext(); i !== undefined; i = it.tp$iternext()) {\r\n                if (!Sk.builtin.checkString(i)) {\r\n                    throw new Sk.builtin.TypeError(\"Function keywords must be strings\");\r\n                }\r\n                kws.push(i.v);\r\n                kws.push(Sk.abstr.objectGetItem(kwdict, i, false));\r\n            }\r\n        }\r\n        return fcall.call(func, args, kws, kwdict);\r\n    }\r\n\r\n    // todo; can we push this into a tp$call somewhere so there's\r\n    // not redundant checks everywhere for all of these __x__ ones?\r\n    fcall = func.__call__;\r\n    if (fcall !== undefined) {\r\n        // func is actually the object here because we got __call__\r\n        // from it. todo; should probably use descr_get here\r\n        args.unshift(func);\r\n        return Sk.misceval.apply(fcall, kwdict, varargseq, kws, args);\r\n    }\r\n\r\n    throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(func) + \"' object is not callable\");\r\n};\r\nSk.exportSymbol(\"Sk.misceval.applyOrSuspend\", Sk.misceval.applyOrSuspend);\r\n\r\n/**\r\n * Do the boilerplate suspension stuff.\r\n */\r\nSk.misceval.promiseToSuspension = function (promise) {\r\n    var suspension = new Sk.misceval.Suspension();\r\n\r\n    suspension.resume = function () {\r\n        if (suspension.data[\"error\"]) {\r\n            throw suspension.data[\"error\"];\r\n        }\r\n\r\n        return suspension.data[\"result\"];\r\n    };\r\n\r\n    suspension.data = {\r\n        type: \"Sk.promise\",\r\n        promise: promise,\r\n    };\r\n\r\n    return suspension;\r\n};\r\nSk.exportSymbol(\"Sk.misceval.promiseToSuspension\", Sk.misceval.promiseToSuspension);\r\n\r\n/**\r\n * @function\r\n * @description\r\n * Constructs a class object given a code object representing the body\r\n * of the class, the name of the class, and the list of bases.\r\n *\r\n * There are no \"old-style\" classes in Skulpt, so use the user-specified\r\n * metaclass (todo;) if there is one, the type of the 0th base class if\r\n * there's bases, or otherwise the 'type' type.\r\n *\r\n * The func code object is passed a (js) dict for its locals which it\r\n * stores everything into.\r\n *\r\n * The metaclass is then called as metaclass(name, bases, locals) and\r\n * should return a newly constructed class object.\r\n *\r\n */\r\nSk.misceval.buildClass = function (globals, func, name, bases, cell) {\r\n    // todo; metaclass\r\n    var klass;\r\n    var meta = Sk.builtin.type;\r\n\r\n    var l_cell = cell === undefined ? {} : cell;\r\n    var locals = {};\r\n\r\n    // init the dict for the class\r\n    func(globals, locals, l_cell);\r\n    // ToDo: check if func contains the __meta__ attribute\r\n    // or if the bases contain __meta__\r\n    // new Syntax would be different\r\n\r\n    // file's __name__ is class's __module__\r\n    if (globals[\"__name__\"]) {\r\n        // some js modules haven't set their module name and we shouldn't set a dictionary value to be undefined that should be equivalent to deleting a value;\r\n        locals.__module__ = globals[\"__name__\"];\r\n    }\r\n    var _name = new Sk.builtin.str(name);\r\n    var _bases = new Sk.builtin.tuple(bases);\r\n    var _locals = [];\r\n    var key;\r\n\r\n    // build array for python dict\r\n    for (key in locals) {\r\n        if (!locals.hasOwnProperty(key)) {\r\n            //The current property key not a direct property of p\r\n            continue;\r\n        }\r\n        _locals.push(new Sk.builtin.str(key)); // push key\r\n        _locals.push(locals[key]); // push associated value\r\n    }\r\n    _locals = new Sk.builtin.dict(_locals);\r\n\r\n    klass = Sk.misceval.callsimArray(meta, [_name, _bases, _locals]);\r\n\r\n    return klass;\r\n};\r\nSk.exportSymbol(\"Sk.misceval.buildClass\", Sk.misceval.buildClass);\r\n\r\nSk.misceval.handleTraceback = function (err, currLineNo, currColNo, currSource, filename, scopeName) {\r\n    if (err instanceof Sk.builtin.TimeoutError) {\r\n        Sk.execStart = Date.now();\r\n        Sk.execPaused = 0;\r\n    }\r\n    if (!(err instanceof Sk.builtin.BaseException)) {\r\n        err = new Sk.builtin.ExternalError(err);\r\n    }\r\n    Sk.err = err;\r\n    err.traceback.push({\r\n        lineno: currLineNo,\r\n        colno: currColNo,\r\n        source: currSource,\r\n        filename: filename,\r\n        scope: scopeName\r\n    });\r\n    return err;\r\n};\r\nSk.exportSymbol(\"Sk.misceval.handleTraceback\", Sk.misceval.handleTraceback);\r\n\r\nSk.misceval.startTimer = function () {\r\n    if (typeof Sk.execStart === \"undefined\") {\r\n        Sk.execStart = Date.now();\r\n        Sk.execPaused = 0;\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.misceval.startTimer\", Sk.misceval.startTimer);\r\n\r\nSk.misceval.resetYield = function() {\r\n    if (typeof Sk.lastYield === \"undefined\") {\r\n        Sk.lastYield = Date.now();\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.misceval.resetYield\", Sk.misceval.resetYield);\r\n\r\nSk.misceval.pauseTimer = function () {\r\n    Sk.execPaused = Date.now();\r\n};\r\nSk.exportSymbol(\"Sk.misceval.pauseTimer\", Sk.misceval.pauseTimer);\r\n\r\nSk.misceval.unpauseTimer = function () {\r\n    Sk.execPaused = Date.now() - Sk.execPaused;\r\n    Sk.execPausedAmount += Sk.execPaused;\r\n};\r\nSk.exportSymbol(\"Sk.misceval.unpauseTimer\", Sk.misceval.unpauseTimer);\r\n\r\nSk.misceval.timeoutCheck = function(d) {\r\n    if (Sk.execLimit !== null && d - Sk.execStart - Sk.execPausedAmount > Sk.execLimit) {\r\n        let shouldContinue = null;\r\n        if (Sk.timeoutHandler) {\r\n            Sk.misceval.pauseTimer();\r\n            shouldContinue = Sk.timeoutHandler(d - Sk.execStart - Sk.execPausedAmount, Sk.execLimit);\r\n            Sk.misceval.unpauseTimer();\r\n        }\r\n        if (!shouldContinue) {\r\n            throw new Sk.builtin.TimeoutError(Sk.timeoutMsg());\r\n        }\r\n    }\r\n};\r\nSk.exportSymbol(\"Sk.misceval.timeoutCheck\", Sk.misceval.timeoutCheck);\r\n\r\nSk.misceval.injectSusp = function($child,$blk,$loc,$gbl,$exc,$err,$postfinally,$filename,$lineno,$colno,$source,$tmps) {\r\n    var susp = new Sk.misceval.Suspension();\r\n    susp.child=$child;\r\n    susp.data=susp.child.data;\r\n    susp.$blk=$blk;\r\n    susp.$loc=$loc;\r\n    susp.$gbl=$gbl;\r\n    susp.$exc=$exc;\r\n    susp.$err=$err;\r\n    susp.$postfinally=$postfinally;\r\n    susp.$filename=$filename;\r\n    susp.$lineno=$lineno;\r\n    susp.$colno=$colno;\r\n    susp.source=$source;\r\n    susp.optional=susp.child.optional;\r\n    susp.$tmps=$tmps;\r\n    return susp;\r\n};\r\nSk.exportSymbol(\"Sk.misceval.injectSusp\", Sk.misceval.injectSusp);\r\n\r\nSk.misceval.errorUL = function (mangled) {\r\n    throw new Sk.builtin.UnboundLocalError(\"local variable '\" + mangled + \"' referenced before assignment\");\r\n};\r\nSk.exportSymbol(\"Sk.misceval.errorUL\", Sk.misceval.errorUL);\r\n\r\nSk.misceval.loadattr = function(val, mname) {\r\n    $ret = val.tp$getattr(mname, true);\r\n    if ($ret === undefined) {\r\n        const error_name = val.sk$type ? \"type object '\"+val.prototype.tp$name+\"\\'\" : \"'\"+ Sk.abstr.typeName(val) +\"' object\";\r\n        throw new Sk.builtin.AttributeError(error_name+\" has no attribute '\"+mname.$jsstr()+\"'\");\r\n    }\r\n    return $ret;\r\n/*out(\"$ret = \", val, \".tp$getattr(\", mname, \", true);\");\r\n                    out(\"\\nif ($ret === undefined) {\");\r\n                    out(\"\\nconst error_name =\", val, \".sk$type ? \\\"type object '\\\" +\", val, \".prototype.tp$name + \\\"'\\\" : \\\"'\\\" + Sk.abstr.typeName(\", val, \") + \\\"' object\\\";\");\r\n                    out(\"\\nthrow new Sk.builtin.AttributeError(error_name + \\\" has no attribute '\\\" + \", mname, \".$jsstr() + \\\"'\\\");\");\r\n                    out(\"\\n};\");*/\r\n};\r\nSk.exportSymbol(\"Sk.misceval.loadattr\", Sk.misceval.loadattr);\r\n","/**\r\n * @constructor\r\n * @extends {Sk.builtin.object}\r\n */\r\nSk.builtin.module = Sk.abstr.buildNativeClass(\"module\", {\r\n    constructor: function module_() {\r\n        this.$d = {}; // set this now - we could subclass from Module so override sk$klass $d object\r\n    },\r\n    slots: {\r\n        tp$doc: \"Create a module object.\\n\\nThe name must be a string; the optional doc argument can have any type.\",\r\n        tp$getattr(pyName, canSuspend) {\r\n            let customGetAttr = this.$d[\"__getattr__\"];\r\n            if (customGetAttr) {\r\n                const ret = Sk.misceval.callsimArray(customGetAttr, [pyName]);\r\n                if (ret !== undefined) {\r\n                    return ret;\r\n                }\r\n            }\r\n            const jsMangled = pyName.$mangled;\r\n            const ret = this.$d[jsMangled];\r\n            if (ret !== undefined) {\r\n                return ret;\r\n            }\r\n            // technically this is the wrong way round but its seems performance wise better\r\n            // to just return the module elements before checking for descriptors\r\n            const descr = this.ob$type.$typeLookup(pyName);\r\n            if (descr !== undefined) {\r\n                const f = descr.tp$descr_get;\r\n                if (f) {\r\n                    return f.call(descr, this, this.ob$type, canSuspend);\r\n                }\r\n                return descr;\r\n            }\r\n            // ok we've failed to find anything check if there is __getattr__ defined as per pep 562\r\n            const getattr = this.$d.__getattr__;\r\n            if (getattr !== undefined) {\r\n                const res  = Sk.misceval.tryCatch(\r\n                    () => Sk.misceval.callsimOrSuspendArray(getattr, [pyName]),\r\n                    (e) => {\r\n                        if (e instanceof Sk.builtin.AttributeError) {\r\n                            return;\r\n                        }\r\n                        throw e;\r\n                    }\r\n                );\r\n                return canSuspend ? res : Sk.misceval.retryOptionalSuspensionOrThrow(res);\r\n            }\r\n        },\r\n        tp$setattr: Sk.generic.setAttr,\r\n        tp$new: Sk.generic.new,\r\n        tp$init(args, kwargs) {\r\n            const [name, doc] = Sk.abstr.copyKeywordsToNamedArgs(\"module\", [\"name\", \"doc\"], args, kwargs, [Sk.builtin.none.none$]);\r\n            Sk.builtin.pyCheckType(\"module\", \"string\", name);\r\n            this.init$dict(name, doc);\r\n        },\r\n        $r() {\r\n            let name = this.get$name();\r\n            if (name !== undefined) {\r\n                const module_reprf = this.get$mod_reprf();\r\n                if (module_reprf !== undefined) {\r\n                    return Sk.misceval.callsimOrSuspendArray(module_reprf, [this]);\r\n                }\r\n            }\r\n            name = name === undefined ? \"'?'\" : name;\r\n            let extra = this.from$file();\r\n            extra = extra === undefined ? this.empty_or$loader() : extra;\r\n            return new Sk.builtin.str(\"<module \" + name + extra + \">\");\r\n        },\r\n    },\r\n    getsets: {\r\n        __dict__: {\r\n            $get() {\r\n                // modules in skulpt have a $d as a js object so just return it as a mapping proxy;\r\n                // TODO we should really have a dict object \r\n                return new Sk.builtin.mappingproxy(this.$d);\r\n            },\r\n        },\r\n    },\r\n    methods: {\r\n        __dir__: {\r\n            $meth() {\r\n                // could be cleaner but this is inline with cpython's version\r\n                const dict = this.tp$getattr(Sk.builtin.str.$dict);\r\n                if (!Sk.builtin.checkMapping(dict)) {\r\n                    throw new Sk.builtin.TypeError(\"__dict__ is not a dictionary\");\r\n                }\r\n                const dirfunc = dict.mp$lookup(Sk.builtin.str.$dir);\r\n                if (dirfunc !== undefined) {\r\n                    return Sk.misceval.callsimOrSuspendArray(dirfunc, []);\r\n                } else {\r\n                    return new Sk.builtin.list(Sk.misceval.arrayFromIterable(dict));\r\n                }\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $doc: \"__dir__() -> list\\nspecialized dir() implementation\",\r\n        },\r\n    },\r\n    proto: {\r\n        init$dict(name, doc) {\r\n            this.$d.__name__ = name;\r\n            this.$d.__doc__ = doc;\r\n            this.$d.__package__ = Sk.builtin.none.none$;\r\n            this.$d.__spec__ = Sk.builtin.none.none$;\r\n            this.$d.__loader__ = Sk.builtin.none.none$;\r\n        },\r\n        sk$attrError() {\r\n            let name = this.get$name();\r\n            name = name === undefined ? \"module\" : \"module \" + name;\r\n            if (this.$initializing) {\r\n                name = \"(most likely due to a circular import) partially initialized \" + name;\r\n            }\r\n            return name;\r\n        },\r\n        get$name() {\r\n            const name = this.tp$getattr(Sk.builtin.str.$name);\r\n            return name && Sk.misceval.objectRepr(name);\r\n        },\r\n        from$file() {\r\n            const file = this.tp$getattr(Sk.builtin.str.$file);\r\n            return file && \" from \" + Sk.misceval.objectRepr(file);\r\n        },\r\n        empty_or$loader() {\r\n            if (this.$js && this.$js.includes(\"$builtinmodule\")) {\r\n                return \" (built-in)\";\r\n            }\r\n            const loader = this.tp$getattr(Sk.builtin.str.$loader);\r\n            return loader === undefined || Sk.builtin.checkNone(loader) ? \"\" : \" (\" + Sk.misceval.objectRepr(loader) + \")\";\r\n        },\r\n        get$mod_reprf() {\r\n            const loader = this.tp$getattr(Sk.builtin.str.$loader);\r\n            return loader && loader.tp$getattr(this.str$mod_repr);\r\n        },\r\n        str$mod_repr: new Sk.builtin.str(\"module_repr\"),\r\n    },\r\n});\r\n\r\nSk.exportSymbol(\"Sk.builtin.module\", Sk.builtin.module);\r\n","/**\r\n * @constructor\r\n * \r\n * @extends {Sk.builtin.object}\r\n *\r\n * @description\r\n * It would be rare to call this as a constructor since it returns {@link Sk.builtin.none.none$}\r\n */\r\nSk.builtin.none = Sk.abstr.buildNativeClass(\"NoneType\", {\r\n    constructor: function NoneType() {\r\n        return Sk.builtin.none.none$; // always return the same object\r\n    },\r\n    slots: /**@lends {Sk.builtin.none.prototype}*/ {\r\n        tp$new(args, kwargs) {\r\n            Sk.abstr.checkNoArgs(\"NoneType\", args, kwargs);\r\n            return Sk.builtin.none.none$;\r\n        },\r\n        $r() {\r\n            return new Sk.builtin.str(\"None\");\r\n        },\r\n        tp$as_number: true,\r\n        nb$bool() {\r\n            return false;\r\n        },\r\n    },\r\n    flags: {\r\n        sk$unacceptableBase: true,\r\n    },\r\n});\r\n\r\n/**\r\n * Python None value.\r\n * @type {Sk.builtin.none}\r\n * @member {Sk.builtin.none}\r\n */\r\nSk.builtin.none.none$ = /** @type {Sk.builtin.none} */ (Object.create(Sk.builtin.none.prototype, {\r\n    v: { value: null, enumerable: true },\r\n}));\r\n\r\n/**\r\n * @constructor\r\n * Sk.builtin.NotImplemented\r\n *\r\n * @extends {Sk.builtin.object}\r\n */\r\nSk.builtin.NotImplemented = Sk.abstr.buildNativeClass(\"NotImplementedType\", {\r\n    constructor: function NotImplementedType() {\r\n        return Sk.builtin.NotImplemented.NotImplemented$; // always return the same object\r\n    },\r\n    slots: /**@lends {Sk.builtin.NotImplemented.prototype}*/ {\r\n        $r() {\r\n            return new Sk.builtin.str(\"NotImplemented\");\r\n        },\r\n        tp$new (args, kwargs) {\r\n            Sk.abstr.checkNoArgs(\"NotImplementedType\", args, kwargs);\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        },\r\n    },\r\n    flags: {\r\n        sk$unacceptableBase: true,\r\n    }\r\n});\r\n\r\n/**\r\n * Python NotImplemented constant.\r\n * @type {Sk.builtin.NotImplemented}\r\n * @member {Sk.builtin.NotImplemented}\r\n */\r\nSk.builtin.NotImplemented.NotImplemented$ = /** @type {Sk.builtin.NotImplemented} */ (Object.create(Sk.builtin.NotImplemented.prototype, {\r\n    v: { value: null, enumerable: true },\r\n}));\r\n\r\n\r\nconst EllipsisType = Sk.abstr.buildNativeClass(\"ellipsis\", {\r\n    constructor: function ellipsis() {\r\n        return Sk.builtin.Ellipsis;\r\n    }, \r\n    slots : {\r\n        tp$new(args, kwargs) {\r\n            Sk.abstr.checkNoArgs(\"ellipsis\", args, kwargs);\r\n            return Sk.builtin.Ellipsis;\r\n        },\r\n        $r() {\r\n            return new Sk.builtin.str(\"Ellipsis\");\r\n        }\r\n    },\r\n    flags: {\r\n        sk$unacceptableBase: true,\r\n    }\r\n});\r\n\r\nSk.builtin.Ellipsis = Object.create(EllipsisType.prototype, {v: { value: \"...\" }});","const hashMap = new Map();\r\n/**\r\n *\r\n * @constructor\r\n *\r\n * @description\r\n * Constructor for Python object. All Python classes (builtin and user-defined)\r\n * should inherit from this class.\r\n *\r\n */\r\nSk.builtin.object = Sk.abstr.buildNativeClass(\"object\", {\r\n    constructor: function object() {\r\n        Sk.asserts.assert(this instanceof Sk.builtin.object, \"bad call to object, use 'new'\");\r\n    },\r\n    base: null,\r\n    slots: {\r\n        tp$new(args, kwargs) {\r\n            // see cypthon object_new for algorithm details we do two versions one for prototypical and one for not\r\n            if (args.length || (kwargs && kwargs.length)) {\r\n                if (this.tp$new !== Sk.builtin.object.prototype.tp$new) {\r\n                    throw new Sk.builtin.TypeError(\"object.__new__() takes exactly one argument (the type to instantiate)\");\r\n                }\r\n                if (this.tp$init === Sk.builtin.object.prototype.tp$init) {\r\n                    throw new Sk.builtin.TypeError(Sk.abstr.typeName(this) + \"() takes no arguments\");\r\n                }\r\n            }\r\n            return new this.constructor();\r\n        },\r\n        tp$init(args, kwargs) {\r\n            // see cypthon object_init for algorithm details\r\n            if (args.length || (kwargs && kwargs.length)) {\r\n                if (this.tp$init !== Sk.builtin.object.prototype.tp$init) {\r\n                    throw new Sk.builtin.TypeError(\"object.__init__() takes exactly one argument (the instance to initialize)\");\r\n                }\r\n                if (this.tp$new === Sk.builtin.object.prototype.tp$new) {\r\n                    throw new Sk.builtin.TypeError(Sk.abstr.typeName(this) + \".__init__() takes exactly one argument (the instance to initialize)\");\r\n                }\r\n            }\r\n        },\r\n        tp$getattr: Sk.generic.getAttr,\r\n        tp$setattr: Sk.generic.setAttr,\r\n        $r() {\r\n            const mod = Sk.abstr.lookupSpecial(this, Sk.builtin.str.$module);\r\n            let cname = \"\";\r\n            if (mod && Sk.builtin.checkString(mod)) {\r\n                cname = mod.v + \".\";\r\n            }\r\n            return new Sk.builtin.str(\"<\" + cname + Sk.abstr.typeName(this) + \" object>\");\r\n        },\r\n        tp$str() {\r\n            // if we're calling this function then the object has no __str__ or tp$str defined\r\n            return this.$r();\r\n        },\r\n        tp$hash() {\r\n            let hash = hashMap.get(this);\r\n            if (hash !== undefined) {\r\n                return hash;\r\n            }\r\n            hash = Math.floor(Math.random() * Number.MAX_SAFE_INTEGER - Number.MAX_SAFE_INTEGER / 2);\r\n            hashMap.set(this, hash);\r\n            return hash;\r\n        },\r\n        tp$richcompare(other, op) {\r\n            let res;\r\n            switch (op) {\r\n                case \"Eq\":\r\n                    res = this === other || Sk.builtin.NotImplemented.NotImplemented$;\r\n                    break;\r\n                case \"NotEq\":\r\n                    res = this.ob$eq(other, \"Eq\");\r\n                    if (res !== Sk.builtin.NotImplemented.NotImplemented$) {\r\n                        res = !Sk.misceval.isTrue(res);\r\n                    }\r\n                    break;\r\n                default:\r\n                    res = Sk.builtin.NotImplemented.NotImplemented$;\r\n            }\r\n            return res;\r\n        },\r\n        tp$doc: \"The most base type\",\r\n    },\r\n    getsets: {\r\n        __class__: {\r\n            $get() {\r\n                return this.ob$type;\r\n            },\r\n            $set(value) {\r\n                if (value === undefined) {\r\n                    throw new Sk.builtin.TypeError(\"can't delete __class__ attribute\");\r\n                } else if (!Sk.builtin.checkClass(value)) {\r\n                    throw new Sk.builtin.TypeError(\"__class__ must be set to a class, not '\" + Sk.abstr.typeName(value) + \"' object\");\r\n                }\r\n                const oldto = this.ob$type;\r\n                const newto = value;\r\n\r\n                if (\r\n                    !(oldto.$isSubType(Sk.builtin.module) && newto.$isSubType(Sk.builtin.module)) &&\r\n                    (oldto.sk$klass === undefined || newto.sk$klass === undefined)\r\n                ) {\r\n                    throw new Sk.builtin.TypeError(\" __class__ assignment only supported for heap types or ModuleType subclasses\");\r\n                } else if (value.prototype.sk$builtinBase !== this.sk$builtinBase) {\r\n                    throw new Sk.builtin.TypeError(\r\n                        \"__class__ assignment: '\" + Sk.abstr.typeName(this) + \"' object layout differs from '\" + value.prototype.tp$name + \"'\"\r\n                    );\r\n                }\r\n                Object.setPrototypeOf(this, value.prototype);\r\n                return;\r\n            },\r\n            $doc: \"the object's class\",\r\n        },\r\n    },\r\n    methods: {\r\n        __dir__: {\r\n            $meth: function __dir__() {\r\n                let dir = [];\r\n                if (this.$d) {\r\n                    if (this.$d instanceof Sk.builtin.dict) {\r\n                        dir = this.$d.sk$asarray();\r\n                    } else {\r\n                        for (let key in this.$d) {\r\n                            dir.push(new Sk.builtin.str(key));\r\n                        }\r\n                    }\r\n                }\r\n                // here we use the type.__dir__ implementation\r\n                const type_dir = Sk.misceval.callsimArray(Sk.builtin.type.prototype.__dir__, [this.ob$type]);\r\n                // put the dict keys before the prototype keys\r\n                dir.push(...type_dir.v);\r\n                type_dir.v = dir;\r\n                return type_dir;\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $doc: \"Default dir() implementation.\",\r\n        },\r\n        __format__: {\r\n            $meth(format_spec) {\r\n                if (!Sk.builtin.checkString(format_spec)) {\r\n                    throw new Sk.builtin.TypeError(\"__format__() argument must be str, not \" + Sk.abstr.typeName(format_spec));\r\n                } else if (format_spec !== Sk.builtin.str.$empty) {\r\n                    throw new Sk.builtin.TypeError(`unsupported format string passed to ${Sk.abstr.typeName(this)}.__format__`);\r\n                }\r\n                return this.tp$str();\r\n            },\r\n            $flags: {OneArg: true},\r\n            $doc: \"Default object formatter.\",\r\n        },\r\n    },\r\n    proto: /**@lends {Sk.builtin.object.prototype}*/ {\r\n        valueOf: Object.prototype.valueOf,\r\n        toString: function() {\r\n            //console.log(\"Calling toString on\", this);\r\n            //debugger;\r\n            return this.tp$str().v;\r\n        },\r\n        hasOwnProperty: Object.prototype.hasOwnProperty,\r\n        ht$type: undefined,\r\n        // private method used for error messages\r\n        sk$attrError() {\r\n            return \"'\" + this.tp$name + \"' object\";\r\n        },\r\n    },\r\n});\r\n\r\n/**\r\n * @description\r\n * We aim to match python and javascript inheritance like\r\n * type   instanceof object => true\r\n * object instanceof type   => true\r\n * type   instanceof type   => true\r\n * object instanceof object => true\r\n *\r\n * type   subclassof object => type.prototype   instanceof object => true\r\n * object subclassof type   => object.prototype instanceof type   => false\r\n *\r\n * this algorithm achieves the equivalent with the following prototypical chains\r\n * using `Object.setPrototypeOf`\r\n *\r\n * ```\r\n * type.__proto__             = type.prototype   (type   instanceof type  )\r\n * type.__proto__.__proto__   = object.prototype (type   instanceof object)\r\n * type.prototype.__proto__   = object.prototype (type   subclassof object)\r\n * object.__proto__           = type.prototype   (object instanceof type  )\r\n * object.__proto__.__proto__ = object.prototype (object instanceof object)\r\n * ```\r\n *\r\n * while `Object.setPrototypeOf` is not considered [good practice](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/setPrototypeOf)\r\n * this is a particularly unique use case and creates a lot of prototypical benefits\r\n * all single inheritance classes (i.e. all builtins) now follow prototypical inheritance\r\n * similarly it makes metclasses that much easier to implement\r\n * Object.setPrototypeOf is also a feature built into the javascript language\r\n *\r\n * @ignore\r\n */\r\n(function setUpBaseInheritance() {\r\n    Sk.abstr.setUpInheritance(\"type\", Sk.builtin.type, Sk.builtin.object);\r\n    Sk.abstr.setUpBuiltinMro(Sk.builtin.type);\r\n})();\r\n\r\n","// low level parser to a concrete syntax tree, derived from cpython's lib2to3\r\n\r\n/**\r\n *\r\n * @constructor\r\n * @param {Object} grammar\r\n *\r\n * p = new Parser(grammar);\r\n * p.setup([start]);\r\n * foreach input token:\r\n *     if p.addtoken(...):\r\n *         break\r\n * root = p.rootnode\r\n *\r\n * can throw SyntaxError\r\n */\r\nfunction Parser(filename, grammar) {\r\n    this.filename = filename;\r\n    this.grammar = grammar;\r\n    this.comments = {};\r\n    this.p_flags = 0;\r\n    return this;\r\n}\r\n\r\n// all possible parser flags\r\nParser.FUTURE_PRINT_FUNCTION = \"print_function\";\r\nParser.FUTURE_UNICODE_LITERALS = \"unicode_literals\";\r\nParser.FUTURE_DIVISION = \"division\";\r\nParser.FUTURE_ABSOLUTE_IMPORT = \"absolute_import\";\r\nParser.FUTURE_WITH_STATEMENT = \"with_statement\";\r\nParser.FUTURE_NESTED_SCOPES = \"nested_scopes\";\r\nParser.FUTURE_GENERATORS = \"generators\";\r\nParser.CO_FUTURE_PRINT_FUNCTION = 0x10000;\r\nParser.CO_FUTURE_UNICODE_LITERALS = 0x20000;\r\nParser.CO_FUTURE_DIVISON = 0x2000;\r\nParser.CO_FUTURE_ABSOLUTE_IMPORT = 0x4000;\r\nParser.CO_FUTURE_WITH_STATEMENT = 0x8000;\r\n\r\nParser.prototype.setup = function (start) {\r\n    var stackentry;\r\n    var newnode;\r\n    start = start || this.grammar.start;\r\n    //print(\"START:\"+start);\r\n\r\n    newnode =\r\n        {\r\n            type: start,\r\n            value: null,\r\n            context: null,\r\n            children: []\r\n        };\r\n    stackentry =\r\n        {\r\n            dfa: this.grammar.dfas[start],\r\n            state: 0,\r\n            node: newnode\r\n        };\r\n    this.stack = [stackentry];\r\n    this.used_names = {};\r\n    Sk._setupTokenRegexes();\r\n};\r\n\r\nfunction findInDfa(a, obj) {\r\n    var i = a.length;\r\n    while (i--) {\r\n        if (a[i][0] === obj[0] && a[i][1] === obj[1]) {\r\n            return true;\r\n        }\r\n    }\r\n    return false;\r\n}\r\n\r\n// Add a comment\r\nParser.prototype.addcomment = function (value, start, end, line) {\r\n    this.comments[start] = value;\r\n};\r\n\r\n\r\n// Add a token; return true if we're done\r\nParser.prototype.addtoken = function (type, value, context) {\r\n    var errline;\r\n    var itsfirst;\r\n    var itsdfa;\r\n    var state;\r\n    var v;\r\n    var t;\r\n    var newstate;\r\n    var i;\r\n    var a;\r\n    var arcs;\r\n    var first;\r\n    var states;\r\n    var tp;\r\n    var ilabel = this.classify(type, value, context);\r\n    //print(\"ilabel:\"+ilabel);\r\n\r\n    OUTERWHILE:\r\n    while (true) {\r\n        tp = this.stack[this.stack.length - 1];\r\n        states = tp.dfa[0];\r\n        first = tp.dfa[1];\r\n        arcs = states[tp.state];\r\n\r\n        // look for a state with this label\r\n        for (a = 0; a < arcs.length; ++a) {\r\n            i = arcs[a][0];\r\n            newstate = arcs[a][1];\r\n            t = this.grammar.labels[i][0];\r\n            v = this.grammar.labels[i][1];\r\n            if (ilabel === i) {\r\n                // look it up in the list of labels\r\n                Sk.asserts.assert(t < 256);\r\n                // shift a token; we're done with it\r\n                this.shift(type, value, newstate, context);\r\n                // pop while we are in an accept-only state\r\n                state = newstate;\r\n                //print(\"before:\"+JSON.stringify(states[state]) + \":state:\"+state+\":\"+JSON.stringify(states[state]));\r\n                /* jshint ignore:start */\r\n                while (states[state].length === 1\r\n                    && states[state][0][0] === 0\r\n                    && states[state][0][1] === state) {\r\n                    // states[state] == [(0, state)])\r\n                    this.pop();\r\n                    //print(\"in after pop:\"+JSON.stringify(states[state]) + \":state:\"+state+\":\"+JSON.stringify(states[state]));\r\n                    if (this.stack.length === 0) {\r\n                        // done!\r\n                        return true;\r\n                    }\r\n                    tp = this.stack[this.stack.length - 1];\r\n                    state = tp.state;\r\n                    states = tp.dfa[0];\r\n                    first = tp.dfa[1];\r\n                    //print(JSON.stringify(states), JSON.stringify(first));\r\n                    //print(\"bottom:\"+JSON.stringify(states[state]) + \":state:\"+state+\":\"+JSON.stringify(states[state]));\r\n                }\r\n                /* jshint ignore:end */\r\n                // done with this token\r\n                //print(\"DONE, return false\");\r\n                return false;\r\n            } else if (t >= 256) {\r\n                itsdfa = this.grammar.dfas[t];\r\n                itsfirst = itsdfa[1];\r\n                if (itsfirst.hasOwnProperty(ilabel)) {\r\n                    // push a symbol\r\n                    this.push(t, this.grammar.dfas[t], newstate, context);\r\n                    continue OUTERWHILE;\r\n                }\r\n            }\r\n        }\r\n\r\n        //print(\"findInDfa: \" + JSON.stringify(arcs)+\" vs. \" + tp.state);\r\n        if (findInDfa(arcs, [0, tp.state])) {\r\n            // an accepting state, pop it and try something else\r\n            //print(\"WAA\");\r\n            this.pop();\r\n            if (this.stack.length === 0) {\r\n                throw new Sk.builtin.SyntaxError(\"too much input\", this.filename, ...flatten_context(context));\r\n            }\r\n        } else {\r\n            // no transition\r\n            throw new Sk.builtin.SyntaxError(\"bad input\", this.filename, ...flatten_context(context));\r\n        }\r\n    }\r\n};\r\n\r\nfunction flatten_context(context) {\r\n    return [context[2], context[0][0], context[0][1], context[1][0], context[1][1]];\r\n}\r\n\r\n// turn a token into a label\r\nParser.prototype.classify = function (type, value, context) {\r\n    var ilabel;\r\n    if (type === Sk.token.tokens.T_NAME) {\r\n        this.used_names[value] = true;\r\n        ilabel = this.grammar.keywords.hasOwnProperty(value) && this.grammar.keywords[value];\r\n\r\n        /* Check for handling print as a builtin function */\r\n        if (value === \"print\" && (this.p_flags & Parser.CO_FUTURE_PRINT_FUNCTION || Sk.__future__.print_function === true)) {\r\n            ilabel = false; // ilabel determines if the value is a keyword\r\n        }\r\n\r\n        if (ilabel) {\r\n            //print(\"is keyword\");\r\n            return ilabel;\r\n        }\r\n    }\r\n    ilabel = this.grammar.tokens.hasOwnProperty(type) && this.grammar.tokens[type];\r\n    if (!ilabel) {\r\n        // throw new Sk.builtin.SyntaxError(\"bad token\", type, value, context);\r\n        // Questionable modification to put line number in position 2\r\n        // like everywhere else and filename in position 1.\r\n        let descr = \"#\" + type;\r\n        for (let i in Sk.token.tokens) {\r\n            if (Sk.token.tokens[i] == type) {\r\n                descr = i;\r\n                break;\r\n            }\r\n        }\r\n\r\n        throw new Sk.builtin.SyntaxError(\"bad token \" + descr, this.filename, ...flatten_context(context));\r\n    }\r\n    return ilabel;\r\n};\r\n\r\n// shift a token\r\nParser.prototype.shift = function (type, value, newstate, context) {\r\n    var dfa = this.stack[this.stack.length - 1].dfa;\r\n    var state = this.stack[this.stack.length - 1].state;\r\n    var node = this.stack[this.stack.length - 1].node;\r\n    //print(\"context\", context);\r\n    var newnode = {\r\n        type: type,\r\n        value: value,\r\n        lineno: context[0][0],\r\n        col_offset: context[0][1],\r\n        end_lineno: context[1][0],\r\n        end_col_offset: context[1][1],\r\n        children: null\r\n    };\r\n    if (newnode) {\r\n        node.children.push(newnode);\r\n    }\r\n    this.stack[this.stack.length - 1] = {\r\n        dfa: dfa,\r\n        state: newstate,\r\n        node: node\r\n    };\r\n};\r\n\r\n// push a nonterminal\r\nParser.prototype.push = function (type, newdfa, newstate, context) {\r\n    var dfa = this.stack[this.stack.length - 1].dfa;\r\n    var node = this.stack[this.stack.length - 1].node;\r\n    var newnode = {\r\n        type: type,\r\n        value: null,\r\n        lineno: context[0][0],\r\n        col_offset: context[0][1],\r\n        end_lineno: context[1][0],\r\n        end_col_offset: context[1][1],\r\n        children: []\r\n    };\r\n    this.stack[this.stack.length - 1] = {\r\n        dfa: dfa,\r\n        state: newstate,\r\n        node: node\r\n    };\r\n    this.stack.push({\r\n        dfa: newdfa,\r\n        state: 0,\r\n        node: newnode\r\n    });\r\n};\r\n\r\n//var ac = 0;\r\n//var bc = 0;\r\n\r\n// pop a nonterminal\r\nParser.prototype.pop = function () {\r\n    var node;\r\n    var pop = this.stack.pop();\r\n    var newnode = pop.node;\r\n    //print(\"POP\");\r\n    if (newnode) {\r\n        //print(\"A\", ac++, newnode.type);\r\n        //print(\"stacklen:\"+this.stack.length);\r\n        if (this.stack.length !== 0) {\r\n            //print(\"B\", bc++);\r\n            node = this.stack[this.stack.length - 1].node;\r\n            node.children.push(newnode);\r\n        } else {\r\n            //print(\"C\");\r\n            this.rootnode = newnode;\r\n            this.rootnode.used_names = this.used_names;\r\n        }\r\n    }\r\n};\r\n\r\n/**\r\n * parser for interactive input. returns a function that should be called with\r\n * lines of input as they are entered. the function will return false\r\n * until the input is complete, when it will return the rootnode of the parse.\r\n *\r\n * @param {string} filename\r\n * @param {string=} style root of parse tree (optional)\r\n */\r\nfunction makeParser(filename, style) {\r\n    if (style === undefined) {\r\n        style = \"file_input\";\r\n    }\r\n    var p = new Parser(filename, Sk.ParseTables);\r\n    // for closure's benefit\r\n    if (style === \"file_input\") {\r\n        p.setup(Sk.ParseTables.sym.file_input);\r\n    } else {\r\n        Sk.asserts.fail(\"todo;\");\r\n    }\r\n    return p;\r\n}\r\n\r\nSk.parse = function parse(filename, input) {\r\n\r\n    var T_COMMENT = Sk.token.tokens.T_COMMENT;\r\n    var T_NL = Sk.token.tokens.T_NL;\r\n    var T_OP = Sk.token.tokens.T_OP;\r\n    var T_ENDMARKER = Sk.token.tokens.T_ENDMARKER;\r\n    var T_ENCODING = Sk.token.tokens.T_ENCODING;\r\n\r\n    var endmarker_seen = false;\r\n    var parser = makeParser(filename);\r\n    var totalLines = 0;\r\n\r\n    /**\r\n     * takes a string splits it on '\\n' and returns a function that returns\r\n     * @param {Array<string>} input\r\n     * @returns {function(): string}\r\n     */\r\n    function readline(input) {\r\n        let lines = input.split(\"\\n\");\r\n        Sk.parse.linecache[filename] = lines.slice();\r\n        lines = lines.reverse();\r\n        totalLines = lines.length;\r\n\r\n        return function () {\r\n            if (lines.length === 0) {\r\n                throw new Sk.builtin.Exception(\"EOF\");\r\n            }\r\n\r\n            return lines.pop() + \"\\n\";\r\n        };\r\n    }\r\n\r\n    Sk._tokenize(readline(input), \"utf-8\", function (tokenInfo) {\r\n        var s_lineno = tokenInfo.start[0];\r\n        var s_column = tokenInfo.start[1];\r\n        var type = null;\r\n        var prefix, lineno, column;\r\n\r\n        /* I don't know\r\n         if (s_lineno !== lineno && s_column !== column)\r\n         {\r\n         // todo; update prefix and line/col\r\n         }\r\n         */\r\n\r\n        if (tokenInfo.type === T_COMMENT || tokenInfo.type === T_NL || tokenInfo.type === T_ENCODING) {\r\n            prefix += tokenInfo.value;\r\n            lineno = tokenInfo.end[0];\r\n            column = tokenInfo.end[1];\r\n            if (tokenInfo.string[tokenInfo.string.length - 1] === \"\\n\") {\r\n                lineno += 1;\r\n                column = 0;\r\n            }\r\n\r\n            if (tokenInfo.type === T_COMMENT) {\r\n                parser.addcomment(tokenInfo.string, tokenInfo.start, tokenInfo.end, tokenInfo.line);\r\n            }\r\n        } else {\r\n            if (tokenInfo.type === T_OP) {\r\n                type = Sk.OpMap[tokenInfo.string];\r\n            }\r\n\r\n            parser.addtoken(type || tokenInfo.type, tokenInfo.string, [tokenInfo.start, tokenInfo.end, tokenInfo.line]);\r\n\r\n            if (tokenInfo.type === T_ENDMARKER) {\r\n                endmarker_seen = true;\r\n            }\r\n        }\r\n    }, filename);\r\n\r\n    if (!endmarker_seen) {\r\n        throw new Sk.builtin.SyntaxError(\"incomplete input\", this.filename, \"\", 0, 0, totalLines, 0);\r\n    }\r\n\r\n    /**\r\n     * Small adjustments here in order to return th flags and the cst\r\n     */\r\n    var result = {\"cst\": parser.rootnode, \"flags\": parser.p_flags, \"comments\": parser.comments};\r\n    return result;\r\n};\r\n\r\nSk.parse.linecache = {};\r\n\r\nSk.parseTreeDump = function parseTreeDump(n, indent) {\r\n    //return JSON.stringify(n, null, 2);\r\n    var i;\r\n    var ret;\r\n    indent = indent || \"\";\r\n    ret = \"\";\r\n    ret += indent;\r\n    if (n.type >= 256) { // non-term\r\n        ret += Sk.ParseTables.number2symbol[n.type] + \"\\n\";\r\n        for (i = 0; i < n.children.length; ++i) {\r\n            ret += Sk.parseTreeDump(n.children[i], indent + \"  \");\r\n        }\r\n    } else {\r\n        ret += Sk.token.tok_name[n.type] + \": \" + new Sk.builtin.str(n.value)[\"$r\"]().v + \"\\n\";\r\n    }\r\n    return ret;\r\n};\r\n\r\n\r\nSk.exportSymbol(\"Sk.Parser\", Parser);\r\nSk.exportSymbol(\"Sk.parse\", Sk.parse);\r\nSk.exportSymbol(\"Sk.parseTreeDump\", Sk.parseTreeDump);\r\nSk.exportSymbol(\"Sk.parse.linecache\", Sk.parse.linecache);\r\n","Sk.builtin.print = function print(args, kwargs) {\r\n    /** @todo flush is allowed but has no effect */\r\n    let [sep, end, file] = Sk.abstr.copyKeywordsToNamedArgs(\"print\", [\"sep\", \"end\", \"file\", \"flush\"], [], kwargs);\r\n\r\n    // check for sep; string or None\r\n    if (sep === undefined || Sk.builtin.checkNone(sep)) {\r\n        sep = \" \";\r\n    } else if (Sk.builtin.checkString(sep)) {\r\n        sep = sep.$jsstr();\r\n        } else {\r\n        throw new Sk.builtin.TypeError(\"sep must be None or a string, not \" + Sk.abstr.typeName(sep));\r\n    }\r\n\r\n    // check for end; string or None\r\n    if (end === undefined || Sk.builtin.checkNone(end)) {\r\n        end = \"\\n\";\r\n    } else if (Sk.builtin.checkString(end)) {\r\n        end = end.$jsstr();\r\n        } else {\r\n        throw new Sk.builtin.TypeError(\"end must be None or a string, not \" + Sk.abstr.typeName(end));\r\n    }\r\n\r\n    // check for file and get the file_write function if it exists\r\n    let file_write;\r\n    if (file !== undefined && !Sk.builtin.checkNone(file)) {\r\n        file_write = Sk.abstr.lookupSpecial(file, Sk.builtin.str.$write);\r\n        if (file_write === undefined) {\r\n            throw new Sk.builtin.AttributeError(\"'\" + Sk.abstr.typeName(file) + \"' object has no attribute 'write'\");\r\n        }\r\n    }\r\n\r\n    // loop through outputs and create output string\r\n    const output = new Sk.builtin.str(args.map((x) => new Sk.builtin.str(x).toString()).join(sep) + end);\r\n\r\n    if (file_write !== undefined) {\r\n        // currently not tested, though it seems that we need to see how we should access the write function in a correct manner\r\n        Sk.misceval.callsimArray(file_write, [output]);\r\n    } else {\r\n        return Sk.misceval.chain(Sk.importModule(\"sys\", false, true), (sys) => {\r\n            file_write = Sk.abstr.lookupSpecial(sys.$d.stdout, Sk.builtin.str.$write);\r\n            return file_write && Sk.misceval.callsimOrSuspendArray(file_write, [output]);\r\n        });\r\n    }\r\n    \r\n    return Sk.builtin.none.none$;\r\n};\r\n\r\n// add this flag so that if Sk.misceval.call(Sk.builtin.print) is used then it knows how to deal with args\r\nSk.builtin.print.co_fastcall = 1;","/**\r\n * @constructor\r\n * @param {Sk.builtin.func} fget\r\n * @param {Sk.builtin.func} fset\r\n * @param {Sk.builtin.func} fdel\r\n * @param {Sk.builtin.str} doc\r\n */\r\nSk.builtin.property = Sk.abstr.buildNativeClass(\"property\", {\r\n    constructor: function property(fget, fset, fdel, doc) {\r\n        // this can be uses as an internal function\r\n        // typically these properties will be set in the init method\r\n        this.prop$get = fget || Sk.builtin.none.none$;\r\n        this.prop$set = fset || Sk.builtin.none.none$;\r\n        this.prop$del = fdel || Sk.builtin.none.none$;\r\n        this.prop$doc = doc || (fget && fget.$doc) || Sk.builtin.none.none$;\r\n    },\r\n    slots: {\r\n        tp$getattr: Sk.generic.getAttr,\r\n        tp$new: Sk.generic.new,\r\n        tp$init(args, kwargs) {\r\n            args = Sk.abstr.copyKeywordsToNamedArgs(\r\n                \"property\",\r\n                [\"fget\", \"fset\", \"fdel\", \"doc\"],\r\n                args,\r\n                kwargs,\r\n                new Array(4).fill(Sk.builtin.none.none$)\r\n            );\r\n\r\n            this.prop$get = args[0];\r\n            this.prop$set = args[1];\r\n            this.prop$del = args[2];\r\n            if (Sk.builtin.checkNone(args[3])) {\r\n                if (!Sk.builtin.checkNone(args[0])) {\r\n                    this.prop$doc = args[0].$doc || args[3];\r\n                }\r\n            } else {\r\n                this.prop$doc = args[3];\r\n            }\r\n        },\r\n        tp$doc:\r\n            \"Property attribute.\\n\\n  fget\\n    function to be used for getting an attribute value\\n  fset\\n    function to be used for setting an attribute value\\n  fdel\\n    function to be used for del'ing an attribute\\n  doc\\n    docstring\\n\\nTypical use is to define a managed attribute x:\\n\\nclass C(object):\\n    def getx(self): return self._x\\n    def setx(self, value): self._x = value\\n    def delx(self): del self._x\\n    x = property(getx, setx, delx, 'I'm the 'x' property.')\\n\\nDecorators make defining new properties or modifying existing ones easy:\\n\\nclass C(object):\\n    @property\\n    def x(self):\\n        'I am the 'x' property.'\\n        return self._x\\n    @x.setter\\n    def x(self, value):\\n        self._x = value\\n    @x.deleter\\n    def x(self):\\n        del self._x\",\r\n        tp$descr_get(obj, type) {\r\n            if (obj === null) {\r\n                return this;\r\n            }\r\n            if (this.prop$get === undefined) {\r\n                throw new Sk.builtin.AttributeError(\"unreadable attribute\");\r\n            }\r\n            return Sk.misceval.callsimOrSuspendArray(this.prop$get, [obj]);\r\n        },\r\n        tp$descr_set(obj, value) {\r\n            let func;\r\n            if (value == null) {\r\n                func = this.prop$del;\r\n            } else {\r\n                func = this.prop$set;\r\n            }\r\n            if (Sk.builtin.checkNone(func)) {\r\n                const msg = value == null ? \"delete\" : \"set\";\r\n                throw new Sk.builtin.AttributeError(\"can't \" + msg + \" attribute\");\r\n            }\r\n            if (!func.tp$call) {\r\n                throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(func) + \"' is not callable\");\r\n            }\r\n\r\n            if (value == null) {\r\n                return func.tp$call([obj]);\r\n            } else {\r\n                return func.tp$call([obj, value]);\r\n            }\r\n        },\r\n    },\r\n    methods: {\r\n        getter: {\r\n            $meth(fget) {\r\n                return new Sk.builtin.property(fget, this.prop$set, this.prop$del, this.prop$doc);\r\n            },\r\n            $flags: {OneArg: true},\r\n        },\r\n        setter: {\r\n            $meth(fset) {\r\n                return new Sk.builtin.property(this.prop$get, fset, this.prop$del, this.prop$doc);\r\n            },\r\n            $flags: {OneArg: true},\r\n        },\r\n        deleter: {\r\n            $meth(fdel) {\r\n                return new Sk.builtin.property(this.prop$get, this.prop$set, fdel, this.prop$doc);\r\n            },\r\n            $flags: {OneArg: true},\r\n        },\r\n    },\r\n    getsets: {\r\n        fget: {\r\n            $get() {\r\n                return this.prop$get;\r\n            },\r\n        },\r\n        fset: {\r\n            $get() {\r\n                return this.prop$set;\r\n            },\r\n        },\r\n        fdel: {\r\n            $get() {\r\n                return this.prop$del;\r\n            },\r\n        },\r\n        __doc__: {\r\n            $get() {\r\n                return this.prop$doc;\r\n            },\r\n            $set(value) {\r\n                value = value || Sk.builtin.none.none$;\r\n                this.prop$doc = value;\r\n            }\r\n        },\r\n    },\r\n});\r\n\r\n/**\r\n * @constructor\r\n * @param {Sk.builtin.func} callable\r\n */\r\n\r\nSk.builtin.classmethod = Sk.abstr.buildNativeClass(\"classmethod\", {\r\n    constructor: function classmethod(callable) {\r\n        // this can be used as an internal function\r\n        // typically callable will be set in the init method if being called by python\r\n        this.cm$callable = callable;\r\n        this.$d = new Sk.builtin.dict();\r\n    },\r\n    slots: {\r\n        tp$getattr: Sk.generic.getAttr,\r\n        tp$new: Sk.generic.new,\r\n        tp$init(args, kwargs) {\r\n            Sk.abstr.checkNoKwargs(\"classmethod\", kwargs);\r\n            Sk.abstr.checkArgsLen(\"classmethod\", args, 1, 1);\r\n            this.cm$callable = args[0];\r\n        },\r\n        tp$doc:\r\n            \"classmethod(function) -> method\\n\\nConvert a function to be a class method.\\n\\nA class method receives the class as implicit first argument,\\njust like an instance method receives the instance.\\nTo declare a class method, use this idiom:\\n\\n  class C:\\n      @classmethod\\n      def f(cls, arg1, arg2, ...):\\n          ...\\n\\nIt can be called either on the class (e.g. C.f()) or on an instance\\n(e.g. C().f()).  The instance is ignored except for its class.\\nIf a class method is called for a derived class, the derived class\\nobject is passed as the implied first argument.\\n\\nClass methods are different than C++ or Java static methods.\\nIf you want those, see the staticmethod builtin.\",\r\n        tp$descr_get(obj, type) {\r\n            const callable = this.cm$callable;\r\n            if (callable === undefined) {\r\n                throw new Sk.builtin.RuntimeError(\"uninitialized classmethod object\");\r\n            }\r\n            if (type === undefined) {\r\n                type = obj.ob$type;\r\n            }\r\n            const f = callable.tp$descr_get;\r\n            if (f) {\r\n                return f.call(callable, type);\r\n            }\r\n            return new Sk.builtin.method(callable, type);\r\n        },\r\n    },\r\n    getsets: {\r\n        __func__: {\r\n            $get() {\r\n                return this.cm$callable;\r\n            },\r\n        },\r\n        __dict__: Sk.generic.getSetDict,\r\n    },\r\n});\r\n\r\n/**\r\n * @constructor\r\n * @param {Sk.builtin.func} callable\r\n */\r\n\r\nSk.builtin.staticmethod = Sk.abstr.buildNativeClass(\"staticmethod\", {\r\n    constructor: function staticmethod(callable) {\r\n        // this can be used as an internal function\r\n        // typically callable will be set in the init method if being called by python\r\n        this.sm$callable = callable;\r\n        this.$d = new Sk.builtin.dict();\r\n    },\r\n    slots: {\r\n        tp$getattr: Sk.generic.getAttr,\r\n        tp$new: Sk.generic.new,\r\n        tp$init(args, kwargs) {\r\n            Sk.abstr.checkNoKwargs(\"staticmethod\", kwargs);\r\n            Sk.abstr.checkArgsLen(\"staticmethod\", args, 1, 1);\r\n            this.sm$callable = args[0];\r\n        },\r\n        tp$doc:\r\n            \"staticmethod(function) -> method\\n\\nConvert a function to be a static method.\\n\\nA static method does not receive an implicit first argument.\\nTo declare a static method, use this idiom:\\n\\n     class C:\\n         @staticmethod\\n         def f(arg1, arg2, ...):\\n             ...\\n\\nIt can be called either on the class (e.g. C.f()) or on an instance\\n(e.g. C().f()).  The instance is ignored except for its class.\\n\\nStatic methods in Python are similar to those found in Java or C++.\\nFor a more advanced concept, see the classmethod builtin.\",\r\n        tp$descr_get(obj, type) {\r\n            if (this.sm$callable === undefined) {\r\n                throw new Sk.builtin.RuntimeError(\"uninitialized staticmethod object\");\r\n            }\r\n            return this.sm$callable;\r\n        },\r\n    },\r\n    getsets: {\r\n        __func__: {\r\n            $get() {\r\n                return this.sm$callable;\r\n            },\r\n        },\r\n        __dict__: Sk.generic.getSetDict,\r\n    },\r\n});\r\n","/**\r\n * @constructor\r\n * @param {number} start\r\n * @param {number} stop\r\n * @param {number} step\r\n * @param {Object} lst\r\n */\r\nSk.builtin.range_ = Sk.abstr.buildNativeClass(\"range\", {\r\n    constructor: function range(start, stop, step, lst) {\r\n        this.start = start;\r\n        this.stop = stop;\r\n        this.step = step;\r\n        this.v = lst;\r\n    },\r\n    slots: {\r\n        tp$getattr: Sk.generic.getAttr,\r\n        tp$as_sequence_or_mapping: true,\r\n        tp$doc:\r\n            \"range(stop) -> range object\\nrange(start, stop[, step]) -> range object\\n\\nReturn an object that produces a sequence of integers from start (inclusive)\\nto stop (exclusive) by step.  range(i, j) produces i, i+1, i+2, ..., j-1.\\nstart defaults to 0, and stop is omitted!  range(4) produces 0, 1, 2, 3.\\nThese are exactly the valid indices for a list of 4 elements.\\nWhen step is given, it specifies the increment (or decrement).\",\r\n        tp$new(args, kwargs) {\r\n            Sk.abstr.checkNoKwargs(\"range\", kwargs);\r\n            Sk.abstr.checkArgsLen(\"range\", args, 1, 3);\r\n            return rangeFromPy(args[0], args[1], args[2]);\r\n        },\r\n        $r() {\r\n            let repr = \"range(\" + this.start + \", \" + this.stop;\r\n            if (this.step != 1) {\r\n                repr += \", \" + this.step;\r\n            }\r\n            repr += \")\";\r\n            return new Sk.builtin.str(repr);\r\n        },\r\n        tp$richcompare(w, op) {\r\n            if ((op !== \"Eq\" && op !== \"NotEq\") || w.ob$type !== Sk.builtin.range_) {\r\n                return Sk.builtin.NotImplemented.NotImplemented$;\r\n            }\r\n            w = new Sk.builtin.list(w.v);\r\n            return new Sk.builtin.list(this.v).tp$richcompare(w, op);\r\n        },\r\n        tp$iter() {\r\n            return new range_iter_(this);\r\n        },\r\n        nb$bool() {\r\n            return this.v.length !== 0;\r\n        },\r\n        // sequence and mapping slots\r\n        sq$contains(item) {\r\n            const lst = this.v;\r\n            for (let i = 0; i < lst.length; i++) {\r\n                if (Sk.misceval.richCompareBool(item, lst[i], \"Eq\")) {\r\n                    return true;\r\n                }\r\n            }\r\n            return false;\r\n        },\r\n        sq$length() {\r\n            return this.v.length;\r\n        },\r\n        mp$subscript(index) {\r\n            if (Sk.misceval.isIndex(index)) {\r\n                let i = Sk.misceval.asIndexSized(index);\r\n                if (i < 0) {\r\n                    i = this.v.length + i;\r\n                }\r\n                if (i < 0 || i >= this.v.length) {\r\n                    throw new Sk.builtin.IndexError(\"range object index out of range\");\r\n                }\r\n                return this.v[i];\r\n            } else if (index.constructor === Sk.builtin.slice) {\r\n                const ret = [];\r\n                const lst = this.v;\r\n                index.sssiter$(lst.length, (i) => {\r\n                    ret.push(lst[i]);\r\n                });\r\n                let { start, stop, step } = index.slice$indices(lst.length);\r\n                start = Sk.misceval.asIndex(lst[start]) || this.start;\r\n                stop = Sk.misceval.asIndex(lst[stop]) || this.stop;\r\n                if (typeof this.step === \"number\") {\r\n                    step = step * this.step;\r\n                } else {\r\n                    step = JSBI.multiply(this.step, JSBI.BigInt(step));\r\n                }\r\n                return new Sk.builtin.range_(start, stop, step, ret);\r\n            }\r\n            throw new Sk.builtin.TypeError(\"range indices must be integers or slices, not \" + Sk.abstr.typeName(index));\r\n        },\r\n    },\r\n    getsets: {\r\n        start: {\r\n            $get() {\r\n                return new Sk.builtin.int_(this.start);\r\n            },\r\n        },\r\n        step: {\r\n            $get() {\r\n                return new Sk.builtin.int_(this.step);\r\n            },\r\n        },\r\n        stop: {\r\n            $get() {\r\n                return new Sk.builtin.int_(this.stop);\r\n            },\r\n        },\r\n    },\r\n    methods: {\r\n        __reversed__: {\r\n            $meth() {\r\n                return new reverserange_iter_(this);\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: null,\r\n            $doc: \"Return a reverse iterator.\",\r\n        },\r\n        // __reduce__: {\r\n        //     $meth: methods.__reduce__,\r\n        //     $flags:{},\r\n        //     $textsig: null,\r\n        //     $doc: \"\" },\r\n        count: {\r\n            $meth(item) {\r\n                let count = 0;\r\n                for (let i = 0; i < this.v.length; i++) {\r\n                    if (Sk.misceval.richCompareBool(item, this.v[i], \"Eq\")) {\r\n                        count++;\r\n                    }\r\n                }\r\n                return new Sk.builtin.int_(count);\r\n            },\r\n            $flags: {OneArg: true},\r\n            $textsig: null,\r\n            $doc: \"rangeobject.count(value) -> integer -- return number of occurrences of value\",\r\n        },\r\n        index: {\r\n            $meth(item) {\r\n                for (let i = 0; i < this.v.length; i++) {\r\n                    if (Sk.misceval.richCompareBool(item, this.v[i], \"Eq\")) {\r\n                        return new Sk.builtin.int_(i);\r\n                    }\r\n                }\r\n                throw new Sk.builtin.ValueError(Sk.misceval.objectRepr(item) + \"is not in range\");\r\n            },\r\n            $flags: {OneArg: true},\r\n            $textsig: null,\r\n            $doc: \"rangeobject.index(value, [start, [stop]]) -> integer -- return index of value.\\nRaise ValueError if the value is not present.\",\r\n        },\r\n    },\r\n    proto: {\r\n        sk$asarray() {\r\n            return this.v.slice(0);\r\n        },\r\n    },\r\n    flags: {\r\n        sk$unacceptableBase: true,\r\n    },\r\n});\r\n\r\nfunction rangeFromPy(start, stop, step) {\r\n    start = start === undefined ? start : Sk.misceval.asIndexOrThrow(start);\r\n    stop = stop === undefined ? stop : Sk.misceval.asIndexOrThrow(stop);\r\n    step = step === undefined ? step : Sk.misceval.asIndexOrThrow(step);\r\n    if (stop === undefined && step === undefined) {\r\n        stop = start;\r\n        start = 0;\r\n        step = 1;\r\n    } else if (step === undefined) {\r\n        step = 1;\r\n    } else if (step === 0) {\r\n        throw new Sk.builtin.ValueError(\"range() step argument must not be zero\");\r\n    }\r\n    const ret = [];\r\n    if (typeof start === \"number\" && typeof stop === \"number\" && typeof step === \"number\") {\r\n        if (step > 0) {\r\n            for (let i = start; i < stop; i += step) {\r\n                ret.push(new Sk.builtin.int_(i));\r\n            }\r\n        } else {\r\n            for (let i = start; i > stop; i += step) {\r\n                ret.push(new Sk.builtin.int_(i));\r\n            }\r\n        }\r\n    } else {\r\n        // This is going to be slow\r\n        let i;\r\n        start = i = JSBI.BigInt(start);\r\n        step = JSBI.BigInt(step);\r\n        stop = JSBI.BigInt(stop);\r\n        if (JSBI.greaterThan(step, JSBI.__ZERO)) {\r\n            while (JSBI.lessThan(i, stop)) {\r\n                ret.push(new Sk.builtin.int_(convertIfSafe(i)));\r\n                i = JSBI.add(i, step);\r\n            }\r\n        } else {\r\n            while (JSBI.greaterThan(i, stop)) {\r\n                ret.push(new Sk.builtin.int_(convertIfSafe(i)));\r\n                i = JSBI.add(i, step);\r\n            }\r\n        }\r\n        start = convertIfSafe(start);\r\n        step = convertIfSafe(step);\r\n        stop = convertIfSafe(stop);\r\n    }\r\n    return new Sk.builtin.range_(start, stop, step, ret);\r\n}\r\n\r\nvar range_iter_ = Sk.abstr.buildIteratorClass(\"range_iterator\", {\r\n    constructor: function range_iter_(range_obj) {\r\n        this.$index = 0;\r\n        this.$seq = range_obj.v;\r\n    },\r\n    iternext() {\r\n        return this.$seq[this.$index++];\r\n        // we could check that the index is not outside of range\r\n        // but it will still return undefined so no need?\r\n    },\r\n    methods: {\r\n        __length_hint__: Sk.generic.iterLengthHintWithArrayMethodDef,\r\n    },\r\n    flags: { sk$unacceptableBase: true },\r\n});\r\n\r\nvar reverserange_iter_ = Sk.abstr.buildIteratorClass(\"range_reverseiterator\", {\r\n    constructor: function range_iter(range_obj) {\r\n        this.$seq = range_obj.v;\r\n        this.$index = this.$seq.length - 1;\r\n    },\r\n    iternext() {\r\n        return this.$seq[this.$index--];\r\n    },\r\n    methods: {\r\n        __length_hint__: Sk.generic.iterReverseLengthHintMethodDef,\r\n    },\r\n    flags: { sk$unacceptableBase: true },\r\n});\r\n\r\nfunction convertIfSafe(v) {\r\n    if (JSBI.lessThan(v, JSBI.__MAX_SAFE) && JSBI.greaterThan(v, JSBI.__MIN_SAFE)) {\r\n        return JSBI.toNumber(v);\r\n    }\r\n    return v;\r\n}\r\n\r\n/**\r\n *\r\n * @description\r\n * Python 2 implementations of range and xrange\r\n *\r\n * @param {*} start\r\n * @param {*} stop\r\n * @param {*} step\r\n * @ignore\r\n */\r\nSk.builtin.range = Sk.builtin.xrange = function range(start, stop, step) {\r\n    const ret = rangeFromPy(start, stop, step);\r\n    return new Sk.builtin.list(ret.v);\r\n};\r\n","/**\r\n * @constructor\r\n * @param {Object} seq\r\n * @extends Sk.builtin.object\r\n */\r\nSk.builtin.reversed = Sk.abstr.buildIteratorClass(\"reversed\", {\r\n    constructor: function reversed(seq) {\r\n        this.$idx = seq.sq$length() - 1;\r\n        this.$seq = seq;\r\n        return this;\r\n    },\r\n    iternext(canSuspend) {\r\n        if (this.$idx < 0) {\r\n            return undefined;\r\n        }\r\n        const ret = Sk.misceval.tryCatch(\r\n            () => Sk.abstr.objectGetItem(this.$seq, new Sk.builtin.int_(this.$idx--), canSuspend),\r\n            (e) => {\r\n                if (e instanceof Sk.builtin.IndexError) {\r\n                    this.$idx = -1;\r\n                    return undefined;\r\n                } else {\r\n                    throw e;\r\n                }\r\n            }\r\n        );\r\n        return canSuspend ? ret : Sk.misceval.retryOptionalSuspensionOrThrow(ret);\r\n    },\r\n    slots: {\r\n        tp$doc: \"Return a reverse iterator over the values of the given sequence.\",\r\n        tp$new(args, kwargs) {\r\n            if (this === Sk.builtin.reversed.prototype) {\r\n                Sk.abstr.checkNoKwargs(\"reversed\", kwargs);\r\n            }\r\n            Sk.abstr.checkArgsLen(\"reversed\", args, 1, 1);\r\n            let seq = args[0];\r\n            const special = Sk.abstr.lookupSpecial(seq, Sk.builtin.str.$reversed);\r\n            if (special !== undefined) {\r\n                return Sk.misceval.callsimArray(special, []);\r\n            } else if (!Sk.builtin.checkSequence(seq) || Sk.abstr.lookupSpecial(seq, Sk.builtin.str.$len) === undefined) {\r\n                throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(seq) + \"' object is not a sequence\");\r\n            }\r\n            if (this === Sk.builtin.reversed.prototype) {\r\n                return new Sk.builtin.reversed(seq);\r\n            } else {\r\n                const instance = new this.constructor();\r\n                Sk.builtin.reversed.call(instance, seq);\r\n                return instance;\r\n            }\r\n        },\r\n    },\r\n    methods: {\r\n        __length_hint__: {\r\n            $meth: function __length_hint__() {\r\n                return this.$idx >= 0 ? new Sk.builtin.int_(this.$idx) : new Sk.builtin.int_(0);\r\n            },\r\n            $flags: { NoArgs: true },\r\n        },\r\n    },\r\n});\r\n","var set_private_ = {};\r\n\r\n/**\r\n *\r\n * @constructor\r\n * @param {Array} S\r\n *\r\n * @description\r\n * internally call new Sk.builtin.set with an array of python objects\r\n */\r\nSk.builtin.set = Sk.abstr.buildNativeClass(\"set\", {\r\n    constructor: function set(S) {\r\n        if (S === undefined) {\r\n            S = [];\r\n        } else if (!Array.isArray(S)) {\r\n            S = Sk.misceval.arrayFromIterable(S); // internal calls to constructor can't suspend;\r\n        }\r\n        Sk.asserts.assert(this instanceof Sk.builtin.set, \"Bad call to set - must be called with an Array and 'new'\");\r\n        const L = [];\r\n        for (let i = 0; i < S.length; i++) {\r\n            L.push(S[i]);\r\n            L.push(true);\r\n        }\r\n        this.v = new Sk.builtin.dict(L);\r\n        this.in$repr = false;\r\n    },\r\n    slots: /**@lends {Sk.builtin.set.prototype}*/ {\r\n        tp$getattr: Sk.generic.getAttr,\r\n        tp$as_number: true,\r\n        tp$as_sequence_or_mapping: true,\r\n        tp$hash: Sk.builtin.none.none$,\r\n        tp$doc: \"set() -> new empty set object\\nset(iterable) -> new set object\\n\\nBuild an unordered collection of unique elements.\",\r\n        tp$init(args, kwargs) {\r\n            Sk.abstr.checkNoKwargs(\"set\", kwargs);\r\n            Sk.abstr.checkArgsLen(\"set\", args, 0, 1);\r\n            this.set$clear();\r\n            const iterable = args[0];\r\n            return iterable && this.set$update(iterable);\r\n        },\r\n        tp$new: Sk.generic.new,\r\n        $r() {\r\n            if (this.in$repr) {\r\n                return new Sk.builtin.str(Sk.abstr.typeName(this) + \"(...)\");\r\n            }\r\n            this.in$repr = true;\r\n            const ret = this.sk$asarray().map((x) => Sk.misceval.objectRepr(x));\r\n            this.in$repr = false;\r\n            if (Sk.__future__.python3) {\r\n                if (ret.length === 0) {\r\n                    return new Sk.builtin.str(Sk.abstr.typeName(this) + \"()\");\r\n                } else if (this.ob$type !== Sk.builtin.set) {\r\n                    // then we are a subclass of set\r\n                    return new Sk.builtin.str(Sk.abstr.typeName(this) + \"({\" + ret.join(\", \") + \"})\");\r\n                } else {\r\n                    return new Sk.builtin.str(\"{\" + ret.join(\", \") + \"}\");\r\n                }\r\n            } else {\r\n                return new Sk.builtin.str(Sk.abstr.typeName(this) + \"([\" + ret.join(\", \") + \"])\");\r\n            }\r\n        },\r\n        tp$iter() {\r\n            return new set_iter_(this);\r\n        },\r\n        tp$richcompare(other, op) {\r\n            if (!Sk.builtin.checkAnySet(other)) {\r\n                return Sk.builtin.NotImplemented.NotImplemented$;\r\n            }\r\n            switch (op) {\r\n                case \"NotEq\":\r\n                case \"Eq\":\r\n                    let res;\r\n                    if (this === other) {\r\n                        res = true;\r\n                    } else if (this.get$size() !== other.get$size()) {\r\n                        res = false;\r\n                    } else {\r\n                        res = Sk.misceval.isTrue(this.set$issubset(other));\r\n                    }\r\n                    return op === \"Eq\" ? res : !res;\r\n                case \"LtE\":\r\n                    return this === other || Sk.misceval.isTrue(this.set$issubset(other));\r\n                case \"GtE\":\r\n                    return this === other || Sk.misceval.isTrue(other.set$issubset(this));\r\n                case \"Lt\":\r\n                    return this.get$size() < other.get$size() && Sk.misceval.isTrue(this.set$issubset(other));\r\n                case \"Gt\":\r\n                    return this.get$size() > other.get$size() && Sk.misceval.isTrue(other.set$issubset(this));\r\n            }\r\n        },\r\n        // number slots\r\n        nb$subtract: numberSlot(function (other) {\r\n            return this.difference.$meth.call(this, other);\r\n        }),\r\n        nb$and: numberSlot(function (other) {\r\n            return this.intersection.$meth.call(this, other);\r\n        }),\r\n        nb$or: numberSlot(function (other) {\r\n            return this.union.$meth.call(this, other);\r\n        }),\r\n        nb$xor: numberSlot(function (other) {\r\n            return this.symmetric_difference.$meth.call(this, other);\r\n        }),\r\n        nb$inplace_subtract: numberSlot(function (other) {\r\n            if (other === this) {\r\n                other = other.set$copy();\r\n            }\r\n            return Sk.misceval.chain(this.difference_update.$meth.call(this, other), () => this);\r\n        }),\r\n        nb$inplace_and: numberSlot(function (other) {\r\n            return Sk.misceval.chain(this.intersection_update.$meth.call(this, other), () => this);\r\n        }),\r\n        nb$inplace_or: numberSlot(function (other) {\r\n            return Sk.misceval.chain(this.update.$meth.call(this, other), () => this);\r\n        }),\r\n        nb$inplace_xor: numberSlot(function (other) {\r\n            if (other === this) {\r\n                other = other.set$copy();\r\n            }\r\n            return Sk.misceval.chain(this.symmetric_difference_update.$meth.call(this, other), () => this);\r\n        }),\r\n        // sequence or mapping slots\r\n        sq$length() {\r\n            return this.get$size();\r\n        },\r\n        sq$contains(entry) {\r\n            entry = entry_or_hashable_set(entry);\r\n            return this.v.sq$contains(entry);\r\n        },\r\n    },\r\n    methods: /**@lends {Sk.builtin.set.prototype}*/ {\r\n    add: {\r\n            $meth(item) {\r\n                this.set$add(item);\r\n            return Sk.builtin.none.none$;\r\n        },\r\n        $flags: {OneArg: true},\r\n        $textsig: null,\r\n        $doc: \"Add an element to a set.\\n\\nThis has no effect if the element is already present.\",\r\n    },\r\n    clear: {\r\n            $meth() {\r\n                this.set$clear();\r\n            return Sk.builtin.none.none$;\r\n        },\r\n        $flags: {NoArgs: true},\r\n        $textsig: null,\r\n        $doc: \"Remove all elements from this set.\",\r\n    },\r\n    copy: {\r\n            $meth() {\r\n                return this.set$copy();\r\n        },\r\n        $flags: {NoArgs: true},\r\n        $textsig: null,\r\n        $doc: \"Return a shallow copy of a set.\",\r\n    },\r\n    discard: {\r\n            $meth(entry) {\r\n                entry = entry_or_hashable_set(entry);\r\n                this.set$discard(entry);\r\n            return Sk.builtin.none.none$;\r\n        },\r\n        $flags: {OneArg: true},\r\n        $textsig: null,\r\n        $doc: \"Remove an element from a set if it is a member.\\n\\nIf the element is not a member, do nothing.\",\r\n    },\r\n    difference: {\r\n            $meth(...args) {\r\n                const result = this.set$copy();\r\n                return Sk.misceval.chain(\r\n                    Sk.misceval.iterArray(args, (arg) => result.set$difference_update(arg)),\r\n                    () => result\r\n                );\r\n        },\r\n        $flags: {MinArgs: 0},\r\n        $textsig: null,\r\n        $doc: \"Return the difference of two or more sets as a new set.\\n\\n(i.e. all elements that are in this set but not the others.)\",\r\n    },\r\n    difference_update: {\r\n            $meth(...args) {\r\n                return Sk.misceval.chain(\r\n                    Sk.misceval.iterArray(args, (arg) => this.set$difference_update(arg)),\r\n                    () => Sk.builtin.none.none$\r\n                );\r\n        },\r\n        $flags: {MinArgs: 0},\r\n        $textsig: null,\r\n        $doc: \"Remove all elements of another set from this set.\",\r\n    },\r\n    intersection: {\r\n            $meth(...args) {\r\n                return this.set$intersection_multi(...args);\r\n        },\r\n        $flags: {MinArgs: 0},\r\n        $textsig: null,\r\n        $doc: \"Return the intersection of two sets as a new set.\\n\\n(i.e. all elements that are in both sets.)\",\r\n    },\r\n    intersection_update: {\r\n            $meth(...args) {\r\n                return Sk.misceval.chain(this.set$intersection_multi(...args), (res) => {\r\n                    this.swap$bodies(res);\r\n            return Sk.builtin.none.none$;\r\n                });\r\n        },\r\n        $flags: {MinArgs: 0},\r\n        $textsig: null,\r\n        $doc: \"Update a set with the intersection of itself and another.\",\r\n    },\r\n    isdisjoint: {\r\n            $meth(other) {\r\n            // requires all items in this to not be in other\r\n                return Sk.misceval.chain(\r\n                    Sk.misceval.iterFor(Sk.abstr.iter(other), (i) => {\r\n                        if (this.sq$contains(i)) {\r\n                            return new Sk.misceval.Break(Sk.builtin.bool.false$);\r\n                }\r\n                    }),\r\n                    (res) => res || Sk.builtin.bool.true$\r\n                );\r\n        },\r\n        $flags: {OneArg: true},\r\n        $textsig: null,\r\n        $doc: \"Return True if two sets have a null intersection.\",\r\n    },\r\n    issubset: {\r\n            $meth(other) {\r\n            if (!Sk.builtin.checkAnySet(other)) {\r\n                    other = this.set$make_basetype(other);\r\n                }\r\n                return Sk.misceval.chain(other, (other_set) => this.set$issubset(other_set));\r\n        },\r\n        $flags: {OneArg: true},\r\n        $textsig: null,\r\n        $doc: \"Report whether another set contains this set.\",\r\n    },\r\n    issuperset: {\r\n            $meth(other) {\r\n            if (!Sk.builtin.checkAnySet(other)) {\r\n                    other = this.set$make_basetype(other);\r\n            }\r\n                return Sk.misceval.chain(other, (other_set) => other_set.set$issubset(this));\r\n        },\r\n        $flags: {OneArg: true},\r\n        $textsig: null,\r\n        $doc: \"Report whether this set contains another set.\",\r\n    },\r\n    pop: {\r\n            $meth() {\r\n            if (this.get$size() === 0) {\r\n                throw new Sk.builtin.KeyError(\"pop from an empty set\");\r\n            }\r\n                const item = Sk.misceval.callsimArray(this.v.popitem, [this.v]);\r\n                return item.v[0];\r\n        },\r\n        $flags: {NoArgs: true},\r\n        $textsig: null,\r\n        $doc: \"Remove and return an arbitrary set element.\\nRaises KeyError if the set is empty.\",\r\n    },\r\n    // __reduce__: {\r\n    //     $meth: methods.$__reduce__,\r\n    //     $flags:{},\r\n    //     $textsig: null,\r\n    //     $doc: \"Return state information for pickling.\" },\r\n    remove: {\r\n            $meth(entry) {\r\n                const tmp = entry_or_hashable_set(entry);\r\n                if (this.v.mp$lookup(tmp)) {\r\n                    this.v.mp$ass_subscript(tmp);\r\n                    return Sk.builtin.none.none$;\r\n                }\r\n                throw new Sk.builtin.KeyError(entry);\r\n        },\r\n        $flags: {OneArg: true},\r\n        $textsig: null,\r\n        $doc: \"Remove an element from a set; it must be a member.\\n\\nIf the element is not a member, raise a KeyError.\",\r\n    },\r\n    // __sizeof__: {\r\n    //     $meth: methods.$__sizeof__,\r\n    //     $flags:{},\r\n    //     $textsig: null,\r\n    //     $doc: \"S.__sizeof__() -> size of S in memory, in bytes\" },\r\n    symmetric_difference: {\r\n            $meth(other) {\r\n                let other_set;\r\n                return Sk.misceval.chain(\r\n                    this.set$make_basetype(other),\r\n                    (os) => {\r\n                        other_set = os;\r\n                        return other_set.set$symmetric_diff_update(this);\r\n                    },\r\n                    () => other_set\r\n                );\r\n        },\r\n        $flags: {OneArg: true},\r\n        $textsig: null,\r\n        $doc: \"Return the symmetric difference of two sets as a new set.\\n\\n(i.e. all elements that are in exactly one of the sets.)\",\r\n    },\r\n    symmetric_difference_update: {\r\n            $meth(other) {\r\n                if (!Sk.builtin.checkAnySet(other)) {\r\n                    other = this.set$make_basetype(other);\r\n                }\r\n                return Sk.misceval.chain(\r\n                    other,\r\n                    (other_set) => this.set$symmetric_diff_update(other_set),\r\n                    () => Sk.builtin.none.none$\r\n                );\r\n        },\r\n        $flags: {OneArg: true},\r\n        $textsig: null,\r\n        $doc: \"Update a set with the symmetric difference of itself and another.\",\r\n    },\r\n    union: {\r\n            $meth(...args) {\r\n                const result = this.set$copy();\r\n                return Sk.misceval.chain(\r\n                    Sk.misceval.iterArray(args, (arg) => result.set$update(arg)),\r\n                    () => result\r\n                );\r\n        },\r\n        $flags: {MinArgs: 0},\r\n        $textsig: null,\r\n        $doc: \"Return the union of sets as a new set.\\n\\n(i.e. all elements that are in either set.)\",\r\n    },\r\n    update: {\r\n            $meth(...args) {\r\n                return Sk.misceval.chain(\r\n                    Sk.misceval.iterArray(args, (arg) => this.set$update(arg)),\r\n                    () => Sk.builtin.none.none$\r\n                );\r\n        },\r\n        $flags: {MinArgs: 0},\r\n        $textsig: null,\r\n        $doc: \"Update a set with the union of itself and others.\",\r\n    },\r\n    },\r\n    classmethods: Sk.generic.classGetItem,\r\n    proto: /**@lends {Sk.builtin.set.prototype}*/ Object.assign(set_private_, {\r\n        sk$asarray() {\r\n            return this.v.sk$asarray();\r\n        },\r\n        get$size() {\r\n            // this method cannot be overriden by subclasses\r\n            return this.v.sq$length();\r\n        },\r\n        set$add(entry) {\r\n            this.v.mp$ass_subscript(entry, true);\r\n        },\r\n        set$make_basetype(other) {\r\n            return Sk.misceval.chain(Sk.misceval.arrayFromIterable(other, true), (S) => new this.sk$builtinBase(S));\r\n        },\r\n        set$discard(entry) {\r\n            return this.v.pop$item(entry);\r\n        },\r\n        set$clear() {\r\n            this.v = new Sk.builtin.dict([]);\r\n        },\r\n        set$copy() {\r\n            const setCopy = new this.sk$builtinBase();\r\n            setCopy.v = this.v.dict$copy();\r\n            return setCopy;\r\n        },\r\n        set$difference_update(other) {\r\n            return Sk.misceval.iterFor(Sk.abstr.iter(other), (entry) => {\r\n                this.set$discard(entry);\r\n            });\r\n        },\r\n        set$intersection(other) {\r\n            const res = new this.sk$builtinBase();\r\n            return Sk.misceval.chain(\r\n                Sk.misceval.iterFor(Sk.abstr.iter(other), (entry) => {\r\n                    if (this.sq$contains(entry)) {\r\n                        res.set$add(entry);\r\n                    }\r\n                }),\r\n                () => res\r\n            );\r\n        },\r\n        set$intersection_multi(...args) {\r\n            if (!args.length) {\r\n                return this.set$copy();\r\n            }\r\n            let result = this;\r\n            return Sk.misceval.chain(\r\n                Sk.misceval.iterArray(args, (arg) => {\r\n                    return Sk.misceval.chain(result.set$intersection(arg), (res) => {\r\n                        result = res;\r\n                    });\r\n                }),\r\n                () => result\r\n            );\r\n        },\r\n        set$issubset(other_set) {\r\n            const thisLength = this.get$size();\r\n            const otherLength = other_set.get$size();\r\n            if (thisLength > otherLength) {\r\n                // every item in this set can't be in other if it's shorter!\r\n                return Sk.builtin.bool.false$;\r\n            }\r\n            for (let it = this.tp$iter(), i = it.tp$iternext(); i !== undefined; i = it.tp$iternext()) {\r\n                if (!other_set.sq$contains(i)) {\r\n                    return Sk.builtin.bool.false$;\r\n                }\r\n            }\r\n            return Sk.builtin.bool.true$;\r\n        },\r\n        set$symmetric_diff_update(other) {\r\n            return Sk.misceval.iterFor(Sk.abstr.iter(other), (entry) => {\r\n                const discarded = this.set$discard(entry);\r\n                if (discarded === undefined) {\r\n                    this.set$add(entry);\r\n                }\r\n            });\r\n        },\r\n        set$update(other) {\r\n            return Sk.misceval.iterFor(Sk.abstr.iter(other), (entry) => {\r\n                this.set$add(entry);\r\n            });\r\n        },\r\n        swap$bodies(other) {\r\n            this.v = other.v;\r\n    },\r\n    }),\r\n});\r\n\r\nSk.exportSymbol(\"Sk.builtin.set\", Sk.builtin.set);\r\n\r\nconst set_proto = Sk.builtin.set.prototype;\r\n/**\r\n * @constructor\r\n * @param {Array.<Object>} S\r\n */\r\nSk.builtin.frozenset = Sk.abstr.buildNativeClass(\"frozenset\", {\r\n    constructor: function frozenset(S) {\r\n        // takes in an array of py objects\r\n        if (S === undefined) {\r\n            S = [];\r\n        } else if (!Array.isArray(S)) {\r\n            S = Sk.misceval.arrayFromIterable(S); // internal calls to constructor can't suspend;\r\n        }\r\n        Sk.asserts.assert(this instanceof Sk.builtin.frozenset, \"bad call to frozen set - must be called with 'new'\");\r\n        const L = [];\r\n        for (let i = 0; i < S.length; i++) {\r\n            L.push(S[i]);\r\n            L.push(true);\r\n        }\r\n        this.v = new Sk.builtin.dict(L);\r\n        this.in$repr = false;\r\n    },\r\n    slots: /**@lends {Sk.builtin.frozenset.prototype}*/ {\r\n        tp$getattr: Sk.generic.getAttr,\r\n        tp$as_number: true,\r\n        tp$as_sequence_or_mapping: true,\r\n        tp$doc:\r\n            \"frozenset() -> empty frozenset object\\nfrozenset(iterable) -> frozenset object\\n\\nBuild an immutable unordered collection of unique elements.\",\r\n        tp$hash() {\r\n            // numbers taken from Cpython 2.7 hash function\r\n            let hash = 1927868237;\r\n            const entries = this.sk$asarray();\r\n            hash *= entries.length + 1;\r\n            for (let i = 0; i < entries.length; i++) {\r\n                const h = Sk.abstr.objectHash(entries[i]);\r\n                hash ^= (h ^ (h << 16) ^ 89869747) * 3644798167;\r\n            }\r\n            hash = hash * 69069 + 907133923;\r\n            return hash;\r\n        },\r\n        /**\r\n         * @param {Array} args\r\n         * @param {Array=} kwargs\r\n         * @ignore\r\n         */\r\n        tp$new(args, kwargs) {\r\n            if (this !== Sk.builtin.frozenset.prototype) {\r\n                return this.$subtype_new(args, kwargs);\r\n            }\r\n            Sk.abstr.checkNoKwargs(\"frozenset\", kwargs);\r\n            Sk.abstr.checkArgsLen(\"frozenset\", args, 0, 1);\r\n            const arg = args[0];\r\n            if (arg !== undefined && arg.ob$type === Sk.builtin.frozenset) {\r\n                return arg;\r\n            }\r\n            return Sk.misceval.chain(Sk.misceval.arrayFromIterable(arg, true), (S) => {\r\n                if (!S.length) {\r\n                    // in cpython frozenset() on an empty set returns the same object\r\n                    return Sk.builtin.frozenset.$emptyset;\r\n                }\r\n            return new Sk.builtin.frozenset(S);\r\n            });\r\n        },\r\n        $r: set_proto.$r,\r\n        tp$iter: set_proto.tp$iter,\r\n        tp$richcompare: set_proto.tp$richcompare,\r\n        // number slots\r\n        nb$subtract: set_proto.nb$subtract,\r\n        nb$and: set_proto.nb$and,\r\n        nb$or: set_proto.nb$or,\r\n        nb$xor: set_proto.nb$xor,\r\n        // as mapping\r\n        sq$length: set_proto.sq$length,\r\n        sq$contains: set_proto.sq$contains,\r\n    },\r\n    methods: /**@lends {Sk.builtin.frozenset.prototype}*/ {\r\n        copy: Object.assign({}, set_proto.copy.d$def, {\r\n            $meth() {\r\n                return this.constructor === this.sk$builtinBase ? this : new Sk.builtin.frozenset(this.sk$asarray());\r\n            },\r\n        }),\r\n        difference: set_proto.difference.d$def,\r\n        intersection: set_proto.intersection.d$def,\r\n        isdisjoint: set_proto.isdisjoint.d$def,\r\n        issubset: set_proto.issubset.d$def,\r\n        issuperset: set_proto.issuperset.d$def,\r\n        // __reduce__: set_proto.__reduce__,\r\n        // __sizeof__: set_proto.__sizeof__,\r\n        symmetric_difference: set_proto.symmetric_difference.d$def,\r\n        union: set_proto.union.d$def,\r\n    },\r\n    classmethods: Sk.generic.classGetItem,\r\n    proto: /**@lends {Sk.builtin.frozenset.prototype}*/ Object.assign(\r\n        {\r\n            $subtype_new(args, kwargs) {\r\n            const instance = new this.constructor();\r\n            // pass the args but ignore the kwargs for subtyping\r\n                return Sk.misceval.chain(Sk.builtin.frozenset.prototype.tp$new(args), (frozenset) => {\r\n            instance.v = frozenset.v;\r\n            return instance;\r\n                });\r\n        },\r\n    },\r\n        set_private_\r\n    ),\r\n});\r\n\r\nSk.builtin.frozenset.$emptyset = Object.create(Sk.builtin.frozenset.prototype, {\r\n    v: { value: new Sk.builtin.dict([]), enumerable: true },\r\n    in$repr: { value: false, enumerable: true },\r\n});\r\n\r\nSk.exportSymbol(\"Sk.builtin.frozenset\", Sk.builtin.frozenset);\r\n\r\nfunction numberSlot(f) {\r\n    return function (other) {\r\n        if (!Sk.builtin.checkAnySet(other)) {\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        }\r\n        return f.call(this, other);\r\n    };\r\n}\r\n\r\nfunction entry_or_hashable_set(entry) {\r\n    if (entry instanceof Sk.builtin.set && entry.tp$hash === Sk.builtin.none.none$) {\r\n        // cpython nuance\r\n        entry = new Sk.builtin.frozenset(Sk.misceval.arrayFromIterable(entry));\r\n    }\r\n    return entry;\r\n}\r\n\r\n/**\r\n * @constructor\r\n * @extends {Sk.builtin.object}\r\n * @param {Sk.builtin.set|Sk.builtin.frozenset} set or frozenset\r\n * @private\r\n */\r\nvar set_iter_ = Sk.abstr.buildIteratorClass(\"set_iterator\", {\r\n    constructor: function set_iter_(set) {\r\n        this.$index = 0;\r\n        this.$seq = set.sk$asarray();\r\n        this.$orig = set;\r\n    },\r\n    iternext: Sk.generic.iterNextWithArrayCheckSize,\r\n    methods: {\r\n        __length_hint__: Sk.generic.iterLengthHintWithArrayMethodDef,\r\n    },\r\n    flags: { sk$unacceptableBase: true },\r\n});\r\n","/**\r\n *\r\n * @constructor\r\n * @extends {Sk.builtin.object}\r\n * @param {Sk.builtin.func} callable\r\n * @param {Sk.builtin.object} sentinel - if reached returns undefined\r\n * @private\r\n */\r\nSk.builtin.callable_iter_ = Sk.abstr.buildIteratorClass(\"callable_iterator\", {\r\n    constructor: function callable_iter(callable, sentinel) {\r\n        if (!Sk.builtin.checkCallable(callable)) {\r\n            throw new Sk.builtin.TypeError(\"iter(v, w): v must be callable\");\r\n        }\r\n        this.$callable = callable;\r\n        this.$sentinel = sentinel;\r\n        this.$flag = false;\r\n    },\r\n    iternext(canSuspend) {\r\n        let ret;\r\n        if (this.$flag === true) {\r\n            // Iterator has already completed\r\n            return undefined;\r\n        }\r\n        if (canSuspend) {\r\n            ret = Sk.misceval.callsimOrSuspendArray(this.$callable, []);\r\n            return Sk.misceval.chain(ret, (r) => {\r\n                if (Sk.misceval.richCompareBool(r, this.$sentinel, \"Eq\", true)) {\r\n                    this.$flag = true;\r\n                    return undefined;\r\n                } else {\r\n                    return r;\r\n                }\r\n            });\r\n        } else {\r\n            ret = Sk.misceval.callsimArray(this.$callable, []);\r\n            if (Sk.misceval.richCompareBool(ret, this.$sentinel, \"Eq\", false)) {\r\n                this.$flag = true;\r\n                return undefined;\r\n            } else {\r\n                return ret;\r\n            }\r\n        }\r\n    },\r\n    flags: { sk$unacceptableBase: true },\r\n});\r\n\r\n\r\n\r\n\r\n/**\r\n * @constructor\r\n * @extends {Sk.builtin.object}\r\n * @param {Sk.builtin.object} seq\r\n * @private\r\n */\r\nSk.builtin.seq_iter_ = Sk.abstr.buildIteratorClass(\"iterator\", {\r\n    constructor: function seq_iter(seq) {\r\n        this.$index = 0;\r\n        this.$seq = seq;\r\n    },\r\n    iternext(canSuspend) {\r\n        let ret;\r\n        ret = Sk.misceval.tryCatch(\r\n            () => {\r\n                return this.$seq.mp$subscript(new Sk.builtin.int_(this.$index++), canSuspend);\r\n            },\r\n            (e) => {\r\n                if (e instanceof Sk.builtin.IndexError || e instanceof Sk.builtin.StopIteration) {\r\n                    this.gi$ret = e.$value || Sk.builtin.none.none$;\r\n                return undefined;\r\n            } else {\r\n                throw e;\r\n            }\r\n        }\r\n        );\r\n        return canSuspend ? ret : Sk.misceval.retryOptionalSuspensionOrThrow(ret);\r\n    },\r\n    methods: {\r\n        __length_hint__: {\r\n            $flags: {NoArgs: true},\r\n            $meth() {\r\n                if (this.$seq.sq$length) {\r\n                    // sq$length will return Sk.miseval.asIndex\r\n                    return this.$seq.sq$length() - this.$index;\r\n                } else {\r\n                    throw new Sk.builtin.NotImplementedError(\r\n                        \"len is not implemented for \" + Sk.abstr.typeName(this.$seq)\r\n                    );\r\n                }\r\n            },\r\n        },\r\n    },\r\n    flags: { sk$unacceptableBase: true },\r\n});\r\n\r\n\r\n\r\n\r\n\r\nSk.exportSymbol(\"Sk.builtin.callable_iter_\", Sk.builtin.callable_iter_);\r\n","/**\r\n * @constructor\r\n * Sk.builtin.sk_method\r\n *\r\n * @description\r\n * this constructor is used by all builtin functions or methods\r\n * the tp$call method is defined based on the flags\r\n *\r\n * A good way to determine the flags is to look at the textsignature of a function\r\n * or find the equivalent function in CPython and map the flags to skulpt flags\r\n * flags: {\r\n * NoArgs: true, raises exception if there are args or kwargs (METH_NOARGS)\r\n * OneArg: true, raises exception if there is more than one Arg (METH_O)\r\n *\r\n * MinArgs: int (also assumes noKwargs)\r\n * MaxArgs: int optional (used in conjuntiontion with MinArgs)\r\n *\r\n * NamedArgs: Array e.g. [null, null, \"name1\", \"name2\"]\r\n *            use null for posonly args\r\n *            ensures that the total number of args (including kwargs) equals the named args\r\n *            the call sig will check the kwarg names are valid\r\n *            the call sig applies Defaults (if set) to any named args\r\n * Defaults: Array (used in conjunction with NamedArgs, can use [undefined] see dict.pop for use case)\r\n *\r\n * FastCall && NoKwargs: true, check NoKewords and pass args the function will handle these (METH_FASTCALL)\r\n * FastCall: pass args, kwargs - the function will handle this (METH_FASTCALL || KEYWORDS)\r\n *\r\n * if no flags are set then the tp$call = function.prototype.tp$call\r\n *\r\n * @param {Object} method_def\r\n * @param {*} self\r\n * @param {string=} module\r\n */\r\nSk.builtin.sk_method = Sk.abstr.buildNativeClass(\"builtin_function_or_method\", {\r\n    constructor: function builtin_function_or_method(method_def, self, module) {\r\n        // here we set this.$meth binding it's call signature to self\r\n        this.$meth = method_def.$meth.bind(self);\r\n        this.$doc = method_def.$doc;\r\n        this.$self = self || null;\r\n        this.$module = module ? new Sk.builtin.str(module) : null;\r\n        this.$name = method_def.$name || method_def.$meth.name || \"<native JS>\";\r\n        this.m$def = method_def;\r\n\r\n        // useful to set the $textsig to determine the correct flags\r\n        this.$textsig = method_def.$textsig;\r\n\r\n        // override the default tp$call method if there is a valid flag\r\n        const flags = method_def.$flags || {};\r\n        this.$flags = flags;\r\n\r\n        if (flags.FastCall && flags.NoKwargs) {\r\n            this.tp$call = this.$fastCallNoKwargs;\r\n        } else if (flags.FastCall) {\r\n            this.tp$call = this.$meth;\r\n        } else if (flags.NoArgs) {\r\n            this.tp$call = this.$callNoArgs;\r\n        } else if (flags.OneArg) {\r\n            this.tp$call = this.$callOneArg;\r\n        } else if (flags.NamedArgs) {\r\n            this.tp$call = this.$callNamedArgs;\r\n        } else if (flags.MinArgs !== undefined) {\r\n            this.tp$call = this.$callMinArgs;\r\n        } else {\r\n            this.func_code = this.$meth;\r\n            this.tp$call = this.$defaultCallMethod;\r\n        }\r\n    },\r\n    proto: {\r\n        $fastCallNoKwargs(args, kwargs) {\r\n            Sk.abstr.checkNoKwargs(this.$name, kwargs);\r\n            return this.$meth(args);\r\n        },\r\n        $callNoArgs(args, kwargs) {\r\n            Sk.abstr.checkNoArgs(this.$name, args, kwargs);\r\n            return this.$meth();\r\n        },\r\n        $callOneArg(args, kwargs) {\r\n            Sk.abstr.checkOneArg(this.$name, args, kwargs);\r\n            return this.$meth(args[0]);\r\n        },\r\n        $callNamedArgs(args, kwargs) {\r\n            args = Sk.abstr.copyKeywordsToNamedArgs(this.$name, this.$flags.NamedArgs, args, kwargs, this.$flags.Defaults);\r\n            return this.$meth(...args);\r\n        },\r\n        $callMinArgs(args, kwargs) {\r\n            Sk.abstr.checkNoKwargs(this.$name, kwargs);\r\n            Sk.abstr.checkArgsLen(this.$name, args, this.$flags.MinArgs, this.$flags.MaxArgs);\r\n            return this.$meth(...args);\r\n        },\r\n        $defaultCallMethod(args, kwargs) {\r\n            // default implementation for all currently created functions that have yet to be be converted\r\n            // and don't utilise flagged calls\r\n            if (this.$self !== null) {\r\n                return Sk.builtin.func.prototype.tp$call.call(this, [this.$self, ...args], kwargs);\r\n            }\r\n            return Sk.builtin.func.prototype.tp$call.call(this, args, kwargs);\r\n        },\r\n        $memoiseFlags() {\r\n            return Sk.builtin.func.prototype.$memoiseFlags.call(this);\r\n    },\r\n        $resolveArgs() {\r\n            return Sk.builtin.func.prototype.$resolveArgs.call(this);\r\n        },\r\n    },\r\n    flags: { sk$unacceptableBase: true },\r\n    slots: {\r\n        tp$getattr: Sk.generic.getAttr,\r\n        $r() {\r\n            if (this.$self === null) {\r\n                return new Sk.builtin.str(\"<built-in function \" + this.$name + \">\");\r\n            }\r\n            return new Sk.builtin.str(\"<built-in method \" + this.$name + \" of \" + Sk.abstr.typeName(this.$self) + \" object>\");\r\n        },\r\n        tp$call(args, kwargs) {\r\n            return this.tp$call(args, kwargs);\r\n        },\r\n        tp$richcompare(other, op) {\r\n            if ((op !== \"Eq\" && op !== \"NotEq\") || !(other instanceof Sk.builtin.sk_method)) {\r\n                return Sk.builtin.NotImplemented.NotImplemented$;\r\n            }\r\n            let eq = this.$self === other.$self && this.m$def.$meth === other.m$def.$meth;\r\n            return op === \"Eq\" ? eq : !eq;\r\n        },\r\n    },\r\n    getsets: {\r\n        __module__: {\r\n            $get() {\r\n                return this.$module || Sk.builtin.none.none$;\r\n            },\r\n            $set(value) {\r\n                value = value || Sk.builtin.none.none$;\r\n                this.$module = value;\r\n            },\r\n        },\r\n        __doc__: {\r\n            $get() {\r\n                return this.$doc ? new Sk.builtin.str(this.$doc) : Sk.builtin.none.none$;\r\n            },\r\n        },\r\n        __name__: {\r\n            $get() {\r\n                return new Sk.builtin.str(this.$name);\r\n            },\r\n        },\r\n        __text_signature__: {\r\n            $get() {\r\n                return new Sk.builtin.str(this.$textsig);\r\n            },\r\n        },\r\n        __self__: {\r\n            $get() {\r\n                // self might be a module object - which means it was created inside a module before the module existed\r\n                // so look the name up in sysmodules\r\n                return this.$self || Sk.sysModules.mp$lookup(this.$module) || Sk.builtin.none.none$;\r\n            },\r\n        },\r\n    },\r\n});\r\n","/** @typedef {Sk.builtin.object} */ var pyObject;\r\n\r\n/**\r\n * @constructor\r\n * @extends {Sk.builtin.object}\r\n * @param {pyObject} start\r\n * @param {pyObject=} stop\r\n * @param {pyObject=} step\r\n */\r\nSk.builtin.slice = Sk.abstr.buildNativeClass(\"slice\", {\r\n    constructor: function slice(start, stop, step) {\r\n        if (stop === undefined && step === undefined) {\r\n            stop = start;\r\n            start = Sk.builtin.none.none$;\r\n        }\r\n        if (stop === undefined) {\r\n            stop = Sk.builtin.none.none$;\r\n        }\r\n        if (step === undefined) {\r\n            step = Sk.builtin.none.none$;\r\n        }\r\n        this.start = start;\r\n        this.stop = stop;\r\n        this.step = step;\r\n    },\r\n    slots: /**@lends {Sk.builtin.slice.prototype} */ {\r\n        tp$getattr: Sk.generic.getAttr,\r\n        tp$doc: \"slice(stop)\\nslice(start, stop[, step])\\n\\nCreate a slice object.  This is used for extended slicing (e.g. a[0:10:2]).\",\r\n        tp$hash: Sk.builtin.none.none$,\r\n        tp$new(args, kwargs) {\r\n            Sk.abstr.checkNoKwargs(\"slice\", kwargs);\r\n            Sk.abstr.checkArgsLen(\"slice\", args, 1, 3);\r\n            return new Sk.builtin.slice(...args);\r\n        },\r\n        $r() {\r\n            const a = Sk.misceval.objectRepr(this.start);\r\n            const b = Sk.misceval.objectRepr(this.stop);\r\n            const c = Sk.misceval.objectRepr(this.step);\r\n            return new Sk.builtin.str(\"slice(\" + a + \", \" + b + \", \" + c + \")\");\r\n        },\r\n        tp$richcompare(w, op) {\r\n            // w not a slice - it's not subclassable so no need to use instanceof here\r\n            if (w.ob$type !== Sk.builtin.slice) {\r\n                return Sk.builtin.NotImplemented.NotImplemented$;\r\n            }\r\n            // This is how CPython does it\r\n            const t1 = new Sk.builtin.tuple([this.start, this.stop, this.step]);\r\n            const t2 = new Sk.builtin.tuple([w.start, w.stop, w.step]);\r\n            return t1.tp$richcompare(t2, op);\r\n        },\r\n    },\r\n    getsets: /**@lends {Sk.builtin.slice.prototype} */{\r\n        start: {\r\n            $get() {\r\n                return this.start;\r\n            },\r\n        },\r\n        step: {\r\n            $get() {\r\n                return this.step;\r\n            },\r\n        },\r\n        stop: {\r\n            $get() {\r\n                return this.stop;\r\n            },\r\n        },\r\n    },\r\n    methods: /**@lends {Sk.builtin.slice.prototype} */{\r\n        indices: {\r\n            $meth: function indices(length) {\r\n                length = Sk.misceval.asIndexSized(length, Sk.builtin.OverflowError); // let's not support lengths larger than this.\r\n                // don't support large lengths here which seems fair. \r\n                if (length < 0) {\r\n                    throw new Sk.builtin.TypeError(\"length should not be negative\");\r\n                }\r\n                const {start, stop, step} = this.slice$indices(length);\r\n                return new Sk.builtin.tuple([new Sk.builtin.int_(start), new Sk.builtin.int_(stop), new Sk.builtin.int_(step)]);\r\n            },\r\n            $doc:\r\n                \"S.indices(len) -> (start, stop, stride)\\n\\nAssuming a sequence of length len, calculate the start and stop\\nindices, and the stride length of the extended slice described by\\nS. Out of bounds indices are clipped in a manner consistent with the\\nhandling of normal slices.\",\r\n            $textsig: null,\r\n            $flags: {OneArg: true},\r\n        },\r\n    },\r\n    proto: /**@lends {Sk.builtin.slice.prototype} */{\r\n        slice$as_indices (sized) {\r\n            let start, stop, step;\r\n            const msg = \"slice indices must be integers or None or have an __index__ method\";\r\n            let getIndex;\r\n            if (sized) {\r\n                getIndex = (idx) => Sk.misceval.asIndexSized(idx, null, msg);\r\n            } else {\r\n                getIndex = (idx) => Sk.misceval.asIndexOrThrow(idx, msg);\r\n            }\r\n            if (Sk.builtin.checkNone(this.step)) {\r\n                step = 1;\r\n            } else {\r\n                step = getIndex(this.step);\r\n                if (step === 0) {\r\n                    throw new Sk.builtin.ValueError(\"slice step cannot be zero\");\r\n                }\r\n            }\r\n            if (Sk.builtin.checkNone(this.start)) {\r\n                start = null;\r\n            } else {\r\n                start = getIndex(this.start);\r\n            }\r\n            if (Sk.builtin.checkNone(this.stop)) {\r\n                stop = null;\r\n            } else {\r\n                stop = getIndex(this.stop);\r\n            }\r\n            return {start: start, stop: stop, step: step};\r\n        },\r\n        $wrt(length, start, stop, step, sized) {\r\n            let idxFromNeg;\r\n            if (sized) {\r\n                idxFromNeg = (idx) => JSBI.__isBigInt(idx) ? JSBI.add(idx, JSBI.BigInt(length)) : idx + length;\r\n            } else {\r\n                idxFromNeg = (idx) => idx + length;\r\n            }\r\n\r\n            if (step > 0) {\r\n                if (start === null) {\r\n                    start = 0;\r\n                } else if (start < 0) {\r\n                    start = idxFromNeg(start);\r\n                    if (start < 0) {\r\n                        start = 0;\r\n                    }\r\n                }\r\n                if (stop === null) {\r\n                    stop = length;\r\n                } else if (stop > length) {\r\n                    stop = length;\r\n                } else if (stop < 0) {\r\n                    stop = idxFromNeg(stop);\r\n                }\r\n            } else {\r\n                if (start === null) {\r\n                    start = length - 1;\r\n                } else if (start >= length) {\r\n                    start = length - 1;\r\n                } else if (start < 0) {\r\n                    start = idxFromNeg(start);\r\n                }\r\n                if (stop === null) {\r\n                    stop = -1;\r\n                } else if (stop < 0) {\r\n                    stop = idxFromNeg(stop);\r\n                    if (stop < 0) {\r\n                        stop = -1;\r\n                    }\r\n                }\r\n            }\r\n\r\n            return {start: start, stop: stop, step: step};\r\n        },\r\n        slice$indices(length, sized) {\r\n            let {start, stop, step} = this.slice$as_indices(true, sized);\r\n            return this.$wrt(length, start, stop, step, sized);\r\n        },\r\n        /**\r\n         * used by objects like str, list, tuple that can return a slice\r\n         * @param {number} len \r\n         * @param {Function} f\r\n         */\r\n        sssiter$(len, f) {\r\n            let {start, stop, step} = this.slice$indices(len, true);\r\n            if (step > 0) {\r\n                for (let i = start; i < stop; i += step) {\r\n                    f(i);\r\n                }\r\n            } else {\r\n                for (let i = start; i > stop; i += step) {\r\n                    f(i);\r\n                }\r\n            }\r\n        },\r\n    },\r\n    flags: {\r\n        sk$unacceptableBase: true,\r\n    },\r\n});\r\n\r\n/**\r\n * \r\n * @param {*} pyObj \r\n * @param {*} start \r\n * @param {*} end \r\n * \r\n * @private\r\n * \r\n * @description\r\n * helper function for methods that adjust their start, end arguments with respect to\r\n * a python sequence type object\r\n */\r\nSk.builtin.slice.startEnd$wrt = function (pyObj, start, end) {\r\n    const len = pyObj.sq$length();\r\n    const msg = \"slice indices must be integers or have an __index__ method\";\r\n    if (start === undefined || Sk.builtin.checkNone(start)) {\r\n        start = 0;\r\n    } else {\r\n        start = Sk.misceval.asIndexSized(start, null, msg);\r\n        if (start < 0) {\r\n            start = start + len;\r\n            if (start < 0) {\r\n                start = 0;\r\n            }\r\n        }\r\n    }\r\n\r\n    if (end === undefined || Sk.builtin.checkNone(end)) {\r\n        end = len;\r\n    } else {\r\n        end = Sk.misceval.asIndexSized(end, null, msg);\r\n        if (end < 0) {\r\n            end = end + len;\r\n            if (end < 0) {\r\n                end = 0;\r\n            }\r\n        } else if (end > len) {\r\n            end = len;\r\n        }\r\n    }\r\n    return { start: start, end: end };\r\n};\r\n","/** @typedef {Sk.builtin.object} */ var pyObject;\r\n/** @typedef {Sk.builtin.type|Function} */ var typeObject;\r\n\r\n/**\r\n * @description\r\n * Wrappers and slot functions\r\n *\r\n * A wrapper function wrapper a slot defined on the prototype of a builtin type object\r\n * typically a a slot wrapper will be called with a self argument and args and kwargs\r\n *\r\n * self becomes this in when the slot wrapper is called\r\n * the slot wrapper_descriptor object takes care of checking that self is an instance of the type object\r\n * @param {*} self\r\n * @param {Array} args\r\n * @param {Array=} kwargs\r\n * @ignore\r\n */\r\nfunction wrapperCallNoArgs(self, args, kwargs) {\r\n    // this = the wrapped function\r\n    Sk.abstr.checkNoArgs(this.$name, args, kwargs);\r\n    const res = this.call(self);\r\n    if (res === undefined) {\r\n        return Sk.builtin.none.none$;\r\n    }\r\n    return res;\r\n}\r\n/**\r\n * @param {*} self\r\n * @param {Array} args\r\n * @param {Array=} kwargs\r\n * @ignore\r\n */\r\nfunction wrapperFastCall(self, args, kwargs) {\r\n    // this = the wrapped function\r\n    const res = this.call(self, args, kwargs);\r\n    if (res === undefined) {\r\n        return Sk.builtin.none.none$;\r\n    }\r\n    return res;\r\n}\r\n\r\n/**\r\n * @param {*} self\r\n * @param {Array} args\r\n * @param {Array=} kwargs\r\n * @ignore\r\n */\r\nfunction wrapperCallOneArg(self, args, kwargs) {\r\n    // this = the wrapped function\r\n    Sk.abstr.checkOneArg(this.$name, args, kwargs);\r\n    const res = this.call(self, args[0]);\r\n    if (res === undefined) {\r\n        return Sk.builtin.none.none$;\r\n    }\r\n    return res;\r\n}\r\n\r\n/**\r\n * @param {*} self\r\n * @param {!Array} args\r\n * @param {Array=} kwargs\r\n * @ignore\r\n */\r\nfunction wrapperCallTernary(self, args, kwargs) {\r\n    // this = the wrapped function\r\n    // only used for __pow__\r\n    Sk.abstr.checkNoKwargs(this.$name, kwargs);\r\n    Sk.abstr.checkArgsLen(this.$name, args, 1, 2);\r\n    const res = this.call(self, ...args);\r\n    if (res === undefined) {\r\n        return Sk.builtin.none.none$;\r\n    }\r\n    return res;\r\n}\r\n/**\r\n * @param {*} self\r\n * @param {Array} args\r\n * @param {Array=} kwargs\r\n * @ignore\r\n */\r\nfunction wrapperSet(self, args, kwargs) {\r\n    Sk.abstr.checkNoKwargs(this.$name, kwargs);\r\n    Sk.abstr.checkArgsLen(this.$name, args, 2, 2);\r\n    this.call(self, args[0], args[1]);\r\n    return Sk.builtin.none.none$;\r\n}\r\n/**\r\n * @param {*} self\r\n * @param {Array} args\r\n * @param {Array=} kwargs\r\n * @ignore\r\n */\r\nfunction wrapperRichCompare(self, args, kwargs) {\r\n    const res = wrapperCallOneArg.call(this, self, args, kwargs);\r\n    if (res === Sk.builtin.NotImplemented.NotImplemented$) {\r\n        return res;\r\n    }\r\n    return new Sk.builtin.bool(res);\r\n}\r\n\r\nfunction wrapperCallBack(wrapper, callback) {\r\n    return function (self,args, kwargs) {\r\n        const res = wrapper.call(this, self, args, kwargs);\r\n        return callback(res);\r\n    };\r\n}\r\n\r\n/**\r\n * @description\r\n * Slot functions are wrappers around an Sk.builtin.func\r\n * if skulpt calls tp$init on a type object the slotFunc will call the Sk.builtin.func\r\n *\r\n * with most slots we take the approach that we know which dunderFunc will be called\r\n * However some slots currently double up\r\n * e.g. mp$ass_subscript is called by both __setitem__ and __delitem__\r\n * for these dual slots we need to do a typelookup\r\n *\r\n * __getattr__ is another complicated case and the algorithm largely follows Cpython's algorithm\r\n * @ignore\r\n */\r\nfunction slotFuncNoArgs(dunderFunc) {\r\n    return function () {\r\n        const func = dunderFunc.tp$descr_get ? dunderFunc.tp$descr_get(this) : dunderFunc;\r\n        return Sk.misceval.callsimArray(func, []);\r\n    };\r\n}\r\n\r\n/**\r\n * @param {string} dunderName \r\n * @param {Function} checkFunc \r\n * @param {string} checkMsg \r\n * @param {Function=} f \r\n * @ignore\r\n */\r\nfunction slotFuncNoArgsWithCheck(dunderName, checkFunc, checkMsg, f) {\r\n    return function (dunderFunc) {\r\n        return function () {\r\n            const func = dunderFunc.tp$descr_get ? dunderFunc.tp$descr_get(this) : dunderFunc;\r\n            let res = Sk.misceval.callsimArray(func, []);\r\n            if (!checkFunc(res)) {\r\n                throw new Sk.builtin.TypeError(dunderName + \" should return \" + checkMsg + \" (returned \" + Sk.abstr.typeName(res) + \")\");\r\n            }\r\n            // f is might be a function that changes the result to a js object like for nb$bool which returns a Boolean\r\n            if (f !== undefined) {\r\n                return f(res);\r\n            }\r\n            return res;\r\n        };\r\n    };\r\n}\r\n\r\nfunction slotFuncOneArg(dunderFunc) {\r\n    return function (value) {\r\n        const func = dunderFunc.tp$descr_get ? dunderFunc.tp$descr_get(this) : dunderFunc;\r\n        return Sk.misceval.callsimArray(func, [value]);\r\n    };\r\n}\r\n\r\nfunction slotFuncGetAttribute(pyName, canSuspend) {\r\n    let getattributeFn = this.ob$type.$typeLookup(Sk.builtin.str.$getattribute);\r\n    if (getattributeFn instanceof Sk.builtin.wrapper_descriptor) {\r\n        // we're assuming here that internal tp$getattr won't raise an exception\r\n        return getattributeFn.d$wrapped.call(this, pyName, canSuspend);\r\n    }\r\n    if (getattributeFn.tp$descr_get) {\r\n        getattributeFn = getattributeFn.tp$descr_get(this);\r\n    }\r\n    const ret = Sk.misceval.tryCatch(\r\n        () => Sk.misceval.callsimOrSuspendArray(getattributeFn, [pyName]),\r\n        (e) => {\r\n            if (e instanceof Sk.builtin.AttributeError) {\r\n                return undefined;\r\n    } else {\r\n                throw e;\r\n    }\r\n        }\r\n    );\r\n    return canSuspend ? ret : Sk.misceval.retryOptionalSuspensionOrThrow(ret);\r\n}\r\n\r\nfunction slotFuncFastCall(dunderFunc) {\r\n    return function (args, kwargs) {\r\n        const func = dunderFunc.tp$descr_get ? dunderFunc.tp$descr_get(this) : dunderFunc;\r\n        return Sk.misceval.callsimOrSuspendArray(func, args, kwargs);\r\n    };\r\n}\r\n\r\n/**\r\n * this is currently a bit of a hack\r\n * in attempting to maintain dual slots like mp$ass_subscript for assigning and deleting\r\n * this function has to do a type lookup... since it doesn't know in advance if it is being asked to set or delete\r\n * @ignore\r\n */\r\nfunction slotFuncSetDelete(set_name, del_name, error_msg) {\r\n    return function (dunderFunc) {\r\n        return function (pyObject, value, canSuspend) {\r\n            let res, dunderName;\r\n            if (value === undefined) {\r\n                dunderName = del_name;\r\n                error_msg = null;\r\n            } else {\r\n                dunderName = set_name;\r\n            }\r\n            // do a type lookup and a wrapped function directly\r\n            let func = this.ob$type.$typeLookup(new Sk.builtin.str(dunderName));\r\n            if (func instanceof Sk.builtin.wrapper_descriptor) {\r\n                return func.d$wrapped.call(this, pyObject, value);\r\n            }\r\n            if (func.tp$descr_get) {\r\n                func = func.tp$descr_get(this);\r\n            }\r\n            \r\n            if (func !== undefined) {\r\n                const args = value === undefined ? [pyObject] : [pyObject, value];\r\n                res = Sk.misceval.callsimOrSuspendArray(func, args);\r\n            } else if (error_msg) {\r\n                throw new Sk.builtin.TypeError(\"'\" + Sk.abstr.typeName(this) + \"' object \" + error_msg);\r\n            } else {\r\n                throw new Sk.builtin.AttributeError(dunderName);\r\n            }\r\n            return canSuspend ? res : Sk.misceval.retryOptionalSuspensionOrThrow(res);\r\n        };\r\n    };\r\n}\r\n\r\n/**\r\n * @namespace\r\n *\r\n * @description\r\n * If you want to build a skulpt native class you need to understand slots\r\n * Each dunder method in python is matched to a slot in skulpt {@link Sk.dunderToSkulpt} which is closely aligned to a Cpython slot\r\n *\r\n * Plenty examples exist in {@link  Sk.builtin}\r\n *\r\n * If a user builds a `nativeClass` using {@link Sk.abstr.buildNativeClass } they define slots as javascript function\r\n * Dunder Methods will be created as `slot_wrappers`\r\n *\r\n * If a user defines a class in Python or using {@link Sk.misceval.buildClass}\r\n * Dunder Functions should be defined and slot funcs will be added\r\n *\r\n * Below is information about each slot function, should you decide to build a native class\r\n *\r\n * For mappings of slots to dunders see source code for {@link Sk.dunderToSkulpt} or [Sk.subSlots]{@link Sk.slots.subSlots}\r\n *\r\n */\r\nSk.slots = Object.create(null);\r\nconst slots = Sk.slots;\r\n\r\n/**\r\n *\r\n * @memberof Sk.slots\r\n * @member tp$doc\r\n * @implements __doc__\r\n * @suppress {checkTypes}\r\n * @type {string}\r\n */\r\n\r\n/**\r\n * @memberof Sk.slots\r\n * @method tp$init\r\n * @implements __init__\r\n * @suppress {checkTypes}\r\n * @param {Array} args\r\n * @param {Array=} kwargs\r\n * @returns {Sk.builtin.none}\r\n */\r\nSk.slots.__init__ = {\r\n    $name: \"__init__\",\r\n    $slot_name: \"tp$init\",\r\n    $slot_func: function (dunderFunc) {\r\n        return function tp$init(args, kwargs) {\r\n            const func = dunderFunc.tp$descr_get ? dunderFunc.tp$descr_get(this) : dunderFunc;\r\n            let ret = Sk.misceval.callsimOrSuspendArray(func, args, kwargs);\r\n            return Sk.misceval.chain(ret, (r) => {\r\n                if (!Sk.builtin.checkNone(r) && r !== undefined) {\r\n                    throw new Sk.builtin.TypeError(\"__init__() should return None, not \" + Sk.abstr.typeName(r));\r\n                }\r\n                return;\r\n            });\r\n        };\r\n    },\r\n    $wrapper: function (self, args, kwargs) {\r\n        // this = the wrapped function\r\n        this.call(self, args, kwargs);\r\n        return Sk.builtin.none.none$;\r\n    },\r\n    $textsig: \"($self, /, *args, **kwargs)\",\r\n    $flags: {FastCall: true},\r\n    $doc: \"Initialize self.  See help(type(self)) for accurate signature.\",\r\n};\r\n\r\n/**\r\n * @memberof Sk.slots\r\n * @method tp$new\r\n * @implements __new__\r\n * @suppress {checkTypes}\r\n * @returns {pyObject}\r\n * @param {Array} args\r\n * @param {Array=} kwargs\r\n * @description\r\n * {@link Sk.generic.new} {@link Sk.generic.newMethodDef} are related implementations of `tp$mew` and `__new__`\r\n * unusually `this = typeobject.prototype` since it is typically called like `typeobj.prototype.tp$new` and must\r\n * be taken into when writing an implementation of `tp$new`\r\n */\r\nslots.__new__ = {\r\n    $name: \"__new__\",\r\n    $slot_name: \"tp$new\",\r\n    $slot_func: function (dunderFunc) {\r\n        const tp$new = function (args, kwargs) {\r\n            let func = dunderFunc;\r\n            if (dunderFunc.tp$descr_get) {\r\n                func = dunderFunc.tp$descr_get(null, this.constructor);\r\n            } // weird behaviour ignore staticmethods bascically\r\n            return Sk.misceval.callsimOrSuspendArray(func, [this.constructor, ...args], kwargs);\r\n        };\r\n        tp$new.sk$static_new = false; // this is a flag used in the __new__ algorithm\r\n        return tp$new;\r\n    },\r\n    $wrapper: null, // handled separately since it's not a slot wrapper but an sk_method\r\n    $textsig: \"($self, /, *args, **kwargs)\",\r\n    $flags: {FastCall: true},\r\n    $doc: \"Create and return a new object.\",\r\n};\r\n\r\n/**\r\n * @memberof Sk.slots\r\n * @method tp$call\r\n * @implements __call__\r\n * @suppress {checkTypes}\r\n * @param {Array} args\r\n * @param {Array=} kwargs\r\n *\r\n */\r\nslots.__call__ = {\r\n    $name: \"__call__\",\r\n    $slot_name: \"tp$call\",\r\n    $slot_func: slotFuncFastCall,\r\n    $wrapper: function __call__(self, args, kwargs) {\r\n        // function fast call objects override the prototype.tp$call\r\n        // so use self.tp$call instead of this.call(self)\r\n        const res = self.tp$call(args, kwargs);\r\n        if (res === undefined) {\r\n            return Sk.builtin.none.none$;\r\n        }\r\n        return res;\r\n    }\r\n    ,\r\n    $textsig: \"($self, /, *args, **kwargs)\",\r\n    $flags: {FastCall: true},\r\n    $doc: \"Call self as a function.\",\r\n};\r\n\r\n/**\r\n * @memberof Sk.slots\r\n * @method $r\r\n * @implements __repr__\r\n * @suppress {checkTypes}\r\n * @returns {Sk.builtin.str}\r\n */\r\nslots.__repr__ = {\r\n    $name: \"__repr__\",\r\n    $slot_name: \"$r\",\r\n    $slot_func: slotFuncNoArgsWithCheck(\"__repr__\", Sk.builtin.checkString, \"str\"),\r\n    $wrapper: wrapperCallNoArgs,\r\n    $textsig: \"($self, /)\",\r\n    $flags: {NoArgs: true},\r\n    $doc: \"Return repr(self).\",\r\n};\r\n\r\n/**\r\n * @memberof Sk.slots\r\n * @method tp$str\r\n * @implements `__str__`\r\n * @suppress {checkTypes}\r\n * @returns {Sk.builtin.str}\r\n */\r\nslots.__str__ = {\r\n    $name: \"__str__\",\r\n    $slot_name: \"tp$str\",\r\n    $slot_func: slotFuncNoArgsWithCheck(\"__str__\", Sk.builtin.checkString, \"str\"),\r\n    $wrapper: wrapperCallNoArgs,\r\n    $textsig: \"($self, /)\",\r\n    $flags: {NoArgs: true},\r\n    $doc: \"Return str(self).\",\r\n};\r\n\r\nvar hash_slot = slotFuncNoArgsWithCheck(\"__hash__\", Sk.builtin.checkInt, \"int\", (res) => typeof res.v === \"number\" ? res.v : res.tp$hash());\r\n/**\r\n * @memberof Sk.slots\r\n * @method tp$hash\r\n * @implements __hash__\r\n * @suppress {checkTypes}\r\n * @returns {Sk.builtin.int_}\r\n * @description\r\n * To be unhashable set this slot to {@link Sk.builtin.none.none$} or call {@link Sk.abstr.markUnhashable}\r\n */\r\nslots.__hash__ = {\r\n    $name: \"__hash__\",\r\n    $slot_name: \"tp$hash\",\r\n    $slot_func: function (dunder_func) {\r\n        if (dunder_func === Sk.builtin.none.none$) {\r\n            return Sk.builtin.none.none$;\r\n        }\r\n        return hash_slot(dunder_func);\r\n    },\r\n    $wrapper: wrapperCallBack(wrapperCallNoArgs, (res) => new Sk.builtin.int_(res)),\r\n    $textsig: \"($self, /)\",\r\n    $flags: {NoArgs: true},\r\n    $doc: \"Return hash(self).\",\r\n};\r\n\r\n// getters/setters/deletters\r\n\r\n/**\r\n * @memberof Sk.slots\r\n * @method tp$getattr\r\n * @implements __getattribute__\r\n * @suppress {checkTypes}\r\n *\r\n * @param {Sk.builtin.str} pyName\r\n * @param {boolean=} canSuspend\r\n *\r\n * @returns {pyObject|undefined}\r\n * @description\r\n * This slot will also be given to a pyObject which defines `__getattr__`\r\n */\r\nslots.__getattribute__ = {\r\n    $name: \"__getattribute__\",\r\n    $slot_name: \"tp$getattr\",\r\n    $slot_func: function (dunderFunc) {\r\n        return function tp$getattr(pyName, canSuspend) {\r\n            let getattrFn = this.ob$type.$typeLookup(Sk.builtin.str.$getattr);\r\n            if (getattrFn === undefined) {\r\n                return slotFuncGetAttribute.call(this, pyName, canSuspend);\r\n            }\r\n            const ret = Sk.misceval.chain(slotFuncGetAttribute.call(this, pyName, canSuspend), (val) =>\r\n                    Sk.misceval.tryCatch(\r\n                        () => {\r\n                            if (val !== undefined) {\r\n                                return val;\r\n                            }\r\n                        if (getattrFn.tp$descr_get) {\r\n                            getattrFn = getattrFn.tp$descr_get(this);\r\n                        }\r\n                        return Sk.misceval.callsimOrSuspendArray(getattrFn, [pyName]);\r\n                        },\r\n                        function (e) {\r\n                            if (e instanceof Sk.builtin.AttributeError) {\r\n                                return undefined;\r\n                            } else {\r\n                                throw e;\r\n                            }\r\n                        }\r\n                    )\r\n            );\r\n            return canSuspend ? ret : Sk.misceval.retryOptionalSuspensionOrThrow(ret);\r\n        };\r\n    },\r\n    $wrapper: function (self, args, kwargs) {\r\n        // this = the wrapped function\r\n        Sk.abstr.checkOneArg(this.$name, args, kwargs);\r\n        const pyName = args[0];\r\n        if (!Sk.builtin.checkString(pyName)) {\r\n            throw new Sk.builtin.TypeError(\"attribute name must be string, not '\" + Sk.abstr.typeName(pyName) + \"'\");\r\n        }\r\n        const res = this.call(self, pyName);\r\n        if (res === undefined) {\r\n            throw new Sk.builtin.AttributeError(Sk.abstr.typeName(self) + \" has no attribute \" + pyName.$jsstr());\r\n        }\r\n        return res;\r\n    },\r\n    $textsig: \"($self, name, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return getattr(self, name).\",\r\n};\r\n\r\nslots.__getattr__ = {\r\n    $name: \"__getattr__\",\r\n    $slot_name: \"tp$getattr\",\r\n    $slot_func: slots.__getattribute__.$slot_func,\r\n    $wrapper: null,\r\n    $textsig: \"($self, name, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return getattr(self, name).\",\r\n};\r\n\r\n\r\n/* Helper to check for object.__setattr__ or __delattr__ applied to a type.\r\n   This is called the Carlo Verre hack after its discoverer. */\r\nfunction hackcheck(obj, func) {\r\n    let type = obj.ob$type;\r\n    while (type && type.sk$klass !== undefined) {\r\n        type = type.prototype.tp$base;\r\n    }\r\n    if (type && type.prototype.tp$setattr !== func) {\r\n        throw new Sk.builtin.TypeError(\"can't apply this \" + func.$name + \" to \" + Sk.abstr.typeName(obj) + \" object\");\r\n    }\r\n}\r\n\r\n/**\r\n * @suppress {checkTypes}\r\n * @memberof Sk.slots\r\n * @method tp$setattr\r\n * @implements __setattr__\r\n * @param {Sk.builtin.str} pyName\r\n * @param {pyObject|undefined} value undefined indicates the attribute is to be deleted\r\n * @param {boolean=} canSuspend\r\n * @description\r\n * `tp$setattr` is responsible for throwing its own exceptions. It also implements __delattr__\r\n */\r\nslots.__setattr__ = {\r\n    $name: \"__setattr__\",\r\n    $slot_name: \"tp$setattr\",\r\n    $slot_func: slotFuncSetDelete(\"__setattr__\", \"__delattr__\"),\r\n    // not need for an error message setattr is always defined on object\r\n    $wrapper: function(self, args, kwargs) {\r\n        Sk.abstr.checkNoKwargs(this.$name, kwargs);\r\n        Sk.abstr.checkArgsLen(this.$name, args, 2, 2);\r\n        hackcheck(self, this);\r\n        this.call(self, args[0], args[1]);\r\n        return Sk.builtin.none.none$; \r\n    },\r\n    $textsig: \"($self, name, value, /)\",\r\n    $flags: {MinArgs: 2, MaxArgs: 2},\r\n    $doc: \"Implement setattr(self, name, value).\",\r\n};\r\n\r\nslots.__delattr__ = {\r\n    $name: \"__delattr__\",\r\n    $slot_name: \"tp$setattr\",\r\n    $slot_func: slots.__setattr__.$slot_func,\r\n    $wrapper: function(self, args, kwargs) {\r\n        Sk.abstr.checkOneArg(this.$name, args, kwargs);\r\n        hackcheck(self, this);\r\n        this.call(self, args[0]);\r\n        return Sk.builtin.none.none$;\r\n    },\r\n    $textsig: \"($self, name, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Implement delattr(self, name).\",\r\n};\r\n\r\n/**\r\n * @memberof Sk.slots\r\n * @method tp$descr_get\r\n * @implements __get__\r\n * @suppress {checkTypes}\r\n * @param {pyObject} obj\r\n * @param {typeObject=} obtype\r\n * @param {boolean=} canSuspend\r\n */\r\nslots.__get__ = {\r\n    $name: \"__get__\",\r\n    $slot_name: \"tp$descr_get\",\r\n    $slot_func: function (dunderFunc) {\r\n        return function tp$descr_get(obj, obtype, canSuspend) {\r\n            if (obj === null) {\r\n                obj = Sk.builtin.none.none$;\r\n            }\r\n            if (obtype == null) {\r\n                obtype = Sk.builtin.none.none$;\r\n            }\r\n            const func = dunderFunc.tp$descr_get ? dunderFunc.tp$descr_get(this) :  dunderFunc;\r\n            const ret = Sk.misceval.callsimOrSuspendArray(func, [obj, obtype]);\r\n            return canSuspend ? ret : Sk.misceval.retryOptionalSuspensionOrThrow(ret);\r\n        };\r\n    },\r\n    $wrapper: function (self, args, kwargs) {\r\n        Sk.abstr.checkNoKwargs(this.$name, kwargs);\r\n        Sk.abstr.checkArgsLen(this.$name, args, 1, 2);\r\n        let obj = args[0];\r\n        let obtype = args[1];\r\n        if (obj === Sk.builtin.none.none$) {\r\n            obj = null;\r\n        }\r\n        if (obtype === Sk.builtin.none.none$) {\r\n            obtype = null;\r\n        }\r\n        if (obtype === null && obj === null) {\r\n            throw new Sk.builtin.TypeError(\"__get__(None, None) is invalid\");\r\n        }\r\n        return this.call(self, obj, obtype);\r\n    },\r\n    $textsig: \"($self, instance, owner, /)\",\r\n    $flags: {MinArgs: 2, MaxArgs: 2},\r\n    $doc: \"Return an attribute of instance, which is of type owner.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method tp$descr_set\r\n * @implements __set__\r\n * @suppress {checkTypes}\r\n * @param {pyObject} obj\r\n * @param {pyObject|undefined} value undefined will signals __delete__\r\n * @param {boolean=} canSuspend\r\n * @description\r\n * Also implements __delete__\r\n */\r\nslots.__set__ = {\r\n    $name: \"__set__\",\r\n    $slot_name: \"tp$descr_set\",\r\n    $slot_func: slotFuncSetDelete(\"__set__\", \"__delete__\"),\r\n    $wrapper: wrapperSet,\r\n    $textsig: \"($self, instance, value, /)\",\r\n    $flags: {MinArgs: 2, MaxArgs: 2},\r\n    $doc: \"Set an attribute of instance to value.\",\r\n};\r\n\r\nslots.__delete__ = {\r\n    $name: \"__delete__\",\r\n    $slot_name: \"tp$descr_set\",\r\n    $slot_func: slots.__set__.$slot_func,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, instance, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Delete an attribute of instance.\",\r\n};\r\n\r\n/**\r\n * @memberof Sk.slots\r\n * @method tp$richcompare\r\n * @implements __eq__\r\n * @suppress {checkTypes}\r\n * @param {pyObject} other\r\n * @param {string} opname \"Eq\", \"NotEq\", \"Lt\", \"LtE\", \"Gt\", \"GtE\"\r\n * @returns {boolean}\r\n * @description\r\n * __eq__/__ne__/__lt__/__le__/__gt__/__ge__\r\n * Either define tp$richcompare or any of the `ob$*` slots\r\n * If `tp$richcompare` is defined then the `nativeClass` will get wrapper functions into each `ob$*` slot\r\n */\r\n\r\n    /**\r\n     * @memberof Sk.slots\r\n     * @method ob$eq\r\n     * @implements __eq__\r\n * @suppress {checkTypes}\r\n     * @returns {boolean}\r\n     */\r\n    slots.__eq__ = {\r\n        $name: \"__eq__\",\r\n        $slot_name: \"ob$eq\",\r\n        $slot_func: slotFuncOneArg,\r\n        $wrapper: wrapperRichCompare,\r\n        $textsig: \"($self, value, /)\",\r\n        $flags: {OneArg: true},\r\n        $doc: \"Return self==value.\",\r\n    };\r\n\r\n    /**\r\n     * @memberof Sk.slots\r\n     * @method ob$ge\r\n     * @implements __ge__\r\n * @suppress {checkTypes}\r\n     * @returns {boolean}\r\n     */\r\n    slots.__ge__ = {\r\n        $name: \"__ge__\",\r\n        $slot_name: \"ob$ge\",\r\n        $slot_func: slotFuncOneArg,\r\n        $wrapper: wrapperRichCompare,\r\n        $textsig: \"($self, value, /)\",\r\n        $flags: {OneArg: true},\r\n        $doc: \"Return self>=value.\",\r\n    };\r\n    /**\r\n     * @memberof Sk.slots\r\n     * @method ob$gt\r\n     * @implements __gt__\r\n * @suppress {checkTypes}\r\n     * @returns {boolean}\r\n     */\r\n    slots.__gt__ = {\r\n        $name: \"__gt__\",\r\n        $slot_name: \"ob$gt\",\r\n        $slot_func: slotFuncOneArg,\r\n        $wrapper: wrapperRichCompare,\r\n        $textsig: \"($self, value, /)\",\r\n        $flags: {OneArg: true},\r\n        $doc: \"Return self>value.\",\r\n    };\r\n    /**\r\n     * @memberof Sk.slots\r\n     * @method ob$le\r\n     * @implements __le__\r\n * @suppress {checkTypes}\r\n     * @returns {boolean}\r\n     */\r\n    slots.__le__ = {\r\n        $name: \"__le__\",\r\n        $slot_name: \"ob$le\",\r\n        $slot_func: slotFuncOneArg,\r\n        $wrapper: wrapperRichCompare,\r\n        $textsig: \"($self, value, /)\",\r\n        $flags: {OneArg: true},\r\n        $doc: \"Return self<=value.\",\r\n    };\r\n    /**\r\n     * @memberof Sk.slots\r\n     * @method ob$lt\r\n     * @implements __lt__\r\n * @suppress {checkTypes}\r\n     * @returns {boolean}\r\n     */\r\n    slots.__lt__ = {\r\n        $name: \"__lt__\",\r\n        $slot_name: \"ob$lt\",\r\n        $slot_func: slotFuncOneArg,\r\n        $wrapper: wrapperRichCompare,\r\n        $textsig: \"($self, value, /)\",\r\n        $flags: {OneArg: true},\r\n        $doc: \"Return self<value.\",\r\n    };\r\n    /**\r\n     * @memberof Sk.slots\r\n     * @method ob$ne\r\n     * @implements __ne__\r\n * @suppress {checkTypes}\r\n     * @returns {boolean}\r\n     */\r\n    slots.__ne__ = {\r\n        $name: \"__ne__\",\r\n        $slot_name: \"ob$ne\",\r\n        $slot_func: slotFuncOneArg,\r\n        $wrapper: wrapperRichCompare,\r\n        $textsig: \"($self, value, /)\",\r\n        $flags: {OneArg: true},\r\n        $doc: \"Return self!=value.\",\r\n    };\r\n\r\n// iters\r\n\r\n/**\r\n * @memberof Sk.slots\r\n * @method tp$iter\r\n * @implements __iter__\r\n * @suppress {checkTypes}\r\n * @returns {pyObject} must have a valid `tp$iternext` slot\r\n * See {@link Sk.abstr.buildIteratorClass} and {@link Sk.misceval.iterator}\r\n */\r\nslots.__iter__ = {\r\n    $name: \"__iter__\",\r\n    $slot_name: \"tp$iter\",\r\n    $slot_func: slotFuncNoArgs,\r\n    $wrapper: wrapperCallNoArgs,\r\n    $textsig: \"($self, /)\",\r\n    $flags: {NoArgs: true},\r\n    $doc: \"Implement iter(self).\",\r\n};\r\n\r\n/**\r\n * @memberof Sk.slots\r\n * @method tp$iternext\r\n * @param {boolean=} canSuspend\r\n * @implements __next__\r\n * @suppress {checkTypes}\r\n * @returns {pyObject|undefined} Do not raise a StopIteration error instead return undefined\r\n */\r\nslots.__next__ = {\r\n    $name: \"__next__\",\r\n    $slot_name: \"tp$iternext\",\r\n    $slot_func: function (dunderFunc) {\r\n        return function tp$iternext(canSuspend) {\r\n            const func = dunderFunc.tp$descr_get ? dunderFunc.tp$descr_get(this) :  dunderFunc;\r\n            const ret = Sk.misceval.tryCatch(\r\n                () => Sk.misceval.callsimOrSuspendArray(func, []),\r\n                    (e) => {\r\n                        if (e instanceof Sk.builtin.StopIteration) {\r\n                        this.gi$ret = e.$value;\r\n                            return undefined;\r\n                        } else {\r\n                            throw e;\r\n                        }\r\n                    }\r\n                );\r\n            return canSuspend ? ret : Sk.misceval.retryOptionalSuspensionOrThrow(ret);\r\n        };\r\n    },\r\n    /**\r\n     *\r\n     * @param {*} self\r\n     * @param {Array} args\r\n     * @param {Array|undefined=} kwargs\r\n     */\r\n    $wrapper: function (self, args, kwargs) {\r\n        // this = the wrapped function\r\n        Sk.abstr.checkNoArgs(this.$name, args, kwargs);\r\n        // the first tp$iternext is sometimes different from the prototype.tp$iternext\r\n        // so instead of this.call(self) use self.tp$iternext\r\n        return Sk.misceval.chain(self.tp$iternext(true), (res) => {\r\n            if (res === undefined) {\r\n                throw new Sk.builtin.StopIteration();\r\n            }\r\n            return res;\r\n        });\r\n    },\r\n    $textsig: \"($self, /)\",\r\n    $flags: {NoArgs: true},\r\n    $doc: \"Implement next(self).\",\r\n};\r\n\r\n// sequence and mapping\r\n/**\r\n * @memberof Sk.slots\r\n * @member tp$as_sequence_or_mapping\r\n * @type {boolean}\r\n * @description\r\n * set `tp$as_sequence_or_mapping` to `true` in order for for {@link Sk.abstr.buildNativeClass}\r\n * to acquire appropriate `slot_wrappers` for the slots\r\n * - [sq$length]{@link Sk.slots.sq$length}\r\n * - [sq$concat]{@link Sk.slots.sq$concat}\r\n * - [sq$contains]{@link Sk.slots.sq$contains}\r\n * - [sq$repeat]{@link Sk.slots.sq$repeat}\r\n * - [mp$subscript]{@link Sk.slots.mp$subscript}\r\n * - [mp$ass_subscript]{@link Sk.slots.mp$ass_subscript}\r\n */\r\n\r\n/**\r\n * @memberof Sk.slots\r\n * @method sq$concat\r\n * @implements __add__\r\n * @suppress {checkTypes}\r\n * @description defining `sq$concat` along with {@link Sk.slots.tp$as_sequence_or_mapping} will gain the slot\r\n * `__add__`.\r\n * note that this slot will be equivalent to the [nb$add]{@link Sk.slots.nb$add} slot\r\n */\r\n\r\n/**\r\n * @memberof Sk.slots\r\n * @method sq$repeat\r\n * @implements __mul__/__rmul__\r\n * @suppress {checkTypes}\r\n * @description defining `sq$repeat` along with {@link Sk.slots.tp$as_sequence_or_mapping} will gain the slots\r\n * `__mul__` and `__rmul__`\r\n * note that this slot will be equivalent to the [nb$multiply]{@link Sk.slots.nb$multiply} slot\r\n */\r\n\r\n/**\r\n * @memberof Sk.slots\r\n * @method sq$length\r\n * @param {boolean=} canSuspend\r\n * @implements __len__\r\n * @suppress {checkTypes}\r\n * @returns {number}\r\n */\r\nslots.__len__ = {\r\n    $name: \"__len__\",\r\n    $slot_name: \"sq$length\",\r\n    $slot_func: function (dunderFunc) {\r\n        return function sq$length(canSuspend) {\r\n            let res;\r\n            const func = dunderFunc.tp$descr_get ? dunderFunc.tp$descr_get(this) :  dunderFunc;\r\n            if (canSuspend) {\r\n                res = Sk.misceval.callsimOrSuspendArray(func, []);\r\n                return Sk.misceval.chain(res, (r) => {\r\n                    return Sk.misceval.asIndexOrThrow(r);\r\n                });\r\n            } else {\r\n                res = Sk.misceval.callsimArray(func, []);\r\n                return Sk.misceval.asIndexOrThrow(res);\r\n            }\r\n        };\r\n    },\r\n    $wrapper: wrapperCallBack(wrapperCallNoArgs, (res) => new Sk.builtin.int_(res)),\r\n    $flags: {NoArgs: true},\r\n    $textsig: \"($self, /)\",\r\n    $doc: \"Return len(self).\",\r\n};\r\n\r\n/**\r\n * @suppress {checkTypes}\r\n * @memberof Sk.slots\r\n * @method sq$contains\r\n *\r\n * @param {pyObject} key\r\n * @param {boolean=} canSuspend\r\n *\r\n * @implements __contains__\r\n * @returns {boolean}\r\n */\r\nslots.__contains__ = {\r\n    $name: \"__contains__\",\r\n    $slot_name: \"sq$contains\",\r\n    $slot_func: function (dunderFunc) {\r\n        return function sq$contains(key, canSuspend) {\r\n            const func = dunderFunc.tp$descr_get ? dunderFunc.tp$descr_get(this) :  dunderFunc;\r\n            let res = Sk.misceval.callsimOrSuspendArray(func, [key]);\r\n            res = Sk.misceval.chain(res, (r) => Sk.misceval.isTrue(r));\r\n            if (res.$isSuspension) {\r\n                return canSuspend ? res : Sk.misceval.retryOptionalSuspensionOrThrow(res);\r\n            }\r\n            return res;\r\n        };\r\n    },\r\n    // todo - allow for suspensions - but no internal functions suspend here\r\n    $wrapper: wrapperCallBack(wrapperCallOneArg, (res) => new Sk.builtin.bool(res)),\r\n    $textsig: \"($self, key, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return key in self.\",\r\n};\r\n\r\n/**\r\n * @memberof Sk.slots\r\n * @method mp$subscript\r\n * @param {pyObject} key - might be a pyStr, pyInt or pySlice\r\n * @param {boolean=} canSuspend\r\n * @implements __getitem__\r\n * @suppress {checkTypes}\r\n * @returns {pyObject}\r\n * @throws {Sk.builtin.TypeError}\r\n */\r\nslots.__getitem__ = {\r\n    $name: \"__getitem__\",\r\n    $slot_name: \"mp$subscript\",\r\n    $slot_func: function (dunderFunc) {\r\n        return function mp$subscript(key, canSuspend) {\r\n            const func = dunderFunc.tp$descr_get ? dunderFunc.tp$descr_get(this) :  dunderFunc;\r\n            const ret = Sk.misceval.callsimOrSuspendArray(func, [key]);\r\n            return canSuspend ? ret : Sk.misceval.retryOptionalSuspensionOrThrow(ret);\r\n        };\r\n    },\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, key, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return self[key].\",\r\n};\r\n\r\n/**\r\n * @memberof Sk.slots\r\n * @method mp$ass_subscript\r\n * @param {pyObject} item - might be a pyStr, pyInt or pySlice\r\n * @param {pyObject|undefined} value - undefined indicates the item should be deleted\r\n * @param {boolean=} canSuspend\r\n * @implements __setitem__\r\n * @suppress {checkTypes}\r\n * @returns {pyObject}\r\n * @throws {Sk.builtin.TypeError}\r\n * @description\r\n * Also implements __delitem__\r\n */\r\nslots.__setitem__ = {\r\n    $name: \"__setitem__\",\r\n    $slot_name: \"mp$ass_subscript\",\r\n    $slot_func: slotFuncSetDelete(\"__setitem__\", \"__delitem__\", \"does not support item assignment\"),\r\n    $wrapper: wrapperSet,\r\n    $textsig: \"($self, key, value, /)\",\r\n    $flags: {MinArgs: 2, MaxArgs: 2},\r\n    $doc: \"Set self[key] to value.\",\r\n};\r\n\r\nslots.__delitem__ = {\r\n    $name: \"__delitem__\",\r\n    $slot_name: \"mp$ass_subscript\",\r\n    $slot_func: slots.__setitem__.$slot_func,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, key, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Delete self[key].\",\r\n};\r\n\r\n// number slots\r\n/**\r\n * @memberof Sk.slots\r\n * @member tp$as_number\r\n * @type {boolean}\r\n * @description\r\n * set `tp$as_number` to `true` in order for for {@link Sk.abstr.buildNativeClass}\r\n * to acquire appropriate `slot_wrappers` for number slots\r\n * You can find an exhaustive list in the source code {@link Sk.slots}\r\n *\r\n * Examples:\r\n * - [nb$add]{@link Sk.slots.nb$add}\r\n * - [nb$int]{@link Sk.slots.nb$int}\r\n * - [nb$divide]{@link Sk.slots.nb$divide} - note we do not use `nb$true_divide`\r\n * - [nb$bool]{@link Sk.slots.nb$bool} - should return a js boolean\r\n *\r\n * You need not define `nb$reflected_*` slots unless your implementation is different from the default implementation\r\n * Similarly `nb$inplace_` need not be defined unless the implementation is different from the usual slot.\r\n *\r\n */\r\n\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$add\r\n * @implements __add__\r\n * @suppress {checkTypes}\r\n * @description\r\n * the reflected slot will be defined if not set\r\n *\r\n */\r\nslots.__add__ = {\r\n    $name: \"__add__\",\r\n    $slot_name: \"nb$add\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return self+value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$relfceted_add\r\n * @implements __radd__\r\n * @suppress {checkTypes}\r\n * @description\r\n * the reflected slot will be defined if not set\r\n *\r\n */\r\nslots.__radd__ = {\r\n    $name: \"__radd__\",\r\n    $slot_name: \"nb$reflected_add\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return value+self.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$inplace_add\r\n * @implements __iadd__\r\n * @suppress {checkTypes}\r\n * @description\r\n * Only define this if your implementation is different from `nb$add`\r\n *\r\n */\r\nslots.__iadd__ = {\r\n    $name: \"__iadd__\",\r\n    $slot_name: \"nb$inplace_add\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Implement self+=value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$subtract\r\n * @implements __sub__\r\n * @suppress {checkTypes}\r\n *\r\n */\r\nslots.__sub__ = {\r\n    $name: \"__sub__\",\r\n    $slot_name: \"nb$subtract\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return self-value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$reflected_subtract\r\n * @implements __rsub__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__rsub__ = {\r\n    $name: \"__rsub__\",\r\n    $slot_name: \"nb$reflected_subtract\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return value-self.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$inplace_multiply\r\n * @implements __imul__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__imul__ = {\r\n    $name: \"__imul__\",\r\n    $slot_name: \"nb$inplace_multiply\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Implement self*=value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$multiply\r\n * @implements __mul__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__mul__ = {\r\n    $name: \"__mul__\",\r\n    $slot_name: \"nb$multiply\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return self*value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$reflected_multiply\r\n * @implements __rmul__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__rmul__ = {\r\n    $name: \"__rmul__\",\r\n    $slot_name: \"nb$reflected_multiply\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return value*self.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$inplace_subtract\r\n * @implements __isub__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__isub__ = {\r\n    $name: \"__isub__\",\r\n    $slot_name: \"nb$inplace_subtract\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Implement self-=value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$remainder\r\n * @implements __mod__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__mod__ = {\r\n    $name: \"__mod__\",\r\n    $slot_name: \"nb$remainder\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return self%value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$reflected_remainder\r\n * @implements __rmod__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__rmod__ = {\r\n    $name: \"__rmod__\",\r\n    $slot_name: \"nb$reflected_remainder\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return value%self.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$inplace_remainder\r\n * @implements __imod__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__imod__ = {\r\n    $name: \"__imod__\",\r\n    $slot_name: \"nb$inplace_remainder\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Implement value%=self.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$divmod\r\n * @implements __divmod__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__divmod__ = {\r\n    $name: \"__divmod__\",\r\n    $slot_name: \"nb$divmod\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return divmod(self, value).\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$reflected_divmod\r\n * @implements __rdivmod__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__rdivmod__ = {\r\n    $name: \"__rdivmod__\",\r\n    $slot_name: \"nb$reflected_divmod\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return divmod(value, self)\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$positive\r\n * @implements __pos__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__pos__ = {\r\n    $name: \"__pos__\",\r\n    $slot_name: \"nb$positive\",\r\n    $slot_func: slotFuncNoArgs,\r\n    $wrapper: wrapperCallNoArgs,\r\n    $textsig: \"($self, /)\",\r\n    $flags: {NoArgs: true},\r\n    $doc: \"+self\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$negative\r\n * @implements __neg__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__neg__ = {\r\n    $name: \"__neg__\",\r\n    $slot_name: \"nb$negative\",\r\n    $slot_func: slotFuncNoArgs,\r\n    $wrapper: wrapperCallNoArgs,\r\n    $textsig: \"($self, /)\",\r\n    $flags: {NoArgs: true},\r\n    $doc: \"-self\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$abs\r\n * @implements __abs__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__abs__ = {\r\n    $name: \"__abs__\",\r\n    $slot_name: \"nb$abs\",\r\n    $slot_func: slotFuncNoArgs,\r\n    $wrapper: wrapperCallNoArgs,\r\n    $textsig: \"($self, /)\",\r\n    $flags: {NoArgs: true},\r\n    $doc: \"abs(self)\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$bool\r\n * @implements __bool__\r\n * @suppress {checkTypes}\r\n * @returns {boolean}\r\n */\r\nslots.__bool__ = {\r\n    $name: \"__bool__\",\r\n    $slot_name: \"nb$bool\",\r\n    $slot_func: slotFuncNoArgsWithCheck(\"__bool__\", Sk.builtin.checkBool, \"bool\", (res) => res.v !== 0),\r\n    $wrapper: wrapperCallBack(wrapperCallNoArgs, (res) => new Sk.builtin.bool(res)),\r\n    $textsig: \"($self, /)\",\r\n    $flags: {NoArgs: true},\r\n    $doc: \"self != 0\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$invert\r\n * @implements __invert__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__invert__ = {\r\n    $name: \"__invert__\",\r\n    $slot_name: \"nb$invert\",\r\n    $slot_func: slotFuncNoArgs,\r\n    $wrapper: wrapperCallNoArgs,\r\n    $textsig: \"($self, /)\",\r\n    $flags: {NoArgs: true},\r\n    $doc: \"~self\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$lshift\r\n * @implements __lshift__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__lshift__ = {\r\n    $name: \"__lshift__\",\r\n    $slot_name: \"nb$lshift\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return self<<value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$reflected_lshift\r\n * @implements __rlshift__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__rlshift__ = {\r\n    $name: \"__rlshift__\",\r\n    $slot_name: \"nb$reflected_lshift\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return value<<self.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$rshift\r\n * @implements __rshift__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__rshift__ = {\r\n    $name: \"__rshift__\",\r\n    $slot_name: \"nb$rshift\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return self>>value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$reflected_rshift\r\n * @implements __rrshift__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__rrshift__ = {\r\n    $name: \"__rrshift__\",\r\n    $slot_name: \"nb$reflected_rshift\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return value>>self.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$inplace_lshift\r\n * @implements __ilshift__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__ilshift__ = {\r\n    $name: \"__ilshift__\",\r\n    $slot_name: \"nb$inplace_lshift\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Implement self<<=value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$inplace_rshift\r\n * @implements __irshift__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__irshift__ = {\r\n    $name: \"__irshift__\",\r\n    $slot_name: \"nb$inplace_rshift\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Implement self=>>value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$and\r\n * @implements __and__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__and__ = {\r\n    $name: \"__and__\",\r\n    $slot_name: \"nb$and\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return self&value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$reflected_and\r\n * @implements __rand__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__rand__ = {\r\n    $name: \"__rand__\",\r\n    $slot_name: \"nb$refelcted_and\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return value&self.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$inplace_and\r\n * @implements __iand__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__iand__ = {\r\n    $name: \"__iand__\",\r\n    $slot_name: \"nb$and\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Implement self&=value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$xor\r\n * @implements __xor__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__xor__ = {\r\n    $name: \"__xor__\",\r\n    $slot_name: \"nb$xor\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return self^value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$reflected_xor\r\n * @implements __rxor__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__rxor__ = {\r\n    $name: \"__rxor__\",\r\n    $slot_name: \"nb$reflected_xor\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return value^self.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$inplace_xor\r\n * @implements __ixor__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__ixor__ = {\r\n    $name: \"__ixor__\",\r\n    $slot_name: \"nb$inplace_xor\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Implement self^=value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$or\r\n * @implements __or__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__or__ = {\r\n    $name: \"__or__\",\r\n    $slot_name: \"nb$or\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return self|value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$reflected_or\r\n * @implements __ror__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__ror__ = {\r\n    $name: \"__ror__\",\r\n    $slot_name: \"nb$reflected_or\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return value|self.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$reflected_ior\r\n * @implements __ior__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__ior__ = {\r\n    $name: \"__ior__\",\r\n    $slot_name: \"nb$inplace_or\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Implement self|=value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$int\r\n * @implements __int__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__int__ = {\r\n    $name: \"__int__\",\r\n    $slot_name: \"nb$int\",\r\n    $slot_func: slotFuncNoArgsWithCheck(\"__int__\", Sk.builtin.checkInt, \"int\"),\r\n    $wrapper: wrapperCallNoArgs,\r\n    $textsig: \"($self, /)\",\r\n    $flags: {NoArgs: true},\r\n    $doc: \"int(self)\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$float\r\n * @implements __float__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__float__ = {\r\n    $name: \"__float__\",\r\n    $slot_name: \"nb$float\",\r\n    $slot_func: slotFuncNoArgsWithCheck(\"__float__\", Sk.builtin.checkFloat, \"float\"),\r\n    $wrapper: wrapperCallNoArgs,\r\n    $textsig: \"($self, /)\",\r\n    $flags: {NoArgs: true},\r\n    $doc: \"float(self)\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$floor_divide\r\n * @implements __floordiv__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__floordiv__ = {\r\n    $name: \"__floordiv__\",\r\n    $slot_name: \"nb$floor_divide\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return self//value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$reflected_floor_divide\r\n * @implements __rfloordiv__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__rfloordiv__ = {\r\n    $name: \"__rfloordiv__\",\r\n    $slot_name: \"nb$reflected_floor_divide\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return value//self.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$inplace_floor_divide\r\n * @implements __ifloordiv__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__ifloordiv__ = {\r\n    $name: \"__ifloordiv__\",\r\n    $slot_name: \"nb$inplace_floor_divide\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Implement self//=value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$divide\r\n * @implements __truediv__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__truediv__ = {\r\n    $name: \"__truediv__\",\r\n    $slot_name: \"nb$divide\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return self/value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$reflected_divide\r\n * @implements __rtruediv__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__rtruediv__ = {\r\n    $name: \"__rtruediv__\",\r\n    $slot_name: \"nb$reflected_divide\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return value/self.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$inplace_divide\r\n * @implements __itruediv__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__itruediv__ = {\r\n    $name: \"__itruediv__\",\r\n    $slot_name: \"nb$inplace_divide\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Implement self/=value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$index\r\n * @implements __index__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__index__ = {\r\n    $name: \"__index__\",\r\n    $slot_name: \"nb$index\",\r\n    $slot_func: slotFuncNoArgsWithCheck(\"__index__\", Sk.builtin.checkInt, \"int\", (res) => res.v),\r\n    $wrapper: wrapperCallBack(wrapperCallNoArgs, (res) => new Sk.builtin.int_(res)),\r\n    $textsig: \"($self, /)\",\r\n    $flags: {NoArgs: true},\r\n    $doc: \"Return self converted to an integer, if self is suitable for use as an index into a list.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$power\r\n * @implements __pow__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__pow__ = {\r\n    $name: \"__pow__\",\r\n    $slot_name: \"nb$power\",\r\n    $slot_func: function (dunderFunc) {\r\n        return function (value, mod) {\r\n            const func = dunderFunc.tp$descr_get ? dunderFunc.tp$descr_get(this) :  dunderFunc;\r\n            if (mod == undefined) {\r\n                return Sk.misceval.callsimArray(func, [value]);\r\n            } else {\r\n                return Sk.misceval.callsimArray(func, [value, mod]);\r\n            }\r\n        };\r\n    },\r\n    $wrapper: wrapperCallTernary,\r\n    $textsig: \"($self, value, mod=None, /)\",\r\n    $flags: {MinArgs: 1, MaxArgs: 2},\r\n    $doc: \"Return pow(self, value, mod).\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$reflected_power\r\n * @implements __rpow__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__rpow__ = {\r\n    $name: \"__rpow__\",\r\n    $slot_name: \"nb$reflected_power\",\r\n    $slot_func: slots.__pow__.$slot_func,\r\n    $wrapper: wrapperCallTernary,\r\n    $textsig: \"($self, value, mod=None, /)\",\r\n    $flags: {MinArgs: 1, MaxArgs: 2},\r\n    $doc: \"Return pow(value, self, mod).\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$inplace_power\r\n * @implements __ipow__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__ipow__ = {\r\n    $name: \"__ipow__\",\r\n    $slot_name: \"nb$inplace_power\",\r\n    $slot_func: slots.__pow__.$slot_func,\r\n    $wrapper: wrapperCallTernary,\r\n    $textsig: \"($self, value, mod=None, /)\",\r\n    $flags: {MinArgs: 1, MaxArgs: 2},\r\n    $doc: \"Implement **=\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$matrix_multiply\r\n * @implements __matmul__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__matmul__ = {\r\n    $name: \"__matmul__\",\r\n    $slot_name: \"nb$matrix_multiply\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return self@value.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$reflected_matrix_multiply\r\n * @implements __rmatmul__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__rmatmul__ = {\r\n    $name: \"__rmatmul__\",\r\n    $slot_name: \"nb$reflected_matrix_multiply\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Return value@self.\",\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @method nb$inplace_matrix_multiply\r\n * @implements __imatmul__\r\n * @suppress {checkTypes}\r\n */\r\nslots.__imatmul__ = {\r\n    $name: \"__imatmul__\",\r\n    $slot_name: \"nb$inplace_matrix_multiply\",\r\n    $slot_func: slotFuncOneArg,\r\n    $wrapper: wrapperCallOneArg,\r\n    $textsig: \"($self, value, /)\",\r\n    $flags: {OneArg: true},\r\n    $doc: \"Implement self@=value.\",\r\n};\r\n\r\n// py2 ONLY slots\r\nslots.__long__ = {\r\n    $name: \"__long__\",\r\n    $slot_name: \"nb$long\",\r\n    $slot_func: slotFuncNoArgsWithCheck(\"__long__\", Sk.builtin.checkInt, \"int\"),\r\n    $wrapper: wrapperCallNoArgs,\r\n    $textsig: \"($self, /)\",\r\n    $flags: {NoArgs: true},\r\n    $doc: \"int(self)\",\r\n};\r\n\r\nvar py3$slots;\r\nvar py2$slots = {\r\n    next: {\r\n        $name: \"next\",\r\n        $slot_name: \"tp$iternext\",\r\n        $slot_func: slots.__next__.$slot_func,\r\n        $wrapper: slots.__next__.$wrapper,\r\n        $textsig: slots.__next__.$textsig,\r\n        $flags: slots.__next__.$flags,\r\n    },\r\n    __nonzero__: {\r\n        $name: \"__nonzero__\",\r\n        $slot_name: \"nb$bool\",\r\n        $slot_func: slotFuncNoArgsWithCheck(\"__nonzero__\", Sk.builtin.checkInt, \"int\", (res) => res.v !== 0),\r\n        $wrapper: wrapperCallBack(wrapperCallNoArgs, (res) => new Sk.builtin.bool(res)),\r\n        $textsig: \"($self, /)\",\r\n        $flags: {NoArgs: true},\r\n        $doc: \"x.__nonzero__() <==> x != 0\",\r\n    },\r\n    __div__: {\r\n        $name: \"__div__\",\r\n        $slot_name: \"nb$divide\",\r\n        $slot_func: slotFuncOneArg,\r\n        $wrapper: wrapperCallOneArg,\r\n        $textsig: \"($self, other/)\",\r\n        $flags: {OneArg: true},\r\n        $doc: \"x.__div__(y) <==> x/y\",\r\n    },\r\n    __rdiv__: {\r\n        $name: \"__rdiv__\",\r\n        $slot_name: \"nb$reflected_divide\",\r\n        $slot_func: slotFuncOneArg,\r\n        $wrapper: wrapperCallOneArg,\r\n        $textsig: \"($self, other/)\",\r\n        $flags: {OneArg: true},\r\n        $doc: \"x.__rdiv__(y) <==> x/y\",\r\n    },\r\n    __idiv__: {\r\n        $name: \"__idiv__\",\r\n        $slot_name: \"nb$inplace_divide\",\r\n        $slot_func: slotFuncOneArg,\r\n        $wrapper: wrapperCallOneArg,\r\n        $textsig: \"($self, other/)\",\r\n        $flags: {OneArg: true},\r\n        $doc: \"implement self /= other\",\r\n    },\r\n};\r\n/**\r\n * @memberof Sk.slots\r\n * @member subSlots\r\n * @description\r\n * See the source code for a full list of slots split into apprpriate categories\r\n */\r\nSk.subSlots = {\r\n    main_slots: Object.entries({\r\n        // nb we handle tp$new differently\r\n        // tp_slots\r\n        tp$init: \"__init__\",\r\n        tp$call: \"__call__\",\r\n        $r: \"__repr__\",\r\n        // tp$hash: \"__hash__\", // do tp$hash separately since it could be None\r\n        tp$str: \"__str__\",\r\n\r\n        // getattribute, setattr, delattr\r\n        tp$getattr: \"__getattribute__\",\r\n        tp$setattr: [\"__setattr__\", \"__delattr__\"],\r\n\r\n        // tp$richcompare\r\n        ob$eq: \"__eq__\",\r\n        ob$ne: \"__ne__\",\r\n        ob$lt: \"__lt__\",\r\n        ob$le: \"__le__\",\r\n        ob$gt: \"__gt__\",\r\n        ob$ge: \"__ge__\",\r\n\r\n        // getters and setters\r\n        tp$descr_get: \"__get__\",\r\n        tp$descr_set: [\"__set__\", \"__delete__\"],\r\n\r\n        // iter\r\n        tp$iter: \"__iter__\",\r\n        tp$iternext: \"__next__\",\r\n    }),\r\n\r\n    number_slots: Object.entries({\r\n        nb$abs: \"__abs__\",\r\n        nb$negative: \"__neg__\",\r\n        nb$positive: \"__pos__\",\r\n        nb$int: \"__int__\",\r\n        nb$long: \"__long__\",\r\n        nb$float: \"__float__\",\r\n        nb$add: \"__add__\",\r\n        nb$reflected_add: \"__radd__\",\r\n        nb$inplace_add: \"__iadd__\",\r\n        nb$subtract: \"__sub__\",\r\n        nb$reflected_subtract: \"__rsub__\",\r\n        nb$inplace_subtract: \"__isub__\",\r\n        nb$multiply: \"__mul__\",\r\n        nb$reflected_multiply: \"__rmul__\",\r\n        nb$inplace_multiply: \"__imul__\",\r\n        nb$floor_divide: \"__floordiv__\",\r\n        nb$reflected_floor_divide: \"__rfloordiv__\",\r\n        nb$inplace_floor_divide: \"__ifloordiv__\",\r\n        nb$invert: \"__invert__\",\r\n        nb$remainder: \"__mod__\",\r\n        nb$reflected_remainder: \"__rmod__\",\r\n        nb$inplace_remainder: \"__imod__\",\r\n        nb$divmod: \"__divmod__\",\r\n        nb$reflected_divmod: \"__rdivmod__\",\r\n        nb$power: \"__pow__\",\r\n        nb$reflected_power: \"__rpow__\",\r\n        nb$inplace_power: \"__ipow__\",\r\n        nb$divide: \"__truediv__\", // TODO: think about py2 vs py3 truediv vs div\r\n        nb$reflected_divide: \"__rtruediv__\",\r\n        nb$inplace_divide: \"__itruediv__\",\r\n\r\n        nb$bool: \"__bool__\",\r\n\r\n        nb$and: \"__and__\",\r\n        nb$reflected_and: \"__rand__\",\r\n        nb$inplace_and: \"__iand__\",\r\n        nb$or: \"__or__\",\r\n        nb$reflected_or: \"__ror__\",\r\n        nb$inplace_or: \"__ior__\",\r\n        nb$xor: \"__xor__\",\r\n        nb$reflected_xor: \"__rxor__\",\r\n        nb$inplace_xor: \"__ixor__\",\r\n\r\n        nb$lshift: \"__lshift__\",\r\n        nb$reflected_lshift: \"__rlshift__\",\r\n        nb$rshift: \"__rshift__\",\r\n        nb$reflected_rshift: \"__rrshift__\",\r\n        nb$inplace_lshift: \"__ilshift__\",\r\n        nb$inplace_rshift: \"__irshift__\",\r\n\r\n        nb$matrix_multiply: \"__matmul__\",\r\n        nb$reflected_matrix_multiply: \"__rmatmul__\",\r\n        nb$inplace_matrix_multiply: \"__imatmul__\",\r\n    }),\r\n\r\n    sequence_and_mapping_slots: Object.entries({\r\n        // sequence and mapping slots\r\n        sq$length: \"__len__\",\r\n        sq$contains: \"__contains__\",\r\n        mp$subscript: \"__getitem__\",\r\n        mp$ass_subscript: [\"__setitem__\", \"__delitem__\"],\r\n        nb$add: \"__add__\",\r\n        nb$multiply: \"__mul__\",\r\n        nb$reflected_multiply: \"__rmul__\",\r\n        nb$inplace_add: \"__iadd__\",\r\n        nb$inplace_multiply: \"__imul__\",\r\n    }),\r\n};\r\n\r\nSk.reflectedNumberSlots = {\r\n    nb$add: {reflected: \"nb$reflected_add\"},\r\n    nb$subtract: {\r\n        reflected: \"nb$reflected_subtract\",\r\n        slot: function (other) {\r\n            if (other instanceof this.constructor) {\r\n                return other.nb$subtract(this);\r\n            }\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        },\r\n    },\r\n    nb$multiply: {reflected: \"nb$reflected_multiply\"},\r\n    nb$divide: {\r\n        reflected: \"nb$reflected_divide\",\r\n        slot: function (other) {\r\n            if (other instanceof this.constructor) {\r\n                return other.nb$divide(this);\r\n            }\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        },\r\n    },\r\n    nb$floor_divide: {\r\n        reflected: \"nb$reflected_floor_divide\",\r\n        slot: function (other) {\r\n            if (other instanceof this.constructor) {\r\n                return other.nb$floor_divide(this);\r\n            }\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        },\r\n    },\r\n    nb$remainder: {\r\n        reflected: \"nb$reflected_remainder\",\r\n        slot: function (other) {\r\n            if (other instanceof this.constructor) {\r\n                return other.nb$remainder(this);\r\n            }\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        },\r\n    },\r\n    nb$divmod: {\r\n        reflected: \"nb$reflected_divmod\",\r\n        slot: function (other) {\r\n            if (other instanceof this.constructor) {\r\n                return other.nb$divmod(this);\r\n            }\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        },\r\n    },\r\n    nb$power: {\r\n        reflected: \"nb$reflected_power\",\r\n        slot: function (other, mod) {\r\n            if (other instanceof this.constructor) {\r\n                return other.nb$power(this, mod);\r\n            }\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        },\r\n    },\r\n    nb$and: {reflected: \"nb$reflected_and\"},\r\n    nb$or: {reflected: \"nb$reflected_or\"},\r\n    nb$xor: {reflected: \"nb$reflected_xor\"},\r\n    nb$lshift: {\r\n        reflected: \"nb$reflected_lshift\",\r\n        slot: function (other) {\r\n            if (other instanceof this.constructor) {\r\n                return other.nb$lshift(this);\r\n            }\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        },\r\n    },\r\n    nb$rshift: {\r\n        reflected: \"nb$reflected_rshift\",\r\n        slot: function (other) {\r\n            if (other instanceof this.constructor) {\r\n                return other.nb$rshift(this);\r\n            }\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        },\r\n    },\r\n    nb$matrix_multiply: {\r\n        reflected: \"nb$reflexted_matrix_multiply\",\r\n        slot: function (other) {\r\n            if (other instanceof this.constructor) {\r\n                return other.nb$matrix_multiply(this);\r\n            }\r\n            return Sk.builtin.NotImplemented.NotImplemented$;\r\n        },\r\n    },\r\n};\r\n\r\nSk.sequenceAndMappingSlots = {\r\n    sq$concat: [\"nb$add\"],\r\n    sq$repeat: [\"nb$multiply\", \"nb$reflected_multiply\"],\r\n    mp$length: [\"sq$length\"],\r\n    sq$inplace_repeat: [\"nb$inplace_multiply\"],\r\n    sq$inplace_concat: [\"nb$inplace_add\"],\r\n};\r\n\r\n/**\r\n *\r\n *\r\n * @member Sk.dunderToSkulpt\r\n *\r\n * Maps Python dunder names to the Skulpt Javascript function names that\r\n * implement them.\r\n *\r\n * Note: __add__, __mul__, and __rmul__ can be used for either numeric or\r\n * sequence types. Here, they default to the numeric versions (i.e. nb$add,\r\n * nb$multiply, and nb$reflected_multiply). This works because Sk.abstr.numberBinOp\r\n * checks for the numeric shortcuts and not the sequence shortcuts when computing\r\n * a binary operation.\r\n *\r\n * Because many of these functions are used in contexts in which Skulpt does not\r\n * [yet] handle suspensions, the assumption is that they must not suspend. However,\r\n * some of these built-in functions are acquiring \"canSuspend\" arguments to signal\r\n * where this is not the case. These need to be spliced out of the argument list before\r\n * it is passed to python. Array values in this map contain [dunderName, argumentIdx],\r\n * where argumentIdx specifies the index of the \"canSuspend\" boolean argument.\r\n *\r\n * @description\r\n * A mapping of dunder names to skulpt slots\r\n *\r\n * @type {Object}\r\n */\r\nSk.dunderToSkulpt = {\r\n    __repr__: \"$r\",\r\n    __str__: \"tp$str\",\r\n    __init__: \"tp$init\",\r\n    __new__: \"tp$new\",\r\n    __hash__: \"tp$hash\",\r\n    __call__: \"tp$call\",\r\n    __iter__: \"tp$iter\",\r\n    __next__: \"tp$iternext\",\r\n\r\n    __eq__: \"ob$eq\",\r\n    __ne__: \"ob$ne\",\r\n    __lt__: \"ob$lt\",\r\n    __le__: \"ob$le\",\r\n    __gt__: \"ob$gt\",\r\n    __ge__: \"ob$ge\",\r\n\r\n    __abs__: \"nb$abs\",\r\n    __neg__: \"nb$negative\",\r\n    __pos__: \"nb$positive\",\r\n    __int__: \"nb$int\",\r\n    __float__: \"nb$float\",\r\n\r\n    __add__: \"nb$add\",\r\n    __radd__: \"nb$reflected_add\",\r\n    __iadd__: \"nb$inplace_add\",\r\n    __sub__: \"nb$subtract\",\r\n    __rsub__: \"nb$reflected_subtract\",\r\n    __isub__: \"nb$inplace_subtract\",\r\n    __mul__: \"nb$multiply\",\r\n    __rmul__: \"nb$reflected_multiply\",\r\n    __imul__: \"nb$inplace_multiply\",\r\n    __truediv__: \"nb$divide\",\r\n    __rtruediv__: \"nb$reflected_divide\",\r\n    __itruediv__: \"nb$inplace_divide\",\r\n    __floordiv__: \"nb$floor_divide\",\r\n    __rfloordiv__: \"nb$reflected_floor_divide\",\r\n    __ifloordiv__: \"nb$inplace_floor_divide\",\r\n    __invert__: \"nb$invert\",\r\n    __mod__: \"nb$remainder\",\r\n    __rmod__: \"nb$reflected_remainder\",\r\n    __imod__: \"nb$inplace_remainder\",\r\n    __divmod__: \"nb$divmod\",\r\n    __rdivmod__: \"nb$reflected_divmod\", //no inplace divmod\r\n    __pow__: \"nb$power\",\r\n    __rpow__: \"nb$reflected_power\",\r\n    __ipow__: \"nb$inplace_power\",\r\n\r\n    __bool__: \"nb$bool\",\r\n    // py2 only\r\n    __long__: \"nb$long\",\r\n\r\n    __lshift__: \"nb$lshift\",\r\n    __rlshift__: \"nb$reflected_lshift\",\r\n    __ilshift__: \"nb$inplace_lshift\",\r\n    __rshift__: \"nb$rshift\",\r\n    __rrshift__: \"nb$reflected_rshift\",\r\n    __irshift__: \"nb$inplace_rshift\",\r\n\r\n    __and__: \"nb$and\",\r\n    __rand__: \"nb$reflected_and\",\r\n    __iand__: \"nb$inplace_and\",\r\n    __or__: \"nb$or\",\r\n    __ror__: \"nb$reflected_or\",\r\n    __ior__: \"nb$inplace_or\",\r\n    __xor__: \"nb$xor\",\r\n    __rxor__: \"nb$reflected_xor\",\r\n    __ixor__: \"nb$inplace_xor\",\r\n\r\n    __matmul__: \"nb$matrix_multiply\",\r\n    __rmatmul__: \"nb$reflected_matrix_multiply\",\r\n    __imatmul__: \"nb$inplace_matrix_multiply\",\r\n\r\n    __get__: \"tp$descr_get\",\r\n    __set__: \"tp$descr_set\",\r\n    __delete__: \"tp$descr_set\",\r\n\r\n    __getattribute__: \"tp$getattr\",\r\n    __getattr__: \"tp$getattr\",\r\n    __setattr__: \"tp$setattr\",\r\n    __delattr__: \"tp$setattr\",\r\n\r\n    __len__: \"sq$length\",\r\n    __contains__: \"sq$contains\",\r\n    __getitem__: \"mp$subscript\",\r\n    __setitem__: \"mp$ass_subscript\",\r\n    __delitem__: \"mp$ass_subscript\",\r\n};\r\n\r\nSk.exportSymbol(\"Sk.setupDunderMethods\", Sk.setupDunderMethods);\r\n\r\nSk.setupDunderMethods = function (py3) {\r\n    const slots = Sk.slots;\r\n    if (py3 && py3$slots === undefined) {\r\n        // assume python3 switch version if we have to\r\n        return;\r\n    }\r\n    const classes_with_next = Sk.abstr.built$iterators;\r\n    const classes_with_bool = [Sk.builtin.int_, Sk.builtin.lng, Sk.builtin.float_, Sk.builtin.complex];\r\n    const classes_with_divide = classes_with_bool;\r\n    const number_slots = Sk.subSlots.number_slots;\r\n    const main_slots = Sk.subSlots.main_slots;\r\n    const indexofnext = main_slots.findIndex((x) => x[0] === \"tp$iternext\");\r\n    const indexofbool = number_slots.findIndex((x) => x[0] === \"nb$bool\");\r\n    const dunderToSkulpt = Sk.dunderToSkulpt;\r\n\r\n    function switch_version(classes_with, old_meth, new_meth) {\r\n        for (let i = 0; i < classes_with.length; i++) {\r\n            const cls_proto = classes_with[i].prototype;\r\n            if (cls_proto.hasOwnProperty(new_meth)) {\r\n                continue;\r\n            }\r\n            cls_proto[new_meth] = cls_proto[old_meth];\r\n            delete cls_proto[old_meth];\r\n        }\r\n    }\r\n\r\n    if (py3) {\r\n        dunderToSkulpt.__bool__ = \"nb$bool\";\r\n        dunderToSkulpt.__next__ = \"tp$iternext\";\r\n\r\n        delete dunderToSkulpt.__nonzero__;\r\n        delete dunderToSkulpt.__div__;\r\n        delete dunderToSkulpt.__rdiv__;\r\n        delete dunderToSkulpt.__idiv__;\r\n        delete dunderToSkulpt.next;\r\n\r\n        for (let slot_name in py3$slots) {\r\n            slots[slot_name] = py3$slots[slot_name];\r\n        }\r\n        for (let slot_name in py2$slots) {\r\n            delete slots[slot_name];\r\n        }\r\n        for (let i = 0; i < classes_with_divide.length; i++) {\r\n            const cls_proto = classes_with_divide[i].prototype;\r\n            delete cls_proto.__div__;\r\n            delete cls_proto.__rdiv__;\r\n        }\r\n\r\n        main_slots[indexofnext][1] = \"__next__\";\r\n        number_slots[indexofbool][1] = \"__bool__\";\r\n        switch_version(classes_with_next, \"next\", \"__next__\");\r\n        switch_version(classes_with_bool, \"__bool__\", \"__nonzero__\");\r\n    } else {\r\n        if (py3$slots === undefined) {\r\n            slots.py3$slots = {\r\n                __next__: slots.__next__,\r\n            };\r\n            py3$slots = slots.py3$slots;\r\n        }\r\n        dunderToSkulpt.next = \"tp$iternext\";\r\n        dunderToSkulpt.__nonzero__ = \"nb$bool\";\r\n        dunderToSkulpt.__div__ = \"nb$divide\";\r\n        dunderToSkulpt.__rdiv__ = \"nb$reflected_divide\";\r\n        dunderToSkulpt.__idiv__ = \"nb$inplace_divide\";\r\n        delete dunderToSkulpt.__bool__;\r\n        delete dunderToSkulpt.__next__;\r\n\r\n        for (let slot_name in py2$slots) {\r\n            slots[slot_name] = py2$slots[slot_name];\r\n        }\r\n        for (let slot_name in py3$slots) {\r\n            delete slots[slot_name];\r\n        }\r\n\r\n        main_slots[indexofnext][1] = \"next\";\r\n        number_slots[indexofbool][1] = \"__nonzero__\";\r\n        switch_version(classes_with_next, \"__next__\", \"next\");\r\n        switch_version(classes_with_bool, \"__nonzero__\", \"__bool__\");\r\n\r\n        for (let i = 0; i < classes_with_divide.length; i++) {\r\n            const cls = classes_with_divide[i];\r\n            const cls_proto = cls.prototype;\r\n            if (cls_proto.hasOwnProperty(\"__div__\")) {\r\n                continue;\r\n            }\r\n            cls_proto.__div__ = new Sk.builtin.wrapper_descriptor(cls, py2$slots.__div__, cls_proto.nb$divide);\r\n            cls_proto.__rdiv__ = new Sk.builtin.wrapper_descriptor(cls, py2$slots.__rdiv__, Sk.reflectedNumberSlots.nb$divide.slot);\r\n        }\r\n    }\r\n};\r\n","var keyhash_regex = /^[0-9!#_]/;\r\nvar interned = Object.create(null); // avoid name conflicts with Object.prototype\r\n\r\nfunction getInterned(x) {\r\n    return interned[x];\r\n}\r\n\r\nfunction setInterned(x, pyStr) {\r\n    interned[x] = pyStr;\r\n}\r\n\r\n/**\r\n * @constructor\r\n * @param {*} x\r\n * @extends Sk.builtin.object\r\n */\r\nSk.builtin.str = Sk.abstr.buildNativeClass(\"str\", {\r\n    constructor: function str(x) {\r\n    // new Sk.builtin.str is an internal function called with a JS value x\r\n    // occasionally called with a python object and returns tp$str() or $r();\r\n    Sk.asserts.assert(this instanceof Sk.builtin.str, \"bad call to str - use 'new'\");\r\n    let ret;\r\n    if (typeof x === \"string\") {\r\n        ret = x;\r\n    } else if (x === undefined) {\r\n        ret = \"\";\r\n    } else if (x === null) {\r\n        ret = \"None\";\r\n    } else if (x.tp$str !== undefined) {\r\n        // then we're a python object - all objects inherit from object which has tp$str\r\n        return x.tp$str();\r\n    } else if (typeof x === \"number\") {\r\n            ret = Number.isFinite(x) ? String(x) : String(x).replace(\"Infinity\", \"inf\").replace(\"NaN\", \"nan\");\r\n    } else {\r\n        throw new Sk.builtin.TypeError(\"could not convert object of type '\" + Sk.abstr.typeName(x) + \"' to str\");\r\n    }\r\n\r\n    const interned = getInterned(ret);\r\n    // interning required for strings in py\r\n    if (interned !== undefined) {\r\n        return interned;\r\n    } else {\r\n        setInterned(ret, this);\r\n    }\r\n\r\n    this.$mangled = fixReserved(ret);\r\n        // used by dict key hash function $savedKeyHash\r\n        this.$savedKeyHash = ret.replace(keyhash_regex, \"!$&\");\r\n    this.v = ret;\r\n    },\r\n    slots: /**@lends {Sk.builtin.str.prototype} */ {\r\n        tp$getattr: Sk.generic.getAttr,\r\n        tp$as_sequence_or_mapping: true,\r\n        tp$doc:\r\n            \"str(object='') -> str\\nstr(bytes_or_buffer[, encoding[, errors]]) -> str\\n\\nCreate a new string object from the given object. If encoding or\\nerrors is specified, then the object must expose a data buffer\\nthat will be decoded using the given encoding and error handler.\\nOtherwise, returns the result of object.__str__() (if defined)\\nor repr(object).\\nencoding defaults to sys.getdefaultencoding().\\nerrors defaults to 'strict'.\",\r\n        tp$new(args, kwargs) {\r\n            kwargs = kwargs || [];\r\n    if (this !== Sk.builtin.str.prototype) {\r\n        return this.$subtype_new(args, kwargs);\r\n    }\r\n            if (args.length <= 1 && !kwargs.length) {\r\n                return new Sk.builtin.str(args[0]);\r\n            } else if (!Sk.__future__.python3) {\r\n                throw new Sk.builtin.TypeError(\"str takes at most one argument (\" + (args.length + kwargs.length) + \" given)\");\r\n    } else {\r\n                const [x, encoding, errors] = Sk.abstr.copyKeywordsToNamedArgs(\"str\", [\"object\", \"encoding\", \"errors\"], args, kwargs);\r\n                if (x === undefined || (encoding === undefined && errors === undefined)) {\r\n                    return new Sk.builtin.str(x);\r\n    }\r\n                // check the types of encoding and errors\r\n                Sk.builtin.bytes.check$encodeArgs(\"str\", encoding, errors);\r\n                if (!Sk.builtin.checkBytes(x)) {\r\n                    throw new Sk.builtin.TypeError(\"decoding to str: need a bytes-like object, \" + Sk.abstr.typeName(x) + \" found\");\r\n    }\r\n                return Sk.builtin.bytes.$decode.call(x, encoding, errors);\r\n    }\r\n        },\r\n        $r() {\r\n    // single is preferred\r\n            let quote = \"'\";\r\n    if (this.v.indexOf(\"'\") !== -1 && this.v.indexOf('\"') === -1) {\r\n        quote = '\"';\r\n    }\r\n    //jshint ignore:end\r\n            const len = this.v.length;\r\n            let c,\r\n                cc,\r\n    ret = quote;\r\n            for (let i = 0; i < len; i++) {\r\n        c = this.v.charAt(i);\r\n                cc = this.v.charCodeAt(i);\r\n        if (c === quote || c === \"\\\\\") {\r\n            ret += \"\\\\\" + c;\r\n        } else if (c === \"\\t\") {\r\n            ret += \"\\\\t\";\r\n        } else if (c === \"\\n\") {\r\n            ret += \"\\\\n\";\r\n        } else if (c === \"\\r\") {\r\n            ret += \"\\\\r\";\r\n                } else if (((cc > 0xff && cc < 0xd800) || cc >= 0xe000) && !Sk.__future__.python3) {\r\n                    // BMP\r\n                    ret += \"\\\\u\" + (\"000\" + cc.toString(16)).slice(-4);\r\n                } else if (cc >= 0xd800 && !Sk.__future__.python3) {\r\n                    // Surrogate pair stuff\r\n                    let val = this.v.codePointAt(i);\r\n                    i++;\r\n\r\n                    val = val.toString(16);\r\n                    let s = \"0000000\" + val.toString(16);\r\n                    if (val.length > 4) {\r\n                        ret += \"\\\\U\" + s.slice(-8);\r\n                    } else {\r\n                        ret += \"\\\\u\" + s.slice(-4);\r\n                    }\r\n                } else if (cc > 0xff && !Sk.__future__.python3) {\r\n                    // Invalid!\r\n                    ret += \"\\\\ufffd\";\r\n                } else if (c < \" \" || (cc >= 0x7f && !Sk.__future__.python3)) {\r\n                    let ashex = c.charCodeAt(0).toString(16);\r\n            if (ashex.length < 2) {\r\n                ashex = \"0\" + ashex;\r\n            }\r\n            ret += \"\\\\x\" + ashex;\r\n        } else {\r\n            ret += c;\r\n        }\r\n    }\r\n    ret += quote;\r\n    return new Sk.builtin.str(ret);\r\n        },\r\n        tp$str() {\r\n    if (this.constructor === Sk.builtin.str) {\r\n        return this;\r\n    } else {\r\n        return new Sk.builtin.str(this.v);\r\n    }\r\n        },\r\n        tp$iter() {\r\n            return new str_iter_(this);\r\n        },\r\n        tp$richcompare(other, op) {\r\n            if (!(other instanceof Sk.builtin.str)) {\r\n                return Sk.builtin.NotImplemented.NotImplemented$;\r\n    }\r\n            switch (op) {\r\n                case \"Lt\":\r\n                    return this.v < other.v;\r\n                case \"LtE\":\r\n                    return this.v <= other.v;\r\n                case \"Eq\":\r\n                    return this.v === other.v;\r\n                case \"NotEq\":\r\n                    return this.v !== other.v;\r\n                case \"Gt\":\r\n                    return this.v > other.v;\r\n                case \"GtE\":\r\n                    return this.v >= other.v;\r\n    }\r\n        },\r\n        mp$subscript(index) {\r\n            let len;\r\n            if (Sk.misceval.isIndex(index)) {\r\n                index = Sk.misceval.asIndexSized(index, Sk.builtin.OverflowError);\r\n                len = this.sq$length();\r\n                if (index < 0) {\r\n                    index = index + len;\r\n        }\r\n                if (index < 0 || index >= len) {\r\n                    throw new Sk.builtin.IndexError(\"string index out of range\");\r\n    }\r\n                if (this.codepoints) {\r\n                    return new Sk.builtin.str(this.v.substring(this.codepoints[index], this.codepoints[index + 1]));\r\n                } else {\r\n                    return new Sk.builtin.str(this.v.charAt(index));\r\n    }\r\n            } else if (index instanceof Sk.builtin.slice) {\r\n                let ret = \"\";\r\n                len = this.sq$length();\r\n                if (this.codepoints) {\r\n                    index.sssiter$(len, (i) => {\r\n                        ret += this.v.substring(this.codepoints[i], this.codepoints[i + 1]);\r\n                    });\r\n                } else {\r\n                    index.sssiter$(len, (i) => {\r\n                        ret += this.v.charAt(i);\r\n                    });\r\n    }\r\n                return new Sk.builtin.str(ret);\r\n    }\r\n            throw new Sk.builtin.TypeError(\"string indices must be integers, not \" + Sk.abstr.typeName(index));\r\n        },\r\n        sq$length() {\r\n            return this.$hasAstralCodePoints() ? this.codepoints.length : this.v.length;\r\n        },\r\n        sq$concat(other) {\r\n            if (!(other instanceof Sk.builtin.str)) {\r\n                throw new Sk.builtin.TypeError(\"cannot concatenate 'str' and '\" + Sk.abstr.typeName(other) + \"' objects\");\r\n    }\r\n            return new Sk.builtin.str(this.v + other.v);\r\n        },\r\n        sq$repeat(n) {\r\n            if (!Sk.misceval.isIndex(n)) {\r\n                throw new Sk.builtin.TypeError(\"can't multiply sequence by non-int of type '\" + Sk.abstr.typeName(n) + \"'\");\r\n    }\r\n            n = Sk.misceval.asIndexSized(n, Sk.builtin.OverflowError);\r\n            if (n * this.v.length > Number.MAX_SAFE_INTEGER) {\r\n                throw new Sk.builtin.OverflowError();\r\n        }\r\n            let ret = \"\";\r\n            for (let i = 0; i < n; i++) {\r\n                ret += this.v;\r\n        }\r\n            return new Sk.builtin.str(ret);\r\n        },\r\n        sq$contains(ob) {\r\n            if (!(ob instanceof Sk.builtin.str)) {\r\n                throw new Sk.builtin.TypeError(\"'in <string>' requires string as left operand not \" + Sk.abstr.typeName(ob));\r\n    }\r\n            return this.v.indexOf(ob.v) !== -1;\r\n        },\r\n        tp$as_number: true,\r\n        nb$remainder: strBytesRemainder,\r\n    },\r\n    proto: /**@lends {Sk.builtin.str.prototype} */ {\r\n        toString() {\r\n            return this.v;\r\n        },\r\n        $subtype_new(args, kwargs) {\r\n            const instance = new this.constructor();\r\n            // we call str new method with all the args and kwargs\r\n            const str_instance = Sk.builtin.str.prototype.tp$new(args, kwargs);\r\n            instance.$mangled = str_instance.$mangled;\r\n            instance.$savedKeyHash = str_instance.$savedKeyHash ;\r\n            instance.v = str_instance.v;\r\n            return instance;\r\n        },\r\n        $jsstr() {\r\n            return this.v;\r\n        },\r\n        $hasAstralCodePoints() {\r\n            // If a string has astral code points, we have to work out where they are before\r\n            // we can do things like slicing, computing length, etc. We work this out when we need to.\r\n            if (this.codepoints === null) {\r\n                return false;\r\n            } else if (this.codepoints !== undefined) {\r\n                return true;\r\n    }\r\n            // Does this string contain astral code points? If so, we have to do things the slow way.\r\n            for (let i = 0; i < this.v.length; i++) {\r\n                let cc = this.v.charCodeAt(i);\r\n                if (cc >= 0xd800 && cc < 0xe000) {\r\n                    // Yep, it's a surrogate pair. Mark off the\r\n                    // indices of all the code points for O(1) seeking later\r\n                    this.codepoints = [];\r\n                    for (let j = 0; j < this.v.length; j++) {\r\n                        this.codepoints.push(j);\r\n                        cc = this.v.charCodeAt(j);\r\n                        if (cc >= 0xd800 && cc < 0xdc00) {\r\n                            j++; // High surrogate. Skip next char\r\n        }\r\n    }\r\n                    return true;\r\n    }\r\n    }\r\n            this.codepoints = null;\r\n            return false;\r\n        },\r\n        sk$asarray() {\r\n            const ret = [];\r\n            if (this.$hasAstralCodePoints()) {\r\n                const codepoints = this.codepoints;\r\n                for (let i = 0; i < codepoints.length; i++) {\r\n                    ret.push(new Sk.builtin.str(this.v.substring(codepoints[i], codepoints[i + 1])));\r\n    }\r\n    } else {\r\n                for (let i = 0; i < this.v.length; i++) {\r\n                    ret.push(new Sk.builtin.str(this.v[i]));\r\n    }\r\n    }\r\n            return ret;\r\n        },\r\n        find$left: mkFind(false),\r\n        find$right: mkFind(true),\r\n        get$tgt(tgt) {\r\n            if (tgt instanceof Sk.builtin.str) {\r\n                return tgt.v;\r\n    }\r\n            throw new Sk.builtin.TypeError(\"a str instance is required not '\" + Sk.abstr.typeName(tgt) + \"'\");\r\n        },\r\n        $isIdentifier() {\r\n            return Sk.token.isIdentifier(this.v);\r\n        },\r\n    },\r\n    methods: /**@lends {Sk.builtin.str.prototype} */ {\r\n        encode: {\r\n            $meth: function encode(encoding, errors) {\r\n                ({ encoding, errors } = Sk.builtin.bytes.check$encodeArgs(\"encode\", encoding, errors));\r\n                const pyBytes = Sk.builtin.bytes.str$encode(this, encoding, errors);\r\n                return Sk.__future__.python3 ? pyBytes : new Sk.builtin.str(pyBytes.$jsstr());\r\n            },\r\n            $flags: { NamedArgs: [\"encoding\", \"errors\"] },\r\n            $textsig: \"($self, /, encoding='utf-8', errors='strict')\",\r\n            $doc:\r\n                \"Encode the string using the codec registered for encoding.\\n\\n  encoding\\n    The encoding in which to encode the string.\\n  errors\\n    The error handling scheme to use for encoding errors.\\n    The default is 'strict' meaning that encoding errors raise a\\n    UnicodeEncodeError.  Other possible values are 'ignore', 'replace' and\\n    'xmlcharrefreplace' as well as any other name registered with\\n    codecs.register_error that can handle UnicodeEncodeErrors.\",\r\n        },\r\n        replace: {\r\n            $meth(oldS, newS, count) {\r\n                oldS = this.get$tgt(oldS);\r\n                newS = this.get$tgt(newS);\r\n                count = count === undefined ? -1 : Sk.misceval.asIndexSized(count, Sk.builtin.OverflowError);\r\n                const patt = new RegExp(re_escape_(oldS), \"g\");\r\n                if (count < 0) {\r\n                    return new Sk.builtin.str(this.v.replace(patt, newS));\r\n    }\r\n                let c = 0;\r\n                const ret = this.v.replace(patt, (match) => (c++ < count ? newS : match));\r\n                return new Sk.builtin.str(ret);\r\n            },\r\n            $flags: { MinArgs: 2, MaxArgs: 3 },\r\n            $textsig: \"($self, old, new, count=-1, /)\",\r\n            $doc:\r\n                \"Return a copy with all occurrences of substring old replaced by new.\\n\\n  count\\n    Maximum number of occurrences to replace.\\n    -1 (the default value) means replace all occurrences.\\n\\nIf the optional argument count is given, only the first count occurrences are\\nreplaced.\",\r\n        },\r\n        split: {\r\n            $meth: function split(sep, maxsplit) {\r\n                maxsplit = Sk.misceval.asIndexSized(maxsplit, Sk.builtin.OverflowError);\r\n                const codepoints = splitPoints(this, sep, maxsplit);\r\n                const ret = [];\r\n                for (let i = 0; i < codepoints.length; i++) {\r\n                    ret.push(new Sk.builtin.str(this.v.substring(codepoints[i], codepoints[++i])));\r\n    }\r\n                return new Sk.builtin.list(ret);\r\n            },\r\n            $flags: { NamedArgs: [\"sep\", \"maxsplit\"], Defaults: [Sk.builtin.none.none$, -1] },\r\n            $textsig: \"($self, /, sep=None, maxsplit=-1)\",\r\n            $doc:\r\n                \"Return a list of the words in the string, using sep as the delimiter string.\\n\\n  sep\\n    The delimiter according which to split the string.\\n    None (the default value) means split according to any whitespace,\\n    and discard empty strings from the result.\\n  maxsplit\\n    Maximum number of splits to do.\\n    -1 (the default value) means no limit.\",\r\n        },\r\n        rsplit: {\r\n            $meth: function rsplit(sep, maxsplit) {\r\n                // do a full split and then slice the string accordingly;\r\n                maxsplit = Sk.misceval.asIndexSized(maxsplit, Sk.builtin.OverflowError);\r\n                const codepoints = splitPoints(this, sep, -1);\r\n                let from = maxsplit < 0 ? 0 : (codepoints.length / 2 - maxsplit) * 2;\r\n                const ret = [];\r\n                if (from <= 0) {\r\n                    from = 0;\r\n                } else {\r\n                    ret.push(new Sk.builtin.str(this.v.slice(0, codepoints[from - 1])));\r\n    }\r\n                for (let i = from; i < codepoints.length; i++) {\r\n                    ret.push(new Sk.builtin.str(this.v.substring(codepoints[i], codepoints[++i])));\r\n    }\r\n                return new Sk.builtin.list(ret);\r\n            },\r\n            $flags: { NamedArgs: [\"sep\", \"maxsplit\"], Defaults: [Sk.builtin.none.none$, -1] },\r\n            $textsig: \"($self, /, sep=None, maxsplit=-1)\",\r\n            $doc:\r\n                \"Return a list of the words in the string, using sep as the delimiter string.\\n\\n  sep\\n    The delimiter according which to split the string.\\n    None (the default value) means split according to any whitespace,\\n    and discard empty strings from the result.\\n  maxsplit\\n    Maximum number of splits to do.\\n    -1 (the default value) means no limit.\\n\\nSplits are done starting at the end of the string and working to the front.\",\r\n        },\r\n        join: {\r\n            $meth(seq) {\r\n                const arrOfStrs = [];\r\n                return Sk.misceval.chain(\r\n                    Sk.misceval.iterFor(Sk.abstr.iter(seq), (i) => {\r\n                        if (!(i instanceof Sk.builtin.str)) {\r\n                            throw new Sk.builtin.TypeError(\r\n                                \"sequence item \" + arrOfStrs.length + \": expected str, \" + Sk.abstr.typeName(i) + \" found\"\r\n                            );\r\n    }\r\n                        arrOfStrs.push(i.v);\r\n                    }),\r\n                    () => new Sk.builtin.str(arrOfStrs.join(this.v))\r\n                );\r\n            },\r\n            $flags: { OneArg: true },\r\n            $textsig: \"($self, iterable, /)\",\r\n            $doc:\r\n                \"Concatenate any number of strings.\\n\\nThe string whose method is called is inserted in between each given string.\\nThe result is returned as a new string.\\n\\nExample: '.'.join(['ab', 'pq', 'rs']) -> 'ab.pq.rs'\",\r\n        },\r\n        capitalize: {\r\n            $meth: function capitalize() {\r\n                return new Sk.builtin.str(this.v.charAt(0).toUpperCase() + this.v.slice(1).toLowerCase());\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: \"($self, /)\",\r\n            $doc:\r\n                \"Return a capitalized version of the string.\\n\\nMore specifically, make the first character have upper case and the rest lower\\ncase.\",\r\n        },\r\n        // casefold: {\r\n        //     $meth: methods.casefold,\r\n        //     $flags: { NoArgs: true },\r\n        //     $textsig: \"($self, /)\",\r\n        //     $doc: \"Return a version of the string suitable for caseless comparisons.\",\r\n        // },\r\n        title: {\r\n            $meth: function title() {\r\n                const ret = this.v.replace(/[a-z][a-z]*/gi, (str) => str[0].toUpperCase() + str.substr(1).toLowerCase());\r\n                return new Sk.builtin.str(ret);\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: \"($self, /)\",\r\n            $doc:\r\n                \"Return a version of the string where each word is titlecased.\\n\\nMore specifically, words start with uppercased characters and all remaining\\ncased characters have lower case.\",\r\n        },\r\n        center: {\r\n            $meth: mkJust(false, true),\r\n            $flags: { MinArgs: 1, MaxArgs: 2 },\r\n            $textsig: \"($self, width, fillchar=' ', /)\",\r\n            $doc: \"Return a centered string of length width.\\n\\nPadding is done using the specified fill character (default is a space).\",\r\n        },\r\n        count: {\r\n            $meth: function count(pat, start, end) {\r\n                pat = this.get$tgt(pat);\r\n                ({ start, end } = indices(this, start, end));\r\n                if (end < start) {\r\n                    return new Sk.builtin.int_(0);\r\n    }\r\n                const normaltext = pat.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, \"\\\\$&\");\r\n                const m = new RegExp(normaltext, \"g\");\r\n                const slice = this.v.slice(start, end);\r\n                const ctl = slice.match(m);\r\n    if (!ctl) {\r\n        return new Sk.builtin.int_(0);\r\n    } else {\r\n        return new Sk.builtin.int_(ctl.length);\r\n    }\r\n            },\r\n            $flags: { MinArgs: 1, MaxArgs: 3 },\r\n            $textsig: null,\r\n            $doc:\r\n                \"S.count(sub[, start[, end]]) -> int\\n\\nReturn the number of non-overlapping occurrences of substring sub in\\nstring S[start:end].  Optional arguments start and end are\\ninterpreted as in slice notation.\",\r\n        },\r\n        expandtabs: {\r\n            $meth: function expandtabs(tabsize) {\r\n                if (Sk.builtin.checkInt(tabsize)) {\r\n                    tabsize = Sk.builtin.asnum$(tabsize);\r\n    } else {\r\n                    throw new Sk.builtin.TypeError(\"an integer is required, got type\" + Sk.abstr.typeName(tabsize));\r\n    }\r\n                const spaces = new Array(tabsize + 1).join(\" \");\r\n                const expanded = this.v.replace(/([^\\r\\n\\t]*)\\t/g, (a, b) => b + spaces.slice(b.length % tabsize));\r\n                return new Sk.builtin.str(expanded);\r\n            },\r\n            $flags: { NamedArgs: [\"tabsize\"], Defaults: [8] },\r\n            $textsig: \"($self, /, tabsize=8)\",\r\n            $doc:\r\n                \"Return a copy where all tab characters are expanded using spaces.\\n\\nIf tabsize is not given, a tab size of 8 characters is assumed.\",\r\n        },\r\n        find: {\r\n            $meth: function find(tgt, start, end) {\r\n                return new Sk.builtin.int_(this.find$left(tgt, start, end));\r\n            },\r\n            $flags: { MinArgs: 1, MaxArgs: 3 },\r\n            $textsig: null,\r\n            $doc:\r\n                \"S.find(sub[, start[, end]]) -> int\\n\\nReturn the lowest index in S where substring sub is found,\\nsuch that sub is contained within S[start:end].  Optional\\narguments start and end are interpreted as in slice notation.\\n\\nReturn -1 on failure.\",\r\n        },\r\n        partition: {\r\n            $meth: mkPartition(false),\r\n            $flags: { OneArg: true },\r\n            $textsig: \"($self, sep, /)\",\r\n            $doc:\r\n                \"Partition the string into three parts using the given separator.\\n\\nThis will search for the separator in the string.  If the separator is found,\\nreturns a 3-tuple containing the part before the separator, the separator\\nitself, and the part after it.\\n\\nIf the separator is not found, returns a 3-tuple containing the original string\\nand two empty strings.\",\r\n        },\r\n        index: {\r\n            $meth: function index(tgt, start, end) {\r\n                const val = this.find$left(tgt, start, end);\r\n                if (val === -1) {\r\n                    throw new Sk.builtin.ValueError(\"substring not found\");\r\n    } else {\r\n                    return new Sk.builtin.int_(val);\r\n    }\r\n            },\r\n            $flags: { MinArgs: 1, MaxArgs: 3 },\r\n            $textsig: null,\r\n            $doc:\r\n                \"S.index(sub[, start[, end]]) -> int\\n\\nReturn the lowest index in S where substring sub is found, \\nsuch that sub is contained within S[start:end].  Optional\\narguments start and end are interpreted as in slice notation.\\n\\nRaises ValueError when the substring is not found.\",\r\n        },\r\n        ljust: {\r\n            $meth: mkJust(false, false),\r\n            $flags: { MinArgs: 1, MaxArgs: 2 },\r\n            $textsig: \"($self, width, fillchar=' ', /)\",\r\n            $doc: \"Return a left-justified string of length width.\\n\\nPadding is done using the specified fill character (default is a space).\",\r\n        },\r\n        lower: {\r\n            $meth() {\r\n                return new Sk.builtin.str(this.v.toLowerCase());\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: \"($self, /)\",\r\n            $doc: \"Return a copy of the string converted to lowercase.\",\r\n        },\r\n        lstrip: {\r\n            $meth: mkStrip(/^\\s+/g, (regex) => \"^[\" + regex + \"]+\"),\r\n            $flags: { MinArgs: 0, MaxArgs: 1 },\r\n            $textsig: \"($self, chars=None, /)\",\r\n            $doc:\r\n                \"Return a copy of the string with leading whitespace removed.\\n\\nIf chars is given and not None, remove characters in chars instead.\",\r\n        },\r\n        rfind: {\r\n            $meth(tgt, start, end) {\r\n                return new Sk.builtin.int_(this.find$right(tgt, start, end));\r\n            },\r\n            $flags: { MinArgs: 1, MaxArgs: 3 },\r\n            $textsig: null,\r\n            $doc:\r\n                \"S.rfind(sub[, start[, end]]) -> int\\n\\nReturn the highest index in S where substring sub is found,\\nsuch that sub is contained within S[start:end].  Optional\\narguments start and end are interpreted as in slice notation.\\n\\nReturn -1 on failure.\",\r\n        },\r\n        rindex: {\r\n            $meth: function rindex(tgt, start, end) {\r\n                const val = this.find$right(tgt, start, end);\r\n                if (val === -1) {\r\n                    throw new Sk.builtin.ValueError(\"substring not found\");\r\n    } else {\r\n                    return new Sk.builtin.int_(val);\r\n    }\r\n            },\r\n            $flags: { MinArgs: 1, MaxArgs: 3 },\r\n            $textsig: null,\r\n            $doc:\r\n                \"S.rindex(sub[, start[, end]]) -> int\\n\\nReturn the highest index in S where substring sub is found,\\nsuch that sub is contained within S[start:end].  Optional\\narguments start and end are interpreted as in slice notation.\\n\\nRaises ValueError when the substring is not found.\",\r\n        },\r\n        rjust: {\r\n            $meth: mkJust(true, false),\r\n            $flags: { MinArgs: 1, MaxArgs: 2 },\r\n            $textsig: \"($self, width, fillchar=' ', /)\",\r\n            $doc: \"Return a right-justified string of length width.\\n\\nPadding is done using the specified fill character (default is a space).\",\r\n        },\r\n        rstrip: {\r\n            $meth: mkStrip(/\\s+$/g, (regex) => \"[\" + regex + \"]+$\"),\r\n            $flags: { MinArgs: 0, MaxArgs: 1 },\r\n            $textsig: \"($self, chars=None, /)\",\r\n            $doc:\r\n                \"Return a copy of the string with trailing whitespace removed.\\n\\nIf chars is given and not None, remove characters in chars instead.\",\r\n        },\r\n        rpartition: {\r\n            $meth: mkPartition(true),\r\n            $flags: { OneArg: true },\r\n            $textsig: \"($self, sep, /)\",\r\n            $doc:\r\n                \"Partition the string into three parts using the given separator.\\n\\nThis will search for the separator in the string, starting at the end. If\\nthe separator is found, returns a 3-tuple containing the part before the\\nseparator, the separator itself, and the part after it.\\n\\nIf the separator is not found, returns a 3-tuple containing two empty strings\\nand the original string.\",\r\n        },\r\n        splitlines: {\r\n            $meth: function splitlines(keepends) {\r\n                keepends = Sk.misceval.isTrue(keepends);\r\n                const data = this.v;\r\n                const final = [];\r\n                const len = data.length;\r\n                let slice,\r\n                    ch,\r\n                    eol,\r\n                    sol = 0;\r\n                for (let i = 0; i < len; i++) {\r\n                    ch = data.charAt(i);\r\n                    if (data.charAt(i + 1) === \"\\n\" && ch === \"\\r\") {\r\n                        eol = i + 2;\r\n                        slice = data.slice(sol, eol);\r\n                        if (!keepends) {\r\n                            slice = slice.replace(/(\\r|\\n)/g, \"\");\r\n    }\r\n                        final.push(new Sk.builtin.str(slice));\r\n                        sol = eol;\r\n                    } else if ((ch === \"\\n\" && data.charAt(i - 1) !== \"\\r\") || ch === \"\\r\") {\r\n                        eol = i + 1;\r\n                        slice = data.slice(sol, eol);\r\n                        if (!keepends) {\r\n                            slice = slice.replace(/(\\r|\\n)/g, \"\");\r\n    }\r\n                        final.push(new Sk.builtin.str(slice));\r\n                        sol = eol;\r\n    }\r\n        }\r\n                if (sol < len) {\r\n                    eol = len;\r\n                    slice = data.slice(sol, eol);\r\n                    if (!keepends) {\r\n                        slice = slice.replace(/(\\r|\\n)/g, \"\");\r\n    }\r\n                    final.push(new Sk.builtin.str(slice));\r\n    }\r\n                return new Sk.builtin.list(final);\r\n            },\r\n            $flags: { NamedArgs: [\"keepends\"], Defaults: [false] },\r\n            $textsig: \"($self, /, keepends=False)\",\r\n            $doc:\r\n                \"Return a list of the lines in the string, breaking at line boundaries.\\n\\nLine breaks are not included in the resulting list unless keepends is given and\\ntrue.\",\r\n        },\r\n        strip: {\r\n            $meth: mkStrip(/^\\s+|\\s+$/g, (regex) => \"^[\" + regex + \"]+|[\" + regex + \"]+$\"),\r\n            $flags: { MinArgs: 0, MaxArgs: 1 },\r\n            $textsig: \"($self, chars=None, /)\",\r\n            $doc:\r\n                \"Return a copy of the string with leading and trailing whitespace remove.\\n\\nIf chars is given and not None, remove characters in chars instead.\",\r\n        },\r\n        swapcase: {\r\n            $meth() {\r\n                const ret = this.v.replace(/[a-z]/gi, (c) => {\r\n                    const lc = c.toLowerCase();\r\n                    return lc === c ? c.toUpperCase() : lc;\r\n                });\r\n                return new Sk.builtin.str(ret);\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: \"($self, /)\",\r\n            $doc: \"Convert uppercase characters to lowercase and lowercase characters to uppercase.\",\r\n        },\r\n        // translate: {\r\n        //     $meth: methods.translate,\r\n        //     $flags: {},\r\n        //     $textsig: \"($self, table, /)\",\r\n        //     $doc:\r\n        //         \"Replace each character in the string using the given translation table.\\n\\n  table\\n    Translation table, which must be a mapping of Unicode ordinals to\\n    Unicode ordinals, strings, or None.\\n\\nThe table must implement lookup/indexing via __getitem__, for instance a\\ndictionary or list.  If this operation raises LookupError, the character is\\nleft untouched.  Characters mapped to None are deleted.\",\r\n        // },\r\n        upper: {\r\n            $meth() {\r\n                return new Sk.builtin.str(this.v.toUpperCase());\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: \"($self, /)\",\r\n            $doc: \"Return a copy of the string converted to uppercase.\",\r\n        },\r\n        startswith: {\r\n            $meth: mkStartsEndswith(\"startswith\", (substr, i) => substr.indexOf(i) === 0),\r\n            $flags: { MinArgs: 1, MaxArgs: 3 },\r\n            $textsig: null,\r\n            $doc:\r\n                \"S.startswith(prefix[, start[, end]]) -> bool\\n\\nReturn True if S starts with the specified prefix, False otherwise.\\nWith optional start, test S beginning at that position.\\nWith optional end, stop comparing S at that position.\\nprefix can also be a tuple of strings to try.\",\r\n        },\r\n        endswith: {\r\n            $meth: mkStartsEndswith(\"endswith\", (substr, i) => substr.indexOf(i, substr.length - i.length) !== -1),\r\n            $flags: { MinArgs: 1, MaxArgs: 3 },\r\n            $textsig: null,\r\n            $doc:\r\n                \"S.endswith(suffix[, start[, end]]) -> bool\\n\\nReturn True if S ends with the specified suffix, False otherwise.\\nWith optional start, test S beginning at that position.\\nWith optional end, stop comparing S at that position.\\nsuffix can also be a tuple of strings to try.\",\r\n        },\r\n        isascii: {\r\n            $meth() {\r\n                return new Sk.builtin.bool(/^[\\x00-\\x7F]*$/.test(this.v));\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: \"($self, /)\",\r\n            $doc:\r\n                \"Return True if all characters in the string are ASCII, False otherwise.\\n\\nASCII characters have code points in the range U+0000-U+007F.\\nEmpty string is ASCII too.\",\r\n        },\r\n        islower: {\r\n            $meth: function islower() {\r\n                return new Sk.builtin.bool(this.v.length && /[a-z]/.test(this.v) && !/[A-Z]/.test(this.v));\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: \"($self, /)\",\r\n            $doc:\r\n                \"Return True if the string is a lowercase string, False otherwise.\\n\\nA string is lowercase if all cased characters in the string are lowercase and\\nthere is at least one cased character in the string.\",\r\n        },\r\n        isupper: {\r\n            $meth: function islower() {\r\n                return new Sk.builtin.bool(this.v.length && !/[a-z]/.test(this.v) && /[A-Z]/.test(this.v));\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: \"($self, /)\",\r\n            $doc:\r\n                \"Return True if the string is an uppercase string, False otherwise.\\n\\nA string is uppercase if all cased characters in the string are uppercase and\\nthere is at least one cased character in the string.\",\r\n        },\r\n        istitle: {\r\n            $meth: function istitle() {\r\n                // Comparing to str.title() seems the most intuitive thing, but it fails on \"\",\r\n                // Other empty-ish strings with no change.\r\n                const input = this.v;\r\n                let cased = false;\r\n                let previous_is_cased = false;\r\n                let ch;\r\n                for (let pos = 0; pos < input.length; pos++) {\r\n                    ch = input.charAt(pos);\r\n                    if (!/[a-z]/.test(ch) && /[A-Z]/.test(ch)) {\r\n                        if (previous_is_cased) {\r\n                            return Sk.builtin.bool.false$;\r\n    }\r\n                        previous_is_cased = true;\r\n                        cased = true;\r\n                    } else if (/[a-z]/.test(ch) && !/[A-Z]/.test(ch)) {\r\n                        if (!previous_is_cased) {\r\n                            return Sk.builtin.bool.false$;\r\n    }\r\n                        cased = true;\r\n    } else {\r\n                        previous_is_cased = false;\r\n    }\r\n    }\r\n                return new Sk.builtin.bool(cased);\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: \"($self, /)\",\r\n            $doc:\r\n                \"Return True if the string is a title-cased string, False otherwise.\\n\\nIn a title-cased string, upper- and title-case characters may only\\nfollow uncased characters and lowercase characters only cased ones.\",\r\n        },\r\n        isspace: {\r\n            $meth: function isspace() {\r\n                return new Sk.builtin.bool(/^\\s+$/.test(this.v));\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: \"($self, /)\",\r\n            $doc:\r\n                \"Return True if the string is a whitespace string, False otherwise.\\n\\nA string is whitespace if all characters in the string are whitespace and there\\nis at least one character in the string.\",\r\n        },\r\n        // isdecimal: {\r\n        //     $meth: methods.isdecimal,\r\n        //     $flags: { NoArgs: true },\r\n        //     $textsig: \"($self, /)\",\r\n        //     $doc:\r\n        //         \"Return True if the string is a decimal string, False otherwise.\\n\\nA string is a decimal string if all characters in the string are decimal and\\nthere is at least one character in the string.\",\r\n        // },\r\n        isdigit: {\r\n            $meth: function isdigit() {\r\n                return new Sk.builtin.bool(/^\\d+$/.test(this.v));\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: \"($self, /)\",\r\n            $doc:\r\n                \"Return True if the string is a digit string, False otherwise.\\n\\nA string is a digit string if all characters in the string are digits and there\\nis at least one character in the string.\",\r\n        },\r\n        isnumeric: {\r\n            $meth: function isnumeric() {\r\n                return new Sk.builtin.bool(this.v.length && !/[^0-9]/.test(this.v));\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: \"($self, /)\",\r\n            $doc:\r\n                \"Return True if the string is a numeric string, False otherwise.\\n\\nA string is numeric if all characters in the string are numeric and there is at\\nleast one character in the string.\",\r\n        },\r\n        isalpha: {\r\n            $meth: function isalpha() {\r\n                return new Sk.builtin.bool(this.v.length && !/[^a-zA-Z]/.test(this.v));\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: \"($self, /)\",\r\n            $doc:\r\n                \"Return True if the string is an alphabetic string, False otherwise.\\n\\nA string is alphabetic if all characters in the string are alphabetic and there\\nis at least one character in the string.\",\r\n        },\r\n        isalnum: {\r\n            $meth: function isalnum() {\r\n                return new Sk.builtin.bool(this.v.length && !/[^a-zA-Z0-9]/.test(this.v));\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: \"($self, /)\",\r\n            $doc:\r\n                \"Return True if the string is an alpha-numeric string, False otherwise.\\n\\nA string is alpha-numeric if all characters in the string are alpha-numeric and\\nthere is at least one character in the string.\",\r\n        },\r\n        isidentifier: {\r\n            $meth: function isidentifier() {\r\n                return this.$isIdentifier() ? Sk.builtin.bool.true$ : Sk.builtin.bool.false$;\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: \"($self, /)\",\r\n            $doc:\r\n                'Return True if the string is a valid Python identifier, False otherwise.\\n\\nUse keyword.iskeyword() to test for reserved identifiers such as \"def\" and\\n\"class\".',\r\n        },\r\n        // isprintable: {\r\n        //     $meth: methods.isprintable,\r\n        //     $flags: {},\r\n        //     $textsig: \"($self, /)\",\r\n        //     $doc:\r\n        //         \"Return True if the string is printable, False otherwise.\\n\\nA string is printable if all of its characters are considered printable in\\nrepr() or if it is empty.\",\r\n        // },\r\n        zfill: {\r\n            $meth: function zfill(len) {\r\n                len = Sk.misceval.asIndexSized(len, Sk.builtin.OverflowError);\r\n                let pad = \"\";\r\n                // figure out how many zeroes are needed to make the proper length\r\n                const zeroes = len - this.v.length; // techinally this should sq$length ?\r\n                // offset by 1 if there is a +/- at the beginning of the string\r\n                const offset = this.v[0] === \"+\" || this.v[0] === \"-\" ? 1 : 0;\r\n                for (let i = 0; i < zeroes; i++) {\r\n                    pad += \"0\";\r\n    }\r\n                // combine the string and the zeroes\r\n                return new Sk.builtin.str(this.v.substr(0, offset) + pad + this.v.substr(offset));\r\n            },\r\n            $flags: { OneArg: true },\r\n            $textsig: \"($self, width, /)\",\r\n            $doc: \"Pad a numeric string with zeros on the left, to fill a field of the given width.\\n\\nThe string is never truncated.\",\r\n        },\r\n        format: {\r\n            $meth: Sk.formatting.format,\r\n            $flags: { FastCall: true },\r\n            $textsig: null,\r\n            $doc:\r\n                \"S.format(*args, **kwargs) -> str\\n\\nReturn a formatted version of S, using substitutions from args and kwargs.\\nThe substitutions are identified by braces ('{' and '}').\",\r\n        },\r\n        // format_map: {\r\n        //     $meth: methods.format_map,\r\n        //     $flags: {},\r\n        //     $textsig: null,\r\n        //     $doc:\r\n        //         \"S.format_map(mapping) -> str\\n\\nReturn a formatted version of S, using substitutions from mapping.\\nThe substitutions are identified by braces ('{' and '}').\",\r\n        // },\r\n        __format__: {\r\n            $meth: Sk.formatting.formatString,\r\n            $flags: { OneArg: true },\r\n            $textsig: \"($self, format_spec, /)\",\r\n            $doc: \"Return a formatted version of the string as described by format_spec.\",\r\n        },\r\n        // __sizeof__: {\r\n        //     $meth: methods.__sizeof__,\r\n        //     $flags: {},\r\n        //     $textsig: \"($self, /)\",\r\n        //     $doc: \"Return the size of the string in memory, in bytes.\",\r\n        // },\r\n        __getnewargs__: {\r\n            $meth() {\r\n                return new Sk.builtin.tuple(new Sk.builtin.str(this.v));\r\n            },\r\n            $flags: { NoArgs: true },\r\n            $textsig: null,\r\n            $doc: null,\r\n        },\r\n    },\r\n});\r\n\r\nSk.exportSymbol(\"Sk.builtin.str\", Sk.builtin.str);\r\n\r\nvar re = /^[A-Za-z0-9]+$/;\r\nfunction re_escape_(s) {\r\n    let c;\r\n    const ret = [];\r\n    for (let i = 0; i < s.length; i++) {\r\n        c = s.charAt(i);\r\n        if (re.test(c)) {\r\n            ret.push(c);\r\n    } else {\r\n            if (c === \"\\\\000\") {\r\n                ret.push(\"\\\\000\");\r\n    } else {\r\n                ret.push(\"\\\\\" + c);\r\n    }\r\n    }\r\n    }\r\n    return ret.join(\"\");\r\n    }\r\n\r\n// methods\r\nvar special_chars = /([.*+?=|\\\\\\/()\\[\\]\\{\\}^$])/g;\r\nvar leading_whitespace = /^[\\s\\xa0]+/;\r\n    \r\nfunction splitPoints(self, sep, maxsplit) {\r\n    sep = Sk.builtin.checkNone(sep) ? null : self.get$tgt(sep);\r\n    if (sep !== null && !sep.length) {\r\n        throw new Sk.builtin.ValueError(\"empty separator\");\r\n        }\r\n    let jsstr = self.v;\r\n    let offset = 0;\r\n    let regex;\r\n    if (sep === null) {\r\n        // Remove leading whitespace\r\n        regex = /[\\s\\xa0]+/g;\r\n        const len = jsstr.length;\r\n        jsstr = jsstr.replace(leading_whitespace, \"\");\r\n        offset = len - jsstr.length;\r\n    } else {\r\n        // Escape special characters in null so we can use a regexp\r\n        const s = sep.replace(special_chars, \"\\\\$1\");\r\n        regex = new RegExp(s, \"g\");\r\n            }\r\n    // This is almost identical to re.split,\r\n    // except how the regexp is constructed\r\n    const pairs = [];\r\n    let index = 0;\r\n    let splits = 0;\r\n    let match;\r\n    maxsplit = maxsplit < 0 ? Infinity : maxsplit;\r\n    while ((match = regex.exec(jsstr)) != null && splits < maxsplit) {\r\n        if (match.index === regex.lastIndex) {\r\n            // empty match\r\n                break;\r\n            }\r\n        pairs.push(index + offset);\r\n        pairs.push(match.index + offset);\r\n        index = regex.lastIndex;\r\n        splits += 1;\r\n        }\r\n    if (sep !== null || jsstr.length - index) {\r\n        pairs.push(index + offset);\r\n        pairs.push(jsstr.length + offset);\r\n    }\r\n    return pairs;\r\n    }\r\n\r\nfunction mkStrip(pat, regf) {\r\n    return function strip(chars) {\r\n        let pattern;\r\n        if (chars === undefined || Sk.builtin.checkNone(chars)) {\r\n            pattern = pat;\r\n        } else if (chars instanceof Sk.builtin.str) {\r\n            const regex = re_escape_(chars.v);\r\n            pattern = new RegExp(regf(regex), \"g\");\r\n        } else {\r\n            throw new Sk.builtin.TypeError(\"strip arg must be None or str\");\r\n    }\r\n        return new Sk.builtin.str(this.v.replace(pattern, \"\"));\r\n};\r\n    }\r\n\r\nfunction mkPartition(isReversed) {\r\n    return function partition(sep) {\r\n        const sepStr = this.get$tgt(sep);\r\n        const jsstr = this.v;\r\n        let pos;\r\n        if (isReversed) {\r\n            pos = jsstr.lastIndexOf(sepStr);\r\n            if (pos < 0) {\r\n                return new Sk.builtin.tuple([new Sk.builtin.str(\"\"), new Sk.builtin.str(\"\"), new Sk.builtin.str(jsstr)]);\r\n    }\r\n    } else {\r\n            pos = jsstr.indexOf(sepStr);\r\n            if (pos < 0) {\r\n                return new Sk.builtin.tuple([new Sk.builtin.str(jsstr), new Sk.builtin.str(\"\"), new Sk.builtin.str(\"\")]);\r\n            }\r\n    }\r\n\r\n        return new Sk.builtin.tuple([\r\n            new Sk.builtin.str(jsstr.substring(0, pos)),\r\n            new Sk.builtin.str(sepStr),\r\n            new Sk.builtin.str(jsstr.substring(pos + sepStr.length)),\r\n        ]);\r\n    };\r\n    }\r\n\r\nfunction mkJust(isRight, isCenter) {\r\n    return function strJustify(len, fillchar) {\r\n        len = Sk.misceval.asIndexSized(len, Sk.builtin.OverflowError);\r\n        if (fillchar === undefined) {\r\n            fillchar = \" \";\r\n        } else if (!(fillchar instanceof Sk.builtin.str) || fillchar.sq$length() !== 1) {\r\n            throw new Sk.builtin.TypeError(\"the fill character must be a str of length 1\");\r\n        } else {\r\n            fillchar = fillchar.v;\r\n    }\r\n\r\n        const mylen = this.sq$length();\r\n        let newstr;\r\n        if (mylen >= len) {\r\n            return new Sk.builtin.str(this.v);\r\n        } else if (isCenter) {\r\n            newstr = fillchar.repeat(Math.floor((len - mylen) / 2));\r\n            newstr = newstr + this.v + newstr;\r\n\r\n            if ((len - mylen) % 2) {\r\n                newstr += fillchar;\r\n    }\r\n\r\n            return new Sk.builtin.str(newstr);\r\n        } else {\r\n            newstr = fillchar.repeat(len - mylen);\r\n            return new Sk.builtin.str(isRight ? newstr + this.v : this.v + newstr);\r\n    }\r\n};\r\n    }\r\n\r\nfunction indices(self, start, end) {\r\n    ({ start, end } = Sk.builtin.slice.startEnd$wrt(self, start, end));\r\n    if (self.$hasAstralCodePoints()) {\r\n        const tmp = self.codepoints[start];\r\n        start = tmp === undefined ? start + self.v.length - self.codepoints.length : tmp;\r\n        end = self.codepoints[end];\r\n        end = end === undefined ? self.v.length : end;\r\n    }\r\n    return {\r\n        start: start,\r\n        end: end,\r\n    };\r\n    }\r\n\r\nfunction mkFind(isReversed) {\r\n    return function (tgt, start, end) {\r\n        tgt = this.get$tgt(tgt);\r\n\r\n        ({ start, end } = indices(this, start, end));\r\n        if (end < start) {\r\n            return -1;\r\n    }\r\n        // ...do the search..\r\n        end -= tgt.length;\r\n        let jsidx = isReversed ? this.v.lastIndexOf(tgt, end) : this.v.indexOf(tgt, start);\r\n        jsidx = jsidx >= start && jsidx <= end ? jsidx : -1;\r\n\r\n        let idx;\r\n        if (this.codepoints) {\r\n            // ...and now convert them back\r\n            const len = this.sq$length();\r\n            idx = -1;\r\n            for (let i = 0; i < len; i++) {\r\n                if (jsidx == this.codepoints[i]) {\r\n                    idx = i;\r\n    }\r\n    }\r\n    } else {\r\n            // No astral codepoints, no conversion required\r\n            idx = jsidx;\r\n    }\r\n        return idx;\r\n};\r\n    }\r\n\r\nfunction mkStartsEndswith(funcname, is_match) {\r\n    return function (tgt, start, end) {\r\n        if (!(tgt instanceof Sk.builtin.str) && !(tgt instanceof Sk.builtin.tuple)) {\r\n            throw new Sk.builtin.TypeError(funcname + \" first arg must be str or a tuple of str, not \" + Sk.abstr.typeName(tgt));\r\n    }\r\n\r\n        ({ start, end } = indices(this, start, end));\r\n\r\n        if (start > end) {\r\n            return Sk.builtin.bool.false$;\r\n        }\r\n\r\n        const substr = this.v.slice(start, end);\r\n\r\n        if (tgt instanceof Sk.builtin.tuple) {\r\n            for (let it = Sk.abstr.iter(tgt), i = it.tp$iternext(); i !== undefined; i = it.tp$iternext()) {\r\n                if (!(i instanceof Sk.builtin.str)) {\r\n                    throw new Sk.builtin.TypeError(\"tuple for \" + funcname + \" must only contain str, not \" + Sk.abstr.typeName(i));\r\n            }\r\n                if (is_match(substr, i.v)) {\r\n                    return Sk.builtin.bool.true$;\r\n            }\r\n        }\r\n            return Sk.builtin.bool.false$;\r\n    }\r\n        return new Sk.builtin.bool(is_match(substr, tgt.v));\r\n};\r\n}\r\n\r\nSk.builtin.str.$py2decode = new Sk.builtin.method_descriptor(Sk.builtin.str, {\r\n    $name: \"decode\",\r\n    $meth(encoding, errors) {\r\n        const pyBytes = new Sk.builtin.bytes(this.v);\r\n        return Sk.builtin.bytes.$decode.call(pyBytes, encoding, errors);\r\n    },\r\n    $flags: { NamedArgs: [\"encoding\", \"errors\"] },\r\n});\r\n\r\nfunction strBytesRemainder(rhs) {\r\n    // % format op. rhs can be a value, a tuple, or something with __getitem__ (dict)\r\n\r\n    // From http://docs.python.org/library/stdtypes.html#string-formatting the\r\n    // format looks like:\r\n    // 1. The '%' character, which marks the start of the specifier.\r\n    // 2. Mapping key (optional), consisting of a parenthesised sequence of characters (for example, (somename)).\r\n    // 3. Conversion flags (optional), which affect the result of some conversion types.\r\n    // 4. Minimum field width (optional). If specified as an '*' (asterisk), the actual width is read from the next\r\n    // element of the tuple in values, and the object to convert comes after the minimum field width and optional\r\n    // precision. 5. Precision (optional), given as a '.' (dot) followed by the precision. If specified as '*' (an\r\n    // asterisk), the actual width is read from the next element of the tuple in values, and the value to convert comes\r\n    // after the precision. 6. Length modifier (optional). 7. Conversion type.  length modifier is ignored\r\n\r\n    var ret;\r\n    var replFunc;\r\n    var index;\r\n    var regex;\r\n    var val;\r\n    const strBytesConstructor = this.sk$builtinBase;\r\n    // distinguish between bytes and str\r\n\r\n    if (rhs.constructor !== Sk.builtin.tuple && !(rhs instanceof Sk.builtin.dict || rhs instanceof Sk.builtin.mappingproxy)) {\r\n        rhs = new Sk.builtin.tuple([rhs]);\r\n    }\r\n    // general approach is to use a regex that matches the format above, and\r\n    // do an re.sub with a function as replacement to make the subs.\r\n\r\n    //           1 2222222222222222   33333333   444444444   5555555555555  66666  777777777777777777\r\n    regex = /%(\\([a-zA-Z0-9]+\\))?([#0 +\\-]+)?(\\*|[0-9]+)?(\\.(\\*|[0-9]+))?[hlL]?([diouxXeEfFgGcrsb%])/g;\r\n    index = 0;\r\n    replFunc = function (substring, mappingKey, conversionFlags, fieldWidth, precision, precbody, conversionType) {\r\n        var result;\r\n        var convName;\r\n        var convValue;\r\n        var base;\r\n        var r;\r\n        var mk;\r\n        var value;\r\n        var handleWidth;\r\n        var formatNumber;\r\n        var alternateForm;\r\n        var precedeWithSign;\r\n        var blankBeforePositive;\r\n        var leftAdjust;\r\n        var zeroPad;\r\n        var i;\r\n\r\n        fieldWidth = Sk.builtin.asnum$(fieldWidth);\r\n        precision = Sk.builtin.asnum$(precision);\r\n\r\n        if ((mappingKey === undefined || mappingKey === \"\") && conversionType != \"%\") {\r\n            i = index++;\r\n        } // ff passes '' not undef for some reason\r\n\r\n        if (precision === \"\") {\r\n            // ff passes '' here aswell causing problems with G,g, etc.\r\n            precision = undefined;\r\n        }\r\n\r\n        zeroPad = false;\r\n        leftAdjust = false;\r\n        blankBeforePositive = false;\r\n        precedeWithSign = false;\r\n        alternateForm = false;\r\n        if (conversionFlags) {\r\n            if (conversionFlags.indexOf(\"-\") !== -1) {\r\n                leftAdjust = true;\r\n            } else if (conversionFlags.indexOf(\"0\") !== -1) {\r\n                zeroPad = true;\r\n            }\r\n\r\n            if (conversionFlags.indexOf(\"+\") !== -1) {\r\n                precedeWithSign = true;\r\n            } else if (conversionFlags.indexOf(\" \") !== -1) {\r\n                blankBeforePositive = true;\r\n            }\r\n\r\n            alternateForm = conversionFlags.indexOf(\"#\") !== -1;\r\n        }\r\n\r\n        if (precision) {\r\n            precision = parseInt(precision.substr(1), 10);\r\n        }\r\n\r\n        formatNumber = function (n, base) {\r\n            var precZeroPadded;\r\n            var prefix;\r\n            var didSign;\r\n            var neg;\r\n            var r;\r\n            var j;\r\n            base = Sk.builtin.asnum$(base);\r\n            neg = false;\r\n            didSign = false;\r\n            if (typeof n === \"number\") {\r\n                if (n < 0) {\r\n                    n = -n;\r\n                    neg = true;\r\n                }\r\n                r = n.toString(base);\r\n            } else if (n instanceof Sk.builtin.float_) {\r\n                r = n.str$(base, false);\r\n                if (r.length > 2 && r.substr(-2) === \".0\") {\r\n                    r = r.substr(0, r.length - 2);\r\n                }\r\n                neg = n.nb$isnegative();\r\n            } else if (n instanceof Sk.builtin.int_) {\r\n                r = n.str$(base, false);\r\n                neg = n.nb$isnegative();\r\n            } else if (n instanceof Sk.builtin.lng) {\r\n                r = n.str$(base, false);\r\n                neg = n.nb$isnegative();\r\n            }\r\n\r\n            Sk.asserts.assert(r !== undefined, \"unhandled number format\");\r\n\r\n            precZeroPadded = false;\r\n\r\n            if (precision) {\r\n                //print(\"r.length\",r.length,\"precision\",precision);\r\n                for (j = r.length; j < precision; ++j) {\r\n                    r = \"0\" + r;\r\n                    precZeroPadded = true;\r\n                }\r\n            }\r\n\r\n            prefix = \"\";\r\n\r\n            if (neg) {\r\n                prefix = \"-\";\r\n            } else if (precedeWithSign) {\r\n                prefix = \"+\" + prefix;\r\n            } else if (blankBeforePositive) {\r\n                prefix = \" \" + prefix;\r\n            }\r\n\r\n            if (alternateForm) {\r\n                if (base === 16) {\r\n                    prefix += \"0x\";\r\n                } else if (base === 8 && !precZeroPadded && r !== \"0\") {\r\n                    prefix += \"0\";\r\n                }\r\n            }\r\n\r\n            return [prefix, r];\r\n        };\r\n\r\n        handleWidth = function (args) {\r\n            var totLen;\r\n            var prefix = args[0];\r\n            var r = args[1];\r\n            var j;\r\n\r\n            if (fieldWidth) {\r\n                fieldWidth = parseInt(fieldWidth, 10);\r\n                totLen = r.length + prefix.length;\r\n                if (zeroPad) {\r\n                    for (j = totLen; j < fieldWidth; ++j) {\r\n                        r = \"0\" + r;\r\n                    }\r\n                } else if (leftAdjust) {\r\n                    for (j = totLen; j < fieldWidth; ++j) {\r\n                        r = r + \" \";\r\n                    }\r\n                    if (Sk.__future__.python3) {\r\n                        r += prefix;\r\n                        prefix = \"\";\r\n                    }\r\n                } else {\r\n                    for (j = totLen; j < fieldWidth; ++j) {\r\n                        prefix = \" \" + prefix;\r\n                    }\r\n                }\r\n            }\r\n            return prefix + r;\r\n        };\r\n        //print(\"Rhs:\",rhs, \"ctor\", rhs.constructor);\r\n        if (rhs.constructor === Sk.builtin.tuple) {\r\n            value = rhs.v[i];\r\n        } else if (rhs.mp$subscript !== undefined && mappingKey !== undefined) {\r\n            mk = mappingKey.substring(1, mappingKey.length - 1);\r\n            //print(\"mk\",mk);\r\n            value = rhs.mp$subscript(new strBytesConstructor(mk));\r\n        } else if (rhs.constructor === Sk.builtin.dict || rhs.constructor === Sk.builtin.list) {\r\n            // new case where only one argument is provided\r\n            value = rhs;\r\n        } else {\r\n            throw new Sk.builtin.AttributeError(rhs.tp$name + \" instance has no attribute 'mp$subscript'\");\r\n        }\r\n        base = 10;\r\n        if (conversionType === \"d\" || conversionType === \"i\") {\r\n            let tmpData = formatNumber(value, base);\r\n            if (tmpData[1] === undefined){\r\n                throw new Sk.builtin.TypeError(\"%\"+ conversionType+\" format: a number is required, not \"+ Sk.abstr.typeName(value));\r\n            }\r\n            let r = tmpData[1];\r\n            tmpData[1] = r.indexOf(\".\") !== -1 ? parseInt(r, 10).toString() : r;\r\n            return handleWidth(tmpData);\r\n        } else if (conversionType === \"o\") {\r\n            return handleWidth(formatNumber(value, 8));\r\n        } else if (conversionType === \"x\") {\r\n            return handleWidth(formatNumber(value, 16));\r\n        } else if (conversionType === \"X\") {\r\n            return handleWidth(formatNumber(value, 16)).toUpperCase();\r\n        } else if (\r\n            conversionType === \"f\" ||\r\n            conversionType === \"F\" ||\r\n            conversionType === \"e\" ||\r\n            conversionType === \"E\" ||\r\n            conversionType === \"g\" ||\r\n            conversionType === \"G\"\r\n        ) {\r\n            convValue = Sk.builtin.asnum$(value);\r\n            if (typeof convValue === \"string\") {\r\n                convValue = Number(convValue);\r\n            }\r\n            if (convValue === Infinity) {\r\n                return \"inf\";\r\n            }\r\n            if (convValue === -Infinity) {\r\n                return \"-inf\";\r\n            }\r\n            if (isNaN(convValue)) {\r\n                return \"nan\";\r\n            }\r\n            convName = [\"toExponential\", \"toFixed\", \"toPrecision\"][\"efg\".indexOf(conversionType.toLowerCase())];\r\n            if (precision === undefined || precision === \"\") {\r\n                if (conversionType === \"e\" || conversionType === \"E\") {\r\n                    precision = 6;\r\n                } else if (conversionType === \"f\" || conversionType === \"F\") {\r\n                    if (Sk.__future__.python3) {\r\n                        precision = 6;\r\n                    } else {\r\n                        precision = 7;\r\n                    }\r\n                }\r\n            }\r\n            result = convValue[convName](precision); // possible loose of negative zero sign\r\n\r\n            // apply sign to negative zeros, floats only!\r\n            if (Sk.builtin.checkFloat(value)) {\r\n                if (convValue === 0 && 1 / convValue === -Infinity) {\r\n                    result = \"-\" + result; // add sign for zero\r\n                }\r\n            }\r\n            if (Sk.__future__.python3) {\r\n                if (result.length >= 7 && result.slice(0, 6) == \"0.0000\") {\r\n                    val = parseFloat(result);\r\n                    result = val.toExponential();\r\n                }\r\n                if (result.charAt(result.length - 2) == \"-\") {\r\n                    result = result.slice(0, result.length - 1) + \"0\" + result.charAt(result.length - 1);\r\n                }\r\n            }\r\n            if (\"EFG\".indexOf(conversionType) !== -1) {\r\n                result = result.toUpperCase();\r\n            }\r\n            return handleWidth([\"\", result]);\r\n        } else if (conversionType === \"c\") {\r\n            if (typeof value === \"number\") {\r\n                return String.fromCharCode(value);\r\n            } else if (value instanceof Sk.builtin.int_) {\r\n                return String.fromCharCode(value.v);\r\n            } else if (value instanceof Sk.builtin.float_) {\r\n                return String.fromCharCode(value.v);\r\n            } else if (value instanceof Sk.builtin.lng) {\r\n                return String.fromCharCode(value.str$(10, false)[0]);\r\n            } else if (value.constructor === Sk.builtin.str) {\r\n                return value.v.substr(0, 1);\r\n            } else {\r\n                throw new Sk.builtin.TypeError(\"an integer is required\");\r\n            }\r\n        } else if (conversionType === \"r\") {\r\n            r = Sk.builtin.repr(value);\r\n            if (precision) {\r\n                return r.v.substr(0, precision);\r\n            }\r\n            return r.v;\r\n        } else if (conversionType === \"s\" && strBytesConstructor === Sk.builtin.str) {\r\n            r = new Sk.builtin.str(value);\r\n            r = r.$jsstr();\r\n            if (precision) {\r\n                return r.substr(0, precision);\r\n            }\r\n            if (fieldWidth) {\r\n                r = handleWidth([\" \", r]);\r\n            }\r\n            return r;\r\n        } else if (conversionType === \"b\" || conversionType === \"s\") {\r\n            if (strBytesConstructor === Sk.builtin.str) {\r\n                throw new Sk.builtin.ValueError(\"unsupported format character 'b'\");\r\n            }\r\n            let func;\r\n            if (!(value instanceof Sk.builtin.bytes) && (func = Sk.abstr.lookupSpecial(value, Sk.builtin.str.$bytes)) === undefined) {\r\n                throw new Sk.builtin.TypeError(\"%b requires a bytes-like object, or an object that implements __bytes__, not '\" + Sk.abstr.typeName(value) + \"'\");\r\n            }\r\n            if (func !== undefined) {\r\n                value = new Sk.builtin.bytes(value);\r\n                // raises the appropriate error message if __bytes__ does not return bytes\r\n            }\r\n            r = value.$jsstr();\r\n            if (precision) {\r\n                return r.substr(0, precision);\r\n            }\r\n            if (fieldWidth) {\r\n                r = handleWidth([\" \", r]);\r\n            }\r\n            return r;\r\n        } else if (conversionType === \"%\") {\r\n            return \"%\";\r\n        }\r\n    };\r\n    ret = this.$jsstr().replace(regex, replFunc);\r\n    if (rhs instanceof Sk.builtin.tuple && index < rhs.sq$length()) {\r\n        throw new Sk.builtin.TypeError(\"not all arguments converted during string formatting\");\r\n    }\r\n    return new strBytesConstructor(ret);\r\n};\r\n\r\n/**\r\n * @constructor\r\n * @param {Object} obj\r\n */\r\nvar str_iter_ = Sk.abstr.buildIteratorClass(\"str_iterator\", {\r\n    constructor: function str_iter_(str) {\r\n        this.$index = 0;\r\n        if (str.$hasAstralCodePoints()) {\r\n            this.$seq = str.codepoints;\r\n            this.tp$iternext = () => {\r\n                const i = this.$seq[this.$index];\r\n                if (i === undefined) {\r\n                    return undefined;\r\n                }\r\n                return new Sk.builtin.str(str.v.substring(i, this.$seq[++this.$index]));\r\n            };\r\n        } else {\r\n            this.$seq = str.v;\r\n            this.tp$iternext = () => {\r\n                const ch = this.$seq[this.$index++];\r\n                if (ch === undefined) {\r\n                    return undefined;\r\n                }\r\n                return new Sk.builtin.str(ch);\r\n            };\r\n        }\r\n    },\r\n    iternext() {\r\n        return this.tp$iternext();\r\n    },\r\n    methods: {\r\n        __length_hint__: Sk.generic.iterLengthHintWithArrayMethodDef,\r\n    },\r\n    flags: { sk$unacceptableBase: true },\r\n});\r\n\r\nvar reservedWords_ = {\r\n    abstract: true,\r\n    as: true,\r\n    boolean: true,\r\n    break: true,\r\n    byte: true,\r\n    case: true,\r\n    catch: true,\r\n    char: true,\r\n    class: true,\r\n    continue: true,\r\n    const: true,\r\n    debugger: true,\r\n    default: true,\r\n    delete: true,\r\n    do: true,\r\n    double: true,\r\n    else: true,\r\n    enum: true,\r\n    export: true,\r\n    extends: true,\r\n    false: true,\r\n    final: true,\r\n    finally: true,\r\n    float: true,\r\n    for: true,\r\n    function: true,\r\n    goto: true,\r\n    if: true,\r\n    implements: true,\r\n    import: true,\r\n    in: true,\r\n    instanceof: true,\r\n    int: true,\r\n    interface: true,\r\n    is: true,\r\n    long: true,\r\n    namespace: true,\r\n    native: true,\r\n    new: true,\r\n    null: true,\r\n    package: true,\r\n    private: true,\r\n    protected: true,\r\n    public: true,\r\n    return: true,\r\n    short: true,\r\n    static: true,\r\n    super: true,\r\n    switch: true,\r\n    synchronized: true,\r\n    this: true,\r\n    throw: true,\r\n    throws: true,\r\n    transient: true,\r\n    true: true,\r\n    try: true,\r\n    typeof: true,\r\n    use: true,\r\n    var: true,\r\n    void: true,\r\n    volatile: true,\r\n    while: true,\r\n    with: true,\r\n    // reserved Names\r\n    constructor: true,\r\n    __defineGetter__: true,\r\n    __defineSetter__: true,\r\n    apply: true,\r\n    arguments: true,\r\n    call: true,\r\n    caller: true,\r\n    eval: true,\r\n    hasOwnProperty: true,\r\n    isPrototypeOf: true,\r\n    __lookupGetter__: true,\r\n    __lookupSetter__: true,\r\n    __noSuchMethod__: true,\r\n    propertyIsEnumerable: true,\r\n    prototype: true,\r\n    toSource: true,\r\n    toLocaleString: true,\r\n    toString: true,\r\n    unwatch: true,\r\n    valueOf: true,\r\n    watch: true,\r\n    length: true,\r\n    name: true,\r\n};\r\n\r\nfunction fixReserved(name) {\r\n    if (reservedWords_[name] === undefined) {\r\n        return name;\r\n    }\r\n    return name + \"_$rw$\";\r\n}\r\n\r\nSk.builtin.str.reservedWords_ = reservedWords_;\r\n","Sk.builtin.structseq_types = {};\r\n\r\nSk.builtin.make_structseq = function (module, name, visible_fields, hidden_fields={}, doc=null) {\r\n    const nm = module + \".\" + name;\r\n    const flds = [];\r\n    const getsets = {};\r\n    Object.keys(visible_fields).forEach((key, i) => {\r\n        flds.push(key);\r\n        getsets[key] = {\r\n            $get() { return this.v[i]; },\r\n            $doc: visible_fields[key],\r\n        };\r\n    });\r\n    const n_flds = flds.length;\r\n    let n_total_flds = n_flds;\r\n\r\n    Object.keys(hidden_fields).forEach((key, i) => {\r\n        getsets[key] = {\r\n            $get() {\r\n                return this.$hidden[i] || Sk.builtin.none.none$;\r\n            },\r\n            $doc: hidden_fields[key],\r\n        };\r\n        n_total_flds++;\r\n    });\r\n\r\n    /**\r\n     * @constructor\r\n     * @extends Sk.builtin.tuple\r\n     * @param {!Array<Object>|Object} arg\r\n     */\r\n    var structseq = Sk.abstr.buildNativeClass(nm, {\r\n        constructor: function structseq_constructor(v, hidden) {\r\n            Sk.asserts.assert(this instanceof structseq);\r\n            Sk.builtin.tuple.call(this, v);\r\n            this.$hidden = hidden || [];\r\n        },\r\n        base: Sk.builtin.tuple,\r\n        slots: {\r\n            tp$new(args, kwargs) {\r\n                Sk.abstr.checkOneArg(nm, args, kwargs);\r\n                const arg = Sk.misceval.arrayFromIterable(args[0]);\r\n                if (arg.length < n_flds) {\r\n                    throw new Sk.builtin.TypeError(nm + \"() takes an at least \" + n_flds + \"-sequence (\" + arg.length + \"-sequence given)\");\r\n                } else if (arg.length > n_total_flds) {\r\n                    throw new Sk.builtin.TypeError(nm + \"() takes an at most \" + n_total_flds + \"-sequence (\" + arg.length + \"-sequence given)\"); \r\n                }\r\n                return new structseq(arg.slice(0, n_flds), arg.slice(n_flds));\r\n            },\r\n            tp$doc: doc ? doc : Sk.builtin.none.none$,\r\n            $r() {\r\n                var ret;\r\n                var i;\r\n                var bits;\r\n                if (this.v.length === 0) {\r\n                    return new Sk.builtin.str(nm + \"()\");\r\n                }\r\n                bits = [];\r\n                for (i = 0; i < flds.length; ++i) {\r\n                    bits[i] = flds[i] + \"=\" + Sk.misceval.objectRepr(this.v[i]);\r\n                }\r\n                ret = bits.join(\", \");\r\n                if (this.v.length === 1) {\r\n                    ret += \",\";\r\n                }\r\n                return new Sk.builtin.str(nm + \"(\" + ret + \")\");\r\n            },\r\n\r\n        },\r\n        methods: {\r\n            __reduce__: {\r\n                $meth() {\r\n                    throw new Sk.builtin.NotImplementedError(\"__reduce__ is not implemented\");\r\n                },\r\n                $flags: {NoArgs: true}\r\n            }\r\n        },\r\n        getsets: getsets,\r\n        proto: {\r\n            num_sequence_fields: new Sk.builtin.int_(n_flds)\r\n        }\r\n    });\r\n    return structseq;\r\n};\r\nSk.exportSymbol(\"Sk.builtin.make_structseq\", Sk.builtin.make_structseq);\r\n","/**\r\n * @constructor\r\n * Sk.builtin.super_\r\n */\r\nSk.builtin.super_ = Sk.abstr.buildNativeClass(\"super\", {\r\n    constructor: function super_(a_type, other_self) {\r\n        // internally we never use this method\r\n        Sk.asserts.assert(this instanceof Sk.builtin.super_, \"bad call to super, use 'new'\");\r\n        // internal calls can use this method but it \r\n        this.type = a_type;\r\n        this.obj = other_self;\r\n        if (a_type !== undefined) {\r\n            if (!Sk.builtin.checkClass(a_type)) {\r\n                throw new Sk.builtin.TypeError(\"must be type, not \" + Sk.abstr.typeName(a_type));\r\n            }\r\n        }\r\n        if (this.obj !== undefined) {\r\n            this.obj_type = this.$supercheck(a_type, this.obj);\r\n        } else {\r\n            this.obj_type = null;\r\n        }\r\n    },\r\n    slots: {\r\n        tp$doc:\r\n            \"super() -> same as super(__class__, <first argument>)\\n\" +\r\n            \"super(type) -> unbound super object\\nsuper(type, obj) -> bound super object; requires isinstance(obj, type)\\n\" +\r\n            \"super(type, type2) -> bound super object; requires issubclass(type2, type)\\n\" +\r\n            \"Typical use to call a cooperative superclass method:\\n\" +\r\n            \"class C(B):\\n    def meth(self, arg):\\n        super().meth(arg)\\nThis works for class methods too:\\nclass C(B):\\n    @classmethod\\n    def cmeth(cls, arg):\\n        super().cmeth(arg)\\n\",\r\n        tp$new: Sk.generic.new,\r\n        tp$init(args, kwargs) {\r\n            Sk.abstr.checkNoKwargs(\"super\", kwargs);\r\n            Sk.abstr.checkArgsLen(\"super\", args, 1, 2);\r\n            const a_type = args[0];\r\n            const other_self = args[1];\r\n            if (!Sk.builtin.checkClass(a_type)) {\r\n                throw new Sk.builtin.TypeError(\"must be type, not \" + Sk.abstr.typeName(a_type));\r\n            }\r\n            this.obj = other_self;\r\n            this.type = a_type;\r\n            if (this.obj != null) {\r\n                this.obj_type = this.$supercheck(a_type, this.obj);\r\n            }\r\n            return Sk.builtin.none.none$;\r\n        },\r\n        $r() {\r\n            if (this.obj) {\r\n                return new Sk.builtin.str(\"<super: <class '\" + this.type.prototype.tp$name + \"'>, <\" + Sk.abstr.typeName(this.obj) + \" object>>\");\r\n            }\r\n            return new Sk.builtin.str(\"<super: <class '\" + this.type.prototype.tp$name + \"'>, NULL>\");\r\n        },\r\n        tp$getattr(pyName, canSuspend) {\r\n            let starttype = this.obj_type;\r\n            if (starttype == null) {\r\n                return Sk.generic.getAttr.call(this, pyName, canSuspend);\r\n            }\r\n            const mro = starttype.prototype.tp$mro;\r\n            const n = mro.length;\r\n            /* We want __class__ to return the class of the super object\r\n            (i.e. super, or a subclass), not the class of su->obj. */\r\n            if (pyName === Sk.builtin.str.$class) {\r\n                return Sk.generic.getAttr.call(this, pyName, canSuspend);\r\n            }\r\n            /* No need to check the last one: it's gonna be skipped anyway.  */\r\n            let i;\r\n            for (i = 0; i + 1 < n; i++) {\r\n                if (this.type === mro[i]) {\r\n                    break;\r\n                }\r\n            }\r\n            i++;\r\n            if (i >= n) {\r\n                return Sk.generic.getAttr.call(this, pyName, canSuspend);\r\n            }\r\n            const jsName = pyName.$mangled;\r\n\r\n            let tmp, res;\r\n            while (i < n) {\r\n                tmp = mro[i].prototype;\r\n                if (tmp.hasOwnProperty(jsName)) {\r\n                    res = tmp[jsName];\r\n                }\r\n\r\n                if (res !== undefined) {\r\n                    const f = res.tp$descr_get;\r\n                    if (f !== undefined) {\r\n                        /* Only pass 'obj' param if this is instance-mode super\r\n                               (See SF ID #743627)  */\r\n                        res = f.call(res, this.obj === starttype ? null : this.obj, starttype);\r\n                    }\r\n                    return res;\r\n                }\r\n                i++;\r\n            }\r\n        },\r\n        tp$descr_get(obj, obtype) {\r\n            if (obj === null || this.obj != null) {\r\n                return this;\r\n            }\r\n            if (this.ob$type !== Sk.builtin.super_) {\r\n                /* If su is an instance of a (strict) subclass of super,\r\n                call its type */\r\n                return Sk.misceval.callsimOrSuspendArray(this.ob$type, [this.type, obj]);\r\n            } else {\r\n                /* Inline the common case */\r\n                const obj_type = this.$supercheck(this.type, obj);\r\n                const newobj = new Sk.builtin.super_();\r\n                newobj.type = this.type;\r\n                newobj.obj = obj;\r\n                newobj.obj_type = obj_type;\r\n                return newobj;\r\n            }\r\n        },\r\n    },\r\n    getsets: {\r\n        __thisclass__: {\r\n            $get() {\r\n                return this.type;\r\n            },\r\n            $doc: \"the class invoking super()\",\r\n        },\r\n        __self__: {\r\n            $get() {\r\n                return this.obj || Sk.builtin.none.none$;\r\n            },\r\n            $doc: \"the instance invoking super(); may be None\",\r\n        },\r\n        __self_class__: {\r\n            $get() {\r\n                return this.obj_type || Sk.builtin.none.none$;\r\n            },\r\n            $doc: \"the type of the instance invoking super(); may be None\",\r\n        },\r\n    },\r\n    proto: {\r\n        $supercheck(type, obj) {\r\n            /* Check that a super() call makes sense.  Return a type object.\r\n\r\n            obj can be a class, or an instance of one:\r\n\r\n            - If it is a class, it must be a subclass of 'type'.      This case is\r\n                used for class methods; the return value is obj.\r\n\r\n            - If it is an instance, it must be an instance of 'type'.  This is\r\n                the normal case; the return value is obj.__class__.\r\n\r\n            /* Check for first bullet above (special case) */\r\n            if (Sk.builtin.checkClass(obj) && obj.$isSubType(type)) {\r\n                return obj;\r\n            }\r\n            /* Normal case */\r\n            if (obj.ob$type.$isSubType(type)) {\r\n                return obj.ob$type;\r\n            } else {\r\n                /* Try the slow way */\r\n                const class_attr = obj.tp$getattr(Sk.builtin.str.$class);\r\n                if (class_attr !== undefined && class_attr !== obj.ob$type && Sk.builtin.checkClass(class_attr)) {\r\n                    if (class_attr.$isSubType(type)) {\r\n                        return class_attr;\r\n                    }\r\n                }\r\n            }\r\n            throw new Sk.builtin.TypeError(\"super(type, obj): obj must be an instance or subtype of type\");\r\n        },\r\n    },\r\n});","/* Flags for def-use information */\r\n\r\nvar DEF_GLOBAL = 1;\r\n/* global stmt */\r\nvar DEF_LOCAL = 2;\r\n/* assignment in code block */\r\nvar DEF_PARAM = 2 << 1;\r\n/* formal parameter */\r\nvar USE = 2 << 2;\r\n/* name is used */\r\nvar DEF_STAR = 2 << 3;\r\n/* parameter is star arg */\r\nvar DEF_DOUBLESTAR = 2 << 4;\r\n/* parameter is star-star arg */\r\nvar DEF_INTUPLE = 2 << 5;\r\n/* name defined in tuple in parameters */\r\nvar DEF_FREE = 2 << 6;\r\n/* name used but not defined in nested block */\r\nvar DEF_FREE_GLOBAL = 2 << 7;\r\n/* free variable is actually implicit global */\r\nvar DEF_FREE_CLASS = 2 << 8;\r\n/* free variable from class's method */\r\nvar DEF_IMPORT = 2 << 9;\r\n/* assignment occurred via import */\r\nvar DEF_NONLOCAL = 2 << 10;\r\n/* nonlocal stmt */\r\nvar DEF_ANNOT = 2 << 11;\r\n/* this name is annotated */\r\n\r\nvar DEF_BOUND = (DEF_LOCAL | DEF_PARAM | DEF_IMPORT);\r\n\r\n/* GLOBAL_EXPLICIT and GLOBAL_IMPLICIT are used internally by the symbol\r\n table.  GLOBAL is returned from PyST_GetScope() for either of them.\r\n It is stored in ste_symbols at bits 12-14.\r\n */\r\nvar SCOPE_OFF = 11;\r\nvar SCOPE_MASK = 7;\r\n\r\nvar LOCAL = 1;\r\nvar GLOBAL_EXPLICIT = 2;\r\nvar GLOBAL_IMPLICIT = 3;\r\nvar FREE = 4;\r\nvar CELL = 5;\r\n\r\n/* The following three names are used for the ste_unoptimized bit field */\r\nvar OPT_IMPORT_STAR = 1;\r\nvar OPT_EXEC = 2;\r\nvar OPT_BARE_EXEC = 4;\r\nvar OPT_TOPLEVEL = 8;\r\n/* top-level names, including eval and exec */\r\n\r\nvar GENERATOR = 2;\r\nvar GENERATOR_EXPRESSION = 2;\r\n\r\nvar ModuleBlock = \"module\";\r\nvar FunctionBlock = \"function\";\r\nvar ClassBlock = \"class\";\r\n\r\nvar SYMTAB_CONSTS = {\r\n    DEF_GLOBAL: DEF_GLOBAL,\r\n    DEF_LOCAL: DEF_LOCAL,\r\n    DEF_PARAM: DEF_PARAM,\r\n    USE: USE,\r\n    DEF_STAR: DEF_STAR,\r\n    DEF_DOUBLESTAR: DEF_DOUBLESTAR,\r\n    DEF_INTUPLE: DEF_INTUPLE,\r\n    DEF_FREE: DEF_FREE,\r\n    DEF_FREE_GLOBAL: DEF_FREE_GLOBAL,\r\n    DEF_FREE_CLASS: DEF_FREE_CLASS,\r\n    DEF_IMPORT: DEF_IMPORT,\r\n    DEF_BOUND: DEF_BOUND,\r\n    SCOPE_OFF: SCOPE_OFF,\r\n    SCOPE_MASK: SCOPE_MASK,\r\n    LOCAL: LOCAL,\r\n    GLOBAL_EXPLICIT: GLOBAL_EXPLICIT,\r\n    GLOBAL_IMPLICIT: GLOBAL_IMPLICIT,\r\n    FREE: FREE,\r\n    CELL: CELL,\r\n    OPT_IMPORT_STAR: OPT_IMPORT_STAR,\r\n    OPT_EXEC: OPT_EXEC,\r\n    OPT_BARE_EXEC: OPT_BARE_EXEC,\r\n    OPT_TOPLEVEL: OPT_TOPLEVEL,\r\n    GENERATOR: GENERATOR,\r\n    GENERATOR_EXPRESSION: GENERATOR_EXPRESSION,\r\n    ModuleBlock: ModuleBlock,\r\n    FunctionBlock: FunctionBlock,\r\n    ClassBlock: ClassBlock\r\n};\r\n\r\nSk.exportSymbol(\"Sk.SYMTAB_CONSTS\", SYMTAB_CONSTS);\r\n\r\n/**\r\n * @constructor\r\n * @param {string} name\r\n * @param {number} flags\r\n * @param {Array.<SymbolTableScope>} namespaces\r\n */\r\nfunction Symbol_(name, flags, namespaces) {\r\n    this.__name = name;\r\n    this.__flags = flags;\r\n    this.__scope = (flags >> SCOPE_OFF) & SCOPE_MASK;\r\n    this.__namespaces = namespaces || [];\r\n}\r\n\r\nSymbol_.prototype.get_name = function () {\r\n    return this.__name;\r\n};\r\nSymbol_.prototype.is_referenced = function () {\r\n    return !!(this.__flags & USE);\r\n};\r\nSymbol_.prototype.is_parameter = function () {\r\n    return !!(this.__flags & DEF_PARAM);\r\n};\r\nSymbol_.prototype.is_global = function () {\r\n    return this.__scope === GLOBAL_IMPLICIT || this.__scope == GLOBAL_EXPLICIT;\r\n};\r\nSymbol_.prototype.is_declared_global = function () {\r\n    return this.__scope == GLOBAL_EXPLICIT;\r\n};\r\nSymbol_.prototype.is_local = function () {\r\n    return !!(this.__flags & DEF_BOUND);\r\n};\r\nSymbol_.prototype.is_free = function () {\r\n    return this.__scope == FREE;\r\n};\r\nSymbol_.prototype.is_imported = function () {\r\n    return !!(this.__flags & DEF_IMPORT);\r\n};\r\nSymbol_.prototype.is_assigned = function () {\r\n    return !!(this.__flags & DEF_LOCAL);\r\n};\r\nSymbol_.prototype.is_namespace = function () {\r\n    return this.__namespaces && this.__namespaces.length > 0;\r\n};\r\nSymbol_.prototype.get_namespaces = function () {\r\n    return this.__namespaces;\r\n};\r\n\r\nvar astScopeCounter = 0;\r\n\r\n/**\r\n * @constructor\r\n * @param {SymbolTable} table\r\n * @param {string} name\r\n * @param {string} type\r\n * @param {number} lineno\r\n */\r\nfunction SymbolTableScope(table, name, type, ast, lineno) {\r\n    this.symFlags = {};\r\n    this.name = name;\r\n    this.varnames = [];\r\n    this.children = [];\r\n    this.blockType = type;\r\n\r\n    this.isNested = false;\r\n    this.hasFree = false;\r\n    this.childHasFree = false;  // true if child block has free vars including free refs to globals\r\n    this.generator = false;\r\n    this.varargs = false;\r\n    this.varkeywords = false;\r\n    this.returnsValue = false;\r\n\r\n    this.lineno = lineno;\r\n\r\n    this.table = table;\r\n\r\n    if (table.cur && (table.cur.nested || table.cur.blockType === FunctionBlock)) {\r\n        this.isNested = true;\r\n    }\r\n\r\n    ast.scopeId = astScopeCounter++;\r\n    table.stss[ast.scopeId] = this;\r\n\r\n    // cache of Symbols for returning to other parts of code\r\n    this.symbols = {};\r\n}\r\n\r\nSymbolTableScope.prototype.get_type = function () {\r\n    return this.blockType;\r\n};\r\nSymbolTableScope.prototype.get_name = function () {\r\n    return this.name;\r\n};\r\nSymbolTableScope.prototype.get_lineno = function () {\r\n    return this.lineno;\r\n};\r\nSymbolTableScope.prototype.is_nested = function () {\r\n    return this.isNested;\r\n};\r\nSymbolTableScope.prototype.has_children = function () {\r\n    return this.children.length > 0;\r\n};\r\nSymbolTableScope.prototype.get_identifiers = function () {\r\n    return this._identsMatching(function () {\r\n        return true;\r\n    });\r\n};\r\nSymbolTableScope.prototype.lookup = function (name) {\r\n    var namespaces;\r\n    var flags;\r\n    var sym;\r\n    if (!this.symbols.hasOwnProperty(name)) {\r\n        flags = this.symFlags[name];\r\n        namespaces = this.__check_children(name);\r\n        sym = this.symbols[name] = new Symbol_(name, flags, namespaces);\r\n    } else {\r\n        sym = this.symbols[name];\r\n    }\r\n    return sym;\r\n};\r\nSymbolTableScope.prototype.__check_children = function (name) {\r\n    //print(\"  check_children:\", name);\r\n    var child;\r\n    var i;\r\n    var ret = [];\r\n    for (i = 0; i < this.children.length; ++i) {\r\n        child = this.children[i];\r\n        if (child.name === name) {\r\n            ret.push(child);\r\n        }\r\n    }\r\n    return ret;\r\n};\r\n\r\nSymbolTableScope.prototype._identsMatching = function (f) {\r\n    var k;\r\n    var ret = [];\r\n    for (k in this.symFlags) {\r\n        if (this.symFlags.hasOwnProperty(k)) {\r\n            if (f(this.symFlags[k])) {\r\n                ret.push(k);\r\n            }\r\n        }\r\n    }\r\n    ret.sort();\r\n    return ret;\r\n};\r\nSymbolTableScope.prototype.get_parameters = function () {\r\n    Sk.asserts.assert(this.get_type() == \"function\", \"get_parameters only valid for function scopes\");\r\n    if (!this._funcParams) {\r\n        this._funcParams = this._identsMatching(function (x) {\r\n            return x & DEF_PARAM;\r\n        });\r\n    }\r\n    return this._funcParams;\r\n};\r\nSymbolTableScope.prototype.get_locals = function () {\r\n    Sk.asserts.assert(this.get_type() == \"function\", \"get_locals only valid for function scopes\");\r\n    if (!this._funcLocals) {\r\n        this._funcLocals = this._identsMatching(function (x) {\r\n            return x & DEF_BOUND;\r\n        });\r\n    }\r\n    return this._funcLocals;\r\n};\r\nSymbolTableScope.prototype.get_globals = function () {\r\n    Sk.asserts.assert(this.get_type() == \"function\", \"get_globals only valid for function scopes\");\r\n    if (!this._funcGlobals) {\r\n        this._funcGlobals = this._identsMatching(function (x) {\r\n            var masked = (x >> SCOPE_OFF) & SCOPE_MASK;\r\n            return masked == GLOBAL_IMPLICIT || masked == GLOBAL_EXPLICIT;\r\n        });\r\n    }\r\n    return this._funcGlobals;\r\n};\r\nSymbolTableScope.prototype.get_frees = function () {\r\n    Sk.asserts.assert(this.get_type() == \"function\", \"get_frees only valid for function scopes\");\r\n    if (!this._funcFrees) {\r\n        this._funcFrees = this._identsMatching(function (x) {\r\n            var masked = (x >> SCOPE_OFF) & SCOPE_MASK;\r\n            return masked == FREE;\r\n        });\r\n    }\r\n    return this._funcFrees;\r\n};\r\nSymbolTableScope.prototype.get_methods = function () {\r\n    var i;\r\n    var all;\r\n    Sk.asserts.assert(this.get_type() == \"class\", \"get_methods only valid for class scopes\");\r\n    if (!this._classMethods) {\r\n        // todo; uniq?\r\n        all = [];\r\n        for (i = 0; i < this.children.length; ++i) {\r\n            all.push(this.children[i].name);\r\n        }\r\n        all.sort();\r\n        this._classMethods = all;\r\n    }\r\n    return this._classMethods;\r\n};\r\nSymbolTableScope.prototype.getScope = function (name) {\r\n    //print(\"getScope\");\r\n    //for (var k in this.symFlags) print(k);\r\n    var v = this.symFlags[name];\r\n    if (v === undefined) {\r\n        return 0;\r\n    }\r\n    return (v >> SCOPE_OFF) & SCOPE_MASK;\r\n};\r\n\r\n/**\r\n * @constructor\r\n * @param {string} filename\r\n */\r\nfunction SymbolTable(filename) {\r\n    this.filename = filename;\r\n    this.cur = null;\r\n    this.top = null;\r\n    this.stack = [];\r\n    this.global = null; // points at top level module symFlags\r\n    this.curClass = null; // current class or null\r\n    this.tmpname = 0;\r\n\r\n    // mapping from ast nodes to their scope if they have one. we add an\r\n    // id to the ast node when a scope is created for it, and store it in\r\n    // here for the compiler to lookup later.\r\n    this.stss = {};\r\n}\r\n\r\nSymbolTable.prototype.getStsForAst = function (ast) {\r\n    var v;\r\n    Sk.asserts.assert(ast.scopeId !== undefined, \"ast wasn't added to st?\");\r\n    v = this.stss[ast.scopeId];\r\n    Sk.asserts.assert(v !== undefined, \"unknown sym tab entry\");\r\n    return v;\r\n};\r\n\r\nSymbolTable.prototype.SEQStmt = function (nodes) {\r\n    var val;\r\n    var i;\r\n    var len;\r\n    if (nodes !== null) {\r\n        Sk.asserts.assert(Sk.isArrayLike(nodes), \"SEQ: nodes isn't array? got \" + nodes.toString());\r\n        len = nodes.length;\r\n        for (i = 0; i < len; ++i) {\r\n            val = nodes[i];\r\n            if (val) {\r\n                this.visitStmt(val);\r\n            }\r\n        }\r\n    }\r\n};\r\n\r\nSymbolTable.prototype.SEQExpr = function (nodes) {\r\n    var val;\r\n    var i;\r\n    var len;\r\n    if (nodes !== null) {\r\n        Sk.asserts.assert(Sk.isArrayLike(nodes), \"SEQ: nodes isn't array? got \" + nodes.toString());\r\n        len = nodes.length;\r\n        for (i = 0; i < len; ++i) {\r\n            val = nodes[i];\r\n            if (val) {\r\n                this.visitExpr(val);\r\n            }\r\n        }\r\n    }\r\n};\r\n\r\nSymbolTable.prototype.enterBlock = function (name, blockType, ast, lineno) {\r\n    var prev;\r\n    name = Sk.fixReserved(name);\r\n    //print(\"enterBlock:\", name);\r\n    prev = null;\r\n    if (this.cur) {\r\n        prev = this.cur;\r\n        this.stack.push(this.cur);\r\n    }\r\n    this.cur = new SymbolTableScope(this, name, blockType, ast, lineno);\r\n    if (name === \"top\") {\r\n        this.global = this.cur.symFlags;\r\n    }\r\n    if (prev) {\r\n        //print(\"    adding\", this.cur.name, \"to\", prev.name);\r\n        prev.children.push(this.cur);\r\n    }\r\n};\r\n\r\nSymbolTable.prototype.exitBlock = function () {\r\n    //print(\"exitBlock\");\r\n    this.cur = null;\r\n    if (this.stack.length > 0) {\r\n        this.cur = this.stack.pop();\r\n    }\r\n};\r\n\r\nSymbolTable.prototype.visitParams = function (args, toplevel, lineno) {\r\n    var arg;\r\n    var i;\r\n    for (i = 0; i < args.length; ++i) {\r\n        arg = args[i];\r\n        if (arg.constructor === Sk.astnodes.arg) {\r\n            // TODO arguments are more complicated in Python 3...\r\n            this.addDef(arg.arg, DEF_PARAM, lineno);\r\n        } else {\r\n            // Tuple isn't supported\r\n            throw new Sk.builtin.SyntaxError(\"invalid expression in parameter list\", this.filename, lineno);\r\n        }\r\n    }\r\n};\r\n\r\nSymbolTable.prototype.visitAnnotations = function (a, returns) {\r\n    if (a.posonlyargs) {\r\n        this.visitArgAnnotations(a.posonlyargs);\r\n    }\r\n    if (a.args) {\r\n        this.visitArgAnnotations(a.args);\r\n    }\r\n    if (a.vararg && a.vararg.annotation) {\r\n        this.visitExpr(a.vararg.annotation);\r\n    }\r\n    if (a.kwarg && a.kwarg.annotation) {\r\n        this.visitExpr(a.kwarg.annotation);\r\n    }\r\n    if (a.kwonlyargs) {\r\n        this.visitArgAnnotations(a.kwonlyargs);\r\n    }\r\n    if (returns) {\r\n        this.visitExpr(returns);\r\n    }\r\n};\r\n\r\nSymbolTable.prototype.visitArgAnnotations = function (args) {\r\n    for (let i = 0; i < args.length; i++) {\r\n        const arg = args[i];\r\n        if (arg.annotation) {\r\n            this.visitExpr(arg.annotation);\r\n        }\r\n    }\r\n};\r\n\r\nSymbolTable.prototype.visitArguments = function (a, lineno) {\r\n    if (a.args) {\r\n        this.visitParams(a.args, true, lineno);\r\n    }\r\n    if (a.kwonlyargs) {\r\n        this.visitParams(a.kwonlyargs, true, lineno);\r\n    }\r\n    if (a.vararg) {\r\n        this.addDef(a.vararg.arg, DEF_PARAM, lineno);\r\n        this.cur.varargs = true;\r\n    }\r\n    if (a.kwarg) {\r\n        this.addDef(a.kwarg.arg, DEF_PARAM, lineno);\r\n        this.cur.varkeywords = true;\r\n    }\r\n};\r\n\r\nSymbolTable.prototype.newTmpname = function (lineno) {\r\n    this.addDef(new Sk.builtin.str(\"_[\" + (++this.tmpname) + \"]\"), DEF_LOCAL, lineno);\r\n};\r\n\r\nSymbolTable.prototype.addDef = function (name, flag, lineno) {\r\n    var fromGlobal;\r\n    var val;\r\n    var mangled = Sk.mangleName(this.curClass, name).v;\r\n    mangled = Sk.fixReserved(mangled);\r\n    val = this.cur.symFlags[mangled];\r\n    if (val !== undefined) {\r\n        if ((flag & DEF_PARAM) && (val & DEF_PARAM)) {\r\n            throw new Sk.builtin.SyntaxError(\"duplicate argument '\" + name.v + \"' in function definition\", this.filename, lineno);\r\n        }\r\n        val |= flag;\r\n    } else {\r\n        val = flag;\r\n    }\r\n    this.cur.symFlags[mangled] = val;\r\n    if (flag & DEF_PARAM) {\r\n        this.cur.varnames.push(mangled);\r\n    } else if (flag & DEF_GLOBAL) {\r\n        val = flag;\r\n        fromGlobal = this.global[mangled];\r\n        if (fromGlobal !== undefined) {\r\n            val |= fromGlobal;\r\n        }\r\n        this.global[mangled] = val;\r\n    }\r\n};\r\n\r\nSymbolTable.prototype.visitSlice = function (s) {\r\n    var i;\r\n    switch (s.constructor) {\r\n        case Sk.astnodes.Slice:\r\n            if (s.lower) {\r\n                this.visitExpr(s.lower);\r\n            }\r\n            if (s.upper) {\r\n                this.visitExpr(s.upper);\r\n            }\r\n            if (s.step) {\r\n                this.visitExpr(s.step);\r\n            }\r\n            break;\r\n        case Sk.astnodes.ExtSlice:\r\n            for (i = 0; i < s.dims.length; ++i) {\r\n                this.visitSlice(s.dims[i]);\r\n            }\r\n            break;\r\n        case Sk.astnodes.Index:\r\n            this.visitExpr(s.value);\r\n            break;\r\n        case Sk.astnodes.Ellipsis:\r\n            break;\r\n    }\r\n};\r\n\r\nSymbolTable.prototype.visitStmt = function (s) {\r\n    var cur;\r\n    var name;\r\n    var i;\r\n    var nameslen;\r\n    var tmp;\r\n    var e_name;\r\n    Sk.asserts.assert(s !== undefined, \"visitStmt called with undefined\");\r\n    switch (s.constructor) {\r\n        case Sk.astnodes.FunctionDef:\r\n            this.addDef(s.name, DEF_LOCAL, s.lineno);\r\n            if (s.args.defaults) {\r\n                this.SEQExpr(s.args.defaults);\r\n            }\r\n            if (s.decorator_list) {\r\n                this.SEQExpr(s.decorator_list);\r\n            }\r\n            if (s.args.kw_defaults) {\r\n                this.SEQExpr(s.args.kw_defaults);\r\n            }\r\n            this.visitAnnotations(s.args, s.returns);\r\n            this.enterBlock(s.name.v, FunctionBlock, s, s.lineno);\r\n            this.visitArguments(s.args, s.lineno);\r\n            this.SEQStmt(s.body);\r\n            this.exitBlock();\r\n            break;\r\n        case Sk.astnodes.ClassDef:\r\n            this.addDef(s.name, DEF_LOCAL, s.lineno);\r\n            this.SEQExpr(s.bases);\r\n            if (s.decorator_list) {\r\n                this.SEQExpr(s.decorator_list);\r\n            }\r\n            this.enterBlock(s.name.v, ClassBlock, s, s.lineno);\r\n            tmp = this.curClass;\r\n            this.curClass = s.name;\r\n            this.SEQStmt(s.body);\r\n            this.exitBlock();\r\n            break;\r\n        case Sk.astnodes.Return:\r\n            if (s.value) {\r\n                this.visitExpr(s.value);\r\n                this.cur.returnsValue = true;\r\n                if (this.cur.generator) {\r\n                    throw new Sk.builtin.SyntaxError(\"'return' with argument inside generator\", this.filename, s.lineno);\r\n                }\r\n            }\r\n            break;\r\n        case Sk.astnodes.Delete:\r\n            this.SEQExpr(s.targets);\r\n            break;\r\n        case Sk.astnodes.Assign:\r\n            this.SEQExpr(s.targets);\r\n            this.visitExpr(s.value);\r\n            break;\r\n        case Sk.astnodes.AnnAssign:\r\n            if (s.target.constructor == Sk.astnodes.Name) {\r\n                e_name = s.target;\r\n                name = Sk.mangleName(this.curClass, e_name.id).v;\r\n                name = Sk.fixReserved(name);\r\n                cur = this.cur.symFlags[name];\r\n                if ((cur & (DEF_GLOBAL | DEF_NONLOCAL))\r\n                    && (this.global != this.cur.symFlags) // TODO\r\n                    && (s.simple)) {\r\n                    throw new Sk.builtin.SyntaxError(\"annotated name '\" + name + \"' can't be global\", this.filename, s.lineno);\r\n                }\r\n                if (s.simple) {\r\n                    this.addDef(new Sk.builtin.str(name), DEF_ANNOT | DEF_LOCAL, s.lineno);\r\n                } else if (s.value) {\r\n                    this.addDef(new Sk.builtin.str(name), DEF_LOCAL, s.lineno);\r\n                }\r\n            } else {\r\n                this.visitExpr(s.target);\r\n            }\r\n            this.visitExpr(s.annotation);\r\n            if (s.value) {\r\n                this.visitExpr(s.value);\r\n            }\r\n            break;\r\n        case Sk.astnodes.AugAssign:\r\n            this.visitExpr(s.target);\r\n            this.visitExpr(s.value);\r\n            break;\r\n        case Sk.astnodes.Print:\r\n            if (s.dest) {\r\n                this.visitExpr(s.dest);\r\n            }\r\n            this.SEQExpr(s.values);\r\n            break;\r\n        case Sk.astnodes.For:\r\n            this.visitExpr(s.target);\r\n            this.visitExpr(s.iter);\r\n            this.SEQStmt(s.body);\r\n            if (s.orelse) {\r\n                this.SEQStmt(s.orelse);\r\n            }\r\n            break;\r\n        case Sk.astnodes.While:\r\n            this.visitExpr(s.test);\r\n            this.SEQStmt(s.body);\r\n            if (s.orelse) {\r\n                this.SEQStmt(s.orelse);\r\n            }\r\n            break;\r\n        case Sk.astnodes.If:\r\n            this.visitExpr(s.test);\r\n            this.SEQStmt(s.body);\r\n            if (s.orelse) {\r\n                this.SEQStmt(s.orelse);\r\n            }\r\n            break;\r\n        case Sk.astnodes.Raise:\r\n            if (s.exc) {\r\n                this.visitExpr(s.exc);\r\n                // Our hacked AST supports both Python 2 (inst, tback)\r\n                // and Python 3 (cause) versions of the Raise statement\r\n                if (s.inst) {\r\n                    this.visitExpr(s.inst);\r\n                    if (s.tback) {\r\n                        this.visitExpr(s.tback);\r\n                    }\r\n                }\r\n                if (s.cause) {\r\n                    this.visitExpr(s.cause);\r\n                }\r\n            }\r\n            break;\r\n        case Sk.astnodes.Assert:\r\n            this.visitExpr(s.test);\r\n            if (s.msg) {\r\n                this.visitExpr(s.msg);\r\n            }\r\n            break;\r\n        case Sk.astnodes.Import:\r\n        case Sk.astnodes.ImportFrom:\r\n            this.visitAlias(s.names, s.lineno);\r\n            break;\r\n        case Sk.astnodes.Global:\r\n            nameslen = s.names.length;\r\n            for (i = 0; i < nameslen; ++i) {\r\n                name = Sk.mangleName(this.curClass, s.names[i]).v;\r\n                name = Sk.fixReserved(name);\r\n                cur = this.cur.symFlags[name];\r\n                if (cur & (DEF_LOCAL | USE)) {\r\n                    if (cur & DEF_LOCAL) {\r\n                        throw new Sk.builtin.SyntaxError(\"name '\" + name + \"' is assigned to before global declaration\", this.filename, s.lineno);\r\n                    } else {\r\n                        throw new Sk.builtin.SyntaxError(\"name '\" + name + \"' is used prior to global declaration\", this.filename, s.lineno);\r\n                    }\r\n                }\r\n                this.addDef(new Sk.builtin.str(name), DEF_GLOBAL, s.lineno);\r\n            }\r\n            break;\r\n        case Sk.astnodes.Expr:\r\n            this.visitExpr(s.value);\r\n            break;\r\n        case Sk.astnodes.Pass:\r\n        case Sk.astnodes.Break:\r\n        case Sk.astnodes.Continue:\r\n        case Sk.astnodes.Debugger:\r\n            // nothing\r\n            break;\r\n        case Sk.astnodes.With:\r\n            VISIT_SEQ(this.visit_withitem.bind(this), s.items);\r\n            VISIT_SEQ(this.visitStmt.bind(this), s.body);\r\n            break;\r\n\r\n        case Sk.astnodes.Try:\r\n            this.SEQStmt(s.body);\r\n            this.visitExcepthandlers(s.handlers);\r\n            this.SEQStmt(s.orelse);\r\n            this.SEQStmt(s.finalbody);\r\n            break;\r\n\r\n        default:\r\n            Sk.asserts.fail(\"Unhandled type \" + s.constructor.name + \" in visitStmt\");\r\n    }\r\n};\r\n\r\nSymbolTable.prototype.visit_withitem = function (item) {\r\n    this.visitExpr(item.context_expr);\r\n    if (item.optional_vars) {\r\n        this.visitExpr(item.optional_vars);\r\n    }\r\n};\r\n\r\n\r\nfunction VISIT_SEQ(visitFunc, seq) {\r\n    var i;\r\n    for (i = 0; i < seq.length; i++) {\r\n        var elt = seq[i];\r\n        visitFunc(elt);\r\n    }\r\n}\r\n\r\nSymbolTable.prototype.visitExpr = function (e) {\r\n    var i;\r\n    Sk.asserts.assert(e !== undefined, \"visitExpr called with undefined\");\r\n    // console.log(\"  e: \", e.constructor.name);\r\n    switch (e.constructor) {\r\n        case Sk.astnodes.BoolOp:\r\n            this.SEQExpr(e.values);\r\n            break;\r\n        case Sk.astnodes.BinOp:\r\n            this.visitExpr(e.left);\r\n            this.visitExpr(e.right);\r\n            break;\r\n        case Sk.astnodes.UnaryOp:\r\n            this.visitExpr(e.operand);\r\n            break;\r\n        case Sk.astnodes.Lambda:\r\n            this.addDef(new Sk.builtin.str(\"lambda\"), DEF_LOCAL, e.lineno);\r\n            if (e.args.defaults) {\r\n                this.SEQExpr(e.args.defaults);\r\n            }\r\n            this.enterBlock(\"lambda\", FunctionBlock, e, e.lineno);\r\n            this.visitArguments(e.args, e.lineno);\r\n            this.visitExpr(e.body);\r\n            this.exitBlock();\r\n            break;\r\n        case Sk.astnodes.IfExp:\r\n            this.visitExpr(e.test);\r\n            this.visitExpr(e.body);\r\n            this.visitExpr(e.orelse);\r\n            break;\r\n        case Sk.astnodes.Dict:\r\n            this.SEQExpr(e.keys);\r\n            this.SEQExpr(e.values);\r\n            break;\r\n        case Sk.astnodes.DictComp:\r\n            this.newTmpname(e.lineno);\r\n            this.visitExpr(e.key);\r\n            this.visitExpr(e.value);\r\n            this.visitComprehension(e.generators, 0);\r\n            break;\r\n        case Sk.astnodes.SetComp:\r\n            this.newTmpname(e.lineno);\r\n            this.visitExpr(e.elt);\r\n            this.visitComprehension(e.generators, 0);\r\n            break;\r\n        case Sk.astnodes.ListComp:\r\n            this.newTmpname(e.lineno);\r\n            this.visitExpr(e.elt);\r\n            this.visitComprehension(e.generators, 0);\r\n            break;\r\n        case Sk.astnodes.GeneratorExp:\r\n            this.visitGenexp(e);\r\n            break;\r\n        case Sk.astnodes.YieldFrom:\r\n        case Sk.astnodes.Yield:\r\n            if (e.value) {\r\n                this.visitExpr(e.value);\r\n            }\r\n            this.cur.generator = true;\r\n            if (this.cur.returnsValue) {\r\n                throw new Sk.builtin.SyntaxError(\"'return' with argument inside generator\", this.filename, e.lineno);\r\n            }\r\n            break;\r\n        case Sk.astnodes.Compare:\r\n            this.visitExpr(e.left);\r\n            this.SEQExpr(e.comparators);\r\n            break;\r\n        case Sk.astnodes.Call:\r\n            this.visitExpr(e.func);\r\n            if (e.args) {\r\n                for (let a of e.args) {\r\n                    if (a.constructor === Sk.astnodes.Starred) {\r\n                        this.visitExpr(a.value);\r\n                    } else {\r\n                        this.visitExpr(a);\r\n                    }\r\n                }\r\n            }\r\n            if (e.keywords) {\r\n                for (let k of e.keywords) {\r\n                    this.visitExpr(k.value);\r\n                }\r\n            }\r\n            break;\r\n        case Sk.astnodes.Num:\r\n        case Sk.astnodes.Str:\r\n        case Sk.astnodes.Bytes:\r\n            break;\r\n        case Sk.astnodes.JoinedStr:\r\n            for (let s of e.values) {\r\n                this.visitExpr(s);\r\n            }\r\n            break;\r\n        case Sk.astnodes.FormattedValue:\r\n            this.visitExpr(e.value);\r\n            if (e.format_spec) {\r\n                this.visitExpr(e.format_spec);\r\n            }\r\n            break;\r\n        case Sk.astnodes.Attribute:\r\n            this.visitExpr(e.value);\r\n            break;\r\n        case Sk.astnodes.Subscript:\r\n            this.visitExpr(e.value);\r\n            this.visitSlice(e.slice);\r\n            break;\r\n        case Sk.astnodes.Name:\r\n            this.addDef(e.id, e.ctx === Sk.astnodes.Load ? USE : DEF_LOCAL, e.lineno);\r\n            break;\r\n        case Sk.astnodes.NameConstant:\r\n            break;\r\n        case Sk.astnodes.List:\r\n        case Sk.astnodes.Tuple:\r\n        case Sk.astnodes.Set:\r\n            this.SEQExpr(e.elts);\r\n            break;\r\n        case Sk.astnodes.Starred:\r\n            this.visitExpr(e.value);\r\n            break;\r\n        case Sk.astnodes.Ellipsis:\r\n            break;\r\n        default:\r\n            Sk.asserts.fail(\"Unhandled type \" + e.constructor.name + \" in visitExpr\");\r\n    }\r\n};\r\n\r\nSymbolTable.prototype.visitComprehension = function (lcs, startAt) {\r\n    var lc;\r\n    var i;\r\n    var len = lcs.length;\r\n    for (i = startAt; i < len; ++i) {\r\n        lc = lcs[i];\r\n        this.visitExpr(lc.target);\r\n        this.visitExpr(lc.iter);\r\n        this.SEQExpr(lc.ifs);\r\n    }\r\n};\r\n\r\nSymbolTable.prototype.visitAlias = function (names, lineno) {\r\n    /* Compute store_name, the name actually bound by the import\r\n     operation.  It is diferent than a->name when a->name is a\r\n     dotted package name (e.g. spam.eggs)\r\n     */\r\n    var dot;\r\n    var storename;\r\n    var name;\r\n    var a;\r\n    var i;\r\n    for (i = 0; i < names.length; ++i) {\r\n        a = names[i];\r\n        name = a.asname === null ? a.name.v : a.asname.v;\r\n        storename = name;\r\n        dot = name.indexOf(\".\");\r\n        if (dot !== -1) {\r\n            storename = name.substr(0, dot);\r\n        }\r\n        if (name !== \"*\") {\r\n            this.addDef(new Sk.builtin.str(storename), DEF_IMPORT, lineno);\r\n        } else {\r\n            if (this.cur.blockType !== ModuleBlock) {\r\n                throw new Sk.builtin.SyntaxError(\"import * only allowed at module level\", this.filename, lineno);\r\n            }\r\n        }\r\n    }\r\n};\r\n\r\nSymbolTable.prototype.visitGenexp = function (e) {\r\n    var outermost = e.generators[0];\r\n    // outermost is evaled in current scope\r\n    this.visitExpr(outermost.iter);\r\n    this.enterBlock(\"genexpr\", FunctionBlock, e, e.lineno);\r\n    this.cur.generator = true;\r\n    this.addDef(new Sk.builtin.str(\".0\"), DEF_PARAM, e.lineno);\r\n    this.visitExpr(outermost.target);\r\n    this.SEQExpr(outermost.ifs);\r\n    this.visitComprehension(e.generators, 1);\r\n    this.visitExpr(e.elt);\r\n    this.exitBlock();\r\n};\r\n\r\nSymbolTable.prototype.visitExcepthandlers = function (handlers) {\r\n    var i, eh;\r\n    for (i = 0; eh = handlers[i]; ++i) {\r\n        if (eh.type) {\r\n            this.visitExpr(eh.type);\r\n        }\r\n        if (eh.name) {\r\n            this.visitExpr(eh.name);\r\n        }\r\n        this.SEQStmt(eh.body);\r\n    }\r\n};\r\n\r\nfunction _dictUpdate(a, b) {\r\n    var kb;\r\n    for (kb in b) {\r\n        a[kb] = b[kb];\r\n    }\r\n}\r\n\r\nSymbolTable.prototype.analyzeBlock = function (ste, bound, free, global) {\r\n    var c;\r\n    var i;\r\n    var childlen;\r\n    var allfree;\r\n    var flags;\r\n    var name;\r\n    var local = {};\r\n    var scope = {};\r\n    var newglobal = {};\r\n    var newbound = {};\r\n    var newfree = {};\r\n\r\n    if (ste.blockType == ClassBlock) {\r\n        _dictUpdate(newglobal, global);\r\n        if (bound) {\r\n            _dictUpdate(newbound, bound);\r\n        }\r\n    }\r\n\r\n    for (name in ste.symFlags) {\r\n        flags = ste.symFlags[name];\r\n        this.analyzeName(ste, scope, name, flags, bound, local, free, global);\r\n    }\r\n\r\n    if (ste.blockType !== ClassBlock) {\r\n        if (ste.blockType === FunctionBlock) {\r\n            _dictUpdate(newbound, local);\r\n        }\r\n        if (bound) {\r\n            _dictUpdate(newbound, bound);\r\n        }\r\n        _dictUpdate(newglobal, global);\r\n    }\r\n\r\n    allfree = {};\r\n    childlen = ste.children.length;\r\n    for (i = 0; i < childlen; ++i) {\r\n        c = ste.children[i];\r\n        this.analyzeChildBlock(c, newbound, newfree, newglobal, allfree);\r\n        if (c.hasFree || c.childHasFree) {\r\n            ste.childHasFree = true;\r\n        }\r\n    }\r\n\r\n    _dictUpdate(newfree, allfree);\r\n    if (ste.blockType === FunctionBlock) {\r\n        this.analyzeCells(scope, newfree);\r\n    }\r\n    let discoveredFree = this.updateSymbols(ste.symFlags, scope, bound, newfree, ste.blockType === ClassBlock);\r\n    ste.hasFree = ste.hasFree || discoveredFree;\r\n\r\n    _dictUpdate(free, newfree);\r\n};\r\n\r\nSymbolTable.prototype.analyzeChildBlock = function (entry, bound, free, global, childFree) {\r\n    var tempGlobal;\r\n    var tempFree;\r\n    var tempBound = {};\r\n    _dictUpdate(tempBound, bound);\r\n    tempFree = {};\r\n    _dictUpdate(tempFree, free);\r\n    tempGlobal = {};\r\n    _dictUpdate(tempGlobal, global);\r\n\r\n    this.analyzeBlock(entry, tempBound, tempFree, tempGlobal);\r\n    _dictUpdate(childFree, tempFree);\r\n};\r\n\r\nSymbolTable.prototype.analyzeCells = function (scope, free) {\r\n    var flags;\r\n    var name;\r\n    for (name in scope) {\r\n        flags = scope[name];\r\n        if (flags !== LOCAL) {\r\n            continue;\r\n        }\r\n        if (free[name] === undefined) {\r\n            continue;\r\n        }\r\n        scope[name] = CELL;\r\n        delete free[name];\r\n    }\r\n};\r\n\r\n/**\r\n * store scope info back into the st symbols dict. symbols is modified,\r\n * others are not.\r\n */\r\nSymbolTable.prototype.updateSymbols = function (symbols, scope, bound, free, classflag) {\r\n    var i;\r\n    var o;\r\n    var pos;\r\n    var freeValue;\r\n    var w;\r\n    var flags;\r\n    var name;\r\n    var discoveredFree = false;\r\n    for (name in symbols) {\r\n        flags = symbols[name];\r\n        w = scope[name];\r\n        flags |= w << SCOPE_OFF;\r\n        symbols[name] = flags;\r\n    }\r\n\r\n    freeValue = FREE << SCOPE_OFF;\r\n    pos = 0;\r\n    for (name in free) {\r\n        o = symbols[name];\r\n        if (o !== undefined) {\r\n            // it could be a free variable in a method of the class that has\r\n            // the same name as a local or global in the class scope\r\n            if (classflag && (o & (DEF_BOUND | DEF_GLOBAL))) {\r\n                i = o | DEF_FREE_CLASS;\r\n                symbols[name] = i;\r\n            }\r\n            // else it's not free, probably a cell\r\n            continue;\r\n        }\r\n        if (bound[name] === undefined) {\r\n            continue;\r\n        }\r\n        symbols[name] = freeValue;\r\n        discoveredFree = true;\r\n    }\r\n    return discoveredFree;\r\n};\r\n\r\nSymbolTable.prototype.analyzeName = function (ste, dict, name, flags, bound, local, free, global) {\r\n    if (flags & DEF_GLOBAL) {\r\n        if (flags & DEF_PARAM) {\r\n            throw new Sk.builtin.SyntaxError(\"name '\" + name + \"' is local and global\", this.filename, ste.lineno);\r\n        }\r\n        dict[name] = GLOBAL_EXPLICIT;\r\n        global[name] = null;\r\n        if (bound && bound[name] !== undefined) {\r\n            delete bound[name];\r\n        }\r\n        return;\r\n    }\r\n    if (flags & DEF_BOUND) {\r\n        dict[name] = LOCAL;\r\n        local[name] = null;\r\n        delete global[name];\r\n        return;\r\n    }\r\n\r\n    if (bound && bound[name] !== undefined) {\r\n        dict[name] = FREE;\r\n        ste.hasFree = true;\r\n        free[name] = null;\r\n    } else if (global && global[name] !== undefined) {\r\n        dict[name] = GLOBAL_IMPLICIT;\r\n    } else {\r\n        if (ste.isNested) {\r\n            ste.hasFree = true;\r\n        }\r\n        dict[name] = GLOBAL_IMPLICIT;\r\n    }\r\n};\r\n\r\nSymbolTable.prototype.analyze = function () {\r\n    var free = {};\r\n    var global = {};\r\n    this.analyzeBlock(this.top, null, free, global);\r\n};\r\n\r\n/**\r\n * @param {Object} ast\r\n * @param {string} filename\r\n */\r\nSk.symboltable = function (ast, filename) {\r\n    var i;\r\n    var ret = new SymbolTable(filename);\r\n\r\n    ret.enterBlock(\"top\", ModuleBlock, ast, 0);\r\n    ret.top = ret.cur;\r\n\r\n    //print(Sk.astDump(ast));\r\n    for (i = 0; i < ast.body.length; ++i) {\r\n        ret.visitStmt(ast.body[i]);\r\n    }\r\n\r\n    ret.exitBlock();\r\n\r\n    ret.analyze();\r\n\r\n    return ret;\r\n};\r\n\r\nSk.dumpSymtab = function (st) {\r\n    var pyBoolStr = function (b) {\r\n        return b ? \"True\" : \"False\";\r\n    };\r\n    var pyList = function (l) {\r\n        var i;\r\n        var ret = [];\r\n        for (i = 0; i < l.length; ++i) {\r\n            ret.push(new Sk.builtin.str(l[i])[\"$r\"]().v);\r\n        }\r\n        return \"[\" + ret.join(\", \") + \"]\";\r\n    };\r\n    var getIdents = function (obj, indent) {\r\n        var ns;\r\n        var j;\r\n        var sub;\r\n        var nsslen;\r\n        var nss;\r\n        var info;\r\n        var i;\r\n        var objidentslen;\r\n        var objidents;\r\n        var ret;\r\n        if (indent === undefined) {\r\n            indent = \"\";\r\n        }\r\n        ret = \"\";\r\n        ret += indent + \"Sym_type: \" + obj.get_type() + \"\\n\";\r\n        ret += indent + \"Sym_name: \" + obj.get_name() + \"\\n\";\r\n        ret += indent + \"Sym_lineno: \" + obj.get_lineno() + \"\\n\";\r\n        ret += indent + \"Sym_nested: \" + pyBoolStr(obj.is_nested()) + \"\\n\";\r\n        ret += indent + \"Sym_haschildren: \" + pyBoolStr(obj.has_children()) + \"\\n\";\r\n        if (obj.get_type() === \"class\") {\r\n            ret += indent + \"Class_methods: \" + pyList(obj.get_methods()) + \"\\n\";\r\n        } else if (obj.get_type() === \"function\") {\r\n            ret += indent + \"Func_params: \" + pyList(obj.get_parameters()) + \"\\n\";\r\n            ret += indent + \"Func_locals: \" + pyList(obj.get_locals()) + \"\\n\";\r\n            ret += indent + \"Func_globals: \" + pyList(obj.get_globals()) + \"\\n\";\r\n            ret += indent + \"Func_frees: \" + pyList(obj.get_frees()) + \"\\n\";\r\n        }\r\n        ret += indent + \"-- Identifiers --\\n\";\r\n        objidents = obj.get_identifiers();\r\n        objidentslen = objidents.length;\r\n        for (i = 0; i < objidentslen; ++i) {\r\n            info = obj.lookup(objidents[i]);\r\n            ret += indent + \"name: \" + info.get_name() + \"\\n\";\r\n            ret += indent + \"  is_referenced: \" + pyBoolStr(info.is_referenced()) + \"\\n\";\r\n            ret += indent + \"  is_imported: \" + pyBoolStr(info.is_imported()) + \"\\n\";\r\n            ret += indent + \"  is_parameter: \" + pyBoolStr(info.is_parameter()) + \"\\n\";\r\n            ret += indent + \"  is_global: \" + pyBoolStr(info.is_global()) + \"\\n\";\r\n            ret += indent + \"  is_declared_global: \" + pyBoolStr(info.is_declared_global()) + \"\\n\";\r\n            ret += indent + \"  is_local: \" + pyBoolStr(info.is_local()) + \"\\n\";\r\n            ret += indent + \"  is_free: \" + pyBoolStr(info.is_free()) + \"\\n\";\r\n            ret += indent + \"  is_assigned: \" + pyBoolStr(info.is_assigned()) + \"\\n\";\r\n            ret += indent + \"  is_namespace: \" + pyBoolStr(info.is_namespace()) + \"\\n\";\r\n            nss = info.get_namespaces();\r\n            nsslen = nss.length;\r\n            ret += indent + \"  namespaces: [\\n\";\r\n            sub = [];\r\n            for (j = 0; j < nsslen; ++j) {\r\n                ns = nss[j];\r\n                sub.push(getIdents(ns, indent + \"    \"));\r\n            }\r\n            ret += sub.join(\"\\n\");\r\n            ret += indent + \"  ]\\n\";\r\n        }\r\n        return ret;\r\n    };\r\n    return getIdents(st.top, \"\");\r\n};\r\n\r\nSk.exportSymbol(\"Sk.symboltable\", Sk.symboltable);\r\nSk.exportSymbol(\"Sk.dumpSymtab\", Sk.dumpSymtab);\r\n","/**\r\n * @constructor\r\n * @param {Sk.builtin.list=} list\r\n * @param {number=} length optional\r\n * @extends Sk.builtin.object\r\n */\r\nSk.builtin.timSort = function (list, length) {\r\n    this.list = new Sk.builtin.list(list.v);\r\n    // When we get into galloping mode, we stay there until both runs win less\r\n    // often than MIN_GALLOP consecutive times.  See listsort.txt for more info.\r\n    this.MIN_GALLOP = 7;\r\n    if (length) {\r\n        this.listlength = length;\r\n    } else {\r\n        this.listlength = list.sq$length();\r\n    }\r\n};\r\n\r\nSk.builtin.timSort.prototype.lt = function (a, b) {\r\n    return Sk.misceval.richCompareBool(a, b, \"Lt\");\r\n};\r\n\r\nSk.builtin.timSort.prototype.le = function (a, b) {\r\n    return !this.lt(b, a);\r\n};\r\n\r\nSk.builtin.timSort.prototype.setitem = function (item, value) {\r\n    this.list.v[item] = value;\r\n};\r\n\r\n/*\r\n # binarysort is the best method for sorting small arrays: it does\r\n # few compares, but can do data movement quadratic in the number of\r\n # elements.\r\n # \"a\" is a contiguous slice of a list, and is sorted via binary insertion.\r\n # This sort is stable.\r\n # On entry, the first \"sorted\" elements are already sorted.\r\n # Even in case of error, the output slice will be some permutation of\r\n # the input (nothing is lost or duplicated)\r\n */\r\nSk.builtin.timSort.prototype.binary_sort = function (a, sorted) {\r\n    var pivot;\r\n    var p;\r\n    var r;\r\n    var l;\r\n    var start;\r\n    for (start = a.base + sorted; start < a.base + a.len; start++) {\r\n        l = a.base;\r\n        r = start;\r\n        pivot = a.getitem(r);\r\n        // Invariants:\r\n        // pivot >= all in [base, l).\r\n        // pivot  < all in [r, start).\r\n        // The second is vacuously true at the start.\r\n        while (l < r) {\r\n            p = l + ((r - l) >> 1);\r\n            if (this.lt(pivot, a.getitem(p))) {\r\n                r = p;\r\n            } else {\r\n                l = p + 1;\r\n            }\r\n        }\r\n        Sk.asserts.assert(l === r);\r\n        // The invariants still hold, so pivot >= all in [base, l) and\r\n        // pivot < all in [l, start), so pivot belongs at l.  Note\r\n        // that if there are elements equal to pivot, l points to the\r\n        // first slot after them -- that's why this sort is stable.\r\n        // Slide over to make room.\r\n        for (p = start; p > l; p--) {\r\n            a.setitem(p, a.getitem(p - 1));\r\n        }\r\n        a.setitem(l, pivot);\r\n    }\r\n};\r\n\r\nSk.builtin.timSort.prototype.count_run = function (a) {\r\n    /*\r\n     # Compute the length of the run in the slice \"a\".\r\n     # \"A run\" is the longest ascending sequence, with\r\n     #\r\n     #     a[0] <= a[1] <= a[2] <= ...\r\n     #\r\n     # or the longest descending sequence, with\r\n     #\r\n     #     a[0] > a[1] > a[2] > ...\r\n     #\r\n     # Return (run, descending) where descending is False in the former case,\r\n     # or True in the latter.\r\n     # For its intended use in a stable mergesort, the strictness of the defn of\r\n     # \"descending\" is needed so that the caller can safely reverse a descending\r\n     # sequence without violating stability (strict > ensures there are no equal\r\n     # elements to get out of order).\r\n     */\r\n    var n;\r\n    var p;\r\n    var descending;\r\n    if (a.len <= 1) {\r\n        n = a.len;\r\n        descending = false;\r\n    } else {\r\n        n = 2;\r\n        if (this.lt(a.getitem(a.base + 1), a.getitem(a.base))) {\r\n            descending = true;\r\n            for (p = a.base + 2; p < a.base + a.len; p++) {\r\n                if (this.lt(a.getitem(p), a.getitem(p - 1))) {\r\n                    n++;\r\n                } else {\r\n                    break;\r\n                }\r\n            }\r\n        } else {\r\n            descending = false;\r\n            for (p = a.base + 2; p < a.base + a.len; p++) {\r\n                if (this.lt(a.getitem(p), a.getitem(p - 1))) {\r\n                    break;\r\n                } else {\r\n                    n++;\r\n                }\r\n            }\r\n        }\r\n    }\r\n    return {\"run\": new Sk.builtin.listSlice(a.list, a.base, n), \"descending\": descending};\r\n};\r\n\r\nSk.builtin.timSort.prototype.sort = function () {\r\n    /*\r\n     # ____________________________________________________________\r\n     # Entry point.\r\n     */\r\n\r\n    var minrun;\r\n    var cr;\r\n    var sorted;\r\n    var remaining = new Sk.builtin.listSlice(this.list, 0, this.listlength);\r\n    if (remaining.len < 2) {\r\n        return;\r\n    }\r\n\r\n    // March over the array once, left to right, finding natural runs,\r\n    // and extending short natural runs to minrun elements.\r\n    this.merge_init();\r\n    minrun = this.merge_compute_minrun(remaining.len);\r\n    while (remaining.len > 0) {\r\n        // Identify next run.\r\n        cr = this.count_run(remaining);\r\n        if (cr.descending) {\r\n            cr.run.reverse();\r\n        }\r\n        // If short, extend to min(minrun, nremaining).\r\n        if (cr.run.len < minrun) {\r\n            sorted = cr.run.len;\r\n            if (minrun < remaining.len) {\r\n                cr.run.len = minrun;\r\n            } else {\r\n                cr.run.len = remaining.len;\r\n            }\r\n            this.binary_sort(cr.run, sorted);\r\n        }\r\n        // Advance remaining past this run.\r\n        remaining.advance(cr.run.len);\r\n        // Push run onto pending-runs stack, and maybe merge.\r\n        this.pending.push(cr.run);\r\n        this.merge_collapse();\r\n    }\r\n    Sk.asserts.assert(remaining.base == this.listlength);\r\n\r\n    this.merge_force_collapse();\r\n    Sk.asserts.assert(this.pending.length == 1);\r\n    Sk.asserts.assert(this.pending[0].base === 0);\r\n    Sk.asserts.assert(this.pending[0].len == this.listlength);\r\n};\r\n\r\n/*\r\n # Locate the proper position of key in a sorted vector; if the vector\r\n # contains an element equal to key, return the position immediately to the\r\n # left of the leftmost equal element -- or to the right of the rightmost\r\n # equal element if the flag \"rightmost\" is set.\r\n #\r\n # \"hint\" is an index at which to begin the search, 0 <= hint < a.len.\r\n # The closer hint is to the final result, the faster this runs.\r\n #\r\n # The return value is the index 0 <= k <= a.len such that\r\n #\r\n #     a[k-1] < key <= a[k]      (if rightmost is False)\r\n #     a[k-1] <= key < a[k]      (if rightmost is True)\r\n #\r\n # as long as the indices are in bound.  IOW, key belongs at index k;\r\n # or, IOW, the first k elements of a should precede key, and the last\r\n # n-k should follow key.\r\n */\r\nSk.builtin.timSort.prototype.gallop = function (key, a, hint, rightmost) {\r\n    var lower;\r\n    var self;\r\n    var p;\r\n    var lastofs;\r\n    var ofs;\r\n    var maxofs;\r\n    var hintminofs;\r\n    var hintminlastofs;\r\n    var m;\r\n    Sk.asserts.assert(0 <= hint && hint < a.len);\r\n    self = this;\r\n    if (rightmost) {\r\n        lower = function (a, b) {\r\n            return self.le(a, b);\r\n        }; // search for the largest k for which a[k] <= key\r\n    } else {\r\n        lower = function (a, b) {\r\n            return self.lt(a, b);\r\n        }; // search for the largest k for which a[k] < key\r\n    }\r\n    p = a.base + hint;\r\n    lastofs = 0;\r\n    ofs = 1;\r\n    if (lower(a.getitem(p), key)) {\r\n        // a[hint] < key -- gallop right, until\r\n        // a[hint + lastofs] < key <= a[hint + ofs]\r\n\r\n        maxofs = a.len - hint; // a[a.len-1] is highest\r\n        while (ofs < maxofs) {\r\n            if (lower(a.getitem(p + ofs), key)) {\r\n                lastofs = ofs;\r\n                try {\r\n                    ofs = (ofs << 1) + 1;\r\n                } catch (err) {\r\n                    ofs = maxofs;\r\n                }\r\n            } else {\r\n                // key <= a[hint + ofs]\r\n                break;\r\n            }\r\n        }\r\n        if (ofs > maxofs) {\r\n            ofs = maxofs;\r\n        }\r\n        // Translate back to offsets relative to a.\r\n        lastofs += hint;\r\n        ofs += hint;\r\n    } else {\r\n        // key <= a[hint] -- gallop left, until\r\n        // a[hint - ofs] < key <= a[hint - lastofs]\r\n        maxofs = hint + 1;   // a[0] is lowest\r\n        while (ofs < maxofs) {\r\n            if (lower(a.getitem(p - ofs), key)) {\r\n                break;\r\n            } else {\r\n                // key <= a[hint - ofs]\r\n                lastofs = ofs;\r\n                try {\r\n                    ofs = (ofs << 1) + 1;\r\n                } catch (err) {\r\n                    ofs = maxofs;\r\n                }\r\n            }\r\n        }\r\n        if (ofs > maxofs) {\r\n            ofs = maxofs;\r\n        }\r\n        // Translate back to positive offsets relative to a.\r\n        hintminofs = hint - ofs;\r\n        hintminlastofs = hint - lastofs;\r\n        lastofs = hintminofs;\r\n        ofs = hintminlastofs;\r\n    }\r\n    Sk.asserts.assert(-1 <= lastofs < ofs <= a.len);\r\n\r\n    // Now a[lastofs] < key <= a[ofs], so key belongs somewhere to the\r\n    // right of lastofs but no farther right than ofs.  Do a binary\r\n    // search, with invariant a[lastofs-1] < key <= a[ofs].\r\n\r\n    lastofs += 1;\r\n    while (lastofs < ofs) {\r\n        m = lastofs + ((ofs - lastofs) >> 1);\r\n        if (lower(a.getitem(a.base + m), key)) {\r\n            lastofs = m + 1;   // a[m] < key\r\n        } else {\r\n            ofs = m;         // key <= a[m]\r\n        }\r\n    }\r\n    Sk.asserts.assert(lastofs == ofs);         // so a[ofs-1] < key <= a[ofs]\r\n    return ofs;\r\n};\r\n\r\n// ____________________________________________________________\r\n\r\nSk.builtin.timSort.prototype.merge_init = function () {\r\n    // This controls when we get *into* galloping mode.  It's initialized\r\n    // to MIN_GALLOP.  merge_lo and merge_hi tend to nudge it higher for\r\n    // random data, and lower for highly structured data.\r\n    this.min_gallop = this.MIN_GALLOP;\r\n\r\n    // A stack of n pending runs yet to be merged.  Run #i starts at\r\n    // address pending[i].base and extends for pending[i].len elements.\r\n    // It's always true (so long as the indices are in bounds) that\r\n    //\r\n    //     pending[i].base + pending[i].len == pending[i+1].base\r\n    //\r\n    // so we could cut the storage for this, but it's a minor amount,\r\n    // and keeping all the info explicit simplifies the code.\r\n    this.pending = [];\r\n};\r\n\r\n// Merge the slice \"a\" with the slice \"b\" in a stable way, in-place.\r\n// a.len <= b.len.  See listsort.txt for more info.\r\n// a.len and b.len must be > 0, and a.base + a.len == b.base.\r\n// Must also have that b.list[b.base] < a.list[a.base], that\r\n// a.list[a.base+a.len-1] belongs at the end of the merge, and should have\r\n\r\nSk.builtin.timSort.prototype.merge_lo = function (a, b) {\r\n    var min_gallop;\r\n    var dest;\r\n    var acount, bcount;\r\n    var p;\r\n    Sk.asserts.assert(a.len > 0 && b.len > 0 && a.base + a.len == b.base);\r\n    min_gallop = this.min_gallop;\r\n    dest = a.base;\r\n    a = a.copyitems();\r\n\r\n    // Invariant: elements in \"a\" are waiting to be reinserted into the list\r\n    // at \"dest\".  They should be merged with the elements of \"b\".\r\n    // b.base == dest + a.len.\r\n    // We use a finally block to ensure that the elements remaining in\r\n    // the copy \"a\" are reinserted back into this.list in all cases.\r\n    try {\r\n        this.setitem(dest, b.popleft());\r\n\r\n        dest++;\r\n        if (a.len == 1 || b.len === 0) {\r\n            return;\r\n        }\r\n\r\n        while (true) {\r\n            acount = 0;   // number of times A won in a row\r\n            bcount = 0;   // number of times B won in a row\r\n\r\n            // Do the straightforward thing until (if ever) one run\r\n            // appears to win consistently.\r\n            while (true) {\r\n                if (this.lt(b.getitem(b.base), a.getitem(a.base))) {\r\n                    this.setitem(dest, b.popleft());\r\n                    dest++;\r\n                    if (b.len === 0) {\r\n                        return;\r\n                    }\r\n                    bcount++;\r\n                    acount = 0;\r\n                    if (bcount >= min_gallop) {\r\n                        break;\r\n                    }\r\n                } else {\r\n                    this.setitem(dest, a.popleft());\r\n                    dest++;\r\n                    if (a.len == 1) {\r\n                        return;\r\n                    }\r\n                    acount++;\r\n                    bcount = 0;\r\n                    if (acount >= min_gallop) {\r\n                        break;\r\n                    }\r\n                }\r\n            }\r\n\r\n            // One run is winning so consistently that galloping may\r\n            // be a huge win.  So try that, and continue galloping until\r\n            // (if ever) neither run appears to be winning consistently\r\n            // anymore.\r\n            min_gallop += 1;\r\n\r\n            while (true) {\r\n                min_gallop -= min_gallop > 1;\r\n                this.min_gallop = min_gallop;\r\n                acount = this.gallop(b.getitem(b.base), a, 0, true);\r\n                for (p = a.base; p < a.base + acount; p++) {\r\n                    this.setitem(dest, a.getitem(p));\r\n                    dest++;\r\n                }\r\n\r\n                a.advance(acount);\r\n\r\n                if (a.len <= 1) {\r\n                    return;\r\n                }\r\n\r\n                this.setitem(dest, b.popleft());\r\n                dest++;\r\n\r\n                // a.len==0 is impossible now if the comparison\r\n                // function is consistent, but we can't assume\r\n                // that it is.\r\n                if (b.len === 0) {\r\n                    return;\r\n                }\r\n\r\n                bcount = this.gallop(a.getitem(a.base), b, 0, false);\r\n\r\n                for (p = b.base; p < b.base + bcount; p++) {\r\n                    this.setitem(dest, b.getitem(p));\r\n                    dest++;\r\n                }\r\n\r\n                b.advance(bcount);\r\n                if (b.len === 0) {\r\n                    return;\r\n                }\r\n                this.setitem(dest, a.popleft());\r\n                dest++;\r\n\r\n                if (a.len == 1) {\r\n                    return;\r\n                }\r\n\r\n                if (acount < this.MIN_GALLOP && bcount < this.MIN_GALLOP) {\r\n                    break;\r\n                }\r\n\r\n                min_gallop++;  // penalize it for leaving galloping mode\r\n                this.min_gallop = min_gallop;\r\n            }\r\n        }\r\n    } finally {\r\n        // The last element of a belongs at the end of the merge, so we copy\r\n        // the remaining elements of b before the remaining elements of a.\r\n        Sk.asserts.assert(a.len >= 0 && b.len >= 0);\r\n        for (p = b.base; p < b.base + b.len; p++) {\r\n            this.setitem(dest, b.getitem(p));\r\n            dest++;\r\n        }\r\n        for (p = a.base; p < a.base + a.len; p++) {\r\n            this.setitem(dest, a.getitem(p));\r\n            dest++;\r\n        }\r\n    }\r\n};\r\n\r\nSk.builtin.timSort.prototype.merge_hi = function (a, b) {\r\n    var min_gallop;\r\n    var dest;\r\n    var acount, bcount, nexta, nextb;\r\n    var k;\r\n    var p;\r\n    Sk.asserts.assert(a.len > 0 && b.len > 0 && a.base + a.len == b.base);\r\n    min_gallop = this.min_gallop;\r\n    dest = b.base + b.len;\r\n    b = b.copyitems();\r\n\r\n    // Invariant: elements in \"a\" are waiting to be reinserted into the list\r\n    // at \"dest\".  They should be merged with the elements of \"b\".\r\n    // b.base == dest + a.len.\r\n    // We use a finally block to ensure that the elements remaining in\r\n    // the copy \"a\" are reinserted back into this.list in all cases.\r\n    try {\r\n        dest--;\r\n        this.setitem(dest, a.popright());\r\n\r\n        if (a.len === 0 || b.len == 1) {\r\n            return;\r\n        }\r\n\r\n        while (true) {\r\n            acount = 0;   // number of times A won in a row\r\n            bcount = 0;   // number of times B won in a row\r\n\r\n            // Do the straightforward thing until (if ever) one run\r\n            // appears to win consistently.\r\n            while (true) {\r\n                nexta = a.getitem(a.base + a.len - 1);\r\n                nextb = b.getitem(b.base + b.len - 1);\r\n                if (this.lt(nextb, nexta)) {\r\n                    dest--;\r\n                    this.setitem(dest, nexta);\r\n                    a.len--;\r\n                    if (a.len === 0) {\r\n                        return;\r\n                    }\r\n                    acount++;\r\n                    bcount = 0;\r\n                    if (acount >= min_gallop) {\r\n                        break;\r\n                    }\r\n                } else {\r\n                    dest--;\r\n                    this.setitem(dest, nextb);\r\n                    b.len--;\r\n                    if (b.len == 1) {\r\n                        return;\r\n                    }\r\n                    bcount++;\r\n                    acount = 0;\r\n                    if (bcount >= min_gallop) {\r\n                        break;\r\n                    }\r\n                }\r\n            }\r\n\r\n            // One run is winning so consistently that galloping may\r\n            // be a huge win.  So try that, and continue galloping until\r\n            // (if ever) neither run appears to be winning consistently\r\n            // anymore.\r\n            min_gallop += 1;\r\n\r\n            while (true) {\r\n                min_gallop -= min_gallop > 1;\r\n                this.min_gallop = min_gallop;\r\n                nextb = b.getitem(b.base + b.len - 1);\r\n                k = this.gallop(nextb, a, a.len - 1, true);\r\n                acount = a.len - k;\r\n                for (p = a.base + a.len - 1; p > a.base + k - 1; p--) {\r\n                    dest--;\r\n                    this.setitem(dest, a.getitem(p));\r\n                }\r\n                a.len -= acount;\r\n                if (a.len === 0) {\r\n                    return;\r\n                }\r\n\r\n                dest--;\r\n                this.setitem(dest, b.popright());\r\n                if (b.len == 1) {\r\n                    return;\r\n                }\r\n\r\n                nexta = a.getitem(a.base + a.len - 1);\r\n                k = this.gallop(nexta, b, b.len - 1, false);\r\n                bcount = b.len - k;\r\n                for (p = b.base + b.len - 1; p > b.base + k - 1; p--) {\r\n                    dest--;\r\n                    this.setitem(dest, b.getitem(p));\r\n                }\r\n\r\n                b.len -= bcount;\r\n\r\n                // b.len==0 is impossible now if the comparison\r\n                // function is consistent, but we can't assume\r\n                // that it is.\r\n                if (b.len <= 1) {\r\n                    return;\r\n                }\r\n                dest--;\r\n                this.setitem(dest, a.popright());\r\n                if (a.len === 0) {\r\n                    return;\r\n                }\r\n\r\n                if (acount < this.MIN_GALLOP && bcount < this.MIN_GALLOP) {\r\n                    break;\r\n                }\r\n\r\n                min_gallop++;  // penalize it for leaving galloping mode\r\n                this.min_gallop = min_gallop;\r\n            }\r\n        }\r\n    } finally {\r\n        // The last element of a belongs at the end of the merge, so we copy\r\n        // the remaining elements of b before the remaining elements of a.\r\n        Sk.asserts.assert(a.len >= 0 && b.len >= 0);\r\n        for (p = a.base + a.len - 1; p > a.base - 1; p--) {\r\n            dest--;\r\n            this.setitem(dest, a.getitem(p));\r\n        }\r\n        for (p = b.base + b.len - 1; p > b.base - 1; p--) {\r\n            dest--;\r\n            this.setitem(dest, b.getitem(p));\r\n        }\r\n    }\r\n};\r\n\r\n// Merge the two runs at stack indices i and i+1.\r\n\r\nSk.builtin.timSort.prototype.merge_at = function (i) {\r\n    var a;\r\n    var b;\r\n    var k;\r\n    if (i < 0) {\r\n        i = this.pending.length + i;\r\n    }\r\n\r\n    a = this.pending[i];\r\n    b = this.pending[i + 1];\r\n    Sk.asserts.assert(a.len > 0 && b.len > 0);\r\n    Sk.asserts.assert(a.base + a.len == b.base);\r\n\r\n    // Record the length of the combined runs and remove the run b\r\n    this.pending[i] = new Sk.builtin.listSlice(this.list, a.base, a.len + b.len);\r\n    this.pending.splice(i + 1, 1);\r\n\r\n    // Where does b start in a?  Elements in a before that can be\r\n    // ignored (already in place).\r\n    k = this.gallop(b.getitem(b.base), a, 0, true);\r\n    a.advance(k);\r\n    if (a.len === 0) {\r\n        return;\r\n    }\r\n\r\n    // Where does a end in b?  Elements in b after that can be\r\n    // ignored (already in place).\r\n    b.len = this.gallop(a.getitem(a.base + a.len - 1), b, b.len - 1, false);\r\n    if (b.len === 0) {\r\n        return;\r\n    }\r\n\r\n    // Merge what remains of the runs.  The direction is chosen to\r\n    // minimize the temporary storage needed.\r\n    if (a.len <= b.len) {\r\n        this.merge_lo(a, b);\r\n    } else {\r\n        this.merge_hi(a, b);\r\n    }\r\n};\r\n\r\n// Examine the stack of runs waiting to be merged, merging adjacent runs\r\n// until the stack invariants are re-established:\r\n//\r\n// 1. len[-3] > len[-2] + len[-1]\r\n// 2. len[-2] > len[-1]\r\n//\r\n// See listsort.txt for more info.\r\nSk.builtin.timSort.prototype.merge_collapse = function () {\r\n    var p = this.pending;\r\n    while (p.length > 1) {\r\n        if (p.length >= 3 && p[p.length - 3].len <= p[p.length - 2].len + p[p.length - 1].len) {\r\n            if (p[p.length - 3].len < p[p.length - 1].len) {\r\n                this.merge_at(-3);\r\n            } else {\r\n                this.merge_at(-2);\r\n            }\r\n        } else if (p[p.length - 2].len <= p[p.length - 1].len) {\r\n            this.merge_at(-2);\r\n        } else {\r\n            break;\r\n        }\r\n    }\r\n};\r\n\r\n// Regardless of invariants, merge all runs on the stack until only one\r\n// remains.  This is used at the end of the mergesort.\r\n\r\nSk.builtin.timSort.prototype.merge_force_collapse = function () {\r\n    var p = this.pending;\r\n    while (p.length > 1) {\r\n        if (p.length >= 3 && p[p.length - 3].len < p[p.length - 1].len) {\r\n            this.merge_at(-3);\r\n        } else {\r\n            this.merge_at(-2);\r\n        }\r\n    }\r\n};\r\n// Compute a good value for the minimum run length; natural runs shorter\r\n// than this are boosted artificially via binary insertion.\r\n//\r\n// If n < 64, return n (it's too small to bother with fancy stuff).\r\n// Else if n is an exact power of 2, return 32.\r\n// Else return an int k, 32 <= k <= 64, such that n/k is close to, but\r\n// strictly less than, an exact power of 2.\r\n//\r\n// See listsort.txt for more info.\r\n\r\nSk.builtin.timSort.prototype.merge_compute_minrun = function (n) {\r\n    var r = 0;    // becomes 1 if any 1 bits are shifted off\r\n    while (n >= 64) {\r\n        r = r | n & 1;\r\n        n >>= 1;\r\n    }\r\n    return n + r;\r\n};\r\n\r\n//ListSlice\r\n/**\r\n * @constructor\r\n * @param {Sk.builtin.list=} list\r\n * @param {number=} base\r\n * @param {number=} len\r\n * @extends Sk.builtin.object\r\n */\r\nSk.builtin.listSlice = function (list, base, len) {\r\n    this.list = list;\r\n    this.base = base;\r\n    this.len = len;\r\n};\r\n\r\nSk.builtin.listSlice.prototype.copyitems = function () {\r\n    //Make a copy of the slice of the original list\r\n    var start = this.base;\r\n    var stop = this.base + this.len;\r\n    Sk.asserts.assert(0 <= start <= stop);\r\n    return new Sk.builtin.listSlice(new Sk.builtin.list(this.list.v.slice(start, stop)), 0, this.len);\r\n};\r\n\r\nSk.builtin.listSlice.prototype.advance = function (n) {\r\n    this.base += n;\r\n    this.len -= n;\r\n    Sk.asserts.assert(this.base <= this.list.sq$length());\r\n};\r\n\r\nSk.builtin.listSlice.prototype.getitem = function (item) {\r\n    return this.list.v[item];\r\n};\r\n\r\nSk.builtin.listSlice.prototype.setitem = function (item, value) {\r\n    this.list.v[item] = value;\r\n};\r\n\r\nSk.builtin.listSlice.prototype.popleft = function () {\r\n    var result = this.list.v[this.base];\r\n    this.base++;\r\n    this.len--;\r\n    return result;\r\n};\r\n\r\nSk.builtin.listSlice.prototype.popright = function () {\r\n    this.len--;\r\n    return this.list.v[this.base + this.len];\r\n};\r\n\r\nSk.builtin.listSlice.prototype.reverse = function () {\r\n    // Reverse the slice in-place.\r\n    var list_hi;\r\n    var list_lo;\r\n    var list = this.list;\r\n    var lo = this.base;\r\n    var hi = lo + this.len - 1;\r\n    while (lo < hi) {\r\n        list_hi = list.v[hi];\r\n        list_lo = list.v[lo];\r\n        list.v[lo] = list_hi;\r\n        list.v[hi] = list_lo;\r\n        lo++;\r\n        hi--;\r\n    }\r\n};\r\n\r\nSk.exportSymbol(\"Sk.builtin.listSlice\", Sk.builtin.listSlice);\r\nSk.exportSymbol(\"Sk.builtin.timSort\", Sk.builtin.timSort);\r\n","//\"\"\"Token constants (from somewhere).\"\"\"\r\n\r\nvar __all__ = [\"tok_name\", \"ISTERMINAL\", \"ISNONTERMINAL\", \"ISEOF\"];\r\n\r\n// #  This file is automatically generated; please don't muck it up!\r\n// #\r\n// #  To update the symbols in this file, 'cd' to the top directory of\r\n// #  the python source tree after building the interpreter and run:\r\n// #\r\n// #    ./python Lib/token.py\r\n\r\n// #--start constants--\r\nvar tokens = {\r\n    T_ENDMARKER: 0,\r\n    T_NAME: 1,\r\n    T_NUMBER: 2,\r\n    T_STRING: 3,\r\n    T_NEWLINE: 4,\r\n    T_INDENT: 5,\r\n    T_DEDENT: 6,\r\n    T_LPAR: 7,\r\n    T_RPAR: 8,\r\n    T_LSQB: 9,\r\n    T_RSQB: 10,\r\n    T_COLON: 11,\r\n    T_COMMA: 12,\r\n    T_SEMI: 13,\r\n    T_PLUS: 14,\r\n    T_MINUS: 15,\r\n    T_STAR: 16,\r\n    T_SLASH: 17,\r\n    T_VBAR: 18,\r\n    T_AMPER: 19,\r\n    T_LESS: 20,\r\n    T_GREATER: 21,\r\n    T_EQUAL: 22,\r\n    T_DOT: 23,\r\n    T_PERCENT: 24,\r\n    T_LBRACE: 25,\r\n    T_RBRACE: 26,\r\n    T_EQEQUAL: 27,\r\n    T_NOTEQUAL: 28,\r\n    T_LESSEQUAL: 29,\r\n    T_GREATEREQUAL: 30,\r\n    T_TILDE: 31,\r\n    T_CIRCUMFLEX: 32,\r\n    T_LEFTSHIFT: 33,\r\n    T_RIGHTSHIFT: 34,\r\n    T_DOUBLESTAR: 35,\r\n    T_PLUSEQUAL: 36,\r\n    T_MINEQUAL: 37,\r\n    T_STAREQUAL: 38,\r\n    T_SLASHEQUAL: 39,\r\n    T_PERCENTEQUAL: 40,\r\n    T_AMPEREQUAL: 41,\r\n    T_VBAREQUAL: 42,\r\n    T_CIRCUMFLEXEQUAL: 43,\r\n    T_LEFTSHIFTEQUAL: 44,\r\n    T_RIGHTSHIFTEQUAL: 45,\r\n    T_DOUBLESTAREQUAL: 46,\r\n    T_DOUBLESLASH: 47,\r\n    T_DOUBLESLASHEQUAL: 48,\r\n    T_AT: 49,\r\n    T_ATEQUAL: 50,\r\n    T_RARROW: 51,\r\n    T_ELLIPSIS: 52,\r\n    T_OP: 53,\r\n    T_AWAIT: 54,\r\n    T_ASYNC: 55,\r\n    T_ERRORTOKEN: 56,\r\n\r\n    //special cases\r\n    T_NT_OFFSET: 256,\r\n    T_N_TOKENS: 60,\r\n\r\n    //taken from tokenize.py\r\n    T_COMMENT: 57,\r\n    T_NL: 58,\r\n    T_ENCODING: 59\r\n};\r\n// #--end constants--\r\n\r\nvar EXACT_TOKEN_TYPES = {\r\n    \"!=\": tokens.T_NOTEQUAL,\r\n    \"%\": tokens.T_PERCENT,\r\n    \"%=\": tokens.T_PERCENTEQUAL,\r\n    \"&\": tokens.T_AMPER,\r\n    \"&=\": tokens.T_AMPEREQUAL,\r\n    \"(\": tokens.T_LPAR,\r\n    \")\": tokens.T_RPAR,\r\n    \"*\": tokens.T_STAR,\r\n    \"**\": tokens.T_DOUBLESTAR,\r\n    \"**=\": tokens.T_DOUBLESTAREQUAL,\r\n    \"*=\": tokens.T_STAREQUAL,\r\n    \"+\": tokens.T_PLUS,\r\n    \"+=\": tokens.T_PLUSEQUAL,\r\n    \",\": tokens.T_COMMA,\r\n    \"-\": tokens.T_MINUS,\r\n    \"-=\": tokens.T_MINEQUAL,\r\n    \"->\": tokens.T_RARROW,\r\n    \".\": tokens.T_DOT,\r\n    \"...\": tokens.T_ELLIPSIS,\r\n    \"/\": tokens.T_SLASH,\r\n    \"//\": tokens.T_DOUBLESLASH,\r\n    \"//=\": tokens.T_DOUBLESLASHEQUAL,\r\n    \"/=\": tokens.T_SLASHEQUAL,\r\n    \":\": tokens.T_COLON,\r\n    // \":=\": tokens.T_COLONEQUAL, // currently not listed in tokens\r\n    \";\": tokens.T_SEMI,\r\n    \"<\": tokens.T_LESS,\r\n    \"<<\": tokens.T_LEFTSHIFT,\r\n    \"<<=\": tokens.T_LEFTSHIFTEQUAL,\r\n    \"<=\": tokens.T_LESSEQUAL,\r\n    \"=\": tokens.T_EQUAL,\r\n    \"==\": tokens.T_EQEQUAL,\r\n    \">\": tokens.T_GREATER,\r\n    \">=\": tokens.T_GREATEREQUAL,\r\n    \">>\": tokens.T_RIGHTSHIFT,\r\n    \">>=\": tokens.T_RIGHTSHIFTEQUAL,\r\n    \"@\": tokens.T_AT,\r\n    \"@=\": tokens.T_ATEQUAL,\r\n    \"[\": tokens.T_LSQB,\r\n    \"]\": tokens.T_RSQB,\r\n    \"^\": tokens.T_CIRCUMFLEX,\r\n    \"^=\": tokens.T_CIRCUMFLEXEQUAL,\r\n    \"{\": tokens.T_LBRACE,\r\n    \"|\": tokens.T_VBAR,\r\n    \"|=\": tokens.T_VBAREQUAL,\r\n    \"}\": tokens.T_RBRACE,\r\n    \"~\": tokens.T_TILDE,\r\n};\r\n\r\nvar tok_name = {};\r\n(function () {\r\n    for (var i in tokens) {\r\n        tok_name[tokens[i]] = i;\r\n    }\r\n})();\r\n\r\n__all__.concat(Object.keys(tok_name).map(function (k) { return tok_name[k]; }));\r\n\r\nfunction ISTERMINAL(x) {\r\n    return x < tokens.T_NT_OFFSET;\r\n}\r\n\r\nfunction ISNONTERMINAL(x) {\r\n    return x >= tokens.T_NT_OFFSET;\r\n}\r\n\r\nfunction ISEOF(x) {\r\n    return x == tokens.T_ENDMARKER;\r\n}\r\n\r\nSk.token = {};\r\nSk.token.tokens = tokens;\r\nSk.token.tok_name = tok_name;\r\nSk.token.EXACT_TOKEN_TYPES = EXACT_TOKEN_TYPES;\r\nSk.token.ISTERMINAL = ISTERMINAL;\r\nSk.token.ISNONTERMINAL = ISNONTERMINAL;\r\nSk.token.ISEOF = ISEOF;\r\n\r\nSk.exportSymbol(\"Sk.token\", Sk.token);\r\nSk.exportSymbol(\"Sk.token.tokens\", Sk.token.tokens);\r\nSk.exportSymbol(\"Sk.token.tok_name\", Sk.token.tok_name);\r\nSk.exportSymbol(\"Sk.token.EXACT_TOKEN_TYPES\");\r\nSk.exportSymbol(\"Sk.token.ISTERMINAL\", Sk.token.ISTERMINAL);\r\nSk.exportSymbol(\"Sk.token.ISNONTERMINAL\", Sk.token.ISNONTERMINAL);\r\nSk.exportSymbol(\"Sk.token.ISEOF\", Sk.token.ISEOF);\r\n","import Unicode from \"../support/polyfills/Unicode\";\r\n\r\nvar tokens = Sk.token.tokens;\r\n\r\nconst TokenError = Sk.builtin.SyntaxError;\r\nconst IndentationError = Sk.builtin.IndentationError;\r\n\r\n/**\r\n *\r\n * @constructor\r\n * @param {number} type\r\n * @param {string} string\r\n * @param {Array<number>} start\r\n * @param {Array<number>} end\r\n * @param {string} line\r\n */\r\nfunction TokenInfo(type, string, start, end, line) {\r\n    this.type = type;\r\n    this.string = string;\r\n    this.start = start;\r\n    this.end = end;\r\n    this.line = line;\r\n}\r\n\r\nTokenInfo.prototype.exact_type = function () {\r\n    if (this.type == tokens.T_OP && this.string in Sk.token.EXACT_TOKEN_TYPES) {\r\n    return Sk.token.EXACT_TOKEN_TYPES[this.string]\r\n    } else {\r\n        return this.type\r\n    }\r\n    }\r\n\r\n/** @param {...*} x */\r\nfunction group(x) {\r\n    var args = Array.prototype.slice.call(arguments);\r\n    return \"(\" + args.join(\"|\") + \")\";\r\n}\r\n\r\n/** @param {...*} x */\r\nfunction any(x) {\r\n    return group.apply(null, arguments) + \"*\";\r\n}\r\n\r\n/** @param {...*} x */\r\nfunction maybe(x) {\r\n    return group.apply(null, arguments) + \"?\";\r\n}\r\n\r\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g,\r\n    reHasRegExpChar = RegExp(reRegExpChar.source);\r\n\r\nfunction regexEscape(string) {\r\n    return (string && reHasRegExpChar.test(string))\r\n        ? string.replace(reRegExpChar, \"\\\\$&\")\r\n        : string;\r\n}\r\n\r\n/**\r\n * Iterable contains\r\n * @template T\r\n * @param {T} a\r\n * @param {T} obj\r\n */\r\nfunction contains(a, obj) {\r\n    var i = a.length;\r\n    while (i--) {\r\n        if (a[i] === obj) {\r\n            return true;\r\n        }\r\n    }\r\n    return false;\r\n}\r\n\r\nfunction rstrip(input, what) {\r\n    var i;\r\n    for (i = input.length; i > 0; --i) {\r\n        if (what.indexOf(input.charAt(i - 1)) === -1) {\r\n            break;\r\n        }\r\n    }\r\n    return input.substring(0, i);\r\n}\r\n\r\n\r\n\r\nconst { Lu, Ll, Lt, Lm, Lo, Nl, Mn, Mc, Nd, Pc } = Unicode;\r\nconst the_underscore = \"_\";\r\nconst Other_ID_Start = \"\\\\u1885-\\\\u1886\\\\u2118\\\\u212E\\\\u309B-\\\\u309C\";\r\nconst Other_ID_Continue = \"\\\\u00B7\\\\u0387\\\\u1369-\\\\u1371\\\\u19DA\";\r\nconst id_start = Lu + Ll + Lt + Lm + Lo + Nl + the_underscore + Other_ID_Start;\r\nconst id_continue = id_start + Mn + Mc + Nd + Pc + Other_ID_Continue;\r\n\r\nconst IDENTIFIER = \"[\" + id_start + \"]+[\" + id_continue + \"]*\"\r\nconst IS_IDENTIFIER_REGEX = new RegExp(\"^\" + IDENTIFIER + \"$\");\r\n\r\n\r\n/**\r\n * test if string is an identifier\r\n *\r\n * @param {str} string\r\n * @returns {boolean}\r\n */\r\nfunction isidentifier(str) {\r\n    var normalized = str.normalize('NFKC');\r\n    return IS_IDENTIFIER_REGEX.test(normalized);\r\n}\r\n\r\nSk.token.isIdentifier = isidentifier;\r\n\r\n/* we have to use string and ctor to be able to build patterns up. + on /.../\r\n * does something strange.\r\n * Note: we use unicode matching for names (\"\\w\") but ascii matching for\r\n * number literals.\r\n *\r\n * I don't know if the comment above is still actually correct */\r\nvar Whitespace = \"[ \\\\f\\\\t]*\";\r\nvar Comment_ = \"#[^\\\\r\\\\n]*\";\r\nvar Ignore = Whitespace + any(\"\\\\\\\\\\\\r?\\\\n\" + Whitespace) + maybe(Comment_);\r\nvar Name = IDENTIFIER; // this differs form tokenize.py (\\w+) which isn't valid for python identifiers\r\n\r\n\r\nvar Exponent = \"[eE][-+]?[0-9](?:_?[0-9])*\";\r\nvar Pointfloat = group(\"[0-9](?:_?[0-9])*\\\\.(?:[0-9](?:_?[0-9])*)?\", \"\\\\.[0-9](?:_?[0-9])*\") + maybe(Exponent);\r\nvar Expfloat = \"[0-9](?:_?[0-9])*\" + Exponent;\r\nvar Floatnumber = group(Pointfloat, Expfloat);\r\nvar Imagnumber = group(\"[0-9](?:_?[0-9])*[jJ]\", Floatnumber + \"[jJ]\");\r\n\r\n// Return the empty string, plus all of the valid string prefixes.\r\nfunction _all_string_prefixes() {\r\n    return [\r\n        '', 'FR', 'RF', 'Br', 'BR', 'Fr', 'r', 'B', 'R', 'b', 'bR',\r\n        'f', 'rb', 'rB', 'F', 'Rf', 'U', 'rF', 'u', 'RB', 'br', 'fR',\r\n        'fr', 'rf', 'Rb'];\r\n}\r\n\r\n// Note that since _all_string_prefixes includes the empty string,\r\n//  StringPrefix can be the empty string (making it optional).\r\nvar StringPrefix = group.apply(null, _all_string_prefixes())\r\n\r\n// these regexes differ from python because .exec doesn't do the\r\n// same thing as .match in python. It's more like .search.\r\n// .match matches from the start of the string.\r\n// to get the same behaviour we can add a ^ to the start of the\r\n// regex\r\n// Tail end of ' string.\r\nvar Single = \"^[^'\\\\\\\\]*(?:\\\\\\\\.[^'\\\\\\\\]*)*'\";\r\n// Tail end of \" string.\r\nvar Double = '^[^\"\\\\\\\\]*(?:\\\\\\\\.[^\"\\\\\\\\]*)*\"';\r\n// Tail end of ''' string.\r\nvar Single3 = \"^[^'\\\\\\\\]*(?:(?:\\\\\\\\.|'(?!''))[^'\\\\\\\\]*)*'''\";\r\n// Tail end of \"\"\" string.\r\nvar Double3 = '^[^\"\\\\\\\\]*(?:(?:\\\\\\\\.|\"(?!\"\"))[^\"\\\\\\\\]*)*\"\"\"';\r\nvar Triple = group(StringPrefix + \"'''\", StringPrefix + '\"\"\"');\r\n// Single-line ' or \" string.\r\nvar String_ = group(StringPrefix + \"'[^\\\\n'\\\\\\\\]*(?:\\\\\\\\.[^\\\\n'\\\\\\\\]*)*'\",\r\n                    StringPrefix + '\"[^\\\\n\"\\\\\\\\]*(?:\\\\\\\\.[^\\\\n\"\\\\\\\\]*)*\"');\r\n\r\n// Sorting in reverse order puts the long operators before their prefixes.\r\n// Otherwise if = came before ==, == would get recognized as two instances\r\n// of =.\r\nvar EXACT_TOKENS_SORTED;\r\nvar Special;\r\nvar Funny;\r\n\r\nfunction setupTokens(py3) {\r\n    // recompute the above two lines\r\n    // <> should be included in py2 mode\r\n    if (py3) {\r\n        delete Sk.token.EXACT_TOKEN_TYPES[\"<>\"];\r\n    } else {\r\n        Sk.token.EXACT_TOKEN_TYPES[\"<>\"] = Sk.token.tokens.T_NOTEQUAL;\r\n    }\r\n    EXACT_TOKENS_SORTED = Object.keys(Sk.token.EXACT_TOKEN_TYPES).sort();\r\n    Special = group.apply(\r\n        this,\r\n        EXACT_TOKENS_SORTED.reverse().map(function (t) {\r\n    return regexEscape(t);\r\n        })\r\n    );\r\n    Funny = group(\"\\\\r?\\\\n\", Special);\r\n}\r\nsetupTokens(true);\r\n\r\nSk.token.setupTokens = setupTokens;\r\n\r\n\r\n\r\n// these aren't actually used\r\n// var PlainToken = group(Number_, Funny, String_, Name);\r\n// var Token = Ignore + PlainToken;\r\n\r\n// First (or only) line of ' or \" string.\r\nvar ContStr = group(StringPrefix + \"'[^\\\\n'\\\\\\\\]*(?:\\\\\\\\.[^\\\\n'\\\\\\\\]*)*\" +\r\n                group(\"'\", '\\\\\\\\\\\\r?\\\\n'),\r\n                StringPrefix + '\"[^\\\\n\"\\\\\\\\]*(?:\\\\\\\\.[^\\\\n\"\\\\\\\\]*)*' +\r\n                group('\"', '\\\\\\\\\\\\r?\\\\n'))\r\nvar PseudoExtras = group('\\\\\\\\\\\\r?\\\\n|$', Comment_, Triple);\r\n\r\n// For a given string prefix plus quotes, endpats maps it to a regex\r\n//  to match the remainder of that string. _prefix can be empty, for\r\n//  a normal single or triple quoted string (with no prefix).\r\nvar endpats = {}\r\nvar prefixes = _all_string_prefixes();\r\nfor (let _prefix of prefixes) {\r\n    endpats[_prefix + \"'\"] = RegExp(Single);\r\n    endpats[_prefix + \"\\\"\"] = RegExp(Double);\r\n    endpats[_prefix + \"'''\"] = RegExp(Single3);\r\n    endpats[_prefix + \"\\\"\\\"\\\"\"] = RegExp(Double3);\r\n}\r\n\r\n// A set of all of the single and triple quoted string prefixes,\r\n//  including the opening quotes.\r\nlet single_quoted = []\r\nlet triple_quoted = []\r\nfor (let t of prefixes) {\r\n    single_quoted.push(t + '\"');\r\n    single_quoted.push(t + \"'\");\r\n    triple_quoted.push(t + '\"\"\"');\r\n    triple_quoted.push(t + \"'''\");\r\n}\r\n\r\nvar tabsize = 8;\r\n\r\nvar PseudoTokenRegex;\r\n\r\nfunction _setupTokenRegexes() {\r\n    // we make these regexes here because they can\r\n    // be changed by the configuration.\r\n    var LSuffix = !Sk.__future__.python3 ? '(?:L?)' : '';\r\n    var Hexnumber = '0[xX](?:_?[0-9a-fA-F])+' + LSuffix;\r\n    var Binnumber = '0[bB](?:_?[01])+' + LSuffix;\r\n    var Octnumber = '0([oO])(?:_?[0-7])+' + LSuffix;\r\n    var SilentOctnumber = '0([oO]?)(?:_?[0-7])+' + LSuffix;\r\n    var Decnumber = '(?:0(?:_?0)*|[1-9](?:_?[0-9])*)' + LSuffix;\r\n    var Intnumber = group(Hexnumber, Binnumber,\r\n                          (Sk.__future__.silent_octal_literal ? SilentOctnumber : Octnumber), Decnumber);\r\n    var Number_ = group(Imagnumber, Floatnumber, Intnumber);\r\n    var PseudoToken = Whitespace + group(PseudoExtras, Number_, Funny, ContStr, Name);\r\n\r\n    PseudoTokenRegex = new RegExp(PseudoToken);\r\n}\r\n\r\nSk._setupTokenRegexes = _setupTokenRegexes;\r\n\r\nSk.exportSymbol(\"Sk._setupTokenRegexes\", Sk._setupTokenRegexes);\r\n\r\n/**\r\n * internal tokenize function\r\n *\r\n * @param {function(): string} readline\r\n * @param {string} encoding\r\n * @param {function(TokenInfo): void} yield_\r\n */\r\nfunction _tokenize(readline, encoding, yield_, filename) {\r\n\r\n\r\n    var lnum = 0,\r\n        parenlev = 0,\r\n        continued = 0,\r\n        numchars = '0123456789',\r\n        contstr = '',\r\n        needcont = 0,\r\n        contline = null,\r\n        indents = [0],\r\n        spos = [0, 0],\r\n        epos = [0, 0],\r\n        capos = null,\r\n        endprog = undefined,\r\n        strstart = undefined,\r\n        end = undefined,\r\n        pseudomatch = undefined;\r\n\r\n    if (encoding !== undefined) {\r\n        if (encoding == \"utf-8-sig\") {\r\n            // BOM will already have been stripped.\r\n            encoding = \"utf-8\";\r\n        }\r\n\r\n        yield_(new TokenInfo(tokens.T_ENCODING, encoding, [0, 0], [0, 0], \"\"));\r\n    }\r\n\r\n    var last_line = \"\";\r\n    var line = \"\";\r\n    while (true) {                                // loop over lines in stream\r\n        try {\r\n            // We capture the value of the line variable here because\r\n            // readline uses the empty string '' to signal end of input,\r\n            // hence `line` itself will always be overwritten at the end\r\n            // of this loop.\r\n            last_line = line;\r\n            line = readline();\r\n        } catch (Exception) {\r\n            line = \"\";\r\n        }\r\n\r\n        // lets pretend this doesn't exist for now.\r\n        // if encoding is not None:\r\n        //     line = line.decode(encoding)\r\n        lnum += 1;\r\n        var pos = 0;\r\n        var max = line.length;\r\n\r\n        if (contstr) {                       // continued string\r\n            if (!line) {\r\n                //throw new TokenError(\"EOF in multi-line string\", strstart);\r\n                throw new TokenError(\"EOF in multi-line string\", filename, last_line, ...spos, ...epos);\r\n            }\r\n            endprog.lastIndex = 0;\r\n            var endmatch = endprog.exec(line);\r\n            if (endmatch) {\r\n                pos = end = endmatch[0].length;\r\n                yield_(new TokenInfo(tokens.T_STRING, contstr + line.substring(0, end),\r\n                                     strstart, [lnum, end], contline + line));\r\n                contstr = \"\";\r\n                needcont = 0;\r\n                contline = null;\r\n            } else if (needcont && line.substring(line.length - 2) !== \"\\\\\\n\" && line.substring(line.length - 3) !== \"\\\\\\r\\n\") {\r\n                yield_(new TokenInfo(tokens.T_ERRORTOKEN, contstr + line,\r\n                                     strstart, [lnum, line.length], contline));\r\n                contstr = \"\";\r\n                contline = null;\r\n                continue;\r\n            } else {\r\n                contstr = contstr + line;\r\n                contline = contline + line;\r\n                continue;\r\n            }\r\n        } else if (parenlev == 0 && !continued) {  // new statement\r\n            if (!line) {\r\n                break;\r\n            }\r\n            var column = 0;\r\n            while (pos < max) {              // measure leading whitespace\r\n                if (line[pos] == \" \") {\r\n                    column += 1;\r\n                } else if (line[pos] == \"\\t\") {\r\n                    column = Math.floor(column / tabsize + 1) * tabsize;\r\n                } else if (line[pos] == \"\\f\") {\r\n                    column = 0;\r\n                } else {\r\n                    break;\r\n                }\r\n                ;\r\n                pos += 1;\r\n            }\r\n\r\n            if (pos == max) {\r\n                break;\r\n            }\r\n\r\n            if (contains(\"#\\r\\n\", line[pos])) {       // skip comments or blank lines\r\n                if (line[pos] == \"#\") {\r\n                    var comment_token = rstrip(line.substring(pos), \"\\r\\n\");\r\n                    yield_(new TokenInfo(tokens.T_COMMENT, comment_token,\r\n                                         [lnum, pos], [lnum, pos + comment_token.length], line));\r\n                    pos += comment_token.length;\r\n                }\r\n\r\n                yield_(new TokenInfo(tokens.T_NL, line.substring(pos),\r\n                                     [lnum, pos], [lnum, line.length], line));\r\n                continue;\r\n            }\r\n\r\n            if (column > indents[indents.length - 1]) {           // count indents or dedents\r\n                indents.push(column);\r\n                yield_(new TokenInfo(tokens.T_INDENT, line.substring(pos), [lnum, 0], [lnum, pos], line));\r\n            }\r\n\r\n            while (column < indents[indents.length - 1]) {\r\n                if (!contains(indents, column)) {\r\n                    throw new IndentationError(\r\n                        \"unindent does not match any outer indentation level\",\r\n                        filename, spos[0], ...spos, ...epos); //[\"<tokenize>\", lnum, pos, line]);\r\n                }\r\n\r\n                indents = indents.slice(0, -1);\r\n\r\n                yield_(new TokenInfo(tokens.T_DEDENT, \"\", [lnum, pos], [lnum, pos], line));\r\n            }\r\n        } else {                                  // continued statement\r\n            if (!line) {\r\n                //throw new TokenError(\"EOF in multi-line statement\", [lnum, 0]);\r\n                throw new TokenError(\"EOF in multi-line statement\", filename, last_line, ...spos, ...epos);\r\n            }\r\n            continued = 0;\r\n        }\r\n\r\n        while (pos < max) {\r\n            //console.log(\"pos:\"+pos+\":\"+max);\r\n            // js regexes don't return any info about matches, other than the\r\n            // content. we'd like to put a \\w+ before pseudomatch, but then we\r\n            // can't get any data\r\n            capos = line.charAt(pos);\r\n            while (capos === \" \" || capos === \"\\f\" || capos === \"\\t\") {\r\n                pos += 1;\r\n                capos = line.charAt(pos);\r\n            }\r\n\r\n            pseudomatch = PseudoTokenRegex.exec(line.substring(pos));\r\n            if (pseudomatch) {                                // scan for tokens\r\n                var start = pos;\r\n                var end = start + pseudomatch[1].length;\r\n                spos = [lnum, start];\r\n                epos = [lnum, end];\r\n                var pos = end;\r\n                if (start == end) {\r\n                    continue;\r\n                }\r\n\r\n                var token = line.substring(start, end);\r\n                var initial = line[start];\r\n                //console.log(\"token:\",token, \"initial:\",initial, start, end);\r\n                if (contains(numchars, initial) ||                 // ordinary number\r\n                    (initial == \".\" && token != \".\" && token != \"...\")) {\r\n                    yield_(new TokenInfo(tokens.T_NUMBER, token, spos, epos, line));\r\n                } else if (contains(\"\\r\\n\", initial)) {\r\n                    if (parenlev > 0) {\r\n                        yield_(new TokenInfo(tokens.T_NL, token, spos, epos, line));\r\n                    } else {\r\n                        yield_(new TokenInfo(tokens.T_NEWLINE, token, spos, epos, line));\r\n                    }\r\n                } else if (initial == \"#\") {\r\n                    //assert not token.endswith(\"\\n\")\r\n                    yield_(new TokenInfo(tokens.T_COMMENT, token, spos, epos, line));\r\n                } else if (contains(triple_quoted, token)) {\r\n                    endprog = endpats[token];\r\n                    endmatch = endprog.exec(line.substring(pos));\r\n                    if (endmatch) {                       // all on one line\r\n                        pos = endmatch[0].length + pos;\r\n                        token = line.substring(start, pos);\r\n                        yield_(new TokenInfo(tokens.T_STRING, token, spos, [lnum, pos], line));\r\n                    } else {\r\n                        strstart = [lnum, start];           // multiple lines\r\n                        contstr = line.substring(start);\r\n                        contline = line;\r\n                        break;\r\n                    }\r\n                    // Check up to the first 3 chars of the token to see if\r\n                    //  they're in the single_quoted set. If so, they start\r\n                    //  a string.\r\n                    // We're using the first 3, because we're looking for\r\n                    //  \"rb'\" (for example) at the start of the token. If\r\n                    //  we switch to longer prefixes, this needs to be\r\n                    //  adjusted.\r\n                    // Note that initial == token[:1].\r\n                    // Also note that single quote checking must come after\r\n                    //  triple quote checking (above).\r\n                } else if (contains(single_quoted, initial) ||\r\n                    contains(single_quoted, token.substring(0, 2)) ||\r\n                    contains(single_quoted, token.substring(0, 3))) {\r\n                    if (token[token.length - 1] == \"\\n\") {                // continued string\r\n                        strstart = [lnum, start];\r\n                        // Again, using the first 3 chars of the\r\n                        //  token. This is looking for the matching end\r\n                        //  regex for the correct type of quote\r\n                        //  character. So it's really looking for\r\n                        //  endpats[\"'\"] or endpats['\"'], by trying to\r\n                        //  skip string prefix characters, if any.\r\n                        endprog = endpats[initial] ||\r\n                            endpats[token[1]] ||\r\n                            endpats[token[2]];\r\n                        contstr = line.substring(start);\r\n                        needcont = 1;\r\n                        contline = line;\r\n                        break;\r\n                    } else {                                  // ordinary string\r\n                        yield_(new TokenInfo(tokens.T_STRING, token, spos, epos, line));\r\n                    }\r\n\r\n                } else if (isidentifier(initial)) {              // ordinary name\r\n                    yield_(new TokenInfo(tokens.T_NAME, token, spos, epos, line));\r\n                } else if (initial == \"\\\\\") {                  // continued stmt\r\n                    continued = 1;\r\n                } else {\r\n                    if (contains(\"([{\", initial)) {\r\n                        parenlev += 1;\r\n                    } else if (contains(\")]}\", initial)) {\r\n                        parenlev -= 1;\r\n                    }\r\n                    yield_(new TokenInfo(tokens.T_OP, token, spos, epos, line));\r\n                }\r\n            } else {\r\n                yield_(new TokenInfo(tokens.T_ERRORTOKEN, line[pos],\r\n                                     [lnum, pos], [lnum, pos + 1], line));\r\n                pos += 1;\r\n            }\r\n        }\r\n    }\r\n\r\n    // Add an implicit NEWLINE if the input doesn't end in one\r\n    if (last_line && !contains(\"\\r\\n\", last_line[last_line.length - 1])) {\r\n        yield_(new TokenInfo(tokens.T_NEWLINE, \"\", [lnum - 1, last_line.length], [lnum - 1, last_line.length + 1], \"\"));\r\n    }\r\n    for (var i in indents.slice(1)) {                 // pop remaining indent levels\r\n        yield_(new TokenInfo(tokens.T_DEDENT, \"\", [lnum, 0], [lnum, 0], \"\"));\r\n    }\r\n\r\n    yield_(new TokenInfo(tokens.T_ENDMARKER, \"\", [lnum, 0], [lnum, 0], \"\"));\r\n}\r\n\r\nSk._tokenize = _tokenize;\r\n// we use this in ast\r\nSk._tokenize.Floatnumber = Floatnumber;\r\n\r\nSk.exportSymbol(\"Sk._tokenize\", Sk._tokenize);","/**\r\n * @constructor\r\n * @param {Array} L\r\n * @extends {Sk.builtin.object}\r\n */\r\nSk.builtin.tuple = Sk.abstr.buildNativeClass(\"tuple\", {\r\n    constructor: function tuple(L) {\r\n        if (L === undefined) {\r\n            L = [];\r\n        } else if (!Array.isArray(L)) {\r\n            L = Sk.misceval.arrayFromIterable(L); \r\n            // internal calls to constructor can't suspend - avoid using this\r\n        }\r\n        Sk.asserts.assert(this instanceof Sk.builtin.tuple, \"bad call to tuple, use 'new' with an Array of python objects\");\r\n        this.v = L;\r\n        this.in$repr = false;\r\n    },\r\n    slots: /**@lends {Sk.builtin.tuple.prototype}*/{\r\n        tp$getattr: Sk.generic.getAttr,\r\n        tp$as_sequence_or_mapping: true,\r\n        tp$doc:\r\n            \"Built-in immutable sequence.\\n\\nIf no argument is given, the constructor returns an empty tuple.\\nIf iterable is specified the tuple is initialized from iterable's items.\\n\\nIf the argument is a tuple, the return value is the same object.\",\r\n        $r() {\r\n            if (this.in$repr) {\r\n                return new Sk.builtin.str(\"(...)\");\r\n            }\r\n            this.in$repr = true;\r\n            let ret = this.v.map((x) => Sk.misceval.objectRepr(x));\r\n            this.in$repr = false;\r\n            ret = ret.join(\", \");\r\n            if (this.v.length === 1) {\r\n                ret += \",\";\r\n            }\r\n            return new Sk.builtin.str(\"(\" + ret + \")\");\r\n        },\r\n        /**\r\n         * @param {Array} args \r\n         * @param {Array=} kwargs \r\n         * @ignore\r\n         */\r\n        tp$new(args, kwargs) {\r\n            // this = Sk.builtin.prototype or a prototype that inherits from Sk.builtin.tuple.prototype\r\n            if (this !== Sk.builtin.tuple.prototype) {\r\n                return this.$subtype_new(args, kwargs);\r\n            }\r\n            Sk.abstr.checkNoKwargs(\"tuple\", kwargs);\r\n            Sk.abstr.checkArgsLen(\"tuple\", args, 0, 1);\r\n            const arg = args[0];\r\n            if (arg === undefined) {\r\n                return new Sk.builtin.tuple([]);\r\n            }\r\n            if (arg.constructor === Sk.builtin.tuple) {\r\n                return arg;\r\n            }\r\n            return Sk.misceval.chain(Sk.misceval.arrayFromIterable(arg, true), (L) => new Sk.builtin.tuple(L));\r\n        },\r\n        tp$hash() {\r\n            // the numbers and order are taken from Cpython\r\n            let y,\r\n                x = 0x345678,\r\n                mult = 1000003;\r\n            const len = this.v.length;\r\n            for (let i = 0; i < len; ++i) {\r\n                y = Sk.abstr.objectHash(this.v[i]);\r\n                if (y === -1) {\r\n                    return -1;\r\n                }\r\n                x = (x ^ y) * mult;\r\n                mult += 82520 + len + len;\r\n            }\r\n            x += 97531;\r\n            if (x === -1) {\r\n                x = -2;\r\n            }\r\n            return x | 0;\r\n        },\r\n        tp$richcompare: Sk.generic.seqCompare,\r\n        tp$iter() {\r\n            return new tuple_iter_(this);\r\n        },\r\n\r\n        // sequence and mapping slots\r\n        mp$subscript(index) {\r\n            if (Sk.misceval.isIndex(index)) {\r\n                let i = Sk.misceval.asIndexSized(index);\r\n                    if (i < 0) {\r\n                        i = this.v.length + i;\r\n                    }\r\n                    if (i < 0 || i >= this.v.length) {\r\n                        throw new Sk.builtin.IndexError(\"tuple index out of range\");\r\n                    }\r\n                    return this.v[i];\r\n            } else if (index instanceof Sk.builtin.slice) {\r\n                const ret = [];\r\n                index.sssiter$(this.v.length, (i) => {\r\n                    ret.push(this.v[i]);\r\n                });\r\n                return new Sk.builtin.tuple(ret);\r\n            }\r\n            throw new Sk.builtin.TypeError(\"tuple indices must be integers or slices, not \" + Sk.abstr.typeName(index));\r\n        },\r\n        sq$length() {\r\n            return this.v.length;\r\n        },\r\n        sq$repeat(n) {\r\n            n = Sk.misceval.asIndexSized(n, Sk.builtin.OverflowError);\r\n            if (n === 1 && this.constructor === Sk.builtin.tuple) {\r\n                return this;\r\n            }\r\n            const ret = [];\r\n            for (let i = 0; i < n; i++) {\r\n                for (let j = 0; j < this.v.length; j++) {\r\n                    ret.push(this.v[j]);\r\n                }\r\n            }\r\n            return new Sk.builtin.tuple(ret);\r\n        },\r\n        sq$concat(other) {\r\n            if (!(other instanceof Sk.builtin.tuple)) {\r\n                throw new Sk.builtin.TypeError(\"can only concatenate tuple (not '\" + Sk.abstr.typeName(other) + \"') to tuple\");\r\n            }\r\n            return new Sk.builtin.tuple(this.v.concat(other.v));\r\n        },\r\n        sq$contains(ob) {\r\n            for (let it = this.tp$iter(), i = it.tp$iternext(); i !== undefined; i = it.tp$iternext()) {\r\n                if (i === ob || Sk.misceval.richCompareBool(i, ob, \"Eq\")) {\r\n                    return true;\r\n                }\r\n            }\r\n            return false;\r\n        },\r\n    },\r\n    proto: /**@lends {Sk.builtin.tuple.prototype}*/{\r\n        $subtype_new(args, kwargs) {\r\n            const instance = new this.constructor();\r\n            // pass the args but ignore the kwargs for subtyping - these might be handled by the subtypes init method\r\n            const tuple = Sk.builtin.tuple.prototype.tp$new(args);\r\n            instance.v = tuple.v;\r\n            return instance;\r\n        },\r\n        sk$asarray() {\r\n            return this.v.slice(0);\r\n        },\r\n    },\r\n    methods: /**@lends {Sk.builtin.tuple.prototype}*/{\r\n        __getnewargs__: {\r\n            $meth() {\r\n                return new Sk.builtin.tuple(this.v.slice(0));\r\n            },\r\n            $flags: {NoArgs: true},\r\n            $textsig: \"($self, /)\",\r\n            $doc: null,\r\n        },\r\n        index: /**@lends {Sk.builtin.type.prototype}*/{\r\n            $meth(item, start, end) {\r\n                if ((start !== undefined && !Sk.misceval.isIndex(start)) || (end !== undefined && !Sk.misceval.isIndex(end))) {\r\n                    // unusually can't have None here so check this first...\r\n                    throw new Sk.builtin.TypeError(\"slice indices must be integers or have an __index__ method\");\r\n                }\r\n                ({ start, end } = Sk.builtin.slice.startEnd$wrt(this, start, end));\r\n                const obj = this.v;\r\n                for (let i = start; i < end; i++) {\r\n                    if (obj[i] === item || Sk.misceval.richCompareBool(obj[i], item, \"Eq\")) {\r\n                        return new Sk.builtin.int_(i);\r\n                    }\r\n                }\r\n                throw new Sk.builtin.ValueError(\"tuple.index(x): x not in tuple\");\r\n            },\r\n            $flags: {MinArgs: 1, MaxArgs: 3},\r\n            $textsig: \"($self, value, start=0, stop=sys.maxsize, /)\",\r\n            $doc: \"Return first index of value.\\n\\nRaises ValueError if the value is not present.\",\r\n        },\r\n        count: {\r\n            $meth(item) {\r\n                const len = this.v.length;\r\n                const obj = this.v;\r\n                let count = 0;\r\n                for (let i = 0; i < len; ++i) {\r\n                    if (obj[i] === item || Sk.misceval.richCompareBool(obj[i], item, \"Eq\")) {\r\n                        count += 1;\r\n                    }\r\n                }\r\n                return new Sk.builtin.int_(count);\r\n            },\r\n            $flags: {OneArg: true},\r\n            $textsig: \"($self, value, /)\",\r\n            $doc: \"Return number of occurrences of value.\",\r\n        },\r\n    },\r\n    classmethods: Sk.generic.classGetItem,\r\n});\r\n\r\nSk.exportSymbol(\"Sk.builtin.tuple\", Sk.builtin.tuple);\r\n\r\n/**\r\n * @constructor\r\n * @extends {Sk.builtin.object}\r\n * @param {Sk.builtin.tuple} tuple\r\n * @private\r\n */\r\nvar tuple_iter_ = Sk.abstr.buildIteratorClass(\"tuple_iterator\", {\r\n    constructor: function tuple_iter_(tuple) {\r\n        this.$index = 0;\r\n        this.$seq = tuple.sk$asarray();\r\n    },\r\n    iternext: Sk.generic.iterNextWithArray,\r\n    methods: {\r\n        __length_hint__: Sk.generic.iterLengthHintWithArrayMethodDef,\r\n    },\r\n    flags: { sk$unacceptableBase: true },\r\n});\r\n","/**\r\n * @namespace Sk.builtin\r\n *\r\n * @description\r\n * All the builtin types as well as useful functions\r\n */\r\nif (Sk.builtin === undefined) {\r\n    Sk.builtin = {};\r\n}\r\n\r\n/**\r\n * @constructor\r\n * @extends {Sk.builtin.object}\r\n * @description\r\n * this should never be called as a constructor\r\n * instead use {@link Sk.abstr.buildNativeClass} or\r\n * {@link Sk.misceval.buildClass}\r\n *\r\n */\r\nSk.builtin.type = function type(obj) {\r\n    if (this instanceof Sk.builtin.type) {\r\n        Sk.asserts.fail(\"calling new Sk.builtin.type is not safe\");\r\n    }\r\n    return obj.ob$type; // allow this use of calling type\r\n};\r\n\r\nObject.defineProperties(\r\n    Sk.builtin.type.prototype,\r\n    /**@lends {Sk.builtin.type.prototype}*/ {\r\n    call: { value: Function.prototype.call },\r\n    apply: { value: Function.prototype.apply },\r\n        tp$slots: {\r\n            value: {\r\n                tp$doc: \"type(object_or_name, bases, dict)\\ntype(object) -> the object's type\\ntype(name, bases, dict) -> a new type\",\r\n                tp$call,\r\n                tp$new,\r\n                tp$getattr,\r\n                tp$setattr,\r\n                $r,\r\n            },\r\n            writable: true,\r\n        },\r\n        tp$methods: { value: null, writable: true }, // define these later\r\n        tp$getsets: { value: null, writable: true },\r\n    sk$type: { value: true },\r\n        $isSubType: { value: $isSubType },\r\n        $allocateSlot: { value: $allocateSlot },\r\n        $allocateSlots: { value: $allocateSlots },\r\n        $allocateGetterSlot: { value: $allocateGetterSlot },\r\n        $typeLookup: { value: $typeLookup, writable: true },\r\n        $mroMerge: { value: $mroMerge },\r\n        $buildMRO: { value: $buildMRO },\r\n        sk$attrError: {\r\n            value() {\r\n                return \"type object '\" + this.prototype.tp$name + \"'\";\r\n            },\r\n            writable: true,\r\n        },\r\n    }\r\n);\r\n\r\n/**\r\n * @this {typeObject | Sk.builtin.type}\r\n */\r\nfunction tp$call(args, kwargs) {\r\n    if (this === Sk.builtin.type) {\r\n        // check the args are 1 - only interested in the 1 argument form if\r\n        // if the nargs and nkeywords != 1 or 3 and zero raise an error\r\n        if (args.length === 1 && (kwargs === undefined || !kwargs.length)) {\r\n            return args[0].ob$type;\r\n        } else if (args.length !== 3) {\r\n            throw new Sk.builtin.TypeError(\"type() takes 1 or 3 arguments\");\r\n        }\r\n    }\r\n    let obj = this.prototype.tp$new(args, kwargs);\r\n\r\n    if (obj.$isSuspension) {\r\n        return Sk.misceval.chain(\r\n            obj,\r\n            (o) => {\r\n                obj = o;\r\n                if (!obj.ob$type.$isSubType(this)) {\r\n                    // don't initialize an obj if it's type is not a subtype of this!\r\n                    // typically obj$obtype === self so this check is fast\r\n                    return;\r\n                }\r\n                return obj.tp$init(args, kwargs);\r\n            },\r\n            () => obj\r\n        );\r\n    } else if (!obj.ob$type.$isSubType(this)) {\r\n        return obj;\r\n    } else {\r\n        const res = obj.tp$init(args, kwargs);\r\n        if (res !== undefined && res.$isSuspension) {\r\n            return Sk.misceval.chain(res, () => obj);\r\n        }\r\n        return obj;\r\n    }\r\n}\r\n\r\nfunction tp$new(args, kwargs) {\r\n    // currently skulpt does not support metatypes...\r\n    // metatype.prototype = this\r\n    if (args.length !== 3) {\r\n        if (args.length === 1 && (kwargs === undefined || !kwargs.length)) {\r\n            return args[0].ob$type;\r\n        }\r\n        throw new Sk.builtin.TypeError(\"type() takes 1 or 3 arguments\");\r\n    }\r\n\r\n    let $name, bases, dict;\r\n    $name = args[0];\r\n    bases = args[1];\r\n    dict = args[2];\r\n    // first check that we only have 3 args and they're of the correct type\r\n    // argument dict must be of type dict\r\n    if (dict.tp$name !== \"dict\") {\r\n        throw new Sk.builtin.TypeError(\"type() argument 3 must be dict, not \" + Sk.abstr.typeName(dict));\r\n    }\r\n    // checks if name must be string\r\n    if (!Sk.builtin.checkString($name)) {\r\n        throw new Sk.builtin.TypeError(\"type() argument 1 must be str, not \" + Sk.abstr.typeName($name));\r\n    }\r\n    $name = $name.$jsstr();\r\n    // argument bases must be of type tuple\r\n    if (bases.tp$name !== \"tuple\") {\r\n        throw new Sk.builtin.TypeError(\"type() argument 2 must be tuple, not \" + Sk.abstr.typeName(bases));\r\n    }\r\n    bases = bases.sk$asarray();\r\n\r\n    /**\r\n     * @type {!typeObject}\r\n     */\r\n    const klass = function () {\r\n    // klass is essentially a function that gives its instances a dict\r\n        // if we support slots then we might need to have two versions of this\r\n        this.$d = new Sk.builtin.dict();\r\n    };\r\n    setUpKlass($name, klass, bases, this.constructor);\r\n\r\n    // set some defaults which can be overridden by the dict object\r\n    if (Sk.globals) {\r\n    klass.prototype.__module__ = Sk.globals[\"__name__\"];\r\n    }\r\n    klass.prototype.__doc__ = Sk.builtin.none.none$;\r\n\r\n    // set __dict__ if not already on the prototype\r\n    /**@todo __slots__ */\r\n    if (klass.$typeLookup(Sk.builtin.str.$dict) === undefined) {\r\n        klass.prototype.__dict__ = new Sk.builtin.getset_descriptor(klass, subtype_dict_getset_description);\r\n    }\r\n\r\n    // copy properties from dict into klass.prototype\r\n    dict.$items().forEach(([key, val]) => {\r\n        klass.prototype[key.$mangled] = val;\r\n    });\r\n    /* Set ht_qualname to dict['__qualname__'] if available, else to\r\n    __name__.  The __qualname__ accessor will look for ht_qualname.\r\n    */\r\n    if (klass.prototype.hasOwnProperty(\"__qualname__\")) {\r\n        const qualname = klass.prototype.__qualname__;\r\n        if (!Sk.builtin.checkString(qualname)) {\r\n            throw new Sk.builtin.TypeError(\"type __qualname__ must be a str, not '\" + Sk.abstr.typeName(qualname) + \"'\");\r\n        }\r\n        klass.prototype.ht$qualname = qualname;\r\n    }\r\n\r\n    const proto = klass.prototype;\r\n    // make __new__ a static method\r\n    overrideImplied(proto, \"__new__\", \"staticmethod\");\r\n    // make __classgetitem__ a class method\r\n    overrideImplied(proto, \"__class_getitem__\", \"classmethod\");\r\n    klass.$allocateSlots();\r\n\r\n    return klass;\r\n}\r\n\r\nfunction overrideImplied(proto, dunder, implied) {\r\n    if (proto.hasOwnProperty(dunder)) {\r\n        const fn = proto[dunder];\r\n        if (fn instanceof Sk.builtin.func) {\r\n            proto[dunder] = new Sk.builtin[implied](fn);\r\n        }\r\n    }\r\n}\r\n\r\n/**\r\n * @param {Array} args\r\n * @param {Array=} kwargs\r\n */\r\nfunction tp$init(args, kwargs) {\r\n    if (args && args.length == 1 && kwargs && kwargs.length) {\r\n        throw new Sk.builtin.TypeError(\"type.__init__() takes no keyword arguments\");\r\n    } else if (args.length != 3 && args.length != 1) {\r\n        throw new Sk.builtin.TypeError(\"type.__init__() takes 1 or 3 arguments\");\r\n    }\r\n    // according to Cpython we just call the object init method here\r\n    return Sk.builtin.object.prototype.tp$init.call(this, []);\r\n}\r\n\r\nfunction $r() {\r\n    let mod = this.prototype.__module__;\r\n    let cname = \"\";\r\n    let ctype = \"class\";\r\n    if (mod && Sk.builtin.checkString(mod)) {\r\n        cname = mod.v + \".\";\r\n    } else {\r\n        mod = null;\r\n    }\r\n    if (!mod && !this.sk$klass && !Sk.__future__.class_repr) {\r\n        ctype = \"type\";\r\n    }\r\n    return new Sk.builtin.str(\"<\" + ctype + \" '\" + cname + this.prototype.tp$name + \"'>\");\r\n}\r\n\r\nfunction tp$getattr(pyName, canSuspend) {\r\n    // first check that the pyName is indeed a string\r\n    let res;\r\n    const metatype = this.ob$type;\r\n    // now check whether there is a descriptor on the metatype\r\n    const meta_attribute = metatype.$typeLookup(pyName);\r\n\r\n    let meta_get;\r\n    if (meta_attribute !== undefined) {\r\n        meta_get = meta_attribute.tp$descr_get;\r\n        if (meta_get !== undefined && meta_attribute.tp$descr_set !== undefined) {\r\n            // then we're a data descriptor\r\n            res = meta_get.call(meta_attribute, this, metatype, canSuspend);\r\n            return res;\r\n        }\r\n    }\r\n    const attribute = this.$typeLookup(pyName);\r\n\r\n    if (attribute !== undefined) {\r\n        const local_get = attribute.tp$descr_get;\r\n        if (local_get !== undefined) {\r\n            // null indicates that the descriptor was on the target object itself or a buss\r\n            res = local_get.call(attribute, null, this, canSuspend);\r\n            return res;\r\n        }\r\n        return attribute;\r\n    }\r\n    // attribute was not found so use the meta_get if any\r\n    if (meta_get !== undefined) {\r\n        res = meta_get.call(meta_attribute, this, metatype, canSuspend);\r\n        return res;\r\n    }\r\n\r\n    if (meta_attribute !== undefined) {\r\n        return meta_attribute;\r\n    }\r\n    return;\r\n}\r\n\r\nfunction tp$setattr(pyName, value, canSuspend) {\r\n    if (!this.sk$klass) {\r\n        if (value !== undefined) {\r\n            throw new Sk.builtin.TypeError(\"can't set attributes of built-in/extension type '\" + this.prototype.tp$name + \"'\");\r\n        } else {\r\n            throw new Sk.builtin.TypeError(\"can't delete attributes on type object '\" + this.prototype.tp$name + \"'\");\r\n        }\r\n    }\r\n    // meta types must follow single inheritance - we could change this and do\r\n    const descr = this.ob$type.$typeLookup(pyName);\r\n\r\n    // if it's a data descriptor then call it\r\n    if (descr !== undefined) {\r\n        const f = descr.tp$descr_set;\r\n        if (f) {\r\n            return f.call(descr, this, value, canSuspend);\r\n        }\r\n    }\r\n    // for delattr\r\n    const jsName = pyName.$mangled;\r\n\r\n    if (value === undefined) {\r\n        const proto = this.prototype;\r\n        if (!proto.hasOwnProperty(jsName)) {\r\n            throw new Sk.builtin.AttributeError(\"type object '\" + this.prototype.tp$name + \"' has no attribute '\" + pyName.$jsstr() + \"'\");\r\n        } else {\r\n            delete proto[jsName];\r\n            // delete the slot_func\r\n            // TODO what about slot funcs that are dual slots...\r\n            const slot_name = Sk.dunderToSkulpt[jsName];\r\n            if (slot_name !== undefined) {\r\n                delete this.prototype[slot_name];\r\n                if (!proto.sk$prototypical) {\r\n                    this.$allocateGetterSlot(jsName);\r\n                    // if this was a slot func and we are not prototypical\r\n                    // allocate a getter slot in it's place\r\n                }\r\n            }\r\n    }\r\n    } else {\r\n    this.prototype[jsName] = value;\r\n    if (jsName in Sk.dunderToSkulpt) {\r\n        this.$allocateSlot(jsName, value);\r\n    }\r\n    }\r\n}\r\n\r\nfunction fastLookup(pyName) {\r\n    var jsName = pyName.$mangled;\r\n    return this.prototype[jsName];\r\n    }\r\n\r\nfunction slowLookup(pyName) {\r\n    var jsName = pyName.$mangled;\r\n    const mro = this.prototype.tp$mro;\r\n    for (let i = 0; i < mro.length; ++i) {\r\n        const base_proto = mro[i].prototype;\r\n        if (base_proto.hasOwnProperty(jsName)) {\r\n            return base_proto[jsName];\r\n        }\r\n    }\r\n    return undefined;\r\n}\r\n\r\nfunction $typeLookup(pyName) {\r\n    // all type objects override this function depending on they're prototypical inheritance\r\n    // we use the logic here as a fall back\r\n    if (this.prototype.sk$prototypical) {\r\n        return fastLookup.call(this, pyName);\r\n    }\r\n    return slowLookup.call(this, pyName);\r\n}\r\n\r\nfunction $isSubType(other) {\r\n    return this === other || this.prototype instanceof other || (!this.prototype.sk$prototypical && this.prototype.tp$mro.includes(other));\r\n}\r\n\r\nfunction setUpKlass($name, klass, bases, meta) {\r\n    // this function tries to match Cpython - the best base is not always bases[0]\r\n    // we require a best bases for checks in __new__ as well as future support for slots\r\n    const best_base = best_base_(bases);\r\n    const klass_proto = klass.prototype;\r\n\r\n    Sk.abstr.setUpInheritance($name, klass, best_base, meta);\r\n\r\n    const pyName = new Sk.builtin.str($name);\r\n    Object.defineProperties(klass_proto, {\r\n        sk$prototypical: { value: true, writable: true },\r\n        tp$bases: { value: bases, writable: true },\r\n        tp$mro: { value: null, writable: true },\r\n        ht$type: { value: true, writable: true },\r\n        ht$name: { value: pyName, writable: true},\r\n        ht$qualname: { value: pyName, writable: true},\r\n    });\r\n    klass_proto.tp$mro = klass.$buildMRO();\r\n\r\n    Object.defineProperties(klass, {\r\n        $typeLookup: { value: klass_proto.sk$prototypical ? fastLookup : slowLookup, writable: true },\r\n        sk$klass: { value: true, writable: true },\r\n    });\r\n}\r\n\r\n// this function is used to determine the class constructor inheritance.\r\nfunction best_base_(bases) {\r\n    if (bases.length === 0) {\r\n        bases.push(Sk.builtin.object);\r\n    }\r\n    function solid_base(type) {\r\n        // if we support slots we would need to change this function - for now it just checks for the builtin.\r\n        if (type.sk$solidBase) {\r\n            return type;\r\n        }\r\n        return solid_base(type.prototype.tp$base);\r\n    }\r\n\r\n    let base, winner, candidate, base_i;\r\n    for (let i = 0; i < bases.length; i++) {\r\n        base_i = bases[i];\r\n        if (!Sk.builtin.checkClass(base_i)) {\r\n            throw new Sk.builtin.TypeError(\"bases must be 'type' objects\");\r\n        } else if (base_i.sk$unacceptableBase) {\r\n            throw new Sk.builtin.TypeError(\"type '\" + base_i.prototype.tp$name + \"' is not an acceptable base type\");\r\n        }\r\n        candidate = solid_base(base_i); // basically the builtin I think\r\n        if (winner === undefined) {\r\n            winner = candidate;\r\n            base = base_i;\r\n        } else if (winner.$isSubType(candidate)) {\r\n            // carry on\r\n        } else if (candidate.$isSubType(winner)) {\r\n            winner = candidate;\r\n            base = base_i;\r\n        } else {\r\n            throw new Sk.builtin.TypeError(\"multiple bases have instance layout conflicts\");\r\n        }\r\n    }\r\n    return base;\r\n}\r\n\r\nfunction $mroMerge(seqs) {\r\n    this.prototype.sk$prototypical = true; // assume true to start with\r\n    let seq, i, j;\r\n    const res = [];\r\n    for (; ;) {\r\n        for (i = 0; i < seqs.length; ++i) {\r\n            seq = seqs[i];\r\n            if (seq.length !== 0) {\r\n                break;\r\n            }\r\n        }\r\n        if (i === seqs.length) {\r\n            // all empty\r\n            return res;\r\n        }\r\n        const cands = [];\r\n        for (i = 0; i < seqs.length; ++i) {\r\n            seq = seqs[i];\r\n            //print(\"XXX\", Sk.builtin.repr(new Sk.builtin.list(seq)).v);\r\n            if (seq.length !== 0) {\r\n                const cand = seq[0];\r\n                //print(\"CAND\", Sk.builtin.repr(cand).v);\r\n\r\n                /* eslint-disable */\r\n                OUTER: for (j = 0; j < seqs.length; ++j) {\r\n                    const sseq = seqs[j];\r\n                    for (let k = 1; k < sseq.length; ++k) {\r\n                        if (sseq[k] === cand) {\r\n                            break OUTER;\r\n                        }\r\n                    }\r\n                }\r\n                /* eslint-enable */\r\n\r\n                // cand is not in any sequences' tail -> constraint-free\r\n                if (j === seqs.length) {\r\n                    cands.push(cand);\r\n                }\r\n            }\r\n        }\r\n\r\n        if (cands.length === 0) {\r\n            throw new Sk.builtin.TypeError(\"Inconsistent precedences in type hierarchy\");\r\n        }\r\n\r\n        const next = cands[0];\r\n\r\n        // check prototypical mro\r\n        if (res.length && this.prototype.sk$prototypical) {\r\n            let prevs_prototype = Object.getPrototypeOf(res[res.length - 1].prototype);\r\n            if (prevs_prototype !== next.prototype) {\r\n                this.prototype.sk$prototypical = false;\r\n            }\r\n        }\r\n\r\n        // append next to result and remove from sequences\r\n        res.push(next);\r\n\r\n        for (i = 0; i < seqs.length; ++i) {\r\n            seq = seqs[i];\r\n            if (seq.length > 0 && seq[0] === next) {\r\n                seq.splice(0, 1);\r\n            }\r\n        }\r\n    }\r\n}\r\n\r\n/*\r\n * C3 MRO (aka CPL) linearization. Figures out which order to search through\r\n * base classes to determine what should override what. C3 does the \"right\r\n * thing\", and it's what Python has used since 2.3.\r\n *\r\n * Kind of complicated to explain, but not really that complicated in\r\n * implementation. Explanations:\r\n *\r\n * http://people.csail.mit.edu/jrb/goo/manual.43/goomanual_55.html\r\n * http://www.python.org/download/releases/2.3/mro/\r\n * http://192.220.96.201/dylan/linearization-oopsla96.html\r\n *\r\n * This implementation is based on a post by Samuele Pedroni on python-dev\r\n * (http://mail.python.org/pipermail/python-dev/2002-October/029176.html) when\r\n * discussing its addition to Python.\r\n */\r\nfunction $buildMRO() {\r\n    // MERGE(klass + mro(bases) + bases)\r\n    const all = [[this]];\r\n    const kbases = this.prototype.tp$bases;\r\n\r\n    for (let i = 0; i < kbases.length; ++i) {\r\n        all.push([...kbases[i].prototype.tp$mro]);\r\n    }\r\n\r\n    const bases = [];\r\n    for (let i = 0; i < kbases.length; ++i) {\r\n        bases.push(kbases[i]);\r\n    }\r\n    all.push(bases);\r\n\r\n    return this.$mroMerge(all);\r\n}\r\n\r\nfunction $allocateSlots() {\r\n    // only allocate certain slots\r\n    const proto = this.prototype;\r\n    if (this.prototype.sk$prototypical) {\r\n        Object.keys(proto).forEach((dunder) => {\r\n        if (dunder in Sk.slots) {\r\n                this.$allocateSlot(dunder, proto[dunder]);\r\n        }\r\n        });\r\n    } else {\r\n        Object.keys(Sk.slots).forEach((dunder) => {\r\n            if (proto.hasOwnProperty(dunder)) {\r\n                this.$allocateSlot(dunder, proto[dunder]);\r\n            } else {\r\n                this.$allocateGetterSlot(dunder);\r\n            }\r\n        });\r\n        }\r\n    }\r\n\r\nfunction $allocateSlot(dunder, dunderFunc) {\r\n    const slot_def = Sk.slots[dunder];\r\n    const slot_name = slot_def.$slot_name;\r\n    const proto = this.prototype;\r\n    if (proto.hasOwnProperty(slot_name)) {\r\n        delete proto[slot_name]; // required in order to override the multiple inheritance getter slots\r\n    }\r\n    proto[slot_name] = slot_def.$slot_func(dunderFunc);\r\n}\r\n\r\nfunction $allocateGetterSlot(dunder) {\r\n    const slot_name = Sk.slots[dunder].$slot_name;\r\n    const proto = this.prototype;\r\n    if (proto.hasOwnProperty(slot_name)) {\r\n        return; // double slots can be problematic\r\n    }\r\n    Object.defineProperty(proto, slot_name, {\r\n        configurable: true,\r\n        get() {\r\n            const mro = proto.tp$mro;\r\n            for (let i = 1; i < mro.length; i++) {\r\n                const base_proto = mro[i].prototype;\r\n                const property = Object.getOwnPropertyDescriptor(base_proto, slot_name);\r\n                if (property !== undefined && property.value) {\r\n                    return property.value;\r\n                }\r\n            }\r\n        },\r\n    });\r\n}\r\n\r\nSk.builtin.type.prototype.tp$getsets = {\r\n    __base__: {\r\n        $get() {\r\n            return this.prototype.tp$base || Sk.builtin.none.none$;\r\n        },\r\n    },\r\n    __bases__: {\r\n        $get() {\r\n            if (this.sk$tuple_bases === undefined) {\r\n                this.sk$tuple_bases = new Sk.builtin.tuple(this.prototype.tp$bases);\r\n                // make sure we always return the same tuple\r\n            }\r\n            return this.sk$tuple_bases;\r\n        },\r\n    },\r\n    __mro__: {\r\n        $get() {\r\n            if (this.sk$tuple_mro === undefined) {\r\n                this.sk$tuple_mro = new Sk.builtin.tuple(this.prototype.tp$mro);\r\n                // make sure we always return the same tuple\r\n            }\r\n            return this.sk$tuple_mro;\r\n        },\r\n    },\r\n    __dict__: {\r\n        $get() {\r\n            return new Sk.builtin.mappingproxy(this.prototype);\r\n        },\r\n    },\r\n    __doc__: {\r\n        $get() {\r\n            const doc = this.$typeLookup(Sk.builtin.str.$doc);\r\n            if (doc) {\r\n                if (doc.tp$descr_get !== undefined) {\r\n                    if (this === Sk.builtin.type) {\r\n                        return new Sk.builtin.str(this.prototype.tp$doc);\r\n                    }\r\n                    return doc.tp$descr_get(null, this);\r\n                }\r\n                return this.prototype.__doc__;\r\n            }\r\n            return Sk.builtin.none.none$;\r\n        },\r\n        $set(value) {\r\n            check_special_type_attr(this, value, Sk.builtin.str.$doc);\r\n            this.prototype.__doc__ = value;\r\n        },\r\n    },\r\n    __name__: {\r\n        $get() {\r\n            let name = this.prototype.ht$name;\r\n            if (name !== undefined) {\r\n                return new Sk.builtin.str(name);\r\n            }\r\n            name = this.prototype.tp$name;\r\n            if (name.includes(\".\")) {\r\n                name = name.slice(name.lastIndexOf(\".\") + 1);\r\n            }\r\n            return new Sk.builtin.str(name);\r\n        },\r\n        $set(value) {\r\n            check_special_type_attr(this, value, Sk.builtin.str.$name);\r\n            if (!Sk.builtin.checkString(value)) {\r\n                throw new Sk.builtin.TypeError(\r\n                    \"can only assign string to \" + this.prototype.tp$name + \".__name__, not '\" + Sk.abstr.typeName(value) + \"'\"\r\n                );\r\n            }\r\n            this.prototype.ht$name = value;\r\n            this.prototype.tp$name = value.$jsstr();\r\n        },\r\n    },\r\n    __qualname__: {\r\n        $get() {\r\n            // todo\r\n            return this.prototype.ht$qualname || Sk.abstr.lookupSpecial(this, Sk.builtin.str.$name);\r\n        },\r\n        $set(value) {\r\n            check_special_type_attr(this, value, Sk.builtin.str.$name);\r\n            if (!Sk.builtin.checkString(value)) {\r\n                throw new Sk.builtin.TypeError(\r\n                    \"can only assign string to \" + this.prototype.tp$name + \".__qualname__, not '\" + Sk.abstr.typeName(value) + \"'\"\r\n                );\r\n            }\r\n            this.prototype.ht$qualname = value;\r\n        }\r\n    },\r\n    __module__: {\r\n        $get() {\r\n            const typeproto = this.prototype;\r\n            const mod = typeproto.__module__;\r\n            if (mod && !(mod.ob$type === Sk.builtin.getset_descriptor)) {\r\n                return mod;\r\n            }\r\n            if (typeproto.tp$name.includes(\".\")) {\r\n                return new Sk.builtin.str(typeproto.tp$name.slice(0, typeproto.tp$name.lastIndexOf(\".\")));\r\n            }\r\n            return new Sk.builtin.str(\"builtins\");\r\n        },\r\n        $set(value) {\r\n            // they can set the module to whatever they like\r\n            check_special_type_attr(this, value, Sk.builtin.str.$module);\r\n            this.prototype.__module__ = value;\r\n        },\r\n    },\r\n};\r\n\r\nSk.builtin.type.prototype.tp$methods = /**@lends {Sk.builtin.type.prototype}*/ {\r\n    mro: {\r\n        $meth() {\r\n            return new Sk.builtin.list(this.$buildMRO());\r\n        },\r\n        $flags: {NoArgs: true},\r\n    },\r\n    __dir__: {\r\n        $meth: function __dir__() {\r\n            const seen = new Set();\r\n            const dir = [];\r\n            function push_or_continue(attr) {\r\n                if (attr in Sk.reservedWords_) {\r\n                    return;\r\n                }\r\n                attr = Sk.unfixReserved(attr);\r\n                if (attr.indexOf(\"$\") !== -1) {\r\n                    return;\r\n                }\r\n                if (!seen.has(attr)) {\r\n                    seen.add(attr);\r\n                    dir.push(new Sk.builtin.str(attr));\r\n                }\r\n            }\r\n            if (this.prototype.sk$prototypical) {\r\n                for (let attr in this.prototype) {\r\n                    push_or_continue(attr);\r\n                }\r\n            } else {\r\n                const mro = this.prototype.tp$mro;\r\n                for (let i = 0; i < mro.length; i++) {\r\n                    const attrs = Object.getOwnPropertyNames(mro[i].prototype);\r\n                    for (let j = 0; j < attrs.length; j++) {\r\n                        push_or_continue(attrs[j]);\r\n                    }\r\n                }\r\n            }\r\n            return new Sk.builtin.list(dir);\r\n        },\r\n        $flags: {NoArgs: true},\r\n        $doc: \"Specialized __dir__ implementation for types.\",\r\n    },\r\n};\r\n\r\n// similar to generic.getSetDict but have to check if there is a builtin __dict__ descriptor that we should use first!\r\nconst subtype_dict_getset_description = {\r\n    $get() {\r\n        const dict_descr = get_dict_descr_of_builtn_base(this.ob$type);\r\n        if (dict_descr !== undefined) {\r\n            return dict_descr.tp$descr_get(this, this.ob$type);\r\n        }\r\n        return Sk.generic.getSetDict.$get.call(this);\r\n    },\r\n    $set(value) {\r\n        const dict_descr = get_dict_descr_of_builtn_base(this.ob$type);\r\n        if (dict_descr !== undefined) {\r\n            return dict_descr.tp$descr_set(this, value);\r\n    }\r\n        if (value === undefined) {\r\n            this.$d = new Sk.builtin.dict([]);\r\n        } else {\r\n            return Sk.generic.getSetDict.$set.call(this, value);\r\n        }\r\n    },\r\n    $doc: \"dictionary for instance variables (if defined)\",\r\n    $name: \"__dict__\",\r\n};\r\n\r\nfunction get_dict_descr_of_builtn_base(type) {\r\n    while (type.prototype.tp$base !== null) {\r\n        if (type.sk$klass === undefined) {\r\n            if (type.prototype.hasOwnProperty(\"__dict__\")) {\r\n                const descr = type.prototype.__dict__;\r\n                return Sk.builtin.checkDataDescr(descr) ? descr : undefined;\r\n            }\r\n        }\r\n        type = type.prototype.tp$base;\r\n        }\r\n    }\r\n\r\nfunction check_special_type_attr(type, value, pyName) {\r\n    if (type.sk$klass === undefined) {\r\n        throw new Sk.builtin.TypeError(\"can't set \" + type.prototype.tp$name + \".\" + pyName.$jsstr());\r\n        }\r\n    if (value === undefined) {\r\n        throw new Sk.builtin.TypeError(\"can't delete \" + type.prototype.tp$name + \".\" + pyName.$jsstr());\r\n        }\r\n    }\r\n","// Global Sk object\r\nvar Sk = {}; // jshint ignore:line\r\n\r\nSk.build = {\r\n    githash: GITHASH,\r\n    date: BUILDDATE\r\n};\r\n\r\n/**\r\n * Global object no matter where we're running\r\n */\r\nSk.global =\r\n    typeof global !== \"undefined\" ? global : // jshint ignore:line\r\n    typeof self !== \"undefined\" ? self : // jshint ignore:line\r\n    typeof window !== \"undefined\" ? window : // jshint ignore:line\r\n    {};\r\n\r\n/**\r\n * Export \"object\" to global namespace as \"name\".\r\n *\r\n * @param {string} name name to export the object to\r\n * @param {*} object object to export\r\n */\r\nSk.exportSymbol = function (name, object) {\r\n    var parts = name.split(\".\");\r\n    var curobj = Sk.global;\r\n    var part, idx;\r\n\r\n    for (idx = 0; idx < (parts.length - 1); idx++) {\r\n        part = parts[idx];\r\n\r\n        if (curobj.hasOwnProperty(part)) {\r\n            curobj = curobj[part];\r\n        } else {\r\n            curobj = curobj[part] = {};\r\n        }\r\n    }\r\n\r\n    if (typeof object !== \"undefined\") {\r\n        part = parts[idx];\r\n        curobj[part] = object;\r\n    }\r\n};\r\n\r\nSk.isArrayLike = function (object) {\r\n    if ((object instanceof Array) || (object && object.length && (typeof object.length == \"number\"))) {\r\n        return true;\r\n    }\r\n    return false;\r\n};\r\n\r\nSk.js_beautify = function (x) {\r\n    return x;\r\n};\r\n\r\nSk.exportSymbol(\"Sk\", Sk);\r\nSk.exportSymbol(\"Sk.global\", Sk.global);\r\nSk.exportSymbol(\"Sk.build\", Sk.build);\r\nSk.exportSymbol(\"Sk.exportSymbol\", Sk.exportSymbol);\r\nSk.exportSymbol(\"Sk.isArrayLike\", Sk.isArrayLike);\r\nSk.exportSymbol(\"Sk.js_beautify\", Sk.js_beautify);\r\n","/**\r\n * @constructor\r\n * @param {Array} JS Array of iterator objects\r\n * @extends Sk.builtin.object\r\n */\r\nSk.builtin.zip_ = Sk.abstr.buildIteratorClass(\"zip\", {\r\n    constructor: function zip_(iters) {\r\n        this.$iters = iters;\r\n        if (iters.length === 0) {\r\n            this.tp$iternext = () => undefined;\r\n        }\r\n    },\r\n    iternext(canSuspend) {\r\n        const tup = [];\r\n        const ret = Sk.misceval.chain(\r\n            Sk.misceval.iterArray(this.$iters, (it) =>\r\n                Sk.misceval.chain(it.tp$iternext(canSuspend), (i) => {\r\n                    if (i === undefined) {\r\n                        return new Sk.misceval.Break(true);\r\n                    }\r\n                    tup.push(i);\r\n                })\r\n            ),\r\n            (endzip) => (endzip ? undefined : new Sk.builtin.tuple(tup))\r\n        );\r\n        return canSuspend ? ret : Sk.misceval.retryOptionalSuspensionOrThrow(ret);\r\n    },\r\n    slots: {\r\n        tp$doc:\r\n            \"zip(iter1 [,iter2 [...]]) --> zip object\\n\\nReturn a zip object whose .__next__() method returns a tuple where\\nthe i-th element comes from the i-th iterable argument.  The .__next__()\\nmethod continues until the shortest iterable in the argument sequence\\nis exhausted and then it raises StopIteration.\",\r\n        tp$new(args, kwargs) {\r\n            if (this === Sk.builtin.zip_.prototype) {\r\n                Sk.abstr.checkNoKwargs(\"zip\", kwargs);\r\n    }\r\n            const iters = [];\r\n            for (let i = 0; i < args.length; i++) {\r\n        try {\r\n                    iters.push(Sk.abstr.iter(args[i]));\r\n        } catch (e) {\r\n            if (e instanceof Sk.builtin.TypeError) {\r\n                throw new Sk.builtin.TypeError(\"zip argument #\" + (i + 1) + \" must support iteration\");\r\n            } else {\r\n                throw e;\r\n            }\r\n        }\r\n    }\r\n            if (this === Sk.builtin.zip_.prototype) {\r\n                return new Sk.builtin.zip_(iters);\r\n            } else {\r\n                const instance = new this.constructor();\r\n                Sk.builtin.zip_.call(instance, iters);\r\n                return instance;\r\n            }\r\n        },\r\n    },\r\n});\r\nSk.exportSymbol(\"Sk.builtin.zip_\", Sk.builtin.zip_);\r\n\r\n","/**\r\n * functional approach to BigInt\r\n *\r\n * We use the JSBI library if BigInt is not available\r\n * https://github.com/GoogleChromeLabs/jsbi/\r\n *\r\n * If BigInt is available then we use the same functions as defined in the JSBI library\r\n * but use BigInt as the primitive type\r\n *\r\n */\r\nconst __JSBI = require(\"jsbi\");\r\n// use jsbi which is es5 compliant - change to ES6 in the compilation version\r\n\r\nconst JSBI = Sk.global.JSBI = Sk.global.BigInt !== undefined ? {} : __JSBI;\r\n\r\nif (Sk.global.BigInt === undefined) {\r\n    // __isBigInt is not part of the public api so include it if this is ever removed\r\n    JSBI.__isBigInt || (JSBI.__isBigInt = (x) => x instanceof JSBI);\r\n    JSBI.powermod = (x, y, z) => {\r\n        const One = JSBI.BigInt(1);\r\n        let number = One;\r\n        y = JSBI.greaterThan(y, JSBI.__ZERO) ? y : JSBI.unaryMinus(y);\r\n        while (JSBI.greaterThan(y, JSBI.__ZERO)) {\r\n            if (JSBI.bitwiseAnd(y, One)) {\r\n                number = JSBI.remainder(JSBI.multiply(number, x), z);\r\n            }\r\n            y = JSBI.signedRightShift(y, One);\r\n            x = JSBI.remainder(JSBI.multiply(x, x), z);\r\n        }\r\n        return number;\r\n    };\r\n} else {\r\n    Object.assign(JSBI, {\r\n        BigInt: Sk.global.BigInt,\r\n        toNumber: (x) => Number(x),\r\n        toString: (x) => x.toString(),\r\n        __isBigInt: (x) => typeof x === \"bigint\",\r\n        unaryMinus: (x) => -x,\r\n        bitwiseNot: (x) => ~x,\r\n        bitwiseAnd: (x, y) => x & y,\r\n        bitwiseOr: (x, y) => x | y,\r\n        bitwiseXor: (x, y) => x ^ y,\r\n        /**\r\n         * x**y would be better but closure compilere changes that to Math.pow\r\n         * https://github.com/google/closure-compiler/issues/3684 */\r\n        exponentiate: (x, y) => {\r\n            // can only exponentiate a postive y - enforced by int.js\r\n            const One = JSBI.BigInt(1);\r\n            let number = One;\r\n            y = y > JSBI.__ZERO ? y : -y;\r\n            while (y > JSBI.__ZERO) {\r\n                if (y & One) {\r\n                    number = number * x;\r\n                }\r\n                y = y >> One;\r\n                x = x * x;\r\n            }\r\n            return number;\r\n        },\r\n        powermod: (x, y, z) => {\r\n            const One = JSBI.BigInt(1);\r\n            let number = One;\r\n            y = y > JSBI.__ZERO ? y : -y;\r\n            while (y > JSBI.__ZERO) {\r\n                if (y & One) {\r\n                    number = (number * x) % z;\r\n                }\r\n                y = y >> One;\r\n                x = (x * x) % z;\r\n            }\r\n            return number;\r\n        },\r\n        multiply: (x, y) => x * y,\r\n        divide: (x, y) => x / y,\r\n        remainder: (x, y) => x % y,\r\n        add: (x, y) => x + y,\r\n        subtract: (x, y) => x - y,\r\n        leftShift: (x, y) => x << y,\r\n        signedRightShift: (x, y) => x >> y,\r\n        unsignedRightShift: (x, y) => x >>> y, // will raise TypeError\r\n        lessThan: (x, y) => x < y,\r\n        lessThanOrEqual: (x, y) => x <= y,\r\n        greaterThan: (x, y) => x > y,\r\n        greaterThanOrEqual: (x, y) => x >= y,\r\n        equal: (x, y) => x === y,\r\n        notEqual: (x, y) => x !== y,\r\n    });\r\n}\r\nJSBI.__ZERO = JSBI.BigInt(0);\r\nJSBI.__MAX_SAFE = JSBI.BigInt(Number.MAX_SAFE_INTEGER);\r\nJSBI.__MIN_SAFE = JSBI.BigInt(-Number.MAX_SAFE_INTEGER);\r\nJSBI.numberIfSafe = (val) => (JSBI.lessThan(val, JSBI.__MAX_SAFE) && JSBI.greaterThan(val, JSBI.__MIN_SAFE) ? JSBI.toNumber(val) : val);\r\n","/* From:\r\n    http://difnet.com.br/opensource/unicode_hack.js\r\n    It has been significantly modified.\r\n    Modifications are copyright 2014 Makyen and released under the MPL 2.0.\r\n        This Source Code Form is subject to the terms of the Mozilla Public\r\n        License, v. 2.0. If a copy of the MPL was not distributed with this\r\n        file, You can obtain one at http://mozilla.org/MPL/2.0/.\r\n*/\r\n/*! unicode_hack.js\r\n    Copyright (C) 2010-2012  Marcelo Gibson de Castro Gonçalves. All rights reserved.\r\n\r\n    Copying and distribution of this file, with or without modification,\r\n    are permitted in any medium without royalty provided the copyright\r\n    notice and this notice are preserved.  This file is offered as-is,\r\n    without any warranty.\r\n*/\r\n/*\r\nActual values adapted from https://github.com/slevithan/xregexp/blob/master/tools/output/categories.js\r\n*/\r\nconst Unicode = {\r\n    /* Strings to match Unicode characters in the BMP according to their Unicode category.\r\n       Extracted from Unicode specification, version 5.0.0, source:\r\n       http://unicode.org/versions/Unicode5.0.0/\r\n    */\r\n    /*\r\n        Abbr    Long                Description\r\n        Lu  Uppercase_Letter        an uppercase letter\r\n        Ll  Lowercase_Letter        a lowercase letter\r\n        Lt  Titlecase_Letter        a digraphic character, with first part uppercase\r\n        LC  Cased_Letter            Lu | Ll | Lt\r\n        Lm  Modifier_Letter         a modifier letter\r\n        Lo  Other_Letter            other letters, including syllables and ideographs\r\n        L   Letter                  Lu | Ll | Lt | Lm | Lo\r\n        Mn  Nonspacing_Mark         a nonspacing combining mark (zero advance width)\r\n        Mc  Spacing_Mark            a spacing combining mark (positive advance width)\r\n        Me  Enclosing_Mark          an enclosing combining mark\r\n        M   Mark                    Mn | Mc | Me\r\n        Nd  Decimal_Number          a decimal digit\r\n        Nl  Letter_Number           a letterlike numeric character\r\n        No  Other_Number            a numeric character of other type\r\n        N   Number                  Nd | Nl | No\r\n        Pc  Connector_Punctuation   a connecting punctuation mark, like a tie\r\n        Pd  Dash_Punctuation        a dash or hyphen punctuation mark\r\n        Ps  Open_Punctuation        an opening punctuation mark (of a pair)\r\n        Pe  Close_Punctuation       a closing punctuation mark (of a pair)\r\n        Pi  Initial_Punctuation     an initial quotation mark\r\n        Pf  Final_Punctuation       a final quotation mark\r\n        Po  Other_Punctuation       a punctuation mark of other type\r\n        P   Punctuation             Pc | Pd | Ps | Pe | Pi | Pf | Po\r\n        Sm  Math_Symbol             a symbol of mathematical use\r\n        Sc  Currency_Symbol         a currency sign\r\n        Sk  Modifier_Symbol         a non-letterlike modifier symbol\r\n        So  Other_Symbol            a symbol of other type\r\n        S   Symbol                  Sm | Sc | Sk | So\r\n        Zs  Space_Separator         a space character (of various non-zero widths)\r\n        Zl  Line_Separator          U+2028 LINE SEPARATOR only\r\n        Zp  Paragraph_Separator     U+2029 PARAGRAPH SEPARATOR only\r\n        Z   Separator               Zs | Zl | Zp\r\n        Cc  Control                 a C0 or C1 control code\r\n        Cf  Format                  a format control character\r\n        Cs  Surrogate               a surrogate code point\r\n        Co  Private_Use             a private-use character\r\n        Cn  Unassigned              a reserved unassigned code point or a noncharacter\r\n        C   Other                   Cc | Cf | Cs | Co | Cn\r\n    */\r\n    /* Alpha Sorted\r\n        Abbr    Long                Description\r\n        C   Other                   Cc | Cf | Cs | Co | Cn\r\n        Cc  Control                 a C0 or C1 control code\r\n        Cf  Format                  a format control character\r\n        Cn  Unassigned              a reserved unassigned code point or a noncharacter\r\n        Co  Private_Use             a private-use character\r\n        Cs  Surrogate               a surrogate code point\r\n        L   Letter                  Lu | Ll | Lt | Lm | Lo\r\n        LC  Cased_Letter            Lu | Ll | Lt\r\n        Ll  Lowercase_Letter        a lowercase letter\r\n        Lm  Modifier_Letter         a modifier letter\r\n        Lo  Other_Letter            other letters, including syllables and ideographs\r\n        Lt  Titlecase_Letter        a digraphic character, with first part uppercase\r\n        Lu  Uppercase_Letter        an uppercase letter\r\n        M   Mark                    Mn | Mc | Me\r\n        Mc  Spacing_Mark            a spacing combining mark (positive advance width)\r\n        Me  Enclosing_Mark          an enclosing combining mark\r\n        Mn  Nonspacing_Mark         a nonspacing combining mark (zero advance width)\r\n        N   Number                  Nd | Nl | No\r\n        Nd  Decimal_Number          a decimal digit\r\n        Nl  Letter_Number           a letterlike numeric character\r\n        No  Other_Number            a numeric character of other type\r\n        P   Punctuation             Pc | Pd | Ps | Pe | Pi | Pf | Po\r\n        Pc  Connector_Punctuation   a connecting punctuation mark, like a tie\r\n        Pd  Dash_Punctuation        a dash or hyphen punctuation mark\r\n        Pe  Close_Punctuation       a closing punctuation mark (of a pair)\r\n        Pf  Final_Punctuation       a final quotation mark\r\n        Pi  Initial_Punctuation     an initial quotation mark\r\n        Po  Other_Punctuation       a punctuation mark of other type\r\n        Ps  Open_Punctuation        an opening punctuation mark (of a pair)\r\n        S   Symbol                  Sm | Sc | Sk | So\r\n        Sc  Currency_Symbol         a currency sign\r\n        Sk  Modifier_Symbol         a non-letterlike modifier symbol\r\n        Sm  Math_Symbol             a symbol of mathematical use\r\n        So  Other_Symbol            a symbol of other type\r\n        Z   Separator               Zs | Zl | Zp\r\n        Zl  Line_Separator          U+2028 LINE SEPARATOR only\r\n        Zp  Paragraph_Separator     U+2029 PARAGRAPH SEPARATOR only\r\n        Zs  Space_Separator         a space character (of various non-zero widths)\r\n    */\r\n    Cc: \"\\\\0-\\\\x1F\\\\x7F-\\\\x9F\",\r\n    Cf: \"\\\\xAD\\\\u0600-\\\\u0605\\\\u061C\\\\u06DD\\\\u070F\\\\u08E2\\\\u180E\\\\u200B-\\\\u200F\\\\u202A-\\\\u202E\\\\u2060-\\\\u2064\\\\u2066-\\\\u206F\\\\uFEFF\\\\uFFF9-\\\\uFFFB\",\r\n    Co: \"\\\\uE000-\\\\uF8FF\",\r\n    Cs: \"\\\\uD800-\\\\uDFFF\",\r\n    Ll: \"a-z\\\\xB5\\\\xDF-\\\\xF6\\\\xF8-\\\\xFF\\\\u0101\\\\u0103\\\\u0105\\\\u0107\\\\u0109\\\\u010B\\\\u010D\\\\u010F\\\\u0111\\\\u0113\\\\u0115\\\\u0117\\\\u0119\\\\u011B\\\\u011D\\\\u011F\\\\u0121\\\\u0123\\\\u0125\\\\u0127\\\\u0129\\\\u012B\\\\u012D\\\\u012F\\\\u0131\\\\u0133\\\\u0135\\\\u0137\\\\u0138\\\\u013A\\\\u013C\\\\u013E\\\\u0140\\\\u0142\\\\u0144\\\\u0146\\\\u0148\\\\u0149\\\\u014B\\\\u014D\\\\u014F\\\\u0151\\\\u0153\\\\u0155\\\\u0157\\\\u0159\\\\u015B\\\\u015D\\\\u015F\\\\u0161\\\\u0163\\\\u0165\\\\u0167\\\\u0169\\\\u016B\\\\u016D\\\\u016F\\\\u0171\\\\u0173\\\\u0175\\\\u0177\\\\u017A\\\\u017C\\\\u017E-\\\\u0180\\\\u0183\\\\u0185\\\\u0188\\\\u018C\\\\u018D\\\\u0192\\\\u0195\\\\u0199-\\\\u019B\\\\u019E\\\\u01A1\\\\u01A3\\\\u01A5\\\\u01A8\\\\u01AA\\\\u01AB\\\\u01AD\\\\u01B0\\\\u01B4\\\\u01B6\\\\u01B9\\\\u01BA\\\\u01BD-\\\\u01BF\\\\u01C6\\\\u01C9\\\\u01CC\\\\u01CE\\\\u01D0\\\\u01D2\\\\u01D4\\\\u01D6\\\\u01D8\\\\u01DA\\\\u01DC\\\\u01DD\\\\u01DF\\\\u01E1\\\\u01E3\\\\u01E5\\\\u01E7\\\\u01E9\\\\u01EB\\\\u01ED\\\\u01EF\\\\u01F0\\\\u01F3\\\\u01F5\\\\u01F9\\\\u01FB\\\\u01FD\\\\u01FF\\\\u0201\\\\u0203\\\\u0205\\\\u0207\\\\u0209\\\\u020B\\\\u020D\\\\u020F\\\\u0211\\\\u0213\\\\u0215\\\\u0217\\\\u0219\\\\u021B\\\\u021D\\\\u021F\\\\u0221\\\\u0223\\\\u0225\\\\u0227\\\\u0229\\\\u022B\\\\u022D\\\\u022F\\\\u0231\\\\u0233-\\\\u0239\\\\u023C\\\\u023F\\\\u0240\\\\u0242\\\\u0247\\\\u0249\\\\u024B\\\\u024D\\\\u024F-\\\\u0293\\\\u0295-\\\\u02AF\\\\u0371\\\\u0373\\\\u0377\\\\u037B-\\\\u037D\\\\u0390\\\\u03AC-\\\\u03CE\\\\u03D0\\\\u03D1\\\\u03D5-\\\\u03D7\\\\u03D9\\\\u03DB\\\\u03DD\\\\u03DF\\\\u03E1\\\\u03E3\\\\u03E5\\\\u03E7\\\\u03E9\\\\u03EB\\\\u03ED\\\\u03EF-\\\\u03F3\\\\u03F5\\\\u03F8\\\\u03FB\\\\u03FC\\\\u0430-\\\\u045F\\\\u0461\\\\u0463\\\\u0465\\\\u0467\\\\u0469\\\\u046B\\\\u046D\\\\u046F\\\\u0471\\\\u0473\\\\u0475\\\\u0477\\\\u0479\\\\u047B\\\\u047D\\\\u047F\\\\u0481\\\\u048B\\\\u048D\\\\u048F\\\\u0491\\\\u0493\\\\u0495\\\\u0497\\\\u0499\\\\u049B\\\\u049D\\\\u049F\\\\u04A1\\\\u04A3\\\\u04A5\\\\u04A7\\\\u04A9\\\\u04AB\\\\u04AD\\\\u04AF\\\\u04B1\\\\u04B3\\\\u04B5\\\\u04B7\\\\u04B9\\\\u04BB\\\\u04BD\\\\u04BF\\\\u04C2\\\\u04C4\\\\u04C6\\\\u04C8\\\\u04CA\\\\u04CC\\\\u04CE\\\\u04CF\\\\u04D1\\\\u04D3\\\\u04D5\\\\u04D7\\\\u04D9\\\\u04DB\\\\u04DD\\\\u04DF\\\\u04E1\\\\u04E3\\\\u04E5\\\\u04E7\\\\u04E9\\\\u04EB\\\\u04ED\\\\u04EF\\\\u04F1\\\\u04F3\\\\u04F5\\\\u04F7\\\\u04F9\\\\u04FB\\\\u04FD\\\\u04FF\\\\u0501\\\\u0503\\\\u0505\\\\u0507\\\\u0509\\\\u050B\\\\u050D\\\\u050F\\\\u0511\\\\u0513\\\\u0515\\\\u0517\\\\u0519\\\\u051B\\\\u051D\\\\u051F\\\\u0521\\\\u0523\\\\u0525\\\\u0527\\\\u0529\\\\u052B\\\\u052D\\\\u052F\\\\u0560-\\\\u0588\\\\u10D0-\\\\u10FA\\\\u10FD-\\\\u10FF\\\\u13F8-\\\\u13FD\\\\u1C80-\\\\u1C88\\\\u1D00-\\\\u1D2B\\\\u1D6B-\\\\u1D77\\\\u1D79-\\\\u1D9A\\\\u1E01\\\\u1E03\\\\u1E05\\\\u1E07\\\\u1E09\\\\u1E0B\\\\u1E0D\\\\u1E0F\\\\u1E11\\\\u1E13\\\\u1E15\\\\u1E17\\\\u1E19\\\\u1E1B\\\\u1E1D\\\\u1E1F\\\\u1E21\\\\u1E23\\\\u1E25\\\\u1E27\\\\u1E29\\\\u1E2B\\\\u1E2D\\\\u1E2F\\\\u1E31\\\\u1E33\\\\u1E35\\\\u1E37\\\\u1E39\\\\u1E3B\\\\u1E3D\\\\u1E3F\\\\u1E41\\\\u1E43\\\\u1E45\\\\u1E47\\\\u1E49\\\\u1E4B\\\\u1E4D\\\\u1E4F\\\\u1E51\\\\u1E53\\\\u1E55\\\\u1E57\\\\u1E59\\\\u1E5B\\\\u1E5D\\\\u1E5F\\\\u1E61\\\\u1E63\\\\u1E65\\\\u1E67\\\\u1E69\\\\u1E6B\\\\u1E6D\\\\u1E6F\\\\u1E71\\\\u1E73\\\\u1E75\\\\u1E77\\\\u1E79\\\\u1E7B\\\\u1E7D\\\\u1E7F\\\\u1E81\\\\u1E83\\\\u1E85\\\\u1E87\\\\u1E89\\\\u1E8B\\\\u1E8D\\\\u1E8F\\\\u1E91\\\\u1E93\\\\u1E95-\\\\u1E9D\\\\u1E9F\\\\u1EA1\\\\u1EA3\\\\u1EA5\\\\u1EA7\\\\u1EA9\\\\u1EAB\\\\u1EAD\\\\u1EAF\\\\u1EB1\\\\u1EB3\\\\u1EB5\\\\u1EB7\\\\u1EB9\\\\u1EBB\\\\u1EBD\\\\u1EBF\\\\u1EC1\\\\u1EC3\\\\u1EC5\\\\u1EC7\\\\u1EC9\\\\u1ECB\\\\u1ECD\\\\u1ECF\\\\u1ED1\\\\u1ED3\\\\u1ED5\\\\u1ED7\\\\u1ED9\\\\u1EDB\\\\u1EDD\\\\u1EDF\\\\u1EE1\\\\u1EE3\\\\u1EE5\\\\u1EE7\\\\u1EE9\\\\u1EEB\\\\u1EED\\\\u1EEF\\\\u1EF1\\\\u1EF3\\\\u1EF5\\\\u1EF7\\\\u1EF9\\\\u1EFB\\\\u1EFD\\\\u1EFF-\\\\u1F07\\\\u1F10-\\\\u1F15\\\\u1F20-\\\\u1F27\\\\u1F30-\\\\u1F37\\\\u1F40-\\\\u1F45\\\\u1F50-\\\\u1F57\\\\u1F60-\\\\u1F67\\\\u1F70-\\\\u1F7D\\\\u1F80-\\\\u1F87\\\\u1F90-\\\\u1F97\\\\u1FA0-\\\\u1FA7\\\\u1FB0-\\\\u1FB4\\\\u1FB6\\\\u1FB7\\\\u1FBE\\\\u1FC2-\\\\u1FC4\\\\u1FC6\\\\u1FC7\\\\u1FD0-\\\\u1FD3\\\\u1FD6\\\\u1FD7\\\\u1FE0-\\\\u1FE7\\\\u1FF2-\\\\u1FF4\\\\u1FF6\\\\u1FF7\\\\u210A\\\\u210E\\\\u210F\\\\u2113\\\\u212F\\\\u2134\\\\u2139\\\\u213C\\\\u213D\\\\u2146-\\\\u2149\\\\u214E\\\\u2184\\\\u2C30-\\\\u2C5E\\\\u2C61\\\\u2C65\\\\u2C66\\\\u2C68\\\\u2C6A\\\\u2C6C\\\\u2C71\\\\u2C73\\\\u2C74\\\\u2C76-\\\\u2C7B\\\\u2C81\\\\u2C83\\\\u2C85\\\\u2C87\\\\u2C89\\\\u2C8B\\\\u2C8D\\\\u2C8F\\\\u2C91\\\\u2C93\\\\u2C95\\\\u2C97\\\\u2C99\\\\u2C9B\\\\u2C9D\\\\u2C9F\\\\u2CA1\\\\u2CA3\\\\u2CA5\\\\u2CA7\\\\u2CA9\\\\u2CAB\\\\u2CAD\\\\u2CAF\\\\u2CB1\\\\u2CB3\\\\u2CB5\\\\u2CB7\\\\u2CB9\\\\u2CBB\\\\u2CBD\\\\u2CBF\\\\u2CC1\\\\u2CC3\\\\u2CC5\\\\u2CC7\\\\u2CC9\\\\u2CCB\\\\u2CCD\\\\u2CCF\\\\u2CD1\\\\u2CD3\\\\u2CD5\\\\u2CD7\\\\u2CD9\\\\u2CDB\\\\u2CDD\\\\u2CDF\\\\u2CE1\\\\u2CE3\\\\u2CE4\\\\u2CEC\\\\u2CEE\\\\u2CF3\\\\u2D00-\\\\u2D25\\\\u2D27\\\\u2D2D\\\\uA641\\\\uA643\\\\uA645\\\\uA647\\\\uA649\\\\uA64B\\\\uA64D\\\\uA64F\\\\uA651\\\\uA653\\\\uA655\\\\uA657\\\\uA659\\\\uA65B\\\\uA65D\\\\uA65F\\\\uA661\\\\uA663\\\\uA665\\\\uA667\\\\uA669\\\\uA66B\\\\uA66D\\\\uA681\\\\uA683\\\\uA685\\\\uA687\\\\uA689\\\\uA68B\\\\uA68D\\\\uA68F\\\\uA691\\\\uA693\\\\uA695\\\\uA697\\\\uA699\\\\uA69B\\\\uA723\\\\uA725\\\\uA727\\\\uA729\\\\uA72B\\\\uA72D\\\\uA72F-\\\\uA731\\\\uA733\\\\uA735\\\\uA737\\\\uA739\\\\uA73B\\\\uA73D\\\\uA73F\\\\uA741\\\\uA743\\\\uA745\\\\uA747\\\\uA749\\\\uA74B\\\\uA74D\\\\uA74F\\\\uA751\\\\uA753\\\\uA755\\\\uA757\\\\uA759\\\\uA75B\\\\uA75D\\\\uA75F\\\\uA761\\\\uA763\\\\uA765\\\\uA767\\\\uA769\\\\uA76B\\\\uA76D\\\\uA76F\\\\uA771-\\\\uA778\\\\uA77A\\\\uA77C\\\\uA77F\\\\uA781\\\\uA783\\\\uA785\\\\uA787\\\\uA78C\\\\uA78E\\\\uA791\\\\uA793-\\\\uA795\\\\uA797\\\\uA799\\\\uA79B\\\\uA79D\\\\uA79F\\\\uA7A1\\\\uA7A3\\\\uA7A5\\\\uA7A7\\\\uA7A9\\\\uA7AF\\\\uA7B5\\\\uA7B7\\\\uA7B9\\\\uA7BB\\\\uA7BD\\\\uA7BF\\\\uA7C3\\\\uA7C8\\\\uA7CA\\\\uA7F6\\\\uA7FA\\\\uAB30-\\\\uAB5A\\\\uAB60-\\\\uAB68\\\\uAB70-\\\\uABBF\\\\uFB00-\\\\uFB06\\\\uFB13-\\\\uFB17\\\\uFF41-\\\\uFF5A\",\r\n    Lm: \"\\\\u02B0-\\\\u02C1\\\\u02C6-\\\\u02D1\\\\u02E0-\\\\u02E4\\\\u02EC\\\\u02EE\\\\u0374\\\\u037A\\\\u0559\\\\u0640\\\\u06E5\\\\u06E6\\\\u07F4\\\\u07F5\\\\u07FA\\\\u081A\\\\u0824\\\\u0828\\\\u0971\\\\u0E46\\\\u0EC6\\\\u10FC\\\\u17D7\\\\u1843\\\\u1AA7\\\\u1C78-\\\\u1C7D\\\\u1D2C-\\\\u1D6A\\\\u1D78\\\\u1D9B-\\\\u1DBF\\\\u2071\\\\u207F\\\\u2090-\\\\u209C\\\\u2C7C\\\\u2C7D\\\\u2D6F\\\\u2E2F\\\\u3005\\\\u3031-\\\\u3035\\\\u303B\\\\u309D\\\\u309E\\\\u30FC-\\\\u30FE\\\\uA015\\\\uA4F8-\\\\uA4FD\\\\uA60C\\\\uA67F\\\\uA69C\\\\uA69D\\\\uA717-\\\\uA71F\\\\uA770\\\\uA788\\\\uA7F8\\\\uA7F9\\\\uA9CF\\\\uA9E6\\\\uAA70\\\\uAADD\\\\uAAF3\\\\uAAF4\\\\uAB5C-\\\\uAB5F\\\\uAB69\\\\uFF70\\\\uFF9E\\\\uFF9F\",\r\n    Lo: \"\\\\xAA\\\\xBA\\\\u01BB\\\\u01C0-\\\\u01C3\\\\u0294\\\\u05D0-\\\\u05EA\\\\u05EF-\\\\u05F2\\\\u0620-\\\\u063F\\\\u0641-\\\\u064A\\\\u066E\\\\u066F\\\\u0671-\\\\u06D3\\\\u06D5\\\\u06EE\\\\u06EF\\\\u06FA-\\\\u06FC\\\\u06FF\\\\u0710\\\\u0712-\\\\u072F\\\\u074D-\\\\u07A5\\\\u07B1\\\\u07CA-\\\\u07EA\\\\u0800-\\\\u0815\\\\u0840-\\\\u0858\\\\u0860-\\\\u086A\\\\u08A0-\\\\u08B4\\\\u08B6-\\\\u08C7\\\\u0904-\\\\u0939\\\\u093D\\\\u0950\\\\u0958-\\\\u0961\\\\u0972-\\\\u0980\\\\u0985-\\\\u098C\\\\u098F\\\\u0990\\\\u0993-\\\\u09A8\\\\u09AA-\\\\u09B0\\\\u09B2\\\\u09B6-\\\\u09B9\\\\u09BD\\\\u09CE\\\\u09DC\\\\u09DD\\\\u09DF-\\\\u09E1\\\\u09F0\\\\u09F1\\\\u09FC\\\\u0A05-\\\\u0A0A\\\\u0A0F\\\\u0A10\\\\u0A13-\\\\u0A28\\\\u0A2A-\\\\u0A30\\\\u0A32\\\\u0A33\\\\u0A35\\\\u0A36\\\\u0A38\\\\u0A39\\\\u0A59-\\\\u0A5C\\\\u0A5E\\\\u0A72-\\\\u0A74\\\\u0A85-\\\\u0A8D\\\\u0A8F-\\\\u0A91\\\\u0A93-\\\\u0AA8\\\\u0AAA-\\\\u0AB0\\\\u0AB2\\\\u0AB3\\\\u0AB5-\\\\u0AB9\\\\u0ABD\\\\u0AD0\\\\u0AE0\\\\u0AE1\\\\u0AF9\\\\u0B05-\\\\u0B0C\\\\u0B0F\\\\u0B10\\\\u0B13-\\\\u0B28\\\\u0B2A-\\\\u0B30\\\\u0B32\\\\u0B33\\\\u0B35-\\\\u0B39\\\\u0B3D\\\\u0B5C\\\\u0B5D\\\\u0B5F-\\\\u0B61\\\\u0B71\\\\u0B83\\\\u0B85-\\\\u0B8A\\\\u0B8E-\\\\u0B90\\\\u0B92-\\\\u0B95\\\\u0B99\\\\u0B9A\\\\u0B9C\\\\u0B9E\\\\u0B9F\\\\u0BA3\\\\u0BA4\\\\u0BA8-\\\\u0BAA\\\\u0BAE-\\\\u0BB9\\\\u0BD0\\\\u0C05-\\\\u0C0C\\\\u0C0E-\\\\u0C10\\\\u0C12-\\\\u0C28\\\\u0C2A-\\\\u0C39\\\\u0C3D\\\\u0C58-\\\\u0C5A\\\\u0C60\\\\u0C61\\\\u0C80\\\\u0C85-\\\\u0C8C\\\\u0C8E-\\\\u0C90\\\\u0C92-\\\\u0CA8\\\\u0CAA-\\\\u0CB3\\\\u0CB5-\\\\u0CB9\\\\u0CBD\\\\u0CDE\\\\u0CE0\\\\u0CE1\\\\u0CF1\\\\u0CF2\\\\u0D04-\\\\u0D0C\\\\u0D0E-\\\\u0D10\\\\u0D12-\\\\u0D3A\\\\u0D3D\\\\u0D4E\\\\u0D54-\\\\u0D56\\\\u0D5F-\\\\u0D61\\\\u0D7A-\\\\u0D7F\\\\u0D85-\\\\u0D96\\\\u0D9A-\\\\u0DB1\\\\u0DB3-\\\\u0DBB\\\\u0DBD\\\\u0DC0-\\\\u0DC6\\\\u0E01-\\\\u0E30\\\\u0E32\\\\u0E33\\\\u0E40-\\\\u0E45\\\\u0E81\\\\u0E82\\\\u0E84\\\\u0E86-\\\\u0E8A\\\\u0E8C-\\\\u0EA3\\\\u0EA5\\\\u0EA7-\\\\u0EB0\\\\u0EB2\\\\u0EB3\\\\u0EBD\\\\u0EC0-\\\\u0EC4\\\\u0EDC-\\\\u0EDF\\\\u0F00\\\\u0F40-\\\\u0F47\\\\u0F49-\\\\u0F6C\\\\u0F88-\\\\u0F8C\\\\u1000-\\\\u102A\\\\u103F\\\\u1050-\\\\u1055\\\\u105A-\\\\u105D\\\\u1061\\\\u1065\\\\u1066\\\\u106E-\\\\u1070\\\\u1075-\\\\u1081\\\\u108E\\\\u1100-\\\\u1248\\\\u124A-\\\\u124D\\\\u1250-\\\\u1256\\\\u1258\\\\u125A-\\\\u125D\\\\u1260-\\\\u1288\\\\u128A-\\\\u128D\\\\u1290-\\\\u12B0\\\\u12B2-\\\\u12B5\\\\u12B8-\\\\u12BE\\\\u12C0\\\\u12C2-\\\\u12C5\\\\u12C8-\\\\u12D6\\\\u12D8-\\\\u1310\\\\u1312-\\\\u1315\\\\u1318-\\\\u135A\\\\u1380-\\\\u138F\\\\u1401-\\\\u166C\\\\u166F-\\\\u167F\\\\u1681-\\\\u169A\\\\u16A0-\\\\u16EA\\\\u16F1-\\\\u16F8\\\\u1700-\\\\u170C\\\\u170E-\\\\u1711\\\\u1720-\\\\u1731\\\\u1740-\\\\u1751\\\\u1760-\\\\u176C\\\\u176E-\\\\u1770\\\\u1780-\\\\u17B3\\\\u17DC\\\\u1820-\\\\u1842\\\\u1844-\\\\u1878\\\\u1880-\\\\u1884\\\\u1887-\\\\u18A8\\\\u18AA\\\\u18B0-\\\\u18F5\\\\u1900-\\\\u191E\\\\u1950-\\\\u196D\\\\u1970-\\\\u1974\\\\u1980-\\\\u19AB\\\\u19B0-\\\\u19C9\\\\u1A00-\\\\u1A16\\\\u1A20-\\\\u1A54\\\\u1B05-\\\\u1B33\\\\u1B45-\\\\u1B4B\\\\u1B83-\\\\u1BA0\\\\u1BAE\\\\u1BAF\\\\u1BBA-\\\\u1BE5\\\\u1C00-\\\\u1C23\\\\u1C4D-\\\\u1C4F\\\\u1C5A-\\\\u1C77\\\\u1CE9-\\\\u1CEC\\\\u1CEE-\\\\u1CF3\\\\u1CF5\\\\u1CF6\\\\u1CFA\\\\u2135-\\\\u2138\\\\u2D30-\\\\u2D67\\\\u2D80-\\\\u2D96\\\\u2DA0-\\\\u2DA6\\\\u2DA8-\\\\u2DAE\\\\u2DB0-\\\\u2DB6\\\\u2DB8-\\\\u2DBE\\\\u2DC0-\\\\u2DC6\\\\u2DC8-\\\\u2DCE\\\\u2DD0-\\\\u2DD6\\\\u2DD8-\\\\u2DDE\\\\u3006\\\\u303C\\\\u3041-\\\\u3096\\\\u309F\\\\u30A1-\\\\u30FA\\\\u30FF\\\\u3105-\\\\u312F\\\\u3131-\\\\u318E\\\\u31A0-\\\\u31BF\\\\u31F0-\\\\u31FF\\\\u3400-\\\\u4DBF\\\\u4E00-\\\\u9FFC\\\\uA000-\\\\uA014\\\\uA016-\\\\uA48C\\\\uA4D0-\\\\uA4F7\\\\uA500-\\\\uA60B\\\\uA610-\\\\uA61F\\\\uA62A\\\\uA62B\\\\uA66E\\\\uA6A0-\\\\uA6E5\\\\uA78F\\\\uA7F7\\\\uA7FB-\\\\uA801\\\\uA803-\\\\uA805\\\\uA807-\\\\uA80A\\\\uA80C-\\\\uA822\\\\uA840-\\\\uA873\\\\uA882-\\\\uA8B3\\\\uA8F2-\\\\uA8F7\\\\uA8FB\\\\uA8FD\\\\uA8FE\\\\uA90A-\\\\uA925\\\\uA930-\\\\uA946\\\\uA960-\\\\uA97C\\\\uA984-\\\\uA9B2\\\\uA9E0-\\\\uA9E4\\\\uA9E7-\\\\uA9EF\\\\uA9FA-\\\\uA9FE\\\\uAA00-\\\\uAA28\\\\uAA40-\\\\uAA42\\\\uAA44-\\\\uAA4B\\\\uAA60-\\\\uAA6F\\\\uAA71-\\\\uAA76\\\\uAA7A\\\\uAA7E-\\\\uAAAF\\\\uAAB1\\\\uAAB5\\\\uAAB6\\\\uAAB9-\\\\uAABD\\\\uAAC0\\\\uAAC2\\\\uAADB\\\\uAADC\\\\uAAE0-\\\\uAAEA\\\\uAAF2\\\\uAB01-\\\\uAB06\\\\uAB09-\\\\uAB0E\\\\uAB11-\\\\uAB16\\\\uAB20-\\\\uAB26\\\\uAB28-\\\\uAB2E\\\\uABC0-\\\\uABE2\\\\uAC00-\\\\uD7A3\\\\uD7B0-\\\\uD7C6\\\\uD7CB-\\\\uD7FB\\\\uF900-\\\\uFA6D\\\\uFA70-\\\\uFAD9\\\\uFB1D\\\\uFB1F-\\\\uFB28\\\\uFB2A-\\\\uFB36\\\\uFB38-\\\\uFB3C\\\\uFB3E\\\\uFB40\\\\uFB41\\\\uFB43\\\\uFB44\\\\uFB46-\\\\uFBB1\\\\uFBD3-\\\\uFD3D\\\\uFD50-\\\\uFD8F\\\\uFD92-\\\\uFDC7\\\\uFDF0-\\\\uFDFB\\\\uFE70-\\\\uFE74\\\\uFE76-\\\\uFEFC\\\\uFF66-\\\\uFF6F\\\\uFF71-\\\\uFF9D\\\\uFFA0-\\\\uFFBE\\\\uFFC2-\\\\uFFC7\\\\uFFCA-\\\\uFFCF\\\\uFFD2-\\\\uFFD7\\\\uFFDA-\\\\uFFDC\",\r\n    Lt: \"\\\\u01C5\\\\u01C8\\\\u01CB\\\\u01F2\\\\u1F88-\\\\u1F8F\\\\u1F98-\\\\u1F9F\\\\u1FA8-\\\\u1FAF\\\\u1FBC\\\\u1FCC\\\\u1FFC\",\r\n    Lu: \"A-Z\\\\xC0-\\\\xD6\\\\xD8-\\\\xDE\\\\u0100\\\\u0102\\\\u0104\\\\u0106\\\\u0108\\\\u010A\\\\u010C\\\\u010E\\\\u0110\\\\u0112\\\\u0114\\\\u0116\\\\u0118\\\\u011A\\\\u011C\\\\u011E\\\\u0120\\\\u0122\\\\u0124\\\\u0126\\\\u0128\\\\u012A\\\\u012C\\\\u012E\\\\u0130\\\\u0132\\\\u0134\\\\u0136\\\\u0139\\\\u013B\\\\u013D\\\\u013F\\\\u0141\\\\u0143\\\\u0145\\\\u0147\\\\u014A\\\\u014C\\\\u014E\\\\u0150\\\\u0152\\\\u0154\\\\u0156\\\\u0158\\\\u015A\\\\u015C\\\\u015E\\\\u0160\\\\u0162\\\\u0164\\\\u0166\\\\u0168\\\\u016A\\\\u016C\\\\u016E\\\\u0170\\\\u0172\\\\u0174\\\\u0176\\\\u0178\\\\u0179\\\\u017B\\\\u017D\\\\u0181\\\\u0182\\\\u0184\\\\u0186\\\\u0187\\\\u0189-\\\\u018B\\\\u018E-\\\\u0191\\\\u0193\\\\u0194\\\\u0196-\\\\u0198\\\\u019C\\\\u019D\\\\u019F\\\\u01A0\\\\u01A2\\\\u01A4\\\\u01A6\\\\u01A7\\\\u01A9\\\\u01AC\\\\u01AE\\\\u01AF\\\\u01B1-\\\\u01B3\\\\u01B5\\\\u01B7\\\\u01B8\\\\u01BC\\\\u01C4\\\\u01C7\\\\u01CA\\\\u01CD\\\\u01CF\\\\u01D1\\\\u01D3\\\\u01D5\\\\u01D7\\\\u01D9\\\\u01DB\\\\u01DE\\\\u01E0\\\\u01E2\\\\u01E4\\\\u01E6\\\\u01E8\\\\u01EA\\\\u01EC\\\\u01EE\\\\u01F1\\\\u01F4\\\\u01F6-\\\\u01F8\\\\u01FA\\\\u01FC\\\\u01FE\\\\u0200\\\\u0202\\\\u0204\\\\u0206\\\\u0208\\\\u020A\\\\u020C\\\\u020E\\\\u0210\\\\u0212\\\\u0214\\\\u0216\\\\u0218\\\\u021A\\\\u021C\\\\u021E\\\\u0220\\\\u0222\\\\u0224\\\\u0226\\\\u0228\\\\u022A\\\\u022C\\\\u022E\\\\u0230\\\\u0232\\\\u023A\\\\u023B\\\\u023D\\\\u023E\\\\u0241\\\\u0243-\\\\u0246\\\\u0248\\\\u024A\\\\u024C\\\\u024E\\\\u0370\\\\u0372\\\\u0376\\\\u037F\\\\u0386\\\\u0388-\\\\u038A\\\\u038C\\\\u038E\\\\u038F\\\\u0391-\\\\u03A1\\\\u03A3-\\\\u03AB\\\\u03CF\\\\u03D2-\\\\u03D4\\\\u03D8\\\\u03DA\\\\u03DC\\\\u03DE\\\\u03E0\\\\u03E2\\\\u03E4\\\\u03E6\\\\u03E8\\\\u03EA\\\\u03EC\\\\u03EE\\\\u03F4\\\\u03F7\\\\u03F9\\\\u03FA\\\\u03FD-\\\\u042F\\\\u0460\\\\u0462\\\\u0464\\\\u0466\\\\u0468\\\\u046A\\\\u046C\\\\u046E\\\\u0470\\\\u0472\\\\u0474\\\\u0476\\\\u0478\\\\u047A\\\\u047C\\\\u047E\\\\u0480\\\\u048A\\\\u048C\\\\u048E\\\\u0490\\\\u0492\\\\u0494\\\\u0496\\\\u0498\\\\u049A\\\\u049C\\\\u049E\\\\u04A0\\\\u04A2\\\\u04A4\\\\u04A6\\\\u04A8\\\\u04AA\\\\u04AC\\\\u04AE\\\\u04B0\\\\u04B2\\\\u04B4\\\\u04B6\\\\u04B8\\\\u04BA\\\\u04BC\\\\u04BE\\\\u04C0\\\\u04C1\\\\u04C3\\\\u04C5\\\\u04C7\\\\u04C9\\\\u04CB\\\\u04CD\\\\u04D0\\\\u04D2\\\\u04D4\\\\u04D6\\\\u04D8\\\\u04DA\\\\u04DC\\\\u04DE\\\\u04E0\\\\u04E2\\\\u04E4\\\\u04E6\\\\u04E8\\\\u04EA\\\\u04EC\\\\u04EE\\\\u04F0\\\\u04F2\\\\u04F4\\\\u04F6\\\\u04F8\\\\u04FA\\\\u04FC\\\\u04FE\\\\u0500\\\\u0502\\\\u0504\\\\u0506\\\\u0508\\\\u050A\\\\u050C\\\\u050E\\\\u0510\\\\u0512\\\\u0514\\\\u0516\\\\u0518\\\\u051A\\\\u051C\\\\u051E\\\\u0520\\\\u0522\\\\u0524\\\\u0526\\\\u0528\\\\u052A\\\\u052C\\\\u052E\\\\u0531-\\\\u0556\\\\u10A0-\\\\u10C5\\\\u10C7\\\\u10CD\\\\u13A0-\\\\u13F5\\\\u1C90-\\\\u1CBA\\\\u1CBD-\\\\u1CBF\\\\u1E00\\\\u1E02\\\\u1E04\\\\u1E06\\\\u1E08\\\\u1E0A\\\\u1E0C\\\\u1E0E\\\\u1E10\\\\u1E12\\\\u1E14\\\\u1E16\\\\u1E18\\\\u1E1A\\\\u1E1C\\\\u1E1E\\\\u1E20\\\\u1E22\\\\u1E24\\\\u1E26\\\\u1E28\\\\u1E2A\\\\u1E2C\\\\u1E2E\\\\u1E30\\\\u1E32\\\\u1E34\\\\u1E36\\\\u1E38\\\\u1E3A\\\\u1E3C\\\\u1E3E\\\\u1E40\\\\u1E42\\\\u1E44\\\\u1E46\\\\u1E48\\\\u1E4A\\\\u1E4C\\\\u1E4E\\\\u1E50\\\\u1E52\\\\u1E54\\\\u1E56\\\\u1E58\\\\u1E5A\\\\u1E5C\\\\u1E5E\\\\u1E60\\\\u1E62\\\\u1E64\\\\u1E66\\\\u1E68\\\\u1E6A\\\\u1E6C\\\\u1E6E\\\\u1E70\\\\u1E72\\\\u1E74\\\\u1E76\\\\u1E78\\\\u1E7A\\\\u1E7C\\\\u1E7E\\\\u1E80\\\\u1E82\\\\u1E84\\\\u1E86\\\\u1E88\\\\u1E8A\\\\u1E8C\\\\u1E8E\\\\u1E90\\\\u1E92\\\\u1E94\\\\u1E9E\\\\u1EA0\\\\u1EA2\\\\u1EA4\\\\u1EA6\\\\u1EA8\\\\u1EAA\\\\u1EAC\\\\u1EAE\\\\u1EB0\\\\u1EB2\\\\u1EB4\\\\u1EB6\\\\u1EB8\\\\u1EBA\\\\u1EBC\\\\u1EBE\\\\u1EC0\\\\u1EC2\\\\u1EC4\\\\u1EC6\\\\u1EC8\\\\u1ECA\\\\u1ECC\\\\u1ECE\\\\u1ED0\\\\u1ED2\\\\u1ED4\\\\u1ED6\\\\u1ED8\\\\u1EDA\\\\u1EDC\\\\u1EDE\\\\u1EE0\\\\u1EE2\\\\u1EE4\\\\u1EE6\\\\u1EE8\\\\u1EEA\\\\u1EEC\\\\u1EEE\\\\u1EF0\\\\u1EF2\\\\u1EF4\\\\u1EF6\\\\u1EF8\\\\u1EFA\\\\u1EFC\\\\u1EFE\\\\u1F08-\\\\u1F0F\\\\u1F18-\\\\u1F1D\\\\u1F28-\\\\u1F2F\\\\u1F38-\\\\u1F3F\\\\u1F48-\\\\u1F4D\\\\u1F59\\\\u1F5B\\\\u1F5D\\\\u1F5F\\\\u1F68-\\\\u1F6F\\\\u1FB8-\\\\u1FBB\\\\u1FC8-\\\\u1FCB\\\\u1FD8-\\\\u1FDB\\\\u1FE8-\\\\u1FEC\\\\u1FF8-\\\\u1FFB\\\\u2102\\\\u2107\\\\u210B-\\\\u210D\\\\u2110-\\\\u2112\\\\u2115\\\\u2119-\\\\u211D\\\\u2124\\\\u2126\\\\u2128\\\\u212A-\\\\u212D\\\\u2130-\\\\u2133\\\\u213E\\\\u213F\\\\u2145\\\\u2183\\\\u2C00-\\\\u2C2E\\\\u2C60\\\\u2C62-\\\\u2C64\\\\u2C67\\\\u2C69\\\\u2C6B\\\\u2C6D-\\\\u2C70\\\\u2C72\\\\u2C75\\\\u2C7E-\\\\u2C80\\\\u2C82\\\\u2C84\\\\u2C86\\\\u2C88\\\\u2C8A\\\\u2C8C\\\\u2C8E\\\\u2C90\\\\u2C92\\\\u2C94\\\\u2C96\\\\u2C98\\\\u2C9A\\\\u2C9C\\\\u2C9E\\\\u2CA0\\\\u2CA2\\\\u2CA4\\\\u2CA6\\\\u2CA8\\\\u2CAA\\\\u2CAC\\\\u2CAE\\\\u2CB0\\\\u2CB2\\\\u2CB4\\\\u2CB6\\\\u2CB8\\\\u2CBA\\\\u2CBC\\\\u2CBE\\\\u2CC0\\\\u2CC2\\\\u2CC4\\\\u2CC6\\\\u2CC8\\\\u2CCA\\\\u2CCC\\\\u2CCE\\\\u2CD0\\\\u2CD2\\\\u2CD4\\\\u2CD6\\\\u2CD8\\\\u2CDA\\\\u2CDC\\\\u2CDE\\\\u2CE0\\\\u2CE2\\\\u2CEB\\\\u2CED\\\\u2CF2\\\\uA640\\\\uA642\\\\uA644\\\\uA646\\\\uA648\\\\uA64A\\\\uA64C\\\\uA64E\\\\uA650\\\\uA652\\\\uA654\\\\uA656\\\\uA658\\\\uA65A\\\\uA65C\\\\uA65E\\\\uA660\\\\uA662\\\\uA664\\\\uA666\\\\uA668\\\\uA66A\\\\uA66C\\\\uA680\\\\uA682\\\\uA684\\\\uA686\\\\uA688\\\\uA68A\\\\uA68C\\\\uA68E\\\\uA690\\\\uA692\\\\uA694\\\\uA696\\\\uA698\\\\uA69A\\\\uA722\\\\uA724\\\\uA726\\\\uA728\\\\uA72A\\\\uA72C\\\\uA72E\\\\uA732\\\\uA734\\\\uA736\\\\uA738\\\\uA73A\\\\uA73C\\\\uA73E\\\\uA740\\\\uA742\\\\uA744\\\\uA746\\\\uA748\\\\uA74A\\\\uA74C\\\\uA74E\\\\uA750\\\\uA752\\\\uA754\\\\uA756\\\\uA758\\\\uA75A\\\\uA75C\\\\uA75E\\\\uA760\\\\uA762\\\\uA764\\\\uA766\\\\uA768\\\\uA76A\\\\uA76C\\\\uA76E\\\\uA779\\\\uA77B\\\\uA77D\\\\uA77E\\\\uA780\\\\uA782\\\\uA784\\\\uA786\\\\uA78B\\\\uA78D\\\\uA790\\\\uA792\\\\uA796\\\\uA798\\\\uA79A\\\\uA79C\\\\uA79E\\\\uA7A0\\\\uA7A2\\\\uA7A4\\\\uA7A6\\\\uA7A8\\\\uA7AA-\\\\uA7AE\\\\uA7B0-\\\\uA7B4\\\\uA7B6\\\\uA7B8\\\\uA7BA\\\\uA7BC\\\\uA7BE\\\\uA7C2\\\\uA7C4-\\\\uA7C7\\\\uA7C9\\\\uA7F5\\\\uFF21-\\\\uFF3A\",\r\n    M: \"\\\\u0300-\\\\u036F\\\\u0483-\\\\u0489\\\\u0591-\\\\u05BD\\\\u05BF\\\\u05C1\\\\u05C2\\\\u05C4\\\\u05C5\\\\u05C7\\\\u0610-\\\\u061A\\\\u064B-\\\\u065F\\\\u0670\\\\u06D6-\\\\u06DC\\\\u06DF-\\\\u06E4\\\\u06E7\\\\u06E8\\\\u06EA-\\\\u06ED\\\\u0711\\\\u0730-\\\\u074A\\\\u07A6-\\\\u07B0\\\\u07EB-\\\\u07F3\\\\u07FD\\\\u0816-\\\\u0819\\\\u081B-\\\\u0823\\\\u0825-\\\\u0827\\\\u0829-\\\\u082D\\\\u0859-\\\\u085B\\\\u08D3-\\\\u08E1\\\\u08E3-\\\\u0903\\\\u093A-\\\\u093C\\\\u093E-\\\\u094F\\\\u0951-\\\\u0957\\\\u0962\\\\u0963\\\\u0981-\\\\u0983\\\\u09BC\\\\u09BE-\\\\u09C4\\\\u09C7\\\\u09C8\\\\u09CB-\\\\u09CD\\\\u09D7\\\\u09E2\\\\u09E3\\\\u09FE\\\\u0A01-\\\\u0A03\\\\u0A3C\\\\u0A3E-\\\\u0A42\\\\u0A47\\\\u0A48\\\\u0A4B-\\\\u0A4D\\\\u0A51\\\\u0A70\\\\u0A71\\\\u0A75\\\\u0A81-\\\\u0A83\\\\u0ABC\\\\u0ABE-\\\\u0AC5\\\\u0AC7-\\\\u0AC9\\\\u0ACB-\\\\u0ACD\\\\u0AE2\\\\u0AE3\\\\u0AFA-\\\\u0AFF\\\\u0B01-\\\\u0B03\\\\u0B3C\\\\u0B3E-\\\\u0B44\\\\u0B47\\\\u0B48\\\\u0B4B-\\\\u0B4D\\\\u0B55-\\\\u0B57\\\\u0B62\\\\u0B63\\\\u0B82\\\\u0BBE-\\\\u0BC2\\\\u0BC6-\\\\u0BC8\\\\u0BCA-\\\\u0BCD\\\\u0BD7\\\\u0C00-\\\\u0C04\\\\u0C3E-\\\\u0C44\\\\u0C46-\\\\u0C48\\\\u0C4A-\\\\u0C4D\\\\u0C55\\\\u0C56\\\\u0C62\\\\u0C63\\\\u0C81-\\\\u0C83\\\\u0CBC\\\\u0CBE-\\\\u0CC4\\\\u0CC6-\\\\u0CC8\\\\u0CCA-\\\\u0CCD\\\\u0CD5\\\\u0CD6\\\\u0CE2\\\\u0CE3\\\\u0D00-\\\\u0D03\\\\u0D3B\\\\u0D3C\\\\u0D3E-\\\\u0D44\\\\u0D46-\\\\u0D48\\\\u0D4A-\\\\u0D4D\\\\u0D57\\\\u0D62\\\\u0D63\\\\u0D81-\\\\u0D83\\\\u0DCA\\\\u0DCF-\\\\u0DD4\\\\u0DD6\\\\u0DD8-\\\\u0DDF\\\\u0DF2\\\\u0DF3\\\\u0E31\\\\u0E34-\\\\u0E3A\\\\u0E47-\\\\u0E4E\\\\u0EB1\\\\u0EB4-\\\\u0EBC\\\\u0EC8-\\\\u0ECD\\\\u0F18\\\\u0F19\\\\u0F35\\\\u0F37\\\\u0F39\\\\u0F3E\\\\u0F3F\\\\u0F71-\\\\u0F84\\\\u0F86\\\\u0F87\\\\u0F8D-\\\\u0F97\\\\u0F99-\\\\u0FBC\\\\u0FC6\\\\u102B-\\\\u103E\\\\u1056-\\\\u1059\\\\u105E-\\\\u1060\\\\u1062-\\\\u1064\\\\u1067-\\\\u106D\\\\u1071-\\\\u1074\\\\u1082-\\\\u108D\\\\u108F\\\\u109A-\\\\u109D\\\\u135D-\\\\u135F\\\\u1712-\\\\u1714\\\\u1732-\\\\u1734\\\\u1752\\\\u1753\\\\u1772\\\\u1773\\\\u17B4-\\\\u17D3\\\\u17DD\\\\u180B-\\\\u180D\\\\u1885\\\\u1886\\\\u18A9\\\\u1920-\\\\u192B\\\\u1930-\\\\u193B\\\\u1A17-\\\\u1A1B\\\\u1A55-\\\\u1A5E\\\\u1A60-\\\\u1A7C\\\\u1A7F\\\\u1AB0-\\\\u1AC0\\\\u1B00-\\\\u1B04\\\\u1B34-\\\\u1B44\\\\u1B6B-\\\\u1B73\\\\u1B80-\\\\u1B82\\\\u1BA1-\\\\u1BAD\\\\u1BE6-\\\\u1BF3\\\\u1C24-\\\\u1C37\\\\u1CD0-\\\\u1CD2\\\\u1CD4-\\\\u1CE8\\\\u1CED\\\\u1CF4\\\\u1CF7-\\\\u1CF9\\\\u1DC0-\\\\u1DF9\\\\u1DFB-\\\\u1DFF\\\\u20D0-\\\\u20F0\\\\u2CEF-\\\\u2CF1\\\\u2D7F\\\\u2DE0-\\\\u2DFF\\\\u302A-\\\\u302F\\\\u3099\\\\u309A\\\\uA66F-\\\\uA672\\\\uA674-\\\\uA67D\\\\uA69E\\\\uA69F\\\\uA6F0\\\\uA6F1\\\\uA802\\\\uA806\\\\uA80B\\\\uA823-\\\\uA827\\\\uA82C\\\\uA880\\\\uA881\\\\uA8B4-\\\\uA8C5\\\\uA8E0-\\\\uA8F1\\\\uA8FF\\\\uA926-\\\\uA92D\\\\uA947-\\\\uA953\\\\uA980-\\\\uA983\\\\uA9B3-\\\\uA9C0\\\\uA9E5\\\\uAA29-\\\\uAA36\\\\uAA43\\\\uAA4C\\\\uAA4D\\\\uAA7B-\\\\uAA7D\\\\uAAB0\\\\uAAB2-\\\\uAAB4\\\\uAAB7\\\\uAAB8\\\\uAABE\\\\uAABF\\\\uAAC1\\\\uAAEB-\\\\uAAEF\\\\uAAF5\\\\uAAF6\\\\uABE3-\\\\uABEA\\\\uABEC\\\\uABED\\\\uFB1E\\\\uFE00-\\\\uFE0F\\\\uFE20-\\\\uFE2F\",\r\n    Mc: \"\\\\u0903\\\\u093B\\\\u093E-\\\\u0940\\\\u0949-\\\\u094C\\\\u094E\\\\u094F\\\\u0982\\\\u0983\\\\u09BE-\\\\u09C0\\\\u09C7\\\\u09C8\\\\u09CB\\\\u09CC\\\\u09D7\\\\u0A03\\\\u0A3E-\\\\u0A40\\\\u0A83\\\\u0ABE-\\\\u0AC0\\\\u0AC9\\\\u0ACB\\\\u0ACC\\\\u0B02\\\\u0B03\\\\u0B3E\\\\u0B40\\\\u0B47\\\\u0B48\\\\u0B4B\\\\u0B4C\\\\u0B57\\\\u0BBE\\\\u0BBF\\\\u0BC1\\\\u0BC2\\\\u0BC6-\\\\u0BC8\\\\u0BCA-\\\\u0BCC\\\\u0BD7\\\\u0C01-\\\\u0C03\\\\u0C41-\\\\u0C44\\\\u0C82\\\\u0C83\\\\u0CBE\\\\u0CC0-\\\\u0CC4\\\\u0CC7\\\\u0CC8\\\\u0CCA\\\\u0CCB\\\\u0CD5\\\\u0CD6\\\\u0D02\\\\u0D03\\\\u0D3E-\\\\u0D40\\\\u0D46-\\\\u0D48\\\\u0D4A-\\\\u0D4C\\\\u0D57\\\\u0D82\\\\u0D83\\\\u0DCF-\\\\u0DD1\\\\u0DD8-\\\\u0DDF\\\\u0DF2\\\\u0DF3\\\\u0F3E\\\\u0F3F\\\\u0F7F\\\\u102B\\\\u102C\\\\u1031\\\\u1038\\\\u103B\\\\u103C\\\\u1056\\\\u1057\\\\u1062-\\\\u1064\\\\u1067-\\\\u106D\\\\u1083\\\\u1084\\\\u1087-\\\\u108C\\\\u108F\\\\u109A-\\\\u109C\\\\u17B6\\\\u17BE-\\\\u17C5\\\\u17C7\\\\u17C8\\\\u1923-\\\\u1926\\\\u1929-\\\\u192B\\\\u1930\\\\u1931\\\\u1933-\\\\u1938\\\\u1A19\\\\u1A1A\\\\u1A55\\\\u1A57\\\\u1A61\\\\u1A63\\\\u1A64\\\\u1A6D-\\\\u1A72\\\\u1B04\\\\u1B35\\\\u1B3B\\\\u1B3D-\\\\u1B41\\\\u1B43\\\\u1B44\\\\u1B82\\\\u1BA1\\\\u1BA6\\\\u1BA7\\\\u1BAA\\\\u1BE7\\\\u1BEA-\\\\u1BEC\\\\u1BEE\\\\u1BF2\\\\u1BF3\\\\u1C24-\\\\u1C2B\\\\u1C34\\\\u1C35\\\\u1CE1\\\\u1CF7\\\\u302E\\\\u302F\\\\uA823\\\\uA824\\\\uA827\\\\uA880\\\\uA881\\\\uA8B4-\\\\uA8C3\\\\uA952\\\\uA953\\\\uA983\\\\uA9B4\\\\uA9B5\\\\uA9BA\\\\uA9BB\\\\uA9BE-\\\\uA9C0\\\\uAA2F\\\\uAA30\\\\uAA33\\\\uAA34\\\\uAA4D\\\\uAA7B\\\\uAA7D\\\\uAAEB\\\\uAAEE\\\\uAAEF\\\\uAAF5\\\\uABE3\\\\uABE4\\\\uABE6\\\\uABE7\\\\uABE9\\\\uABEA\\\\uABEC\",\r\n    Me: \"\\\\u0488\\\\u0489\\\\u1ABE\\\\u20DD-\\\\u20E0\\\\u20E2-\\\\u20E4\\\\uA670-\\\\uA672\",\r\n    Mn: \"\\\\u0300-\\\\u036F\\\\u0483-\\\\u0487\\\\u0591-\\\\u05BD\\\\u05BF\\\\u05C1\\\\u05C2\\\\u05C4\\\\u05C5\\\\u05C7\\\\u0610-\\\\u061A\\\\u064B-\\\\u065F\\\\u0670\\\\u06D6-\\\\u06DC\\\\u06DF-\\\\u06E4\\\\u06E7\\\\u06E8\\\\u06EA-\\\\u06ED\\\\u0711\\\\u0730-\\\\u074A\\\\u07A6-\\\\u07B0\\\\u07EB-\\\\u07F3\\\\u07FD\\\\u0816-\\\\u0819\\\\u081B-\\\\u0823\\\\u0825-\\\\u0827\\\\u0829-\\\\u082D\\\\u0859-\\\\u085B\\\\u08D3-\\\\u08E1\\\\u08E3-\\\\u0902\\\\u093A\\\\u093C\\\\u0941-\\\\u0948\\\\u094D\\\\u0951-\\\\u0957\\\\u0962\\\\u0963\\\\u0981\\\\u09BC\\\\u09C1-\\\\u09C4\\\\u09CD\\\\u09E2\\\\u09E3\\\\u09FE\\\\u0A01\\\\u0A02\\\\u0A3C\\\\u0A41\\\\u0A42\\\\u0A47\\\\u0A48\\\\u0A4B-\\\\u0A4D\\\\u0A51\\\\u0A70\\\\u0A71\\\\u0A75\\\\u0A81\\\\u0A82\\\\u0ABC\\\\u0AC1-\\\\u0AC5\\\\u0AC7\\\\u0AC8\\\\u0ACD\\\\u0AE2\\\\u0AE3\\\\u0AFA-\\\\u0AFF\\\\u0B01\\\\u0B3C\\\\u0B3F\\\\u0B41-\\\\u0B44\\\\u0B4D\\\\u0B55\\\\u0B56\\\\u0B62\\\\u0B63\\\\u0B82\\\\u0BC0\\\\u0BCD\\\\u0C00\\\\u0C04\\\\u0C3E-\\\\u0C40\\\\u0C46-\\\\u0C48\\\\u0C4A-\\\\u0C4D\\\\u0C55\\\\u0C56\\\\u0C62\\\\u0C63\\\\u0C81\\\\u0CBC\\\\u0CBF\\\\u0CC6\\\\u0CCC\\\\u0CCD\\\\u0CE2\\\\u0CE3\\\\u0D00\\\\u0D01\\\\u0D3B\\\\u0D3C\\\\u0D41-\\\\u0D44\\\\u0D4D\\\\u0D62\\\\u0D63\\\\u0D81\\\\u0DCA\\\\u0DD2-\\\\u0DD4\\\\u0DD6\\\\u0E31\\\\u0E34-\\\\u0E3A\\\\u0E47-\\\\u0E4E\\\\u0EB1\\\\u0EB4-\\\\u0EBC\\\\u0EC8-\\\\u0ECD\\\\u0F18\\\\u0F19\\\\u0F35\\\\u0F37\\\\u0F39\\\\u0F71-\\\\u0F7E\\\\u0F80-\\\\u0F84\\\\u0F86\\\\u0F87\\\\u0F8D-\\\\u0F97\\\\u0F99-\\\\u0FBC\\\\u0FC6\\\\u102D-\\\\u1030\\\\u1032-\\\\u1037\\\\u1039\\\\u103A\\\\u103D\\\\u103E\\\\u1058\\\\u1059\\\\u105E-\\\\u1060\\\\u1071-\\\\u1074\\\\u1082\\\\u1085\\\\u1086\\\\u108D\\\\u109D\\\\u135D-\\\\u135F\\\\u1712-\\\\u1714\\\\u1732-\\\\u1734\\\\u1752\\\\u1753\\\\u1772\\\\u1773\\\\u17B4\\\\u17B5\\\\u17B7-\\\\u17BD\\\\u17C6\\\\u17C9-\\\\u17D3\\\\u17DD\\\\u180B-\\\\u180D\\\\u1885\\\\u1886\\\\u18A9\\\\u1920-\\\\u1922\\\\u1927\\\\u1928\\\\u1932\\\\u1939-\\\\u193B\\\\u1A17\\\\u1A18\\\\u1A1B\\\\u1A56\\\\u1A58-\\\\u1A5E\\\\u1A60\\\\u1A62\\\\u1A65-\\\\u1A6C\\\\u1A73-\\\\u1A7C\\\\u1A7F\\\\u1AB0-\\\\u1ABD\\\\u1ABF\\\\u1AC0\\\\u1B00-\\\\u1B03\\\\u1B34\\\\u1B36-\\\\u1B3A\\\\u1B3C\\\\u1B42\\\\u1B6B-\\\\u1B73\\\\u1B80\\\\u1B81\\\\u1BA2-\\\\u1BA5\\\\u1BA8\\\\u1BA9\\\\u1BAB-\\\\u1BAD\\\\u1BE6\\\\u1BE8\\\\u1BE9\\\\u1BED\\\\u1BEF-\\\\u1BF1\\\\u1C2C-\\\\u1C33\\\\u1C36\\\\u1C37\\\\u1CD0-\\\\u1CD2\\\\u1CD4-\\\\u1CE0\\\\u1CE2-\\\\u1CE8\\\\u1CED\\\\u1CF4\\\\u1CF8\\\\u1CF9\\\\u1DC0-\\\\u1DF9\\\\u1DFB-\\\\u1DFF\\\\u20D0-\\\\u20DC\\\\u20E1\\\\u20E5-\\\\u20F0\\\\u2CEF-\\\\u2CF1\\\\u2D7F\\\\u2DE0-\\\\u2DFF\\\\u302A-\\\\u302D\\\\u3099\\\\u309A\\\\uA66F\\\\uA674-\\\\uA67D\\\\uA69E\\\\uA69F\\\\uA6F0\\\\uA6F1\\\\uA802\\\\uA806\\\\uA80B\\\\uA825\\\\uA826\\\\uA82C\\\\uA8C4\\\\uA8C5\\\\uA8E0-\\\\uA8F1\\\\uA8FF\\\\uA926-\\\\uA92D\\\\uA947-\\\\uA951\\\\uA980-\\\\uA982\\\\uA9B3\\\\uA9B6-\\\\uA9B9\\\\uA9BC\\\\uA9BD\\\\uA9E5\\\\uAA29-\\\\uAA2E\\\\uAA31\\\\uAA32\\\\uAA35\\\\uAA36\\\\uAA43\\\\uAA4C\\\\uAA7C\\\\uAAB0\\\\uAAB2-\\\\uAAB4\\\\uAAB7\\\\uAAB8\\\\uAABE\\\\uAABF\\\\uAAC1\\\\uAAEC\\\\uAAED\\\\uAAF6\\\\uABE5\\\\uABE8\\\\uABED\\\\uFB1E\\\\uFE00-\\\\uFE0F\\\\uFE20-\\\\uFE2F\",\r\n    Nd: \"0-9\\\\u0660-\\\\u0669\\\\u06F0-\\\\u06F9\\\\u07C0-\\\\u07C9\\\\u0966-\\\\u096F\\\\u09E6-\\\\u09EF\\\\u0A66-\\\\u0A6F\\\\u0AE6-\\\\u0AEF\\\\u0B66-\\\\u0B6F\\\\u0BE6-\\\\u0BEF\\\\u0C66-\\\\u0C6F\\\\u0CE6-\\\\u0CEF\\\\u0D66-\\\\u0D6F\\\\u0DE6-\\\\u0DEF\\\\u0E50-\\\\u0E59\\\\u0ED0-\\\\u0ED9\\\\u0F20-\\\\u0F29\\\\u1040-\\\\u1049\\\\u1090-\\\\u1099\\\\u17E0-\\\\u17E9\\\\u1810-\\\\u1819\\\\u1946-\\\\u194F\\\\u19D0-\\\\u19D9\\\\u1A80-\\\\u1A89\\\\u1A90-\\\\u1A99\\\\u1B50-\\\\u1B59\\\\u1BB0-\\\\u1BB9\\\\u1C40-\\\\u1C49\\\\u1C50-\\\\u1C59\\\\uA620-\\\\uA629\\\\uA8D0-\\\\uA8D9\\\\uA900-\\\\uA909\\\\uA9D0-\\\\uA9D9\\\\uA9F0-\\\\uA9F9\\\\uAA50-\\\\uAA59\\\\uABF0-\\\\uABF9\\\\uFF10-\\\\uFF19\",\r\n    Nl: \"\\\\u16EE-\\\\u16F0\\\\u2160-\\\\u2182\\\\u2185-\\\\u2188\\\\u3007\\\\u3021-\\\\u3029\\\\u3038-\\\\u303A\\\\uA6E6-\\\\uA6EF\",\r\n    No: \"\\\\xB2\\\\xB3\\\\xB9\\\\xBC-\\\\xBE\\\\u09F4-\\\\u09F9\\\\u0B72-\\\\u0B77\\\\u0BF0-\\\\u0BF2\\\\u0C78-\\\\u0C7E\\\\u0D58-\\\\u0D5E\\\\u0D70-\\\\u0D78\\\\u0F2A-\\\\u0F33\\\\u1369-\\\\u137C\\\\u17F0-\\\\u17F9\\\\u19DA\\\\u2070\\\\u2074-\\\\u2079\\\\u2080-\\\\u2089\\\\u2150-\\\\u215F\\\\u2189\\\\u2460-\\\\u249B\\\\u24EA-\\\\u24FF\\\\u2776-\\\\u2793\\\\u2CFD\\\\u3192-\\\\u3195\\\\u3220-\\\\u3229\\\\u3248-\\\\u324F\\\\u3251-\\\\u325F\\\\u3280-\\\\u3289\\\\u32B1-\\\\u32BF\\\\uA830-\\\\uA835\",\r\n    Pc: \"_\\\\u203F\\\\u2040\\\\u2054\\\\uFE33\\\\uFE34\\\\uFE4D-\\\\uFE4F\\\\uFF3F\",\r\n    Pd: \"\\\\-\\\\u058A\\\\u05BE\\\\u1400\\\\u1806\\\\u2010-\\\\u2015\\\\u2E17\\\\u2E1A\\\\u2E3A\\\\u2E3B\\\\u2E40\\\\u301C\\\\u3030\\\\u30A0\\\\uFE31\\\\uFE32\\\\uFE58\\\\uFE63\\\\uFF0D\",\r\n    Pe: \"\\\\)\\\\]\\\\}\\\\u0F3B\\\\u0F3D\\\\u169C\\\\u2046\\\\u207E\\\\u208E\\\\u2309\\\\u230B\\\\u232A\\\\u2769\\\\u276B\\\\u276D\\\\u276F\\\\u2771\\\\u2773\\\\u2775\\\\u27C6\\\\u27E7\\\\u27E9\\\\u27EB\\\\u27ED\\\\u27EF\\\\u2984\\\\u2986\\\\u2988\\\\u298A\\\\u298C\\\\u298E\\\\u2990\\\\u2992\\\\u2994\\\\u2996\\\\u2998\\\\u29D9\\\\u29DB\\\\u29FD\\\\u2E23\\\\u2E25\\\\u2E27\\\\u2E29\\\\u3009\\\\u300B\\\\u300D\\\\u300F\\\\u3011\\\\u3015\\\\u3017\\\\u3019\\\\u301B\\\\u301E\\\\u301F\\\\uFD3E\\\\uFE18\\\\uFE36\\\\uFE38\\\\uFE3A\\\\uFE3C\\\\uFE3E\\\\uFE40\\\\uFE42\\\\uFE44\\\\uFE48\\\\uFE5A\\\\uFE5C\\\\uFE5E\\\\uFF09\\\\uFF3D\\\\uFF5D\\\\uFF60\\\\uFF63\",\r\n    Pf: \"\\\\xBB\\\\u2019\\\\u201D\\\\u203A\\\\u2E03\\\\u2E05\\\\u2E0A\\\\u2E0D\\\\u2E1D\\\\u2E21\",\r\n    Pi: \"\\\\xAB\\\\u2018\\\\u201B\\\\u201C\\\\u201F\\\\u2039\\\\u2E02\\\\u2E04\\\\u2E09\\\\u2E0C\\\\u2E1C\\\\u2E20\",\r\n    Po: \"!-#%-'\\\\*,\\\\.\\\\/:;\\\\?@\\\\xA1\\\\xA7\\\\xB6\\\\xB7\\\\xBF\\\\u037E\\\\u0387\\\\u055A-\\\\u055F\\\\u0589\\\\u05C0\\\\u05C3\\\\u05C6\\\\u05F3\\\\u05F4\\\\u0609\\\\u060A\\\\u060C\\\\u060D\\\\u061B\\\\u061E\\\\u061F\\\\u066A-\\\\u066D\\\\u06D4\\\\u0700-\\\\u070D\\\\u07F7-\\\\u07F9\\\\u0830-\\\\u083E\\\\u085E\\\\u0964\\\\u0965\\\\u0970\\\\u09FD\\\\u0A76\\\\u0AF0\\\\u0C77\\\\u0C84\\\\u0DF4\\\\u0E4F\\\\u0E5A\\\\u0E5B\\\\u0F04-\\\\u0F12\\\\u0F14\\\\u0F85\\\\u0FD0-\\\\u0FD4\\\\u0FD9\\\\u0FDA\\\\u104A-\\\\u104F\\\\u10FB\\\\u1360-\\\\u1368\\\\u166E\\\\u16EB-\\\\u16ED\\\\u1735\\\\u1736\\\\u17D4-\\\\u17D6\\\\u17D8-\\\\u17DA\\\\u1800-\\\\u1805\\\\u1807-\\\\u180A\\\\u1944\\\\u1945\\\\u1A1E\\\\u1A1F\\\\u1AA0-\\\\u1AA6\\\\u1AA8-\\\\u1AAD\\\\u1B5A-\\\\u1B60\\\\u1BFC-\\\\u1BFF\\\\u1C3B-\\\\u1C3F\\\\u1C7E\\\\u1C7F\\\\u1CC0-\\\\u1CC7\\\\u1CD3\\\\u2016\\\\u2017\\\\u2020-\\\\u2027\\\\u2030-\\\\u2038\\\\u203B-\\\\u203E\\\\u2041-\\\\u2043\\\\u2047-\\\\u2051\\\\u2053\\\\u2055-\\\\u205E\\\\u2CF9-\\\\u2CFC\\\\u2CFE\\\\u2CFF\\\\u2D70\\\\u2E00\\\\u2E01\\\\u2E06-\\\\u2E08\\\\u2E0B\\\\u2E0E-\\\\u2E16\\\\u2E18\\\\u2E19\\\\u2E1B\\\\u2E1E\\\\u2E1F\\\\u2E2A-\\\\u2E2E\\\\u2E30-\\\\u2E39\\\\u2E3C-\\\\u2E3F\\\\u2E41\\\\u2E43-\\\\u2E4F\\\\u2E52\\\\u3001-\\\\u3003\\\\u303D\\\\u30FB\\\\uA4FE\\\\uA4FF\\\\uA60D-\\\\uA60F\\\\uA673\\\\uA67E\\\\uA6F2-\\\\uA6F7\\\\uA874-\\\\uA877\\\\uA8CE\\\\uA8CF\\\\uA8F8-\\\\uA8FA\\\\uA8FC\\\\uA92E\\\\uA92F\\\\uA95F\\\\uA9C1-\\\\uA9CD\\\\uA9DE\\\\uA9DF\\\\uAA5C-\\\\uAA5F\\\\uAADE\\\\uAADF\\\\uAAF0\\\\uAAF1\\\\uABEB\\\\uFE10-\\\\uFE16\\\\uFE19\\\\uFE30\\\\uFE45\\\\uFE46\\\\uFE49-\\\\uFE4C\\\\uFE50-\\\\uFE52\\\\uFE54-\\\\uFE57\\\\uFE5F-\\\\uFE61\\\\uFE68\\\\uFE6A\\\\uFE6B\\\\uFF01-\\\\uFF03\\\\uFF05-\\\\uFF07\\\\uFF0A\\\\uFF0C\\\\uFF0E\\\\uFF0F\\\\uFF1A\\\\uFF1B\\\\uFF1F\\\\uFF20\\\\uFF3C\\\\uFF61\\\\uFF64\\\\uFF65\",\r\n    Ps: \"\\\\(\\\\[\\\\{\\\\u0F3A\\\\u0F3C\\\\u169B\\\\u201A\\\\u201E\\\\u2045\\\\u207D\\\\u208D\\\\u2308\\\\u230A\\\\u2329\\\\u2768\\\\u276A\\\\u276C\\\\u276E\\\\u2770\\\\u2772\\\\u2774\\\\u27C5\\\\u27E6\\\\u27E8\\\\u27EA\\\\u27EC\\\\u27EE\\\\u2983\\\\u2985\\\\u2987\\\\u2989\\\\u298B\\\\u298D\\\\u298F\\\\u2991\\\\u2993\\\\u2995\\\\u2997\\\\u29D8\\\\u29DA\\\\u29FC\\\\u2E22\\\\u2E24\\\\u2E26\\\\u2E28\\\\u2E42\\\\u3008\\\\u300A\\\\u300C\\\\u300E\\\\u3010\\\\u3014\\\\u3016\\\\u3018\\\\u301A\\\\u301D\\\\uFD3F\\\\uFE17\\\\uFE35\\\\uFE37\\\\uFE39\\\\uFE3B\\\\uFE3D\\\\uFE3F\\\\uFE41\\\\uFE43\\\\uFE47\\\\uFE59\\\\uFE5B\\\\uFE5D\\\\uFF08\\\\uFF3B\\\\uFF5B\\\\uFF5F\\\\uFF62\",\r\n    Sc: \"\\\\$\\\\xA2-\\\\xA5\\\\u058F\\\\u060B\\\\u07FE\\\\u07FF\\\\u09F2\\\\u09F3\\\\u09FB\\\\u0AF1\\\\u0BF9\\\\u0E3F\\\\u17DB\\\\u20A0-\\\\u20BF\\\\uA838\\\\uFDFC\\\\uFE69\\\\uFF04\\\\uFFE0\\\\uFFE1\\\\uFFE5\\\\uFFE6\",\r\n    Sk: \"\\\\^`\\\\xA8\\\\xAF\\\\xB4\\\\xB8\\\\u02C2-\\\\u02C5\\\\u02D2-\\\\u02DF\\\\u02E5-\\\\u02EB\\\\u02ED\\\\u02EF-\\\\u02FF\\\\u0375\\\\u0384\\\\u0385\\\\u1FBD\\\\u1FBF-\\\\u1FC1\\\\u1FCD-\\\\u1FCF\\\\u1FDD-\\\\u1FDF\\\\u1FED-\\\\u1FEF\\\\u1FFD\\\\u1FFE\\\\u309B\\\\u309C\\\\uA700-\\\\uA716\\\\uA720\\\\uA721\\\\uA789\\\\uA78A\\\\uAB5B\\\\uAB6A\\\\uAB6B\\\\uFBB2-\\\\uFBC1\\\\uFF3E\\\\uFF40\\\\uFFE3\",\r\n    Sm: \"\\\\+<->\\\\|~\\\\xAC\\\\xB1\\\\xD7\\\\xF7\\\\u03F6\\\\u0606-\\\\u0608\\\\u2044\\\\u2052\\\\u207A-\\\\u207C\\\\u208A-\\\\u208C\\\\u2118\\\\u2140-\\\\u2144\\\\u214B\\\\u2190-\\\\u2194\\\\u219A\\\\u219B\\\\u21A0\\\\u21A3\\\\u21A6\\\\u21AE\\\\u21CE\\\\u21CF\\\\u21D2\\\\u21D4\\\\u21F4-\\\\u22FF\\\\u2320\\\\u2321\\\\u237C\\\\u239B-\\\\u23B3\\\\u23DC-\\\\u23E1\\\\u25B7\\\\u25C1\\\\u25F8-\\\\u25FF\\\\u266F\\\\u27C0-\\\\u27C4\\\\u27C7-\\\\u27E5\\\\u27F0-\\\\u27FF\\\\u2900-\\\\u2982\\\\u2999-\\\\u29D7\\\\u29DC-\\\\u29FB\\\\u29FE-\\\\u2AFF\\\\u2B30-\\\\u2B44\\\\u2B47-\\\\u2B4C\\\\uFB29\\\\uFE62\\\\uFE64-\\\\uFE66\\\\uFF0B\\\\uFF1C-\\\\uFF1E\\\\uFF5C\\\\uFF5E\\\\uFFE2\\\\uFFE9-\\\\uFFEC\",\r\n    So: \"\\\\xA6\\\\xA9\\\\xAE\\\\xB0\\\\u0482\\\\u058D\\\\u058E\\\\u060E\\\\u060F\\\\u06DE\\\\u06E9\\\\u06FD\\\\u06FE\\\\u07F6\\\\u09FA\\\\u0B70\\\\u0BF3-\\\\u0BF8\\\\u0BFA\\\\u0C7F\\\\u0D4F\\\\u0D79\\\\u0F01-\\\\u0F03\\\\u0F13\\\\u0F15-\\\\u0F17\\\\u0F1A-\\\\u0F1F\\\\u0F34\\\\u0F36\\\\u0F38\\\\u0FBE-\\\\u0FC5\\\\u0FC7-\\\\u0FCC\\\\u0FCE\\\\u0FCF\\\\u0FD5-\\\\u0FD8\\\\u109E\\\\u109F\\\\u1390-\\\\u1399\\\\u166D\\\\u1940\\\\u19DE-\\\\u19FF\\\\u1B61-\\\\u1B6A\\\\u1B74-\\\\u1B7C\\\\u2100\\\\u2101\\\\u2103-\\\\u2106\\\\u2108\\\\u2109\\\\u2114\\\\u2116\\\\u2117\\\\u211E-\\\\u2123\\\\u2125\\\\u2127\\\\u2129\\\\u212E\\\\u213A\\\\u213B\\\\u214A\\\\u214C\\\\u214D\\\\u214F\\\\u218A\\\\u218B\\\\u2195-\\\\u2199\\\\u219C-\\\\u219F\\\\u21A1\\\\u21A2\\\\u21A4\\\\u21A5\\\\u21A7-\\\\u21AD\\\\u21AF-\\\\u21CD\\\\u21D0\\\\u21D1\\\\u21D3\\\\u21D5-\\\\u21F3\\\\u2300-\\\\u2307\\\\u230C-\\\\u231F\\\\u2322-\\\\u2328\\\\u232B-\\\\u237B\\\\u237D-\\\\u239A\\\\u23B4-\\\\u23DB\\\\u23E2-\\\\u2426\\\\u2440-\\\\u244A\\\\u249C-\\\\u24E9\\\\u2500-\\\\u25B6\\\\u25B8-\\\\u25C0\\\\u25C2-\\\\u25F7\\\\u2600-\\\\u266E\\\\u2670-\\\\u2767\\\\u2794-\\\\u27BF\\\\u2800-\\\\u28FF\\\\u2B00-\\\\u2B2F\\\\u2B45\\\\u2B46\\\\u2B4D-\\\\u2B73\\\\u2B76-\\\\u2B95\\\\u2B97-\\\\u2BFF\\\\u2CE5-\\\\u2CEA\\\\u2E50\\\\u2E51\\\\u2E80-\\\\u2E99\\\\u2E9B-\\\\u2EF3\\\\u2F00-\\\\u2FD5\\\\u2FF0-\\\\u2FFB\\\\u3004\\\\u3012\\\\u3013\\\\u3020\\\\u3036\\\\u3037\\\\u303E\\\\u303F\\\\u3190\\\\u3191\\\\u3196-\\\\u319F\\\\u31C0-\\\\u31E3\\\\u3200-\\\\u321E\\\\u322A-\\\\u3247\\\\u3250\\\\u3260-\\\\u327F\\\\u328A-\\\\u32B0\\\\u32C0-\\\\u33FF\\\\u4DC0-\\\\u4DFF\\\\uA490-\\\\uA4C6\\\\uA828-\\\\uA82B\\\\uA836\\\\uA837\\\\uA839\\\\uAA77-\\\\uAA79\\\\uFDFD\\\\uFFE4\\\\uFFE8\\\\uFFED\\\\uFFEE\\\\uFFFC\\\\uFFFD\",\r\n    Zl: \"\\\\u2028\",\r\n    Zp: \"\\\\u2029\",\r\n    Zs: \" \\\\xA0\\\\u1680\\\\u2000-\\\\u200A\\\\u202F\\\\u205F\\\\u3000\",\r\n};\r\n\r\nUnicode.C = Unicode.Cc + Unicode.Cf + Unicode.Cs + Unicode.Co;\r\n//+ Unicode.Cn ; //This is not defined.\r\n\r\nUnicode.L =\r\n    Unicode.Lu +\r\n    Unicode.Ll +\r\n    Unicode.Lt +\r\n    Unicode.Lm +\r\n    Unicode.Mn + //Added 2014-05-29 due to some letters in names not being recognized.\r\n    //This is where accent marks are individually combined instead of using an explicit character.\r\n    Unicode.Lo;\r\n\r\nUnicode.LC = Unicode.Lu + Unicode.Ll + Unicode.Lt;\r\n\r\nUnicode.M = Unicode.Mn + Unicode.Mc + Unicode.Me;\r\n\r\nUnicode.N = Unicode.Nd + Unicode.Nl + Unicode.No;\r\n\r\nUnicode.P = Unicode.Pc + Unicode.Pd + Unicode.Ps + Unicode.Pe + Unicode.Pi + Unicode.Pf + Unicode.Po;\r\n\r\nUnicode.S = Unicode.Sm + Unicode.Sc + Unicode.Sk + Unicode.So;\r\n\r\nUnicode.Z = Unicode.Zs + Unicode.Zl + Unicode.Zp;\r\n\r\n//Not in Unicode spec:\r\nUnicode.w = \"_\" + Unicode.L + Unicode.N;\r\n\r\n//A Unicode based word boundry built with non-capturing parentheses\r\nUnicode.b = \"(?:[\" + Unicode.w + \"](?:[^\" + Unicode.w + \"]|$)\" + \"|(?:^|[^\" + Unicode.w + \"])[\" + Unicode.w + \"]\" + \")\";\r\n\r\n//A Unicode based word boundry build with non-capturing parentheses\r\nUnicode.bOut = \"(?=[^\" + Unicode.w + \"]|$)\";\r\n\r\n//A Unicode based word boundry build with non-capturing parentheses\r\n//JavaScript does not have a non-consuming look-behind.\r\n//This makes a direct replacement for \\b not possible as we may consume\r\n// part of the string to make this test.\r\nUnicode.bIn = \"(?:^|[^\" + Unicode.w + \"])\";\r\n\r\n//A possible work-around is to use a capture and replace it.\r\nUnicode.bInCapture = \"(?:^|([^\" + Unicode.w + \"]))\";\r\n\r\n//A Unicode based non-word boundry build with non-capturing parentheses\r\nUnicode.B = \"(?:[\" + Unicode.w + \"][\" + Unicode.w + \"]\" + \"|[^\" + Unicode.w + \"][^\" + Unicode.w + \"]\" + \")\";\r\n\r\nUnicode.d = Unicode.N;\r\n\r\nexport default Unicode;\r\n","// stdlib es6 polyfills\r\n// make sure closure compiler knows about these functions so that it can polyfill them\r\n\r\n[...'abc'].flat();"],"sourceRoot":""}