Question: I am developing a localhost project that keeps sending requests to your-mime-site.com. 

I have included these jquery plugins:

1. jQuery
2. jQuery.form
3. jQuery.validate
4. jQuery.ui

Everything else I have coded myself.

I have tried to use NetBeans to search the project for the string "your-meme-site" but it says that some lines are too long to be searched.

Does anybody know why or how this is happening?

Answer: 
Here's a solution using -XImplicitParams in GHC

```
{-# LANGUAGE ImplicitParams #-}
module ImplicitTabs where

data Tree = Empty | Node Int (Tree) (Tree) deriving (Show)
tree = Node 4 (Node 3 Empty (Node 2 Empty Empty)) Empty                                         

tab :: (?tab_level :: Int) => String
tab = replicate (2 * ?tab_level) ' '

printTree :: (?tab_level :: Int) => Tree -> String
printTree x = let 
    ?tab_level = ?tab_level + 1
  in case x of
    Node num treeA treeB -> tab ++ show num ++ "\n" ++ tab ++ printTree treeA ++ "\n" ++ tab ++ printTree treeB
    Empty -> tab ++ "Empty" 

main = let ?tab_level = -1 in putStrLn $ printTree tree

> runhaskell implicit-tabulation.hs 
4
  3
      Empty
      2
          Empty
          Empty
  Empty

```
Ok I think I got it to work. 

```
printTree :: Tree -> String                                                                                                                                                                                     
printTree x = printT 0 x                                                                                                                                                                                                                   

space x = take x $ cycle " "                                                                                                                                                                                    

printT :: Int -> Tree -> String                                                                                                                                                                                 
printT num x =                                                                                                                                                                                                  
  case x of                                                                                                                                                                                                     
    (Node o treeA treeB) -> show o ++                                                                                                                                                                           
                          "\n" ++                                                                                                                                                                               
                          space num ++                                                                                                                                                                          
                          printT (num+1) treeA ++                                                                                                                                                               
                          "\n" ++                                                                                                                                                                               
                          space num ++                                                                                                                                                                          
                          printT (num+1) treeB                                                                                                                                                                  
    Empty -> "Empty"  

```