jhaddix

.
..
........
@
*
*.*
*.*.*
🐎

its-a-feature

Domain: TEST.local
User Enumeration:
  Windows:
    net user
    net user /domain
    net user [username]
    net user [username] /domain
    wmic useraccount
  Mac:
    dscl . ls /Users

HarshadRanganathan

def getProjectName() {
    return 'JenkinsPipeline'
}

def getJDKVersion() {
    return 'jdk1.8.0_101'
}

def getMavenConfig() {
    return 'maven-config'

davidfowl

$/
  artifacts/
  build/
  docs/
  lib/
  packages/
  samples/
  src/
 tests/

Thermionix

<NotepadPlus>
    <UserLang name="Groovy" ext="groovy" udlVersion="2.1">
        <Settings>
            <Global caseIgnored="no" />
            <Prefix Keywords1="no" Keywords2="no" Keywords3="no" Keywords4="no" />
        </Settings>
        <KeywordLists>
            <Keywords name="Comments">03/* 04*/ 00// 01 02</Keywords>
            <Keywords name="Keywords1">abstract break case catch continue default do else extends final finally for if implements instanceof native new private protected public return static switch synchronized throw throws transient try volatile while strictfp package import false null super this true</Keywords>
            <Keywords name="Keywords2">as assert def mixin property test using in it</Keywords>

mdp

/**
 * Luhn Class is an implementation of the Luhn algorithm that checks validity of a credit card number.
 * 
 * @author <a href="http://www.chriswareham.demon.co.uk/software/Luhn.java">Chris Wareham</a>
 * @version Checks whether a string of digits is a valid credit card number according to the Luhn algorithm. 1. Starting with the second to last digit and
 *           moving left, double the value of all the alternating digits. For any digits that thus become 10 or more, add their digits together. For example,
 *           1111 becomes 2121, while 8763 becomes 7733 (from (1+6)7(1+2)3). 2. Add all these digits together. For example, 1111 becomes 2121, then 2+1+2+1 is
 *           6; while 8763 becomes 7733, then 7+7+3+3 is 20. 3. If the total ends in 0 (put another way, if the total modulus 10 is 0), then the number is valid
 *           according to the Luhn formula, else it is not valid. So, 1111 is not valid (as shown above, it comes out to 6), while 8763 is valid (as shown
 *           above, it comes ou

kdabir

// MarkupBuilder is a lot cleaner way of generating valid xml/html markup
// than writing tags as string and forgetting to close one ;)

def writer = new StringWriter()  // html is written here by markup builder
def markup = new groovy.xml.MarkupBuilder(writer)  // the builder
 
markup.html{
    table {
        tr {
            td(class:"row", "hello world!")