This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
      Learn more about bidirectional Unicode characters
    
  
  
    
  | function Vertex(name) { | |
| this.name = name; | |
| this.index = null; | |
| this.lowlink = null; | |
| this.onStack = false; | |
| this.children = []; | |
| } | |
| function TarjanRunner() { | 
  
    
      This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
      Learn more about bidirectional Unicode characters
    
  
  
    
  | println object.properties | |
| .sort{it.key} | |
| .collect{it} | |
| .findAll{!['class', 'active'].contains(it.key)} | |
| .join('\n') | 
  
    
      This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
      Learn more about bidirectional Unicode characters
    
  
  
    
  | function getGreatestCommonDivisor(x, y) { | |
| while(x !== 0 && y !== 0) { | |
| if(x > y) { | |
| x %= y; | |
| } else { | |
| y %= x; | |
| } | |
| } | |
| return Math.max(x, y); | |
| } | 
  
    
      This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
      Learn more about bidirectional Unicode characters
    
  
  
    
  | function getGreatestCommonDivisor(x, y) { | |
| while(x !== 0 && y !== 0) { | |
| if(x > y) { | |
| x %= y; | |
| } else { | |
| y %= x; | |
| } | |
| } | |
| return Math.max(x, y); | |
| } | 
  
    
      This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
      Learn more about bidirectional Unicode characters
    
  
  
    
  | function maxContiguousSubArray(array) { | |
| var maxEndingHere = array[0]; | |
| var maxSoFar = array[0]; | |
| for(var i = 1; i < array.length; i++) { | |
| maxEndingHere = Math.max(array[i], maxEndingHere + array[i]); | |
| maxSoFar = Math.max(maxSoFar, maxEndingHere); | |
| } | |
| return maxSoFar; | |
| } | 
  
    
      This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
      Learn more about bidirectional Unicode characters
    
  
  
    
  | public class NestedTry { | |
| public static void main(String[] args) { | |
| try { | |
| try { | |
| Long one = Long.parseLong("1"); | |
| } catch(NumberFormatException e) { | |
| System.out.println("First block!"); | |
| } | |
| Long two = Long.parseLong("2"); | 
  
    
      This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
      Learn more about bidirectional Unicode characters
    
  
  
    
  | { | |
| "auto_find_in_selection": true, | |
| "color_scheme": "Packages/Boxy Theme/schemes/Boxy Solarized Dark.tmTheme", | |
| "font_face": "Ubuntu Mono", | |
| "font_size": 13, | |
| "ignored_packages": | |
| [ | |
| "Vintage" | |
| ], | |
| "show_encoding": true, |