Wed, 31 Dec 2014 06:09:35 +0100
Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.
michael@0 | 1 | /* -*- Mode: Javascript; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ |
michael@0 | 2 | /* vim: set ts=2 et sw=2 tw=80: */ |
michael@0 | 3 | /* Any copyright is dedicated to the Public Domain. |
michael@0 | 4 | http://creativecommons.org/publicdomain/zero/1.0/ */ |
michael@0 | 5 | |
michael@0 | 6 | const Cu = Components.utils; |
michael@0 | 7 | let {Loader} = Cu.import("resource://gre/modules/commonjs/toolkit/loader.js", {}); |
michael@0 | 8 | |
michael@0 | 9 | let loader = new Loader.Loader({ |
michael@0 | 10 | paths: { |
michael@0 | 11 | "": "resource://gre/modules/commonjs/", |
michael@0 | 12 | "devtools": "resource:///modules/devtools", |
michael@0 | 13 | }, |
michael@0 | 14 | globals: {}, |
michael@0 | 15 | }); |
michael@0 | 16 | let require = Loader.Require(loader, { id: "undo-test" }) |
michael@0 | 17 | |
michael@0 | 18 | let {UndoStack} = require("devtools/shared/undo"); |
michael@0 | 19 | |
michael@0 | 20 | const MAX_SIZE = 5; |
michael@0 | 21 | |
michael@0 | 22 | function run_test() |
michael@0 | 23 | { |
michael@0 | 24 | let str = ""; |
michael@0 | 25 | let stack = new UndoStack(MAX_SIZE); |
michael@0 | 26 | |
michael@0 | 27 | function add(ch) { |
michael@0 | 28 | stack.do(function() { |
michael@0 | 29 | str += ch; |
michael@0 | 30 | }, function() { |
michael@0 | 31 | str = str.slice(0, -1); |
michael@0 | 32 | }); |
michael@0 | 33 | } |
michael@0 | 34 | |
michael@0 | 35 | do_check_false(stack.canUndo()); |
michael@0 | 36 | do_check_false(stack.canRedo()); |
michael@0 | 37 | |
michael@0 | 38 | // Check adding up to the limit of the size |
michael@0 | 39 | add("a"); |
michael@0 | 40 | do_check_true(stack.canUndo()); |
michael@0 | 41 | do_check_false(stack.canRedo()); |
michael@0 | 42 | |
michael@0 | 43 | add("b"); |
michael@0 | 44 | add("c"); |
michael@0 | 45 | add("d"); |
michael@0 | 46 | add("e"); |
michael@0 | 47 | |
michael@0 | 48 | do_check_eq(str, "abcde"); |
michael@0 | 49 | |
michael@0 | 50 | // Check a simple undo+redo |
michael@0 | 51 | stack.undo(); |
michael@0 | 52 | |
michael@0 | 53 | do_check_eq(str, "abcd"); |
michael@0 | 54 | do_check_true(stack.canRedo()); |
michael@0 | 55 | |
michael@0 | 56 | stack.redo(); |
michael@0 | 57 | do_check_eq(str, "abcde") |
michael@0 | 58 | do_check_false(stack.canRedo()); |
michael@0 | 59 | |
michael@0 | 60 | // Check an undo followed by a new action |
michael@0 | 61 | stack.undo(); |
michael@0 | 62 | do_check_eq(str, "abcd"); |
michael@0 | 63 | |
michael@0 | 64 | add("q"); |
michael@0 | 65 | do_check_eq(str, "abcdq"); |
michael@0 | 66 | do_check_false(stack.canRedo()); |
michael@0 | 67 | |
michael@0 | 68 | stack.undo(); |
michael@0 | 69 | do_check_eq(str, "abcd"); |
michael@0 | 70 | stack.redo(); |
michael@0 | 71 | do_check_eq(str, "abcdq"); |
michael@0 | 72 | |
michael@0 | 73 | // Revert back to the beginning of the queue... |
michael@0 | 74 | while (stack.canUndo()) { |
michael@0 | 75 | stack.undo(); |
michael@0 | 76 | } |
michael@0 | 77 | do_check_eq(str, ""); |
michael@0 | 78 | |
michael@0 | 79 | // Now put it all back.... |
michael@0 | 80 | while (stack.canRedo()) { |
michael@0 | 81 | stack.redo(); |
michael@0 | 82 | } |
michael@0 | 83 | do_check_eq(str, "abcdq"); |
michael@0 | 84 | |
michael@0 | 85 | // Now go over the undo limit... |
michael@0 | 86 | add("1"); |
michael@0 | 87 | add("2"); |
michael@0 | 88 | add("3"); |
michael@0 | 89 | |
michael@0 | 90 | do_check_eq(str, "abcdq123"); |
michael@0 | 91 | |
michael@0 | 92 | // And now undoing the whole stack should only undo 5 actions. |
michael@0 | 93 | while (stack.canUndo()) { |
michael@0 | 94 | stack.undo(); |
michael@0 | 95 | } |
michael@0 | 96 | |
michael@0 | 97 | do_check_eq(str, "abc"); |
michael@0 | 98 | } |