text:
{-# LANGUAGE GeneralizedNewtypeDeriving, TypeSynonymInstances,
    FlexibleInstances#-}
{-
Copyright (C) 2006-2010 John MacFarlane <jgm@berkeley.edu>

This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-}

{- |
   Module      : Text.Pandoc.Parsing
   Copyright   : Copyright (C) 2006-2010 John MacFarlane
   License     : GNU GPL, version 2 or above

   Maintainer  : John MacFarlane <jgm@berkeley.edu>
   Stability   : alpha
   Portability : portable

A utility library with parsers used in pandoc readers.
-}
module Text.Pandoc.Parsing ( (>>~),
                             anyLine,
                             many1Till,
                             notFollowedBy',
                             oneOfStrings,
                             oneOfStringsCI,
                             spaceChar,
                             nonspaceChar,
                             skipSpaces,
                             blankline,
                             blanklines,
                             enclosed,
                             stringAnyCase,
                             parseFromString,
                             lineClump,
                             charsInBalanced,
                             romanNumeral,
                             emailAddress,
                             uri,
                             mathInline,
                             mathDisplay,
                             withHorizDisplacement,
                             withRaw,
                             escaped,
                             characterReference,
                             updateLastStrPos,
                             anyOrderedListMarker,
                             orderedListMarker,
                             charRef,
                             lineBlockLines,
                             tableWith,
                             widthsFromIndices,
                             gridTableWith,
                             readWith,
                             testStringWith,
                             getOption,
                             guardEnabled,
                             guardDisabled,
                             ParserState (..),
                             HasReaderOptions (..),
                             HasHeaderMap (..),
                             HasIdentifierList (..),
                             defaultParserState,
                             HeaderType (..),
                             ParserContext (..),
                             QuoteContext (..),
                             NoteTable,
                             NoteTable',
                             KeyTable,
                             SubstTable,
                             Key (..),
                             toKey,
                             registerHeader,
                             smartPunctuation,
                             withQuoteContext,
                             singleQuoteStart,
                             singleQuoteEnd,
                             doubleQuoteStart,
                             doubleQuoteEnd,
                             ellipses,
                             apostrophe,
                             dash,
                             nested,
                             macro,
                             applyMacros',
                             Parser,
                             F(..),
                             runF,
                             askF,
                             asksF,
                             -- * Re-exports from Text.Pandoc.Parsec
                             runParser,
                             parse,
                             anyToken,
                             getInput,
                             setInput,
                             unexpected,
                             char,
                             letter,
                             digit,
                             alphaNum,
                             skipMany,
                             skipMany1,
                             spaces,
                             space,
                             anyChar,
                             satisfy,
                             newline,
                             string,
                             count,
                             eof,
                             noneOf,
                             oneOf,
                             lookAhead,
                             notFollowedBy,
                             many,
                             many1,
                             manyTill,
                             (<|>),
                             (<?>),
                             choice,
                             try,
                             sepBy,
                             sepBy1,
                             sepEndBy,
                             sepEndBy1,
                             endBy,
                             endBy1,
                             option,
                             optional,
                             optionMaybe,
                             getState,
                             setState,
                             updateState,
                             SourcePos,
                             getPosition,
                             setPosition,
                             sourceColumn,
                             sourceLine,
                             setSourceColumn,
                             setSourceLine,
                             newPos,
                             token
                             )
where

import Text.Pandoc.Definition
import Text.Pandoc.Options
import Text.Pandoc.Builder (Blocks, Inlines, rawBlock, HasMeta(..))
import qualified Text.Pandoc.Builder as B
import Text.Pandoc.XML (fromEntities)
import qualified Text.Pandoc.UTF8 as UTF8 (putStrLn)
import Text.Parsec
import Text.Parsec.Pos (newPos)
import Data.Char ( toLower, toUpper, ord, chr, isAscii, isAlphaNum, isDigit,
                   isHexDigit, isSpace )
import Data.List ( intercalate, transpose )
import Text.Pandoc.Shared
import qualified Data.Map as M
import Text.TeXMath.Macros (applyMacros, Macro, parseMacroDefinitions)
import Text.Pandoc.Compat.TagSoupEntity ( lookupEntity )
import Text.Pandoc.Asciify (toAsciiChar)
import Data.Default
import qualified Data.Set as Set
import Control.Monad.Reader
import Control.Applicative ((*>), (<*), (<$), liftA2)
import Data.Monoid
import Data.Maybe (catMaybes)

type Parser t s = Parsec t s

newtype F a = F { unF :: Reader ParserState a } deriving (Monad, Functor)

runF :: F a -> ParserState -> a
runF = runReader . unF

askF :: F ParserState
askF = F ask

asksF :: (ParserState -> a) -> F a
asksF f = F $ asks f

instance Monoid a => Monoid (F a) where
  mempty = return mempty
  mappend = liftM2 mappend
  mconcat = liftM mconcat . sequence

-- | Like >>, but returns the operation on the left.
-- (Suggested by Tillmann Rendel on Haskell-cafe list.)
(>>~) :: (Monad m) => m a -> m b -> m a
a >>~ b = a >>= \x -> b >> return x

-- | Parse any line of text
anyLine :: Parser [Char] st [Char]
anyLine = do
  -- This is much faster than:
  -- manyTill anyChar newline
  inp <- getInput
  pos <- getPosition
  case break (=='\n') inp of
       (this, '\n':rest) -> do
         -- needed to persuade parsec that this won't match an empty string:
         anyChar
         setInput rest
         setPosition $ incSourceLine (setSourceColumn pos 1) 1
         return this
       _ -> mzero

-- | Like @manyTill@, but reads at least one item.
many1Till :: Parser [tok] st a
          -> Parser [tok] st end
          -> Parser [tok] st [a]
many1Till p end = do
         first <- p
         rest <- manyTill p end
         return (first:rest)

-- | A more general form of @notFollowedBy@.  This one allows any
-- type of parser to be specified, and succeeds only if that parser fails.
-- It does not consume any input.
notFollowedBy' :: Show b => Parser [a] st b -> Parser [a] st ()
notFollowedBy' p  = try $ join $  do  a <- try p
                                      return (unexpected (show a))
                                  <|>
                                  return (return ())
-- (This version due to Andrew Pimlott on the Haskell mailing list.)

oneOfStrings' :: (Char -> Char -> Bool) -> [String] -> Parser [Char] st String
oneOfStrings' _ []   = fail "no strings"
oneOfStrings' matches strs = try $ do
  c <- anyChar
  let strs' = [xs | (x:xs) <- strs, x `matches` c]
  case strs' of
       []  -> fail "not found"
       _   -> (c:) `fmap` oneOfStrings' matches strs'
               <|> if "" `elem` strs'
                      then return [c]
                      else fail "not found"

-- | Parses one of a list of strings.  If the list contains
-- two strings one of which is a prefix of the other, the longer
-- string will be matched if possible.
oneOfStrings :: [String] -> Parser [Char] st String
oneOfStrings = oneOfStrings' (==)

-- | Parses one of a list of strings (tried in order), case insensitive.
oneOfStringsCI :: [String] -> Parser [Char] st String
oneOfStringsCI = oneOfStrings' ciMatch
  where ciMatch x y = toLower' x == toLower' y
        -- this optimizes toLower by checking common ASCII case
        -- first, before calling the expensive unicode-aware
        -- function:
        toLower' c | c >= 'A' && c <= 'Z' = chr (ord c + 32)
                   | isAscii c = c
                   | otherwise = toLower c

-- | Parses a space or tab.
spaceChar :: Parser [Char] st Char
spaceChar = satisfy $ \c -> c == ' ' || c == '\t'

-- | Parses a nonspace, nonnewline character.
nonspaceChar :: Parser [Char] st Char
nonspaceChar = satisfy $ flip notElem ['\t', '\n', ' ', '\r']

-- | Skips zero or more spaces or tabs.
skipSpaces :: Parser [Char] st ()
skipSpaces = skipMany spaceChar

-- | Skips zero or more spaces or tabs, then reads a newline.
blankline :: Parser [Char] st Char
blankline = try $ skipSpaces >> newline

-- | Parses one or more blank lines and returns a string of newlines.
blanklines :: Parser [Char] st [Char]
blanklines = many1 blankline

-- | Parses material enclosed between start and end parsers.
enclosed :: Parser [Char] st t   -- ^ start parser
         -> Parser [Char] st end  -- ^ end parser
         -> Parser [Char] st a    -- ^ content parser (to be used repeatedly)
         -> Parser [Char] st [a]
enclosed start end parser = try $
  start >> notFollowedBy space >> many1Till parser end

-- | Parse string, case insensitive.
stringAnyCase :: [Char] -> Parser [Char] st String
stringAnyCase [] = string ""
stringAnyCase (x:xs) = do
  firstChar <- char (toUpper x) <|> char (toLower x)
  rest <- stringAnyCase xs
  return (firstChar:rest)

-- | Parse contents of 'str' using 'parser' and return result.
parseFromString :: Parser [tok] st a -> [tok] -> Parser [tok] st a
parseFromString parser str = do
  oldPos <- getPosition
  oldInput <- getInput
  setInput str
  result <- parser
  setInput oldInput
  setPosition oldPos
  return result

-- | Parse raw line block up to and including blank lines.
lineClump :: Parser [Char] st String
lineClump = blanklines
          <|> (many1 (notFollowedBy blankline >> anyLine) >>= return . unlines)

-- | Parse a string of characters between an open character
-- and a close character, including text between balanced
-- pairs of open and close, which must be different. For example,
-- @charsInBalanced '(' ')' anyChar@ will parse "(hello (there))"
-- and return "hello (there)".
charsInBalanced :: Char -> Char -> Parser [Char] st Char
                -> Parser [Char] st String
charsInBalanced open close parser = try $ do
  char open
  let isDelim c = c == open || c == close
  raw <- many $  many1 (notFollowedBy (satisfy isDelim) >> parser)
             <|> (do res <- charsInBalanced open close parser
                     return $ [open] ++ res ++ [close])
  char close
  return $ concat raw

-- old charsInBalanced would be:
-- charsInBalanced open close (noneOf "\n" <|> char '\n' >> notFollowedBy blankline)
-- old charsInBalanced' would be:
-- charsInBalanced open close anyChar

-- Auxiliary functions for romanNumeral:

lowercaseRomanDigits :: [Char]
lowercaseRomanDigits = ['i','v','x','l','c','d','m']

uppercaseRomanDigits :: [Char]
uppercaseRomanDigits = map toUpper lowercaseRomanDigits

-- | Parses a roman numeral (uppercase or lowercase), returns number.
romanNumeral :: Bool                  -- ^ Uppercase if true
             -> Parser [Char] st Int
romanNumeral upperCase = do
    let romanDigits = if upperCase
                         then uppercaseRomanDigits
                         else lowercaseRomanDigits
    lookAhead $ oneOf romanDigits
    let [one, five, ten, fifty, hundred, fivehundred, thousand] =
          map char romanDigits
    thousands <- many thousand >>= (return . (1000 *) . length)
    ninehundreds <- option 0 $ try $ hundred >> thousand >> return 900
    fivehundreds <- many fivehundred >>= (return . (500 *) . length)
    fourhundreds <- option 0 $ try $ hundred >> fivehundred >> return 400
    hundreds <- many hundred >>= (return . (100 *) . length)
    nineties <- option 0 $ try $ ten >> hundred >> return 90
    fifties <- many fifty >>= (return . (50 *) . length)
    forties <- option 0 $ try $ ten >> fifty >> return 40
    tens <- many ten >>= (return . (10 *) . length)
    nines <- option 0 $ try $ one >> ten >> return 9
    fives <- many five >>= (return . (5 *) . length)
    fours <- option 0 $ try $ one >> five >> return 4
    ones <- many one >>= (return . length)
    let total = thousands + ninehundreds + fivehundreds + fourhundreds +
                hundreds + nineties + fifties + forties + tens + nines +
                fives + fours + ones
    if total == 0
       then fail "not a roman numeral"
       else return total

-- Parsers for email addresses and URIs

-- | Parses an email address; returns original and corresponding
-- escaped mailto: URI.
emailAddress :: Parser [Char] st (String, String)
emailAddress = try $ liftA2 toResult mailbox (char '@' *> domain)
 where toResult mbox dom = let full = fromEntities $ mbox ++ '@':dom
                           in  (full, escapeURI $ "mailto:" ++ full)
       mailbox           = intercalate "." `fmap` (emailWord `sepby1` dot)
       domain            = intercalate "." `fmap` (subdomain `sepby1` dot)
       dot               = char '.'
       subdomain         = many1 $ alphaNum <|> innerPunct
       innerPunct        = try (satisfy (\c -> isEmailPunct c || c == '@') <*
                                 notFollowedBy space)
       emailWord         = many1 $ satisfy isEmailChar
       isEmailChar c     = isAlphaNum c || isEmailPunct c
       isEmailPunct c    = c `elem` "!\"#$%&'*+-/=?^_{|}~;"
       -- note: sepBy1 from parsec consumes input when sep
       -- succeeds and p fails, so we use this variant here.
       sepby1 p sep      = liftA2 (:) p (many (try $ sep >> p))

-- Schemes from http://www.iana.org/assignments/uri-schemes.html plus
-- the unofficial schemes coap, doi, javascript.
schemes :: [String]
schemes = ["coap","doi","javascript","aaa","aaas","about","acap","cap","cid",
           "crid","data","dav","dict","dns","file","ftp","geo","go","gopher",
           "h323","http","https","iax","icap","im","imap","info","ipp","iris",
           "iris.beep","iris.xpc","iris.xpcs","iris.lwz","ldap","mailto","mid",
           "msrp","msrps","mtqp","mupdate","news","nfs","ni","nih","nntp",
           "opaquelocktoken","pop","pres","rtsp","service","session","shttp","sieve",
           "sip","sips","sms","snmp","soap.beep","soap.beeps","tag","tel","telnet",
           "tftp","thismessage","tn3270","tip","tv","urn","vemmi","ws","wss","xcon",
           "xcon-userid","xmlrpc.beep","xmlrpc.beeps","xmpp","z39.50r","z39.50s",
           "adiumxtra","afp","afs","aim","apt","attachment","aw","beshare","bitcoin",
           "bolo","callto","chrome","chrome-extension","com-eventbrite-attendee",
           "content", "cvs","dlna-playsingle","dlna-playcontainer","dtn","dvb",
           "ed2k","facetime","feed","finger","fish","gg","git","gizmoproject",
           "gtalk","hcp","icon","ipn","irc","irc6","ircs","itms","jar","jms",
           "keyparc","lastfm","ldaps","magnet","maps","market","message","mms",
           "ms-help","msnim","mumble","mvn","notes","oid","palm","paparazzi",
           "platform","proxy","psyc","query","res","resource","rmi","rsync",
           "rtmp","secondlife","sftp","sgn","skype","smb","soldat","spotify",
           "ssh","steam","svn","teamspeak","things","udp","unreal","ut2004",
           "ventrilo","view-source","webcal","wtai","wyciwyg","xfire","xri",
           "ymsgr"]

uriScheme :: Parser [Char] st String
uriScheme = oneOfStringsCI schemes

-- | Parses a URI. Returns pair of original and URI-escaped version.
uri :: Parser [Char] st (String, String)
uri = try $ do
  scheme <- uriScheme
  char ':'
  -- We allow punctuation except at the end, since
  -- we don't want the trailing '.' in 'http://google.com.' We want to allow
  -- http://en.wikipedia.org/wiki/State_of_emergency_(disambiguation)
  -- as a URL, while NOT picking up the closing paren in
  -- (http://wikipedia.org). So we include balanced parens in the URL.
  let isWordChar c = isAlphaNum c || c == '_' || c == '/' || c == '+' ||
                         not (isAscii c)
  let wordChar = satisfy isWordChar
  let percentEscaped = try $ char '%' >> skipMany1 (satisfy isHexDigit)
  let entity = () <$ characterReference
  let punct = skipMany1 (char ',')
          <|> () <$ (satisfy (\c -> not (isSpace c) && c /= '<'))
  let uriChunk =  skipMany1 wordChar
              <|> percentEscaped
              <|> entity
              <|> (try $ punct >>
                    lookAhead (void (satisfy isWordChar) <|> percentEscaped))
  str <- snd `fmap` withRaw (skipMany1 ( () <$
                                         (enclosed (char '(') (char ')') uriChunk
                                         <|> enclosed (char '{') (char '}') uriChunk
                                         <|> enclosed (char '[') (char ']') uriChunk)
                                         <|> uriChunk))
  str' <- option str $ char '/' >> return (str ++ "/")
  let uri' = scheme ++ ":" ++ fromEntities str'
  return (uri', escapeURI uri')

mathInlineWith :: String -> String -> Parser [Char] st String
mathInlineWith op cl = try $ do
  string op
  notFollowedBy space
  words' <- many1Till (count 1 (noneOf "\n\\")
                   <|> (char '\\' >> anyChar >>= \c -> return ['\\',c])
                   <|> count 1 newline <* notFollowedBy' blankline
                       *> return " ")
              (try $ string cl)
  notFollowedBy digit  -- to prevent capture of $5
  return $ concat words'

mathDisplayWith :: String -> String -> Parser [Char] st String
mathDisplayWith op cl = try $ do
  string op
  many1Till (noneOf "\n" <|> (newline >>~ notFollowedBy' blankline)) (try $ string cl)

mathDisplay :: Parser [Char] ParserState String
mathDisplay =
      (guardEnabled Ext_tex_math_dollars >> mathDisplayWith "$$" "$$")
  <|> (guardEnabled Ext_tex_math_single_backslash >>
       mathDisplayWith "\\[" "\\]")
  <|> (guardEnabled Ext_tex_math_double_backslash >>
       mathDisplayWith "\\\\[" "\\\\]")

mathInline :: Parser [Char] ParserState String
mathInline =
      (guardEnabled Ext_tex_math_dollars >> mathInlineWith "$" "$")
  <|> (guardEnabled Ext_tex_math_single_backslash >>
       mathInlineWith "\\(" "\\)")
  <|> (guardEnabled Ext_tex_math_double_backslash >>
       mathInlineWith "\\\\(" "\\\\)")

-- | Applies a parser, returns tuple of its results and its horizontal
-- displacement (the difference between the source column at the end
-- and the source column at the beginning). Vertical displacement
-- (source row) is ignored.
withHorizDisplacement :: Parser [Char] st a  -- ^ Parser to apply
                      -> Parser [Char] st (a, Int) -- ^ (result, displacement)
withHorizDisplacement parser = do
  pos1 <- getPosition
  result <- parser
  pos2 <- getPosition
  return (result, sourceColumn pos2 - sourceColumn pos1)

-- | Applies a parser and returns the raw string that was parsed,
-- along with the value produced by the parser.
withRaw :: Parser [Char] st a -> Parser [Char] st (a, [Char])
withRaw parser = do
  pos1 <- getPosition
  inp <- getInput
  result <- parser
  pos2 <- getPosition
  let (l1,c1) = (sourceLine pos1, sourceColumn pos1)
  let (l2,c2) = (sourceLine pos2, sourceColumn pos2)
  let inplines = take ((l2 - l1) + 1) $ lines inp
  let raw = case inplines of
                []   -> ""
                [l]  -> take (c2 - c1) l
                ls   -> unlines (init ls) ++ take (c2 - 1) (last ls)
  return (result, raw)

-- | Parses backslash, then applies character parser.
escaped :: Parser [Char] st Char  -- ^ Parser for character to escape
        -> Parser [Char] st Char
escaped parser = try $ char '\\' >> parser

-- | Parse character entity.
characterReference :: Parser [Char] st Char
characterReference = try $ do
  char '&'
  ent <- many1Till nonspaceChar (char ';')
  case lookupEntity ent of
       Just c  -> return c
       Nothing -> fail "entity not found"

-- | Parses an uppercase roman numeral and returns (UpperRoman, number).
upperRoman :: Parser [Char] st (ListNumberStyle, Int)
upperRoman = do
  num <- romanNumeral True
  return (UpperRoman, num)

-- | Parses a lowercase roman numeral and returns (LowerRoman, number).
lowerRoman :: Parser [Char] st (ListNumberStyle, Int)
lowerRoman = do
  num <- romanNumeral False
  return (LowerRoman, num)

-- | Parses a decimal numeral and returns (Decimal, number).
decimal :: Parser [Char] st (ListNumberStyle, Int)
decimal = do
  num <- many1 digit
  return (Decimal, read num)

-- | Parses a '@' and optional label and
-- returns (DefaultStyle, [next example number]).  The next
-- example number is incremented in parser state, and the label
-- (if present) is added to the label table.
exampleNum :: Parser [Char] ParserState (ListNumberStyle, Int)
exampleNum = do
  char '@'
  lab <- many (alphaNum <|> satisfy (\c -> c == '_' || c == '-'))
  st <- getState
  let num = stateNextExample st
  let newlabels = if null lab
                     then stateExamples st
                     else M.insert lab num $ stateExamples st
  updateState $ \s -> s{ stateNextExample = num + 1
                       , stateExamples    = newlabels }
  return (Example, num)

-- | Parses a '#' returns (DefaultStyle, 1).
defaultNum :: Parser [Char] st (ListNumberStyle, Int)
defaultNum = do
  char '#'
  return (DefaultStyle, 1)

-- | Parses a lowercase letter and returns (LowerAlpha, number).
lowerAlpha :: Parser [Char] st (ListNumberStyle, Int)
lowerAlpha = do
  ch <- oneOf ['a'..'z']
  return (LowerAlpha, ord ch - ord 'a' + 1)

-- | Parses an uppercase letter and returns (UpperAlpha, number).
upperAlpha :: Parser [Char] st (ListNumberStyle, Int)
upperAlpha = do
  ch <- oneOf ['A'..'Z']
  return (UpperAlpha, ord ch - ord 'A' + 1)

-- | Parses a roman numeral i or I
romanOne :: Parser [Char] st (ListNumberStyle, Int)
romanOne = (char 'i' >> return (LowerRoman, 1)) <|>
           (char 'I' >> return (UpperRoman, 1))

-- | Parses an ordered list marker and returns list attributes.
anyOrderedListMarker :: Parser [Char] ParserState ListAttributes
anyOrderedListMarker = choice $
  [delimParser numParser | delimParser <- [inPeriod, inOneParen, inTwoParens],
                           numParser <- [decimal, exampleNum, defaultNum, romanOne,
                           lowerAlpha, lowerRoman, upperAlpha, upperRoman]]

-- | Parses a list number (num) followed by a period, returns list attributes.
inPeriod :: Parser [Char] st (ListNumberStyle, Int)
         -> Parser [Char] st ListAttributes
inPeriod num = try $ do
  (style, start) <- num
  char '.'
  let delim = if style == DefaultStyle
                 then DefaultDelim
                 else Period
  return (start, style, delim)

-- | Parses a list number (num) followed by a paren, returns list attributes.
inOneParen :: Parser [Char] st (ListNumberStyle, Int)
           -> Parser [Char] st ListAttributes
inOneParen num = try $ do
  (style, start) <- num
  char ')'
  return (start, style, OneParen)

-- | Parses a list number (num) enclosed in parens, returns list attributes.
inTwoParens :: Parser [Char] st (ListNumberStyle, Int)
            -> Parser [Char] st ListAttributes
inTwoParens num = try $ do
  char '('
  (style, start) <- num
  char ')'
  return (start, style, TwoParens)

-- | Parses an ordered list marker with a given style and delimiter,
-- returns number.
orderedListMarker :: ListNumberStyle
                  -> ListNumberDelim
                  -> Parser [Char] ParserState Int
orderedListMarker style delim = do
  let num = defaultNum <|>  -- # can continue any kind of list
            case style of
               DefaultStyle -> decimal
               Example      -> exampleNum
               Decimal      -> decimal
               UpperRoman   -> upperRoman
               LowerRoman   -> lowerRoman
               UpperAlpha   -> upperAlpha
               LowerAlpha   -> lowerAlpha
  let context = case delim of
               DefaultDelim -> inPeriod
               Period       -> inPeriod
               OneParen     -> inOneParen
               TwoParens    -> inTwoParens
  (start, _, _) <- context num
  return start

-- | Parses a character reference and returns a Str element.
charRef :: Parser [Char] st Inline
charRef = do
  c <- characterReference
  return $ Str [c]

lineBlockLine :: Parser [Char] st String
lineBlockLine = try $ do
  char '|'
  char ' '
  white <- many (spaceChar >> return '\160')
  notFollowedBy newline
  line <- anyLine
  continuations <- many (try $ char ' ' >> anyLine)
  return $ white ++ unwords (line : continuations)

-- | Parses an RST-style line block and returns a list of strings.
lineBlockLines :: Parser [Char] st [String]
lineBlockLines = try $ do
  lines' <- many1 lineBlockLine
  skipMany1 $ blankline <|> try (char '|' >> blankline)
  return lines'

-- | Parse a table using 'headerParser', 'rowParser',
-- 'lineParser', and 'footerParser'.
tableWith :: Parser [Char] ParserState ([[Block]], [Alignment], [Int])
          -> ([Int] -> Parser [Char] ParserState [[Block]])
          -> Parser [Char] ParserState sep
          -> Parser [Char] ParserState end
          -> Parser [Char] ParserState Block
tableWith headerParser rowParser lineParser footerParser = try $ do
    (heads, aligns, indices) <- headerParser
    lines' <- rowParser indices `sepEndBy1` lineParser
    footerParser
    numColumns <- getOption readerColumns
    let widths = if (indices == [])
                    then replicate (length aligns) 0.0
                    else widthsFromIndices numColumns indices
    return $ Table [] aligns widths heads lines'

-- Calculate relative widths of table columns, based on indices
widthsFromIndices :: Int      -- Number of columns on terminal
                  -> [Int]    -- Indices
                  -> [Double] -- Fractional relative sizes of columns
widthsFromIndices _ [] = []
widthsFromIndices numColumns' indices =
  let numColumns = max numColumns' (if null indices then 0 else last indices)
      lengths' = zipWith (-) indices (0:indices)
      lengths  = reverse $
                 case reverse lengths' of
                      []       -> []
                      [x]      -> [x]
                      -- compensate for the fact that intercolumn
                      -- spaces are counted in widths of all columns
                      -- but the last...
                      (x:y:zs) -> if x < y && y - x <= 2
                                     then y:y:zs
                                     else x:y:zs
      totLength = sum lengths
      quotient = if totLength > numColumns
                   then fromIntegral totLength
                   else fromIntegral numColumns
      fracs = map (\l -> (fromIntegral l) / quotient) lengths in
  tail fracs

---

-- Parse a grid table:  starts with row of '-' on top, then header
-- (which may be grid), then the rows,
-- which may be grid, separated by blank lines, and
-- ending with a footer (dashed line followed by blank line).
gridTableWith :: Parser [Char] ParserState [Block]   -- ^ Block list parser
              -> Bool                                -- ^ Headerless table
              -> Parser [Char] ParserState Block
gridTableWith blocks headless =
  tableWith (gridTableHeader headless blocks) (gridTableRow blocks)
            (gridTableSep '-') gridTableFooter

gridTableSplitLine :: [Int] -> String -> [String]
gridTableSplitLine indices line = map removeFinalBar $ tail $
  splitStringByIndices (init indices) $ trimr line

gridPart :: Char -> Parser [Char] st (Int, Int)
gridPart ch = do
  dashes <- many1 (char ch)
  char '+'
  return (length dashes, length dashes + 1)

gridDashedLines :: Char -> Parser [Char] st [(Int,Int)]
gridDashedLines ch = try $ char '+' >> many1 (gridPart ch) >>~ blankline

removeFinalBar :: String -> String
removeFinalBar =
  reverse . dropWhile (`elem` " \t") . dropWhile (=='|') . reverse

-- | Separator between rows of grid table.
gridTableSep :: Char -> Parser [Char] ParserState Char
gridTableSep ch = try $ gridDashedLines ch >> return '\n'

-- | Parse header for a grid table.
gridTableHeader :: Bool -- ^ Headerless table
                -> Parser [Char] ParserState [Block]
                -> Parser [Char] ParserState ([[Block]], [Alignment], [Int])
gridTableHeader headless blocks = try $ do
  optional blanklines
  dashes <- gridDashedLines '-'
  rawContent  <- if headless
                    then return $ repeat ""
                    else many1
                         (notFollowedBy (gridTableSep '=') >> char '|' >>
                           many1Till anyChar newline)
  if headless
     then return ()
     else gridTableSep '=' >> return ()
  let lines'   = map snd dashes
  let indices  = scanl (+) 0 lines'
  let aligns   = replicate (length lines') AlignDefault
  -- RST does not have a notion of alignments
  let rawHeads = if headless
                    then replicate (length dashes) ""
                    else map (intercalate " ") $ transpose
                       $ map (gridTableSplitLine indices) rawContent
  heads <- mapM (parseFromString blocks) $ map trim rawHeads
  return (heads, aligns, indices)

gridTableRawLine :: [Int] -> Parser [Char] ParserState [String]
gridTableRawLine indices = do
  char '|'
  line <- many1Till anyChar newline
  return (gridTableSplitLine indices line)

-- | Parse row of grid table.
gridTableRow :: Parser [Char] ParserState [Block]
             -> [Int]
             -> Parser [Char] ParserState [[Block]]
gridTableRow blocks indices = do
  colLines <- many1 (gridTableRawLine indices)
  let cols = map ((++ "\n") . unlines . removeOneLeadingSpace) $
               transpose colLines
  mapM (liftM compactifyCell . parseFromString blocks) cols

removeOneLeadingSpace :: [String] -> [String]
removeOneLeadingSpace xs =
  if all startsWithSpace xs
     then map (drop 1) xs
     else xs
   where startsWithSpace ""     = True
         startsWithSpace (y:_) = y == ' '

compactifyCell :: [Block] -> [Block]
compactifyCell bs = head $ compactify [bs]

-- | Parse footer for a grid table.
gridTableFooter :: Parser [Char] ParserState [Char]
gridTableFooter = blanklines

---

-- | Parse a string with a given parser and state.
readWith :: Parser [Char] st a       -- ^ parser
         -> st                       -- ^ initial state
         -> [Char]                   -- ^ input
         -> a
readWith parser state input =
    case runParser parser state "source" input of
      Left err'    ->
        let errPos = errorPos err'
            errLine = sourceLine errPos
            errColumn = sourceColumn errPos
            theline = (lines input ++ [""]) !! (errLine - 1)
        in  error $ "\nError at " ++ show  err' ++ "\n" ++
                theline ++ "\n" ++ replicate (errColumn - 1) ' ' ++
                "^"
      Right result -> result

-- | Parse a string with @parser@ (for testing).
testStringWith :: (Show a) => Parser [Char] ParserState a
               -> String
               -> IO ()
testStringWith parser str = UTF8.putStrLn $ show $
                            readWith parser defaultParserState str

-- | Parsing options.
data ParserState = ParserState
    { stateOptions         :: ReaderOptions, -- ^ User options
      stateParserContext   :: ParserContext, -- ^ Inside list?
      stateQuoteContext    :: QuoteContext,  -- ^ Inside quoted environment?
      stateAllowLinks      :: Bool,          -- ^ Allow parsing of links
      stateMaxNestingLevel :: Int,           -- ^ Max # of nested Strong/Emph
      stateLastStrPos      :: Maybe SourcePos, -- ^ Position after last str parsed
      stateKeys            :: KeyTable,      -- ^ List of reference keys (with fallbacks)
      stateSubstitutions   :: SubstTable,    -- ^ List of substitution references
      stateNotes           :: NoteTable,     -- ^ List of notes (raw bodies)
      stateNotes'          :: NoteTable',    -- ^ List of notes (parsed bodies)
      stateMeta            :: Meta,          -- ^ Document metadata
      stateMeta'           :: F Meta,        -- ^ Document metadata
      stateHeaderTable     :: [HeaderType],  -- ^ Ordered list of header types used
      stateHeaders         :: M.Map Inlines String, -- ^ List of headers and ids (used for implicit ref links)
      stateIdentifiers     :: [String],      -- ^ List of header identifiers used
      stateNextExample     :: Int,           -- ^ Number of next example
      stateExamples        :: M.Map String Int, -- ^ Map from example labels to numbers
      stateHasChapters     :: Bool,          -- ^ True if \chapter encountered
      stateMacros          :: [Macro],       -- ^ List of macros defined so far
      stateRstDefaultRole  :: String,        -- ^ Current rST default interpreted text role
      stateWarnings        :: [String]       -- ^ Warnings generated by the parser
    }

instance Default ParserState where
  def = defaultParserState

instance HasMeta ParserState where
  setMeta field val st =
    st{ stateMeta = setMeta field val $ stateMeta st }
  deleteMeta field st =
    st{ stateMeta = deleteMeta field $ stateMeta st }

class Monad m => HasReaderOptions m where
  askReaderOption :: (ReaderOptions -> b) -> m b

class Monad m => HasHeaderMap m where
  getHeaderMap    :: m (M.Map Inlines String)
  putHeaderMap    :: M.Map Inlines String -> m ()
  modifyHeaderMap :: (M.Map Inlines String -> M.Map Inlines String) -> m ()
  -- default
  modifyHeaderMap f = getHeaderMap >>= putHeaderMap . f

class Monad m => HasIdentifierList m where
  getIdentifierList    :: m [String]
  putIdentifierList    :: [String] -> m ()
  modifyIdentifierList :: ([String] -> [String]) -> m ()
  -- default
  modifyIdentifierList f = getIdentifierList >>= putIdentifierList . f

instance HasReaderOptions (Parser s ParserState) where
  askReaderOption = getOption

instance HasHeaderMap (Parser s ParserState) where
  getHeaderMap      = fmap stateHeaders getState
  putHeaderMap hm   = updateState $ \st -> st{ stateHeaders = hm }

instance HasIdentifierList (Parser s ParserState) where
  getIdentifierList   = fmap stateIdentifiers  getState
  putIdentifierList l = updateState $ \st -> st{ stateIdentifiers = l }

defaultParserState :: ParserState
defaultParserState =
    ParserState { stateOptions         = def,
                  stateParserContext   = NullState,
                  stateQuoteContext    = NoQuote,
                  stateAllowLinks      = True,
                  stateMaxNestingLevel = 6,
                  stateLastStrPos      = Nothing,
                  stateKeys            = M.empty,
                  stateSubstitutions   = M.empty,
                  stateNotes           = [],
                  stateNotes'          = [],
                  stateMeta            = nullMeta,
                  stateMeta'           = return nullMeta,
                  stateHeaderTable     = [],
                  stateHeaders         = M.empty,
                  stateIdentifiers     = [],
                  stateNextExample     = 1,
                  stateExamples        = M.empty,
                  stateHasChapters     = False,
                  stateMacros          = [],
                  stateRstDefaultRole  = "title-reference",
                  stateWarnings        = []}

getOption :: (ReaderOptions -> a) -> Parser s ParserState a
getOption f = (f . stateOptions) `fmap` getState

-- | Succeed only if the extension is enabled.
guardEnabled :: Extension -> Parser s ParserState ()
guardEnabled ext = getOption readerExtensions >>= guard . Set.member ext

-- | Succeed only if the extension is disabled.
guardDisabled :: Extension -> Parser s ParserState ()
guardDisabled ext = getOption readerExtensions >>= guard . not . Set.member ext

data HeaderType
    = SingleHeader Char  -- ^ Single line of characters underneath
    | DoubleHeader Char  -- ^ Lines of characters above and below
    deriving (Eq, Show)

data ParserContext
    = ListItemState   -- ^ Used when running parser on list item contents
    | NullState       -- ^ Default state
    deriving (Eq, Show)

data QuoteContext
    = InSingleQuote   -- ^ Used when parsing inside single quotes
    | InDoubleQuote   -- ^ Used when parsing inside double quotes
    | NoQuote         -- ^ Used when not parsing inside quotes
    deriving (Eq, Show)

type NoteTable = [(String, String)]

type NoteTable' = [(String, F Blocks)]  -- used in markdown reader

newtype Key = Key String deriving (Show, Read, Eq, Ord)

toKey :: String -> Key
toKey = Key . map toLower . unwords . words

type KeyTable = M.Map Key Target

type SubstTable = M.Map Key Inlines

--  | Add header to the list of headers in state, together
--  with its associated identifier.  If the identifier is null
--  and the auto_identifers extension is set, generate a new
--  unique identifier, and update the list of identifiers
--  in state.
registerHeader :: (HasReaderOptions m, HasHeaderMap m, HasIdentifierList m)
               => Attr -> Inlines -> m Attr
registerHeader (ident,classes,kvs) header' = do
  ids <- getIdentifierList
  exts <- askReaderOption readerExtensions
  let insert' = M.insertWith (\_new old -> old)
  if null ident && Ext_auto_identifiers `Set.member` exts
     then do
       let id' = uniqueIdent (B.toList header') ids
       let id'' = if Ext_ascii_identifiers `Set.member` exts
                     then catMaybes $ map toAsciiChar id'
                     else id'
       putIdentifierList $ if id' == id''
                              then id' : ids
                              else id' : id'' : ids
       modifyHeaderMap $ insert' header' id'
       return (id'',classes,kvs)
     else do
        unless (null ident) $ modifyHeaderMap $ insert' header' ident
        return (ident,classes,kvs)

-- | Fail unless we're in "smart typography" mode.
failUnlessSmart :: Parser [tok] ParserState ()
failUnlessSmart = getOption readerSmart >>= guard

smartPunctuation :: Parser [Char] ParserState Inline
                 -> Parser [Char] ParserState Inline
smartPunctuation inlineParser = do
  failUnlessSmart
  choice [ quoted inlineParser, apostrophe, dash, ellipses ]

apostrophe :: Parser [Char] ParserState Inline
apostrophe = (char '\'' <|> char '\8217') >> return (Str "\x2019")

quoted :: Parser [Char] ParserState Inline
       -> Parser [Char] ParserState Inline
quoted inlineParser = doubleQuoted inlineParser <|> singleQuoted inlineParser

withQuoteContext :: QuoteContext
                 -> Parser [tok] ParserState a
                 -> Parser [tok] ParserState a
withQuoteContext context parser = do
  oldState <- getState
  let oldQuoteContext = stateQuoteContext oldState
  setState oldState { stateQuoteContext = context }
  result <- parser
  newState <- getState
  setState newState { stateQuoteContext = oldQuoteContext }
  return result

singleQuoted :: Parser [Char] ParserState Inline
             -> Parser [Char] ParserState Inline
singleQuoted inlineParser = try $ do
  singleQuoteStart
  withQuoteContext InSingleQuote $ many1Till inlineParser singleQuoteEnd >>=
    return . Quoted SingleQuote . normalizeSpaces

doubleQuoted :: Parser [Char] ParserState Inline
             -> Parser [Char] ParserState Inline
doubleQuoted inlineParser = try $ do
  doubleQuoteStart
  withQuoteContext InDoubleQuote $ do
    contents <- manyTill inlineParser doubleQuoteEnd
    return . Quoted DoubleQuote . normalizeSpaces $ contents

failIfInQuoteContext :: QuoteContext -> Parser [tok] ParserState ()
failIfInQuoteContext context = do
  st <- getState
  if stateQuoteContext st == context
     then fail "already inside quotes"
     else return ()

charOrRef :: [Char] -> Parser [Char] st Char
charOrRef cs =
  oneOf cs <|> try (do c <- characterReference
                       guard (c `elem` cs)
                       return c)

updateLastStrPos :: Parser [Char] ParserState ()
updateLastStrPos = getPosition >>= \p ->
  updateState $ \s -> s{ stateLastStrPos = Just p }

singleQuoteStart :: Parser [Char] ParserState ()
singleQuoteStart = do
  failIfInQuoteContext InSingleQuote
  pos <- getPosition
  st <- getState
  -- single quote start can't be right after str
  guard $ stateLastStrPos st /= Just pos
  () <$ charOrRef "'\8216\145"

singleQuoteEnd :: Parser [Char] st ()
singleQuoteEnd = try $ do
  charOrRef "'\8217\146"
  notFollowedBy alphaNum

doubleQuoteStart :: Parser [Char] ParserState ()
doubleQuoteStart = do
  failIfInQuoteContext InDoubleQuote
  try $ do charOrRef "\"\8220\147"
           notFollowedBy . satisfy $ flip elem [' ', '\t', '\n']

doubleQuoteEnd :: Parser [Char] st ()
doubleQuoteEnd = do
  charOrRef "\"\8221\148"
  return ()

ellipses :: Parser [Char] st Inline
ellipses = do
  try (charOrRef "\8230\133") <|> try (string "..." >> return '…')
  return (Str "\8230")

dash :: Parser [Char] ParserState Inline
dash = do
  oldDashes <- getOption readerOldDashes
  if oldDashes
     then emDashOld <|> enDashOld
     else Str `fmap` (hyphenDash <|> emDash <|> enDash)

-- Two hyphens = en-dash, three = em-dash
hyphenDash :: Parser [Char] st String
hyphenDash = do
  try $ string "--"
  option "\8211" (char '-' >> return "\8212")

emDash :: Parser [Char] st String
emDash = do
  try (charOrRef "\8212\151")
  return "\8212"

enDash :: Parser [Char] st String
enDash = do
  try (charOrRef "\8212\151")
  return "\8211"

enDashOld :: Parser [Char] st Inline
enDashOld = do
  try (charOrRef "\8211\150") <|>
    try (char '-' >> lookAhead (satisfy isDigit) >> return '–')
  return (Str "\8211")

emDashOld :: Parser [Char] st Inline
emDashOld = do
  try (charOrRef "\8212\151") <|> (try $ string "--" >> optional (char '-') >> return '-')
  return (Str "\8212")

-- This is used to prevent exponential blowups for things like:
-- a**a*a**a*a**a*a**a*a**a*a**a*a**
nested :: Parser s ParserState a
       -> Parser s ParserState a
nested p = do
  nestlevel <- stateMaxNestingLevel `fmap` getState
  guard $ nestlevel > 0
  updateState $ \st -> st{ stateMaxNestingLevel = stateMaxNestingLevel st - 1 }
  res <- p
  updateState $ \st -> st{ stateMaxNestingLevel = nestlevel }
  return res

--
-- Macros
--

-- | Parse a \newcommand or \renewcommand macro definition.
macro :: Parser [Char] ParserState Blocks
macro = do
  apply <- getOption readerApplyMacros
  inp <- getInput
  case parseMacroDefinitions inp of
       ([], _)    -> mzero
       (ms, rest) -> do def' <- count (length inp - length rest) anyChar
                        if apply
                           then do
                             updateState $ \st ->
                               st { stateMacros = ms ++ stateMacros st }
                             return mempty
                           else return $ rawBlock "latex" def'

-- | Apply current macros to string.
applyMacros' :: String -> Parser [Char] ParserState String
applyMacros' target = do
  apply <- getOption readerApplyMacros
  if apply
     then do macros <- liftM stateMacros getState
             return $ applyMacros macros target
     else return target


text:
using System;
using System.Collections.Generic;
using System.Windows;

namespace LiveSPICE
{
    // http://www.codeproject.com/Articles/18936/A-C-Implementation-of-Douglas-Peucker-Line-Approxi
    public class DouglasPeuckerReduction
    {
        public static void Reduce(List<Point> Points, double Tolerance)
        {
            if (Points == null || Points.Count < 3)
                return;

            int firstPoint = 0;
            int lastPoint = Points.Count - 1;
            List<int> pointIndexsToKeep = new List<int>(Points.Count)
            {
                //Add the first and last index to the keepers
                firstPoint,
                lastPoint
            };

            //The first and the last point cannot be the same
            while (Points[firstPoint].Equals(Points[lastPoint]))
                lastPoint--;

            Reduce(Points, firstPoint, lastPoint, Tolerance, ref pointIndexsToKeep);

            // We should only be removing points, so this is safe.
            pointIndexsToKeep.Sort();
            for (int i = 0; i < pointIndexsToKeep.Count; i++)
                Points[i] = Points[pointIndexsToKeep[i]];
            Points.RemoveRange(pointIndexsToKeep.Count, Points.Count - pointIndexsToKeep.Count);
        }

        ///
        /// Douglases the peucker reduction.
        ///
        /// <param name="points">The points.</param>
        /// <param name="firstPoint">The first point.</param>
        /// <param name="lastPoint">The last point.</param>
        /// <param name="tolerance">The tolerance.</param>
        /// <param name="pointIndexsToKeep">The point index to keep.</param>
        private static void Reduce(List<Point> points, int firstPoint, int lastPoint, double tolerance, ref List<int> pointIndexsToKeep)
        {
            double maxDistance = 0;
            int indexFarthest = 0;

            for (int index = firstPoint; index < lastPoint; index++)
            {
                double distance = PerpendicularDistanceSq(points[firstPoint], points[lastPoint], points[index]);
                if (distance > maxDistance)
                {
                    maxDistance = distance;
                    indexFarthest = index;
                }
            }

            if (maxDistance > tolerance && indexFarthest != 0)
            {
                //Add the largest point that exceeds the tolerance
                pointIndexsToKeep.Add(indexFarthest);

                Reduce(points, firstPoint, indexFarthest, tolerance, ref pointIndexsToKeep);
                Reduce(points, indexFarthest, lastPoint, tolerance, ref pointIndexsToKeep);
            }
        }

        ///
        /// The distance of a point from a line made from point1 and point2.
        ///
        /// <param name="pt1">The PT1.</param>
        /// <param name="pt2">The PT2.</param>
        /// <param name="p">The p.</param>
        /// <returns></returns>
        public static double PerpendicularDistanceSq(Point Point1, Point Point2, Point Point)
        {
            //Vector n = Point2 - Point1;

            //Vector ap = Point1 - Point;

            //return (ap - (Vector.Multiply(ap, n) * n)).LengthSquared;

            //Area = |(1/2)(x1y2 + x2y3 + x3y1 - x2y1 - x3y2 - x1y3)|   *Area of triangle
            //Base = v((x1-x2)²+(x1-x2)²)                               *Base of Triangle*
            //Area = .5*Base*H                                          *Solve for height
            //Height = Area/.5/Base

            double areaSq = Square(
                Point1.X * Point2.Y + Point2.X * Point.Y +
                Point.X * Point1.Y - Point2.X * Point1.Y -
                Point.X * Point2.Y - Point1.X * Point.Y);
            double bottomSq = Square(Point1.X - Point2.X) + Square(Point1.Y - Point2.Y);
            return areaSq / bottomSq;
        }

        private static double Square(double x) { return x * x; }
    }
}

redpajama_set_name: RedPajamaGithub


text:
module Qe
  class Question < Element
    include ActionController::RecordIdentifier # dom_id
    has_many :conditions, :foreign_key => "toggle_id", :dependent => :nullify
    has_many :dependents, :foreign_key => "trigger_id", :dependent => :nullify
    has_many :sheet_answers, :foreign_key => "question_id", :dependent => :destroy

    belongs_to :related_question_sheet, :class_name => "QuestionSheet", :foreign_key => "related_question_sheet_id"

    # validates_inclusion_of :required, :in => [false, true]

    validates_format_of :slug, :with => /^[a-z_][a-z0-9_]*$/,
      :allow_nil => true, :if => Proc.new { |q| !q.slug.blank? },
      :message => 'may only contain lowercase letters, digits and underscores; and cannot begin with a digit.' # enforcing lowercase because javascript is case-sensitive
    validates_length_of :slug, :in => 4..36,
      :allow_nil => true, :if => Proc.new { |q| !q.slug.blank? }
    validates_uniqueness_of :slug,
      :allow_nil => true, :if => Proc.new { |q| !q.slug.blank? },
      :message => 'must be unique.'

    # a question has one response per AnswerSheet (that is, an instance of a user filling out the question)
    # generally the response is a single answer
    # however, "Choose Many" (checkbox) questions have multiple answers in a single response

    attr_accessor :answers

    # @answers = nil            # one or more answers in response to this question
    # @mark_for_destroy = nil   # when something is unchecked, there are less answers to the question than before

    # a question is disabled if there is a condition, and that condition evaluates to false
    # could set multiple conditions to influence this question, in which case all must be met
    # def active?
    #   # find first condition that doesn't pass (nil if all pass)
    #   self.conditions.find(:all).find { |c| !c.evaluate? }.nil?  # true if all pass
    # end

    # def conditions_attributes=(new_conditions)
    #   conditions.collect(&:destroy)
    #   conditions.reload
    #   (0..(new_conditions.length - 1)).each do |i|
    #     i = i.to_s
    #     expression = new_conditions[i]["expression"]
    #     trigger_id = new_conditions[i]["trigger_id"].to_i
    #     unless expression.blank? || !page.questions.collect(&:id).include?(trigger_id) || conditions.collect(&:trigger_id).include?(trigger_id)
    #       conditions.create(:question_sheet_id => question_sheet_id, :trigger_id => trigger_id,
    #                         :expression => expression, :toggle_page_id => page_id,
    #                         :toggle_id => self.id)
    #     end
    #   end
    # end

    # element view provides the element label with required indicator
    def default_label?
      true
    end

    # css class names for javascript-based validation
    def validation_class(answer_sheet)
      if self.required?(answer_sheet)
        ' required '
      else
        ''
      end
    end

    # just in case something slips through client-side validation?
    # def valid_response?
    #   if self.required? && !self.has_response? then
    #     false
    #   else
    #     # other validations
    #     true
    #   end
    # end

    # just in case something slips through client-side validation?
    # def valid_response_for_answer_sheet?(answers)
    #    return true if !self.required?
    #    answer  = answers.detect {|a| a.question_id == self.id}
    #    return answer && answer.value.present?
    #    # raise answer.inspect
    #  end

    # shortcut to return first answer
    def response(app)
      responses(app).first.to_s
    end

    def display_response(app)
      r = responses(app)
      if r.blank?
        ""
      else
        r.join(", ")
      end
    end

    def responses(app)
      return [] unless app
      # try to find answer from external object
      if !object_name.blank? and !attribute_name.blank?
        obj = object_name == 'application' ? app : eval("app." + object_name)
        if obj.nil? or eval("obj." + attribute_name + ".nil?")
          []
        else
          [eval("obj." + attribute_name)]
        end
      else
        app.answers_by_question[id] || []
        # Answer.where(:answer_sheet_id => app.id, :question_id => self.id)
      end
    end

    # set answers from posted response
    def set_response(values, app)
      values = Array.wrap(values)
      if !object_name.blank? and !attribute_name.blank?
        # if eval("app." + object_name).present?
        object = object_name == 'application' ? app : eval("app." + object_name)
        unless object.present?
          if object_name.include?('.')
            objects = object_name.split('.')
            object = eval("app." + objects[0..-2].join('.') + ".create_" + objects.last)
            eval("app." + objects[0..-2].join('.')).reload
          end
        end
        unless responses(app) == values
          value = ActiveRecord::Base.connection.quote_string(values.first)
          if self.is_a?(DateField) && value.present?
            begin
              value = Date.strptime(value, (I18n.t 'date.formats.default'))
            rescue
              raise "invalid date - " + value.inspect
            end
          end
          object.update_attribute(attribute_name, value)
        end
        # else
        #   raise object_name.inspect + ' == ' + attribute_name.inspect
        # end
      else
        @answers ||= []
        @mark_for_destroy ||= []
        # go through existing answers (in reverse order, as we delete)
        (@answers.length - 1).downto(0) do |index|
          # reject: skip over responses that are unchanged
          unless values.reject! {|value| value == @answers[index]}
            # remove any answers that don't match the posted values
            @mark_for_destroy << @answers[index]   # destroy from database later
            @answers.delete_at(index)
          end
        end

        # insert any new answers
        for value in values
          if @mark_for_destroy.empty?
            answer = Answer.new(:question_id => self.id)
          else
            # re-use marked answers (an update vs. a delete+insert)
            answer = @mark_for_destroy.pop
          end
          answer.set(value)
          @answers << answer
        end
      end
    end

    def save_file(answer_sheet, file)
      @answers.collect(&:destroy) if @answers
      answer = Answer.create!(:question_id => self.id, :answer_sheet_id => answer_sheet.id, :attachment => file)
    end

    # save this question's @answers to database
    def save_response(answer_sheet)
      unless @answers.nil?
        for answer in @answers
          if answer.is_a?(Answer)
            answer.answer_sheet_id = answer_sheet.id
            answer.save!
          end
        end
      end

      # remove others
      unless @mark_for_destroy.nil?
        for answer in @mark_for_destroy
          answer.destroy
        end
        @mark_for_destroy.clear
      end
    rescue TypeError
      raise answer.inspect
    end

    # has any sort of non-empty response?
    def has_response?(answer_sheet = nil)
      if answer_sheet.present?
        answers = responses(answer_sheet)
      else
        answers = Answer.where(:question_id => self.id)
      end
      return false if answers.length == 0
      answers.each do |answer|   # loop through Answers
        value = answer.is_a?(Answer) ? answer.value : answer
        return true if (value.is_a?(FalseClass) && value === false) || value.present?
      end
      return false
    end

    def required?(answer_sheet = nil)
      super() || (!answer_sheet.nil? && !choice_field.nil? && choice_field.has_answer?('1', answer_sheet))
    end

  end
end


text:
package com.navercorp.pinpoint.collector.receiver.grpc;

import com.navercorp.pinpoint.rpc.packet.stream.StreamClosePacket;
import com.navercorp.pinpoint.rpc.packet.stream.StreamCode;
import com.navercorp.pinpoint.rpc.packet.stream.StreamResponsePacket;
import com.navercorp.pinpoint.rpc.stream.ClientStreamChannel;
import com.navercorp.pinpoint.rpc.stream.ClientStreamChannelEventHandler;
import com.navercorp.pinpoint.rpc.stream.StreamChannelRepository;
import com.navercorp.pinpoint.rpc.stream.StreamChannelStateCode;
import com.navercorp.pinpoint.rpc.stream.StreamException;

import com.google.protobuf.Empty;
import io.grpc.stub.StreamObserver;
import org.junit.Assert;
import org.junit.Test;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

import java.net.InetSocketAddress;
import java.util.concurrent.CountDownLatch;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.atomic.AtomicInteger;

/**
 * @author Taejin Koo
 */
public class GrpcClientStreamChannelTest {

    private final InetSocketAddress mockRemoteAddress = new InetSocketAddress("127.0.0.1", 61611);

    @Test
    public void connectTimeoutTest() throws StreamException {
        GrpcClientStreamChannel grpcClientStreamChannel = new GrpcClientStreamChannel(mockRemoteAddress, 20, new StreamChannelRepository(), ClientStreamChannelEventHandler.DISABLED_INSTANCE);

        grpcClientStreamChannel.init();

        StreamException streamException = null;
        try {
            grpcClientStreamChannel.connect(new Runnable() {
                @Override
                public void run() {

                }
            }, 500);
        } catch (StreamException e) {
            streamException = e;
        }

        Assert.assertEquals(StreamCode.CONNECTION_TIMEOUT, streamException.getStreamCode());
        Assert.assertEquals(StreamChannelStateCode.CLOSED, grpcClientStreamChannel.getCurrentState());
    }

    @Test
    public void connectFailTest() throws StreamException {
        GrpcClientStreamChannel grpcClientStreamChannel = new GrpcClientStreamChannel(mockRemoteAddress, 20, new StreamChannelRepository(), ClientStreamChannelEventHandler.DISABLED_INSTANCE);
        grpcClientStreamChannel.init();

        StreamException streamException = null;
        try {
            grpcClientStreamChannel.connect(new Runnable() {
                @Override
                public void run() {
                    throw new IllegalStateException("fail");
                }
            }, 500);
        } catch (StreamException e) {
            streamException = e;
        }

        Assert.assertEquals(StreamCode.CONNECTION_ERRROR, streamException.getStreamCode());
        Assert.assertEquals(StreamChannelStateCode.CLOSED, grpcClientStreamChannel.getCurrentState());
    }

    @Test
    public void simpleTest() throws StreamException, InterruptedException {
        StreamChannelRepository streamChannelRepository = new StreamChannelRepository();

        RecordClientStreamChannelEventHandler recordStreamChannelHandler = new RecordClientStreamChannelEventHandler();
        GrpcClientStreamChannel grpcClientStreamChannel = new GrpcClientStreamChannel(mockRemoteAddress, 20, streamChannelRepository, recordStreamChannelHandler);
        Assert.assertEquals(StreamChannelStateCode.NEW, grpcClientStreamChannel.getCurrentState());

        grpcClientStreamChannel.init();
        Assert.assertEquals(StreamChannelStateCode.OPEN, grpcClientStreamChannel.getCurrentState());
        Assert.assertEquals(1, streamChannelRepository.size());

        CountDownLatch connectCompleteLatch = new CountDownLatch(1);
        CountDownLatch threadCompleteLatch = connect(grpcClientStreamChannel, connectCompleteLatch);

        final AtomicInteger callCompletedCount = new AtomicInteger(0);
        grpcClientStreamChannel.setConnectionObserver(new StreamObserver<Empty>() {
            @Override
            public void onNext(Empty value) {

            }

            @Override
            public void onError(Throwable t) {

            }

            @Override
            public void onCompleted() {
                callCompletedCount.incrementAndGet();
            }
        });

        Assert.assertTrue(connectCompleteLatch.await(1000, TimeUnit.MILLISECONDS));
        Assert.assertEquals(StreamChannelStateCode.CONNECT_AWAIT, grpcClientStreamChannel.getCurrentState());

        grpcClientStreamChannel.changeStateConnected();
        Assert.assertEquals(StreamChannelStateCode.CONNECTED, grpcClientStreamChannel.getCurrentState());

        Assert.assertTrue(threadCompleteLatch.await(1000, TimeUnit.MILLISECONDS));

        String message = "hello";
        grpcClientStreamChannel.handleStreamResponsePacket(new StreamResponsePacket(1, message.getBytes()));
        Assert.assertEquals(message, new String(recordStreamChannelHandler.getLastStreamResponsePacket().getPayload()));

        Assert.assertEquals(0, callCompletedCount.get());

        grpcClientStreamChannel.handleStreamClosePacket(new StreamClosePacket(1, StreamCode.STATE_CLOSED));
        Assert.assertEquals(0, streamChannelRepository.size());
        Assert.assertEquals(StreamChannelStateCode.CLOSED, grpcClientStreamChannel.getCurrentState());
        Assert.assertEquals(1, callCompletedCount.get());

        // do nothing
        grpcClientStreamChannel.disconnect();
        Assert.assertEquals(1, callCompletedCount.get());
        grpcClientStreamChannel.close();
        Assert.assertEquals(1, callCompletedCount.get());
    }

    private CountDownLatch connect(GrpcClientStreamChannel grpcClientStreamChannel, CountDownLatch connectCompleteLatch) {
        CountDownLatch threadCompleteLatch = new CountDownLatch(1);

        Thread thread = new Thread(new Runnable() {
            @Override
            public void run() {
                try {
                    grpcClientStreamChannel.connect(new Runnable() {
                        @Override
                        public void run() {
                            connectCompleteLatch.countDown();
                        }
                    }, 1000);
                } catch (StreamException e) {
                    e.printStackTrace();
                } finally {
                    threadCompleteLatch.countDown();
                }
            }
        });
        thread.setDaemon(true);
        thread.start();
        return threadCompleteLatch;
    }

    private static class RecordClientStreamChannelEventHandler extends ClientStreamChannelEventHandler {

        private final Logger logger = LoggerFactory.getLogger(this.getClass());

        private StreamResponsePacket lastStreamResponsePacket;

        @Override
        public void handleStreamResponsePacket(ClientStreamChannel streamChannel, StreamResponsePacket packet) {
            logger.info("handleStreamResponsePacket");
            this.lastStreamResponsePacket = packet;
        }

        StreamResponsePacket getLastStreamResponsePacket() {
            return lastStreamResponsePacket;
        }

        @Override
        public void handleStreamClosePacket(ClientStreamChannel streamChannel, StreamClosePacket packet) {
            logger.info("handleStreamClosePacket");
        }

        @Override
        public void stateUpdated(ClientStreamChannel streamChannel, StreamChannelStateCode updatedStateCode) {
            logger.info("stateUpdated streamChannel:{}, currentState:{}", streamChannel, updatedStateCode);
        }

    }

}


text:
'use strict';

var replacements = [
  [ /\*/g, '\\*' ],
  [ /#/g, '\\#' ],
  [ /\//g, '\\/' ],
  [ /\(/g, '\\(' ],
  [ /\)/g, '\\)' ],
  [ /\[/g, '\\[' ],
  [ /\]/g, '\\]' ],
  [ /</g, '<' ],
  [ /\>/g, '>' ],
  [ /_/g, '\\_' ]
];

function markdownEscape(string) {
  return replacements.reduce(function(current, replacement) {
    return current.replace(replacement[0], replacement[1]);
  }, string);
}

function protectLeadingWhitespaces(string) {
  var captures = /^(\s+)/.exec(string);
  return captures ? new Array(captures[1].length + 1).join(' ') + string.substr(captures[1].length) : string;
}

function createReleaseNotes(json) {
  return json.changes.change.reduce(function (paragraphs, change) {
    var header = '__Commit [' + change.changesetId + '](' + change.commitUrl + ') by ' + change.fullName + ':__';
    var comment = change.comment.split('\n').map(markdownEscape).map(protectLeadingWhitespaces).join('  \n');
    paragraphs.push(header, '', comment, '', '---', '');
    return paragraphs;
  }, [json.reasonSummary, '', '---', '']).join('\n');
}

function handleResponse(response) {
  if (response.status >= 200 && response.status < 300) {
    return response.json();
  } else {
    throw new Error(response.statusText);
  }
}

module.exports = function (options) {
  var url = options.bambooServer +
            '/rest/api/latest/result/' +
            options.buildPlan +
            '/' +
            options.buildNumber +
            '.json?os_authType=basic&expand=changes.change.files';

  return fetch(url).then(handleResponse).then(createReleaseNotes);
};


text:
package com.amazonaws.services.backupstorage.model;

import javax.annotation.Generated;

/**
 * Non-retryable exception. Attempted to make an operation on non-existing or expired resource.
 */
@Generated("com.amazonaws:aws-java-sdk-code-generator")
public class ResourceNotFoundException extends com.amazonaws.services.backupstorage.model.AWSBackupStorageException {
    private static final long serialVersionUID = 1L;

    /**
     * Constructs a new ResourceNotFoundException with the specified error message.
     *
     * @param message
     *        Describes the error encountered.
     */
    public ResourceNotFoundException(String message) {
        super(message);
    }

}


text:
package com.kws.stratege.nogood;

import java.util.ArrayList;
import java.util.List;

/*삭제 기능이 없는 Article*/
public class SimpleArticle3 extends Article{

	public SimpleArticle3() {
		// TODO Auto-generated constructor stub
		System.out.println("삭제 기능이 없는 Article");
	}

	@Override
	public List selectArticle() {
		// TODO Auto-generated method stub
		System.out.println("Simple3 선택");
		return new ArrayList();
	}

	@Override
	public boolean deleteArticle() {
		// TODO Auto-generated method stub
		System.out.println("이건 삭제를 하면 안돼");
		return false;
	}
}


text:
var fs = require('fs');
var request = require('request');
var minimatch = require('minimatch');
var glob = require('glob');
var uniq = require('array-uniq');
var chalk = require('chalk');
var pretty = require('prettysize');

var argv = require('minimist')(process.argv.slice(2));
var home = process.env.HOME || process.env.HOMEPATH || process.env.USERPROFILE;
var version = require('./package.json').version;

if (argv.v || argv.version) {

    console.log(version);

} else if (argv.h || argv.help) {

    console.log(
        'Usage\n' +
        '  tinypng <path>\n' +
        '\n' +
        'Example\n' +
        '  tinypng .\n' +
        '  tinypng assets/img\n' +
        '  tinypng assets/img/test.png\n' +
        '  tinypng assets/img/test.jpg\n' +
        '\n' +
        'Options\n' +
        '  -k, --key         Provide an API key\n' +
        '  -r, --recursive   Walk given directory recursively\n' +
        '  -v, --version     Show installed version\n' +
        '  -h, --help        Show help'
    );

} else {

    console.log(chalk.underline.bold('TinyPNG CLI'));
    console.log('v' + version + '\n');

    var files = argv._.length ? argv._ : ['.'];

    var key = '';

    if (argv.k || argv.key) {
        key = typeof (argv.k || argv.key) === 'string' ? (argv.k || argv.key).trim() : '';
    } else if (fs.existsSync(home + '/.tinypng')) {
        key = fs.readFileSync(home + '/.tinypng', 'utf8').trim();
    }

    if (key.length === 0) {

        console.log(chalk.bold.red('No API key specified. You can get one at ' + chalk.underline('https://tinypng.com/developers') + '.'));

    } else {

        var images = [];

        files.forEach(function(file) {
            if (fs.existsSync(file)) {
                if (fs.lstatSync(file).isDirectory()) {
                    images = images.concat(glob.sync(file + (argv.r || argv.recursive ? '/**' : '') + '/*.+(png|jpg|jpeg)'));
                } else if(minimatch(file, '*.+(png|jpg|jpeg)', {
                    matchBase: true
                })) {
                    images.push(file);
                }
            }
        });

        var unique = uniq(images);

        if (unique.length === 0) {

            console.log(chalk.bold.red('\u2718 No PNG or JPEG images found.'));

        } else {

            console.log(chalk.bold.green('\u2714 Found ' + unique.length + ' image' + (unique.length === 1 ? '' : 's')) + '\n');
            console.log(chalk.bold('Processing...'));

            unique.forEach(function(file) {

                fs.createReadStream(file).pipe(request.post('https://api.tinify.com/shrink', {
                    auth: {
                        'user': 'api',
                        'pass': key
                    }
                }, function (error, response, body) {

                    try {
                        body = JSON.parse(body);
                    } catch(e) {
                        console.log(chalk.red('\u2718 Not a valid JSON response for `' + file + '`'));
                    }

                    if(response !== undefined) {

                        if (response.statusCode === 201) {

                            if (body.output.size < body.input.size) {

                                console.log(chalk.green('\u2714 Panda just saved you ' + chalk.bold(pretty(body.input.size - body.output.size) + ' (' + Math.round(100 - 100 / body.input.size * body.output.size) + '%)') + ' for `' + file + '`'));
                                request.get(body.output.url).pipe(fs.createWriteStream(file));

                            } else {

                                console.log(chalk.yellow('\u2718 Couldn't compress `' + file + '` any further'));

                            }

                        } else {

                            if (body.error === 'TooManyRequests') {
                                console.log(chalk.red('\u2718 Compression failed for `' + file + '` as your monthly limit has been exceeded'));
                            } else if (body.error === 'Unauthorized') {
                                console.log(chalk.red('\u2718 Compression failed for `' + file + '` as your credentials are invalid'));
                            } else {
                                console.log(chalk.red('\u2718 Compression failed for `' + file + '`'));
                            }

                        }
                    } else {
                        console.log(chalk.red('\u2718 Got no response for `' + file + '`'));
                    }
                }));

            });

        }

    }

}


text:
<?php

/**
 * @category USF/IT
 *
 * @author James Jones <james@mail.usf.edu>
 * @license MIT
 *
 * @link https://github.com/USF-IT/usf-idm-common
 */

namespace USF\IdM\AuthTransfer;

use Slim\Views\Twig;
use Slim\Collection;
use Psr\Log\LoggerInterface;
use Psr\Http\Message\ServerRequestInterface as Request;
use Psr\Http\Message\ResponseInterface as Response;

/**
 * The abstract BasicAuthServiceAction allows custom defined actions using
 * services that implement the AuthTransferServiceInterface with a uniform
 * constructor and a custom dispatch method specific to the targeted service.
 *
 * @author James Jones <james@mail.usf.edu>
 */
abstract class BasicAuthServiceAction
{
    public $view;
    public $logger;
    public $settings;
    public $authService;

    /**
     * Class constructor.
     *
     * @param Twig                         $view        View object
     * @param LoggerInterface              $logger      Log object
     * @param Collection                   $settings    Slim Settings
     * @param AuthTransferServiceInterface $authService Custom Authentication Service that implements this interface
     */
    public function __construct(Twig $view, \Psr\Log\LoggerInterface $logger, Collection $settings, AuthTransferServiceInterface $authService)
    {
        $this->view = $view;
        $this->logger = $logger;
        $this->settings = $settings;
        $this->authService = $authService;
    }

    /**
     * Abstract authentication dispatcher.
     *
     * @param ServerRequestInterface $request  PSR7 Request object
     * @param ResponseInterface      $response PSR7 Response object
     * @param array                  $args     Request arguments
     *
     * @return ResponseInterface
     *
     * @throws Exception
     * @throws NoAccountFoundException
     * @throws MultipleAccountsFoundException
     */
    abstract public function dispatch(Request $request, Response $response, array $args);

    /**
     * Returns values for authentication related special attributes.
     *
     * @param ServerRequestInterface $request PSR7 Request object
     * @param string                 $name    Attribute Name
     *
     * @return array Array of attribute values
     */
    public function getAttributeByName(Request $request, string $name): array
    {
        $matches = \array_filter($this->getReleasedAttributes($request), function ($key) use ($name) {
            return \strtoupper($name) == \strtoupper($key);
        }, ARRAY_FILTER_USE_KEY);
        if (empty($matches)) {
            return [];
        } else {
            return \current($matches);
        }
    }
    /**
     * Returns the username/netid.
     *
     * @param ServerRequestInterface $request PSR7 Request object
     *
     * @return string The username or netid
     */
    public function getNetid(Request $request): string
    {
        if ($request->hasHeader('AUTH_PRINCIPAL')) {
            return $request->getHeaderLine('AUTH_PRINCIPAL');
        }

        return '';
    }

    public function getReleasedAttributes(Request $request): array
    {
        $cas_auth_prefix = 'AUTH_ATTR_';
        $allcasattributes = \array_filter($request->getHeaders(), function ($key) use ($cas_auth_prefix) {
            return \substr(\strtoupper($key), 0, \strlen($cas_auth_prefix)) === $cas_auth_prefix;
        }, ARRAY_FILTER_USE_KEY);
        $matchingreleasedattributes = \array_filter(\array_flip(self::getReleasedAttributeNames()), function ($key) use ($cas_auth_prefix, $allcasattributes) {
            return \in_array(\strtoupper($key), \array_map(function ($v) use ($cas_auth_prefix) {
                return \strtoupper(\substr($v, \strlen($cas_auth_prefix)));
            }, \array_keys($allcasattributes)));
        }, ARRAY_FILTER_USE_KEY);
        $remainingattributes = [];
        \array_walk($matchingreleasedattributes, function (&$val, $key, $allcasattributes) use ($cas_auth_prefix) {
            // Find the matching key in $allcasattributes
            \reset($allcasattributes);
            while (list($akey, $aval) = \each($allcasattributes)) {
                if (\strtoupper(\substr($akey, \strlen($cas_auth_prefix))) == \strtoupper($key)) {
                    $val = $aval;
                    \end($allcasattributes);
                }
            }
        });
        \reset($allcasattributes);
        while (list($akey, $aval) = \each($allcasattributes)) {
            // $akey not in $matchingreleasedattributes
            if (!\in_array(\strtoupper(\substr($akey, \strlen($cas_auth_prefix))), \array_map('strtoupper', \array_keys($matchingreleasedattributes)))) {
                $remainingattributes[\strtolower(\substr($akey, \strlen($cas_auth_prefix)))] = $aval;
            }
        }

        return \array_merge($matchingreleasedattributes, ($request->hasHeader('AUTH_PRINCIPAL')) ? ['username' => $request->getHeaderLine('AUTH_PRINCIPAL')] : [], $remainingattributes);
    }
    /**
     * Returns a list of known released attributes.
     *
     * @return array An array of released attribute names in native camel case
     */
    public function getReleasedAttributeNames(): array
    {
        return [
            'uid',
            'eduPersonPrimaryAffiliation',
            'CommonName',
            'GivenName',
            'Surname',
            'USFeduUnumber',
            'USFeduEmplid',
            'namsid',
            'mail',
            'USFeduDepartment',
            'USFeduCampus',
            'MailStop',
            'USFeduDepartment',
            'USFeduCollege',
            'Title',
            'Phone',
            'USFeduHost',
            'eduPersonEntitlement',
            'USFeduPrivacy',
            'eduPersonAffiliation',
            'USFeduPrimaryAffiliation',
            'USFeduOfficialGivenname',
            'USFeduOfficialMiddlename',
            'USFeduOfficialSurname',
            'MemberOf',
        ];
    }
}


text:
package com.intellij.lang.jsgraphql.types;

import java.util.Map;
import java.util.Optional;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.ConcurrentMap;
import java.util.stream.Stream;

import static com.intellij.lang.jsgraphql.types.Assert.assertNotNull;

/**
 * This context object can be used to contain key values that can be useful as "context" when executing
 * {@link graphql.schema.DataFetcher}s
 *
 * <pre>
 * {@code
 *     DataFetcher df = new DataFetcher() {
 *        public Object get(DataFetchingEnvironment env) {
 *            GraphQLContext ctx = env.getContext()
 *            User currentUser = ctx.getOrDefault("userKey",new AnonymousUser())
 *            ...
 *        }
 *     }
 * }
 * </pre>
 *
 * You can set this up via {@link ExecutionInput.Builder#context(Builder)}
 */
@PublicApi
@ThreadSafe
@SuppressWarnings("unchecked")
public class GraphQLContext {

    private final ConcurrentMap<Object, Object> map;

    private GraphQLContext(ConcurrentMap<Object, Object> map) {
        this.map = map;
    }

    public void delete(Object key) {
        map.remove(assertNotNull(key));
    }

    public <T> T get(Object key) {
        return (T) map.get(assertNotNull(key));
    }

    public <T> T getOrDefault(Object key, T defaultValue) {
        return (T) map.getOrDefault(assertNotNull(key), defaultValue);
    }

    public <T> Optional<T> getOrEmpty(Object key) {
        T t = (T) map.get(assertNotNull(key));
        return Optional.ofNullable(t);
    }

    public boolean hasKey(Object key) {
        return map.containsKey(assertNotNull(key));
    }

    public void put(Object key, Object value) {
        map.put(assertNotNull(key), assertNotNull(value));
    }

    public void putAll(GraphQLContext context) {
        assertNotNull(context);
        for (Map.Entry<Object, Object> entry : context.map.entrySet()) {
            put(entry.getKey(), entry.getValue());
        }
    }

    public Stream<Map.Entry<Object, Object>> stream() {
        return map.entrySet().stream();
    }

    public static Builder newContext() {
        return new Builder();
    }

    public static class Builder {
        private final ConcurrentMap<Object, Object> map = new ConcurrentHashMap<>();

        public Builder of(
                Object key1, Object value1
        ) {
            return putImpl(
                    key1, value1
            );
        }

        public Builder of(
                Object key1, Object value1,
                Object key2, Object value2
        ) {
            return putImpl(
                    key1, value1,
                    key2, value2
            );
        }

        public Builder of(
                Object key1, Object value1,
                Object key2, Object value2,
                Object key3, Object value3
        ) {
            return putImpl(
                    key1, value1,
                    key2, value2,
                    key3, value3
            );
        }

        public Builder of(
                Object key1, Object value1,
                Object key2, Object value2,
                Object key3, Object value3,
                Object key4, Object value4
        ) {
            return putImpl(
                    key1, value1,
                    key2, value2,
                    key3, value3,
                    key4, value4
            );
        }

        public Builder of(
                Object key1, Object value1,
                Object key2, Object value2,
                Object key3, Object value3,
                Object key4, Object value4,
                Object key5, Object value5
        ) {
            return putImpl(
                    key1, value1,
                    key2, value2,
                    key3, value3,
                    key4, value4,
                    key5, value5
            );
        }

        private Builder putImpl(Object... kvs) {
            for (int i = 0; i < kvs.length; i = i + 2) {
                Object k = kvs[i];
                Object v = kvs[i + 1];
                map.put(assertNotNull(k), assertNotNull(v));
            }
            return this;
        }

        public GraphQLContext build() {
            return new GraphQLContext(map);
        }
    }
}


text:
//---------------------------
// Includes
//---------------------------
#include "Explosion.h"

//---------------------------
// Defines
//---------------------------
#define GAME_ENGINE (GameEngine::GetSingleton())

//---------------------------
// Constructor & Destructor
//---------------------------
Bitmap *Explosion::m_BmpSpritePtr= 0;

Explosion::Explosion(DOUBLE2 pos, DOUBLE2 velocity): ObjectBase(pos), m_AnimationTick(0), m_Velocity(velocity)
{
	m_Pos= pos;

	if( m_BmpSpritePtr==0 ){
		m_BmpSpritePtr= new Bitmap("recources/Explosion.png"); //14 frames
		m_BmpSpritePtr->SetTransparencyColor(255,0,255);
	}
	m_SpriteSize.x= m_BmpSpritePtr->GetWidth()/15; // geew width
	m_SpriteSize.y= m_BmpSpritePtr->GetHeight();
	m_AnimationSpeed= 0.3+ (double)( rand()%100 )/100;
}

Explosion::~Explosion(){}
//---------------------------
// Own methods
//---------------------------

void Explosion::Tick(double deltaTime){
	m_Pos+= m_Velocity * deltaTime;
	m_AnimationTick+= m_AnimationSpeed  * deltaTime*60;
	if( m_AnimationTick>=14 ) m_ObjectListPtr->Delete(this);
}

void Explosion::Paint(){

	if( m_AnimationTick>=14 ) m_AnimationTick= 0;

	MATRIX3X2 matCenter, matScale, matTranslate;
	matCenter.	 SetAsTranslate( -m_SpriteSize/2 );
	//matScale.	SetAsScale( (m_Radius) / m_BmpSpritePtr->GetWidth() );
	matTranslate.SetAsTranslate( m_Pos );
	GAME_ENGINE->SetTransformMatrix(matCenter /* matScale*/ * matTranslate * (*m_MatViewPtr));

	RECT2 clip;
	clip.left  = m_SpriteSize.x*(int)m_AnimationTick;
	clip.top   = 0;
	clip.right = clip.left+  m_SpriteSize.x;
	clip.bottom= clip.top +  m_SpriteSize.y;

	GAME_ENGINE->DrawBitmap(m_BmpSpritePtr, 0,0, clip);

}


text:
//
//  HDCellMaker.m
//
//  Created by 洪东 on 7/15/16.
//  Copyright © 2016 Cocbin. All rights reserved.
//

#import "HDCellMaker.h"
#import "HDCellData.h"

@implementation HDCellMaker

- (instancetype)initWithTableView:(UITableView *)tableView{
    self = [super init];
    if (self) {
        self.cellData.tableView = tableView;
    }
    return self;

}

- (NSIndexPath *)indexPath{
    return self.cellData.indexPath;
}

- (HDCellMaker * (^)())hd_autoHeight {
    return ^HDCellMaker * {
        self.cellData.isAutoHeight = YES;
        return self;
    };
}

- (HDCellMaker * (^)(CGFloat))hd_rowHeight{
    return ^HDCellMaker *(CGFloat height){
        self.cellData.rowHeight = height;
        return self;
    };
}

- (HDCellMaker * (^)(Class))hd_cellClass {
    return ^HDCellMaker *(Class cell) {
        self.cellData.cellRegisterType = HDCellRegisterTypeClass;
        self.cellData.cell = cell;
        return self;
    };
}

- (HDCellMaker * (^)(Class))hd_cellClassXib {
    return ^HDCellMaker *(Class cell) {
        self.cellData.cellRegisterType = HDCellRegisterTypeXib;
        self.cellData.cell = cell;
        return self;
    };
}

- (HDCellMaker * (^)(id))hd_data {
    return ^HDCellMaker *(id data) {
        self.cellData.data = data;
        return self;
    };
}

- (HDCellMaker * (^)(CellAdapterBlock))hd_adapter {
    return ^HDCellMaker *(CellAdapterBlock adapterBlock) {
        self.cellData.adapter = adapterBlock;
        return self;
    };
}

- (HDCellMaker * (^)(Class,CellAdapterBlock))hd_cellClassAndAdapter{
    return ^HDCellMaker *(Class cell,CellAdapterBlock adapterBlock) {
        self.cellData.cell = cell;
        self.cellData.adapter = adapterBlock;
        return self;
    };
}
- (HDCellMaker * (^)(CellEventBlock))hd_event {
    return ^HDCellMaker *(CellEventBlock event) {
        self.cellData.event = event;
        return self;
    };
}

/**
 *  GET
 */
- (HDCellData *)cellData
{
    if (!_cellData) {
        _cellData = [HDCellData new];
    }
    return _cellData;
}

@end


text:
package at.mavila.scheduler.jpa.repositories;

import static org.assertj.core.api.Assertions.assertThat;

import java.util.List;

import org.apache.log4j.BasicConfigurator;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.data.jpa.repository.config.EnableJpaRepositories;
import org.springframework.test.context.ContextConfiguration;
import org.springframework.test.context.testng.AbstractTestNGSpringContextTests;
import org.springframework.transaction.annotation.EnableTransactionManagement;
import org.testng.annotations.BeforeClass;
import org.testng.annotations.Test;

import at.mavila.scheduler.jpa.entities.Email;

/**
 * Created by mavila on 27.08.16.
 */
//@RunWith(SpringJUnit4ClassRunner.class)
@ContextConfiguration(locations = {"/META-INF/spring-config-in-memory.xml"})
@EnableJpaRepositories
@EnableTransactionManagement
public class EmailRepositoryInMemoryTest extends AbstractTestNGSpringContextTests {

    private static final Logger LOGGER = LoggerFactory.getLogger(EmailRepositoryInMemoryTest.class);

    @Autowired
    protected EmailRepository emailRepository;

    @BeforeClass
    public static void setUp() throws Exception {
        BasicConfigurator.configure();
    }

    @Test
    public void testFindByUsername() throws Exception {

        final List<Email> emailsFromUser = emailRepository.findByUsername("andybuston");

        LOGGER.info("Emails from user {}",emailsFromUser);
        assertThat(emailsFromUser).isNotNull();

    }

}


text:
namespace google_public {
namespace protobuf {
namespace compiler {
namespace java {

// CodeGenerator implementation which generates Java code.  If you create your
// own protocol compiler binary and you want it to support Java output, you
// can do so by registering an instance of this CodeGenerator with the
// CommandLineInterface in your main() function.
class LIBPROTOC_EXPORT JavaGenerator : public CodeGenerator {
 public:
  JavaGenerator();
  ~JavaGenerator();

  // implements CodeGenerator ----------------------------------------
  bool Generate(const FileDescriptor* file,
                const string& parameter,
                GeneratorContext* context,
                string* error) const;

 private:
  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(JavaGenerator);
};

}  // namespace java
}  // namespace compiler
}  // namespace protobuf

}  // namespace google
#endif  // GOOGLE_PROTOBUF_COMPILER_JAVA_GENERATOR_H__


text:
import web
import models
import json
import datetime
import util

t_globals = {
    'datstr': web.datestr,
}
view = web.template.render('views/', base='base', globals=t_globals)

class Watch:
    def GET(self,id):
        v = models.get_video(id)
        return view.watch(v)

class Queue:
    def GET(self):
        qs = models.get_all_queue()
        #print qs
        count = 0
        if qs:
            count = len(qs)
        return view.queue(qs,count)

class Fetch:
    def GET(self):
        return view.fetch_form()

    def POST(self):
        url = web.input().url
        origid = util.get_origid(url)

       #metajson = {}
        #metajson['ytid'] = ytid
        #options = json.dumps(metajson)
        #metaitem = {}
        #metaitem['status'] = models.WAITING
        datest = datetime.datetime.now().isoformat(' ')
        #print datest
        datest = datetime.datetime.now().isoformat(' ')
        models.add_new_video(url, origid, datest)
        #models.add_queue(models.WAITING, models.META, options, datest)
        #models.add_queue(models.WAITING, models.THUMB, options, datest)
        #models.add_queue(models.WAITING, models.VIDEO, options, datest)

        web.seeother('/queue')

class Index:
    def GET(self):
        videos = models.get_all_done_videos()
        if videos:
            count = len(videos)
        else:
            count = 0
        return view.index(videos,count)


text:
require 'json'

class ProxyService

  class << self
    attr_accessor :proxies_enabled, :username, :password, :failure_limit, :failure_codes

    def configure
      yield self
    end
  end

  attr_accessor :source, :failure_limit, :failure_codes
  attr_writer :proxies_enabled
  attr_reader :proxy

  # = Create a new proxy service with for a specific ODS
  #
  # @param [String, Symbol] source name of the ODS (e.g. :trip_advisor), will look for a queue with that name "proxy/#{source}"
  # @param [Hash] options
  # @option options [Boolean] :proxies_enabled override the class configuration
  # @option options [Integer] :failure_limit before blocking the proxy
  # @option options [Array]   :failure_codes that indicate a proxy was blocked by the site
  def initialize(source, options = {})
    @source = source
    @proxies_enabled = options.fetch(:proxies_enabled, !!self.class.proxies_enabled)
    @failure_limit = options.fetch(:failure_limit, self.class.failure_limit || 3)
    @failure_codes = options.fetch(:failure_codes, self.class.failure_codes || %w[403])
  end

  # @yield [agent] Passes a [proxied] Mechanize agent to the block
  def with_mechanize
    @proxy = reserve_proxy
    agent = MechanizeAgent.new
    agent.set_proxy(proxy)
    yield agent
    proxy.reset_failures
  rescue Mechanize::ResponseCodeError => e
    block_or_increment_proxy if failure_codes.include?(e.response_code)
  rescue ProxyBlockedError, ReCaptchaError
    block_or_increment_proxy
  ensure
    proxy.release
  end

  #
  # Private
  #

  def block_or_increment_proxy
    if proxy.failures >= failure_limit
      proxy.blocked!
    else
      proxy.increment_failures
    end
  end

  def proxies_enabled?
    @proxies_enabled
  end

  # = Sleeps until the worker receives a proxy (message)
  #
  # @return [Proxy] a new proxy object
  def reserve_proxy
    worker = new_worker
    worker.subscribe
    loop do
      if worker.ready?
        return Proxy.new(worker)
      else
        sleep(1)
      end
    end
  end

  def new_worker
    if proxies_enabled?
      Worker.new("proxy/#{source}")
    else
      NullWorker.new
    end
  end

  #
  # Custom errors
  #

  class ProxyBlockedError < StandardError
  end

  class ReCaptchaError < StandardError
  end
end

require 'proxy_service/mechanize_agent'
require 'proxy_service/null_worker'
require 'proxy_service/proxy'
require 'proxy_service/worker'