webruby 0.1.0
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +7 -0
- data/bin/webruby +36 -0
- data/driver/driver.c +50 -0
- data/driver/main.c +40 -0
- data/lib/webruby/app.rb +13 -0
- data/lib/webruby/config.rb +61 -0
- data/lib/webruby/environment.rb +32 -0
- data/lib/webruby/rake/files.rake +66 -0
- data/lib/webruby/rake/general.rake +22 -0
- data/lib/webruby/rake/mruby.rake +44 -0
- data/lib/webruby/utility.rb +132 -0
- data/lib/webruby.rb +10 -0
- data/modules/emscripten/AUTHORS +89 -0
- data/modules/emscripten/LICENSE +68 -0
- data/modules/emscripten/README.markdown +14 -0
- data/modules/emscripten/cmake/Platform/Emscripten.cmake +61 -0
- data/modules/emscripten/cmake/Platform/Emscripten_unix.cmake +24 -0
- data/modules/emscripten/em++ +12 -0
- data/modules/emscripten/em++.bat +2 -0
- data/modules/emscripten/em-config +24 -0
- data/modules/emscripten/em-config.bat +2 -0
- data/modules/emscripten/emar +24 -0
- data/modules/emscripten/emar.bat +2 -0
- data/modules/emscripten/emcc +1744 -0
- data/modules/emscripten/emcc.bat +2 -0
- data/modules/emscripten/emcc.py +5 -0
- data/modules/emscripten/emconfigure +27 -0
- data/modules/emscripten/emconfigure.bat +2 -0
- data/modules/emscripten/emlibtool +11 -0
- data/modules/emscripten/emlibtool.bat +2 -0
- data/modules/emscripten/emlink.py +293 -0
- data/modules/emscripten/emmake +29 -0
- data/modules/emscripten/emmake.bat +2 -0
- data/modules/emscripten/emranlib +9 -0
- data/modules/emscripten/emranlib.bat +2 -0
- data/modules/emscripten/emscons +20 -0
- data/modules/emscripten/emscripten.py +835 -0
- data/modules/emscripten/patches/README +4 -0
- data/modules/emscripten/patches/series +2 -0
- data/modules/emscripten/scons-tools/closure.py +28 -0
- data/modules/emscripten/scons-tools/emscripten.py +359 -0
- data/modules/emscripten/scons-tools/llvm.py +33 -0
- data/modules/emscripten/src/analyzer.js +1695 -0
- data/modules/emscripten/src/compiler.html +48 -0
- data/modules/emscripten/src/compiler.js +298 -0
- data/modules/emscripten/src/corruptionCheck.js +98 -0
- data/modules/emscripten/src/determinstic.js +20 -0
- data/modules/emscripten/src/embind/embind.js +1677 -0
- data/modules/emscripten/src/embind/emval.js +283 -0
- data/modules/emscripten/src/experimental/allow_loopvars_from_memsetcpy_inasm.diff +97 -0
- data/modules/emscripten/src/experimental/batching.diff +44 -0
- data/modules/emscripten/src/experimental/functypeopt.diff +113 -0
- data/modules/emscripten/src/experimental/multiple_heaps.diff +175 -0
- data/modules/emscripten/src/experimental/noncallgraphprofiling.diff +197 -0
- data/modules/emscripten/src/experimental/optimize_memcpy_for_ta1.diff +124 -0
- data/modules/emscripten/src/experimental/remove__label__s.diff +140 -0
- data/modules/emscripten/src/experimental/renderer_cache_hash.diff +99 -0
- data/modules/emscripten/src/experimental/sdl_key_forwarding.diff +57 -0
- data/modules/emscripten/src/experimental/simplifyGeneratedFunctionsDetection.diff +336 -0
- data/modules/emscripten/src/experimental/stringCache.diff +147 -0
- data/modules/emscripten/src/fastLong.js +299 -0
- data/modules/emscripten/src/framework.js +257 -0
- data/modules/emscripten/src/gl-matrix.js +1952 -0
- data/modules/emscripten/src/headless.js +904 -0
- data/modules/emscripten/src/intertyper.js +1050 -0
- data/modules/emscripten/src/jsifier.js +1827 -0
- data/modules/emscripten/src/library.js +8270 -0
- data/modules/emscripten/src/library_browser.js +911 -0
- data/modules/emscripten/src/library_egl.js +491 -0
- data/modules/emscripten/src/library_gc.js +236 -0
- data/modules/emscripten/src/library_gl.js +4452 -0
- data/modules/emscripten/src/library_glfw.js +576 -0
- data/modules/emscripten/src/library_glut.js +449 -0
- data/modules/emscripten/src/library_jansson.js +320 -0
- data/modules/emscripten/src/library_openal.js +602 -0
- data/modules/emscripten/src/library_sdl.js +2024 -0
- data/modules/emscripten/src/library_strtok_r.c +97 -0
- data/modules/emscripten/src/library_xlib.js +23 -0
- data/modules/emscripten/src/long.js +1609 -0
- data/modules/emscripten/src/modules.js +491 -0
- data/modules/emscripten/src/parseTools.js +2474 -0
- data/modules/emscripten/src/postamble.js +170 -0
- data/modules/emscripten/src/postamble_sharedlib.js +16 -0
- data/modules/emscripten/src/preamble.js +914 -0
- data/modules/emscripten/src/preamble_sharedlib.js +25 -0
- data/modules/emscripten/src/relooper/README.markdown +14 -0
- data/modules/emscripten/src/relooper/Relooper.cpp +1236 -0
- data/modules/emscripten/src/relooper/Relooper.h +250 -0
- data/modules/emscripten/src/relooper/doit.sh +70 -0
- data/modules/emscripten/src/relooper/emscripten/glue.js +57 -0
- data/modules/emscripten/src/relooper/emscripten/test.js +44 -0
- data/modules/emscripten/src/relooper/fuzzer.py +116 -0
- data/modules/emscripten/src/relooper/ministring.h +35 -0
- data/modules/emscripten/src/relooper/paper.pdf +0 -0
- data/modules/emscripten/src/relooper/test.cpp +262 -0
- data/modules/emscripten/src/relooper/test.txt +155 -0
- data/modules/emscripten/src/relooper/test2.c +44 -0
- data/modules/emscripten/src/relooper/test2.txt +12 -0
- data/modules/emscripten/src/relooper/test3.c +42 -0
- data/modules/emscripten/src/relooper/test3.txt +27 -0
- data/modules/emscripten/src/relooper/test4.cpp +40 -0
- data/modules/emscripten/src/relooper/test4.txt +23 -0
- data/modules/emscripten/src/relooper/test5.cpp +40 -0
- data/modules/emscripten/src/relooper/test5.txt +32 -0
- data/modules/emscripten/src/relooper/test6.cpp +31 -0
- data/modules/emscripten/src/relooper/test6.txt +12 -0
- data/modules/emscripten/src/relooper/test_dead.cpp +28 -0
- data/modules/emscripten/src/relooper/test_dead.txt +9 -0
- data/modules/emscripten/src/relooper/test_debug.cpp +30 -0
- data/modules/emscripten/src/relooper/test_debug.txt +128 -0
- data/modules/emscripten/src/relooper/test_fuzz1.cpp +52 -0
- data/modules/emscripten/src/relooper/test_fuzz1.txt +32 -0
- data/modules/emscripten/src/relooper/test_fuzz2.cpp +34 -0
- data/modules/emscripten/src/relooper/test_fuzz2.txt +13 -0
- data/modules/emscripten/src/relooper/test_fuzz3.cpp +36 -0
- data/modules/emscripten/src/relooper/test_fuzz3.txt +9 -0
- data/modules/emscripten/src/relooper/test_fuzz4.cpp +38 -0
- data/modules/emscripten/src/relooper/test_fuzz4.txt +19 -0
- data/modules/emscripten/src/relooper/test_fuzz5.cpp +57 -0
- data/modules/emscripten/src/relooper/test_fuzz5.txt +52 -0
- data/modules/emscripten/src/relooper/test_fuzz6.cpp +322 -0
- data/modules/emscripten/src/relooper/test_fuzz6.txt +108 -0
- data/modules/emscripten/src/relooper/test_inf.cpp +813 -0
- data/modules/emscripten/src/relooper/test_inf.txt +385 -0
- data/modules/emscripten/src/relooper/testit.sh +62 -0
- data/modules/emscripten/src/relooper/updateit.sh +17 -0
- data/modules/emscripten/src/relooper.js +11516 -0
- data/modules/emscripten/src/relooper.js.raw.js +11511 -0
- data/modules/emscripten/src/runtime.js +546 -0
- data/modules/emscripten/src/settings.js +1284 -0
- data/modules/emscripten/src/shell.html +92 -0
- data/modules/emscripten/src/shell.js +153 -0
- data/modules/emscripten/src/shell_sharedlib.js +12 -0
- data/modules/emscripten/src/socket.io.js +3870 -0
- data/modules/emscripten/src/utility.js +379 -0
- data/modules/emscripten/src/wrtcp.js +821 -0
- data/modules/emscripten/system/include/AL/al.h +172 -0
- data/modules/emscripten/system/include/AL/alc.h +84 -0
- data/modules/emscripten/system/include/EGL/egl.h +329 -0
- data/modules/emscripten/system/include/EGL/eglext.h +398 -0
- data/modules/emscripten/system/include/EGL/eglplatform.h +141 -0
- data/modules/emscripten/system/include/GL/freeglut_std.h +628 -0
- data/modules/emscripten/system/include/GL/gl.h +2241 -0
- data/modules/emscripten/system/include/GL/glew.h +6 -0
- data/modules/emscripten/system/include/GL/glext.h +11127 -0
- data/modules/emscripten/system/include/GL/glfw.h +518 -0
- data/modules/emscripten/system/include/GL/glu.h +353 -0
- data/modules/emscripten/system/include/GL/glut.h +21 -0
- data/modules/emscripten/system/include/GLES/gl.h +770 -0
- data/modules/emscripten/system/include/GLES/glext.h +1278 -0
- data/modules/emscripten/system/include/GLES/glplatform.h +30 -0
- data/modules/emscripten/system/include/GLES2/gl2.h +621 -0
- data/modules/emscripten/system/include/GLES2/gl2ext.h +803 -0
- data/modules/emscripten/system/include/GLES2/gl2platform.h +30 -0
- data/modules/emscripten/system/include/KHR/khrplatform.h +277 -0
- data/modules/emscripten/system/include/SDL/COPYING +19 -0
- data/modules/emscripten/system/include/SDL/SDL.h +162 -0
- data/modules/emscripten/system/include/SDL/SDL_assert.h +241 -0
- data/modules/emscripten/system/include/SDL/SDL_atomic.h +318 -0
- data/modules/emscripten/system/include/SDL/SDL_audio.h +509 -0
- data/modules/emscripten/system/include/SDL/SDL_blendmode.h +60 -0
- data/modules/emscripten/system/include/SDL/SDL_clipboard.h +75 -0
- data/modules/emscripten/system/include/SDL/SDL_compat.h +365 -0
- data/modules/emscripten/system/include/SDL/SDL_config.h +48 -0
- data/modules/emscripten/system/include/SDL/SDL_config.h.in +297 -0
- data/modules/emscripten/system/include/SDL/SDL_config_android.h +133 -0
- data/modules/emscripten/system/include/SDL/SDL_config_iphoneos.h +148 -0
- data/modules/emscripten/system/include/SDL/SDL_config_macosx.h +172 -0
- data/modules/emscripten/system/include/SDL/SDL_config_minimal.h +74 -0
- data/modules/emscripten/system/include/SDL/SDL_config_nintendods.h +129 -0
- data/modules/emscripten/system/include/SDL/SDL_config_pandora.h +125 -0
- data/modules/emscripten/system/include/SDL/SDL_config_windows.h +207 -0
- data/modules/emscripten/system/include/SDL/SDL_config_wiz.h +119 -0
- data/modules/emscripten/system/include/SDL/SDL_copying.h +20 -0
- data/modules/emscripten/system/include/SDL/SDL_cpuinfo.h +150 -0
- data/modules/emscripten/system/include/SDL/SDL_endian.h +248 -0
- data/modules/emscripten/system/include/SDL/SDL_error.h +77 -0
- data/modules/emscripten/system/include/SDL/SDL_events.h +639 -0
- data/modules/emscripten/system/include/SDL/SDL_gesture.h +91 -0
- data/modules/emscripten/system/include/SDL/SDL_gfxPrimitives.h +246 -0
- data/modules/emscripten/system/include/SDL/SDL_haptic.h +1200 -0
- data/modules/emscripten/system/include/SDL/SDL_hints.h +206 -0
- data/modules/emscripten/system/include/SDL/SDL_image.h +138 -0
- data/modules/emscripten/system/include/SDL/SDL_input.h +87 -0
- data/modules/emscripten/system/include/SDL/SDL_joystick.h +208 -0
- data/modules/emscripten/system/include/SDL/SDL_keyboard.h +169 -0
- data/modules/emscripten/system/include/SDL/SDL_keycode.h +344 -0
- data/modules/emscripten/system/include/SDL/SDL_loadso.h +85 -0
- data/modules/emscripten/system/include/SDL/SDL_log.h +211 -0
- data/modules/emscripten/system/include/SDL/SDL_main.h +98 -0
- data/modules/emscripten/system/include/SDL/SDL_mixer.h +634 -0
- data/modules/emscripten/system/include/SDL/SDL_mouse.h +213 -0
- data/modules/emscripten/system/include/SDL/SDL_mutex.h +248 -0
- data/modules/emscripten/system/include/SDL/SDL_name.h +11 -0
- data/modules/emscripten/system/include/SDL/SDL_opengl.h +11116 -0
- data/modules/emscripten/system/include/SDL/SDL_opengles.h +38 -0
- data/modules/emscripten/system/include/SDL/SDL_opengles2.h +38 -0
- data/modules/emscripten/system/include/SDL/SDL_pixels.h +423 -0
- data/modules/emscripten/system/include/SDL/SDL_platform.h +160 -0
- data/modules/emscripten/system/include/SDL/SDL_power.h +79 -0
- data/modules/emscripten/system/include/SDL/SDL_quit.h +58 -0
- data/modules/emscripten/system/include/SDL/SDL_rect.h +136 -0
- data/modules/emscripten/system/include/SDL/SDL_render.h +615 -0
- data/modules/emscripten/system/include/SDL/SDL_revision.h +2 -0
- data/modules/emscripten/system/include/SDL/SDL_revision.h.orig +2 -0
- data/modules/emscripten/system/include/SDL/SDL_rotozoom.h +123 -0
- data/modules/emscripten/system/include/SDL/SDL_rwops.h +220 -0
- data/modules/emscripten/system/include/SDL/SDL_scancode.h +398 -0
- data/modules/emscripten/system/include/SDL/SDL_shape.h +147 -0
- data/modules/emscripten/system/include/SDL/SDL_stdinc.h +764 -0
- data/modules/emscripten/system/include/SDL/SDL_surface.h +499 -0
- data/modules/emscripten/system/include/SDL/SDL_syswm.h +241 -0
- data/modules/emscripten/system/include/SDL/SDL_thread.h +182 -0
- data/modules/emscripten/system/include/SDL/SDL_timer.h +108 -0
- data/modules/emscripten/system/include/SDL/SDL_touch.h +124 -0
- data/modules/emscripten/system/include/SDL/SDL_ttf.h +249 -0
- data/modules/emscripten/system/include/SDL/SDL_types.h +29 -0
- data/modules/emscripten/system/include/SDL/SDL_version.h +166 -0
- data/modules/emscripten/system/include/SDL/SDL_video.h +820 -0
- data/modules/emscripten/system/include/SDL/begin_code.h +135 -0
- data/modules/emscripten/system/include/SDL/close_code.h +37 -0
- data/modules/emscripten/system/include/X11/X.h +717 -0
- data/modules/emscripten/system/include/X11/Xatom.h +79 -0
- data/modules/emscripten/system/include/X11/Xfuncproto.h +127 -0
- data/modules/emscripten/system/include/X11/Xlib.h +4023 -0
- data/modules/emscripten/system/include/X11/Xosdefs.h +116 -0
- data/modules/emscripten/system/include/X11/Xutil.h +826 -0
- data/modules/emscripten/system/include/X11/keysym.h +73 -0
- data/modules/emscripten/system/include/X11/keysymdef.h +2389 -0
- data/modules/emscripten/system/include/bsd/float.h +91 -0
- data/modules/emscripten/system/include/bsd/readme.txt +2 -0
- data/modules/emscripten/system/include/bsd/sys/mman.h +180 -0
- data/modules/emscripten/system/include/bsd/sys/utsname.h +70 -0
- data/modules/emscripten/system/include/dlfcn.h +31 -0
- data/modules/emscripten/system/include/emscripten/bind.h +1210 -0
- data/modules/emscripten/system/include/emscripten/emscripten.h +388 -0
- data/modules/emscripten/system/include/emscripten/val.h +311 -0
- data/modules/emscripten/system/include/emscripten/wire.h +393 -0
- data/modules/emscripten/system/include/err.h +95 -0
- data/modules/emscripten/system/include/execinfo.h +44 -0
- data/modules/emscripten/system/include/features.h +3 -0
- data/modules/emscripten/system/include/gc.h +70 -0
- data/modules/emscripten/system/include/gfx/png.h +3798 -0
- data/modules/emscripten/system/include/gfx/pngconf.h +1665 -0
- data/modules/emscripten/system/include/gfx/tiff.h +654 -0
- data/modules/emscripten/system/include/gfx/tiffconf.h +104 -0
- data/modules/emscripten/system/include/gfx/tiffio.h +526 -0
- data/modules/emscripten/system/include/gfx/tiffvers.h +9 -0
- data/modules/emscripten/system/include/jansson.h +323 -0
- data/modules/emscripten/system/include/jansson_config.h +54 -0
- data/modules/emscripten/system/include/libc/_ansi.h +135 -0
- data/modules/emscripten/system/include/libc/_syslist.h +40 -0
- data/modules/emscripten/system/include/libc/alloca.h +21 -0
- data/modules/emscripten/system/include/libc/ar.h +69 -0
- data/modules/emscripten/system/include/libc/argz.h +33 -0
- data/modules/emscripten/system/include/libc/assert.h +46 -0
- data/modules/emscripten/system/include/libc/complex.h +124 -0
- data/modules/emscripten/system/include/libc/ctype.h +196 -0
- data/modules/emscripten/system/include/libc/dirent.h +16 -0
- data/modules/emscripten/system/include/libc/endian.h +3 -0
- data/modules/emscripten/system/include/libc/envlock.h +15 -0
- data/modules/emscripten/system/include/libc/envz.h +16 -0
- data/modules/emscripten/system/include/libc/errno.h +11 -0
- data/modules/emscripten/system/include/libc/fastmath.h +13 -0
- data/modules/emscripten/system/include/libc/fcntl.h +1 -0
- data/modules/emscripten/system/include/libc/fnmatch.h +55 -0
- data/modules/emscripten/system/include/libc/getopt.h +196 -0
- data/modules/emscripten/system/include/libc/glob.h +89 -0
- data/modules/emscripten/system/include/libc/grp.h +94 -0
- data/modules/emscripten/system/include/libc/iconv.h +62 -0
- data/modules/emscripten/system/include/libc/ieeefp.h +256 -0
- data/modules/emscripten/system/include/libc/ifaddrs.h +64 -0
- data/modules/emscripten/system/include/libc/inttypes.h +290 -0
- data/modules/emscripten/system/include/libc/iso646.h +43 -0
- data/modules/emscripten/system/include/libc/langinfo.h +316 -0
- data/modules/emscripten/system/include/libc/libgen.h +23 -0
- data/modules/emscripten/system/include/libc/limits.h +155 -0
- data/modules/emscripten/system/include/libc/locale.h +80 -0
- data/modules/emscripten/system/include/libc/machine/_default_types.h +121 -0
- data/modules/emscripten/system/include/libc/machine/_types.h +8 -0
- data/modules/emscripten/system/include/libc/machine/ansi.h +1 -0
- data/modules/emscripten/system/include/libc/machine/endian.h +31 -0
- data/modules/emscripten/system/include/libc/machine/fastmath.h +100 -0
- data/modules/emscripten/system/include/libc/machine/ieeefp.h +376 -0
- data/modules/emscripten/system/include/libc/machine/malloc.h +8 -0
- data/modules/emscripten/system/include/libc/machine/param.h +1 -0
- data/modules/emscripten/system/include/libc/machine/setjmp-dj.h +43 -0
- data/modules/emscripten/system/include/libc/machine/setjmp.h +361 -0
- data/modules/emscripten/system/include/libc/machine/stdlib.h +8 -0
- data/modules/emscripten/system/include/libc/machine/termios.h +1 -0
- data/modules/emscripten/system/include/libc/machine/time.h +19 -0
- data/modules/emscripten/system/include/libc/machine/types.h +30 -0
- data/modules/emscripten/system/include/libc/malloc.h +169 -0
- data/modules/emscripten/system/include/libc/math.h +594 -0
- data/modules/emscripten/system/include/libc/newlib.h +2 -0
- data/modules/emscripten/system/include/libc/paths.h +7 -0
- data/modules/emscripten/system/include/libc/process.h +44 -0
- data/modules/emscripten/system/include/libc/pthread.h +362 -0
- data/modules/emscripten/system/include/libc/pwd.h +78 -0
- data/modules/emscripten/system/include/libc/readme.txt +3 -0
- data/modules/emscripten/system/include/libc/reent.h +183 -0
- data/modules/emscripten/system/include/libc/regdef.h +7 -0
- data/modules/emscripten/system/include/libc/regex.h +102 -0
- data/modules/emscripten/system/include/libc/sched.h +97 -0
- data/modules/emscripten/system/include/libc/search.h +59 -0
- data/modules/emscripten/system/include/libc/setjmp.h +20 -0
- data/modules/emscripten/system/include/libc/signal.h +30 -0
- data/modules/emscripten/system/include/libc/stdarg.h +50 -0
- data/modules/emscripten/system/include/libc/stddef.h +64 -0
- data/modules/emscripten/system/include/libc/stdint.h +493 -0
- data/modules/emscripten/system/include/libc/stdio.h +694 -0
- data/modules/emscripten/system/include/libc/stdlib.h +230 -0
- data/modules/emscripten/system/include/libc/string.h +105 -0
- data/modules/emscripten/system/include/libc/strings.h +35 -0
- data/modules/emscripten/system/include/libc/sys/_default_fcntl.h +223 -0
- data/modules/emscripten/system/include/libc/sys/_types.h +93 -0
- data/modules/emscripten/system/include/libc/sys/cdefs.h +123 -0
- data/modules/emscripten/system/include/libc/sys/config.h +255 -0
- data/modules/emscripten/system/include/libc/sys/custom_file.h +2 -0
- data/modules/emscripten/system/include/libc/sys/dir.h +10 -0
- data/modules/emscripten/system/include/libc/sys/dirent.h +58 -0
- data/modules/emscripten/system/include/libc/sys/errno.h +190 -0
- data/modules/emscripten/system/include/libc/sys/fcntl.h +4 -0
- data/modules/emscripten/system/include/libc/sys/features.h +212 -0
- data/modules/emscripten/system/include/libc/sys/file.h +2 -0
- data/modules/emscripten/system/include/libc/sys/iconvnls.h +77 -0
- data/modules/emscripten/system/include/libc/sys/lock.h +24 -0
- data/modules/emscripten/system/include/libc/sys/param.h +25 -0
- data/modules/emscripten/system/include/libc/sys/queue.h +471 -0
- data/modules/emscripten/system/include/libc/sys/reent.h +843 -0
- data/modules/emscripten/system/include/libc/sys/resource.h +59 -0
- data/modules/emscripten/system/include/libc/sys/sched.h +67 -0
- data/modules/emscripten/system/include/libc/sys/signal.h +314 -0
- data/modules/emscripten/system/include/libc/sys/stat.h +222 -0
- data/modules/emscripten/system/include/libc/sys/stdio.h +27 -0
- data/modules/emscripten/system/include/libc/sys/string.h +2 -0
- data/modules/emscripten/system/include/libc/sys/syslimits.h +65 -0
- data/modules/emscripten/system/include/libc/sys/termios.h +280 -0
- data/modules/emscripten/system/include/libc/sys/time.h +85 -0
- data/modules/emscripten/system/include/libc/sys/timeb.h +39 -0
- data/modules/emscripten/system/include/libc/sys/times.h +28 -0
- data/modules/emscripten/system/include/libc/sys/ttydefaults.h +97 -0
- data/modules/emscripten/system/include/libc/sys/types.h +481 -0
- data/modules/emscripten/system/include/libc/sys/unistd.h +514 -0
- data/modules/emscripten/system/include/libc/sys/utime.h +26 -0
- data/modules/emscripten/system/include/libc/sys/wait.h +40 -0
- data/modules/emscripten/system/include/libc/tar.h +39 -0
- data/modules/emscripten/system/include/libc/termios.h +7 -0
- data/modules/emscripten/system/include/libc/time.h +273 -0
- data/modules/emscripten/system/include/libc/unctrl.h +46 -0
- data/modules/emscripten/system/include/libc/unistd.h +6 -0
- data/modules/emscripten/system/include/libc/utime.h +12 -0
- data/modules/emscripten/system/include/libc/utmp.h +8 -0
- data/modules/emscripten/system/include/libc/wchar.h +194 -0
- data/modules/emscripten/system/include/libc/wctype.h +47 -0
- data/modules/emscripten/system/include/libc/wordexp.h +53 -0
- data/modules/emscripten/system/include/libcxx/CREDITS.TXT +91 -0
- data/modules/emscripten/system/include/libcxx/LICENSE.txt +76 -0
- data/modules/emscripten/system/include/libcxx/__bit_reference +1268 -0
- data/modules/emscripten/system/include/libcxx/__config +485 -0
- data/modules/emscripten/system/include/libcxx/__debug +193 -0
- data/modules/emscripten/system/include/libcxx/__functional_03 +2130 -0
- data/modules/emscripten/system/include/libcxx/__functional_base +437 -0
- data/modules/emscripten/system/include/libcxx/__functional_base_03 +1087 -0
- data/modules/emscripten/system/include/libcxx/__hash_table +1945 -0
- data/modules/emscripten/system/include/libcxx/__locale +1435 -0
- data/modules/emscripten/system/include/libcxx/__mutex_base +438 -0
- data/modules/emscripten/system/include/libcxx/__split_buffer +654 -0
- data/modules/emscripten/system/include/libcxx/__sso_allocator +77 -0
- data/modules/emscripten/system/include/libcxx/__std_stream +317 -0
- data/modules/emscripten/system/include/libcxx/__tree +2293 -0
- data/modules/emscripten/system/include/libcxx/__tuple +305 -0
- data/modules/emscripten/system/include/libcxx/__tuple_03 +27 -0
- data/modules/emscripten/system/include/libcxx/__undef_min_max +19 -0
- data/modules/emscripten/system/include/libcxx/algorithm +5458 -0
- data/modules/emscripten/system/include/libcxx/array +341 -0
- data/modules/emscripten/system/include/libcxx/atomic +1521 -0
- data/modules/emscripten/system/include/libcxx/bitset +1081 -0
- data/modules/emscripten/system/include/libcxx/cassert +25 -0
- data/modules/emscripten/system/include/libcxx/ccomplex +29 -0
- data/modules/emscripten/system/include/libcxx/cctype +164 -0
- data/modules/emscripten/system/include/libcxx/cerrno +393 -0
- data/modules/emscripten/system/include/libcxx/cfenv +82 -0
- data/modules/emscripten/system/include/libcxx/cfloat +78 -0
- data/modules/emscripten/system/include/libcxx/chrono +898 -0
- data/modules/emscripten/system/include/libcxx/cinttypes +259 -0
- data/modules/emscripten/system/include/libcxx/ciso646 +25 -0
- data/modules/emscripten/system/include/libcxx/climits +48 -0
- data/modules/emscripten/system/include/libcxx/clocale +53 -0
- data/modules/emscripten/system/include/libcxx/cmath +1683 -0
- data/modules/emscripten/system/include/libcxx/codecvt +547 -0
- data/modules/emscripten/system/include/libcxx/complex +1526 -0
- data/modules/emscripten/system/include/libcxx/complex.h +35 -0
- data/modules/emscripten/system/include/libcxx/condition_variable +256 -0
- data/modules/emscripten/system/include/libcxx/csetjmp +52 -0
- data/modules/emscripten/system/include/libcxx/csignal +58 -0
- data/modules/emscripten/system/include/libcxx/cstdarg +48 -0
- data/modules/emscripten/system/include/libcxx/cstdbool +32 -0
- data/modules/emscripten/system/include/libcxx/cstddef +103 -0
- data/modules/emscripten/system/include/libcxx/cstdint +191 -0
- data/modules/emscripten/system/include/libcxx/cstdio +175 -0
- data/modules/emscripten/system/include/libcxx/cstdlib +172 -0
- data/modules/emscripten/system/include/libcxx/cstring +112 -0
- data/modules/emscripten/system/include/libcxx/ctgmath +29 -0
- data/modules/emscripten/system/include/libcxx/ctime +72 -0
- data/modules/emscripten/system/include/libcxx/cwchar +208 -0
- data/modules/emscripten/system/include/libcxx/cwctype +213 -0
- data/modules/emscripten/system/include/libcxx/deque +2846 -0
- data/modules/emscripten/system/include/libcxx/exception +250 -0
- data/modules/emscripten/system/include/libcxx/ext/__hash +46 -0
- data/modules/emscripten/system/include/libcxx/ext/hash_map +1003 -0
- data/modules/emscripten/system/include/libcxx/ext/hash_set +657 -0
- data/modules/emscripten/system/include/libcxx/forward_list +1636 -0
- data/modules/emscripten/system/include/libcxx/fstream +1415 -0
- data/modules/emscripten/system/include/libcxx/functional +2063 -0
- data/modules/emscripten/system/include/libcxx/future +2505 -0
- data/modules/emscripten/system/include/libcxx/initializer_list +105 -0
- data/modules/emscripten/system/include/libcxx/iomanip +504 -0
- data/modules/emscripten/system/include/libcxx/ios +988 -0
- data/modules/emscripten/system/include/libcxx/iosfwd +194 -0
- data/modules/emscripten/system/include/libcxx/iostream +60 -0
- data/modules/emscripten/system/include/libcxx/istream +1713 -0
- data/modules/emscripten/system/include/libcxx/iterator +1869 -0
- data/modules/emscripten/system/include/libcxx/limits +809 -0
- data/modules/emscripten/system/include/libcxx/list +2275 -0
- data/modules/emscripten/system/include/libcxx/locale +4591 -0
- data/modules/emscripten/system/include/libcxx/map +1924 -0
- data/modules/emscripten/system/include/libcxx/memory +5437 -0
- data/modules/emscripten/system/include/libcxx/mutex +566 -0
- data/modules/emscripten/system/include/libcxx/new +117 -0
- data/modules/emscripten/system/include/libcxx/numeric +197 -0
- data/modules/emscripten/system/include/libcxx/ostream +1286 -0
- data/modules/emscripten/system/include/libcxx/queue +717 -0
- data/modules/emscripten/system/include/libcxx/random +6750 -0
- data/modules/emscripten/system/include/libcxx/ratio +487 -0
- data/modules/emscripten/system/include/libcxx/readme.txt +1 -0
- data/modules/emscripten/system/include/libcxx/regex +6439 -0
- data/modules/emscripten/system/include/libcxx/scoped_allocator +578 -0
- data/modules/emscripten/system/include/libcxx/set +1025 -0
- data/modules/emscripten/system/include/libcxx/sstream +888 -0
- data/modules/emscripten/system/include/libcxx/stack +292 -0
- data/modules/emscripten/system/include/libcxx/stdexcept +162 -0
- data/modules/emscripten/system/include/libcxx/streambuf +564 -0
- data/modules/emscripten/system/include/libcxx/string +3987 -0
- data/modules/emscripten/system/include/libcxx/strstream +400 -0
- data/modules/emscripten/system/include/libcxx/support/solaris/floatingpoint.h +5 -0
- data/modules/emscripten/system/include/libcxx/support/solaris/wchar.h +38 -0
- data/modules/emscripten/system/include/libcxx/support/solaris/xlocale.h +146 -0
- data/modules/emscripten/system/include/libcxx/support/win32/limits_win32.h +79 -0
- data/modules/emscripten/system/include/libcxx/support/win32/locale_win32.h +116 -0
- data/modules/emscripten/system/include/libcxx/support/win32/math_win32.h +113 -0
- data/modules/emscripten/system/include/libcxx/support/win32/support.h +115 -0
- data/modules/emscripten/system/include/libcxx/system_error +636 -0
- data/modules/emscripten/system/include/libcxx/tgmath.h +29 -0
- data/modules/emscripten/system/include/libcxx/thread +459 -0
- data/modules/emscripten/system/include/libcxx/tuple +1092 -0
- data/modules/emscripten/system/include/libcxx/type_traits +3040 -0
- data/modules/emscripten/system/include/libcxx/typeindex +103 -0
- data/modules/emscripten/system/include/libcxx/typeinfo +124 -0
- data/modules/emscripten/system/include/libcxx/unordered_map +1864 -0
- data/modules/emscripten/system/include/libcxx/unordered_set +1144 -0
- data/modules/emscripten/system/include/libcxx/utility +583 -0
- data/modules/emscripten/system/include/libcxx/valarray +4779 -0
- data/modules/emscripten/system/include/libcxx/vector +3228 -0
- data/modules/emscripten/system/include/memory.h +10 -0
- data/modules/emscripten/system/include/mntent.h +23 -0
- data/modules/emscripten/system/include/net/arpa/inet.h +32 -0
- data/modules/emscripten/system/include/net/arpa/nameser.h +535 -0
- data/modules/emscripten/system/include/net/arpa/nameser_compat.h +187 -0
- data/modules/emscripten/system/include/net/if.h +87 -0
- data/modules/emscripten/system/include/net/netinet/in.h +166 -0
- data/modules/emscripten/system/include/net/netinet/tcp.h +246 -0
- data/modules/emscripten/system/include/net/resolv.h +389 -0
- data/modules/emscripten/system/include/netdb.h +94 -0
- data/modules/emscripten/system/include/nl_types.h +19 -0
- data/modules/emscripten/system/include/poll.h +3 -0
- data/modules/emscripten/system/include/pty.h +6 -0
- data/modules/emscripten/system/include/semaphore.h +31 -0
- data/modules/emscripten/system/include/spawn.h +105 -0
- data/modules/emscripten/system/include/stdbool.h +16 -0
- data/modules/emscripten/system/include/sys/bitypes.h +3 -0
- data/modules/emscripten/system/include/sys/io.h +14 -0
- data/modules/emscripten/system/include/sys/ioctl.h +26 -0
- data/modules/emscripten/system/include/sys/poll.h +31 -0
- data/modules/emscripten/system/include/sys/select.h +14 -0
- data/modules/emscripten/system/include/sys/socket.h +101 -0
- data/modules/emscripten/system/include/sys/socketvar.h +3 -0
- data/modules/emscripten/system/include/sys/statvfs.h +32 -0
- data/modules/emscripten/system/include/sys/sysctl.h +14 -0
- data/modules/emscripten/system/include/sys/uio.h +22 -0
- data/modules/emscripten/system/include/sys/un.h +66 -0
- data/modules/emscripten/system/include/sysexits.h +108 -0
- data/modules/emscripten/system/include/unwind.h +154 -0
- data/modules/emscripten/system/include/xlocale.h +47 -0
- data/modules/emscripten/system/include/zconf.h +428 -0
- data/modules/emscripten/system/include/zlib.h +1613 -0
- data/modules/emscripten/system/lib/compiler-rt/LICENSE.TXT +97 -0
- data/modules/emscripten/system/lib/compiler-rt/divdi3.c +47 -0
- data/modules/emscripten/system/lib/compiler-rt/int_endianness.h +116 -0
- data/modules/emscripten/system/lib/compiler-rt/int_lib.h +46 -0
- data/modules/emscripten/system/lib/compiler-rt/int_math.h +67 -0
- data/modules/emscripten/system/lib/compiler-rt/int_types.h +140 -0
- data/modules/emscripten/system/lib/compiler-rt/int_util.h +29 -0
- data/modules/emscripten/system/lib/compiler-rt/muldi3.c +56 -0
- data/modules/emscripten/system/lib/compiler-rt/readme.txt +20 -0
- data/modules/emscripten/system/lib/compiler-rt/udivdi3.c +36 -0
- data/modules/emscripten/system/lib/compiler-rt/udivmoddi4.c +251 -0
- data/modules/emscripten/system/lib/debugging.cpp +24 -0
- data/modules/emscripten/system/lib/dlmalloc.c +6299 -0
- data/modules/emscripten/system/lib/embind/bind.cpp +63 -0
- data/modules/emscripten/system/lib/libc/gen/err.c +49 -0
- data/modules/emscripten/system/lib/libc/gen/errx.c +49 -0
- data/modules/emscripten/system/lib/libc/gen/verr.c +58 -0
- data/modules/emscripten/system/lib/libc/gen/verrx.c +51 -0
- data/modules/emscripten/system/lib/libc/gen/vwarn.c +55 -0
- data/modules/emscripten/system/lib/libc/gen/vwarnx.c +48 -0
- data/modules/emscripten/system/lib/libc/gen/warn.c +49 -0
- data/modules/emscripten/system/lib/libc/gen/warnx.c +49 -0
- data/modules/emscripten/system/lib/libc/musl/COPYRIGHT +92 -0
- data/modules/emscripten/system/lib/libc/musl/readme.txt +1 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/alpha.h +125 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/iswalnum.c +7 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/iswalpha.c +14 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/iswblank.c +8 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/iswcntrl.c +10 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/iswctype.c +63 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/iswdigit.c +9 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/iswgraph.c +7 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/iswlower.c +6 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/iswprint.c +19 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/iswpunct.c +12 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/iswspace.c +19 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/iswupper.c +6 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/iswxdigit.c +7 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/nonspacing.h +62 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/punct.h +109 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/towctrans.c +268 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/wcswidth.c +8 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/wctrans.c +16 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/wcwidth.c +29 -0
- data/modules/emscripten/system/lib/libc/musl/src/ctype/wide.h +42 -0
- data/modules/emscripten/system/lib/libc/musl/src/internal/libc.c +22 -0
- data/modules/emscripten/system/lib/libc/musl/src/internal/libc.h +71 -0
- data/modules/emscripten/system/lib/libc/musl/src/multibyte/btowc.c +7 -0
- data/modules/emscripten/system/lib/libc/musl/src/multibyte/internal.c +38 -0
- data/modules/emscripten/system/lib/libc/musl/src/multibyte/internal.h +22 -0
- data/modules/emscripten/system/lib/libc/musl/src/multibyte/mblen.c +17 -0
- data/modules/emscripten/system/lib/libc/musl/src/multibyte/mbrlen.c +18 -0
- data/modules/emscripten/system/lib/libc/musl/src/multibyte/mbrtowc.c +57 -0
- data/modules/emscripten/system/lib/libc/musl/src/multibyte/mbsinit.c +17 -0
- data/modules/emscripten/system/lib/libc/musl/src/multibyte/mbsnrtowcs.c +65 -0
- data/modules/emscripten/system/lib/libc/musl/src/multibyte/mbsrtowcs.c +100 -0
- data/modules/emscripten/system/lib/libc/musl/src/multibyte/mbstowcs.c +7 -0
- data/modules/emscripten/system/lib/libc/musl/src/multibyte/mbtowc.c +53 -0
- data/modules/emscripten/system/lib/libc/musl/src/multibyte/wcrtomb.c +38 -0
- data/modules/emscripten/system/lib/libc/musl/src/multibyte/wcsnrtombs.c +52 -0
- data/modules/emscripten/system/lib/libc/musl/src/multibyte/wcsrtombs.c +58 -0
- data/modules/emscripten/system/lib/libc/musl/src/multibyte/wcstombs.c +7 -0
- data/modules/emscripten/system/lib/libc/musl/src/multibyte/wctob.c +8 -0
- data/modules/emscripten/system/lib/libc/musl/src/multibyte/wctomb.c +18 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcpcpy.c +6 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcpncpy.c +6 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcscasecmp.c +7 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcscasecmp_l.c +6 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcscat.c +7 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcschr.c +8 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcscmp.c +7 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcscpy.c +8 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcscspn.c +10 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcsdup.c +11 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcslen.c +8 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcsncasecmp.c +9 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcsncasecmp_l.c +6 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcsncat.c +10 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcsncmp.c +7 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcsncpy.c +9 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcsnlen.c +8 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcspbrk.c +7 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcsrchr.c +8 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcsspn.c +8 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcsstr.c +108 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcstok.c +12 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wcswcs.c +6 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wmemchr.c +8 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wmemcmp.c +8 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wmemcpy.c +9 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wmemmove.c +12 -0
- data/modules/emscripten/system/lib/libc/musl/src/string/wmemset.c +9 -0
- data/modules/emscripten/system/lib/libc/stdlib/getopt_long.c +511 -0
- data/modules/emscripten/system/lib/libc/stdlib/strtod.c +305 -0
- data/modules/emscripten/system/lib/libc.symbols +81 -0
- data/modules/emscripten/system/lib/libcextra.symbols +61 -0
- data/modules/emscripten/system/lib/libcxx/CREDITS.TXT +91 -0
- data/modules/emscripten/system/lib/libcxx/LICENSE.txt +76 -0
- data/modules/emscripten/system/lib/libcxx/algorithm.cpp +83 -0
- data/modules/emscripten/system/lib/libcxx/bind.cpp +30 -0
- data/modules/emscripten/system/lib/libcxx/chrono.cpp +132 -0
- data/modules/emscripten/system/lib/libcxx/condition_variable.cpp +81 -0
- data/modules/emscripten/system/lib/libcxx/debug.cpp +504 -0
- data/modules/emscripten/system/lib/libcxx/exception.cpp +226 -0
- data/modules/emscripten/system/lib/libcxx/future.cpp +285 -0
- data/modules/emscripten/system/lib/libcxx/hash.cpp +564 -0
- data/modules/emscripten/system/lib/libcxx/ios.cpp +455 -0
- data/modules/emscripten/system/lib/libcxx/iostream.cpp +68 -0
- data/modules/emscripten/system/lib/libcxx/locale.cpp +6093 -0
- data/modules/emscripten/system/lib/libcxx/memory.cpp +223 -0
- data/modules/emscripten/system/lib/libcxx/mutex.cpp +250 -0
- data/modules/emscripten/system/lib/libcxx/new.cpp +205 -0
- data/modules/emscripten/system/lib/libcxx/random.cpp +48 -0
- data/modules/emscripten/system/lib/libcxx/readme.txt +1 -0
- data/modules/emscripten/system/lib/libcxx/regex.cpp +325 -0
- data/modules/emscripten/system/lib/libcxx/stdexcept.cpp +196 -0
- data/modules/emscripten/system/lib/libcxx/string.cpp +687 -0
- data/modules/emscripten/system/lib/libcxx/strstream.cpp +329 -0
- data/modules/emscripten/system/lib/libcxx/support/solaris/README +4 -0
- data/modules/emscripten/system/lib/libcxx/support/solaris/mbsnrtowcs.inc +76 -0
- data/modules/emscripten/system/lib/libcxx/support/solaris/wcsnrtombs.inc +93 -0
- data/modules/emscripten/system/lib/libcxx/support/solaris/xlocale.c +245 -0
- data/modules/emscripten/system/lib/libcxx/support/win32/locale_win32.cpp +94 -0
- data/modules/emscripten/system/lib/libcxx/support/win32/support.cpp +70 -0
- data/modules/emscripten/system/lib/libcxx/symbols +2927 -0
- data/modules/emscripten/system/lib/libcxx/system_error.cpp +201 -0
- data/modules/emscripten/system/lib/libcxx/thread.cpp +208 -0
- data/modules/emscripten/system/lib/libcxx/typeinfo.cpp +60 -0
- data/modules/emscripten/system/lib/libcxx/utility.cpp +17 -0
- data/modules/emscripten/system/lib/libcxx/valarray.cpp +54 -0
- data/modules/emscripten/system/lib/libcxxabi/CREDITS.TXT +38 -0
- data/modules/emscripten/system/lib/libcxxabi/LICENSE.TXT +76 -0
- data/modules/emscripten/system/lib/libcxxabi/include/cxa_demangle.h +167 -0
- data/modules/emscripten/system/lib/libcxxabi/include/cxxabi.h +175 -0
- data/modules/emscripten/system/lib/libcxxabi/lib/buildit +99 -0
- data/modules/emscripten/system/lib/libcxxabi/readme.txt +1 -0
- data/modules/emscripten/system/lib/libcxxabi/src/abort_message.cpp +50 -0
- data/modules/emscripten/system/lib/libcxxabi/src/abort_message.h +33 -0
- data/modules/emscripten/system/lib/libcxxabi/src/cxa_aux_runtime.cpp +34 -0
- data/modules/emscripten/system/lib/libcxxabi/src/cxa_demangle.cpp +11036 -0
- data/modules/emscripten/system/lib/libcxxabi/src/cxa_exception.cpp +622 -0
- data/modules/emscripten/system/lib/libcxxabi/src/cxa_exception.hpp +123 -0
- data/modules/emscripten/system/lib/libcxxabi/src/cxa_exception_storage.cpp +91 -0
- data/modules/emscripten/system/lib/libcxxabi/src/cxa_guard.cpp +231 -0
- data/modules/emscripten/system/lib/libcxxabi/src/cxa_handlers.cpp +125 -0
- data/modules/emscripten/system/lib/libcxxabi/src/cxa_handlers.hpp +54 -0
- data/modules/emscripten/system/lib/libcxxabi/src/cxa_new_delete.cpp +242 -0
- data/modules/emscripten/system/lib/libcxxabi/src/cxa_personality.cpp +1055 -0
- data/modules/emscripten/system/lib/libcxxabi/src/cxa_unexpected.cpp +27 -0
- data/modules/emscripten/system/lib/libcxxabi/src/cxa_vector.cpp +367 -0
- data/modules/emscripten/system/lib/libcxxabi/src/cxa_virtual.cpp +31 -0
- data/modules/emscripten/system/lib/libcxxabi/src/exception.cpp +41 -0
- data/modules/emscripten/system/lib/libcxxabi/src/fallback_malloc.ipp +174 -0
- data/modules/emscripten/system/lib/libcxxabi/src/private_typeinfo.cpp +1146 -0
- data/modules/emscripten/system/lib/libcxxabi/src/private_typeinfo.h +248 -0
- data/modules/emscripten/system/lib/libcxxabi/src/stdexcept.cpp +169 -0
- data/modules/emscripten/system/lib/libcxxabi/src/typeinfo.cpp +53 -0
- data/modules/emscripten/system/lib/libcxxabi/symbols +236 -0
- data/modules/emscripten/system/lib/sdl.cpp +13 -0
- data/modules/emscripten/system/lib/sdl.symbols +1 -0
- data/modules/emscripten/tests/hello_world.js +92 -0
- data/modules/emscripten/third_party/CppHeaderParser/CppHeaderParser/CppHeaderParser.py +2347 -0
- data/modules/emscripten/third_party/CppHeaderParser/CppHeaderParser/__init__.py +4 -0
- data/modules/emscripten/third_party/CppHeaderParser/CppHeaderParser/doc/CppHeaderParser.html +657 -0
- data/modules/emscripten/third_party/CppHeaderParser/CppHeaderParser/examples/SampleClass.h +147 -0
- data/modules/emscripten/third_party/CppHeaderParser/CppHeaderParser/examples/readSampleClass.py +74 -0
- data/modules/emscripten/third_party/CppHeaderParser/PKG-INFO +249 -0
- data/modules/emscripten/third_party/CppHeaderParser/README.html +544 -0
- data/modules/emscripten/third_party/CppHeaderParser/README.txt +226 -0
- data/modules/emscripten/third_party/CppHeaderParser/setup.py +43 -0
- data/modules/emscripten/third_party/ansidecl.h +371 -0
- data/modules/emscripten/third_party/closure-compiler/COPYING +202 -0
- data/modules/emscripten/third_party/closure-compiler/README +292 -0
- data/modules/emscripten/third_party/closure-compiler/compiler.jar +0 -0
- data/modules/emscripten/third_party/closure-compiler/readme.txt +3 -0
- data/modules/emscripten/third_party/cp-demangle.h +161 -0
- data/modules/emscripten/third_party/demangle.h +549 -0
- data/modules/emscripten/third_party/demangler.py +49 -0
- data/modules/emscripten/third_party/gcc_demangler.c +4226 -0
- data/modules/emscripten/third_party/gcc_demangler.js +21282 -0
- data/modules/emscripten/third_party/jni/emjvm.cpp +133 -0
- data/modules/emscripten/third_party/jni/emjvm.h +8 -0
- data/modules/emscripten/third_party/jni/emjvm.js +185 -0
- data/modules/emscripten/third_party/jni/jni.h +1154 -0
- data/modules/emscripten/third_party/libiberty.h +634 -0
- data/modules/emscripten/third_party/lzma.js/README.markdown +37 -0
- data/modules/emscripten/third_party/lzma.js/doit.sh +37 -0
- data/modules/emscripten/third_party/lzma.js/lzip/AUTHORS +7 -0
- data/modules/emscripten/third_party/lzma.js/lzip/COPYING +676 -0
- data/modules/emscripten/third_party/lzma.js/lzip/ChangeLog +201 -0
- data/modules/emscripten/third_party/lzma.js/lzip/INSTALL +56 -0
- data/modules/emscripten/third_party/lzma.js/lzip/Makefile +160 -0
- data/modules/emscripten/third_party/lzma.js/lzip/Makefile.in +138 -0
- data/modules/emscripten/third_party/lzma.js/lzip/NEWS +22 -0
- data/modules/emscripten/third_party/lzma.js/lzip/README +77 -0
- data/modules/emscripten/third_party/lzma.js/lzip/arg_parser.cc +204 -0
- data/modules/emscripten/third_party/lzma.js/lzip/arg_parser.h +106 -0
- data/modules/emscripten/third_party/lzma.js/lzip/configure +192 -0
- data/modules/emscripten/third_party/lzma.js/lzip/decoder.cc +252 -0
- data/modules/emscripten/third_party/lzma.js/lzip/decoder.h +268 -0
- data/modules/emscripten/third_party/lzma.js/lzip/encoder.cc +643 -0
- data/modules/emscripten/third_party/lzma.js/lzip/encoder.h +582 -0
- data/modules/emscripten/third_party/lzma.js/lzip/fast_encoder.cc +378 -0
- data/modules/emscripten/third_party/lzma.js/lzip/fast_encoder.h +171 -0
- data/modules/emscripten/third_party/lzma.js/lzip/lzip.h +264 -0
- data/modules/emscripten/third_party/lzma.js/lzip/main.cc +545 -0
- data/modules/emscripten/third_party/lzma.js/lzma-decoder.js +27 -0
- data/modules/emscripten/third_party/lzma.js/lzma-full.js +27 -0
- data/modules/emscripten/third_party/lzma.js/native_test.sh +5 -0
- data/modules/emscripten/third_party/lzma.js/post.js +13 -0
- data/modules/emscripten/third_party/lzma.js/pre.js +13 -0
- data/modules/emscripten/third_party/lzma.js/test-decoder.js +39 -0
- data/modules/emscripten/third_party/lzma.js/test-full.html +9 -0
- data/modules/emscripten/third_party/lzma.js/test-full.js +78 -0
- data/modules/emscripten/third_party/ply/ANNOUNCE +40 -0
- data/modules/emscripten/third_party/ply/CHANGES +1093 -0
- data/modules/emscripten/third_party/ply/PKG-INFO +22 -0
- data/modules/emscripten/third_party/ply/README +271 -0
- data/modules/emscripten/third_party/ply/TODO +16 -0
- data/modules/emscripten/third_party/ply/doc/internal.html +874 -0
- data/modules/emscripten/third_party/ply/doc/makedoc.py +194 -0
- data/modules/emscripten/third_party/ply/doc/ply.html +3262 -0
- data/modules/emscripten/third_party/ply/example/BASIC/README +79 -0
- data/modules/emscripten/third_party/ply/example/BASIC/basic.py +71 -0
- data/modules/emscripten/third_party/ply/example/BASIC/basiclex.py +74 -0
- data/modules/emscripten/third_party/ply/example/BASIC/basiclog.py +79 -0
- data/modules/emscripten/third_party/ply/example/BASIC/basinterp.py +441 -0
- data/modules/emscripten/third_party/ply/example/BASIC/basparse.py +424 -0
- data/modules/emscripten/third_party/ply/example/BASIC/dim.bas +14 -0
- data/modules/emscripten/third_party/ply/example/BASIC/func.bas +5 -0
- data/modules/emscripten/third_party/ply/example/BASIC/gcd.bas +22 -0
- data/modules/emscripten/third_party/ply/example/BASIC/gosub.bas +13 -0
- data/modules/emscripten/third_party/ply/example/BASIC/hello.bas +4 -0
- data/modules/emscripten/third_party/ply/example/BASIC/linear.bas +17 -0
- data/modules/emscripten/third_party/ply/example/BASIC/maxsin.bas +12 -0
- data/modules/emscripten/third_party/ply/example/BASIC/powers.bas +13 -0
- data/modules/emscripten/third_party/ply/example/BASIC/rand.bas +4 -0
- data/modules/emscripten/third_party/ply/example/BASIC/sales.bas +20 -0
- data/modules/emscripten/third_party/ply/example/BASIC/sears.bas +18 -0
- data/modules/emscripten/third_party/ply/example/BASIC/sqrt1.bas +5 -0
- data/modules/emscripten/third_party/ply/example/BASIC/sqrt2.bas +4 -0
- data/modules/emscripten/third_party/ply/example/GardenSnake/GardenSnake.py +709 -0
- data/modules/emscripten/third_party/ply/example/GardenSnake/README +5 -0
- data/modules/emscripten/third_party/ply/example/README +10 -0
- data/modules/emscripten/third_party/ply/example/ansic/README +2 -0
- data/modules/emscripten/third_party/ply/example/ansic/clex.py +164 -0
- data/modules/emscripten/third_party/ply/example/ansic/cparse.py +863 -0
- data/modules/emscripten/third_party/ply/example/calc/calc.py +107 -0
- data/modules/emscripten/third_party/ply/example/calcdebug/calc.py +113 -0
- data/modules/emscripten/third_party/ply/example/classcalc/calc.py +157 -0
- data/modules/emscripten/third_party/ply/example/cleanup.sh +2 -0
- data/modules/emscripten/third_party/ply/example/closurecalc/calc.py +130 -0
- data/modules/emscripten/third_party/ply/example/hedit/hedit.py +48 -0
- data/modules/emscripten/third_party/ply/example/newclasscalc/calc.py +160 -0
- data/modules/emscripten/third_party/ply/example/optcalc/README +9 -0
- data/modules/emscripten/third_party/ply/example/optcalc/calc.py +119 -0
- data/modules/emscripten/third_party/ply/example/unicalc/calc.py +117 -0
- data/modules/emscripten/third_party/ply/example/yply/README +41 -0
- data/modules/emscripten/third_party/ply/example/yply/ylex.py +112 -0
- data/modules/emscripten/third_party/ply/example/yply/yparse.py +217 -0
- data/modules/emscripten/third_party/ply/example/yply/yply.py +53 -0
- data/modules/emscripten/third_party/ply/ply/__init__.py +4 -0
- data/modules/emscripten/third_party/ply/ply/cpp.py +898 -0
- data/modules/emscripten/third_party/ply/ply/ctokens.py +133 -0
- data/modules/emscripten/third_party/ply/ply/lex.py +1058 -0
- data/modules/emscripten/third_party/ply/ply/yacc.py +3276 -0
- data/modules/emscripten/third_party/ply/setup.py +31 -0
- data/modules/emscripten/third_party/ply/test/README +7 -0
- data/modules/emscripten/third_party/ply/test/calclex.py +49 -0
- data/modules/emscripten/third_party/ply/test/cleanup.sh +4 -0
- data/modules/emscripten/third_party/ply/test/lex_closure.py +54 -0
- data/modules/emscripten/third_party/ply/test/lex_doc1.py +26 -0
- data/modules/emscripten/third_party/ply/test/lex_dup1.py +29 -0
- data/modules/emscripten/third_party/ply/test/lex_dup2.py +33 -0
- data/modules/emscripten/third_party/ply/test/lex_dup3.py +31 -0
- data/modules/emscripten/third_party/ply/test/lex_empty.py +20 -0
- data/modules/emscripten/third_party/ply/test/lex_error1.py +24 -0
- data/modules/emscripten/third_party/ply/test/lex_error2.py +26 -0
- data/modules/emscripten/third_party/ply/test/lex_error3.py +27 -0
- data/modules/emscripten/third_party/ply/test/lex_error4.py +27 -0
- data/modules/emscripten/third_party/ply/test/lex_hedit.py +47 -0
- data/modules/emscripten/third_party/ply/test/lex_ignore.py +31 -0
- data/modules/emscripten/third_party/ply/test/lex_ignore2.py +29 -0
- data/modules/emscripten/third_party/ply/test/lex_literal1.py +25 -0
- data/modules/emscripten/third_party/ply/test/lex_literal2.py +25 -0
- data/modules/emscripten/third_party/ply/test/lex_many_tokens.py +27 -0
- data/modules/emscripten/third_party/ply/test/lex_module.py +10 -0
- data/modules/emscripten/third_party/ply/test/lex_module_import.py +42 -0
- data/modules/emscripten/third_party/ply/test/lex_object.py +55 -0
- data/modules/emscripten/third_party/ply/test/lex_opt_alias.py +54 -0
- data/modules/emscripten/third_party/ply/test/lex_optimize.py +50 -0
- data/modules/emscripten/third_party/ply/test/lex_optimize2.py +50 -0
- data/modules/emscripten/third_party/ply/test/lex_optimize3.py +52 -0
- data/modules/emscripten/third_party/ply/test/lex_re1.py +27 -0
- data/modules/emscripten/third_party/ply/test/lex_re2.py +27 -0
- data/modules/emscripten/third_party/ply/test/lex_re3.py +29 -0
- data/modules/emscripten/third_party/ply/test/lex_rule1.py +27 -0
- data/modules/emscripten/third_party/ply/test/lex_rule2.py +29 -0
- data/modules/emscripten/third_party/ply/test/lex_rule3.py +27 -0
- data/modules/emscripten/third_party/ply/test/lex_state1.py +40 -0
- data/modules/emscripten/third_party/ply/test/lex_state2.py +40 -0
- data/modules/emscripten/third_party/ply/test/lex_state3.py +42 -0
- data/modules/emscripten/third_party/ply/test/lex_state4.py +41 -0
- data/modules/emscripten/third_party/ply/test/lex_state5.py +40 -0
- data/modules/emscripten/third_party/ply/test/lex_state_noerror.py +39 -0
- data/modules/emscripten/third_party/ply/test/lex_state_norule.py +40 -0
- data/modules/emscripten/third_party/ply/test/lex_state_try.py +45 -0
- data/modules/emscripten/third_party/ply/test/lex_token1.py +19 -0
- data/modules/emscripten/third_party/ply/test/lex_token2.py +22 -0
- data/modules/emscripten/third_party/ply/test/lex_token3.py +24 -0
- data/modules/emscripten/third_party/ply/test/lex_token4.py +26 -0
- data/modules/emscripten/third_party/ply/test/lex_token5.py +31 -0
- data/modules/emscripten/third_party/ply/test/lex_token_dup.py +29 -0
- data/modules/emscripten/third_party/ply/test/testlex.py +606 -0
- data/modules/emscripten/third_party/ply/test/testyacc.py +347 -0
- data/modules/emscripten/third_party/ply/test/yacc_badargs.py +68 -0
- data/modules/emscripten/third_party/ply/test/yacc_badid.py +77 -0
- data/modules/emscripten/third_party/ply/test/yacc_badprec.py +64 -0
- data/modules/emscripten/third_party/ply/test/yacc_badprec2.py +68 -0
- data/modules/emscripten/third_party/ply/test/yacc_badprec3.py +68 -0
- data/modules/emscripten/third_party/ply/test/yacc_badrule.py +68 -0
- data/modules/emscripten/third_party/ply/test/yacc_badtok.py +68 -0
- data/modules/emscripten/third_party/ply/test/yacc_dup.py +68 -0
- data/modules/emscripten/third_party/ply/test/yacc_error1.py +68 -0
- data/modules/emscripten/third_party/ply/test/yacc_error2.py +68 -0
- data/modules/emscripten/third_party/ply/test/yacc_error3.py +67 -0
- data/modules/emscripten/third_party/ply/test/yacc_error4.py +72 -0
- data/modules/emscripten/third_party/ply/test/yacc_inf.py +56 -0
- data/modules/emscripten/third_party/ply/test/yacc_literal.py +69 -0
- data/modules/emscripten/third_party/ply/test/yacc_misplaced.py +68 -0
- data/modules/emscripten/third_party/ply/test/yacc_missing1.py +68 -0
- data/modules/emscripten/third_party/ply/test/yacc_nested.py +33 -0
- data/modules/emscripten/third_party/ply/test/yacc_nodoc.py +67 -0
- data/modules/emscripten/third_party/ply/test/yacc_noerror.py +66 -0
- data/modules/emscripten/third_party/ply/test/yacc_nop.py +68 -0
- data/modules/emscripten/third_party/ply/test/yacc_notfunc.py +66 -0
- data/modules/emscripten/third_party/ply/test/yacc_notok.py +67 -0
- data/modules/emscripten/third_party/ply/test/yacc_prec1.py +68 -0
- data/modules/emscripten/third_party/ply/test/yacc_rr.py +72 -0
- data/modules/emscripten/third_party/ply/test/yacc_rr_unused.py +30 -0
- data/modules/emscripten/third_party/ply/test/yacc_simple.py +68 -0
- data/modules/emscripten/third_party/ply/test/yacc_sr.py +63 -0
- data/modules/emscripten/third_party/ply/test/yacc_term1.py +68 -0
- data/modules/emscripten/third_party/ply/test/yacc_unused.py +77 -0
- data/modules/emscripten/third_party/ply/test/yacc_unused_rule.py +72 -0
- data/modules/emscripten/third_party/ply/test/yacc_uprec.py +63 -0
- data/modules/emscripten/third_party/ply/test/yacc_uprec2.py +63 -0
- data/modules/emscripten/third_party/readme.txt +7 -0
- data/modules/emscripten/third_party/websockify/CHANGES.txt +23 -0
- data/modules/emscripten/third_party/websockify/LICENSE.txt +16 -0
- data/modules/emscripten/third_party/websockify/MANIFEST.in +1 -0
- data/modules/emscripten/third_party/websockify/Makefile +11 -0
- data/modules/emscripten/third_party/websockify/README.md +168 -0
- data/modules/emscripten/third_party/websockify/Windows/Windows Service Readme.txt +39 -0
- data/modules/emscripten/third_party/websockify/Windows/noVNC Websocket Service Project/Program.cs +24 -0
- data/modules/emscripten/third_party/websockify/Windows/noVNC Websocket Service Project/ProjectInstaller.Designer.cs +61 -0
- data/modules/emscripten/third_party/websockify/Windows/noVNC Websocket Service Project/ProjectInstaller.cs +19 -0
- data/modules/emscripten/third_party/websockify/Windows/noVNC Websocket Service Project/ProjectInstaller.resx +129 -0
- data/modules/emscripten/third_party/websockify/Windows/noVNC Websocket Service Project/Properties/AssemblyInfo.cs +36 -0
- data/modules/emscripten/third_party/websockify/Windows/noVNC Websocket Service Project/Service1.Designer.cs +37 -0
- data/modules/emscripten/third_party/websockify/Windows/noVNC Websocket Service Project/Service1.cs +41 -0
- data/modules/emscripten/third_party/websockify/Windows/noVNC Websocket Service Project/noVNC Websocket.csproj +75 -0
- data/modules/emscripten/third_party/websockify/Windows/noVNC Websocket Service Project/noVNC Websocket.sln +20 -0
- data/modules/emscripten/third_party/websockify/docs/LICENSE.GPL-3 +621 -0
- data/modules/emscripten/third_party/websockify/docs/LICENSE.LGPL-3 +165 -0
- data/modules/emscripten/third_party/websockify/docs/LICENSE.MPL-2.0 +373 -0
- data/modules/emscripten/third_party/websockify/docs/TODO +9 -0
- data/modules/emscripten/third_party/websockify/docs/flash_policy.txt +4 -0
- data/modules/emscripten/third_party/websockify/docs/latency_results.txt +114 -0
- data/modules/emscripten/third_party/websockify/docs/notes +17 -0
- data/modules/emscripten/third_party/websockify/docs/release.txt +9 -0
- data/modules/emscripten/third_party/websockify/docs/websockify.1 +110 -0
- data/modules/emscripten/third_party/websockify/include/VT100.js +919 -0
- data/modules/emscripten/third_party/websockify/include/base64.js +114 -0
- data/modules/emscripten/third_party/websockify/include/keysym.js +99 -0
- data/modules/emscripten/third_party/websockify/include/util.js +359 -0
- data/modules/emscripten/third_party/websockify/include/web-socket-js/README.txt +109 -0
- data/modules/emscripten/third_party/websockify/include/web-socket-js/WebSocketMain.swf +0 -0
- data/modules/emscripten/third_party/websockify/include/web-socket-js/swfobject.js +4 -0
- data/modules/emscripten/third_party/websockify/include/web-socket-js/web_socket.js +391 -0
- data/modules/emscripten/third_party/websockify/include/websock.js +422 -0
- data/modules/emscripten/third_party/websockify/include/webutil.js +216 -0
- data/modules/emscripten/third_party/websockify/include/wsirc.js +235 -0
- data/modules/emscripten/third_party/websockify/include/wstelnet.js +335 -0
- data/modules/emscripten/third_party/websockify/other/Makefile +14 -0
- data/modules/emscripten/third_party/websockify/other/README.md +51 -0
- data/modules/emscripten/third_party/websockify/other/launch.sh +108 -0
- data/modules/emscripten/third_party/websockify/other/project.clj +13 -0
- data/modules/emscripten/third_party/websockify/other/websocket.c +802 -0
- data/modules/emscripten/third_party/websockify/other/websocket.h +84 -0
- data/modules/emscripten/third_party/websockify/other/websocket.rb +456 -0
- data/modules/emscripten/third_party/websockify/other/websockify.c +385 -0
- data/modules/emscripten/third_party/websockify/other/websockify.clj +233 -0
- data/modules/emscripten/third_party/websockify/other/websockify.js +196 -0
- data/modules/emscripten/third_party/websockify/other/websockify.rb +171 -0
- data/modules/emscripten/third_party/websockify/other/wswrap +22 -0
- data/modules/emscripten/third_party/websockify/rebind +18 -0
- data/modules/emscripten/third_party/websockify/rebind.c +94 -0
- data/modules/emscripten/third_party/websockify/run +5 -0
- data/modules/emscripten/third_party/websockify/setup.py +30 -0
- data/modules/emscripten/third_party/websockify/tests/b64_vs_utf8.py +29 -0
- data/modules/emscripten/third_party/websockify/tests/base64.html +91 -0
- data/modules/emscripten/third_party/websockify/tests/base64.js +12 -0
- data/modules/emscripten/third_party/websockify/tests/echo.html +148 -0
- data/modules/emscripten/third_party/websockify/tests/echo.py +75 -0
- data/modules/emscripten/third_party/websockify/tests/echo.rb +62 -0
- data/modules/emscripten/third_party/websockify/tests/latency.html +290 -0
- data/modules/emscripten/third_party/websockify/tests/latency.py +75 -0
- data/modules/emscripten/third_party/websockify/tests/load.html +250 -0
- data/modules/emscripten/third_party/websockify/tests/load.py +167 -0
- data/modules/emscripten/third_party/websockify/tests/plain_echo.html +168 -0
- data/modules/emscripten/third_party/websockify/tests/simple.html +68 -0
- data/modules/emscripten/third_party/websockify/tests/utf8-list.py +22 -0
- data/modules/emscripten/third_party/websockify/websockify/__init__.py +2 -0
- data/modules/emscripten/third_party/websockify/websockify/websocket.py +982 -0
- data/modules/emscripten/third_party/websockify/websockify/websocketproxy.py +393 -0
- data/modules/emscripten/third_party/websockify/websockify.py +5 -0
- data/modules/emscripten/third_party/websockify/wsirc.html +99 -0
- data/modules/emscripten/third_party/websockify/wstelnet.html +74 -0
- data/modules/emscripten/tools/__init__.py +0 -0
- data/modules/emscripten/tools/__init__.pyc +0 -0
- data/modules/emscripten/tools/autodebugger.py +289 -0
- data/modules/emscripten/tools/autodebugger_c.py +37 -0
- data/modules/emscripten/tools/autodebugger_indenter.py +18 -0
- data/modules/emscripten/tools/autodebugger_js.py +47 -0
- data/modules/emscripten/tools/autodediffer.py +60 -0
- data/modules/emscripten/tools/bindings_generator.py +832 -0
- data/modules/emscripten/tools/bisect_pair.py +88 -0
- data/modules/emscripten/tools/cache.py +198 -0
- data/modules/emscripten/tools/cache.pyc +0 -0
- data/modules/emscripten/tools/clean_webconsole.py +34 -0
- data/modules/emscripten/tools/crunch-worker.js +124 -0
- data/modules/emscripten/tools/diff_autodebugger.py +15 -0
- data/modules/emscripten/tools/eliminator/asm-eliminator-test-output.js +5129 -0
- data/modules/emscripten/tools/eliminator/asm-eliminator-test.js +6861 -0
- data/modules/emscripten/tools/eliminator/eliminator-test-output.js +6122 -0
- data/modules/emscripten/tools/eliminator/eliminator-test.js +8856 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/README.html +888 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/README.org +463 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/bin/uglifyjs +317 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/docstyle.css +75 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/lib/object-ast.js +75 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/lib/parse-js.js +1363 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/lib/process.js +2005 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/lib/squeeze-more.js +51 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/package.json +22 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/beautify.js +28 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/testparser.js +402 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/array1.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/array2.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/array3.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/array4.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/assignment.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/concatstring.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/const.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/empty-blocks.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/forstatement.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/if.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/ifreturn.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/ifreturn2.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue10.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue11.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue13.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue14.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue16.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue17.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue20.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue21.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue25.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue27.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue28.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue29.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue30.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue34.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue4.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue48.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue50.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue53.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue54.1.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue68.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue69.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/issue9.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/mangle.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/strict-equals.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/var.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/expected/with.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/array1.js +3 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/array2.js +4 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/array3.js +4 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/array4.js +6 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/assignment.js +20 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/concatstring.js +3 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/const.js +5 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/empty-blocks.js +4 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/forstatement.js +10 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/if.js +6 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/ifreturn.js +9 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/ifreturn2.js +16 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue10.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue11.js +3 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue13.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue14.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue16.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue17.js +4 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue20.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue21.js +6 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue25.js +7 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue27.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue28.js +3 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue29.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue30.js +3 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue34.js +3 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue4.js +3 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue48.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue50.js +9 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue53.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue54.1.js +3 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue68.js +5 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue69.js +1 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/issue9.js +4 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/mangle.js +5 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/strict-equals.js +3 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/var.js +3 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/compress/test/with.js +2 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/test/unit/scripts.js +55 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/tmp/hoist.js +33 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/tmp/instrument.js +97 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/tmp/instrument2.js +138 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/tmp/test.js +16 -0
- data/modules/emscripten/tools/eliminator/node_modules/uglify-js/uglify-js.js +17 -0
- data/modules/emscripten/tools/eliminator/safe-eliminator-test-output.js +85 -0
- data/modules/emscripten/tools/eliminator/safe-eliminator-test.js +103 -0
- data/modules/emscripten/tools/emconfiguren.py +19 -0
- data/modules/emscripten/tools/emmaken.py +230 -0
- data/modules/emscripten/tools/emmakenxx.py +18 -0
- data/modules/emscripten/tools/exec_llvm.py +50 -0
- data/modules/emscripten/tools/file2json.py +49 -0
- data/modules/emscripten/tools/file_packager.py +649 -0
- data/modules/emscripten/tools/find_bigfuncs.py +23 -0
- data/modules/emscripten/tools/find_bigis.py +18 -0
- data/modules/emscripten/tools/fix_closure.py +88 -0
- data/modules/emscripten/tools/ie7_fix.py +14 -0
- data/modules/emscripten/tools/js-optimizer.js +3440 -0
- data/modules/emscripten/tools/js_optimizer.py +341 -0
- data/modules/emscripten/tools/js_optimizer.pyc +0 -0
- data/modules/emscripten/tools/jsrun.py +27 -0
- data/modules/emscripten/tools/jsrun.pyc +0 -0
- data/modules/emscripten/tools/ll-strip.py +56 -0
- data/modules/emscripten/tools/make_file.py +19 -0
- data/modules/emscripten/tools/make_minigzip.py +13 -0
- data/modules/emscripten/tools/namespacer.py +95 -0
- data/modules/emscripten/tools/nativize_llvm.py +34 -0
- data/modules/emscripten/tools/node_modules/source-map/CHANGELOG.md +58 -0
- data/modules/emscripten/tools/node_modules/source-map/LICENSE +28 -0
- data/modules/emscripten/tools/node_modules/source-map/Makefile.dryice.js +166 -0
- data/modules/emscripten/tools/node_modules/source-map/README.md +347 -0
- data/modules/emscripten/tools/node_modules/source-map/build/assert-shim.js +56 -0
- data/modules/emscripten/tools/node_modules/source-map/build/mini-require.js +152 -0
- data/modules/emscripten/tools/node_modules/source-map/build/prefix-source-map.jsm +20 -0
- data/modules/emscripten/tools/node_modules/source-map/build/prefix-utils.jsm +18 -0
- data/modules/emscripten/tools/node_modules/source-map/build/suffix-browser.js +8 -0
- data/modules/emscripten/tools/node_modules/source-map/build/suffix-source-map.jsm +6 -0
- data/modules/emscripten/tools/node_modules/source-map/build/suffix-utils.jsm +21 -0
- data/modules/emscripten/tools/node_modules/source-map/build/test-prefix.js +8 -0
- data/modules/emscripten/tools/node_modules/source-map/build/test-suffix.js +3 -0
- data/modules/emscripten/tools/node_modules/source-map/lib/source-map/array-set.js +96 -0
- data/modules/emscripten/tools/node_modules/source-map/lib/source-map/base64-vlq.js +144 -0
- data/modules/emscripten/tools/node_modules/source-map/lib/source-map/base64.js +42 -0
- data/modules/emscripten/tools/node_modules/source-map/lib/source-map/binary-search.js +81 -0
- data/modules/emscripten/tools/node_modules/source-map/lib/source-map/source-map-consumer.js +430 -0
- data/modules/emscripten/tools/node_modules/source-map/lib/source-map/source-map-generator.js +381 -0
- data/modules/emscripten/tools/node_modules/source-map/lib/source-map/source-node.js +353 -0
- data/modules/emscripten/tools/node_modules/source-map/lib/source-map/util.js +117 -0
- data/modules/emscripten/tools/node_modules/source-map/lib/source-map.js +8 -0
- data/modules/emscripten/tools/node_modules/source-map/node_modules/amdefine/LICENSE +58 -0
- data/modules/emscripten/tools/node_modules/source-map/node_modules/amdefine/README.md +119 -0
- data/modules/emscripten/tools/node_modules/source-map/node_modules/amdefine/amdefine.js +299 -0
- data/modules/emscripten/tools/node_modules/source-map/node_modules/amdefine/package.json +33 -0
- data/modules/emscripten/tools/node_modules/source-map/package.json +74 -0
- data/modules/emscripten/tools/node_modules/source-map/test/run-tests.js +73 -0
- data/modules/emscripten/tools/node_modules/source-map/test/source-map/test-api.js +26 -0
- data/modules/emscripten/tools/node_modules/source-map/test/source-map/test-array-set.js +71 -0
- data/modules/emscripten/tools/node_modules/source-map/test/source-map/test-base64-vlq.js +24 -0
- data/modules/emscripten/tools/node_modules/source-map/test/source-map/test-base64.js +35 -0
- data/modules/emscripten/tools/node_modules/source-map/test/source-map/test-binary-search.js +54 -0
- data/modules/emscripten/tools/node_modules/source-map/test/source-map/test-dog-fooding.js +72 -0
- data/modules/emscripten/tools/node_modules/source-map/test/source-map/test-source-map-consumer.js +306 -0
- data/modules/emscripten/tools/node_modules/source-map/test/source-map/test-source-map-generator.js +391 -0
- data/modules/emscripten/tools/node_modules/source-map/test/source-map/test-source-node.js +282 -0
- data/modules/emscripten/tools/node_modules/source-map/test/source-map/util.js +152 -0
- data/modules/emscripten/tools/reproduceriter.js +216 -0
- data/modules/emscripten/tools/reproduceriter.py +160 -0
- data/modules/emscripten/tools/response_file.py +28 -0
- data/modules/emscripten/tools/response_file.pyc +0 -0
- data/modules/emscripten/tools/scan_js.py +20 -0
- data/modules/emscripten/tools/scan_ll.py +18 -0
- data/modules/emscripten/tools/scons/site_scons/site_tools/emscripten/__init__.py +3 -0
- data/modules/emscripten/tools/scons/site_scons/site_tools/emscripten/emscripten.py +46 -0
- data/modules/emscripten/tools/settings_template_readonly.py +47 -0
- data/modules/emscripten/tools/shared.py +1437 -0
- data/modules/emscripten/tools/shared.pyc +0 -0
- data/modules/emscripten/tools/source-maps/sourcemap2json.js +15 -0
- data/modules/emscripten/tools/source-maps/sourcemapper.js +177 -0
- data/modules/emscripten/tools/split.py +97 -0
- data/modules/emscripten/tools/tempfiles.py +40 -0
- data/modules/emscripten/tools/tempfiles.pyc +0 -0
- data/modules/emscripten/tools/test-js-optimizer-asm-last-output.js +75 -0
- data/modules/emscripten/tools/test-js-optimizer-asm-last.js +91 -0
- data/modules/emscripten/tools/test-js-optimizer-asm-outline-output.js +570 -0
- data/modules/emscripten/tools/test-js-optimizer-asm-outline.js +606 -0
- data/modules/emscripten/tools/test-js-optimizer-asm-pre-output.js +540 -0
- data/modules/emscripten/tools/test-js-optimizer-asm-pre.js +550 -0
- data/modules/emscripten/tools/test-js-optimizer-asm-regs-min-output.js +36 -0
- data/modules/emscripten/tools/test-js-optimizer-asm-regs-min.js +37 -0
- data/modules/emscripten/tools/test-js-optimizer-asm-regs-output.js +106 -0
- data/modules/emscripten/tools/test-js-optimizer-asm-regs.js +110 -0
- data/modules/emscripten/tools/test-js-optimizer-asm-relocate-output.js +9 -0
- data/modules/emscripten/tools/test-js-optimizer-asm-relocate.js +12 -0
- data/modules/emscripten/tools/test-js-optimizer-output.js +291 -0
- data/modules/emscripten/tools/test-js-optimizer-regs-output.js +232 -0
- data/modules/emscripten/tools/test-js-optimizer-regs.js +237 -0
- data/modules/emscripten/tools/test-js-optimizer-t2-output.js +91 -0
- data/modules/emscripten/tools/test-js-optimizer-t2.js +92 -0
- data/modules/emscripten/tools/test-js-optimizer-t2c-output.js +17 -0
- data/modules/emscripten/tools/test-js-optimizer-t2c.js +18 -0
- data/modules/emscripten/tools/test-js-optimizer-t3-output.js +49 -0
- data/modules/emscripten/tools/test-js-optimizer-t3.js +50 -0
- data/modules/emscripten/tools/test-js-optimizer.js +401 -0
- data/modules/mruby/AUTHORS +18 -0
- data/modules/mruby/CONTRIBUTING.md +65 -0
- data/modules/mruby/ChangeLog +15 -0
- data/modules/mruby/INSTALL +29 -0
- data/modules/mruby/LEGAL +6 -0
- data/modules/mruby/MITL +20 -0
- data/modules/mruby/Makefile +18 -0
- data/modules/mruby/NEWS +13 -0
- data/modules/mruby/README.md +116 -0
- data/modules/mruby/Rakefile +114 -0
- data/modules/mruby/TODO +11 -0
- data/modules/mruby/benchmark/ao-render.rb +315 -0
- data/modules/mruby/benchmark/bm_so_lists.rb +47 -0
- data/modules/mruby/benchmark/fib39.rb +8 -0
- data/modules/mruby/build_config.rb +88 -0
- data/modules/mruby/doc/compile/README.md +376 -0
- data/modules/mruby/doc/mrbgems/README.md +254 -0
- data/modules/mruby/examples/mrbgems/c_and_ruby_extension_example/README.md +4 -0
- data/modules/mruby/examples/mrbgems/c_and_ruby_extension_example/mrbgem.rake +23 -0
- data/modules/mruby/examples/mrbgems/c_and_ruby_extension_example/mrblib/example.rb +5 -0
- data/modules/mruby/examples/mrbgems/c_and_ruby_extension_example/src/example.c +20 -0
- data/modules/mruby/examples/mrbgems/c_and_ruby_extension_example/test/example.rb +7 -0
- data/modules/mruby/examples/mrbgems/c_extension_example/README.md +4 -0
- data/modules/mruby/examples/mrbgems/c_extension_example/mrbgem.rake +23 -0
- data/modules/mruby/examples/mrbgems/c_extension_example/src/example.c +20 -0
- data/modules/mruby/examples/mrbgems/c_extension_example/test/example.c +7 -0
- data/modules/mruby/examples/mrbgems/c_extension_example/test/example.rb +3 -0
- data/modules/mruby/examples/mrbgems/ruby_extension_example/README.md +4 -0
- data/modules/mruby/examples/mrbgems/ruby_extension_example/mrbgem.rake +23 -0
- data/modules/mruby/examples/mrbgems/ruby_extension_example/mrblib/example.rb +5 -0
- data/modules/mruby/examples/mrbgems/ruby_extension_example/test/example.rb +3 -0
- data/modules/mruby/examples/targets/ArduinoDue.rb +65 -0
- data/modules/mruby/examples/targets/chipKitMax32.rb +68 -0
- data/modules/mruby/include/mrbconf.h +87 -0
- data/modules/mruby/include/mruby/array.h +63 -0
- data/modules/mruby/include/mruby/class.h +75 -0
- data/modules/mruby/include/mruby/compile.h +176 -0
- data/modules/mruby/include/mruby/data.h +53 -0
- data/modules/mruby/include/mruby/dump.h +151 -0
- data/modules/mruby/include/mruby/gc.h +17 -0
- data/modules/mruby/include/mruby/hash.h +54 -0
- data/modules/mruby/include/mruby/irep.h +40 -0
- data/modules/mruby/include/mruby/khash.h +257 -0
- data/modules/mruby/include/mruby/numeric.h +32 -0
- data/modules/mruby/include/mruby/proc.h +62 -0
- data/modules/mruby/include/mruby/range.h +35 -0
- data/modules/mruby/include/mruby/string.h +78 -0
- data/modules/mruby/include/mruby/value.h +483 -0
- data/modules/mruby/include/mruby/variable.h +78 -0
- data/modules/mruby/include/mruby.h +388 -0
- data/modules/mruby/minirake +477 -0
- data/modules/mruby/mrbgems/default.gembox +61 -0
- data/modules/mruby/mrbgems/full-core.gembox +9 -0
- data/modules/mruby/mrbgems/mruby-array-ext/mrbgem.rake +4 -0
- data/modules/mruby/mrbgems/mruby-array-ext/mrblib/array.rb +204 -0
- data/modules/mruby/mrbgems/mruby-array-ext/src/array.c +140 -0
- data/modules/mruby/mrbgems/mruby-array-ext/test/array.rb +109 -0
- data/modules/mruby/mrbgems/mruby-bin-mirb/mrbgem.rake +5 -0
- data/modules/mruby/mrbgems/mruby-bin-mirb/tools/mirb/mirb.c +365 -0
- data/modules/mruby/mrbgems/mruby-bin-mruby/mrbgem.rake +5 -0
- data/modules/mruby/mrbgems/mruby-bin-mruby/tools/mruby/mruby.c +243 -0
- data/modules/mruby/mrbgems/mruby-enum-ext/mrbgem.rake +4 -0
- data/modules/mruby/mrbgems/mruby-enum-ext/mrblib/enum.rb +164 -0
- data/modules/mruby/mrbgems/mruby-enum-ext/test/enum.rb +44 -0
- data/modules/mruby/mrbgems/mruby-eval/mrbgem.rake +4 -0
- data/modules/mruby/mrbgems/mruby-eval/src/eval.c +23 -0
- data/modules/mruby/mrbgems/mruby-fiber/mrbgem.rake +4 -0
- data/modules/mruby/mrbgems/mruby-fiber/src/fiber.c +251 -0
- data/modules/mruby/mrbgems/mruby-fiber/test/fiber.rb +64 -0
- data/modules/mruby/mrbgems/mruby-hash-ext/mrbgem.rake +4 -0
- data/modules/mruby/mrbgems/mruby-hash-ext/mrblib/hash.rb +13 -0
- data/modules/mruby/mrbgems/mruby-hash-ext/src/hash-ext.c +62 -0
- data/modules/mruby/mrbgems/mruby-hash-ext/test/hash.rb +26 -0
- data/modules/mruby/mrbgems/mruby-math/mrbgem.rake +4 -0
- data/modules/mruby/mrbgems/mruby-math/src/math.c +685 -0
- data/modules/mruby/mrbgems/mruby-math/test/math.rb +136 -0
- data/modules/mruby/mrbgems/mruby-numeric-ext/mrbgem.rake +4 -0
- data/modules/mruby/mrbgems/mruby-numeric-ext/src/numeric_ext.c +31 -0
- data/modules/mruby/mrbgems/mruby-numeric-ext/test/numeric.rb +10 -0
- data/modules/mruby/mrbgems/mruby-object-ext/mrbgem.rake +4 -0
- data/modules/mruby/mrbgems/mruby-object-ext/src/object.c +108 -0
- data/modules/mruby/mrbgems/mruby-object-ext/test/nil.rb +11 -0
- data/modules/mruby/mrbgems/mruby-object-ext/test/object.rb +9 -0
- data/modules/mruby/mrbgems/mruby-objectspace/mrbgem.rake +4 -0
- data/modules/mruby/mrbgems/mruby-objectspace/src/mruby_objectspace.c +117 -0
- data/modules/mruby/mrbgems/mruby-objectspace/test/objectspace.rb +38 -0
- data/modules/mruby/mrbgems/mruby-print/mrbgem.rake +4 -0
- data/modules/mruby/mrbgems/mruby-print/mrblib/print.rb +64 -0
- data/modules/mruby/mrbgems/mruby-print/src/print.c +44 -0
- data/modules/mruby/mrbgems/mruby-proc-ext/mrbgem.rake +4 -0
- data/modules/mruby/mrbgems/mruby-proc-ext/mrblib/proc.rb +40 -0
- data/modules/mruby/mrbgems/mruby-proc-ext/src/proc.c +97 -0
- data/modules/mruby/mrbgems/mruby-proc-ext/test/proc.rb +41 -0
- data/modules/mruby/mrbgems/mruby-random/mrbgem.rake +4 -0
- data/modules/mruby/mrbgems/mruby-random/src/mt19937ar.c +193 -0
- data/modules/mruby/mrbgems/mruby-random/src/mt19937ar.h +48 -0
- data/modules/mruby/mrbgems/mruby-random/src/random.c +231 -0
- data/modules/mruby/mrbgems/mruby-random/src/random.h +12 -0
- data/modules/mruby/mrbgems/mruby-random/test/random.rb +32 -0
- data/modules/mruby/mrbgems/mruby-range-ext/mrbgem.rake +4 -0
- data/modules/mruby/mrbgems/mruby-range-ext/src/range.c +141 -0
- data/modules/mruby/mrbgems/mruby-range-ext/test/range.rb +20 -0
- data/modules/mruby/mrbgems/mruby-sprintf/mrbgem.rake +4 -0
- data/modules/mruby/mrbgems/mruby-sprintf/src/kernel.c +30 -0
- data/modules/mruby/mrbgems/mruby-sprintf/src/sprintf.c +1102 -0
- data/modules/mruby/mrbgems/mruby-sprintf/test/sprintf.rb +3 -0
- data/modules/mruby/mrbgems/mruby-string-ext/mrbgem.rake +4 -0
- data/modules/mruby/mrbgems/mruby-string-ext/mrblib/string.rb +52 -0
- data/modules/mruby/mrbgems/mruby-string-ext/src/string.c +175 -0
- data/modules/mruby/mrbgems/mruby-string-ext/test/string.rb +112 -0
- data/modules/mruby/mrbgems/mruby-struct/mrbgem.rake +4 -0
- data/modules/mruby/mrbgems/mruby-struct/mrblib/struct.rb +50 -0
- data/modules/mruby/mrbgems/mruby-struct/src/struct.c +818 -0
- data/modules/mruby/mrbgems/mruby-struct/test/struct.rb +77 -0
- data/modules/mruby/mrbgems/mruby-symbol-ext/mrbgem.rake +4 -0
- data/modules/mruby/mrbgems/mruby-symbol-ext/mrblib/symbol.rb +9 -0
- data/modules/mruby/mrbgems/mruby-symbol-ext/src/symbol.c +55 -0
- data/modules/mruby/mrbgems/mruby-symbol-ext/test/symbol.rb +12 -0
- data/modules/mruby/mrbgems/mruby-time/mrbgem.rake +4 -0
- data/modules/mruby/mrbgems/mruby-time/src/time.c +749 -0
- data/modules/mruby/mrbgems/mruby-time/test/time.rb +201 -0
- data/modules/mruby/mrbgems/mruby-toplevel-ext/mrbgem.rake +4 -0
- data/modules/mruby/mrbgems/mruby-toplevel-ext/mrblib/toplevel.rb +11 -0
- data/modules/mruby/mrbgems/mruby-toplevel-ext/test/toplevel.rb +24 -0
- data/modules/mruby/mrblib/array.rb +111 -0
- data/modules/mruby/mrblib/class.rb +26 -0
- data/modules/mruby/mrblib/compar.rb +104 -0
- data/modules/mruby/mrblib/enum.rb +398 -0
- data/modules/mruby/mrblib/error.rb +66 -0
- data/modules/mruby/mrblib/hash.rb +193 -0
- data/modules/mruby/mrblib/init_mrblib.c +14 -0
- data/modules/mruby/mrblib/kernel.rb +46 -0
- data/modules/mruby/mrblib/mrblib.rake +18 -0
- data/modules/mruby/mrblib/numeric.rb +101 -0
- data/modules/mruby/mrblib/print.rb +18 -0
- data/modules/mruby/mrblib/range.rb +40 -0
- data/modules/mruby/mrblib/string.rb +145 -0
- data/modules/mruby/src/array.c +1150 -0
- data/modules/mruby/src/backtrace.c +73 -0
- data/modules/mruby/src/class.c +1942 -0
- data/modules/mruby/src/codegen.c +2864 -0
- data/modules/mruby/src/compar.c +13 -0
- data/modules/mruby/src/crc.c +38 -0
- data/modules/mruby/src/dump.c +542 -0
- data/modules/mruby/src/enum.c +14 -0
- data/modules/mruby/src/error.c +454 -0
- data/modules/mruby/src/error.h +18 -0
- data/modules/mruby/src/etc.c +204 -0
- data/modules/mruby/src/gc.c +1542 -0
- data/modules/mruby/src/hash.c +1261 -0
- data/modules/mruby/src/init.c +62 -0
- data/modules/mruby/src/kernel.c +1105 -0
- data/modules/mruby/src/keywords +50 -0
- data/modules/mruby/src/lex.def +212 -0
- data/modules/mruby/src/load.c +629 -0
- data/modules/mruby/src/mruby_core.rake +28 -0
- data/modules/mruby/src/node.h +117 -0
- data/modules/mruby/src/numeric.c +1418 -0
- data/modules/mruby/src/object.c +593 -0
- data/modules/mruby/src/opcode.h +160 -0
- data/modules/mruby/src/parse.y +6050 -0
- data/modules/mruby/src/pool.c +190 -0
- data/modules/mruby/src/print.c +71 -0
- data/modules/mruby/src/proc.c +209 -0
- data/modules/mruby/src/range.c +442 -0
- data/modules/mruby/src/re.h +13 -0
- data/modules/mruby/src/state.c +200 -0
- data/modules/mruby/src/string.c +2580 -0
- data/modules/mruby/src/symbol.c +456 -0
- data/modules/mruby/src/value_array.h +27 -0
- data/modules/mruby/src/variable.c +1147 -0
- data/modules/mruby/src/vm.c +2129 -0
- data/modules/mruby/tasks/libmruby.rake +18 -0
- data/modules/mruby/tasks/mrbgem_spec.rake +297 -0
- data/modules/mruby/tasks/mrbgems.rake +85 -0
- data/modules/mruby/tasks/mrbgems_test.rake +88 -0
- data/modules/mruby/tasks/mruby_build.rake +211 -0
- data/modules/mruby/tasks/mruby_build_commands.rake +287 -0
- data/modules/mruby/tasks/mruby_build_gem.rake +67 -0
- data/modules/mruby/tasks/ruby_ext.rake +70 -0
- data/modules/mruby/tasks/toolchains/androideabi.rake +126 -0
- data/modules/mruby/tasks/toolchains/clang.rake +8 -0
- data/modules/mruby/tasks/toolchains/gcc.rake +21 -0
- data/modules/mruby/tasks/toolchains/vs2010.rake +3 -0
- data/modules/mruby/tasks/toolchains/vs2012.rake +44 -0
- data/modules/mruby/test/README.md +7 -0
- data/modules/mruby/test/assert.rb +238 -0
- data/modules/mruby/test/driver.c +118 -0
- data/modules/mruby/test/init_mrbtest.c +24 -0
- data/modules/mruby/test/mrbtest.rake +47 -0
- data/modules/mruby/test/report.rb +4 -0
- data/modules/mruby/test/t/argumenterror.rb +21 -0
- data/modules/mruby/test/t/array.rb +309 -0
- data/modules/mruby/test/t/basicobject.rb +11 -0
- data/modules/mruby/test/t/bs_block.rb +489 -0
- data/modules/mruby/test/t/bs_literal.rb +38 -0
- data/modules/mruby/test/t/class.rb +219 -0
- data/modules/mruby/test/t/comparable.rb +72 -0
- data/modules/mruby/test/t/enumerable.rb +108 -0
- data/modules/mruby/test/t/exception.rb +337 -0
- data/modules/mruby/test/t/false.rb +33 -0
- data/modules/mruby/test/t/float.rb +145 -0
- data/modules/mruby/test/t/gc.rb +45 -0
- data/modules/mruby/test/t/hash.rb +310 -0
- data/modules/mruby/test/t/indexerror.rb +10 -0
- data/modules/mruby/test/t/integer.rb +222 -0
- data/modules/mruby/test/t/kernel.rb +425 -0
- data/modules/mruby/test/t/literals.rb +287 -0
- data/modules/mruby/test/t/localjumperror.rb +13 -0
- data/modules/mruby/test/t/methods.rb +109 -0
- data/modules/mruby/test/t/module.rb +344 -0
- data/modules/mruby/test/t/nameerror.rb +32 -0
- data/modules/mruby/test/t/nil.rb +29 -0
- data/modules/mruby/test/t/nomethoderror.rb +13 -0
- data/modules/mruby/test/t/numeric.rb +29 -0
- data/modules/mruby/test/t/object.rb +11 -0
- data/modules/mruby/test/t/proc.rb +56 -0
- data/modules/mruby/test/t/range.rb +82 -0
- data/modules/mruby/test/t/rangeerror.rb +10 -0
- data/modules/mruby/test/t/regexperror.rb +4 -0
- data/modules/mruby/test/t/runtimeerror.rb +6 -0
- data/modules/mruby/test/t/standarderror.rb +10 -0
- data/modules/mruby/test/t/string.rb +483 -0
- data/modules/mruby/test/t/symbol.rb +27 -0
- data/modules/mruby/test/t/syntax.rb +67 -0
- data/modules/mruby/test/t/true.rb +33 -0
- data/modules/mruby/test/t/typeerror.rb +11 -0
- data/modules/mruby/tools/mrbc/mrbc.c +318 -0
- data/modules/mruby/tools/mrbc/mrbc.rake +14 -0
- data/modules/mruby/travis_config.rb +6 -0
- data/modules/mrubymix/LICENSE +21 -0
- data/modules/mrubymix/README.md +6 -0
- data/modules/mrubymix/bin/mrubymix +29 -0
- data/modules/mrubymix/lib/mrubymix.rb +93 -0
- data/modules/mrubymix/mrubymix.gemspec +13 -0
- data/scripts/gen_gems_config.rb +185 -0
- data/scripts/gen_post.rb +104 -0
- data/templates/minimal/Rakefile +36 -0
- data/templates/minimal/app/app.rb +3 -0
- metadata +1408 -0
@@ -0,0 +1,2293 @@
|
|
1
|
+
// -*- C++ -*-
|
2
|
+
//===----------------------------------------------------------------------===//
|
3
|
+
//
|
4
|
+
// The LLVM Compiler Infrastructure
|
5
|
+
//
|
6
|
+
// This file is dual licensed under the MIT and the University of Illinois Open
|
7
|
+
// Source Licenses. See LICENSE.TXT for details.
|
8
|
+
//
|
9
|
+
//===----------------------------------------------------------------------===//
|
10
|
+
|
11
|
+
#ifndef _LIBCPP___TREE
|
12
|
+
#define _LIBCPP___TREE
|
13
|
+
|
14
|
+
#include <__config>
|
15
|
+
#include <iterator>
|
16
|
+
#include <memory>
|
17
|
+
#include <stdexcept>
|
18
|
+
#include <algorithm>
|
19
|
+
|
20
|
+
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
21
|
+
#pragma GCC system_header
|
22
|
+
#endif
|
23
|
+
|
24
|
+
_LIBCPP_BEGIN_NAMESPACE_STD
|
25
|
+
|
26
|
+
template <class _Tp, class _Compare, class _Allocator> class __tree;
|
27
|
+
template <class _Tp, class _NodePtr, class _DiffType>
|
28
|
+
class _LIBCPP_TYPE_VIS __tree_iterator;
|
29
|
+
template <class _Tp, class _ConstNodePtr, class _DiffType>
|
30
|
+
class _LIBCPP_TYPE_VIS __tree_const_iterator;
|
31
|
+
template <class _Key, class _Tp, class _Compare, class _Allocator>
|
32
|
+
class _LIBCPP_TYPE_VIS map;
|
33
|
+
template <class _Key, class _Tp, class _Compare, class _Allocator>
|
34
|
+
class _LIBCPP_TYPE_VIS multimap;
|
35
|
+
template <class _Key, class _Compare, class _Allocator>
|
36
|
+
class _LIBCPP_TYPE_VIS set;
|
37
|
+
template <class _Key, class _Compare, class _Allocator>
|
38
|
+
class _LIBCPP_TYPE_VIS multiset;
|
39
|
+
|
40
|
+
/*
|
41
|
+
|
42
|
+
_NodePtr algorithms
|
43
|
+
|
44
|
+
The algorithms taking _NodePtr are red black tree algorithms. Those
|
45
|
+
algorithms taking a parameter named __root should assume that __root
|
46
|
+
points to a proper red black tree (unless otherwise specified).
|
47
|
+
|
48
|
+
Each algorithm herein assumes that __root->__parent_ points to a non-null
|
49
|
+
structure which has a member __left_ which points back to __root. No other
|
50
|
+
member is read or written to at __root->__parent_.
|
51
|
+
|
52
|
+
__root->__parent_ will be referred to below (in comments only) as end_node.
|
53
|
+
end_node->__left_ is an externably accessible lvalue for __root, and can be
|
54
|
+
changed by node insertion and removal (without explicit reference to end_node).
|
55
|
+
|
56
|
+
All nodes (with the exception of end_node), even the node referred to as
|
57
|
+
__root, have a non-null __parent_ field.
|
58
|
+
|
59
|
+
*/
|
60
|
+
|
61
|
+
// Returns: true if __x is a left child of its parent, else false
|
62
|
+
// Precondition: __x != nullptr.
|
63
|
+
template <class _NodePtr>
|
64
|
+
inline _LIBCPP_INLINE_VISIBILITY
|
65
|
+
bool
|
66
|
+
__tree_is_left_child(_NodePtr __x) _NOEXCEPT
|
67
|
+
{
|
68
|
+
return __x == __x->__parent_->__left_;
|
69
|
+
}
|
70
|
+
|
71
|
+
// Determintes if the subtree rooted at __x is a proper red black subtree. If
|
72
|
+
// __x is a proper subtree, returns the black height (null counts as 1). If
|
73
|
+
// __x is an improper subtree, returns 0.
|
74
|
+
template <class _NodePtr>
|
75
|
+
unsigned
|
76
|
+
__tree_sub_invariant(_NodePtr __x)
|
77
|
+
{
|
78
|
+
if (__x == nullptr)
|
79
|
+
return 1;
|
80
|
+
// parent consistency checked by caller
|
81
|
+
// check __x->__left_ consistency
|
82
|
+
if (__x->__left_ != nullptr && __x->__left_->__parent_ != __x)
|
83
|
+
return 0;
|
84
|
+
// check __x->__right_ consistency
|
85
|
+
if (__x->__right_ != nullptr && __x->__right_->__parent_ != __x)
|
86
|
+
return 0;
|
87
|
+
// check __x->__left_ != __x->__right_ unless both are nullptr
|
88
|
+
if (__x->__left_ == __x->__right_ && __x->__left_ != nullptr)
|
89
|
+
return 0;
|
90
|
+
// If this is red, neither child can be red
|
91
|
+
if (!__x->__is_black_)
|
92
|
+
{
|
93
|
+
if (__x->__left_ && !__x->__left_->__is_black_)
|
94
|
+
return 0;
|
95
|
+
if (__x->__right_ && !__x->__right_->__is_black_)
|
96
|
+
return 0;
|
97
|
+
}
|
98
|
+
unsigned __h = __tree_sub_invariant(__x->__left_);
|
99
|
+
if (__h == 0)
|
100
|
+
return 0; // invalid left subtree
|
101
|
+
if (__h != __tree_sub_invariant(__x->__right_))
|
102
|
+
return 0; // invalid or different height right subtree
|
103
|
+
return __h + __x->__is_black_; // return black height of this node
|
104
|
+
}
|
105
|
+
|
106
|
+
// Determintes if the red black tree rooted at __root is a proper red black tree.
|
107
|
+
// __root == nullptr is a proper tree. Returns true is __root is a proper
|
108
|
+
// red black tree, else returns false.
|
109
|
+
template <class _NodePtr>
|
110
|
+
bool
|
111
|
+
__tree_invariant(_NodePtr __root)
|
112
|
+
{
|
113
|
+
if (__root == nullptr)
|
114
|
+
return true;
|
115
|
+
// check __x->__parent_ consistency
|
116
|
+
if (__root->__parent_ == nullptr)
|
117
|
+
return false;
|
118
|
+
if (!__tree_is_left_child(__root))
|
119
|
+
return false;
|
120
|
+
// root must be black
|
121
|
+
if (!__root->__is_black_)
|
122
|
+
return false;
|
123
|
+
// do normal node checks
|
124
|
+
return __tree_sub_invariant(__root) != 0;
|
125
|
+
}
|
126
|
+
|
127
|
+
// Returns: pointer to the left-most node under __x.
|
128
|
+
// Precondition: __x != nullptr.
|
129
|
+
template <class _NodePtr>
|
130
|
+
inline _LIBCPP_INLINE_VISIBILITY
|
131
|
+
_NodePtr
|
132
|
+
__tree_min(_NodePtr __x) _NOEXCEPT
|
133
|
+
{
|
134
|
+
while (__x->__left_ != nullptr)
|
135
|
+
__x = __x->__left_;
|
136
|
+
return __x;
|
137
|
+
}
|
138
|
+
|
139
|
+
// Returns: pointer to the right-most node under __x.
|
140
|
+
// Precondition: __x != nullptr.
|
141
|
+
template <class _NodePtr>
|
142
|
+
inline _LIBCPP_INLINE_VISIBILITY
|
143
|
+
_NodePtr
|
144
|
+
__tree_max(_NodePtr __x) _NOEXCEPT
|
145
|
+
{
|
146
|
+
while (__x->__right_ != nullptr)
|
147
|
+
__x = __x->__right_;
|
148
|
+
return __x;
|
149
|
+
}
|
150
|
+
|
151
|
+
// Returns: pointer to the next in-order node after __x.
|
152
|
+
// Precondition: __x != nullptr.
|
153
|
+
template <class _NodePtr>
|
154
|
+
_NodePtr
|
155
|
+
__tree_next(_NodePtr __x) _NOEXCEPT
|
156
|
+
{
|
157
|
+
if (__x->__right_ != nullptr)
|
158
|
+
return __tree_min(__x->__right_);
|
159
|
+
while (!__tree_is_left_child(__x))
|
160
|
+
__x = __x->__parent_;
|
161
|
+
return __x->__parent_;
|
162
|
+
}
|
163
|
+
|
164
|
+
// Returns: pointer to the previous in-order node before __x.
|
165
|
+
// Precondition: __x != nullptr.
|
166
|
+
template <class _NodePtr>
|
167
|
+
_NodePtr
|
168
|
+
__tree_prev(_NodePtr __x) _NOEXCEPT
|
169
|
+
{
|
170
|
+
if (__x->__left_ != nullptr)
|
171
|
+
return __tree_max(__x->__left_);
|
172
|
+
while (__tree_is_left_child(__x))
|
173
|
+
__x = __x->__parent_;
|
174
|
+
return __x->__parent_;
|
175
|
+
}
|
176
|
+
|
177
|
+
// Returns: pointer to a node which has no children
|
178
|
+
// Precondition: __x != nullptr.
|
179
|
+
template <class _NodePtr>
|
180
|
+
_NodePtr
|
181
|
+
__tree_leaf(_NodePtr __x) _NOEXCEPT
|
182
|
+
{
|
183
|
+
while (true)
|
184
|
+
{
|
185
|
+
if (__x->__left_ != nullptr)
|
186
|
+
{
|
187
|
+
__x = __x->__left_;
|
188
|
+
continue;
|
189
|
+
}
|
190
|
+
if (__x->__right_ != nullptr)
|
191
|
+
{
|
192
|
+
__x = __x->__right_;
|
193
|
+
continue;
|
194
|
+
}
|
195
|
+
break;
|
196
|
+
}
|
197
|
+
return __x;
|
198
|
+
}
|
199
|
+
|
200
|
+
// Effects: Makes __x->__right_ the subtree root with __x as its left child
|
201
|
+
// while preserving in-order order.
|
202
|
+
// Precondition: __x->__right_ != nullptr
|
203
|
+
template <class _NodePtr>
|
204
|
+
void
|
205
|
+
__tree_left_rotate(_NodePtr __x) _NOEXCEPT
|
206
|
+
{
|
207
|
+
_NodePtr __y = __x->__right_;
|
208
|
+
__x->__right_ = __y->__left_;
|
209
|
+
if (__x->__right_ != nullptr)
|
210
|
+
__x->__right_->__parent_ = __x;
|
211
|
+
__y->__parent_ = __x->__parent_;
|
212
|
+
if (__tree_is_left_child(__x))
|
213
|
+
__x->__parent_->__left_ = __y;
|
214
|
+
else
|
215
|
+
__x->__parent_->__right_ = __y;
|
216
|
+
__y->__left_ = __x;
|
217
|
+
__x->__parent_ = __y;
|
218
|
+
}
|
219
|
+
|
220
|
+
// Effects: Makes __x->__left_ the subtree root with __x as its right child
|
221
|
+
// while preserving in-order order.
|
222
|
+
// Precondition: __x->__left_ != nullptr
|
223
|
+
template <class _NodePtr>
|
224
|
+
void
|
225
|
+
__tree_right_rotate(_NodePtr __x) _NOEXCEPT
|
226
|
+
{
|
227
|
+
_NodePtr __y = __x->__left_;
|
228
|
+
__x->__left_ = __y->__right_;
|
229
|
+
if (__x->__left_ != nullptr)
|
230
|
+
__x->__left_->__parent_ = __x;
|
231
|
+
__y->__parent_ = __x->__parent_;
|
232
|
+
if (__tree_is_left_child(__x))
|
233
|
+
__x->__parent_->__left_ = __y;
|
234
|
+
else
|
235
|
+
__x->__parent_->__right_ = __y;
|
236
|
+
__y->__right_ = __x;
|
237
|
+
__x->__parent_ = __y;
|
238
|
+
}
|
239
|
+
|
240
|
+
// Effects: Rebalances __root after attaching __x to a leaf.
|
241
|
+
// Precondition: __root != nulptr && __x != nullptr.
|
242
|
+
// __x has no children.
|
243
|
+
// __x == __root or == a direct or indirect child of __root.
|
244
|
+
// If __x were to be unlinked from __root (setting __root to
|
245
|
+
// nullptr if __root == __x), __tree_invariant(__root) == true.
|
246
|
+
// Postcondition: __tree_invariant(end_node->__left_) == true. end_node->__left_
|
247
|
+
// may be different than the value passed in as __root.
|
248
|
+
template <class _NodePtr>
|
249
|
+
void
|
250
|
+
__tree_balance_after_insert(_NodePtr __root, _NodePtr __x) _NOEXCEPT
|
251
|
+
{
|
252
|
+
__x->__is_black_ = __x == __root;
|
253
|
+
while (__x != __root && !__x->__parent_->__is_black_)
|
254
|
+
{
|
255
|
+
// __x->__parent_ != __root because __x->__parent_->__is_black == false
|
256
|
+
if (__tree_is_left_child(__x->__parent_))
|
257
|
+
{
|
258
|
+
_NodePtr __y = __x->__parent_->__parent_->__right_;
|
259
|
+
if (__y != nullptr && !__y->__is_black_)
|
260
|
+
{
|
261
|
+
__x = __x->__parent_;
|
262
|
+
__x->__is_black_ = true;
|
263
|
+
__x = __x->__parent_;
|
264
|
+
__x->__is_black_ = __x == __root;
|
265
|
+
__y->__is_black_ = true;
|
266
|
+
}
|
267
|
+
else
|
268
|
+
{
|
269
|
+
if (!__tree_is_left_child(__x))
|
270
|
+
{
|
271
|
+
__x = __x->__parent_;
|
272
|
+
__tree_left_rotate(__x);
|
273
|
+
}
|
274
|
+
__x = __x->__parent_;
|
275
|
+
__x->__is_black_ = true;
|
276
|
+
__x = __x->__parent_;
|
277
|
+
__x->__is_black_ = false;
|
278
|
+
__tree_right_rotate(__x);
|
279
|
+
break;
|
280
|
+
}
|
281
|
+
}
|
282
|
+
else
|
283
|
+
{
|
284
|
+
_NodePtr __y = __x->__parent_->__parent_->__left_;
|
285
|
+
if (__y != nullptr && !__y->__is_black_)
|
286
|
+
{
|
287
|
+
__x = __x->__parent_;
|
288
|
+
__x->__is_black_ = true;
|
289
|
+
__x = __x->__parent_;
|
290
|
+
__x->__is_black_ = __x == __root;
|
291
|
+
__y->__is_black_ = true;
|
292
|
+
}
|
293
|
+
else
|
294
|
+
{
|
295
|
+
if (__tree_is_left_child(__x))
|
296
|
+
{
|
297
|
+
__x = __x->__parent_;
|
298
|
+
__tree_right_rotate(__x);
|
299
|
+
}
|
300
|
+
__x = __x->__parent_;
|
301
|
+
__x->__is_black_ = true;
|
302
|
+
__x = __x->__parent_;
|
303
|
+
__x->__is_black_ = false;
|
304
|
+
__tree_left_rotate(__x);
|
305
|
+
break;
|
306
|
+
}
|
307
|
+
}
|
308
|
+
}
|
309
|
+
}
|
310
|
+
|
311
|
+
// Precondition: __root != nullptr && __z != nullptr.
|
312
|
+
// __tree_invariant(__root) == true.
|
313
|
+
// __z == __root or == a direct or indirect child of __root.
|
314
|
+
// Effects: unlinks __z from the tree rooted at __root, rebalancing as needed.
|
315
|
+
// Postcondition: __tree_invariant(end_node->__left_) == true && end_node->__left_
|
316
|
+
// nor any of its children refer to __z. end_node->__left_
|
317
|
+
// may be different than the value passed in as __root.
|
318
|
+
template <class _NodePtr>
|
319
|
+
void
|
320
|
+
__tree_remove(_NodePtr __root, _NodePtr __z) _NOEXCEPT
|
321
|
+
{
|
322
|
+
// __z will be removed from the tree. Client still needs to destruct/deallocate it
|
323
|
+
// __y is either __z, or if __z has two children, __tree_next(__z).
|
324
|
+
// __y will have at most one child.
|
325
|
+
// __y will be the initial hole in the tree (make the hole at a leaf)
|
326
|
+
_NodePtr __y = (__z->__left_ == nullptr || __z->__right_ == nullptr) ?
|
327
|
+
__z : __tree_next(__z);
|
328
|
+
// __x is __y's possibly null single child
|
329
|
+
_NodePtr __x = __y->__left_ != nullptr ? __y->__left_ : __y->__right_;
|
330
|
+
// __w is __x's possibly null uncle (will become __x's sibling)
|
331
|
+
_NodePtr __w = nullptr;
|
332
|
+
// link __x to __y's parent, and find __w
|
333
|
+
if (__x != nullptr)
|
334
|
+
__x->__parent_ = __y->__parent_;
|
335
|
+
if (__tree_is_left_child(__y))
|
336
|
+
{
|
337
|
+
__y->__parent_->__left_ = __x;
|
338
|
+
if (__y != __root)
|
339
|
+
__w = __y->__parent_->__right_;
|
340
|
+
else
|
341
|
+
__root = __x; // __w == nullptr
|
342
|
+
}
|
343
|
+
else
|
344
|
+
{
|
345
|
+
__y->__parent_->__right_ = __x;
|
346
|
+
// __y can't be root if it is a right child
|
347
|
+
__w = __y->__parent_->__left_;
|
348
|
+
}
|
349
|
+
bool __removed_black = __y->__is_black_;
|
350
|
+
// If we didn't remove __z, do so now by splicing in __y for __z,
|
351
|
+
// but copy __z's color. This does not impact __x or __w.
|
352
|
+
if (__y != __z)
|
353
|
+
{
|
354
|
+
// __z->__left_ != nulptr but __z->__right_ might == __x == nullptr
|
355
|
+
__y->__parent_ = __z->__parent_;
|
356
|
+
if (__tree_is_left_child(__z))
|
357
|
+
__y->__parent_->__left_ = __y;
|
358
|
+
else
|
359
|
+
__y->__parent_->__right_ = __y;
|
360
|
+
__y->__left_ = __z->__left_;
|
361
|
+
__y->__left_->__parent_ = __y;
|
362
|
+
__y->__right_ = __z->__right_;
|
363
|
+
if (__y->__right_ != nullptr)
|
364
|
+
__y->__right_->__parent_ = __y;
|
365
|
+
__y->__is_black_ = __z->__is_black_;
|
366
|
+
if (__root == __z)
|
367
|
+
__root = __y;
|
368
|
+
}
|
369
|
+
// There is no need to rebalance if we removed a red, or if we removed
|
370
|
+
// the last node.
|
371
|
+
if (__removed_black && __root != nullptr)
|
372
|
+
{
|
373
|
+
// Rebalance:
|
374
|
+
// __x has an implicit black color (transferred from the removed __y)
|
375
|
+
// associated with it, no matter what its color is.
|
376
|
+
// If __x is __root (in which case it can't be null), it is supposed
|
377
|
+
// to be black anyway, and if it is doubly black, then the double
|
378
|
+
// can just be ignored.
|
379
|
+
// If __x is red (in which case it can't be null), then it can absorb
|
380
|
+
// the implicit black just by setting its color to black.
|
381
|
+
// Since __y was black and only had one child (which __x points to), __x
|
382
|
+
// is either red with no children, else null, otherwise __y would have
|
383
|
+
// different black heights under left and right pointers.
|
384
|
+
// if (__x == __root || __x != nullptr && !__x->__is_black_)
|
385
|
+
if (__x != nullptr)
|
386
|
+
__x->__is_black_ = true;
|
387
|
+
else
|
388
|
+
{
|
389
|
+
// Else __x isn't root, and is "doubly black", even though it may
|
390
|
+
// be null. __w can not be null here, else the parent would
|
391
|
+
// see a black height >= 2 on the __x side and a black height
|
392
|
+
// of 1 on the __w side (__w must be a non-null black or a red
|
393
|
+
// with a non-null black child).
|
394
|
+
while (true)
|
395
|
+
{
|
396
|
+
if (!__tree_is_left_child(__w)) // if x is left child
|
397
|
+
{
|
398
|
+
if (!__w->__is_black_)
|
399
|
+
{
|
400
|
+
__w->__is_black_ = true;
|
401
|
+
__w->__parent_->__is_black_ = false;
|
402
|
+
__tree_left_rotate(__w->__parent_);
|
403
|
+
// __x is still valid
|
404
|
+
// reset __root only if necessary
|
405
|
+
if (__root == __w->__left_)
|
406
|
+
__root = __w;
|
407
|
+
// reset sibling, and it still can't be null
|
408
|
+
__w = __w->__left_->__right_;
|
409
|
+
}
|
410
|
+
// __w->__is_black_ is now true, __w may have null children
|
411
|
+
if ((__w->__left_ == nullptr || __w->__left_->__is_black_) &&
|
412
|
+
(__w->__right_ == nullptr || __w->__right_->__is_black_))
|
413
|
+
{
|
414
|
+
__w->__is_black_ = false;
|
415
|
+
__x = __w->__parent_;
|
416
|
+
// __x can no longer be null
|
417
|
+
if (__x == __root || !__x->__is_black_)
|
418
|
+
{
|
419
|
+
__x->__is_black_ = true;
|
420
|
+
break;
|
421
|
+
}
|
422
|
+
// reset sibling, and it still can't be null
|
423
|
+
__w = __tree_is_left_child(__x) ?
|
424
|
+
__x->__parent_->__right_ :
|
425
|
+
__x->__parent_->__left_;
|
426
|
+
// continue;
|
427
|
+
}
|
428
|
+
else // __w has a red child
|
429
|
+
{
|
430
|
+
if (__w->__right_ == nullptr || __w->__right_->__is_black_)
|
431
|
+
{
|
432
|
+
// __w left child is non-null and red
|
433
|
+
__w->__left_->__is_black_ = true;
|
434
|
+
__w->__is_black_ = false;
|
435
|
+
__tree_right_rotate(__w);
|
436
|
+
// __w is known not to be root, so root hasn't changed
|
437
|
+
// reset sibling, and it still can't be null
|
438
|
+
__w = __w->__parent_;
|
439
|
+
}
|
440
|
+
// __w has a right red child, left child may be null
|
441
|
+
__w->__is_black_ = __w->__parent_->__is_black_;
|
442
|
+
__w->__parent_->__is_black_ = true;
|
443
|
+
__w->__right_->__is_black_ = true;
|
444
|
+
__tree_left_rotate(__w->__parent_);
|
445
|
+
break;
|
446
|
+
}
|
447
|
+
}
|
448
|
+
else
|
449
|
+
{
|
450
|
+
if (!__w->__is_black_)
|
451
|
+
{
|
452
|
+
__w->__is_black_ = true;
|
453
|
+
__w->__parent_->__is_black_ = false;
|
454
|
+
__tree_right_rotate(__w->__parent_);
|
455
|
+
// __x is still valid
|
456
|
+
// reset __root only if necessary
|
457
|
+
if (__root == __w->__right_)
|
458
|
+
__root = __w;
|
459
|
+
// reset sibling, and it still can't be null
|
460
|
+
__w = __w->__right_->__left_;
|
461
|
+
}
|
462
|
+
// __w->__is_black_ is now true, __w may have null children
|
463
|
+
if ((__w->__left_ == nullptr || __w->__left_->__is_black_) &&
|
464
|
+
(__w->__right_ == nullptr || __w->__right_->__is_black_))
|
465
|
+
{
|
466
|
+
__w->__is_black_ = false;
|
467
|
+
__x = __w->__parent_;
|
468
|
+
// __x can no longer be null
|
469
|
+
if (!__x->__is_black_ || __x == __root)
|
470
|
+
{
|
471
|
+
__x->__is_black_ = true;
|
472
|
+
break;
|
473
|
+
}
|
474
|
+
// reset sibling, and it still can't be null
|
475
|
+
__w = __tree_is_left_child(__x) ?
|
476
|
+
__x->__parent_->__right_ :
|
477
|
+
__x->__parent_->__left_;
|
478
|
+
// continue;
|
479
|
+
}
|
480
|
+
else // __w has a red child
|
481
|
+
{
|
482
|
+
if (__w->__left_ == nullptr || __w->__left_->__is_black_)
|
483
|
+
{
|
484
|
+
// __w right child is non-null and red
|
485
|
+
__w->__right_->__is_black_ = true;
|
486
|
+
__w->__is_black_ = false;
|
487
|
+
__tree_left_rotate(__w);
|
488
|
+
// __w is known not to be root, so root hasn't changed
|
489
|
+
// reset sibling, and it still can't be null
|
490
|
+
__w = __w->__parent_;
|
491
|
+
}
|
492
|
+
// __w has a left red child, right child may be null
|
493
|
+
__w->__is_black_ = __w->__parent_->__is_black_;
|
494
|
+
__w->__parent_->__is_black_ = true;
|
495
|
+
__w->__left_->__is_black_ = true;
|
496
|
+
__tree_right_rotate(__w->__parent_);
|
497
|
+
break;
|
498
|
+
}
|
499
|
+
}
|
500
|
+
}
|
501
|
+
}
|
502
|
+
}
|
503
|
+
}
|
504
|
+
|
505
|
+
template <class _Allocator> class __map_node_destructor;
|
506
|
+
|
507
|
+
template <class _Allocator>
|
508
|
+
class __tree_node_destructor
|
509
|
+
{
|
510
|
+
typedef _Allocator allocator_type;
|
511
|
+
typedef allocator_traits<allocator_type> __alloc_traits;
|
512
|
+
typedef typename __alloc_traits::value_type::value_type value_type;
|
513
|
+
public:
|
514
|
+
typedef typename __alloc_traits::pointer pointer;
|
515
|
+
private:
|
516
|
+
|
517
|
+
allocator_type& __na_;
|
518
|
+
|
519
|
+
__tree_node_destructor& operator=(const __tree_node_destructor&);
|
520
|
+
|
521
|
+
public:
|
522
|
+
bool __value_constructed;
|
523
|
+
|
524
|
+
_LIBCPP_INLINE_VISIBILITY
|
525
|
+
explicit __tree_node_destructor(allocator_type& __na) _NOEXCEPT
|
526
|
+
: __na_(__na),
|
527
|
+
__value_constructed(false)
|
528
|
+
{}
|
529
|
+
|
530
|
+
_LIBCPP_INLINE_VISIBILITY
|
531
|
+
void operator()(pointer __p) _NOEXCEPT
|
532
|
+
{
|
533
|
+
if (__value_constructed)
|
534
|
+
__alloc_traits::destroy(__na_, _VSTD::addressof(__p->__value_));
|
535
|
+
if (__p)
|
536
|
+
__alloc_traits::deallocate(__na_, __p, 1);
|
537
|
+
}
|
538
|
+
|
539
|
+
template <class> friend class __map_node_destructor;
|
540
|
+
};
|
541
|
+
|
542
|
+
// node
|
543
|
+
|
544
|
+
template <class _Pointer>
|
545
|
+
class __tree_end_node
|
546
|
+
{
|
547
|
+
public:
|
548
|
+
typedef _Pointer pointer;
|
549
|
+
pointer __left_;
|
550
|
+
|
551
|
+
_LIBCPP_INLINE_VISIBILITY
|
552
|
+
__tree_end_node() _NOEXCEPT : __left_() {}
|
553
|
+
};
|
554
|
+
|
555
|
+
template <class _VoidPtr>
|
556
|
+
class __tree_node_base
|
557
|
+
: public __tree_end_node
|
558
|
+
<
|
559
|
+
typename pointer_traits<_VoidPtr>::template
|
560
|
+
#ifndef _LIBCPP_HAS_NO_TEMPLATE_ALIASES
|
561
|
+
rebind<__tree_node_base<_VoidPtr> >
|
562
|
+
#else
|
563
|
+
rebind<__tree_node_base<_VoidPtr> >::other
|
564
|
+
#endif
|
565
|
+
>
|
566
|
+
{
|
567
|
+
__tree_node_base(const __tree_node_base&);
|
568
|
+
__tree_node_base& operator=(const __tree_node_base&);
|
569
|
+
public:
|
570
|
+
typedef typename pointer_traits<_VoidPtr>::template
|
571
|
+
#ifndef _LIBCPP_HAS_NO_TEMPLATE_ALIASES
|
572
|
+
rebind<__tree_node_base>
|
573
|
+
#else
|
574
|
+
rebind<__tree_node_base>::other
|
575
|
+
#endif
|
576
|
+
pointer;
|
577
|
+
typedef typename pointer_traits<_VoidPtr>::template
|
578
|
+
#ifndef _LIBCPP_HAS_NO_TEMPLATE_ALIASES
|
579
|
+
rebind<const __tree_node_base>
|
580
|
+
#else
|
581
|
+
rebind<const __tree_node_base>::other
|
582
|
+
#endif
|
583
|
+
const_pointer;
|
584
|
+
typedef __tree_end_node<pointer> base;
|
585
|
+
|
586
|
+
pointer __right_;
|
587
|
+
pointer __parent_;
|
588
|
+
bool __is_black_;
|
589
|
+
|
590
|
+
_LIBCPP_INLINE_VISIBILITY
|
591
|
+
__tree_node_base() _NOEXCEPT
|
592
|
+
: __right_(), __parent_(), __is_black_(false) {}
|
593
|
+
};
|
594
|
+
|
595
|
+
template <class _Tp, class _VoidPtr>
|
596
|
+
class __tree_node
|
597
|
+
: public __tree_node_base<_VoidPtr>
|
598
|
+
{
|
599
|
+
public:
|
600
|
+
typedef __tree_node_base<_VoidPtr> base;
|
601
|
+
typedef _Tp value_type;
|
602
|
+
|
603
|
+
value_type __value_;
|
604
|
+
|
605
|
+
#if !defined(_LIBCPP_HAS_NO_RVALUE_REFERENCES) && !defined(_LIBCPP_HAS_NO_VARIADICS)
|
606
|
+
template <class ..._Args>
|
607
|
+
_LIBCPP_INLINE_VISIBILITY
|
608
|
+
explicit __tree_node(_Args&& ...__args)
|
609
|
+
: __value_(_VSTD::forward<_Args>(__args)...) {}
|
610
|
+
#else // !defined(_LIBCPP_HAS_NO_RVALUE_REFERENCES) && !defined(_LIBCPP_HAS_NO_VARIADICS)
|
611
|
+
_LIBCPP_INLINE_VISIBILITY
|
612
|
+
explicit __tree_node(const value_type& __v)
|
613
|
+
: __value_(__v) {}
|
614
|
+
#endif // !defined(_LIBCPP_HAS_NO_RVALUE_REFERENCES) && !defined(_LIBCPP_HAS_NO_VARIADICS)
|
615
|
+
};
|
616
|
+
|
617
|
+
template <class _TreeIterator> class _LIBCPP_TYPE_VIS __map_iterator;
|
618
|
+
template <class _TreeIterator> class _LIBCPP_TYPE_VIS __map_const_iterator;
|
619
|
+
|
620
|
+
template <class _Tp, class _NodePtr, class _DiffType>
|
621
|
+
class _LIBCPP_TYPE_VIS __tree_iterator
|
622
|
+
{
|
623
|
+
typedef _NodePtr __node_pointer;
|
624
|
+
typedef typename pointer_traits<__node_pointer>::element_type __node;
|
625
|
+
typedef typename __node::base __node_base;
|
626
|
+
typedef typename __node_base::pointer __node_base_pointer;
|
627
|
+
|
628
|
+
__node_pointer __ptr_;
|
629
|
+
|
630
|
+
typedef pointer_traits<__node_pointer> __pointer_traits;
|
631
|
+
public:
|
632
|
+
typedef bidirectional_iterator_tag iterator_category;
|
633
|
+
typedef _Tp value_type;
|
634
|
+
typedef _DiffType difference_type;
|
635
|
+
typedef value_type& reference;
|
636
|
+
typedef typename pointer_traits<__node_pointer>::template
|
637
|
+
#ifndef _LIBCPP_HAS_NO_TEMPLATE_ALIASES
|
638
|
+
rebind<value_type>
|
639
|
+
#else
|
640
|
+
rebind<value_type>::other
|
641
|
+
#endif
|
642
|
+
pointer;
|
643
|
+
|
644
|
+
_LIBCPP_INLINE_VISIBILITY __tree_iterator() _NOEXCEPT {}
|
645
|
+
|
646
|
+
_LIBCPP_INLINE_VISIBILITY reference operator*() const {return __ptr_->__value_;}
|
647
|
+
_LIBCPP_INLINE_VISIBILITY pointer operator->() const {return &__ptr_->__value_;}
|
648
|
+
|
649
|
+
_LIBCPP_INLINE_VISIBILITY
|
650
|
+
__tree_iterator& operator++()
|
651
|
+
{__ptr_ = static_cast<__node_pointer>(__tree_next(static_cast<__node_base_pointer>(__ptr_)));
|
652
|
+
return *this;}
|
653
|
+
_LIBCPP_INLINE_VISIBILITY
|
654
|
+
__tree_iterator operator++(int)
|
655
|
+
{__tree_iterator __t(*this); ++(*this); return __t;}
|
656
|
+
|
657
|
+
_LIBCPP_INLINE_VISIBILITY
|
658
|
+
__tree_iterator& operator--()
|
659
|
+
{__ptr_ = static_cast<__node_pointer>(__tree_prev(static_cast<__node_base_pointer>(__ptr_)));
|
660
|
+
return *this;}
|
661
|
+
_LIBCPP_INLINE_VISIBILITY
|
662
|
+
__tree_iterator operator--(int)
|
663
|
+
{__tree_iterator __t(*this); --(*this); return __t;}
|
664
|
+
|
665
|
+
friend _LIBCPP_INLINE_VISIBILITY
|
666
|
+
bool operator==(const __tree_iterator& __x, const __tree_iterator& __y)
|
667
|
+
{return __x.__ptr_ == __y.__ptr_;}
|
668
|
+
friend _LIBCPP_INLINE_VISIBILITY
|
669
|
+
bool operator!=(const __tree_iterator& __x, const __tree_iterator& __y)
|
670
|
+
{return !(__x == __y);}
|
671
|
+
|
672
|
+
private:
|
673
|
+
_LIBCPP_INLINE_VISIBILITY
|
674
|
+
explicit __tree_iterator(__node_pointer __p) _NOEXCEPT : __ptr_(__p) {}
|
675
|
+
template <class, class, class> friend class __tree;
|
676
|
+
template <class, class, class> friend class _LIBCPP_TYPE_VIS __tree_const_iterator;
|
677
|
+
template <class> friend class _LIBCPP_TYPE_VIS __map_iterator;
|
678
|
+
template <class, class, class, class> friend class _LIBCPP_TYPE_VIS map;
|
679
|
+
template <class, class, class, class> friend class _LIBCPP_TYPE_VIS multimap;
|
680
|
+
template <class, class, class> friend class _LIBCPP_TYPE_VIS set;
|
681
|
+
template <class, class, class> friend class _LIBCPP_TYPE_VIS multiset;
|
682
|
+
};
|
683
|
+
|
684
|
+
template <class _Tp, class _ConstNodePtr, class _DiffType>
|
685
|
+
class _LIBCPP_TYPE_VIS __tree_const_iterator
|
686
|
+
{
|
687
|
+
typedef _ConstNodePtr __node_pointer;
|
688
|
+
typedef typename pointer_traits<__node_pointer>::element_type __node;
|
689
|
+
typedef const typename __node::base __node_base;
|
690
|
+
typedef typename pointer_traits<__node_pointer>::template
|
691
|
+
#ifndef _LIBCPP_HAS_NO_TEMPLATE_ALIASES
|
692
|
+
rebind<__node_base>
|
693
|
+
#else
|
694
|
+
rebind<__node_base>::other
|
695
|
+
#endif
|
696
|
+
__node_base_pointer;
|
697
|
+
|
698
|
+
__node_pointer __ptr_;
|
699
|
+
|
700
|
+
typedef pointer_traits<__node_pointer> __pointer_traits;
|
701
|
+
public:
|
702
|
+
typedef bidirectional_iterator_tag iterator_category;
|
703
|
+
typedef _Tp value_type;
|
704
|
+
typedef _DiffType difference_type;
|
705
|
+
typedef const value_type& reference;
|
706
|
+
typedef typename pointer_traits<__node_pointer>::template
|
707
|
+
#ifndef _LIBCPP_HAS_NO_TEMPLATE_ALIASES
|
708
|
+
rebind<const value_type>
|
709
|
+
#else
|
710
|
+
rebind<const value_type>::other
|
711
|
+
#endif
|
712
|
+
pointer;
|
713
|
+
|
714
|
+
_LIBCPP_INLINE_VISIBILITY __tree_const_iterator() {}
|
715
|
+
private:
|
716
|
+
typedef typename remove_const<__node>::type __non_const_node;
|
717
|
+
typedef typename pointer_traits<__node_pointer>::template
|
718
|
+
#ifndef _LIBCPP_HAS_NO_TEMPLATE_ALIASES
|
719
|
+
rebind<__non_const_node>
|
720
|
+
#else
|
721
|
+
rebind<__non_const_node>::other
|
722
|
+
#endif
|
723
|
+
__non_const_node_pointer;
|
724
|
+
typedef __tree_iterator<value_type, __non_const_node_pointer, difference_type>
|
725
|
+
__non_const_iterator;
|
726
|
+
public:
|
727
|
+
_LIBCPP_INLINE_VISIBILITY
|
728
|
+
__tree_const_iterator(__non_const_iterator __p) _NOEXCEPT
|
729
|
+
: __ptr_(__p.__ptr_) {}
|
730
|
+
|
731
|
+
_LIBCPP_INLINE_VISIBILITY reference operator*() const {return __ptr_->__value_;}
|
732
|
+
_LIBCPP_INLINE_VISIBILITY pointer operator->() const {return &__ptr_->__value_;}
|
733
|
+
|
734
|
+
_LIBCPP_INLINE_VISIBILITY
|
735
|
+
__tree_const_iterator& operator++()
|
736
|
+
{__ptr_ = static_cast<__node_pointer>(__tree_next(static_cast<__node_base_pointer>(__ptr_)));
|
737
|
+
return *this;}
|
738
|
+
_LIBCPP_INLINE_VISIBILITY
|
739
|
+
__tree_const_iterator operator++(int)
|
740
|
+
{__tree_const_iterator __t(*this); ++(*this); return __t;}
|
741
|
+
|
742
|
+
_LIBCPP_INLINE_VISIBILITY
|
743
|
+
__tree_const_iterator& operator--()
|
744
|
+
{__ptr_ = static_cast<__node_pointer>(__tree_prev(static_cast<__node_base_pointer>(__ptr_)));
|
745
|
+
return *this;}
|
746
|
+
_LIBCPP_INLINE_VISIBILITY
|
747
|
+
__tree_const_iterator operator--(int)
|
748
|
+
{__tree_const_iterator __t(*this); --(*this); return __t;}
|
749
|
+
|
750
|
+
friend _LIBCPP_INLINE_VISIBILITY
|
751
|
+
bool operator==(const __tree_const_iterator& __x, const __tree_const_iterator& __y)
|
752
|
+
{return __x.__ptr_ == __y.__ptr_;}
|
753
|
+
friend _LIBCPP_INLINE_VISIBILITY
|
754
|
+
bool operator!=(const __tree_const_iterator& __x, const __tree_const_iterator& __y)
|
755
|
+
{return !(__x == __y);}
|
756
|
+
|
757
|
+
private:
|
758
|
+
_LIBCPP_INLINE_VISIBILITY
|
759
|
+
explicit __tree_const_iterator(__node_pointer __p) _NOEXCEPT
|
760
|
+
: __ptr_(__p) {}
|
761
|
+
template <class, class, class> friend class __tree;
|
762
|
+
template <class, class, class, class> friend class _LIBCPP_TYPE_VIS map;
|
763
|
+
template <class, class, class, class> friend class _LIBCPP_TYPE_VIS multimap;
|
764
|
+
template <class, class, class> friend class _LIBCPP_TYPE_VIS set;
|
765
|
+
template <class, class, class> friend class _LIBCPP_TYPE_VIS multiset;
|
766
|
+
template <class> friend class _LIBCPP_TYPE_VIS __map_const_iterator;
|
767
|
+
};
|
768
|
+
|
769
|
+
template <class _Tp, class _Compare, class _Allocator>
|
770
|
+
class __tree
|
771
|
+
{
|
772
|
+
public:
|
773
|
+
typedef _Tp value_type;
|
774
|
+
typedef _Compare value_compare;
|
775
|
+
typedef _Allocator allocator_type;
|
776
|
+
typedef allocator_traits<allocator_type> __alloc_traits;
|
777
|
+
typedef typename __alloc_traits::pointer pointer;
|
778
|
+
typedef typename __alloc_traits::const_pointer const_pointer;
|
779
|
+
typedef typename __alloc_traits::size_type size_type;
|
780
|
+
typedef typename __alloc_traits::difference_type difference_type;
|
781
|
+
|
782
|
+
typedef __tree_node<value_type, typename __alloc_traits::void_pointer> __node;
|
783
|
+
typedef __tree_node_base<typename __alloc_traits::void_pointer> __node_base;
|
784
|
+
typedef typename __alloc_traits::template
|
785
|
+
#ifndef _LIBCPP_HAS_NO_TEMPLATE_ALIASES
|
786
|
+
rebind_alloc<__node>
|
787
|
+
#else
|
788
|
+
rebind_alloc<__node>::other
|
789
|
+
#endif
|
790
|
+
__node_allocator;
|
791
|
+
typedef allocator_traits<__node_allocator> __node_traits;
|
792
|
+
typedef typename __node_traits::pointer __node_pointer;
|
793
|
+
typedef typename __node_traits::const_pointer __node_const_pointer;
|
794
|
+
typedef typename __node_base::pointer __node_base_pointer;
|
795
|
+
typedef typename __node_base::const_pointer __node_base_const_pointer;
|
796
|
+
private:
|
797
|
+
typedef typename __node_base::base __end_node_t;
|
798
|
+
typedef typename pointer_traits<__node_pointer>::template
|
799
|
+
#ifndef _LIBCPP_HAS_NO_TEMPLATE_ALIASES
|
800
|
+
rebind<__end_node_t>
|
801
|
+
#else
|
802
|
+
rebind<__end_node_t>::other
|
803
|
+
#endif
|
804
|
+
__end_node_ptr;
|
805
|
+
typedef typename pointer_traits<__node_pointer>::template
|
806
|
+
#ifndef _LIBCPP_HAS_NO_TEMPLATE_ALIASES
|
807
|
+
rebind<const __end_node_t>
|
808
|
+
#else
|
809
|
+
rebind<const __end_node_t>::other
|
810
|
+
#endif
|
811
|
+
__end_node_const_ptr;
|
812
|
+
|
813
|
+
__node_pointer __begin_node_;
|
814
|
+
__compressed_pair<__end_node_t, __node_allocator> __pair1_;
|
815
|
+
__compressed_pair<size_type, value_compare> __pair3_;
|
816
|
+
|
817
|
+
public:
|
818
|
+
_LIBCPP_INLINE_VISIBILITY
|
819
|
+
__node_pointer __end_node() _NOEXCEPT
|
820
|
+
{
|
821
|
+
return static_cast<__node_pointer>
|
822
|
+
(
|
823
|
+
pointer_traits<__end_node_ptr>::pointer_to(__pair1_.first())
|
824
|
+
);
|
825
|
+
}
|
826
|
+
_LIBCPP_INLINE_VISIBILITY
|
827
|
+
__node_const_pointer __end_node() const _NOEXCEPT
|
828
|
+
{
|
829
|
+
return static_cast<__node_const_pointer>
|
830
|
+
(
|
831
|
+
pointer_traits<__end_node_const_ptr>::pointer_to(__pair1_.first())
|
832
|
+
);
|
833
|
+
}
|
834
|
+
_LIBCPP_INLINE_VISIBILITY
|
835
|
+
__node_allocator& __node_alloc() _NOEXCEPT {return __pair1_.second();}
|
836
|
+
private:
|
837
|
+
_LIBCPP_INLINE_VISIBILITY
|
838
|
+
const __node_allocator& __node_alloc() const _NOEXCEPT
|
839
|
+
{return __pair1_.second();}
|
840
|
+
_LIBCPP_INLINE_VISIBILITY
|
841
|
+
__node_pointer& __begin_node() _NOEXCEPT {return __begin_node_;}
|
842
|
+
_LIBCPP_INLINE_VISIBILITY
|
843
|
+
const __node_pointer& __begin_node() const _NOEXCEPT {return __begin_node_;}
|
844
|
+
public:
|
845
|
+
_LIBCPP_INLINE_VISIBILITY
|
846
|
+
allocator_type __alloc() const _NOEXCEPT
|
847
|
+
{return allocator_type(__node_alloc());}
|
848
|
+
private:
|
849
|
+
_LIBCPP_INLINE_VISIBILITY
|
850
|
+
size_type& size() _NOEXCEPT {return __pair3_.first();}
|
851
|
+
public:
|
852
|
+
_LIBCPP_INLINE_VISIBILITY
|
853
|
+
const size_type& size() const _NOEXCEPT {return __pair3_.first();}
|
854
|
+
_LIBCPP_INLINE_VISIBILITY
|
855
|
+
value_compare& value_comp() _NOEXCEPT {return __pair3_.second();}
|
856
|
+
_LIBCPP_INLINE_VISIBILITY
|
857
|
+
const value_compare& value_comp() const _NOEXCEPT
|
858
|
+
{return __pair3_.second();}
|
859
|
+
public:
|
860
|
+
_LIBCPP_INLINE_VISIBILITY
|
861
|
+
__node_pointer __root() _NOEXCEPT
|
862
|
+
{return static_cast<__node_pointer> (__end_node()->__left_);}
|
863
|
+
_LIBCPP_INLINE_VISIBILITY
|
864
|
+
__node_const_pointer __root() const _NOEXCEPT
|
865
|
+
{return static_cast<__node_const_pointer>(__end_node()->__left_);}
|
866
|
+
|
867
|
+
typedef __tree_iterator<value_type, __node_pointer, difference_type> iterator;
|
868
|
+
typedef __tree_const_iterator<value_type, __node_const_pointer, difference_type> const_iterator;
|
869
|
+
|
870
|
+
explicit __tree(const value_compare& __comp)
|
871
|
+
_NOEXCEPT_(
|
872
|
+
is_nothrow_default_constructible<__node_allocator>::value &&
|
873
|
+
is_nothrow_copy_constructible<value_compare>::value);
|
874
|
+
explicit __tree(const allocator_type& __a);
|
875
|
+
__tree(const value_compare& __comp, const allocator_type& __a);
|
876
|
+
__tree(const __tree& __t);
|
877
|
+
__tree& operator=(const __tree& __t);
|
878
|
+
template <class _InputIterator>
|
879
|
+
void __assign_unique(_InputIterator __first, _InputIterator __last);
|
880
|
+
template <class _InputIterator>
|
881
|
+
void __assign_multi(_InputIterator __first, _InputIterator __last);
|
882
|
+
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
883
|
+
__tree(__tree&& __t)
|
884
|
+
_NOEXCEPT_(
|
885
|
+
is_nothrow_move_constructible<__node_allocator>::value &&
|
886
|
+
is_nothrow_move_constructible<value_compare>::value);
|
887
|
+
__tree(__tree&& __t, const allocator_type& __a);
|
888
|
+
__tree& operator=(__tree&& __t)
|
889
|
+
_NOEXCEPT_(
|
890
|
+
__node_traits::propagate_on_container_move_assignment::value &&
|
891
|
+
is_nothrow_move_assignable<value_compare>::value &&
|
892
|
+
is_nothrow_move_assignable<__node_allocator>::value);
|
893
|
+
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
894
|
+
|
895
|
+
~__tree();
|
896
|
+
|
897
|
+
_LIBCPP_INLINE_VISIBILITY
|
898
|
+
iterator begin() _NOEXCEPT {return iterator(__begin_node());}
|
899
|
+
_LIBCPP_INLINE_VISIBILITY
|
900
|
+
const_iterator begin() const _NOEXCEPT {return const_iterator(__begin_node());}
|
901
|
+
_LIBCPP_INLINE_VISIBILITY
|
902
|
+
iterator end() _NOEXCEPT {return iterator(__end_node());}
|
903
|
+
_LIBCPP_INLINE_VISIBILITY
|
904
|
+
const_iterator end() const _NOEXCEPT {return const_iterator(__end_node());}
|
905
|
+
|
906
|
+
_LIBCPP_INLINE_VISIBILITY
|
907
|
+
size_type max_size() const _NOEXCEPT
|
908
|
+
{return __node_traits::max_size(__node_alloc());}
|
909
|
+
|
910
|
+
void clear() _NOEXCEPT;
|
911
|
+
|
912
|
+
void swap(__tree& __t)
|
913
|
+
_NOEXCEPT_(
|
914
|
+
__is_nothrow_swappable<value_compare>::value &&
|
915
|
+
(!__node_traits::propagate_on_container_swap::value ||
|
916
|
+
__is_nothrow_swappable<__node_allocator>::value));
|
917
|
+
|
918
|
+
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
919
|
+
#ifndef _LIBCPP_HAS_NO_VARIADICS
|
920
|
+
template <class... _Args>
|
921
|
+
pair<iterator, bool>
|
922
|
+
__emplace_unique(_Args&&... __args);
|
923
|
+
template <class... _Args>
|
924
|
+
iterator
|
925
|
+
__emplace_multi(_Args&&... __args);
|
926
|
+
|
927
|
+
template <class... _Args>
|
928
|
+
iterator
|
929
|
+
__emplace_hint_unique(const_iterator __p, _Args&&... __args);
|
930
|
+
template <class... _Args>
|
931
|
+
iterator
|
932
|
+
__emplace_hint_multi(const_iterator __p, _Args&&... __args);
|
933
|
+
#endif // _LIBCPP_HAS_NO_VARIADICS
|
934
|
+
|
935
|
+
template <class _Vp>
|
936
|
+
pair<iterator, bool> __insert_unique(_Vp&& __v);
|
937
|
+
template <class _Vp>
|
938
|
+
iterator __insert_unique(const_iterator __p, _Vp&& __v);
|
939
|
+
template <class _Vp>
|
940
|
+
iterator __insert_multi(_Vp&& __v);
|
941
|
+
template <class _Vp>
|
942
|
+
iterator __insert_multi(const_iterator __p, _Vp&& __v);
|
943
|
+
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
944
|
+
|
945
|
+
pair<iterator, bool> __insert_unique(const value_type& __v);
|
946
|
+
iterator __insert_unique(const_iterator __p, const value_type& __v);
|
947
|
+
iterator __insert_multi(const value_type& __v);
|
948
|
+
iterator __insert_multi(const_iterator __p, const value_type& __v);
|
949
|
+
|
950
|
+
pair<iterator, bool> __node_insert_unique(__node_pointer __nd);
|
951
|
+
iterator __node_insert_unique(const_iterator __p,
|
952
|
+
__node_pointer __nd);
|
953
|
+
|
954
|
+
iterator __node_insert_multi(__node_pointer __nd);
|
955
|
+
iterator __node_insert_multi(const_iterator __p, __node_pointer __nd);
|
956
|
+
|
957
|
+
iterator erase(const_iterator __p);
|
958
|
+
iterator erase(const_iterator __f, const_iterator __l);
|
959
|
+
template <class _Key>
|
960
|
+
size_type __erase_unique(const _Key& __k);
|
961
|
+
template <class _Key>
|
962
|
+
size_type __erase_multi(const _Key& __k);
|
963
|
+
|
964
|
+
void __insert_node_at(__node_base_pointer __parent,
|
965
|
+
__node_base_pointer& __child,
|
966
|
+
__node_base_pointer __new_node);
|
967
|
+
|
968
|
+
template <class _Key>
|
969
|
+
iterator find(const _Key& __v);
|
970
|
+
template <class _Key>
|
971
|
+
const_iterator find(const _Key& __v) const;
|
972
|
+
|
973
|
+
template <class _Key>
|
974
|
+
size_type __count_unique(const _Key& __k) const;
|
975
|
+
template <class _Key>
|
976
|
+
size_type __count_multi(const _Key& __k) const;
|
977
|
+
|
978
|
+
template <class _Key>
|
979
|
+
_LIBCPP_INLINE_VISIBILITY
|
980
|
+
iterator lower_bound(const _Key& __v)
|
981
|
+
{return __lower_bound(__v, __root(), __end_node());}
|
982
|
+
template <class _Key>
|
983
|
+
iterator __lower_bound(const _Key& __v,
|
984
|
+
__node_pointer __root,
|
985
|
+
__node_pointer __result);
|
986
|
+
template <class _Key>
|
987
|
+
_LIBCPP_INLINE_VISIBILITY
|
988
|
+
const_iterator lower_bound(const _Key& __v) const
|
989
|
+
{return __lower_bound(__v, __root(), __end_node());}
|
990
|
+
template <class _Key>
|
991
|
+
const_iterator __lower_bound(const _Key& __v,
|
992
|
+
__node_const_pointer __root,
|
993
|
+
__node_const_pointer __result) const;
|
994
|
+
template <class _Key>
|
995
|
+
_LIBCPP_INLINE_VISIBILITY
|
996
|
+
iterator upper_bound(const _Key& __v)
|
997
|
+
{return __upper_bound(__v, __root(), __end_node());}
|
998
|
+
template <class _Key>
|
999
|
+
iterator __upper_bound(const _Key& __v,
|
1000
|
+
__node_pointer __root,
|
1001
|
+
__node_pointer __result);
|
1002
|
+
template <class _Key>
|
1003
|
+
_LIBCPP_INLINE_VISIBILITY
|
1004
|
+
const_iterator upper_bound(const _Key& __v) const
|
1005
|
+
{return __upper_bound(__v, __root(), __end_node());}
|
1006
|
+
template <class _Key>
|
1007
|
+
const_iterator __upper_bound(const _Key& __v,
|
1008
|
+
__node_const_pointer __root,
|
1009
|
+
__node_const_pointer __result) const;
|
1010
|
+
template <class _Key>
|
1011
|
+
pair<iterator, iterator>
|
1012
|
+
__equal_range_unique(const _Key& __k);
|
1013
|
+
template <class _Key>
|
1014
|
+
pair<const_iterator, const_iterator>
|
1015
|
+
__equal_range_unique(const _Key& __k) const;
|
1016
|
+
|
1017
|
+
template <class _Key>
|
1018
|
+
pair<iterator, iterator>
|
1019
|
+
__equal_range_multi(const _Key& __k);
|
1020
|
+
template <class _Key>
|
1021
|
+
pair<const_iterator, const_iterator>
|
1022
|
+
__equal_range_multi(const _Key& __k) const;
|
1023
|
+
|
1024
|
+
typedef __tree_node_destructor<__node_allocator> _Dp;
|
1025
|
+
typedef unique_ptr<__node, _Dp> __node_holder;
|
1026
|
+
|
1027
|
+
__node_holder remove(const_iterator __p) _NOEXCEPT;
|
1028
|
+
private:
|
1029
|
+
typename __node_base::pointer&
|
1030
|
+
__find_leaf_low(typename __node_base::pointer& __parent, const value_type& __v);
|
1031
|
+
typename __node_base::pointer&
|
1032
|
+
__find_leaf_high(typename __node_base::pointer& __parent, const value_type& __v);
|
1033
|
+
typename __node_base::pointer&
|
1034
|
+
__find_leaf(const_iterator __hint,
|
1035
|
+
typename __node_base::pointer& __parent, const value_type& __v);
|
1036
|
+
template <class _Key>
|
1037
|
+
typename __node_base::pointer&
|
1038
|
+
__find_equal(typename __node_base::pointer& __parent, const _Key& __v);
|
1039
|
+
template <class _Key>
|
1040
|
+
typename __node_base::pointer&
|
1041
|
+
__find_equal(const_iterator __hint, typename __node_base::pointer& __parent,
|
1042
|
+
const _Key& __v);
|
1043
|
+
|
1044
|
+
#if !defined(_LIBCPP_HAS_NO_RVALUE_REFERENCES) && !defined(_LIBCPP_HAS_NO_VARIADICS)
|
1045
|
+
template <class ..._Args>
|
1046
|
+
__node_holder __construct_node(_Args&& ...__args);
|
1047
|
+
#else // !defined(_LIBCPP_HAS_NO_RVALUE_REFERENCES) && !defined(_LIBCPP_HAS_NO_VARIADICS)
|
1048
|
+
__node_holder __construct_node(const value_type& __v);
|
1049
|
+
#endif
|
1050
|
+
|
1051
|
+
void destroy(__node_pointer __nd) _NOEXCEPT;
|
1052
|
+
|
1053
|
+
_LIBCPP_INLINE_VISIBILITY
|
1054
|
+
void __copy_assign_alloc(const __tree& __t)
|
1055
|
+
{__copy_assign_alloc(__t, integral_constant<bool,
|
1056
|
+
__node_traits::propagate_on_container_copy_assignment::value>());}
|
1057
|
+
|
1058
|
+
_LIBCPP_INLINE_VISIBILITY
|
1059
|
+
void __copy_assign_alloc(const __tree& __t, true_type)
|
1060
|
+
{__node_alloc() = __t.__node_alloc();}
|
1061
|
+
_LIBCPP_INLINE_VISIBILITY
|
1062
|
+
void __copy_assign_alloc(const __tree& __t, false_type) {}
|
1063
|
+
|
1064
|
+
void __move_assign(__tree& __t, false_type);
|
1065
|
+
void __move_assign(__tree& __t, true_type)
|
1066
|
+
_NOEXCEPT_(is_nothrow_move_assignable<value_compare>::value &&
|
1067
|
+
is_nothrow_move_assignable<__node_allocator>::value);
|
1068
|
+
|
1069
|
+
_LIBCPP_INLINE_VISIBILITY
|
1070
|
+
void __move_assign_alloc(__tree& __t)
|
1071
|
+
_NOEXCEPT_(
|
1072
|
+
!__node_traits::propagate_on_container_move_assignment::value ||
|
1073
|
+
is_nothrow_move_assignable<__node_allocator>::value)
|
1074
|
+
{__move_assign_alloc(__t, integral_constant<bool,
|
1075
|
+
__node_traits::propagate_on_container_move_assignment::value>());}
|
1076
|
+
|
1077
|
+
_LIBCPP_INLINE_VISIBILITY
|
1078
|
+
void __move_assign_alloc(__tree& __t, true_type)
|
1079
|
+
_NOEXCEPT_(is_nothrow_move_assignable<__node_allocator>::value)
|
1080
|
+
{__node_alloc() = _VSTD::move(__t.__node_alloc());}
|
1081
|
+
_LIBCPP_INLINE_VISIBILITY
|
1082
|
+
void __move_assign_alloc(__tree& __t, false_type) _NOEXCEPT {}
|
1083
|
+
|
1084
|
+
_LIBCPP_INLINE_VISIBILITY
|
1085
|
+
static void __swap_alloc(__node_allocator& __x, __node_allocator& __y)
|
1086
|
+
_NOEXCEPT_(
|
1087
|
+
!__node_traits::propagate_on_container_swap::value ||
|
1088
|
+
__is_nothrow_swappable<__node_allocator>::value)
|
1089
|
+
{__swap_alloc(__x, __y, integral_constant<bool,
|
1090
|
+
__node_traits::propagate_on_container_swap::value>());}
|
1091
|
+
_LIBCPP_INLINE_VISIBILITY
|
1092
|
+
static void __swap_alloc(__node_allocator& __x, __node_allocator& __y, true_type)
|
1093
|
+
_NOEXCEPT_(__is_nothrow_swappable<__node_allocator>::value)
|
1094
|
+
{
|
1095
|
+
using _VSTD::swap;
|
1096
|
+
swap(__x, __y);
|
1097
|
+
}
|
1098
|
+
_LIBCPP_INLINE_VISIBILITY
|
1099
|
+
static void __swap_alloc(__node_allocator& __x, __node_allocator& __y, false_type)
|
1100
|
+
_NOEXCEPT
|
1101
|
+
{}
|
1102
|
+
|
1103
|
+
__node_pointer __detach();
|
1104
|
+
static __node_pointer __detach(__node_pointer);
|
1105
|
+
};
|
1106
|
+
|
1107
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1108
|
+
__tree<_Tp, _Compare, _Allocator>::__tree(const value_compare& __comp)
|
1109
|
+
_NOEXCEPT_(
|
1110
|
+
is_nothrow_default_constructible<__node_allocator>::value &&
|
1111
|
+
is_nothrow_copy_constructible<value_compare>::value)
|
1112
|
+
: __pair3_(0, __comp)
|
1113
|
+
{
|
1114
|
+
__begin_node() = __end_node();
|
1115
|
+
}
|
1116
|
+
|
1117
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1118
|
+
__tree<_Tp, _Compare, _Allocator>::__tree(const allocator_type& __a)
|
1119
|
+
: __pair1_(__node_allocator(__a)),
|
1120
|
+
__begin_node_(__node_pointer()),
|
1121
|
+
__pair3_(0)
|
1122
|
+
{
|
1123
|
+
__begin_node() = __end_node();
|
1124
|
+
}
|
1125
|
+
|
1126
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1127
|
+
__tree<_Tp, _Compare, _Allocator>::__tree(const value_compare& __comp,
|
1128
|
+
const allocator_type& __a)
|
1129
|
+
: __pair1_(__node_allocator(__a)),
|
1130
|
+
__begin_node_(__node_pointer()),
|
1131
|
+
__pair3_(0, __comp)
|
1132
|
+
{
|
1133
|
+
__begin_node() = __end_node();
|
1134
|
+
}
|
1135
|
+
|
1136
|
+
// Precondition: size() != 0
|
1137
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1138
|
+
typename __tree<_Tp, _Compare, _Allocator>::__node_pointer
|
1139
|
+
__tree<_Tp, _Compare, _Allocator>::__detach()
|
1140
|
+
{
|
1141
|
+
__node_pointer __cache = __begin_node();
|
1142
|
+
__begin_node() = __end_node();
|
1143
|
+
__end_node()->__left_->__parent_ = nullptr;
|
1144
|
+
__end_node()->__left_ = nullptr;
|
1145
|
+
size() = 0;
|
1146
|
+
// __cache->__left_ == nullptr
|
1147
|
+
if (__cache->__right_ != nullptr)
|
1148
|
+
__cache = static_cast<__node_pointer>(__cache->__right_);
|
1149
|
+
// __cache->__left_ == nullptr
|
1150
|
+
// __cache->__right_ == nullptr
|
1151
|
+
return __cache;
|
1152
|
+
}
|
1153
|
+
|
1154
|
+
// Precondition: __cache != nullptr
|
1155
|
+
// __cache->left_ == nullptr
|
1156
|
+
// __cache->right_ == nullptr
|
1157
|
+
// This is no longer a red-black tree
|
1158
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1159
|
+
typename __tree<_Tp, _Compare, _Allocator>::__node_pointer
|
1160
|
+
__tree<_Tp, _Compare, _Allocator>::__detach(__node_pointer __cache)
|
1161
|
+
{
|
1162
|
+
if (__cache->__parent_ == nullptr)
|
1163
|
+
return nullptr;
|
1164
|
+
if (__tree_is_left_child(__cache))
|
1165
|
+
{
|
1166
|
+
__cache->__parent_->__left_ = nullptr;
|
1167
|
+
__cache = static_cast<__node_pointer>(__cache->__parent_);
|
1168
|
+
if (__cache->__right_ == nullptr)
|
1169
|
+
return __cache;
|
1170
|
+
return static_cast<__node_pointer>(__tree_leaf(__cache->__right_));
|
1171
|
+
}
|
1172
|
+
// __cache is right child
|
1173
|
+
__cache->__parent_->__right_ = nullptr;
|
1174
|
+
__cache = static_cast<__node_pointer>(__cache->__parent_);
|
1175
|
+
if (__cache->__left_ == nullptr)
|
1176
|
+
return __cache;
|
1177
|
+
return static_cast<__node_pointer>(__tree_leaf(__cache->__left_));
|
1178
|
+
}
|
1179
|
+
|
1180
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1181
|
+
__tree<_Tp, _Compare, _Allocator>&
|
1182
|
+
__tree<_Tp, _Compare, _Allocator>::operator=(const __tree& __t)
|
1183
|
+
{
|
1184
|
+
if (this != &__t)
|
1185
|
+
{
|
1186
|
+
value_comp() = __t.value_comp();
|
1187
|
+
__copy_assign_alloc(__t);
|
1188
|
+
__assign_multi(__t.begin(), __t.end());
|
1189
|
+
}
|
1190
|
+
return *this;
|
1191
|
+
}
|
1192
|
+
|
1193
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1194
|
+
template <class _InputIterator>
|
1195
|
+
void
|
1196
|
+
__tree<_Tp, _Compare, _Allocator>::__assign_unique(_InputIterator __first, _InputIterator __last)
|
1197
|
+
{
|
1198
|
+
if (size() != 0)
|
1199
|
+
{
|
1200
|
+
__node_pointer __cache = __detach();
|
1201
|
+
#ifndef _LIBCPP_NO_EXCEPTIONS
|
1202
|
+
try
|
1203
|
+
{
|
1204
|
+
#endif // _LIBCPP_NO_EXCEPTIONS
|
1205
|
+
for (; __cache != nullptr && __first != __last; ++__first)
|
1206
|
+
{
|
1207
|
+
__cache->__value_ = *__first;
|
1208
|
+
__node_pointer __next = __detach(__cache);
|
1209
|
+
__node_insert_unique(__cache);
|
1210
|
+
__cache = __next;
|
1211
|
+
}
|
1212
|
+
#ifndef _LIBCPP_NO_EXCEPTIONS
|
1213
|
+
}
|
1214
|
+
catch (...)
|
1215
|
+
{
|
1216
|
+
while (__cache->__parent_ != nullptr)
|
1217
|
+
__cache = static_cast<__node_pointer>(__cache->__parent_);
|
1218
|
+
destroy(__cache);
|
1219
|
+
throw;
|
1220
|
+
}
|
1221
|
+
#endif // _LIBCPP_NO_EXCEPTIONS
|
1222
|
+
if (__cache != nullptr)
|
1223
|
+
{
|
1224
|
+
while (__cache->__parent_ != nullptr)
|
1225
|
+
__cache = static_cast<__node_pointer>(__cache->__parent_);
|
1226
|
+
destroy(__cache);
|
1227
|
+
}
|
1228
|
+
}
|
1229
|
+
for (; __first != __last; ++__first)
|
1230
|
+
__insert_unique(*__first);
|
1231
|
+
}
|
1232
|
+
|
1233
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1234
|
+
template <class _InputIterator>
|
1235
|
+
void
|
1236
|
+
__tree<_Tp, _Compare, _Allocator>::__assign_multi(_InputIterator __first, _InputIterator __last)
|
1237
|
+
{
|
1238
|
+
if (size() != 0)
|
1239
|
+
{
|
1240
|
+
__node_pointer __cache = __detach();
|
1241
|
+
#ifndef _LIBCPP_NO_EXCEPTIONS
|
1242
|
+
try
|
1243
|
+
{
|
1244
|
+
#endif // _LIBCPP_NO_EXCEPTIONS
|
1245
|
+
for (; __cache != nullptr && __first != __last; ++__first)
|
1246
|
+
{
|
1247
|
+
__cache->__value_ = *__first;
|
1248
|
+
__node_pointer __next = __detach(__cache);
|
1249
|
+
__node_insert_multi(__cache);
|
1250
|
+
__cache = __next;
|
1251
|
+
}
|
1252
|
+
#ifndef _LIBCPP_NO_EXCEPTIONS
|
1253
|
+
}
|
1254
|
+
catch (...)
|
1255
|
+
{
|
1256
|
+
while (__cache->__parent_ != nullptr)
|
1257
|
+
__cache = static_cast<__node_pointer>(__cache->__parent_);
|
1258
|
+
destroy(__cache);
|
1259
|
+
throw;
|
1260
|
+
}
|
1261
|
+
#endif // _LIBCPP_NO_EXCEPTIONS
|
1262
|
+
if (__cache != nullptr)
|
1263
|
+
{
|
1264
|
+
while (__cache->__parent_ != nullptr)
|
1265
|
+
__cache = static_cast<__node_pointer>(__cache->__parent_);
|
1266
|
+
destroy(__cache);
|
1267
|
+
}
|
1268
|
+
}
|
1269
|
+
for (; __first != __last; ++__first)
|
1270
|
+
__insert_multi(*__first);
|
1271
|
+
}
|
1272
|
+
|
1273
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1274
|
+
__tree<_Tp, _Compare, _Allocator>::__tree(const __tree& __t)
|
1275
|
+
: __begin_node_(__node_pointer()),
|
1276
|
+
__pair1_(__node_traits::select_on_container_copy_construction(__t.__node_alloc())),
|
1277
|
+
__pair3_(0, __t.value_comp())
|
1278
|
+
{
|
1279
|
+
__begin_node() = __end_node();
|
1280
|
+
}
|
1281
|
+
|
1282
|
+
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
1283
|
+
|
1284
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1285
|
+
__tree<_Tp, _Compare, _Allocator>::__tree(__tree&& __t)
|
1286
|
+
_NOEXCEPT_(
|
1287
|
+
is_nothrow_move_constructible<__node_allocator>::value &&
|
1288
|
+
is_nothrow_move_constructible<value_compare>::value)
|
1289
|
+
: __begin_node_(_VSTD::move(__t.__begin_node_)),
|
1290
|
+
__pair1_(_VSTD::move(__t.__pair1_)),
|
1291
|
+
__pair3_(_VSTD::move(__t.__pair3_))
|
1292
|
+
{
|
1293
|
+
if (size() == 0)
|
1294
|
+
__begin_node() = __end_node();
|
1295
|
+
else
|
1296
|
+
{
|
1297
|
+
__end_node()->__left_->__parent_ = __end_node();
|
1298
|
+
__t.__begin_node() = __t.__end_node();
|
1299
|
+
__t.__end_node()->__left_ = nullptr;
|
1300
|
+
__t.size() = 0;
|
1301
|
+
}
|
1302
|
+
}
|
1303
|
+
|
1304
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1305
|
+
__tree<_Tp, _Compare, _Allocator>::__tree(__tree&& __t, const allocator_type& __a)
|
1306
|
+
: __pair1_(__node_allocator(__a)),
|
1307
|
+
__pair3_(0, _VSTD::move(__t.value_comp()))
|
1308
|
+
{
|
1309
|
+
if (__a == __t.__alloc())
|
1310
|
+
{
|
1311
|
+
if (__t.size() == 0)
|
1312
|
+
__begin_node() = __end_node();
|
1313
|
+
else
|
1314
|
+
{
|
1315
|
+
__begin_node() = __t.__begin_node();
|
1316
|
+
__end_node()->__left_ = __t.__end_node()->__left_;
|
1317
|
+
__end_node()->__left_->__parent_ = __end_node();
|
1318
|
+
size() = __t.size();
|
1319
|
+
__t.__begin_node() = __t.__end_node();
|
1320
|
+
__t.__end_node()->__left_ = nullptr;
|
1321
|
+
__t.size() = 0;
|
1322
|
+
}
|
1323
|
+
}
|
1324
|
+
else
|
1325
|
+
{
|
1326
|
+
__begin_node() = __end_node();
|
1327
|
+
}
|
1328
|
+
}
|
1329
|
+
|
1330
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1331
|
+
void
|
1332
|
+
__tree<_Tp, _Compare, _Allocator>::__move_assign(__tree& __t, true_type)
|
1333
|
+
_NOEXCEPT_(is_nothrow_move_assignable<value_compare>::value &&
|
1334
|
+
is_nothrow_move_assignable<__node_allocator>::value)
|
1335
|
+
{
|
1336
|
+
destroy(static_cast<__node_pointer>(__end_node()->__left_));
|
1337
|
+
__begin_node_ = __t.__begin_node_;
|
1338
|
+
__pair1_.first() = __t.__pair1_.first();
|
1339
|
+
__move_assign_alloc(__t);
|
1340
|
+
__pair3_ = _VSTD::move(__t.__pair3_);
|
1341
|
+
if (size() == 0)
|
1342
|
+
__begin_node() = __end_node();
|
1343
|
+
else
|
1344
|
+
{
|
1345
|
+
__end_node()->__left_->__parent_ = __end_node();
|
1346
|
+
__t.__begin_node() = __t.__end_node();
|
1347
|
+
__t.__end_node()->__left_ = nullptr;
|
1348
|
+
__t.size() = 0;
|
1349
|
+
}
|
1350
|
+
}
|
1351
|
+
|
1352
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1353
|
+
void
|
1354
|
+
__tree<_Tp, _Compare, _Allocator>::__move_assign(__tree& __t, false_type)
|
1355
|
+
{
|
1356
|
+
if (__node_alloc() == __t.__node_alloc())
|
1357
|
+
__move_assign(__t, true_type());
|
1358
|
+
else
|
1359
|
+
{
|
1360
|
+
value_comp() = _VSTD::move(__t.value_comp());
|
1361
|
+
const_iterator __e = end();
|
1362
|
+
if (size() != 0)
|
1363
|
+
{
|
1364
|
+
__node_pointer __cache = __detach();
|
1365
|
+
#ifndef _LIBCPP_NO_EXCEPTIONS
|
1366
|
+
try
|
1367
|
+
{
|
1368
|
+
#endif // _LIBCPP_NO_EXCEPTIONS
|
1369
|
+
while (__cache != nullptr && __t.size() != 0)
|
1370
|
+
{
|
1371
|
+
__cache->__value_ = _VSTD::move(__t.remove(__t.begin())->__value_);
|
1372
|
+
__node_pointer __next = __detach(__cache);
|
1373
|
+
__node_insert_multi(__cache);
|
1374
|
+
__cache = __next;
|
1375
|
+
}
|
1376
|
+
#ifndef _LIBCPP_NO_EXCEPTIONS
|
1377
|
+
}
|
1378
|
+
catch (...)
|
1379
|
+
{
|
1380
|
+
while (__cache->__parent_ != nullptr)
|
1381
|
+
__cache = static_cast<__node_pointer>(__cache->__parent_);
|
1382
|
+
destroy(__cache);
|
1383
|
+
throw;
|
1384
|
+
}
|
1385
|
+
#endif // _LIBCPP_NO_EXCEPTIONS
|
1386
|
+
if (__cache != nullptr)
|
1387
|
+
{
|
1388
|
+
while (__cache->__parent_ != nullptr)
|
1389
|
+
__cache = static_cast<__node_pointer>(__cache->__parent_);
|
1390
|
+
destroy(__cache);
|
1391
|
+
}
|
1392
|
+
}
|
1393
|
+
while (__t.size() != 0)
|
1394
|
+
__insert_multi(__e, _VSTD::move(__t.remove(__t.begin())->__value_));
|
1395
|
+
}
|
1396
|
+
}
|
1397
|
+
|
1398
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1399
|
+
__tree<_Tp, _Compare, _Allocator>&
|
1400
|
+
__tree<_Tp, _Compare, _Allocator>::operator=(__tree&& __t)
|
1401
|
+
_NOEXCEPT_(
|
1402
|
+
__node_traits::propagate_on_container_move_assignment::value &&
|
1403
|
+
is_nothrow_move_assignable<value_compare>::value &&
|
1404
|
+
is_nothrow_move_assignable<__node_allocator>::value)
|
1405
|
+
|
1406
|
+
{
|
1407
|
+
__move_assign(__t, integral_constant<bool,
|
1408
|
+
__node_traits::propagate_on_container_move_assignment::value>());
|
1409
|
+
return *this;
|
1410
|
+
}
|
1411
|
+
|
1412
|
+
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
1413
|
+
|
1414
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1415
|
+
__tree<_Tp, _Compare, _Allocator>::~__tree()
|
1416
|
+
{
|
1417
|
+
destroy(__root());
|
1418
|
+
}
|
1419
|
+
|
1420
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1421
|
+
void
|
1422
|
+
__tree<_Tp, _Compare, _Allocator>::destroy(__node_pointer __nd) _NOEXCEPT
|
1423
|
+
{
|
1424
|
+
if (__nd != nullptr)
|
1425
|
+
{
|
1426
|
+
destroy(static_cast<__node_pointer>(__nd->__left_));
|
1427
|
+
destroy(static_cast<__node_pointer>(__nd->__right_));
|
1428
|
+
__node_allocator& __na = __node_alloc();
|
1429
|
+
__node_traits::destroy(__na, _VSTD::addressof(__nd->__value_));
|
1430
|
+
__node_traits::deallocate(__na, __nd, 1);
|
1431
|
+
}
|
1432
|
+
}
|
1433
|
+
|
1434
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1435
|
+
void
|
1436
|
+
__tree<_Tp, _Compare, _Allocator>::swap(__tree& __t)
|
1437
|
+
_NOEXCEPT_(
|
1438
|
+
__is_nothrow_swappable<value_compare>::value &&
|
1439
|
+
(!__node_traits::propagate_on_container_swap::value ||
|
1440
|
+
__is_nothrow_swappable<__node_allocator>::value))
|
1441
|
+
{
|
1442
|
+
using _VSTD::swap;
|
1443
|
+
swap(__begin_node_, __t.__begin_node_);
|
1444
|
+
swap(__pair1_.first(), __t.__pair1_.first());
|
1445
|
+
__swap_alloc(__node_alloc(), __t.__node_alloc());
|
1446
|
+
__pair3_.swap(__t.__pair3_);
|
1447
|
+
if (size() == 0)
|
1448
|
+
__begin_node() = __end_node();
|
1449
|
+
else
|
1450
|
+
__end_node()->__left_->__parent_ = __end_node();
|
1451
|
+
if (__t.size() == 0)
|
1452
|
+
__t.__begin_node() = __t.__end_node();
|
1453
|
+
else
|
1454
|
+
__t.__end_node()->__left_->__parent_ = __t.__end_node();
|
1455
|
+
}
|
1456
|
+
|
1457
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1458
|
+
void
|
1459
|
+
__tree<_Tp, _Compare, _Allocator>::clear() _NOEXCEPT
|
1460
|
+
{
|
1461
|
+
destroy(__root());
|
1462
|
+
size() = 0;
|
1463
|
+
__begin_node() = __end_node();
|
1464
|
+
__end_node()->__left_ = nullptr;
|
1465
|
+
}
|
1466
|
+
|
1467
|
+
// Find lower_bound place to insert
|
1468
|
+
// Set __parent to parent of null leaf
|
1469
|
+
// Return reference to null leaf
|
1470
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1471
|
+
typename __tree<_Tp, _Compare, _Allocator>::__node_base::pointer&
|
1472
|
+
__tree<_Tp, _Compare, _Allocator>::__find_leaf_low(typename __node_base::pointer& __parent,
|
1473
|
+
const value_type& __v)
|
1474
|
+
{
|
1475
|
+
__node_pointer __nd = __root();
|
1476
|
+
if (__nd != nullptr)
|
1477
|
+
{
|
1478
|
+
while (true)
|
1479
|
+
{
|
1480
|
+
if (value_comp()(__nd->__value_, __v))
|
1481
|
+
{
|
1482
|
+
if (__nd->__right_ != nullptr)
|
1483
|
+
__nd = static_cast<__node_pointer>(__nd->__right_);
|
1484
|
+
else
|
1485
|
+
{
|
1486
|
+
__parent = __nd;
|
1487
|
+
return __parent->__right_;
|
1488
|
+
}
|
1489
|
+
}
|
1490
|
+
else
|
1491
|
+
{
|
1492
|
+
if (__nd->__left_ != nullptr)
|
1493
|
+
__nd = static_cast<__node_pointer>(__nd->__left_);
|
1494
|
+
else
|
1495
|
+
{
|
1496
|
+
__parent = __nd;
|
1497
|
+
return __parent->__left_;
|
1498
|
+
}
|
1499
|
+
}
|
1500
|
+
}
|
1501
|
+
}
|
1502
|
+
__parent = __end_node();
|
1503
|
+
return __parent->__left_;
|
1504
|
+
}
|
1505
|
+
|
1506
|
+
// Find upper_bound place to insert
|
1507
|
+
// Set __parent to parent of null leaf
|
1508
|
+
// Return reference to null leaf
|
1509
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1510
|
+
typename __tree<_Tp, _Compare, _Allocator>::__node_base::pointer&
|
1511
|
+
__tree<_Tp, _Compare, _Allocator>::__find_leaf_high(typename __node_base::pointer& __parent,
|
1512
|
+
const value_type& __v)
|
1513
|
+
{
|
1514
|
+
__node_pointer __nd = __root();
|
1515
|
+
if (__nd != nullptr)
|
1516
|
+
{
|
1517
|
+
while (true)
|
1518
|
+
{
|
1519
|
+
if (value_comp()(__v, __nd->__value_))
|
1520
|
+
{
|
1521
|
+
if (__nd->__left_ != nullptr)
|
1522
|
+
__nd = static_cast<__node_pointer>(__nd->__left_);
|
1523
|
+
else
|
1524
|
+
{
|
1525
|
+
__parent = __nd;
|
1526
|
+
return __parent->__left_;
|
1527
|
+
}
|
1528
|
+
}
|
1529
|
+
else
|
1530
|
+
{
|
1531
|
+
if (__nd->__right_ != nullptr)
|
1532
|
+
__nd = static_cast<__node_pointer>(__nd->__right_);
|
1533
|
+
else
|
1534
|
+
{
|
1535
|
+
__parent = __nd;
|
1536
|
+
return __parent->__right_;
|
1537
|
+
}
|
1538
|
+
}
|
1539
|
+
}
|
1540
|
+
}
|
1541
|
+
__parent = __end_node();
|
1542
|
+
return __parent->__left_;
|
1543
|
+
}
|
1544
|
+
|
1545
|
+
// Find leaf place to insert closest to __hint
|
1546
|
+
// First check prior to __hint.
|
1547
|
+
// Next check after __hint.
|
1548
|
+
// Next do O(log N) search.
|
1549
|
+
// Set __parent to parent of null leaf
|
1550
|
+
// Return reference to null leaf
|
1551
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1552
|
+
typename __tree<_Tp, _Compare, _Allocator>::__node_base::pointer&
|
1553
|
+
__tree<_Tp, _Compare, _Allocator>::__find_leaf(const_iterator __hint,
|
1554
|
+
typename __node_base::pointer& __parent,
|
1555
|
+
const value_type& __v)
|
1556
|
+
{
|
1557
|
+
if (__hint == end() || !value_comp()(*__hint, __v)) // check before
|
1558
|
+
{
|
1559
|
+
// __v <= *__hint
|
1560
|
+
const_iterator __prior = __hint;
|
1561
|
+
if (__prior == begin() || !value_comp()(__v, *--__prior))
|
1562
|
+
{
|
1563
|
+
// *prev(__hint) <= __v <= *__hint
|
1564
|
+
if (__hint.__ptr_->__left_ == nullptr)
|
1565
|
+
{
|
1566
|
+
__parent = const_cast<__node_pointer&>(__hint.__ptr_);
|
1567
|
+
return __parent->__left_;
|
1568
|
+
}
|
1569
|
+
else
|
1570
|
+
{
|
1571
|
+
__parent = const_cast<__node_pointer&>(__prior.__ptr_);
|
1572
|
+
return __parent->__right_;
|
1573
|
+
}
|
1574
|
+
}
|
1575
|
+
// __v < *prev(__hint)
|
1576
|
+
return __find_leaf_high(__parent, __v);
|
1577
|
+
}
|
1578
|
+
// else __v > *__hint
|
1579
|
+
return __find_leaf_low(__parent, __v);
|
1580
|
+
}
|
1581
|
+
|
1582
|
+
// Find place to insert if __v doesn't exist
|
1583
|
+
// Set __parent to parent of null leaf
|
1584
|
+
// Return reference to null leaf
|
1585
|
+
// If __v exists, set parent to node of __v and return reference to node of __v
|
1586
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1587
|
+
template <class _Key>
|
1588
|
+
typename __tree<_Tp, _Compare, _Allocator>::__node_base::pointer&
|
1589
|
+
__tree<_Tp, _Compare, _Allocator>::__find_equal(typename __node_base::pointer& __parent,
|
1590
|
+
const _Key& __v)
|
1591
|
+
{
|
1592
|
+
__node_pointer __nd = __root();
|
1593
|
+
if (__nd != nullptr)
|
1594
|
+
{
|
1595
|
+
while (true)
|
1596
|
+
{
|
1597
|
+
if (value_comp()(__v, __nd->__value_))
|
1598
|
+
{
|
1599
|
+
if (__nd->__left_ != nullptr)
|
1600
|
+
__nd = static_cast<__node_pointer>(__nd->__left_);
|
1601
|
+
else
|
1602
|
+
{
|
1603
|
+
__parent = __nd;
|
1604
|
+
return __parent->__left_;
|
1605
|
+
}
|
1606
|
+
}
|
1607
|
+
else if (value_comp()(__nd->__value_, __v))
|
1608
|
+
{
|
1609
|
+
if (__nd->__right_ != nullptr)
|
1610
|
+
__nd = static_cast<__node_pointer>(__nd->__right_);
|
1611
|
+
else
|
1612
|
+
{
|
1613
|
+
__parent = __nd;
|
1614
|
+
return __parent->__right_;
|
1615
|
+
}
|
1616
|
+
}
|
1617
|
+
else
|
1618
|
+
{
|
1619
|
+
__parent = __nd;
|
1620
|
+
return __parent;
|
1621
|
+
}
|
1622
|
+
}
|
1623
|
+
}
|
1624
|
+
__parent = __end_node();
|
1625
|
+
return __parent->__left_;
|
1626
|
+
}
|
1627
|
+
|
1628
|
+
// Find place to insert if __v doesn't exist
|
1629
|
+
// First check prior to __hint.
|
1630
|
+
// Next check after __hint.
|
1631
|
+
// Next do O(log N) search.
|
1632
|
+
// Set __parent to parent of null leaf
|
1633
|
+
// Return reference to null leaf
|
1634
|
+
// If __v exists, set parent to node of __v and return reference to node of __v
|
1635
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1636
|
+
template <class _Key>
|
1637
|
+
typename __tree<_Tp, _Compare, _Allocator>::__node_base::pointer&
|
1638
|
+
__tree<_Tp, _Compare, _Allocator>::__find_equal(const_iterator __hint,
|
1639
|
+
typename __node_base::pointer& __parent,
|
1640
|
+
const _Key& __v)
|
1641
|
+
{
|
1642
|
+
if (__hint == end() || value_comp()(__v, *__hint)) // check before
|
1643
|
+
{
|
1644
|
+
// __v < *__hint
|
1645
|
+
const_iterator __prior = __hint;
|
1646
|
+
if (__prior == begin() || value_comp()(*--__prior, __v))
|
1647
|
+
{
|
1648
|
+
// *prev(__hint) < __v < *__hint
|
1649
|
+
if (__hint.__ptr_->__left_ == nullptr)
|
1650
|
+
{
|
1651
|
+
__parent = const_cast<__node_pointer&>(__hint.__ptr_);
|
1652
|
+
return __parent->__left_;
|
1653
|
+
}
|
1654
|
+
else
|
1655
|
+
{
|
1656
|
+
__parent = const_cast<__node_pointer&>(__prior.__ptr_);
|
1657
|
+
return __parent->__right_;
|
1658
|
+
}
|
1659
|
+
}
|
1660
|
+
// __v <= *prev(__hint)
|
1661
|
+
return __find_equal(__parent, __v);
|
1662
|
+
}
|
1663
|
+
else if (value_comp()(*__hint, __v)) // check after
|
1664
|
+
{
|
1665
|
+
// *__hint < __v
|
1666
|
+
const_iterator __next = _VSTD::next(__hint);
|
1667
|
+
if (__next == end() || value_comp()(__v, *__next))
|
1668
|
+
{
|
1669
|
+
// *__hint < __v < *_VSTD::next(__hint)
|
1670
|
+
if (__hint.__ptr_->__right_ == nullptr)
|
1671
|
+
{
|
1672
|
+
__parent = const_cast<__node_pointer&>(__hint.__ptr_);
|
1673
|
+
return __parent->__right_;
|
1674
|
+
}
|
1675
|
+
else
|
1676
|
+
{
|
1677
|
+
__parent = const_cast<__node_pointer&>(__next.__ptr_);
|
1678
|
+
return __parent->__left_;
|
1679
|
+
}
|
1680
|
+
}
|
1681
|
+
// *next(__hint) <= __v
|
1682
|
+
return __find_equal(__parent, __v);
|
1683
|
+
}
|
1684
|
+
// else __v == *__hint
|
1685
|
+
__parent = const_cast<__node_pointer&>(__hint.__ptr_);
|
1686
|
+
return __parent;
|
1687
|
+
}
|
1688
|
+
|
1689
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1690
|
+
void
|
1691
|
+
__tree<_Tp, _Compare, _Allocator>::__insert_node_at(__node_base_pointer __parent,
|
1692
|
+
__node_base_pointer& __child,
|
1693
|
+
__node_base_pointer __new_node)
|
1694
|
+
{
|
1695
|
+
__new_node->__left_ = nullptr;
|
1696
|
+
__new_node->__right_ = nullptr;
|
1697
|
+
__new_node->__parent_ = __parent;
|
1698
|
+
__child = __new_node;
|
1699
|
+
if (__begin_node()->__left_ != nullptr)
|
1700
|
+
__begin_node() = static_cast<__node_pointer>(__begin_node()->__left_);
|
1701
|
+
__tree_balance_after_insert(__end_node()->__left_, __child);
|
1702
|
+
++size();
|
1703
|
+
}
|
1704
|
+
|
1705
|
+
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
1706
|
+
#ifndef _LIBCPP_HAS_NO_VARIADICS
|
1707
|
+
|
1708
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1709
|
+
template <class ..._Args>
|
1710
|
+
typename __tree<_Tp, _Compare, _Allocator>::__node_holder
|
1711
|
+
__tree<_Tp, _Compare, _Allocator>::__construct_node(_Args&& ...__args)
|
1712
|
+
{
|
1713
|
+
__node_allocator& __na = __node_alloc();
|
1714
|
+
__node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
|
1715
|
+
__node_traits::construct(__na, _VSTD::addressof(__h->__value_), _VSTD::forward<_Args>(__args)...);
|
1716
|
+
__h.get_deleter().__value_constructed = true;
|
1717
|
+
return __h;
|
1718
|
+
}
|
1719
|
+
|
1720
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1721
|
+
template <class... _Args>
|
1722
|
+
pair<typename __tree<_Tp, _Compare, _Allocator>::iterator, bool>
|
1723
|
+
__tree<_Tp, _Compare, _Allocator>::__emplace_unique(_Args&&... __args)
|
1724
|
+
{
|
1725
|
+
__node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
|
1726
|
+
__node_base_pointer __parent;
|
1727
|
+
__node_base_pointer& __child = __find_equal(__parent, __h->__value_);
|
1728
|
+
__node_pointer __r = static_cast<__node_pointer>(__child);
|
1729
|
+
bool __inserted = false;
|
1730
|
+
if (__child == nullptr)
|
1731
|
+
{
|
1732
|
+
__insert_node_at(__parent, __child, __h.get());
|
1733
|
+
__r = __h.release();
|
1734
|
+
__inserted = true;
|
1735
|
+
}
|
1736
|
+
return pair<iterator, bool>(iterator(__r), __inserted);
|
1737
|
+
}
|
1738
|
+
|
1739
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1740
|
+
template <class... _Args>
|
1741
|
+
typename __tree<_Tp, _Compare, _Allocator>::iterator
|
1742
|
+
__tree<_Tp, _Compare, _Allocator>::__emplace_hint_unique(const_iterator __p, _Args&&... __args)
|
1743
|
+
{
|
1744
|
+
__node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
|
1745
|
+
__node_base_pointer __parent;
|
1746
|
+
__node_base_pointer& __child = __find_equal(__p, __parent, __h->__value_);
|
1747
|
+
__node_pointer __r = static_cast<__node_pointer>(__child);
|
1748
|
+
if (__child == nullptr)
|
1749
|
+
{
|
1750
|
+
__insert_node_at(__parent, __child, __h.get());
|
1751
|
+
__r = __h.release();
|
1752
|
+
}
|
1753
|
+
return iterator(__r);
|
1754
|
+
}
|
1755
|
+
|
1756
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1757
|
+
template <class... _Args>
|
1758
|
+
typename __tree<_Tp, _Compare, _Allocator>::iterator
|
1759
|
+
__tree<_Tp, _Compare, _Allocator>::__emplace_multi(_Args&&... __args)
|
1760
|
+
{
|
1761
|
+
__node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
|
1762
|
+
__node_base_pointer __parent;
|
1763
|
+
__node_base_pointer& __child = __find_leaf_high(__parent, __h->__value_);
|
1764
|
+
__insert_node_at(__parent, __child, __h.get());
|
1765
|
+
return iterator(static_cast<__node_pointer>(__h.release()));
|
1766
|
+
}
|
1767
|
+
|
1768
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1769
|
+
template <class... _Args>
|
1770
|
+
typename __tree<_Tp, _Compare, _Allocator>::iterator
|
1771
|
+
__tree<_Tp, _Compare, _Allocator>::__emplace_hint_multi(const_iterator __p,
|
1772
|
+
_Args&&... __args)
|
1773
|
+
{
|
1774
|
+
__node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
|
1775
|
+
__node_base_pointer __parent;
|
1776
|
+
__node_base_pointer& __child = __find_leaf(__p, __parent, __h->__value_);
|
1777
|
+
__insert_node_at(__parent, __child, __h.get());
|
1778
|
+
return iterator(static_cast<__node_pointer>(__h.release()));
|
1779
|
+
}
|
1780
|
+
|
1781
|
+
#endif // _LIBCPP_HAS_NO_VARIADICS
|
1782
|
+
|
1783
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1784
|
+
template <class _Vp>
|
1785
|
+
pair<typename __tree<_Tp, _Compare, _Allocator>::iterator, bool>
|
1786
|
+
__tree<_Tp, _Compare, _Allocator>::__insert_unique(_Vp&& __v)
|
1787
|
+
{
|
1788
|
+
__node_holder __h = __construct_node(_VSTD::forward<_Vp>(__v));
|
1789
|
+
pair<iterator, bool> __r = __node_insert_unique(__h.get());
|
1790
|
+
if (__r.second)
|
1791
|
+
__h.release();
|
1792
|
+
return __r;
|
1793
|
+
}
|
1794
|
+
|
1795
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1796
|
+
template <class _Vp>
|
1797
|
+
typename __tree<_Tp, _Compare, _Allocator>::iterator
|
1798
|
+
__tree<_Tp, _Compare, _Allocator>::__insert_unique(const_iterator __p, _Vp&& __v)
|
1799
|
+
{
|
1800
|
+
__node_holder __h = __construct_node(_VSTD::forward<_Vp>(__v));
|
1801
|
+
iterator __r = __node_insert_unique(__p, __h.get());
|
1802
|
+
if (__r.__ptr_ == __h.get())
|
1803
|
+
__h.release();
|
1804
|
+
return __r;
|
1805
|
+
}
|
1806
|
+
|
1807
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1808
|
+
template <class _Vp>
|
1809
|
+
typename __tree<_Tp, _Compare, _Allocator>::iterator
|
1810
|
+
__tree<_Tp, _Compare, _Allocator>::__insert_multi(_Vp&& __v)
|
1811
|
+
{
|
1812
|
+
__node_holder __h = __construct_node(_VSTD::forward<_Vp>(__v));
|
1813
|
+
__node_base_pointer __parent;
|
1814
|
+
__node_base_pointer& __child = __find_leaf_high(__parent, __h->__value_);
|
1815
|
+
__insert_node_at(__parent, __child, __h.get());
|
1816
|
+
return iterator(__h.release());
|
1817
|
+
}
|
1818
|
+
|
1819
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1820
|
+
template <class _Vp>
|
1821
|
+
typename __tree<_Tp, _Compare, _Allocator>::iterator
|
1822
|
+
__tree<_Tp, _Compare, _Allocator>::__insert_multi(const_iterator __p, _Vp&& __v)
|
1823
|
+
{
|
1824
|
+
__node_holder __h = __construct_node(_VSTD::forward<_Vp>(__v));
|
1825
|
+
__node_base_pointer __parent;
|
1826
|
+
__node_base_pointer& __child = __find_leaf(__p, __parent, __h->__value_);
|
1827
|
+
__insert_node_at(__parent, __child, __h.get());
|
1828
|
+
return iterator(__h.release());
|
1829
|
+
}
|
1830
|
+
|
1831
|
+
#else // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
1832
|
+
|
1833
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1834
|
+
typename __tree<_Tp, _Compare, _Allocator>::__node_holder
|
1835
|
+
__tree<_Tp, _Compare, _Allocator>::__construct_node(const value_type& __v)
|
1836
|
+
{
|
1837
|
+
__node_allocator& __na = __node_alloc();
|
1838
|
+
__node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
|
1839
|
+
__node_traits::construct(__na, _VSTD::addressof(__h->__value_), __v);
|
1840
|
+
__h.get_deleter().__value_constructed = true;
|
1841
|
+
return _VSTD::move(__h);
|
1842
|
+
}
|
1843
|
+
|
1844
|
+
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
1845
|
+
|
1846
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1847
|
+
pair<typename __tree<_Tp, _Compare, _Allocator>::iterator, bool>
|
1848
|
+
__tree<_Tp, _Compare, _Allocator>::__insert_unique(const value_type& __v)
|
1849
|
+
{
|
1850
|
+
__node_base_pointer __parent;
|
1851
|
+
__node_base_pointer& __child = __find_equal(__parent, __v);
|
1852
|
+
__node_pointer __r = static_cast<__node_pointer>(__child);
|
1853
|
+
bool __inserted = false;
|
1854
|
+
if (__child == nullptr)
|
1855
|
+
{
|
1856
|
+
__node_holder __h = __construct_node(__v);
|
1857
|
+
__insert_node_at(__parent, __child, __h.get());
|
1858
|
+
__r = __h.release();
|
1859
|
+
__inserted = true;
|
1860
|
+
}
|
1861
|
+
return pair<iterator, bool>(iterator(__r), __inserted);
|
1862
|
+
}
|
1863
|
+
|
1864
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1865
|
+
typename __tree<_Tp, _Compare, _Allocator>::iterator
|
1866
|
+
__tree<_Tp, _Compare, _Allocator>::__insert_unique(const_iterator __p, const value_type& __v)
|
1867
|
+
{
|
1868
|
+
__node_base_pointer __parent;
|
1869
|
+
__node_base_pointer& __child = __find_equal(__p, __parent, __v);
|
1870
|
+
__node_pointer __r = static_cast<__node_pointer>(__child);
|
1871
|
+
if (__child == nullptr)
|
1872
|
+
{
|
1873
|
+
__node_holder __h = __construct_node(__v);
|
1874
|
+
__insert_node_at(__parent, __child, __h.get());
|
1875
|
+
__r = __h.release();
|
1876
|
+
}
|
1877
|
+
return iterator(__r);
|
1878
|
+
}
|
1879
|
+
|
1880
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1881
|
+
typename __tree<_Tp, _Compare, _Allocator>::iterator
|
1882
|
+
__tree<_Tp, _Compare, _Allocator>::__insert_multi(const value_type& __v)
|
1883
|
+
{
|
1884
|
+
__node_base_pointer __parent;
|
1885
|
+
__node_base_pointer& __child = __find_leaf_high(__parent, __v);
|
1886
|
+
__node_holder __h = __construct_node(__v);
|
1887
|
+
__insert_node_at(__parent, __child, __h.get());
|
1888
|
+
return iterator(__h.release());
|
1889
|
+
}
|
1890
|
+
|
1891
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1892
|
+
typename __tree<_Tp, _Compare, _Allocator>::iterator
|
1893
|
+
__tree<_Tp, _Compare, _Allocator>::__insert_multi(const_iterator __p, const value_type& __v)
|
1894
|
+
{
|
1895
|
+
__node_base_pointer __parent;
|
1896
|
+
__node_base_pointer& __child = __find_leaf(__p, __parent, __v);
|
1897
|
+
__node_holder __h = __construct_node(__v);
|
1898
|
+
__insert_node_at(__parent, __child, __h.get());
|
1899
|
+
return iterator(__h.release());
|
1900
|
+
}
|
1901
|
+
|
1902
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1903
|
+
pair<typename __tree<_Tp, _Compare, _Allocator>::iterator, bool>
|
1904
|
+
__tree<_Tp, _Compare, _Allocator>::__node_insert_unique(__node_pointer __nd)
|
1905
|
+
{
|
1906
|
+
__node_base_pointer __parent;
|
1907
|
+
__node_base_pointer& __child = __find_equal(__parent, __nd->__value_);
|
1908
|
+
__node_pointer __r = static_cast<__node_pointer>(__child);
|
1909
|
+
bool __inserted = false;
|
1910
|
+
if (__child == nullptr)
|
1911
|
+
{
|
1912
|
+
__insert_node_at(__parent, __child, __nd);
|
1913
|
+
__r = __nd;
|
1914
|
+
__inserted = true;
|
1915
|
+
}
|
1916
|
+
return pair<iterator, bool>(iterator(__r), __inserted);
|
1917
|
+
}
|
1918
|
+
|
1919
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1920
|
+
typename __tree<_Tp, _Compare, _Allocator>::iterator
|
1921
|
+
__tree<_Tp, _Compare, _Allocator>::__node_insert_unique(const_iterator __p,
|
1922
|
+
__node_pointer __nd)
|
1923
|
+
{
|
1924
|
+
__node_base_pointer __parent;
|
1925
|
+
__node_base_pointer& __child = __find_equal(__p, __parent, __nd->__value_);
|
1926
|
+
__node_pointer __r = static_cast<__node_pointer>(__child);
|
1927
|
+
if (__child == nullptr)
|
1928
|
+
{
|
1929
|
+
__insert_node_at(__parent, __child, __nd);
|
1930
|
+
__r = __nd;
|
1931
|
+
}
|
1932
|
+
return iterator(__r);
|
1933
|
+
}
|
1934
|
+
|
1935
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1936
|
+
typename __tree<_Tp, _Compare, _Allocator>::iterator
|
1937
|
+
__tree<_Tp, _Compare, _Allocator>::__node_insert_multi(__node_pointer __nd)
|
1938
|
+
{
|
1939
|
+
__node_base_pointer __parent;
|
1940
|
+
__node_base_pointer& __child = __find_leaf_high(__parent, __nd->__value_);
|
1941
|
+
__insert_node_at(__parent, __child, __nd);
|
1942
|
+
return iterator(__nd);
|
1943
|
+
}
|
1944
|
+
|
1945
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1946
|
+
typename __tree<_Tp, _Compare, _Allocator>::iterator
|
1947
|
+
__tree<_Tp, _Compare, _Allocator>::__node_insert_multi(const_iterator __p,
|
1948
|
+
__node_pointer __nd)
|
1949
|
+
{
|
1950
|
+
__node_base_pointer __parent;
|
1951
|
+
__node_base_pointer& __child = __find_leaf(__p, __parent, __nd->__value_);
|
1952
|
+
__insert_node_at(__parent, __child, __nd);
|
1953
|
+
return iterator(__nd);
|
1954
|
+
}
|
1955
|
+
|
1956
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1957
|
+
typename __tree<_Tp, _Compare, _Allocator>::iterator
|
1958
|
+
__tree<_Tp, _Compare, _Allocator>::erase(const_iterator __p)
|
1959
|
+
{
|
1960
|
+
__node_pointer __np = const_cast<__node_pointer>(__p.__ptr_);
|
1961
|
+
iterator __r(__np);
|
1962
|
+
++__r;
|
1963
|
+
if (__begin_node() == __np)
|
1964
|
+
__begin_node() = __r.__ptr_;
|
1965
|
+
--size();
|
1966
|
+
__node_allocator& __na = __node_alloc();
|
1967
|
+
__node_traits::destroy(__na, const_cast<value_type*>(_VSTD::addressof(*__p)));
|
1968
|
+
__tree_remove(__end_node()->__left_,
|
1969
|
+
static_cast<__node_base_pointer>(__np));
|
1970
|
+
__node_traits::deallocate(__na, __np, 1);
|
1971
|
+
return __r;
|
1972
|
+
}
|
1973
|
+
|
1974
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1975
|
+
typename __tree<_Tp, _Compare, _Allocator>::iterator
|
1976
|
+
__tree<_Tp, _Compare, _Allocator>::erase(const_iterator __f, const_iterator __l)
|
1977
|
+
{
|
1978
|
+
while (__f != __l)
|
1979
|
+
__f = erase(__f);
|
1980
|
+
return iterator(const_cast<__node_pointer>(__l.__ptr_));
|
1981
|
+
}
|
1982
|
+
|
1983
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1984
|
+
template <class _Key>
|
1985
|
+
typename __tree<_Tp, _Compare, _Allocator>::size_type
|
1986
|
+
__tree<_Tp, _Compare, _Allocator>::__erase_unique(const _Key& __k)
|
1987
|
+
{
|
1988
|
+
iterator __i = find(__k);
|
1989
|
+
if (__i == end())
|
1990
|
+
return 0;
|
1991
|
+
erase(__i);
|
1992
|
+
return 1;
|
1993
|
+
}
|
1994
|
+
|
1995
|
+
template <class _Tp, class _Compare, class _Allocator>
|
1996
|
+
template <class _Key>
|
1997
|
+
typename __tree<_Tp, _Compare, _Allocator>::size_type
|
1998
|
+
__tree<_Tp, _Compare, _Allocator>::__erase_multi(const _Key& __k)
|
1999
|
+
{
|
2000
|
+
pair<iterator, iterator> __p = __equal_range_multi(__k);
|
2001
|
+
size_type __r = 0;
|
2002
|
+
for (; __p.first != __p.second; ++__r)
|
2003
|
+
__p.first = erase(__p.first);
|
2004
|
+
return __r;
|
2005
|
+
}
|
2006
|
+
|
2007
|
+
template <class _Tp, class _Compare, class _Allocator>
|
2008
|
+
template <class _Key>
|
2009
|
+
typename __tree<_Tp, _Compare, _Allocator>::iterator
|
2010
|
+
__tree<_Tp, _Compare, _Allocator>::find(const _Key& __v)
|
2011
|
+
{
|
2012
|
+
iterator __p = __lower_bound(__v, __root(), __end_node());
|
2013
|
+
if (__p != end() && !value_comp()(__v, *__p))
|
2014
|
+
return __p;
|
2015
|
+
return end();
|
2016
|
+
}
|
2017
|
+
|
2018
|
+
template <class _Tp, class _Compare, class _Allocator>
|
2019
|
+
template <class _Key>
|
2020
|
+
typename __tree<_Tp, _Compare, _Allocator>::const_iterator
|
2021
|
+
__tree<_Tp, _Compare, _Allocator>::find(const _Key& __v) const
|
2022
|
+
{
|
2023
|
+
const_iterator __p = __lower_bound(__v, __root(), __end_node());
|
2024
|
+
if (__p != end() && !value_comp()(__v, *__p))
|
2025
|
+
return __p;
|
2026
|
+
return end();
|
2027
|
+
}
|
2028
|
+
|
2029
|
+
template <class _Tp, class _Compare, class _Allocator>
|
2030
|
+
template <class _Key>
|
2031
|
+
typename __tree<_Tp, _Compare, _Allocator>::size_type
|
2032
|
+
__tree<_Tp, _Compare, _Allocator>::__count_unique(const _Key& __k) const
|
2033
|
+
{
|
2034
|
+
__node_const_pointer __result = __end_node();
|
2035
|
+
__node_const_pointer __rt = __root();
|
2036
|
+
while (__rt != nullptr)
|
2037
|
+
{
|
2038
|
+
if (value_comp()(__k, __rt->__value_))
|
2039
|
+
{
|
2040
|
+
__result = __rt;
|
2041
|
+
__rt = static_cast<__node_const_pointer>(__rt->__left_);
|
2042
|
+
}
|
2043
|
+
else if (value_comp()(__rt->__value_, __k))
|
2044
|
+
__rt = static_cast<__node_const_pointer>(__rt->__right_);
|
2045
|
+
else
|
2046
|
+
return 1;
|
2047
|
+
}
|
2048
|
+
return 0;
|
2049
|
+
}
|
2050
|
+
|
2051
|
+
template <class _Tp, class _Compare, class _Allocator>
|
2052
|
+
template <class _Key>
|
2053
|
+
typename __tree<_Tp, _Compare, _Allocator>::size_type
|
2054
|
+
__tree<_Tp, _Compare, _Allocator>::__count_multi(const _Key& __k) const
|
2055
|
+
{
|
2056
|
+
typedef pair<const_iterator, const_iterator> _Pp;
|
2057
|
+
__node_const_pointer __result = __end_node();
|
2058
|
+
__node_const_pointer __rt = __root();
|
2059
|
+
while (__rt != nullptr)
|
2060
|
+
{
|
2061
|
+
if (value_comp()(__k, __rt->__value_))
|
2062
|
+
{
|
2063
|
+
__result = __rt;
|
2064
|
+
__rt = static_cast<__node_const_pointer>(__rt->__left_);
|
2065
|
+
}
|
2066
|
+
else if (value_comp()(__rt->__value_, __k))
|
2067
|
+
__rt = static_cast<__node_const_pointer>(__rt->__right_);
|
2068
|
+
else
|
2069
|
+
return _VSTD::distance(
|
2070
|
+
__lower_bound(__k, static_cast<__node_const_pointer>(__rt->__left_), __rt),
|
2071
|
+
__upper_bound(__k, static_cast<__node_const_pointer>(__rt->__right_), __result)
|
2072
|
+
);
|
2073
|
+
}
|
2074
|
+
return 0;
|
2075
|
+
}
|
2076
|
+
|
2077
|
+
template <class _Tp, class _Compare, class _Allocator>
|
2078
|
+
template <class _Key>
|
2079
|
+
typename __tree<_Tp, _Compare, _Allocator>::iterator
|
2080
|
+
__tree<_Tp, _Compare, _Allocator>::__lower_bound(const _Key& __v,
|
2081
|
+
__node_pointer __root,
|
2082
|
+
__node_pointer __result)
|
2083
|
+
{
|
2084
|
+
while (__root != nullptr)
|
2085
|
+
{
|
2086
|
+
if (!value_comp()(__root->__value_, __v))
|
2087
|
+
{
|
2088
|
+
__result = __root;
|
2089
|
+
__root = static_cast<__node_pointer>(__root->__left_);
|
2090
|
+
}
|
2091
|
+
else
|
2092
|
+
__root = static_cast<__node_pointer>(__root->__right_);
|
2093
|
+
}
|
2094
|
+
return iterator(__result);
|
2095
|
+
}
|
2096
|
+
|
2097
|
+
template <class _Tp, class _Compare, class _Allocator>
|
2098
|
+
template <class _Key>
|
2099
|
+
typename __tree<_Tp, _Compare, _Allocator>::const_iterator
|
2100
|
+
__tree<_Tp, _Compare, _Allocator>::__lower_bound(const _Key& __v,
|
2101
|
+
__node_const_pointer __root,
|
2102
|
+
__node_const_pointer __result) const
|
2103
|
+
{
|
2104
|
+
while (__root != nullptr)
|
2105
|
+
{
|
2106
|
+
if (!value_comp()(__root->__value_, __v))
|
2107
|
+
{
|
2108
|
+
__result = __root;
|
2109
|
+
__root = static_cast<__node_const_pointer>(__root->__left_);
|
2110
|
+
}
|
2111
|
+
else
|
2112
|
+
__root = static_cast<__node_const_pointer>(__root->__right_);
|
2113
|
+
}
|
2114
|
+
return const_iterator(__result);
|
2115
|
+
}
|
2116
|
+
|
2117
|
+
template <class _Tp, class _Compare, class _Allocator>
|
2118
|
+
template <class _Key>
|
2119
|
+
typename __tree<_Tp, _Compare, _Allocator>::iterator
|
2120
|
+
__tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v,
|
2121
|
+
__node_pointer __root,
|
2122
|
+
__node_pointer __result)
|
2123
|
+
{
|
2124
|
+
while (__root != nullptr)
|
2125
|
+
{
|
2126
|
+
if (value_comp()(__v, __root->__value_))
|
2127
|
+
{
|
2128
|
+
__result = __root;
|
2129
|
+
__root = static_cast<__node_pointer>(__root->__left_);
|
2130
|
+
}
|
2131
|
+
else
|
2132
|
+
__root = static_cast<__node_pointer>(__root->__right_);
|
2133
|
+
}
|
2134
|
+
return iterator(__result);
|
2135
|
+
}
|
2136
|
+
|
2137
|
+
template <class _Tp, class _Compare, class _Allocator>
|
2138
|
+
template <class _Key>
|
2139
|
+
typename __tree<_Tp, _Compare, _Allocator>::const_iterator
|
2140
|
+
__tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v,
|
2141
|
+
__node_const_pointer __root,
|
2142
|
+
__node_const_pointer __result) const
|
2143
|
+
{
|
2144
|
+
while (__root != nullptr)
|
2145
|
+
{
|
2146
|
+
if (value_comp()(__v, __root->__value_))
|
2147
|
+
{
|
2148
|
+
__result = __root;
|
2149
|
+
__root = static_cast<__node_const_pointer>(__root->__left_);
|
2150
|
+
}
|
2151
|
+
else
|
2152
|
+
__root = static_cast<__node_const_pointer>(__root->__right_);
|
2153
|
+
}
|
2154
|
+
return const_iterator(__result);
|
2155
|
+
}
|
2156
|
+
|
2157
|
+
template <class _Tp, class _Compare, class _Allocator>
|
2158
|
+
template <class _Key>
|
2159
|
+
pair<typename __tree<_Tp, _Compare, _Allocator>::iterator,
|
2160
|
+
typename __tree<_Tp, _Compare, _Allocator>::iterator>
|
2161
|
+
__tree<_Tp, _Compare, _Allocator>::__equal_range_unique(const _Key& __k)
|
2162
|
+
{
|
2163
|
+
typedef pair<iterator, iterator> _Pp;
|
2164
|
+
__node_pointer __result = __end_node();
|
2165
|
+
__node_pointer __rt = __root();
|
2166
|
+
while (__rt != nullptr)
|
2167
|
+
{
|
2168
|
+
if (value_comp()(__k, __rt->__value_))
|
2169
|
+
{
|
2170
|
+
__result = __rt;
|
2171
|
+
__rt = static_cast<__node_pointer>(__rt->__left_);
|
2172
|
+
}
|
2173
|
+
else if (value_comp()(__rt->__value_, __k))
|
2174
|
+
__rt = static_cast<__node_pointer>(__rt->__right_);
|
2175
|
+
else
|
2176
|
+
return _Pp(iterator(__rt),
|
2177
|
+
iterator(
|
2178
|
+
__rt->__right_ != nullptr ?
|
2179
|
+
static_cast<__node_pointer>(__tree_min(__rt->__right_))
|
2180
|
+
: __result));
|
2181
|
+
}
|
2182
|
+
return _Pp(iterator(__result), iterator(__result));
|
2183
|
+
}
|
2184
|
+
|
2185
|
+
template <class _Tp, class _Compare, class _Allocator>
|
2186
|
+
template <class _Key>
|
2187
|
+
pair<typename __tree<_Tp, _Compare, _Allocator>::const_iterator,
|
2188
|
+
typename __tree<_Tp, _Compare, _Allocator>::const_iterator>
|
2189
|
+
__tree<_Tp, _Compare, _Allocator>::__equal_range_unique(const _Key& __k) const
|
2190
|
+
{
|
2191
|
+
typedef pair<const_iterator, const_iterator> _Pp;
|
2192
|
+
__node_const_pointer __result = __end_node();
|
2193
|
+
__node_const_pointer __rt = __root();
|
2194
|
+
while (__rt != nullptr)
|
2195
|
+
{
|
2196
|
+
if (value_comp()(__k, __rt->__value_))
|
2197
|
+
{
|
2198
|
+
__result = __rt;
|
2199
|
+
__rt = static_cast<__node_const_pointer>(__rt->__left_);
|
2200
|
+
}
|
2201
|
+
else if (value_comp()(__rt->__value_, __k))
|
2202
|
+
__rt = static_cast<__node_const_pointer>(__rt->__right_);
|
2203
|
+
else
|
2204
|
+
return _Pp(const_iterator(__rt),
|
2205
|
+
const_iterator(
|
2206
|
+
__rt->__right_ != nullptr ?
|
2207
|
+
static_cast<__node_const_pointer>(__tree_min(__rt->__right_))
|
2208
|
+
: __result));
|
2209
|
+
}
|
2210
|
+
return _Pp(const_iterator(__result), const_iterator(__result));
|
2211
|
+
}
|
2212
|
+
|
2213
|
+
template <class _Tp, class _Compare, class _Allocator>
|
2214
|
+
template <class _Key>
|
2215
|
+
pair<typename __tree<_Tp, _Compare, _Allocator>::iterator,
|
2216
|
+
typename __tree<_Tp, _Compare, _Allocator>::iterator>
|
2217
|
+
__tree<_Tp, _Compare, _Allocator>::__equal_range_multi(const _Key& __k)
|
2218
|
+
{
|
2219
|
+
typedef pair<iterator, iterator> _Pp;
|
2220
|
+
__node_pointer __result = __end_node();
|
2221
|
+
__node_pointer __rt = __root();
|
2222
|
+
while (__rt != nullptr)
|
2223
|
+
{
|
2224
|
+
if (value_comp()(__k, __rt->__value_))
|
2225
|
+
{
|
2226
|
+
__result = __rt;
|
2227
|
+
__rt = static_cast<__node_pointer>(__rt->__left_);
|
2228
|
+
}
|
2229
|
+
else if (value_comp()(__rt->__value_, __k))
|
2230
|
+
__rt = static_cast<__node_pointer>(__rt->__right_);
|
2231
|
+
else
|
2232
|
+
return _Pp(__lower_bound(__k, static_cast<__node_pointer>(__rt->__left_), __rt),
|
2233
|
+
__upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result));
|
2234
|
+
}
|
2235
|
+
return _Pp(iterator(__result), iterator(__result));
|
2236
|
+
}
|
2237
|
+
|
2238
|
+
template <class _Tp, class _Compare, class _Allocator>
|
2239
|
+
template <class _Key>
|
2240
|
+
pair<typename __tree<_Tp, _Compare, _Allocator>::const_iterator,
|
2241
|
+
typename __tree<_Tp, _Compare, _Allocator>::const_iterator>
|
2242
|
+
__tree<_Tp, _Compare, _Allocator>::__equal_range_multi(const _Key& __k) const
|
2243
|
+
{
|
2244
|
+
typedef pair<const_iterator, const_iterator> _Pp;
|
2245
|
+
__node_const_pointer __result = __end_node();
|
2246
|
+
__node_const_pointer __rt = __root();
|
2247
|
+
while (__rt != nullptr)
|
2248
|
+
{
|
2249
|
+
if (value_comp()(__k, __rt->__value_))
|
2250
|
+
{
|
2251
|
+
__result = __rt;
|
2252
|
+
__rt = static_cast<__node_const_pointer>(__rt->__left_);
|
2253
|
+
}
|
2254
|
+
else if (value_comp()(__rt->__value_, __k))
|
2255
|
+
__rt = static_cast<__node_const_pointer>(__rt->__right_);
|
2256
|
+
else
|
2257
|
+
return _Pp(__lower_bound(__k, static_cast<__node_const_pointer>(__rt->__left_), __rt),
|
2258
|
+
__upper_bound(__k, static_cast<__node_const_pointer>(__rt->__right_), __result));
|
2259
|
+
}
|
2260
|
+
return _Pp(const_iterator(__result), const_iterator(__result));
|
2261
|
+
}
|
2262
|
+
|
2263
|
+
template <class _Tp, class _Compare, class _Allocator>
|
2264
|
+
typename __tree<_Tp, _Compare, _Allocator>::__node_holder
|
2265
|
+
__tree<_Tp, _Compare, _Allocator>::remove(const_iterator __p) _NOEXCEPT
|
2266
|
+
{
|
2267
|
+
__node_pointer __np = const_cast<__node_pointer>(__p.__ptr_);
|
2268
|
+
if (__begin_node() == __np)
|
2269
|
+
{
|
2270
|
+
if (__np->__right_ != nullptr)
|
2271
|
+
__begin_node() = static_cast<__node_pointer>(__np->__right_);
|
2272
|
+
else
|
2273
|
+
__begin_node() = static_cast<__node_pointer>(__np->__parent_);
|
2274
|
+
}
|
2275
|
+
--size();
|
2276
|
+
__tree_remove(__end_node()->__left_,
|
2277
|
+
static_cast<__node_base_pointer>(__np));
|
2278
|
+
return __node_holder(__np, _Dp(__node_alloc()));
|
2279
|
+
}
|
2280
|
+
|
2281
|
+
template <class _Tp, class _Compare, class _Allocator>
|
2282
|
+
inline _LIBCPP_INLINE_VISIBILITY
|
2283
|
+
void
|
2284
|
+
swap(__tree<_Tp, _Compare, _Allocator>& __x,
|
2285
|
+
__tree<_Tp, _Compare, _Allocator>& __y)
|
2286
|
+
_NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
|
2287
|
+
{
|
2288
|
+
__x.swap(__y);
|
2289
|
+
}
|
2290
|
+
|
2291
|
+
_LIBCPP_END_NAMESPACE_STD
|
2292
|
+
|
2293
|
+
#endif // _LIBCPP___TREE
|