\n *\n * Permission to use, copy, modify, and distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n */\n\npackage spew\n\nimport (\n\t\"fmt\"\n\t\"io\"\n)\n\n// Errorf is a wrapper for fmt.Errorf that treats each argument as if it were\n// passed with a default Formatter interface returned by NewFormatter. It\n// returns the formatted string as a value that satisfies error. See\n// NewFormatter for formatting details.\n//\n// This function is shorthand for the following syntax:\n//\n//\tfmt.Errorf(format, spew.NewFormatter(a), spew.NewFormatter(b))\nfunc Errorf(format string, a ...interface{}) (err error) {\n\treturn fmt.Errorf(format, convertArgs(a)...)\n}\n\n// Fprint is a wrapper for fmt.Fprint that treats each argument as if it were\n// passed with a default Formatter interface returned by NewFormatter. It\n// returns the number of bytes written and any write error encountered. See\n// NewFormatter for formatting details.\n//\n// This function is shorthand for the following syntax:\n//\n//\tfmt.Fprint(w, spew.NewFormatter(a), spew.NewFormatter(b))\nfunc Fprint(w io.Writer, a ...interface{}) (n int, err error) {\n\treturn fmt.Fprint(w, convertArgs(a)...)\n}\n\n// Fprintf is a wrapper for fmt.Fprintf that treats each argument as if it were\n// passed with a default Formatter interface returned by NewFormatter. It\n// returns the number of bytes written and any write error encountered. See\n// NewFormatter for formatting details.\n//\n// This function is shorthand for the following syntax:\n//\n//\tfmt.Fprintf(w, format, spew.NewFormatter(a), spew.NewFormatter(b))\nfunc Fprintf(w io.Writer, format string, a ...interface{}) (n int, err error) {\n\treturn fmt.Fprintf(w, format, convertArgs(a)...)\n}\n\n// Fprintln is a wrapper for fmt.Fprintln that treats each argument as if it\n// passed with a default Formatter interface returned by NewFormatter. See\n// NewFormatter for formatting details.\n//\n// This function is shorthand for the following syntax:\n//\n//\tfmt.Fprintln(w, spew.NewFormatter(a), spew.NewFormatter(b))\nfunc Fprintln(w io.Writer, a ...interface{}) (n int, err error) {\n\treturn fmt.Fprintln(w, convertArgs(a)...)\n}\n\n// Print is a wrapper for fmt.Print that treats each argument as if it were\n// passed with a default Formatter interface returned by NewFormatter. It\n// returns the number of bytes written and any write error encountered. See\n// NewFormatter for formatting details.\n//\n// This function is shorthand for the following syntax:\n//\n//\tfmt.Print(spew.NewFormatter(a), spew.NewFormatter(b))\nfunc Print(a ...interface{}) (n int, err error) {\n\treturn fmt.Print(convertArgs(a)...)\n}\n\n// Printf is a wrapper for fmt.Printf that treats each argument as if it were\n// passed with a default Formatter interface returned by NewFormatter. It\n// returns the number of bytes written and any write error encountered. See\n// NewFormatter for formatting details.\n//\n// This function is shorthand for the following syntax:\n//\n//\tfmt.Printf(format, spew.NewFormatter(a), spew.NewFormatter(b))\nfunc Printf(format string, a ...interface{}) (n int, err error) {\n\treturn fmt.Printf(format, convertArgs(a)...)\n}\n\n// Println is a wrapper for fmt.Println that treats each argument as if it were\n// passed with a default Formatter interface returned by NewFormatter. It\n// returns the number of bytes written and any write error encountered. See\n// NewFormatter for formatting details.\n//\n// This function is shorthand for the following syntax:\n//\n//\tfmt.Println(spew.NewFormatter(a), spew.NewFormatter(b))\nfunc Println(a ...interface{}) (n int, err error) {\n\treturn fmt.Println(convertArgs(a)...)\n}\n\n// Sprint is a wrapper for fmt.Sprint that treats each argument as if it were\n// passed with a default Formatter interface returned by NewFormatter. It\n// returns the resulting string. See NewFormatter for formatting details.\n//\n// This function is shorthand for the following syntax:\n//\n//\tfmt.Sprint(spew.NewFormatter(a), spew.NewFormatter(b))\nfunc Sprint(a ...interface{}) string {\n\treturn fmt.Sprint(convertArgs(a)...)\n}\n\n// Sprintf is a wrapper for fmt.Sprintf that treats each argument as if it were\n// passed with a default Formatter interface returned by NewFormatter. It\n// returns the resulting string. See NewFormatter for formatting details.\n//\n// This function is shorthand for the following syntax:\n//\n//\tfmt.Sprintf(format, spew.NewFormatter(a), spew.NewFormatter(b))\nfunc Sprintf(format string, a ...interface{}) string {\n\treturn fmt.Sprintf(format, convertArgs(a)...)\n}\n\n// Sprintln is a wrapper for fmt.Sprintln that treats each argument as if it\n// were passed with a default Formatter interface returned by NewFormatter. It\n// returns the resulting string. See NewFormatter for formatting details.\n//\n// This function is shorthand for the following syntax:\n//\n//\tfmt.Sprintln(spew.NewFormatter(a), spew.NewFormatter(b))\nfunc Sprintln(a ...interface{}) string {\n\treturn fmt.Sprintln(convertArgs(a)...)\n}\n\n// convertArgs accepts a slice of arguments and returns a slice of the same\n// length with each argument converted to a default spew Formatter interface.\nfunc convertArgs(args []interface{}) (formatters []interface{}) {\n\tformatters = make([]interface{}, len(args))\n\tfor index, arg := range args {\n\t\tformatters[index] = NewFormatter(arg)\n\t}\n\treturn formatters\n}\n"
},
{
"path": "src/github.com/stretchr/testify/vendor/github.com/pmezard/go-difflib/LICENSE",
"content": "Copyright (c) 2013, Patrick Mezard\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are\nmet:\n\n Redistributions of source code must retain the above copyright\nnotice, this list of conditions and the following disclaimer.\n Redistributions in binary form must reproduce the above copyright\nnotice, this list of conditions and the following disclaimer in the\ndocumentation and/or other materials provided with the distribution.\n The names of its contributors may not be used to endorse or promote\nproducts derived from this software without specific prior written\npermission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\nIS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\nTO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A\nPARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\nHOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED\nTO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\nPROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\nNEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n"
},
{
"path": "src/github.com/stretchr/testify/vendor/github.com/pmezard/go-difflib/difflib/difflib.go",
"content": "// Package difflib is a partial port of Python difflib module.\n//\n// It provides tools to compare sequences of strings and generate textual diffs.\n//\n// The following class and functions have been ported:\n//\n// - SequenceMatcher\n//\n// - unified_diff\n//\n// - context_diff\n//\n// Getting unified diffs was the main goal of the port. Keep in mind this code\n// is mostly suitable to output text differences in a human friendly way, there\n// are no guarantees generated diffs are consumable by patch(1).\npackage difflib\n\nimport (\n\t\"bufio\"\n\t\"bytes\"\n\t\"fmt\"\n\t\"io\"\n\t\"strings\"\n)\n\nfunc min(a, b int) int {\n\tif a < b {\n\t\treturn a\n\t}\n\treturn b\n}\n\nfunc max(a, b int) int {\n\tif a > b {\n\t\treturn a\n\t}\n\treturn b\n}\n\nfunc calculateRatio(matches, length int) float64 {\n\tif length > 0 {\n\t\treturn 2.0 * float64(matches) / float64(length)\n\t}\n\treturn 1.0\n}\n\ntype Match struct {\n\tA int\n\tB int\n\tSize int\n}\n\ntype OpCode struct {\n\tTag byte\n\tI1 int\n\tI2 int\n\tJ1 int\n\tJ2 int\n}\n\n// SequenceMatcher compares sequence of strings. The basic\n// algorithm predates, and is a little fancier than, an algorithm\n// published in the late 1980's by Ratcliff and Obershelp under the\n// hyperbolic name \"gestalt pattern matching\". The basic idea is to find\n// the longest contiguous matching subsequence that contains no \"junk\"\n// elements (R-O doesn't address junk). The same idea is then applied\n// recursively to the pieces of the sequences to the left and to the right\n// of the matching subsequence. This does not yield minimal edit\n// sequences, but does tend to yield matches that \"look right\" to people.\n//\n// SequenceMatcher tries to compute a \"human-friendly diff\" between two\n// sequences. Unlike e.g. UNIX(tm) diff, the fundamental notion is the\n// longest *contiguous* & junk-free matching subsequence. That's what\n// catches peoples' eyes. The Windows(tm) windiff has another interesting\n// notion, pairing up elements that appear uniquely in each sequence.\n// That, and the method here, appear to yield more intuitive difference\n// reports than does diff. This method appears to be the least vulnerable\n// to synching up on blocks of \"junk lines\", though (like blank lines in\n// ordinary text files, or maybe \"\" lines in HTML files). That may be\n// because this is the only method of the 3 that has a *concept* of\n// \"junk\" .\n//\n// Timing: Basic R-O is cubic time worst case and quadratic time expected\n// case. SequenceMatcher is quadratic time for the worst case and has\n// expected-case behavior dependent in a complicated way on how many\n// elements the sequences have in common; best case time is linear.\ntype SequenceMatcher struct {\n\ta []string\n\tb []string\n\tb2j map[string][]int\n\tIsJunk func(string) bool\n\tautoJunk bool\n\tbJunk map[string]struct{}\n\tmatchingBlocks []Match\n\tfullBCount map[string]int\n\tbPopular map[string]struct{}\n\topCodes []OpCode\n}\n\nfunc NewMatcher(a, b []string) *SequenceMatcher {\n\tm := SequenceMatcher{autoJunk: true}\n\tm.SetSeqs(a, b)\n\treturn &m\n}\n\nfunc NewMatcherWithJunk(a, b []string, autoJunk bool,\n\tisJunk func(string) bool) *SequenceMatcher {\n\n\tm := SequenceMatcher{IsJunk: isJunk, autoJunk: autoJunk}\n\tm.SetSeqs(a, b)\n\treturn &m\n}\n\n// Set two sequences to be compared.\nfunc (m *SequenceMatcher) SetSeqs(a, b []string) {\n\tm.SetSeq1(a)\n\tm.SetSeq2(b)\n}\n\n// Set the first sequence to be compared. The second sequence to be compared is\n// not changed.\n//\n// SequenceMatcher computes and caches detailed information about the second\n// sequence, so if you want to compare one sequence S against many sequences,\n// use .SetSeq2(s) once and call .SetSeq1(x) repeatedly for each of the other\n// sequences.\n//\n// See also SetSeqs() and SetSeq2().\nfunc (m *SequenceMatcher) SetSeq1(a []string) {\n\tif &a == &m.a {\n\t\treturn\n\t}\n\tm.a = a\n\tm.matchingBlocks = nil\n\tm.opCodes = nil\n}\n\n// Set the second sequence to be compared. The first sequence to be compared is\n// not changed.\nfunc (m *SequenceMatcher) SetSeq2(b []string) {\n\tif &b == &m.b {\n\t\treturn\n\t}\n\tm.b = b\n\tm.matchingBlocks = nil\n\tm.opCodes = nil\n\tm.fullBCount = nil\n\tm.chainB()\n}\n\nfunc (m *SequenceMatcher) chainB() {\n\t// Populate line -> index mapping\n\tb2j := map[string][]int{}\n\tfor i, s := range m.b {\n\t\tindices := b2j[s]\n\t\tindices = append(indices, i)\n\t\tb2j[s] = indices\n\t}\n\n\t// Purge junk elements\n\tm.bJunk = map[string]struct{}{}\n\tif m.IsJunk != nil {\n\t\tjunk := m.bJunk\n\t\tfor s, _ := range b2j {\n\t\t\tif m.IsJunk(s) {\n\t\t\t\tjunk[s] = struct{}{}\n\t\t\t}\n\t\t}\n\t\tfor s, _ := range junk {\n\t\t\tdelete(b2j, s)\n\t\t}\n\t}\n\n\t// Purge remaining popular elements\n\tpopular := map[string]struct{}{}\n\tn := len(m.b)\n\tif m.autoJunk && n >= 200 {\n\t\tntest := n/100 + 1\n\t\tfor s, indices := range b2j {\n\t\t\tif len(indices) > ntest {\n\t\t\t\tpopular[s] = struct{}{}\n\t\t\t}\n\t\t}\n\t\tfor s, _ := range popular {\n\t\t\tdelete(b2j, s)\n\t\t}\n\t}\n\tm.bPopular = popular\n\tm.b2j = b2j\n}\n\nfunc (m *SequenceMatcher) isBJunk(s string) bool {\n\t_, ok := m.bJunk[s]\n\treturn ok\n}\n\n// Find longest matching block in a[alo:ahi] and b[blo:bhi].\n//\n// If IsJunk is not defined:\n//\n// Return (i,j,k) such that a[i:i+k] is equal to b[j:j+k], where\n// alo <= i <= i+k <= ahi\n// blo <= j <= j+k <= bhi\n// and for all (i',j',k') meeting those conditions,\n// k >= k'\n// i <= i'\n// and if i == i', j <= j'\n//\n// In other words, of all maximal matching blocks, return one that\n// starts earliest in a, and of all those maximal matching blocks that\n// start earliest in a, return the one that starts earliest in b.\n//\n// If IsJunk is defined, first the longest matching block is\n// determined as above, but with the additional restriction that no\n// junk element appears in the block. Then that block is extended as\n// far as possible by matching (only) junk elements on both sides. So\n// the resulting block never matches on junk except as identical junk\n// happens to be adjacent to an \"interesting\" match.\n//\n// If no blocks match, return (alo, blo, 0).\nfunc (m *SequenceMatcher) findLongestMatch(alo, ahi, blo, bhi int) Match {\n\t// CAUTION: stripping common prefix or suffix would be incorrect.\n\t// E.g.,\n\t// ab\n\t// acab\n\t// Longest matching block is \"ab\", but if common prefix is\n\t// stripped, it's \"a\" (tied with \"b\"). UNIX(tm) diff does so\n\t// strip, so ends up claiming that ab is changed to acab by\n\t// inserting \"ca\" in the middle. That's minimal but unintuitive:\n\t// \"it's obvious\" that someone inserted \"ac\" at the front.\n\t// Windiff ends up at the same place as diff, but by pairing up\n\t// the unique 'b's and then matching the first two 'a's.\n\tbesti, bestj, bestsize := alo, blo, 0\n\n\t// find longest junk-free match\n\t// during an iteration of the loop, j2len[j] = length of longest\n\t// junk-free match ending with a[i-1] and b[j]\n\tj2len := map[int]int{}\n\tfor i := alo; i != ahi; i++ {\n\t\t// look at all instances of a[i] in b; note that because\n\t\t// b2j has no junk keys, the loop is skipped if a[i] is junk\n\t\tnewj2len := map[int]int{}\n\t\tfor _, j := range m.b2j[m.a[i]] {\n\t\t\t// a[i] matches b[j]\n\t\t\tif j < blo {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif j >= bhi {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tk := j2len[j-1] + 1\n\t\t\tnewj2len[j] = k\n\t\t\tif k > bestsize {\n\t\t\t\tbesti, bestj, bestsize = i-k+1, j-k+1, k\n\t\t\t}\n\t\t}\n\t\tj2len = newj2len\n\t}\n\n\t// Extend the best by non-junk elements on each end. In particular,\n\t// \"popular\" non-junk elements aren't in b2j, which greatly speeds\n\t// the inner loop above, but also means \"the best\" match so far\n\t// doesn't contain any junk *or* popular non-junk elements.\n\tfor besti > alo && bestj > blo && !m.isBJunk(m.b[bestj-1]) &&\n\t\tm.a[besti-1] == m.b[bestj-1] {\n\t\tbesti, bestj, bestsize = besti-1, bestj-1, bestsize+1\n\t}\n\tfor besti+bestsize < ahi && bestj+bestsize < bhi &&\n\t\t!m.isBJunk(m.b[bestj+bestsize]) &&\n\t\tm.a[besti+bestsize] == m.b[bestj+bestsize] {\n\t\tbestsize += 1\n\t}\n\n\t// Now that we have a wholly interesting match (albeit possibly\n\t// empty!), we may as well suck up the matching junk on each\n\t// side of it too. Can't think of a good reason not to, and it\n\t// saves post-processing the (possibly considerable) expense of\n\t// figuring out what to do with it. In the case of an empty\n\t// interesting match, this is clearly the right thing to do,\n\t// because no other kind of match is possible in the regions.\n\tfor besti > alo && bestj > blo && m.isBJunk(m.b[bestj-1]) &&\n\t\tm.a[besti-1] == m.b[bestj-1] {\n\t\tbesti, bestj, bestsize = besti-1, bestj-1, bestsize+1\n\t}\n\tfor besti+bestsize < ahi && bestj+bestsize < bhi &&\n\t\tm.isBJunk(m.b[bestj+bestsize]) &&\n\t\tm.a[besti+bestsize] == m.b[bestj+bestsize] {\n\t\tbestsize += 1\n\t}\n\n\treturn Match{A: besti, B: bestj, Size: bestsize}\n}\n\n// Return list of triples describing matching subsequences.\n//\n// Each triple is of the form (i, j, n), and means that\n// a[i:i+n] == b[j:j+n]. The triples are monotonically increasing in\n// i and in j. It's also guaranteed that if (i, j, n) and (i', j', n') are\n// adjacent triples in the list, and the second is not the last triple in the\n// list, then i+n != i' or j+n != j'. IOW, adjacent triples never describe\n// adjacent equal blocks.\n//\n// The last triple is a dummy, (len(a), len(b), 0), and is the only\n// triple with n==0.\nfunc (m *SequenceMatcher) GetMatchingBlocks() []Match {\n\tif m.matchingBlocks != nil {\n\t\treturn m.matchingBlocks\n\t}\n\n\tvar matchBlocks func(alo, ahi, blo, bhi int, matched []Match) []Match\n\tmatchBlocks = func(alo, ahi, blo, bhi int, matched []Match) []Match {\n\t\tmatch := m.findLongestMatch(alo, ahi, blo, bhi)\n\t\ti, j, k := match.A, match.B, match.Size\n\t\tif match.Size > 0 {\n\t\t\tif alo < i && blo < j {\n\t\t\t\tmatched = matchBlocks(alo, i, blo, j, matched)\n\t\t\t}\n\t\t\tmatched = append(matched, match)\n\t\t\tif i+k < ahi && j+k < bhi {\n\t\t\t\tmatched = matchBlocks(i+k, ahi, j+k, bhi, matched)\n\t\t\t}\n\t\t}\n\t\treturn matched\n\t}\n\tmatched := matchBlocks(0, len(m.a), 0, len(m.b), nil)\n\n\t// It's possible that we have adjacent equal blocks in the\n\t// matching_blocks list now.\n\tnonAdjacent := []Match{}\n\ti1, j1, k1 := 0, 0, 0\n\tfor _, b := range matched {\n\t\t// Is this block adjacent to i1, j1, k1?\n\t\ti2, j2, k2 := b.A, b.B, b.Size\n\t\tif i1+k1 == i2 && j1+k1 == j2 {\n\t\t\t// Yes, so collapse them -- this just increases the length of\n\t\t\t// the first block by the length of the second, and the first\n\t\t\t// block so lengthened remains the block to compare against.\n\t\t\tk1 += k2\n\t\t} else {\n\t\t\t// Not adjacent. Remember the first block (k1==0 means it's\n\t\t\t// the dummy we started with), and make the second block the\n\t\t\t// new block to compare against.\n\t\t\tif k1 > 0 {\n\t\t\t\tnonAdjacent = append(nonAdjacent, Match{i1, j1, k1})\n\t\t\t}\n\t\t\ti1, j1, k1 = i2, j2, k2\n\t\t}\n\t}\n\tif k1 > 0 {\n\t\tnonAdjacent = append(nonAdjacent, Match{i1, j1, k1})\n\t}\n\n\tnonAdjacent = append(nonAdjacent, Match{len(m.a), len(m.b), 0})\n\tm.matchingBlocks = nonAdjacent\n\treturn m.matchingBlocks\n}\n\n// Return list of 5-tuples describing how to turn a into b.\n//\n// Each tuple is of the form (tag, i1, i2, j1, j2). The first tuple\n// has i1 == j1 == 0, and remaining tuples have i1 == the i2 from the\n// tuple preceding it, and likewise for j1 == the previous j2.\n//\n// The tags are characters, with these meanings:\n//\n// 'r' (replace): a[i1:i2] should be replaced by b[j1:j2]\n//\n// 'd' (delete): a[i1:i2] should be deleted, j1==j2 in this case.\n//\n// 'i' (insert): b[j1:j2] should be inserted at a[i1:i1], i1==i2 in this case.\n//\n// 'e' (equal): a[i1:i2] == b[j1:j2]\nfunc (m *SequenceMatcher) GetOpCodes() []OpCode {\n\tif m.opCodes != nil {\n\t\treturn m.opCodes\n\t}\n\ti, j := 0, 0\n\tmatching := m.GetMatchingBlocks()\n\topCodes := make([]OpCode, 0, len(matching))\n\tfor _, m := range matching {\n\t\t// invariant: we've pumped out correct diffs to change\n\t\t// a[:i] into b[:j], and the next matching block is\n\t\t// a[ai:ai+size] == b[bj:bj+size]. So we need to pump\n\t\t// out a diff to change a[i:ai] into b[j:bj], pump out\n\t\t// the matching block, and move (i,j) beyond the match\n\t\tai, bj, size := m.A, m.B, m.Size\n\t\ttag := byte(0)\n\t\tif i < ai && j < bj {\n\t\t\ttag = 'r'\n\t\t} else if i < ai {\n\t\t\ttag = 'd'\n\t\t} else if j < bj {\n\t\t\ttag = 'i'\n\t\t}\n\t\tif tag > 0 {\n\t\t\topCodes = append(opCodes, OpCode{tag, i, ai, j, bj})\n\t\t}\n\t\ti, j = ai+size, bj+size\n\t\t// the list of matching blocks is terminated by a\n\t\t// sentinel with size 0\n\t\tif size > 0 {\n\t\t\topCodes = append(opCodes, OpCode{'e', ai, i, bj, j})\n\t\t}\n\t}\n\tm.opCodes = opCodes\n\treturn m.opCodes\n}\n\n// Isolate change clusters by eliminating ranges with no changes.\n//\n// Return a generator of groups with up to n lines of context.\n// Each group is in the same format as returned by GetOpCodes().\nfunc (m *SequenceMatcher) GetGroupedOpCodes(n int) [][]OpCode {\n\tif n < 0 {\n\t\tn = 3\n\t}\n\tcodes := m.GetOpCodes()\n\tif len(codes) == 0 {\n\t\tcodes = []OpCode{OpCode{'e', 0, 1, 0, 1}}\n\t}\n\t// Fixup leading and trailing groups if they show no changes.\n\tif codes[0].Tag == 'e' {\n\t\tc := codes[0]\n\t\ti1, i2, j1, j2 := c.I1, c.I2, c.J1, c.J2\n\t\tcodes[0] = OpCode{c.Tag, max(i1, i2-n), i2, max(j1, j2-n), j2}\n\t}\n\tif codes[len(codes)-1].Tag == 'e' {\n\t\tc := codes[len(codes)-1]\n\t\ti1, i2, j1, j2 := c.I1, c.I2, c.J1, c.J2\n\t\tcodes[len(codes)-1] = OpCode{c.Tag, i1, min(i2, i1+n), j1, min(j2, j1+n)}\n\t}\n\tnn := n + n\n\tgroups := [][]OpCode{}\n\tgroup := []OpCode{}\n\tfor _, c := range codes {\n\t\ti1, i2, j1, j2 := c.I1, c.I2, c.J1, c.J2\n\t\t// End the current group and start a new one whenever\n\t\t// there is a large range with no changes.\n\t\tif c.Tag == 'e' && i2-i1 > nn {\n\t\t\tgroup = append(group, OpCode{c.Tag, i1, min(i2, i1+n),\n\t\t\t\tj1, min(j2, j1+n)})\n\t\t\tgroups = append(groups, group)\n\t\t\tgroup = []OpCode{}\n\t\t\ti1, j1 = max(i1, i2-n), max(j1, j2-n)\n\t\t}\n\t\tgroup = append(group, OpCode{c.Tag, i1, i2, j1, j2})\n\t}\n\tif len(group) > 0 && !(len(group) == 1 && group[0].Tag == 'e') {\n\t\tgroups = append(groups, group)\n\t}\n\treturn groups\n}\n\n// Return a measure of the sequences' similarity (float in [0,1]).\n//\n// Where T is the total number of elements in both sequences, and\n// M is the number of matches, this is 2.0*M / T.\n// Note that this is 1 if the sequences are identical, and 0 if\n// they have nothing in common.\n//\n// .Ratio() is expensive to compute if you haven't already computed\n// .GetMatchingBlocks() or .GetOpCodes(), in which case you may\n// want to try .QuickRatio() or .RealQuickRation() first to get an\n// upper bound.\nfunc (m *SequenceMatcher) Ratio() float64 {\n\tmatches := 0\n\tfor _, m := range m.GetMatchingBlocks() {\n\t\tmatches += m.Size\n\t}\n\treturn calculateRatio(matches, len(m.a)+len(m.b))\n}\n\n// Return an upper bound on ratio() relatively quickly.\n//\n// This isn't defined beyond that it is an upper bound on .Ratio(), and\n// is faster to compute.\nfunc (m *SequenceMatcher) QuickRatio() float64 {\n\t// viewing a and b as multisets, set matches to the cardinality\n\t// of their intersection; this counts the number of matches\n\t// without regard to order, so is clearly an upper bound\n\tif m.fullBCount == nil {\n\t\tm.fullBCount = map[string]int{}\n\t\tfor _, s := range m.b {\n\t\t\tm.fullBCount[s] = m.fullBCount[s] + 1\n\t\t}\n\t}\n\n\t// avail[x] is the number of times x appears in 'b' less the\n\t// number of times we've seen it in 'a' so far ... kinda\n\tavail := map[string]int{}\n\tmatches := 0\n\tfor _, s := range m.a {\n\t\tn, ok := avail[s]\n\t\tif !ok {\n\t\t\tn = m.fullBCount[s]\n\t\t}\n\t\tavail[s] = n - 1\n\t\tif n > 0 {\n\t\t\tmatches += 1\n\t\t}\n\t}\n\treturn calculateRatio(matches, len(m.a)+len(m.b))\n}\n\n// Return an upper bound on ratio() very quickly.\n//\n// This isn't defined beyond that it is an upper bound on .Ratio(), and\n// is faster to compute than either .Ratio() or .QuickRatio().\nfunc (m *SequenceMatcher) RealQuickRatio() float64 {\n\tla, lb := len(m.a), len(m.b)\n\treturn calculateRatio(min(la, lb), la+lb)\n}\n\n// Convert range to the \"ed\" format\nfunc formatRangeUnified(start, stop int) string {\n\t// Per the diff spec at http://www.unix.org/single_unix_specification/\n\tbeginning := start + 1 // lines start numbering with one\n\tlength := stop - start\n\tif length == 1 {\n\t\treturn fmt.Sprintf(\"%d\", beginning)\n\t}\n\tif length == 0 {\n\t\tbeginning -= 1 // empty ranges begin at line just before the range\n\t}\n\treturn fmt.Sprintf(\"%d,%d\", beginning, length)\n}\n\n// Unified diff parameters\ntype UnifiedDiff struct {\n\tA []string // First sequence lines\n\tFromFile string // First file name\n\tFromDate string // First file time\n\tB []string // Second sequence lines\n\tToFile string // Second file name\n\tToDate string // Second file time\n\tEol string // Headers end of line, defaults to LF\n\tContext int // Number of context lines\n}\n\n// Compare two sequences of lines; generate the delta as a unified diff.\n//\n// Unified diffs are a compact way of showing line changes and a few\n// lines of context. The number of context lines is set by 'n' which\n// defaults to three.\n//\n// By default, the diff control lines (those with ---, +++, or @@) are\n// created with a trailing newline. This is helpful so that inputs\n// created from file.readlines() result in diffs that are suitable for\n// file.writelines() since both the inputs and outputs have trailing\n// newlines.\n//\n// For inputs that do not have trailing newlines, set the lineterm\n// argument to \"\" so that the output will be uniformly newline free.\n//\n// The unidiff format normally has a header for filenames and modification\n// times. Any or all of these may be specified using strings for\n// 'fromfile', 'tofile', 'fromfiledate', and 'tofiledate'.\n// The modification times are normally expressed in the ISO 8601 format.\nfunc WriteUnifiedDiff(writer io.Writer, diff UnifiedDiff) error {\n\tbuf := bufio.NewWriter(writer)\n\tdefer buf.Flush()\n\twf := func(format string, args ...interface{}) error {\n\t\t_, err := buf.WriteString(fmt.Sprintf(format, args...))\n\t\treturn err\n\t}\n\tws := func(s string) error {\n\t\t_, err := buf.WriteString(s)\n\t\treturn err\n\t}\n\n\tif len(diff.Eol) == 0 {\n\t\tdiff.Eol = \"\\n\"\n\t}\n\n\tstarted := false\n\tm := NewMatcher(diff.A, diff.B)\n\tfor _, g := range m.GetGroupedOpCodes(diff.Context) {\n\t\tif !started {\n\t\t\tstarted = true\n\t\t\tfromDate := \"\"\n\t\t\tif len(diff.FromDate) > 0 {\n\t\t\t\tfromDate = \"\\t\" + diff.FromDate\n\t\t\t}\n\t\t\ttoDate := \"\"\n\t\t\tif len(diff.ToDate) > 0 {\n\t\t\t\ttoDate = \"\\t\" + diff.ToDate\n\t\t\t}\n\t\t\tif diff.FromFile != \"\" || diff.ToFile != \"\" {\n\t\t\t\terr := wf(\"--- %s%s%s\", diff.FromFile, fromDate, diff.Eol)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\terr = wf(\"+++ %s%s%s\", diff.ToFile, toDate, diff.Eol)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfirst, last := g[0], g[len(g)-1]\n\t\trange1 := formatRangeUnified(first.I1, last.I2)\n\t\trange2 := formatRangeUnified(first.J1, last.J2)\n\t\tif err := wf(\"@@ -%s +%s @@%s\", range1, range2, diff.Eol); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tfor _, c := range g {\n\t\t\ti1, i2, j1, j2 := c.I1, c.I2, c.J1, c.J2\n\t\t\tif c.Tag == 'e' {\n\t\t\t\tfor _, line := range diff.A[i1:i2] {\n\t\t\t\t\tif err := ws(\" \" + line); err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif c.Tag == 'r' || c.Tag == 'd' {\n\t\t\t\tfor _, line := range diff.A[i1:i2] {\n\t\t\t\t\tif err := ws(\"-\" + line); err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif c.Tag == 'r' || c.Tag == 'i' {\n\t\t\t\tfor _, line := range diff.B[j1:j2] {\n\t\t\t\t\tif err := ws(\"+\" + line); err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn nil\n}\n\n// Like WriteUnifiedDiff but returns the diff a string.\nfunc GetUnifiedDiffString(diff UnifiedDiff) (string, error) {\n\tw := &bytes.Buffer{}\n\terr := WriteUnifiedDiff(w, diff)\n\treturn string(w.Bytes()), err\n}\n\n// Convert range to the \"ed\" format.\nfunc formatRangeContext(start, stop int) string {\n\t// Per the diff spec at http://www.unix.org/single_unix_specification/\n\tbeginning := start + 1 // lines start numbering with one\n\tlength := stop - start\n\tif length == 0 {\n\t\tbeginning -= 1 // empty ranges begin at line just before the range\n\t}\n\tif length <= 1 {\n\t\treturn fmt.Sprintf(\"%d\", beginning)\n\t}\n\treturn fmt.Sprintf(\"%d,%d\", beginning, beginning+length-1)\n}\n\ntype ContextDiff UnifiedDiff\n\n// Compare two sequences of lines; generate the delta as a context diff.\n//\n// Context diffs are a compact way of showing line changes and a few\n// lines of context. The number of context lines is set by diff.Context\n// which defaults to three.\n//\n// By default, the diff control lines (those with *** or ---) are\n// created with a trailing newline.\n//\n// For inputs that do not have trailing newlines, set the diff.Eol\n// argument to \"\" so that the output will be uniformly newline free.\n//\n// The context diff format normally has a header for filenames and\n// modification times. Any or all of these may be specified using\n// strings for diff.FromFile, diff.ToFile, diff.FromDate, diff.ToDate.\n// The modification times are normally expressed in the ISO 8601 format.\n// If not specified, the strings default to blanks.\nfunc WriteContextDiff(writer io.Writer, diff ContextDiff) error {\n\tbuf := bufio.NewWriter(writer)\n\tdefer buf.Flush()\n\tvar diffErr error\n\twf := func(format string, args ...interface{}) {\n\t\t_, err := buf.WriteString(fmt.Sprintf(format, args...))\n\t\tif diffErr == nil && err != nil {\n\t\t\tdiffErr = err\n\t\t}\n\t}\n\tws := func(s string) {\n\t\t_, err := buf.WriteString(s)\n\t\tif diffErr == nil && err != nil {\n\t\t\tdiffErr = err\n\t\t}\n\t}\n\n\tif len(diff.Eol) == 0 {\n\t\tdiff.Eol = \"\\n\"\n\t}\n\n\tprefix := map[byte]string{\n\t\t'i': \"+ \",\n\t\t'd': \"- \",\n\t\t'r': \"! \",\n\t\t'e': \" \",\n\t}\n\n\tstarted := false\n\tm := NewMatcher(diff.A, diff.B)\n\tfor _, g := range m.GetGroupedOpCodes(diff.Context) {\n\t\tif !started {\n\t\t\tstarted = true\n\t\t\tfromDate := \"\"\n\t\t\tif len(diff.FromDate) > 0 {\n\t\t\t\tfromDate = \"\\t\" + diff.FromDate\n\t\t\t}\n\t\t\ttoDate := \"\"\n\t\t\tif len(diff.ToDate) > 0 {\n\t\t\t\ttoDate = \"\\t\" + diff.ToDate\n\t\t\t}\n\t\t\tif diff.FromFile != \"\" || diff.ToFile != \"\" {\n\t\t\t\twf(\"*** %s%s%s\", diff.FromFile, fromDate, diff.Eol)\n\t\t\t\twf(\"--- %s%s%s\", diff.ToFile, toDate, diff.Eol)\n\t\t\t}\n\t\t}\n\n\t\tfirst, last := g[0], g[len(g)-1]\n\t\tws(\"***************\" + diff.Eol)\n\n\t\trange1 := formatRangeContext(first.I1, last.I2)\n\t\twf(\"*** %s ****%s\", range1, diff.Eol)\n\t\tfor _, c := range g {\n\t\t\tif c.Tag == 'r' || c.Tag == 'd' {\n\t\t\t\tfor _, cc := range g {\n\t\t\t\t\tif cc.Tag == 'i' {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tfor _, line := range diff.A[cc.I1:cc.I2] {\n\t\t\t\t\t\tws(prefix[cc.Tag] + line)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\n\t\trange2 := formatRangeContext(first.J1, last.J2)\n\t\twf(\"--- %s ----%s\", range2, diff.Eol)\n\t\tfor _, c := range g {\n\t\t\tif c.Tag == 'r' || c.Tag == 'i' {\n\t\t\t\tfor _, cc := range g {\n\t\t\t\t\tif cc.Tag == 'd' {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tfor _, line := range diff.B[cc.J1:cc.J2] {\n\t\t\t\t\t\tws(prefix[cc.Tag] + line)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\treturn diffErr\n}\n\n// Like WriteContextDiff but returns the diff a string.\nfunc GetContextDiffString(diff ContextDiff) (string, error) {\n\tw := &bytes.Buffer{}\n\terr := WriteContextDiff(w, diff)\n\treturn string(w.Bytes()), err\n}\n\n// Split a string on \"\\n\" while preserving them. The output can be used\n// as input for UnifiedDiff and ContextDiff structures.\nfunc SplitLines(s string) []string {\n\tlines := strings.SplitAfter(s, \"\\n\")\n\tlines[len(lines)-1] += \"\\n\"\n\treturn lines\n}\n"
},
{
"path": "src/github.com/stretchr/testify/vendor/github.com/stretchr/objx/LICENSE",
"content": "The MIT License\n\nCopyright (c) 2014 Stretchr, Inc.\nCopyright (c) 2017-2018 objx contributors\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n"
},
{
"path": "src/github.com/stretchr/testify/vendor/github.com/stretchr/objx/accessors.go",
"content": "package objx\n\nimport (\n\t\"fmt\"\n\t\"regexp\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// arrayAccesRegexString is the regex used to extract the array number\n// from the access path\nconst arrayAccesRegexString = `^(.+)\\[([0-9]+)\\]$`\n\n// arrayAccesRegex is the compiled arrayAccesRegexString\nvar arrayAccesRegex = regexp.MustCompile(arrayAccesRegexString)\n\n// Get gets the value using the specified selector and\n// returns it inside a new Obj object.\n//\n// If it cannot find the value, Get will return a nil\n// value inside an instance of Obj.\n//\n// Get can only operate directly on map[string]interface{} and []interface.\n//\n// Example\n//\n// To access the title of the third chapter of the second book, do:\n//\n// o.Get(\"books[1].chapters[2].title\")\nfunc (m Map) Get(selector string) *Value {\n\trawObj := access(m, selector, nil, false, false)\n\treturn &Value{data: rawObj}\n}\n\n// Set sets the value using the specified selector and\n// returns the object on which Set was called.\n//\n// Set can only operate directly on map[string]interface{} and []interface\n//\n// Example\n//\n// To set the title of the third chapter of the second book, do:\n//\n// o.Set(\"books[1].chapters[2].title\",\"Time to Go\")\nfunc (m Map) Set(selector string, value interface{}) Map {\n\taccess(m, selector, value, true, false)\n\treturn m\n}\n\n// access accesses the object using the selector and performs the\n// appropriate action.\nfunc access(current, selector, value interface{}, isSet, panics bool) interface{} {\n\n\tswitch selector.(type) {\n\tcase int, int8, int16, int32, int64, uint, uint8, uint16, uint32, uint64:\n\n\t\tif array, ok := current.([]interface{}); ok {\n\t\t\tindex := intFromInterface(selector)\n\n\t\t\tif index >= len(array) {\n\t\t\t\tif panics {\n\t\t\t\t\tpanic(fmt.Sprintf(\"objx: Index %d is out of range. Slice only contains %d items.\", index, len(array)))\n\t\t\t\t}\n\t\t\t\treturn nil\n\t\t\t}\n\n\t\t\treturn array[index]\n\t\t}\n\n\t\treturn nil\n\n\tcase string:\n\n\t\tselStr := selector.(string)\n\t\tselSegs := strings.SplitN(selStr, PathSeparator, 2)\n\t\tthisSel := selSegs[0]\n\t\tindex := -1\n\t\tvar err error\n\n\t\tif strings.Contains(thisSel, \"[\") {\n\t\t\tarrayMatches := arrayAccesRegex.FindStringSubmatch(thisSel)\n\n\t\t\tif len(arrayMatches) > 0 {\n\t\t\t\t// Get the key into the map\n\t\t\t\tthisSel = arrayMatches[1]\n\n\t\t\t\t// Get the index into the array at the key\n\t\t\t\tindex, err = strconv.Atoi(arrayMatches[2])\n\n\t\t\t\tif err != nil {\n\t\t\t\t\t// This should never happen. If it does, something has gone\n\t\t\t\t\t// seriously wrong. Panic.\n\t\t\t\t\tpanic(\"objx: Array index is not an integer. Must use array[int].\")\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif curMap, ok := current.(Map); ok {\n\t\t\tcurrent = map[string]interface{}(curMap)\n\t\t}\n\n\t\t// get the object in question\n\t\tswitch current.(type) {\n\t\tcase map[string]interface{}:\n\t\t\tcurMSI := current.(map[string]interface{})\n\t\t\tif len(selSegs) <= 1 && isSet {\n\t\t\t\tcurMSI[thisSel] = value\n\t\t\t\treturn nil\n\t\t\t}\n\t\t\tcurrent = curMSI[thisSel]\n\t\tdefault:\n\t\t\tcurrent = nil\n\t\t}\n\n\t\tif current == nil && panics {\n\t\t\tpanic(fmt.Sprintf(\"objx: '%v' invalid on object.\", selector))\n\t\t}\n\n\t\t// do we need to access the item of an array?\n\t\tif index > -1 {\n\t\t\tif array, ok := current.([]interface{}); ok {\n\t\t\t\tif index < len(array) {\n\t\t\t\t\tcurrent = array[index]\n\t\t\t\t} else {\n\t\t\t\t\tif panics {\n\t\t\t\t\t\tpanic(fmt.Sprintf(\"objx: Index %d is out of range. Slice only contains %d items.\", index, len(array)))\n\t\t\t\t\t}\n\t\t\t\t\tcurrent = nil\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif len(selSegs) > 1 {\n\t\t\tcurrent = access(current, selSegs[1], value, isSet, panics)\n\t\t}\n\n\t}\n\treturn current\n}\n\n// intFromInterface converts an interface object to the largest\n// representation of an unsigned integer using a type switch and\n// assertions\nfunc intFromInterface(selector interface{}) int {\n\tvar value int\n\tswitch selector.(type) {\n\tcase int:\n\t\tvalue = selector.(int)\n\tcase int8:\n\t\tvalue = int(selector.(int8))\n\tcase int16:\n\t\tvalue = int(selector.(int16))\n\tcase int32:\n\t\tvalue = int(selector.(int32))\n\tcase int64:\n\t\tvalue = int(selector.(int64))\n\tcase uint:\n\t\tvalue = int(selector.(uint))\n\tcase uint8:\n\t\tvalue = int(selector.(uint8))\n\tcase uint16:\n\t\tvalue = int(selector.(uint16))\n\tcase uint32:\n\t\tvalue = int(selector.(uint32))\n\tcase uint64:\n\t\tvalue = int(selector.(uint64))\n\tdefault:\n\t\tpanic(\"objx: array access argument is not an integer type (this should never happen)\")\n\t}\n\treturn value\n}\n"
},
{
"path": "src/github.com/stretchr/testify/vendor/github.com/stretchr/objx/constants.go",
"content": "package objx\n\nconst (\n\t// PathSeparator is the character used to separate the elements\n\t// of the keypath.\n\t//\n\t// For example, `location.address.city`\n\tPathSeparator string = \".\"\n\n\t// SignatureSeparator is the character that is used to\n\t// separate the Base64 string from the security signature.\n\tSignatureSeparator = \"_\"\n)\n"
},
{
"path": "src/github.com/stretchr/testify/vendor/github.com/stretchr/objx/conversions.go",
"content": "package objx\n\nimport (\n\t\"bytes\"\n\t\"encoding/base64\"\n\t\"encoding/json\"\n\t\"errors\"\n\t\"fmt\"\n\t\"net/url\"\n)\n\n// JSON converts the contained object to a JSON string\n// representation\nfunc (m Map) JSON() (string, error) {\n\tresult, err := json.Marshal(m)\n\tif err != nil {\n\t\terr = errors.New(\"objx: JSON encode failed with: \" + err.Error())\n\t}\n\treturn string(result), err\n}\n\n// MustJSON converts the contained object to a JSON string\n// representation and panics if there is an error\nfunc (m Map) MustJSON() string {\n\tresult, err := m.JSON()\n\tif err != nil {\n\t\tpanic(err.Error())\n\t}\n\treturn result\n}\n\n// Base64 converts the contained object to a Base64 string\n// representation of the JSON string representation\nfunc (m Map) Base64() (string, error) {\n\tvar buf bytes.Buffer\n\n\tjsonData, err := m.JSON()\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\n\tencoder := base64.NewEncoder(base64.StdEncoding, &buf)\n\t_, err = encoder.Write([]byte(jsonData))\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\t_ = encoder.Close()\n\n\treturn buf.String(), nil\n}\n\n// MustBase64 converts the contained object to a Base64 string\n// representation of the JSON string representation and panics\n// if there is an error\nfunc (m Map) MustBase64() string {\n\tresult, err := m.Base64()\n\tif err != nil {\n\t\tpanic(err.Error())\n\t}\n\treturn result\n}\n\n// SignedBase64 converts the contained object to a Base64 string\n// representation of the JSON string representation and signs it\n// using the provided key.\nfunc (m Map) SignedBase64(key string) (string, error) {\n\tbase64, err := m.Base64()\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\n\tsig := HashWithKey(base64, key)\n\treturn base64 + SignatureSeparator + sig, nil\n}\n\n// MustSignedBase64 converts the contained object to a Base64 string\n// representation of the JSON string representation and signs it\n// using the provided key and panics if there is an error\nfunc (m Map) MustSignedBase64(key string) string {\n\tresult, err := m.SignedBase64(key)\n\tif err != nil {\n\t\tpanic(err.Error())\n\t}\n\treturn result\n}\n\n/*\n\tURL Query\n\t------------------------------------------------\n*/\n\n// URLValues creates a url.Values object from an Obj. This\n// function requires that the wrapped object be a map[string]interface{}\nfunc (m Map) URLValues() url.Values {\n\tvals := make(url.Values)\n\tfor k, v := range m {\n\t\t//TODO: can this be done without sprintf?\n\t\tvals.Set(k, fmt.Sprintf(\"%v\", v))\n\t}\n\treturn vals\n}\n\n// URLQuery gets an encoded URL query representing the given\n// Obj. This function requires that the wrapped object be a\n// map[string]interface{}\nfunc (m Map) URLQuery() (string, error) {\n\treturn m.URLValues().Encode(), nil\n}\n"
},
{
"path": "src/github.com/stretchr/testify/vendor/github.com/stretchr/objx/doc.go",
"content": "/*\nObjx - Go package for dealing with maps, slices, JSON and other data.\n\nOverview\n\nObjx provides the `objx.Map` type, which is a `map[string]interface{}` that exposes\na powerful `Get` method (among others) that allows you to easily and quickly get\naccess to data within the map, without having to worry too much about type assertions,\nmissing data, default values etc.\n\nPattern\n\nObjx uses a preditable pattern to make access data from within `map[string]interface{}` easy.\nCall one of the `objx.` functions to create your `objx.Map` to get going:\n\n m, err := objx.FromJSON(json)\n\nNOTE: Any methods or functions with the `Must` prefix will panic if something goes wrong,\nthe rest will be optimistic and try to figure things out without panicking.\n\nUse `Get` to access the value you're interested in. You can use dot and array\nnotation too:\n\n m.Get(\"places[0].latlng\")\n\nOnce you have sought the `Value` you're interested in, you can use the `Is*` methods to determine its type.\n\n if m.Get(\"code\").IsStr() { // Your code... }\n\nOr you can just assume the type, and use one of the strong type methods to extract the real value:\n\n m.Get(\"code\").Int()\n\nIf there's no value there (or if it's the wrong type) then a default value will be returned,\nor you can be explicit about the default value.\n\n Get(\"code\").Int(-1)\n\nIf you're dealing with a slice of data as a value, Objx provides many useful methods for iterating,\nmanipulating and selecting that data. You can find out more by exploring the index below.\n\nReading data\n\nA simple example of how to use Objx:\n\n // Use MustFromJSON to make an objx.Map from some JSON\n m := objx.MustFromJSON(`{\"name\": \"Mat\", \"age\": 30}`)\n\n // Get the details\n name := m.Get(\"name\").Str()\n age := m.Get(\"age\").Int()\n\n // Get their nickname (or use their name if they don't have one)\n nickname := m.Get(\"nickname\").Str(name)\n\nRanging\n\nSince `objx.Map` is a `map[string]interface{}` you can treat it as such.\nFor example, to `range` the data, do what you would expect:\n\n m := objx.MustFromJSON(json)\n for key, value := range m {\n // Your code...\n }\n*/\npackage objx\n"
},
{
"path": "src/github.com/stretchr/testify/vendor/github.com/stretchr/objx/map.go",
"content": "package objx\n\nimport (\n\t\"encoding/base64\"\n\t\"encoding/json\"\n\t\"errors\"\n\t\"io/ioutil\"\n\t\"net/url\"\n\t\"strings\"\n)\n\n// MSIConvertable is an interface that defines methods for converting your\n// custom types to a map[string]interface{} representation.\ntype MSIConvertable interface {\n\t// MSI gets a map[string]interface{} (msi) representing the\n\t// object.\n\tMSI() map[string]interface{}\n}\n\n// Map provides extended functionality for working with\n// untyped data, in particular map[string]interface (msi).\ntype Map map[string]interface{}\n\n// Value returns the internal value instance\nfunc (m Map) Value() *Value {\n\treturn &Value{data: m}\n}\n\n// Nil represents a nil Map.\nvar Nil = New(nil)\n\n// New creates a new Map containing the map[string]interface{} in the data argument.\n// If the data argument is not a map[string]interface, New attempts to call the\n// MSI() method on the MSIConvertable interface to create one.\nfunc New(data interface{}) Map {\n\tif _, ok := data.(map[string]interface{}); !ok {\n\t\tif converter, ok := data.(MSIConvertable); ok {\n\t\t\tdata = converter.MSI()\n\t\t} else {\n\t\t\treturn nil\n\t\t}\n\t}\n\treturn Map(data.(map[string]interface{}))\n}\n\n// MSI creates a map[string]interface{} and puts it inside a new Map.\n//\n// The arguments follow a key, value pattern.\n//\n// Panics\n//\n// Panics if any key argument is non-string or if there are an odd number of arguments.\n//\n// Example\n//\n// To easily create Maps:\n//\n// m := objx.MSI(\"name\", \"Mat\", \"age\", 29, \"subobj\", objx.MSI(\"active\", true))\n//\n// // creates an Map equivalent to\n// m := objx.New(map[string]interface{}{\"name\": \"Mat\", \"age\": 29, \"subobj\": map[string]interface{}{\"active\": true}})\nfunc MSI(keyAndValuePairs ...interface{}) Map {\n\tnewMap := make(map[string]interface{})\n\tkeyAndValuePairsLen := len(keyAndValuePairs)\n\tif keyAndValuePairsLen%2 != 0 {\n\t\tpanic(\"objx: MSI must have an even number of arguments following the 'key, value' pattern.\")\n\t}\n\n\tfor i := 0; i < keyAndValuePairsLen; i = i + 2 {\n\t\tkey := keyAndValuePairs[i]\n\t\tvalue := keyAndValuePairs[i+1]\n\n\t\t// make sure the key is a string\n\t\tkeyString, keyStringOK := key.(string)\n\t\tif !keyStringOK {\n\t\t\tpanic(\"objx: MSI must follow 'string, interface{}' pattern. \" + keyString + \" is not a valid key.\")\n\t\t}\n\t\tnewMap[keyString] = value\n\t}\n\treturn New(newMap)\n}\n\n// ****** Conversion Constructors\n\n// MustFromJSON creates a new Map containing the data specified in the\n// jsonString.\n//\n// Panics if the JSON is invalid.\nfunc MustFromJSON(jsonString string) Map {\n\to, err := FromJSON(jsonString)\n\tif err != nil {\n\t\tpanic(\"objx: MustFromJSON failed with error: \" + err.Error())\n\t}\n\treturn o\n}\n\n// FromJSON creates a new Map containing the data specified in the\n// jsonString.\n//\n// Returns an error if the JSON is invalid.\nfunc FromJSON(jsonString string) (Map, error) {\n\tvar data interface{}\n\terr := json.Unmarshal([]byte(jsonString), &data)\n\tif err != nil {\n\t\treturn Nil, err\n\t}\n\treturn New(data), nil\n}\n\n// FromBase64 creates a new Obj containing the data specified\n// in the Base64 string.\n//\n// The string is an encoded JSON string returned by Base64\nfunc FromBase64(base64String string) (Map, error) {\n\tdecoder := base64.NewDecoder(base64.StdEncoding, strings.NewReader(base64String))\n\tdecoded, err := ioutil.ReadAll(decoder)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn FromJSON(string(decoded))\n}\n\n// MustFromBase64 creates a new Obj containing the data specified\n// in the Base64 string and panics if there is an error.\n//\n// The string is an encoded JSON string returned by Base64\nfunc MustFromBase64(base64String string) Map {\n\tresult, err := FromBase64(base64String)\n\tif err != nil {\n\t\tpanic(\"objx: MustFromBase64 failed with error: \" + err.Error())\n\t}\n\treturn result\n}\n\n// FromSignedBase64 creates a new Obj containing the data specified\n// in the Base64 string.\n//\n// The string is an encoded JSON string returned by SignedBase64\nfunc FromSignedBase64(base64String, key string) (Map, error) {\n\tparts := strings.Split(base64String, SignatureSeparator)\n\tif len(parts) != 2 {\n\t\treturn nil, errors.New(\"objx: Signed base64 string is malformed\")\n\t}\n\n\tsig := HashWithKey(parts[0], key)\n\tif parts[1] != sig {\n\t\treturn nil, errors.New(\"objx: Signature for base64 data does not match\")\n\t}\n\treturn FromBase64(parts[0])\n}\n\n// MustFromSignedBase64 creates a new Obj containing the data specified\n// in the Base64 string and panics if there is an error.\n//\n// The string is an encoded JSON string returned by Base64\nfunc MustFromSignedBase64(base64String, key string) Map {\n\tresult, err := FromSignedBase64(base64String, key)\n\tif err != nil {\n\t\tpanic(\"objx: MustFromSignedBase64 failed with error: \" + err.Error())\n\t}\n\treturn result\n}\n\n// FromURLQuery generates a new Obj by parsing the specified\n// query.\n//\n// For queries with multiple values, the first value is selected.\nfunc FromURLQuery(query string) (Map, error) {\n\tvals, err := url.ParseQuery(query)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tm := make(map[string]interface{})\n\tfor k, vals := range vals {\n\t\tm[k] = vals[0]\n\t}\n\treturn New(m), nil\n}\n\n// MustFromURLQuery generates a new Obj by parsing the specified\n// query.\n//\n// For queries with multiple values, the first value is selected.\n//\n// Panics if it encounters an error\nfunc MustFromURLQuery(query string) Map {\n\to, err := FromURLQuery(query)\n\tif err != nil {\n\t\tpanic(\"objx: MustFromURLQuery failed with error: \" + err.Error())\n\t}\n\treturn o\n}\n"
},
{
"path": "src/github.com/stretchr/testify/vendor/github.com/stretchr/objx/mutations.go",
"content": "package objx\n\n// Exclude returns a new Map with the keys in the specified []string\n// excluded.\nfunc (m Map) Exclude(exclude []string) Map {\n\texcluded := make(Map)\n\tfor k, v := range m {\n\t\tvar shouldInclude = true\n\t\tfor _, toExclude := range exclude {\n\t\t\tif k == toExclude {\n\t\t\t\tshouldInclude = false\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tif shouldInclude {\n\t\t\texcluded[k] = v\n\t\t}\n\t}\n\treturn excluded\n}\n\n// Copy creates a shallow copy of the Obj.\nfunc (m Map) Copy() Map {\n\tcopied := make(map[string]interface{})\n\tfor k, v := range m {\n\t\tcopied[k] = v\n\t}\n\treturn New(copied)\n}\n\n// Merge blends the specified map with a copy of this map and returns the result.\n//\n// Keys that appear in both will be selected from the specified map.\n// This method requires that the wrapped object be a map[string]interface{}\nfunc (m Map) Merge(merge Map) Map {\n\treturn m.Copy().MergeHere(merge)\n}\n\n// MergeHere blends the specified map with this map and returns the current map.\n//\n// Keys that appear in both will be selected from the specified map. The original map\n// will be modified. This method requires that\n// the wrapped object be a map[string]interface{}\nfunc (m Map) MergeHere(merge Map) Map {\n\tfor k, v := range merge {\n\t\tm[k] = v\n\t}\n\treturn m\n}\n\n// Transform builds a new Obj giving the transformer a chance\n// to change the keys and values as it goes. This method requires that\n// the wrapped object be a map[string]interface{}\nfunc (m Map) Transform(transformer func(key string, value interface{}) (string, interface{})) Map {\n\tnewMap := make(map[string]interface{})\n\tfor k, v := range m {\n\t\tmodifiedKey, modifiedVal := transformer(k, v)\n\t\tnewMap[modifiedKey] = modifiedVal\n\t}\n\treturn New(newMap)\n}\n\n// TransformKeys builds a new map using the specified key mapping.\n//\n// Unspecified keys will be unaltered.\n// This method requires that the wrapped object be a map[string]interface{}\nfunc (m Map) TransformKeys(mapping map[string]string) Map {\n\treturn m.Transform(func(key string, value interface{}) (string, interface{}) {\n\t\tif newKey, ok := mapping[key]; ok {\n\t\t\treturn newKey, value\n\t\t}\n\t\treturn key, value\n\t})\n}\n"
},
{
"path": "src/github.com/stretchr/testify/vendor/github.com/stretchr/objx/security.go",
"content": "package objx\n\nimport (\n\t\"crypto/sha1\"\n\t\"encoding/hex\"\n)\n\n// HashWithKey hashes the specified string using the security\n// key.\nfunc HashWithKey(data, key string) string {\n\thash := sha1.New()\n\t_, err := hash.Write([]byte(data + \":\" + key))\n\tif err != nil {\n\t\treturn \"\"\n\t}\n\treturn hex.EncodeToString(hash.Sum(nil))\n}\n"
},
{
"path": "src/github.com/stretchr/testify/vendor/github.com/stretchr/objx/tests.go",
"content": "package objx\n\n// Has gets whether there is something at the specified selector\n// or not.\n//\n// If m is nil, Has will always return false.\nfunc (m Map) Has(selector string) bool {\n\tif m == nil {\n\t\treturn false\n\t}\n\treturn !m.Get(selector).IsNil()\n}\n\n// IsNil gets whether the data is nil or not.\nfunc (v *Value) IsNil() bool {\n\treturn v == nil || v.data == nil\n}\n"
},
{
"path": "src/github.com/stretchr/testify/vendor/github.com/stretchr/objx/type_specific_codegen.go",
"content": "package objx\n\n/*\n\tInter (interface{} and []interface{})\n*/\n\n// Inter gets the value as a interface{}, returns the optionalDefault\n// value or a system default object if the value is the wrong type.\nfunc (v *Value) Inter(optionalDefault ...interface{}) interface{} {\n\tif s, ok := v.data.(interface{}); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustInter gets the value as a interface{}.\n//\n// Panics if the object is not a interface{}.\nfunc (v *Value) MustInter() interface{} {\n\treturn v.data.(interface{})\n}\n\n// InterSlice gets the value as a []interface{}, returns the optionalDefault\n// value or nil if the value is not a []interface{}.\nfunc (v *Value) InterSlice(optionalDefault ...[]interface{}) []interface{} {\n\tif s, ok := v.data.([]interface{}); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustInterSlice gets the value as a []interface{}.\n//\n// Panics if the object is not a []interface{}.\nfunc (v *Value) MustInterSlice() []interface{} {\n\treturn v.data.([]interface{})\n}\n\n// IsInter gets whether the object contained is a interface{} or not.\nfunc (v *Value) IsInter() bool {\n\t_, ok := v.data.(interface{})\n\treturn ok\n}\n\n// IsInterSlice gets whether the object contained is a []interface{} or not.\nfunc (v *Value) IsInterSlice() bool {\n\t_, ok := v.data.([]interface{})\n\treturn ok\n}\n\n// EachInter calls the specified callback for each object\n// in the []interface{}.\n//\n// Panics if the object is the wrong type.\nfunc (v *Value) EachInter(callback func(int, interface{}) bool) *Value {\n\tfor index, val := range v.MustInterSlice() {\n\t\tcarryon := callback(index, val)\n\t\tif !carryon {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v\n}\n\n// WhereInter uses the specified decider function to select items\n// from the []interface{}. The object contained in the result will contain\n// only the selected items.\nfunc (v *Value) WhereInter(decider func(int, interface{}) bool) *Value {\n\tvar selected []interface{}\n\tv.EachInter(func(index int, val interface{}) bool {\n\t\tshouldSelect := decider(index, val)\n\t\tif !shouldSelect {\n\t\t\tselected = append(selected, val)\n\t\t}\n\t\treturn true\n\t})\n\treturn &Value{data: selected}\n}\n\n// GroupInter uses the specified grouper function to group the items\n// keyed by the return of the grouper. The object contained in the\n// result will contain a map[string][]interface{}.\nfunc (v *Value) GroupInter(grouper func(int, interface{}) string) *Value {\n\tgroups := make(map[string][]interface{})\n\tv.EachInter(func(index int, val interface{}) bool {\n\t\tgroup := grouper(index, val)\n\t\tif _, ok := groups[group]; !ok {\n\t\t\tgroups[group] = make([]interface{}, 0)\n\t\t}\n\t\tgroups[group] = append(groups[group], val)\n\t\treturn true\n\t})\n\treturn &Value{data: groups}\n}\n\n// ReplaceInter uses the specified function to replace each interface{}s\n// by iterating each item. The data in the returned result will be a\n// []interface{} containing the replaced items.\nfunc (v *Value) ReplaceInter(replacer func(int, interface{}) interface{}) *Value {\n\tarr := v.MustInterSlice()\n\treplaced := make([]interface{}, len(arr))\n\tv.EachInter(func(index int, val interface{}) bool {\n\t\treplaced[index] = replacer(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: replaced}\n}\n\n// CollectInter uses the specified collector function to collect a value\n// for each of the interface{}s in the slice. The data returned will be a\n// []interface{}.\nfunc (v *Value) CollectInter(collector func(int, interface{}) interface{}) *Value {\n\tarr := v.MustInterSlice()\n\tcollected := make([]interface{}, len(arr))\n\tv.EachInter(func(index int, val interface{}) bool {\n\t\tcollected[index] = collector(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: collected}\n}\n\n/*\n\tMSI (map[string]interface{} and []map[string]interface{})\n*/\n\n// MSI gets the value as a map[string]interface{}, returns the optionalDefault\n// value or a system default object if the value is the wrong type.\nfunc (v *Value) MSI(optionalDefault ...map[string]interface{}) map[string]interface{} {\n\tif s, ok := v.data.(map[string]interface{}); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustMSI gets the value as a map[string]interface{}.\n//\n// Panics if the object is not a map[string]interface{}.\nfunc (v *Value) MustMSI() map[string]interface{} {\n\treturn v.data.(map[string]interface{})\n}\n\n// MSISlice gets the value as a []map[string]interface{}, returns the optionalDefault\n// value or nil if the value is not a []map[string]interface{}.\nfunc (v *Value) MSISlice(optionalDefault ...[]map[string]interface{}) []map[string]interface{} {\n\tif s, ok := v.data.([]map[string]interface{}); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustMSISlice gets the value as a []map[string]interface{}.\n//\n// Panics if the object is not a []map[string]interface{}.\nfunc (v *Value) MustMSISlice() []map[string]interface{} {\n\treturn v.data.([]map[string]interface{})\n}\n\n// IsMSI gets whether the object contained is a map[string]interface{} or not.\nfunc (v *Value) IsMSI() bool {\n\t_, ok := v.data.(map[string]interface{})\n\treturn ok\n}\n\n// IsMSISlice gets whether the object contained is a []map[string]interface{} or not.\nfunc (v *Value) IsMSISlice() bool {\n\t_, ok := v.data.([]map[string]interface{})\n\treturn ok\n}\n\n// EachMSI calls the specified callback for each object\n// in the []map[string]interface{}.\n//\n// Panics if the object is the wrong type.\nfunc (v *Value) EachMSI(callback func(int, map[string]interface{}) bool) *Value {\n\tfor index, val := range v.MustMSISlice() {\n\t\tcarryon := callback(index, val)\n\t\tif !carryon {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v\n}\n\n// WhereMSI uses the specified decider function to select items\n// from the []map[string]interface{}. The object contained in the result will contain\n// only the selected items.\nfunc (v *Value) WhereMSI(decider func(int, map[string]interface{}) bool) *Value {\n\tvar selected []map[string]interface{}\n\tv.EachMSI(func(index int, val map[string]interface{}) bool {\n\t\tshouldSelect := decider(index, val)\n\t\tif !shouldSelect {\n\t\t\tselected = append(selected, val)\n\t\t}\n\t\treturn true\n\t})\n\treturn &Value{data: selected}\n}\n\n// GroupMSI uses the specified grouper function to group the items\n// keyed by the return of the grouper. The object contained in the\n// result will contain a map[string][]map[string]interface{}.\nfunc (v *Value) GroupMSI(grouper func(int, map[string]interface{}) string) *Value {\n\tgroups := make(map[string][]map[string]interface{})\n\tv.EachMSI(func(index int, val map[string]interface{}) bool {\n\t\tgroup := grouper(index, val)\n\t\tif _, ok := groups[group]; !ok {\n\t\t\tgroups[group] = make([]map[string]interface{}, 0)\n\t\t}\n\t\tgroups[group] = append(groups[group], val)\n\t\treturn true\n\t})\n\treturn &Value{data: groups}\n}\n\n// ReplaceMSI uses the specified function to replace each map[string]interface{}s\n// by iterating each item. The data in the returned result will be a\n// []map[string]interface{} containing the replaced items.\nfunc (v *Value) ReplaceMSI(replacer func(int, map[string]interface{}) map[string]interface{}) *Value {\n\tarr := v.MustMSISlice()\n\treplaced := make([]map[string]interface{}, len(arr))\n\tv.EachMSI(func(index int, val map[string]interface{}) bool {\n\t\treplaced[index] = replacer(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: replaced}\n}\n\n// CollectMSI uses the specified collector function to collect a value\n// for each of the map[string]interface{}s in the slice. The data returned will be a\n// []interface{}.\nfunc (v *Value) CollectMSI(collector func(int, map[string]interface{}) interface{}) *Value {\n\tarr := v.MustMSISlice()\n\tcollected := make([]interface{}, len(arr))\n\tv.EachMSI(func(index int, val map[string]interface{}) bool {\n\t\tcollected[index] = collector(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: collected}\n}\n\n/*\n\tObjxMap ((Map) and [](Map))\n*/\n\n// ObjxMap gets the value as a (Map), returns the optionalDefault\n// value or a system default object if the value is the wrong type.\nfunc (v *Value) ObjxMap(optionalDefault ...(Map)) Map {\n\tif s, ok := v.data.((Map)); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn New(nil)\n}\n\n// MustObjxMap gets the value as a (Map).\n//\n// Panics if the object is not a (Map).\nfunc (v *Value) MustObjxMap() Map {\n\treturn v.data.((Map))\n}\n\n// ObjxMapSlice gets the value as a [](Map), returns the optionalDefault\n// value or nil if the value is not a [](Map).\nfunc (v *Value) ObjxMapSlice(optionalDefault ...[](Map)) [](Map) {\n\tif s, ok := v.data.([](Map)); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustObjxMapSlice gets the value as a [](Map).\n//\n// Panics if the object is not a [](Map).\nfunc (v *Value) MustObjxMapSlice() [](Map) {\n\treturn v.data.([](Map))\n}\n\n// IsObjxMap gets whether the object contained is a (Map) or not.\nfunc (v *Value) IsObjxMap() bool {\n\t_, ok := v.data.((Map))\n\treturn ok\n}\n\n// IsObjxMapSlice gets whether the object contained is a [](Map) or not.\nfunc (v *Value) IsObjxMapSlice() bool {\n\t_, ok := v.data.([](Map))\n\treturn ok\n}\n\n// EachObjxMap calls the specified callback for each object\n// in the [](Map).\n//\n// Panics if the object is the wrong type.\nfunc (v *Value) EachObjxMap(callback func(int, Map) bool) *Value {\n\tfor index, val := range v.MustObjxMapSlice() {\n\t\tcarryon := callback(index, val)\n\t\tif !carryon {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v\n}\n\n// WhereObjxMap uses the specified decider function to select items\n// from the [](Map). The object contained in the result will contain\n// only the selected items.\nfunc (v *Value) WhereObjxMap(decider func(int, Map) bool) *Value {\n\tvar selected [](Map)\n\tv.EachObjxMap(func(index int, val Map) bool {\n\t\tshouldSelect := decider(index, val)\n\t\tif !shouldSelect {\n\t\t\tselected = append(selected, val)\n\t\t}\n\t\treturn true\n\t})\n\treturn &Value{data: selected}\n}\n\n// GroupObjxMap uses the specified grouper function to group the items\n// keyed by the return of the grouper. The object contained in the\n// result will contain a map[string][](Map).\nfunc (v *Value) GroupObjxMap(grouper func(int, Map) string) *Value {\n\tgroups := make(map[string][](Map))\n\tv.EachObjxMap(func(index int, val Map) bool {\n\t\tgroup := grouper(index, val)\n\t\tif _, ok := groups[group]; !ok {\n\t\t\tgroups[group] = make([](Map), 0)\n\t\t}\n\t\tgroups[group] = append(groups[group], val)\n\t\treturn true\n\t})\n\treturn &Value{data: groups}\n}\n\n// ReplaceObjxMap uses the specified function to replace each (Map)s\n// by iterating each item. The data in the returned result will be a\n// [](Map) containing the replaced items.\nfunc (v *Value) ReplaceObjxMap(replacer func(int, Map) Map) *Value {\n\tarr := v.MustObjxMapSlice()\n\treplaced := make([](Map), len(arr))\n\tv.EachObjxMap(func(index int, val Map) bool {\n\t\treplaced[index] = replacer(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: replaced}\n}\n\n// CollectObjxMap uses the specified collector function to collect a value\n// for each of the (Map)s in the slice. The data returned will be a\n// []interface{}.\nfunc (v *Value) CollectObjxMap(collector func(int, Map) interface{}) *Value {\n\tarr := v.MustObjxMapSlice()\n\tcollected := make([]interface{}, len(arr))\n\tv.EachObjxMap(func(index int, val Map) bool {\n\t\tcollected[index] = collector(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: collected}\n}\n\n/*\n\tBool (bool and []bool)\n*/\n\n// Bool gets the value as a bool, returns the optionalDefault\n// value or a system default object if the value is the wrong type.\nfunc (v *Value) Bool(optionalDefault ...bool) bool {\n\tif s, ok := v.data.(bool); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn false\n}\n\n// MustBool gets the value as a bool.\n//\n// Panics if the object is not a bool.\nfunc (v *Value) MustBool() bool {\n\treturn v.data.(bool)\n}\n\n// BoolSlice gets the value as a []bool, returns the optionalDefault\n// value or nil if the value is not a []bool.\nfunc (v *Value) BoolSlice(optionalDefault ...[]bool) []bool {\n\tif s, ok := v.data.([]bool); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustBoolSlice gets the value as a []bool.\n//\n// Panics if the object is not a []bool.\nfunc (v *Value) MustBoolSlice() []bool {\n\treturn v.data.([]bool)\n}\n\n// IsBool gets whether the object contained is a bool or not.\nfunc (v *Value) IsBool() bool {\n\t_, ok := v.data.(bool)\n\treturn ok\n}\n\n// IsBoolSlice gets whether the object contained is a []bool or not.\nfunc (v *Value) IsBoolSlice() bool {\n\t_, ok := v.data.([]bool)\n\treturn ok\n}\n\n// EachBool calls the specified callback for each object\n// in the []bool.\n//\n// Panics if the object is the wrong type.\nfunc (v *Value) EachBool(callback func(int, bool) bool) *Value {\n\tfor index, val := range v.MustBoolSlice() {\n\t\tcarryon := callback(index, val)\n\t\tif !carryon {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v\n}\n\n// WhereBool uses the specified decider function to select items\n// from the []bool. The object contained in the result will contain\n// only the selected items.\nfunc (v *Value) WhereBool(decider func(int, bool) bool) *Value {\n\tvar selected []bool\n\tv.EachBool(func(index int, val bool) bool {\n\t\tshouldSelect := decider(index, val)\n\t\tif !shouldSelect {\n\t\t\tselected = append(selected, val)\n\t\t}\n\t\treturn true\n\t})\n\treturn &Value{data: selected}\n}\n\n// GroupBool uses the specified grouper function to group the items\n// keyed by the return of the grouper. The object contained in the\n// result will contain a map[string][]bool.\nfunc (v *Value) GroupBool(grouper func(int, bool) string) *Value {\n\tgroups := make(map[string][]bool)\n\tv.EachBool(func(index int, val bool) bool {\n\t\tgroup := grouper(index, val)\n\t\tif _, ok := groups[group]; !ok {\n\t\t\tgroups[group] = make([]bool, 0)\n\t\t}\n\t\tgroups[group] = append(groups[group], val)\n\t\treturn true\n\t})\n\treturn &Value{data: groups}\n}\n\n// ReplaceBool uses the specified function to replace each bools\n// by iterating each item. The data in the returned result will be a\n// []bool containing the replaced items.\nfunc (v *Value) ReplaceBool(replacer func(int, bool) bool) *Value {\n\tarr := v.MustBoolSlice()\n\treplaced := make([]bool, len(arr))\n\tv.EachBool(func(index int, val bool) bool {\n\t\treplaced[index] = replacer(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: replaced}\n}\n\n// CollectBool uses the specified collector function to collect a value\n// for each of the bools in the slice. The data returned will be a\n// []interface{}.\nfunc (v *Value) CollectBool(collector func(int, bool) interface{}) *Value {\n\tarr := v.MustBoolSlice()\n\tcollected := make([]interface{}, len(arr))\n\tv.EachBool(func(index int, val bool) bool {\n\t\tcollected[index] = collector(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: collected}\n}\n\n/*\n\tStr (string and []string)\n*/\n\n// Str gets the value as a string, returns the optionalDefault\n// value or a system default object if the value is the wrong type.\nfunc (v *Value) Str(optionalDefault ...string) string {\n\tif s, ok := v.data.(string); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn \"\"\n}\n\n// MustStr gets the value as a string.\n//\n// Panics if the object is not a string.\nfunc (v *Value) MustStr() string {\n\treturn v.data.(string)\n}\n\n// StrSlice gets the value as a []string, returns the optionalDefault\n// value or nil if the value is not a []string.\nfunc (v *Value) StrSlice(optionalDefault ...[]string) []string {\n\tif s, ok := v.data.([]string); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustStrSlice gets the value as a []string.\n//\n// Panics if the object is not a []string.\nfunc (v *Value) MustStrSlice() []string {\n\treturn v.data.([]string)\n}\n\n// IsStr gets whether the object contained is a string or not.\nfunc (v *Value) IsStr() bool {\n\t_, ok := v.data.(string)\n\treturn ok\n}\n\n// IsStrSlice gets whether the object contained is a []string or not.\nfunc (v *Value) IsStrSlice() bool {\n\t_, ok := v.data.([]string)\n\treturn ok\n}\n\n// EachStr calls the specified callback for each object\n// in the []string.\n//\n// Panics if the object is the wrong type.\nfunc (v *Value) EachStr(callback func(int, string) bool) *Value {\n\tfor index, val := range v.MustStrSlice() {\n\t\tcarryon := callback(index, val)\n\t\tif !carryon {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v\n}\n\n// WhereStr uses the specified decider function to select items\n// from the []string. The object contained in the result will contain\n// only the selected items.\nfunc (v *Value) WhereStr(decider func(int, string) bool) *Value {\n\tvar selected []string\n\tv.EachStr(func(index int, val string) bool {\n\t\tshouldSelect := decider(index, val)\n\t\tif !shouldSelect {\n\t\t\tselected = append(selected, val)\n\t\t}\n\t\treturn true\n\t})\n\treturn &Value{data: selected}\n}\n\n// GroupStr uses the specified grouper function to group the items\n// keyed by the return of the grouper. The object contained in the\n// result will contain a map[string][]string.\nfunc (v *Value) GroupStr(grouper func(int, string) string) *Value {\n\tgroups := make(map[string][]string)\n\tv.EachStr(func(index int, val string) bool {\n\t\tgroup := grouper(index, val)\n\t\tif _, ok := groups[group]; !ok {\n\t\t\tgroups[group] = make([]string, 0)\n\t\t}\n\t\tgroups[group] = append(groups[group], val)\n\t\treturn true\n\t})\n\treturn &Value{data: groups}\n}\n\n// ReplaceStr uses the specified function to replace each strings\n// by iterating each item. The data in the returned result will be a\n// []string containing the replaced items.\nfunc (v *Value) ReplaceStr(replacer func(int, string) string) *Value {\n\tarr := v.MustStrSlice()\n\treplaced := make([]string, len(arr))\n\tv.EachStr(func(index int, val string) bool {\n\t\treplaced[index] = replacer(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: replaced}\n}\n\n// CollectStr uses the specified collector function to collect a value\n// for each of the strings in the slice. The data returned will be a\n// []interface{}.\nfunc (v *Value) CollectStr(collector func(int, string) interface{}) *Value {\n\tarr := v.MustStrSlice()\n\tcollected := make([]interface{}, len(arr))\n\tv.EachStr(func(index int, val string) bool {\n\t\tcollected[index] = collector(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: collected}\n}\n\n/*\n\tInt (int and []int)\n*/\n\n// Int gets the value as a int, returns the optionalDefault\n// value or a system default object if the value is the wrong type.\nfunc (v *Value) Int(optionalDefault ...int) int {\n\tif s, ok := v.data.(int); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn 0\n}\n\n// MustInt gets the value as a int.\n//\n// Panics if the object is not a int.\nfunc (v *Value) MustInt() int {\n\treturn v.data.(int)\n}\n\n// IntSlice gets the value as a []int, returns the optionalDefault\n// value or nil if the value is not a []int.\nfunc (v *Value) IntSlice(optionalDefault ...[]int) []int {\n\tif s, ok := v.data.([]int); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustIntSlice gets the value as a []int.\n//\n// Panics if the object is not a []int.\nfunc (v *Value) MustIntSlice() []int {\n\treturn v.data.([]int)\n}\n\n// IsInt gets whether the object contained is a int or not.\nfunc (v *Value) IsInt() bool {\n\t_, ok := v.data.(int)\n\treturn ok\n}\n\n// IsIntSlice gets whether the object contained is a []int or not.\nfunc (v *Value) IsIntSlice() bool {\n\t_, ok := v.data.([]int)\n\treturn ok\n}\n\n// EachInt calls the specified callback for each object\n// in the []int.\n//\n// Panics if the object is the wrong type.\nfunc (v *Value) EachInt(callback func(int, int) bool) *Value {\n\tfor index, val := range v.MustIntSlice() {\n\t\tcarryon := callback(index, val)\n\t\tif !carryon {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v\n}\n\n// WhereInt uses the specified decider function to select items\n// from the []int. The object contained in the result will contain\n// only the selected items.\nfunc (v *Value) WhereInt(decider func(int, int) bool) *Value {\n\tvar selected []int\n\tv.EachInt(func(index int, val int) bool {\n\t\tshouldSelect := decider(index, val)\n\t\tif !shouldSelect {\n\t\t\tselected = append(selected, val)\n\t\t}\n\t\treturn true\n\t})\n\treturn &Value{data: selected}\n}\n\n// GroupInt uses the specified grouper function to group the items\n// keyed by the return of the grouper. The object contained in the\n// result will contain a map[string][]int.\nfunc (v *Value) GroupInt(grouper func(int, int) string) *Value {\n\tgroups := make(map[string][]int)\n\tv.EachInt(func(index int, val int) bool {\n\t\tgroup := grouper(index, val)\n\t\tif _, ok := groups[group]; !ok {\n\t\t\tgroups[group] = make([]int, 0)\n\t\t}\n\t\tgroups[group] = append(groups[group], val)\n\t\treturn true\n\t})\n\treturn &Value{data: groups}\n}\n\n// ReplaceInt uses the specified function to replace each ints\n// by iterating each item. The data in the returned result will be a\n// []int containing the replaced items.\nfunc (v *Value) ReplaceInt(replacer func(int, int) int) *Value {\n\tarr := v.MustIntSlice()\n\treplaced := make([]int, len(arr))\n\tv.EachInt(func(index int, val int) bool {\n\t\treplaced[index] = replacer(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: replaced}\n}\n\n// CollectInt uses the specified collector function to collect a value\n// for each of the ints in the slice. The data returned will be a\n// []interface{}.\nfunc (v *Value) CollectInt(collector func(int, int) interface{}) *Value {\n\tarr := v.MustIntSlice()\n\tcollected := make([]interface{}, len(arr))\n\tv.EachInt(func(index int, val int) bool {\n\t\tcollected[index] = collector(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: collected}\n}\n\n/*\n\tInt8 (int8 and []int8)\n*/\n\n// Int8 gets the value as a int8, returns the optionalDefault\n// value or a system default object if the value is the wrong type.\nfunc (v *Value) Int8(optionalDefault ...int8) int8 {\n\tif s, ok := v.data.(int8); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn 0\n}\n\n// MustInt8 gets the value as a int8.\n//\n// Panics if the object is not a int8.\nfunc (v *Value) MustInt8() int8 {\n\treturn v.data.(int8)\n}\n\n// Int8Slice gets the value as a []int8, returns the optionalDefault\n// value or nil if the value is not a []int8.\nfunc (v *Value) Int8Slice(optionalDefault ...[]int8) []int8 {\n\tif s, ok := v.data.([]int8); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustInt8Slice gets the value as a []int8.\n//\n// Panics if the object is not a []int8.\nfunc (v *Value) MustInt8Slice() []int8 {\n\treturn v.data.([]int8)\n}\n\n// IsInt8 gets whether the object contained is a int8 or not.\nfunc (v *Value) IsInt8() bool {\n\t_, ok := v.data.(int8)\n\treturn ok\n}\n\n// IsInt8Slice gets whether the object contained is a []int8 or not.\nfunc (v *Value) IsInt8Slice() bool {\n\t_, ok := v.data.([]int8)\n\treturn ok\n}\n\n// EachInt8 calls the specified callback for each object\n// in the []int8.\n//\n// Panics if the object is the wrong type.\nfunc (v *Value) EachInt8(callback func(int, int8) bool) *Value {\n\tfor index, val := range v.MustInt8Slice() {\n\t\tcarryon := callback(index, val)\n\t\tif !carryon {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v\n}\n\n// WhereInt8 uses the specified decider function to select items\n// from the []int8. The object contained in the result will contain\n// only the selected items.\nfunc (v *Value) WhereInt8(decider func(int, int8) bool) *Value {\n\tvar selected []int8\n\tv.EachInt8(func(index int, val int8) bool {\n\t\tshouldSelect := decider(index, val)\n\t\tif !shouldSelect {\n\t\t\tselected = append(selected, val)\n\t\t}\n\t\treturn true\n\t})\n\treturn &Value{data: selected}\n}\n\n// GroupInt8 uses the specified grouper function to group the items\n// keyed by the return of the grouper. The object contained in the\n// result will contain a map[string][]int8.\nfunc (v *Value) GroupInt8(grouper func(int, int8) string) *Value {\n\tgroups := make(map[string][]int8)\n\tv.EachInt8(func(index int, val int8) bool {\n\t\tgroup := grouper(index, val)\n\t\tif _, ok := groups[group]; !ok {\n\t\t\tgroups[group] = make([]int8, 0)\n\t\t}\n\t\tgroups[group] = append(groups[group], val)\n\t\treturn true\n\t})\n\treturn &Value{data: groups}\n}\n\n// ReplaceInt8 uses the specified function to replace each int8s\n// by iterating each item. The data in the returned result will be a\n// []int8 containing the replaced items.\nfunc (v *Value) ReplaceInt8(replacer func(int, int8) int8) *Value {\n\tarr := v.MustInt8Slice()\n\treplaced := make([]int8, len(arr))\n\tv.EachInt8(func(index int, val int8) bool {\n\t\treplaced[index] = replacer(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: replaced}\n}\n\n// CollectInt8 uses the specified collector function to collect a value\n// for each of the int8s in the slice. The data returned will be a\n// []interface{}.\nfunc (v *Value) CollectInt8(collector func(int, int8) interface{}) *Value {\n\tarr := v.MustInt8Slice()\n\tcollected := make([]interface{}, len(arr))\n\tv.EachInt8(func(index int, val int8) bool {\n\t\tcollected[index] = collector(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: collected}\n}\n\n/*\n\tInt16 (int16 and []int16)\n*/\n\n// Int16 gets the value as a int16, returns the optionalDefault\n// value or a system default object if the value is the wrong type.\nfunc (v *Value) Int16(optionalDefault ...int16) int16 {\n\tif s, ok := v.data.(int16); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn 0\n}\n\n// MustInt16 gets the value as a int16.\n//\n// Panics if the object is not a int16.\nfunc (v *Value) MustInt16() int16 {\n\treturn v.data.(int16)\n}\n\n// Int16Slice gets the value as a []int16, returns the optionalDefault\n// value or nil if the value is not a []int16.\nfunc (v *Value) Int16Slice(optionalDefault ...[]int16) []int16 {\n\tif s, ok := v.data.([]int16); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustInt16Slice gets the value as a []int16.\n//\n// Panics if the object is not a []int16.\nfunc (v *Value) MustInt16Slice() []int16 {\n\treturn v.data.([]int16)\n}\n\n// IsInt16 gets whether the object contained is a int16 or not.\nfunc (v *Value) IsInt16() bool {\n\t_, ok := v.data.(int16)\n\treturn ok\n}\n\n// IsInt16Slice gets whether the object contained is a []int16 or not.\nfunc (v *Value) IsInt16Slice() bool {\n\t_, ok := v.data.([]int16)\n\treturn ok\n}\n\n// EachInt16 calls the specified callback for each object\n// in the []int16.\n//\n// Panics if the object is the wrong type.\nfunc (v *Value) EachInt16(callback func(int, int16) bool) *Value {\n\tfor index, val := range v.MustInt16Slice() {\n\t\tcarryon := callback(index, val)\n\t\tif !carryon {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v\n}\n\n// WhereInt16 uses the specified decider function to select items\n// from the []int16. The object contained in the result will contain\n// only the selected items.\nfunc (v *Value) WhereInt16(decider func(int, int16) bool) *Value {\n\tvar selected []int16\n\tv.EachInt16(func(index int, val int16) bool {\n\t\tshouldSelect := decider(index, val)\n\t\tif !shouldSelect {\n\t\t\tselected = append(selected, val)\n\t\t}\n\t\treturn true\n\t})\n\treturn &Value{data: selected}\n}\n\n// GroupInt16 uses the specified grouper function to group the items\n// keyed by the return of the grouper. The object contained in the\n// result will contain a map[string][]int16.\nfunc (v *Value) GroupInt16(grouper func(int, int16) string) *Value {\n\tgroups := make(map[string][]int16)\n\tv.EachInt16(func(index int, val int16) bool {\n\t\tgroup := grouper(index, val)\n\t\tif _, ok := groups[group]; !ok {\n\t\t\tgroups[group] = make([]int16, 0)\n\t\t}\n\t\tgroups[group] = append(groups[group], val)\n\t\treturn true\n\t})\n\treturn &Value{data: groups}\n}\n\n// ReplaceInt16 uses the specified function to replace each int16s\n// by iterating each item. The data in the returned result will be a\n// []int16 containing the replaced items.\nfunc (v *Value) ReplaceInt16(replacer func(int, int16) int16) *Value {\n\tarr := v.MustInt16Slice()\n\treplaced := make([]int16, len(arr))\n\tv.EachInt16(func(index int, val int16) bool {\n\t\treplaced[index] = replacer(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: replaced}\n}\n\n// CollectInt16 uses the specified collector function to collect a value\n// for each of the int16s in the slice. The data returned will be a\n// []interface{}.\nfunc (v *Value) CollectInt16(collector func(int, int16) interface{}) *Value {\n\tarr := v.MustInt16Slice()\n\tcollected := make([]interface{}, len(arr))\n\tv.EachInt16(func(index int, val int16) bool {\n\t\tcollected[index] = collector(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: collected}\n}\n\n/*\n\tInt32 (int32 and []int32)\n*/\n\n// Int32 gets the value as a int32, returns the optionalDefault\n// value or a system default object if the value is the wrong type.\nfunc (v *Value) Int32(optionalDefault ...int32) int32 {\n\tif s, ok := v.data.(int32); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn 0\n}\n\n// MustInt32 gets the value as a int32.\n//\n// Panics if the object is not a int32.\nfunc (v *Value) MustInt32() int32 {\n\treturn v.data.(int32)\n}\n\n// Int32Slice gets the value as a []int32, returns the optionalDefault\n// value or nil if the value is not a []int32.\nfunc (v *Value) Int32Slice(optionalDefault ...[]int32) []int32 {\n\tif s, ok := v.data.([]int32); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustInt32Slice gets the value as a []int32.\n//\n// Panics if the object is not a []int32.\nfunc (v *Value) MustInt32Slice() []int32 {\n\treturn v.data.([]int32)\n}\n\n// IsInt32 gets whether the object contained is a int32 or not.\nfunc (v *Value) IsInt32() bool {\n\t_, ok := v.data.(int32)\n\treturn ok\n}\n\n// IsInt32Slice gets whether the object contained is a []int32 or not.\nfunc (v *Value) IsInt32Slice() bool {\n\t_, ok := v.data.([]int32)\n\treturn ok\n}\n\n// EachInt32 calls the specified callback for each object\n// in the []int32.\n//\n// Panics if the object is the wrong type.\nfunc (v *Value) EachInt32(callback func(int, int32) bool) *Value {\n\tfor index, val := range v.MustInt32Slice() {\n\t\tcarryon := callback(index, val)\n\t\tif !carryon {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v\n}\n\n// WhereInt32 uses the specified decider function to select items\n// from the []int32. The object contained in the result will contain\n// only the selected items.\nfunc (v *Value) WhereInt32(decider func(int, int32) bool) *Value {\n\tvar selected []int32\n\tv.EachInt32(func(index int, val int32) bool {\n\t\tshouldSelect := decider(index, val)\n\t\tif !shouldSelect {\n\t\t\tselected = append(selected, val)\n\t\t}\n\t\treturn true\n\t})\n\treturn &Value{data: selected}\n}\n\n// GroupInt32 uses the specified grouper function to group the items\n// keyed by the return of the grouper. The object contained in the\n// result will contain a map[string][]int32.\nfunc (v *Value) GroupInt32(grouper func(int, int32) string) *Value {\n\tgroups := make(map[string][]int32)\n\tv.EachInt32(func(index int, val int32) bool {\n\t\tgroup := grouper(index, val)\n\t\tif _, ok := groups[group]; !ok {\n\t\t\tgroups[group] = make([]int32, 0)\n\t\t}\n\t\tgroups[group] = append(groups[group], val)\n\t\treturn true\n\t})\n\treturn &Value{data: groups}\n}\n\n// ReplaceInt32 uses the specified function to replace each int32s\n// by iterating each item. The data in the returned result will be a\n// []int32 containing the replaced items.\nfunc (v *Value) ReplaceInt32(replacer func(int, int32) int32) *Value {\n\tarr := v.MustInt32Slice()\n\treplaced := make([]int32, len(arr))\n\tv.EachInt32(func(index int, val int32) bool {\n\t\treplaced[index] = replacer(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: replaced}\n}\n\n// CollectInt32 uses the specified collector function to collect a value\n// for each of the int32s in the slice. The data returned will be a\n// []interface{}.\nfunc (v *Value) CollectInt32(collector func(int, int32) interface{}) *Value {\n\tarr := v.MustInt32Slice()\n\tcollected := make([]interface{}, len(arr))\n\tv.EachInt32(func(index int, val int32) bool {\n\t\tcollected[index] = collector(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: collected}\n}\n\n/*\n\tInt64 (int64 and []int64)\n*/\n\n// Int64 gets the value as a int64, returns the optionalDefault\n// value or a system default object if the value is the wrong type.\nfunc (v *Value) Int64(optionalDefault ...int64) int64 {\n\tif s, ok := v.data.(int64); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn 0\n}\n\n// MustInt64 gets the value as a int64.\n//\n// Panics if the object is not a int64.\nfunc (v *Value) MustInt64() int64 {\n\treturn v.data.(int64)\n}\n\n// Int64Slice gets the value as a []int64, returns the optionalDefault\n// value or nil if the value is not a []int64.\nfunc (v *Value) Int64Slice(optionalDefault ...[]int64) []int64 {\n\tif s, ok := v.data.([]int64); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustInt64Slice gets the value as a []int64.\n//\n// Panics if the object is not a []int64.\nfunc (v *Value) MustInt64Slice() []int64 {\n\treturn v.data.([]int64)\n}\n\n// IsInt64 gets whether the object contained is a int64 or not.\nfunc (v *Value) IsInt64() bool {\n\t_, ok := v.data.(int64)\n\treturn ok\n}\n\n// IsInt64Slice gets whether the object contained is a []int64 or not.\nfunc (v *Value) IsInt64Slice() bool {\n\t_, ok := v.data.([]int64)\n\treturn ok\n}\n\n// EachInt64 calls the specified callback for each object\n// in the []int64.\n//\n// Panics if the object is the wrong type.\nfunc (v *Value) EachInt64(callback func(int, int64) bool) *Value {\n\tfor index, val := range v.MustInt64Slice() {\n\t\tcarryon := callback(index, val)\n\t\tif !carryon {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v\n}\n\n// WhereInt64 uses the specified decider function to select items\n// from the []int64. The object contained in the result will contain\n// only the selected items.\nfunc (v *Value) WhereInt64(decider func(int, int64) bool) *Value {\n\tvar selected []int64\n\tv.EachInt64(func(index int, val int64) bool {\n\t\tshouldSelect := decider(index, val)\n\t\tif !shouldSelect {\n\t\t\tselected = append(selected, val)\n\t\t}\n\t\treturn true\n\t})\n\treturn &Value{data: selected}\n}\n\n// GroupInt64 uses the specified grouper function to group the items\n// keyed by the return of the grouper. The object contained in the\n// result will contain a map[string][]int64.\nfunc (v *Value) GroupInt64(grouper func(int, int64) string) *Value {\n\tgroups := make(map[string][]int64)\n\tv.EachInt64(func(index int, val int64) bool {\n\t\tgroup := grouper(index, val)\n\t\tif _, ok := groups[group]; !ok {\n\t\t\tgroups[group] = make([]int64, 0)\n\t\t}\n\t\tgroups[group] = append(groups[group], val)\n\t\treturn true\n\t})\n\treturn &Value{data: groups}\n}\n\n// ReplaceInt64 uses the specified function to replace each int64s\n// by iterating each item. The data in the returned result will be a\n// []int64 containing the replaced items.\nfunc (v *Value) ReplaceInt64(replacer func(int, int64) int64) *Value {\n\tarr := v.MustInt64Slice()\n\treplaced := make([]int64, len(arr))\n\tv.EachInt64(func(index int, val int64) bool {\n\t\treplaced[index] = replacer(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: replaced}\n}\n\n// CollectInt64 uses the specified collector function to collect a value\n// for each of the int64s in the slice. The data returned will be a\n// []interface{}.\nfunc (v *Value) CollectInt64(collector func(int, int64) interface{}) *Value {\n\tarr := v.MustInt64Slice()\n\tcollected := make([]interface{}, len(arr))\n\tv.EachInt64(func(index int, val int64) bool {\n\t\tcollected[index] = collector(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: collected}\n}\n\n/*\n\tUint (uint and []uint)\n*/\n\n// Uint gets the value as a uint, returns the optionalDefault\n// value or a system default object if the value is the wrong type.\nfunc (v *Value) Uint(optionalDefault ...uint) uint {\n\tif s, ok := v.data.(uint); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn 0\n}\n\n// MustUint gets the value as a uint.\n//\n// Panics if the object is not a uint.\nfunc (v *Value) MustUint() uint {\n\treturn v.data.(uint)\n}\n\n// UintSlice gets the value as a []uint, returns the optionalDefault\n// value or nil if the value is not a []uint.\nfunc (v *Value) UintSlice(optionalDefault ...[]uint) []uint {\n\tif s, ok := v.data.([]uint); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustUintSlice gets the value as a []uint.\n//\n// Panics if the object is not a []uint.\nfunc (v *Value) MustUintSlice() []uint {\n\treturn v.data.([]uint)\n}\n\n// IsUint gets whether the object contained is a uint or not.\nfunc (v *Value) IsUint() bool {\n\t_, ok := v.data.(uint)\n\treturn ok\n}\n\n// IsUintSlice gets whether the object contained is a []uint or not.\nfunc (v *Value) IsUintSlice() bool {\n\t_, ok := v.data.([]uint)\n\treturn ok\n}\n\n// EachUint calls the specified callback for each object\n// in the []uint.\n//\n// Panics if the object is the wrong type.\nfunc (v *Value) EachUint(callback func(int, uint) bool) *Value {\n\tfor index, val := range v.MustUintSlice() {\n\t\tcarryon := callback(index, val)\n\t\tif !carryon {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v\n}\n\n// WhereUint uses the specified decider function to select items\n// from the []uint. The object contained in the result will contain\n// only the selected items.\nfunc (v *Value) WhereUint(decider func(int, uint) bool) *Value {\n\tvar selected []uint\n\tv.EachUint(func(index int, val uint) bool {\n\t\tshouldSelect := decider(index, val)\n\t\tif !shouldSelect {\n\t\t\tselected = append(selected, val)\n\t\t}\n\t\treturn true\n\t})\n\treturn &Value{data: selected}\n}\n\n// GroupUint uses the specified grouper function to group the items\n// keyed by the return of the grouper. The object contained in the\n// result will contain a map[string][]uint.\nfunc (v *Value) GroupUint(grouper func(int, uint) string) *Value {\n\tgroups := make(map[string][]uint)\n\tv.EachUint(func(index int, val uint) bool {\n\t\tgroup := grouper(index, val)\n\t\tif _, ok := groups[group]; !ok {\n\t\t\tgroups[group] = make([]uint, 0)\n\t\t}\n\t\tgroups[group] = append(groups[group], val)\n\t\treturn true\n\t})\n\treturn &Value{data: groups}\n}\n\n// ReplaceUint uses the specified function to replace each uints\n// by iterating each item. The data in the returned result will be a\n// []uint containing the replaced items.\nfunc (v *Value) ReplaceUint(replacer func(int, uint) uint) *Value {\n\tarr := v.MustUintSlice()\n\treplaced := make([]uint, len(arr))\n\tv.EachUint(func(index int, val uint) bool {\n\t\treplaced[index] = replacer(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: replaced}\n}\n\n// CollectUint uses the specified collector function to collect a value\n// for each of the uints in the slice. The data returned will be a\n// []interface{}.\nfunc (v *Value) CollectUint(collector func(int, uint) interface{}) *Value {\n\tarr := v.MustUintSlice()\n\tcollected := make([]interface{}, len(arr))\n\tv.EachUint(func(index int, val uint) bool {\n\t\tcollected[index] = collector(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: collected}\n}\n\n/*\n\tUint8 (uint8 and []uint8)\n*/\n\n// Uint8 gets the value as a uint8, returns the optionalDefault\n// value or a system default object if the value is the wrong type.\nfunc (v *Value) Uint8(optionalDefault ...uint8) uint8 {\n\tif s, ok := v.data.(uint8); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn 0\n}\n\n// MustUint8 gets the value as a uint8.\n//\n// Panics if the object is not a uint8.\nfunc (v *Value) MustUint8() uint8 {\n\treturn v.data.(uint8)\n}\n\n// Uint8Slice gets the value as a []uint8, returns the optionalDefault\n// value or nil if the value is not a []uint8.\nfunc (v *Value) Uint8Slice(optionalDefault ...[]uint8) []uint8 {\n\tif s, ok := v.data.([]uint8); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustUint8Slice gets the value as a []uint8.\n//\n// Panics if the object is not a []uint8.\nfunc (v *Value) MustUint8Slice() []uint8 {\n\treturn v.data.([]uint8)\n}\n\n// IsUint8 gets whether the object contained is a uint8 or not.\nfunc (v *Value) IsUint8() bool {\n\t_, ok := v.data.(uint8)\n\treturn ok\n}\n\n// IsUint8Slice gets whether the object contained is a []uint8 or not.\nfunc (v *Value) IsUint8Slice() bool {\n\t_, ok := v.data.([]uint8)\n\treturn ok\n}\n\n// EachUint8 calls the specified callback for each object\n// in the []uint8.\n//\n// Panics if the object is the wrong type.\nfunc (v *Value) EachUint8(callback func(int, uint8) bool) *Value {\n\tfor index, val := range v.MustUint8Slice() {\n\t\tcarryon := callback(index, val)\n\t\tif !carryon {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v\n}\n\n// WhereUint8 uses the specified decider function to select items\n// from the []uint8. The object contained in the result will contain\n// only the selected items.\nfunc (v *Value) WhereUint8(decider func(int, uint8) bool) *Value {\n\tvar selected []uint8\n\tv.EachUint8(func(index int, val uint8) bool {\n\t\tshouldSelect := decider(index, val)\n\t\tif !shouldSelect {\n\t\t\tselected = append(selected, val)\n\t\t}\n\t\treturn true\n\t})\n\treturn &Value{data: selected}\n}\n\n// GroupUint8 uses the specified grouper function to group the items\n// keyed by the return of the grouper. The object contained in the\n// result will contain a map[string][]uint8.\nfunc (v *Value) GroupUint8(grouper func(int, uint8) string) *Value {\n\tgroups := make(map[string][]uint8)\n\tv.EachUint8(func(index int, val uint8) bool {\n\t\tgroup := grouper(index, val)\n\t\tif _, ok := groups[group]; !ok {\n\t\t\tgroups[group] = make([]uint8, 0)\n\t\t}\n\t\tgroups[group] = append(groups[group], val)\n\t\treturn true\n\t})\n\treturn &Value{data: groups}\n}\n\n// ReplaceUint8 uses the specified function to replace each uint8s\n// by iterating each item. The data in the returned result will be a\n// []uint8 containing the replaced items.\nfunc (v *Value) ReplaceUint8(replacer func(int, uint8) uint8) *Value {\n\tarr := v.MustUint8Slice()\n\treplaced := make([]uint8, len(arr))\n\tv.EachUint8(func(index int, val uint8) bool {\n\t\treplaced[index] = replacer(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: replaced}\n}\n\n// CollectUint8 uses the specified collector function to collect a value\n// for each of the uint8s in the slice. The data returned will be a\n// []interface{}.\nfunc (v *Value) CollectUint8(collector func(int, uint8) interface{}) *Value {\n\tarr := v.MustUint8Slice()\n\tcollected := make([]interface{}, len(arr))\n\tv.EachUint8(func(index int, val uint8) bool {\n\t\tcollected[index] = collector(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: collected}\n}\n\n/*\n\tUint16 (uint16 and []uint16)\n*/\n\n// Uint16 gets the value as a uint16, returns the optionalDefault\n// value or a system default object if the value is the wrong type.\nfunc (v *Value) Uint16(optionalDefault ...uint16) uint16 {\n\tif s, ok := v.data.(uint16); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn 0\n}\n\n// MustUint16 gets the value as a uint16.\n//\n// Panics if the object is not a uint16.\nfunc (v *Value) MustUint16() uint16 {\n\treturn v.data.(uint16)\n}\n\n// Uint16Slice gets the value as a []uint16, returns the optionalDefault\n// value or nil if the value is not a []uint16.\nfunc (v *Value) Uint16Slice(optionalDefault ...[]uint16) []uint16 {\n\tif s, ok := v.data.([]uint16); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustUint16Slice gets the value as a []uint16.\n//\n// Panics if the object is not a []uint16.\nfunc (v *Value) MustUint16Slice() []uint16 {\n\treturn v.data.([]uint16)\n}\n\n// IsUint16 gets whether the object contained is a uint16 or not.\nfunc (v *Value) IsUint16() bool {\n\t_, ok := v.data.(uint16)\n\treturn ok\n}\n\n// IsUint16Slice gets whether the object contained is a []uint16 or not.\nfunc (v *Value) IsUint16Slice() bool {\n\t_, ok := v.data.([]uint16)\n\treturn ok\n}\n\n// EachUint16 calls the specified callback for each object\n// in the []uint16.\n//\n// Panics if the object is the wrong type.\nfunc (v *Value) EachUint16(callback func(int, uint16) bool) *Value {\n\tfor index, val := range v.MustUint16Slice() {\n\t\tcarryon := callback(index, val)\n\t\tif !carryon {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v\n}\n\n// WhereUint16 uses the specified decider function to select items\n// from the []uint16. The object contained in the result will contain\n// only the selected items.\nfunc (v *Value) WhereUint16(decider func(int, uint16) bool) *Value {\n\tvar selected []uint16\n\tv.EachUint16(func(index int, val uint16) bool {\n\t\tshouldSelect := decider(index, val)\n\t\tif !shouldSelect {\n\t\t\tselected = append(selected, val)\n\t\t}\n\t\treturn true\n\t})\n\treturn &Value{data: selected}\n}\n\n// GroupUint16 uses the specified grouper function to group the items\n// keyed by the return of the grouper. The object contained in the\n// result will contain a map[string][]uint16.\nfunc (v *Value) GroupUint16(grouper func(int, uint16) string) *Value {\n\tgroups := make(map[string][]uint16)\n\tv.EachUint16(func(index int, val uint16) bool {\n\t\tgroup := grouper(index, val)\n\t\tif _, ok := groups[group]; !ok {\n\t\t\tgroups[group] = make([]uint16, 0)\n\t\t}\n\t\tgroups[group] = append(groups[group], val)\n\t\treturn true\n\t})\n\treturn &Value{data: groups}\n}\n\n// ReplaceUint16 uses the specified function to replace each uint16s\n// by iterating each item. The data in the returned result will be a\n// []uint16 containing the replaced items.\nfunc (v *Value) ReplaceUint16(replacer func(int, uint16) uint16) *Value {\n\tarr := v.MustUint16Slice()\n\treplaced := make([]uint16, len(arr))\n\tv.EachUint16(func(index int, val uint16) bool {\n\t\treplaced[index] = replacer(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: replaced}\n}\n\n// CollectUint16 uses the specified collector function to collect a value\n// for each of the uint16s in the slice. The data returned will be a\n// []interface{}.\nfunc (v *Value) CollectUint16(collector func(int, uint16) interface{}) *Value {\n\tarr := v.MustUint16Slice()\n\tcollected := make([]interface{}, len(arr))\n\tv.EachUint16(func(index int, val uint16) bool {\n\t\tcollected[index] = collector(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: collected}\n}\n\n/*\n\tUint32 (uint32 and []uint32)\n*/\n\n// Uint32 gets the value as a uint32, returns the optionalDefault\n// value or a system default object if the value is the wrong type.\nfunc (v *Value) Uint32(optionalDefault ...uint32) uint32 {\n\tif s, ok := v.data.(uint32); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn 0\n}\n\n// MustUint32 gets the value as a uint32.\n//\n// Panics if the object is not a uint32.\nfunc (v *Value) MustUint32() uint32 {\n\treturn v.data.(uint32)\n}\n\n// Uint32Slice gets the value as a []uint32, returns the optionalDefault\n// value or nil if the value is not a []uint32.\nfunc (v *Value) Uint32Slice(optionalDefault ...[]uint32) []uint32 {\n\tif s, ok := v.data.([]uint32); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustUint32Slice gets the value as a []uint32.\n//\n// Panics if the object is not a []uint32.\nfunc (v *Value) MustUint32Slice() []uint32 {\n\treturn v.data.([]uint32)\n}\n\n// IsUint32 gets whether the object contained is a uint32 or not.\nfunc (v *Value) IsUint32() bool {\n\t_, ok := v.data.(uint32)\n\treturn ok\n}\n\n// IsUint32Slice gets whether the object contained is a []uint32 or not.\nfunc (v *Value) IsUint32Slice() bool {\n\t_, ok := v.data.([]uint32)\n\treturn ok\n}\n\n// EachUint32 calls the specified callback for each object\n// in the []uint32.\n//\n// Panics if the object is the wrong type.\nfunc (v *Value) EachUint32(callback func(int, uint32) bool) *Value {\n\tfor index, val := range v.MustUint32Slice() {\n\t\tcarryon := callback(index, val)\n\t\tif !carryon {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v\n}\n\n// WhereUint32 uses the specified decider function to select items\n// from the []uint32. The object contained in the result will contain\n// only the selected items.\nfunc (v *Value) WhereUint32(decider func(int, uint32) bool) *Value {\n\tvar selected []uint32\n\tv.EachUint32(func(index int, val uint32) bool {\n\t\tshouldSelect := decider(index, val)\n\t\tif !shouldSelect {\n\t\t\tselected = append(selected, val)\n\t\t}\n\t\treturn true\n\t})\n\treturn &Value{data: selected}\n}\n\n// GroupUint32 uses the specified grouper function to group the items\n// keyed by the return of the grouper. The object contained in the\n// result will contain a map[string][]uint32.\nfunc (v *Value) GroupUint32(grouper func(int, uint32) string) *Value {\n\tgroups := make(map[string][]uint32)\n\tv.EachUint32(func(index int, val uint32) bool {\n\t\tgroup := grouper(index, val)\n\t\tif _, ok := groups[group]; !ok {\n\t\t\tgroups[group] = make([]uint32, 0)\n\t\t}\n\t\tgroups[group] = append(groups[group], val)\n\t\treturn true\n\t})\n\treturn &Value{data: groups}\n}\n\n// ReplaceUint32 uses the specified function to replace each uint32s\n// by iterating each item. The data in the returned result will be a\n// []uint32 containing the replaced items.\nfunc (v *Value) ReplaceUint32(replacer func(int, uint32) uint32) *Value {\n\tarr := v.MustUint32Slice()\n\treplaced := make([]uint32, len(arr))\n\tv.EachUint32(func(index int, val uint32) bool {\n\t\treplaced[index] = replacer(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: replaced}\n}\n\n// CollectUint32 uses the specified collector function to collect a value\n// for each of the uint32s in the slice. The data returned will be a\n// []interface{}.\nfunc (v *Value) CollectUint32(collector func(int, uint32) interface{}) *Value {\n\tarr := v.MustUint32Slice()\n\tcollected := make([]interface{}, len(arr))\n\tv.EachUint32(func(index int, val uint32) bool {\n\t\tcollected[index] = collector(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: collected}\n}\n\n/*\n\tUint64 (uint64 and []uint64)\n*/\n\n// Uint64 gets the value as a uint64, returns the optionalDefault\n// value or a system default object if the value is the wrong type.\nfunc (v *Value) Uint64(optionalDefault ...uint64) uint64 {\n\tif s, ok := v.data.(uint64); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn 0\n}\n\n// MustUint64 gets the value as a uint64.\n//\n// Panics if the object is not a uint64.\nfunc (v *Value) MustUint64() uint64 {\n\treturn v.data.(uint64)\n}\n\n// Uint64Slice gets the value as a []uint64, returns the optionalDefault\n// value or nil if the value is not a []uint64.\nfunc (v *Value) Uint64Slice(optionalDefault ...[]uint64) []uint64 {\n\tif s, ok := v.data.([]uint64); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustUint64Slice gets the value as a []uint64.\n//\n// Panics if the object is not a []uint64.\nfunc (v *Value) MustUint64Slice() []uint64 {\n\treturn v.data.([]uint64)\n}\n\n// IsUint64 gets whether the object contained is a uint64 or not.\nfunc (v *Value) IsUint64() bool {\n\t_, ok := v.data.(uint64)\n\treturn ok\n}\n\n// IsUint64Slice gets whether the object contained is a []uint64 or not.\nfunc (v *Value) IsUint64Slice() bool {\n\t_, ok := v.data.([]uint64)\n\treturn ok\n}\n\n// EachUint64 calls the specified callback for each object\n// in the []uint64.\n//\n// Panics if the object is the wrong type.\nfunc (v *Value) EachUint64(callback func(int, uint64) bool) *Value {\n\tfor index, val := range v.MustUint64Slice() {\n\t\tcarryon := callback(index, val)\n\t\tif !carryon {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v\n}\n\n// WhereUint64 uses the specified decider function to select items\n// from the []uint64. The object contained in the result will contain\n// only the selected items.\nfunc (v *Value) WhereUint64(decider func(int, uint64) bool) *Value {\n\tvar selected []uint64\n\tv.EachUint64(func(index int, val uint64) bool {\n\t\tshouldSelect := decider(index, val)\n\t\tif !shouldSelect {\n\t\t\tselected = append(selected, val)\n\t\t}\n\t\treturn true\n\t})\n\treturn &Value{data: selected}\n}\n\n// GroupUint64 uses the specified grouper function to group the items\n// keyed by the return of the grouper. The object contained in the\n// result will contain a map[string][]uint64.\nfunc (v *Value) GroupUint64(grouper func(int, uint64) string) *Value {\n\tgroups := make(map[string][]uint64)\n\tv.EachUint64(func(index int, val uint64) bool {\n\t\tgroup := grouper(index, val)\n\t\tif _, ok := groups[group]; !ok {\n\t\t\tgroups[group] = make([]uint64, 0)\n\t\t}\n\t\tgroups[group] = append(groups[group], val)\n\t\treturn true\n\t})\n\treturn &Value{data: groups}\n}\n\n// ReplaceUint64 uses the specified function to replace each uint64s\n// by iterating each item. The data in the returned result will be a\n// []uint64 containing the replaced items.\nfunc (v *Value) ReplaceUint64(replacer func(int, uint64) uint64) *Value {\n\tarr := v.MustUint64Slice()\n\treplaced := make([]uint64, len(arr))\n\tv.EachUint64(func(index int, val uint64) bool {\n\t\treplaced[index] = replacer(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: replaced}\n}\n\n// CollectUint64 uses the specified collector function to collect a value\n// for each of the uint64s in the slice. The data returned will be a\n// []interface{}.\nfunc (v *Value) CollectUint64(collector func(int, uint64) interface{}) *Value {\n\tarr := v.MustUint64Slice()\n\tcollected := make([]interface{}, len(arr))\n\tv.EachUint64(func(index int, val uint64) bool {\n\t\tcollected[index] = collector(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: collected}\n}\n\n/*\n\tUintptr (uintptr and []uintptr)\n*/\n\n// Uintptr gets the value as a uintptr, returns the optionalDefault\n// value or a system default object if the value is the wrong type.\nfunc (v *Value) Uintptr(optionalDefault ...uintptr) uintptr {\n\tif s, ok := v.data.(uintptr); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn 0\n}\n\n// MustUintptr gets the value as a uintptr.\n//\n// Panics if the object is not a uintptr.\nfunc (v *Value) MustUintptr() uintptr {\n\treturn v.data.(uintptr)\n}\n\n// UintptrSlice gets the value as a []uintptr, returns the optionalDefault\n// value or nil if the value is not a []uintptr.\nfunc (v *Value) UintptrSlice(optionalDefault ...[]uintptr) []uintptr {\n\tif s, ok := v.data.([]uintptr); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustUintptrSlice gets the value as a []uintptr.\n//\n// Panics if the object is not a []uintptr.\nfunc (v *Value) MustUintptrSlice() []uintptr {\n\treturn v.data.([]uintptr)\n}\n\n// IsUintptr gets whether the object contained is a uintptr or not.\nfunc (v *Value) IsUintptr() bool {\n\t_, ok := v.data.(uintptr)\n\treturn ok\n}\n\n// IsUintptrSlice gets whether the object contained is a []uintptr or not.\nfunc (v *Value) IsUintptrSlice() bool {\n\t_, ok := v.data.([]uintptr)\n\treturn ok\n}\n\n// EachUintptr calls the specified callback for each object\n// in the []uintptr.\n//\n// Panics if the object is the wrong type.\nfunc (v *Value) EachUintptr(callback func(int, uintptr) bool) *Value {\n\tfor index, val := range v.MustUintptrSlice() {\n\t\tcarryon := callback(index, val)\n\t\tif !carryon {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v\n}\n\n// WhereUintptr uses the specified decider function to select items\n// from the []uintptr. The object contained in the result will contain\n// only the selected items.\nfunc (v *Value) WhereUintptr(decider func(int, uintptr) bool) *Value {\n\tvar selected []uintptr\n\tv.EachUintptr(func(index int, val uintptr) bool {\n\t\tshouldSelect := decider(index, val)\n\t\tif !shouldSelect {\n\t\t\tselected = append(selected, val)\n\t\t}\n\t\treturn true\n\t})\n\treturn &Value{data: selected}\n}\n\n// GroupUintptr uses the specified grouper function to group the items\n// keyed by the return of the grouper. The object contained in the\n// result will contain a map[string][]uintptr.\nfunc (v *Value) GroupUintptr(grouper func(int, uintptr) string) *Value {\n\tgroups := make(map[string][]uintptr)\n\tv.EachUintptr(func(index int, val uintptr) bool {\n\t\tgroup := grouper(index, val)\n\t\tif _, ok := groups[group]; !ok {\n\t\t\tgroups[group] = make([]uintptr, 0)\n\t\t}\n\t\tgroups[group] = append(groups[group], val)\n\t\treturn true\n\t})\n\treturn &Value{data: groups}\n}\n\n// ReplaceUintptr uses the specified function to replace each uintptrs\n// by iterating each item. The data in the returned result will be a\n// []uintptr containing the replaced items.\nfunc (v *Value) ReplaceUintptr(replacer func(int, uintptr) uintptr) *Value {\n\tarr := v.MustUintptrSlice()\n\treplaced := make([]uintptr, len(arr))\n\tv.EachUintptr(func(index int, val uintptr) bool {\n\t\treplaced[index] = replacer(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: replaced}\n}\n\n// CollectUintptr uses the specified collector function to collect a value\n// for each of the uintptrs in the slice. The data returned will be a\n// []interface{}.\nfunc (v *Value) CollectUintptr(collector func(int, uintptr) interface{}) *Value {\n\tarr := v.MustUintptrSlice()\n\tcollected := make([]interface{}, len(arr))\n\tv.EachUintptr(func(index int, val uintptr) bool {\n\t\tcollected[index] = collector(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: collected}\n}\n\n/*\n\tFloat32 (float32 and []float32)\n*/\n\n// Float32 gets the value as a float32, returns the optionalDefault\n// value or a system default object if the value is the wrong type.\nfunc (v *Value) Float32(optionalDefault ...float32) float32 {\n\tif s, ok := v.data.(float32); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn 0\n}\n\n// MustFloat32 gets the value as a float32.\n//\n// Panics if the object is not a float32.\nfunc (v *Value) MustFloat32() float32 {\n\treturn v.data.(float32)\n}\n\n// Float32Slice gets the value as a []float32, returns the optionalDefault\n// value or nil if the value is not a []float32.\nfunc (v *Value) Float32Slice(optionalDefault ...[]float32) []float32 {\n\tif s, ok := v.data.([]float32); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustFloat32Slice gets the value as a []float32.\n//\n// Panics if the object is not a []float32.\nfunc (v *Value) MustFloat32Slice() []float32 {\n\treturn v.data.([]float32)\n}\n\n// IsFloat32 gets whether the object contained is a float32 or not.\nfunc (v *Value) IsFloat32() bool {\n\t_, ok := v.data.(float32)\n\treturn ok\n}\n\n// IsFloat32Slice gets whether the object contained is a []float32 or not.\nfunc (v *Value) IsFloat32Slice() bool {\n\t_, ok := v.data.([]float32)\n\treturn ok\n}\n\n// EachFloat32 calls the specified callback for each object\n// in the []float32.\n//\n// Panics if the object is the wrong type.\nfunc (v *Value) EachFloat32(callback func(int, float32) bool) *Value {\n\tfor index, val := range v.MustFloat32Slice() {\n\t\tcarryon := callback(index, val)\n\t\tif !carryon {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v\n}\n\n// WhereFloat32 uses the specified decider function to select items\n// from the []float32. The object contained in the result will contain\n// only the selected items.\nfunc (v *Value) WhereFloat32(decider func(int, float32) bool) *Value {\n\tvar selected []float32\n\tv.EachFloat32(func(index int, val float32) bool {\n\t\tshouldSelect := decider(index, val)\n\t\tif !shouldSelect {\n\t\t\tselected = append(selected, val)\n\t\t}\n\t\treturn true\n\t})\n\treturn &Value{data: selected}\n}\n\n// GroupFloat32 uses the specified grouper function to group the items\n// keyed by the return of the grouper. The object contained in the\n// result will contain a map[string][]float32.\nfunc (v *Value) GroupFloat32(grouper func(int, float32) string) *Value {\n\tgroups := make(map[string][]float32)\n\tv.EachFloat32(func(index int, val float32) bool {\n\t\tgroup := grouper(index, val)\n\t\tif _, ok := groups[group]; !ok {\n\t\t\tgroups[group] = make([]float32, 0)\n\t\t}\n\t\tgroups[group] = append(groups[group], val)\n\t\treturn true\n\t})\n\treturn &Value{data: groups}\n}\n\n// ReplaceFloat32 uses the specified function to replace each float32s\n// by iterating each item. The data in the returned result will be a\n// []float32 containing the replaced items.\nfunc (v *Value) ReplaceFloat32(replacer func(int, float32) float32) *Value {\n\tarr := v.MustFloat32Slice()\n\treplaced := make([]float32, len(arr))\n\tv.EachFloat32(func(index int, val float32) bool {\n\t\treplaced[index] = replacer(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: replaced}\n}\n\n// CollectFloat32 uses the specified collector function to collect a value\n// for each of the float32s in the slice. The data returned will be a\n// []interface{}.\nfunc (v *Value) CollectFloat32(collector func(int, float32) interface{}) *Value {\n\tarr := v.MustFloat32Slice()\n\tcollected := make([]interface{}, len(arr))\n\tv.EachFloat32(func(index int, val float32) bool {\n\t\tcollected[index] = collector(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: collected}\n}\n\n/*\n\tFloat64 (float64 and []float64)\n*/\n\n// Float64 gets the value as a float64, returns the optionalDefault\n// value or a system default object if the value is the wrong type.\nfunc (v *Value) Float64(optionalDefault ...float64) float64 {\n\tif s, ok := v.data.(float64); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn 0\n}\n\n// MustFloat64 gets the value as a float64.\n//\n// Panics if the object is not a float64.\nfunc (v *Value) MustFloat64() float64 {\n\treturn v.data.(float64)\n}\n\n// Float64Slice gets the value as a []float64, returns the optionalDefault\n// value or nil if the value is not a []float64.\nfunc (v *Value) Float64Slice(optionalDefault ...[]float64) []float64 {\n\tif s, ok := v.data.([]float64); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustFloat64Slice gets the value as a []float64.\n//\n// Panics if the object is not a []float64.\nfunc (v *Value) MustFloat64Slice() []float64 {\n\treturn v.data.([]float64)\n}\n\n// IsFloat64 gets whether the object contained is a float64 or not.\nfunc (v *Value) IsFloat64() bool {\n\t_, ok := v.data.(float64)\n\treturn ok\n}\n\n// IsFloat64Slice gets whether the object contained is a []float64 or not.\nfunc (v *Value) IsFloat64Slice() bool {\n\t_, ok := v.data.([]float64)\n\treturn ok\n}\n\n// EachFloat64 calls the specified callback for each object\n// in the []float64.\n//\n// Panics if the object is the wrong type.\nfunc (v *Value) EachFloat64(callback func(int, float64) bool) *Value {\n\tfor index, val := range v.MustFloat64Slice() {\n\t\tcarryon := callback(index, val)\n\t\tif !carryon {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v\n}\n\n// WhereFloat64 uses the specified decider function to select items\n// from the []float64. The object contained in the result will contain\n// only the selected items.\nfunc (v *Value) WhereFloat64(decider func(int, float64) bool) *Value {\n\tvar selected []float64\n\tv.EachFloat64(func(index int, val float64) bool {\n\t\tshouldSelect := decider(index, val)\n\t\tif !shouldSelect {\n\t\t\tselected = append(selected, val)\n\t\t}\n\t\treturn true\n\t})\n\treturn &Value{data: selected}\n}\n\n// GroupFloat64 uses the specified grouper function to group the items\n// keyed by the return of the grouper. The object contained in the\n// result will contain a map[string][]float64.\nfunc (v *Value) GroupFloat64(grouper func(int, float64) string) *Value {\n\tgroups := make(map[string][]float64)\n\tv.EachFloat64(func(index int, val float64) bool {\n\t\tgroup := grouper(index, val)\n\t\tif _, ok := groups[group]; !ok {\n\t\t\tgroups[group] = make([]float64, 0)\n\t\t}\n\t\tgroups[group] = append(groups[group], val)\n\t\treturn true\n\t})\n\treturn &Value{data: groups}\n}\n\n// ReplaceFloat64 uses the specified function to replace each float64s\n// by iterating each item. The data in the returned result will be a\n// []float64 containing the replaced items.\nfunc (v *Value) ReplaceFloat64(replacer func(int, float64) float64) *Value {\n\tarr := v.MustFloat64Slice()\n\treplaced := make([]float64, len(arr))\n\tv.EachFloat64(func(index int, val float64) bool {\n\t\treplaced[index] = replacer(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: replaced}\n}\n\n// CollectFloat64 uses the specified collector function to collect a value\n// for each of the float64s in the slice. The data returned will be a\n// []interface{}.\nfunc (v *Value) CollectFloat64(collector func(int, float64) interface{}) *Value {\n\tarr := v.MustFloat64Slice()\n\tcollected := make([]interface{}, len(arr))\n\tv.EachFloat64(func(index int, val float64) bool {\n\t\tcollected[index] = collector(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: collected}\n}\n\n/*\n\tComplex64 (complex64 and []complex64)\n*/\n\n// Complex64 gets the value as a complex64, returns the optionalDefault\n// value or a system default object if the value is the wrong type.\nfunc (v *Value) Complex64(optionalDefault ...complex64) complex64 {\n\tif s, ok := v.data.(complex64); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn 0\n}\n\n// MustComplex64 gets the value as a complex64.\n//\n// Panics if the object is not a complex64.\nfunc (v *Value) MustComplex64() complex64 {\n\treturn v.data.(complex64)\n}\n\n// Complex64Slice gets the value as a []complex64, returns the optionalDefault\n// value or nil if the value is not a []complex64.\nfunc (v *Value) Complex64Slice(optionalDefault ...[]complex64) []complex64 {\n\tif s, ok := v.data.([]complex64); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustComplex64Slice gets the value as a []complex64.\n//\n// Panics if the object is not a []complex64.\nfunc (v *Value) MustComplex64Slice() []complex64 {\n\treturn v.data.([]complex64)\n}\n\n// IsComplex64 gets whether the object contained is a complex64 or not.\nfunc (v *Value) IsComplex64() bool {\n\t_, ok := v.data.(complex64)\n\treturn ok\n}\n\n// IsComplex64Slice gets whether the object contained is a []complex64 or not.\nfunc (v *Value) IsComplex64Slice() bool {\n\t_, ok := v.data.([]complex64)\n\treturn ok\n}\n\n// EachComplex64 calls the specified callback for each object\n// in the []complex64.\n//\n// Panics if the object is the wrong type.\nfunc (v *Value) EachComplex64(callback func(int, complex64) bool) *Value {\n\tfor index, val := range v.MustComplex64Slice() {\n\t\tcarryon := callback(index, val)\n\t\tif !carryon {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v\n}\n\n// WhereComplex64 uses the specified decider function to select items\n// from the []complex64. The object contained in the result will contain\n// only the selected items.\nfunc (v *Value) WhereComplex64(decider func(int, complex64) bool) *Value {\n\tvar selected []complex64\n\tv.EachComplex64(func(index int, val complex64) bool {\n\t\tshouldSelect := decider(index, val)\n\t\tif !shouldSelect {\n\t\t\tselected = append(selected, val)\n\t\t}\n\t\treturn true\n\t})\n\treturn &Value{data: selected}\n}\n\n// GroupComplex64 uses the specified grouper function to group the items\n// keyed by the return of the grouper. The object contained in the\n// result will contain a map[string][]complex64.\nfunc (v *Value) GroupComplex64(grouper func(int, complex64) string) *Value {\n\tgroups := make(map[string][]complex64)\n\tv.EachComplex64(func(index int, val complex64) bool {\n\t\tgroup := grouper(index, val)\n\t\tif _, ok := groups[group]; !ok {\n\t\t\tgroups[group] = make([]complex64, 0)\n\t\t}\n\t\tgroups[group] = append(groups[group], val)\n\t\treturn true\n\t})\n\treturn &Value{data: groups}\n}\n\n// ReplaceComplex64 uses the specified function to replace each complex64s\n// by iterating each item. The data in the returned result will be a\n// []complex64 containing the replaced items.\nfunc (v *Value) ReplaceComplex64(replacer func(int, complex64) complex64) *Value {\n\tarr := v.MustComplex64Slice()\n\treplaced := make([]complex64, len(arr))\n\tv.EachComplex64(func(index int, val complex64) bool {\n\t\treplaced[index] = replacer(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: replaced}\n}\n\n// CollectComplex64 uses the specified collector function to collect a value\n// for each of the complex64s in the slice. The data returned will be a\n// []interface{}.\nfunc (v *Value) CollectComplex64(collector func(int, complex64) interface{}) *Value {\n\tarr := v.MustComplex64Slice()\n\tcollected := make([]interface{}, len(arr))\n\tv.EachComplex64(func(index int, val complex64) bool {\n\t\tcollected[index] = collector(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: collected}\n}\n\n/*\n\tComplex128 (complex128 and []complex128)\n*/\n\n// Complex128 gets the value as a complex128, returns the optionalDefault\n// value or a system default object if the value is the wrong type.\nfunc (v *Value) Complex128(optionalDefault ...complex128) complex128 {\n\tif s, ok := v.data.(complex128); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn 0\n}\n\n// MustComplex128 gets the value as a complex128.\n//\n// Panics if the object is not a complex128.\nfunc (v *Value) MustComplex128() complex128 {\n\treturn v.data.(complex128)\n}\n\n// Complex128Slice gets the value as a []complex128, returns the optionalDefault\n// value or nil if the value is not a []complex128.\nfunc (v *Value) Complex128Slice(optionalDefault ...[]complex128) []complex128 {\n\tif s, ok := v.data.([]complex128); ok {\n\t\treturn s\n\t}\n\tif len(optionalDefault) == 1 {\n\t\treturn optionalDefault[0]\n\t}\n\treturn nil\n}\n\n// MustComplex128Slice gets the value as a []complex128.\n//\n// Panics if the object is not a []complex128.\nfunc (v *Value) MustComplex128Slice() []complex128 {\n\treturn v.data.([]complex128)\n}\n\n// IsComplex128 gets whether the object contained is a complex128 or not.\nfunc (v *Value) IsComplex128() bool {\n\t_, ok := v.data.(complex128)\n\treturn ok\n}\n\n// IsComplex128Slice gets whether the object contained is a []complex128 or not.\nfunc (v *Value) IsComplex128Slice() bool {\n\t_, ok := v.data.([]complex128)\n\treturn ok\n}\n\n// EachComplex128 calls the specified callback for each object\n// in the []complex128.\n//\n// Panics if the object is the wrong type.\nfunc (v *Value) EachComplex128(callback func(int, complex128) bool) *Value {\n\tfor index, val := range v.MustComplex128Slice() {\n\t\tcarryon := callback(index, val)\n\t\tif !carryon {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v\n}\n\n// WhereComplex128 uses the specified decider function to select items\n// from the []complex128. The object contained in the result will contain\n// only the selected items.\nfunc (v *Value) WhereComplex128(decider func(int, complex128) bool) *Value {\n\tvar selected []complex128\n\tv.EachComplex128(func(index int, val complex128) bool {\n\t\tshouldSelect := decider(index, val)\n\t\tif !shouldSelect {\n\t\t\tselected = append(selected, val)\n\t\t}\n\t\treturn true\n\t})\n\treturn &Value{data: selected}\n}\n\n// GroupComplex128 uses the specified grouper function to group the items\n// keyed by the return of the grouper. The object contained in the\n// result will contain a map[string][]complex128.\nfunc (v *Value) GroupComplex128(grouper func(int, complex128) string) *Value {\n\tgroups := make(map[string][]complex128)\n\tv.EachComplex128(func(index int, val complex128) bool {\n\t\tgroup := grouper(index, val)\n\t\tif _, ok := groups[group]; !ok {\n\t\t\tgroups[group] = make([]complex128, 0)\n\t\t}\n\t\tgroups[group] = append(groups[group], val)\n\t\treturn true\n\t})\n\treturn &Value{data: groups}\n}\n\n// ReplaceComplex128 uses the specified function to replace each complex128s\n// by iterating each item. The data in the returned result will be a\n// []complex128 containing the replaced items.\nfunc (v *Value) ReplaceComplex128(replacer func(int, complex128) complex128) *Value {\n\tarr := v.MustComplex128Slice()\n\treplaced := make([]complex128, len(arr))\n\tv.EachComplex128(func(index int, val complex128) bool {\n\t\treplaced[index] = replacer(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: replaced}\n}\n\n// CollectComplex128 uses the specified collector function to collect a value\n// for each of the complex128s in the slice. The data returned will be a\n// []interface{}.\nfunc (v *Value) CollectComplex128(collector func(int, complex128) interface{}) *Value {\n\tarr := v.MustComplex128Slice()\n\tcollected := make([]interface{}, len(arr))\n\tv.EachComplex128(func(index int, val complex128) bool {\n\t\tcollected[index] = collector(index, val)\n\t\treturn true\n\t})\n\treturn &Value{data: collected}\n}\n"
},
{
"path": "src/github.com/stretchr/testify/vendor/github.com/stretchr/objx/value.go",
"content": "package objx\n\nimport (\n\t\"fmt\"\n\t\"strconv\"\n)\n\n// Value provides methods for extracting interface{} data in various\n// types.\ntype Value struct {\n\t// data contains the raw data being managed by this Value\n\tdata interface{}\n}\n\n// Data returns the raw data contained by this Value\nfunc (v *Value) Data() interface{} {\n\treturn v.data\n}\n\n// String returns the value always as a string\nfunc (v *Value) String() string {\n\tswitch {\n\tcase v.IsStr():\n\t\treturn v.Str()\n\tcase v.IsBool():\n\t\treturn strconv.FormatBool(v.Bool())\n\tcase v.IsFloat32():\n\t\treturn strconv.FormatFloat(float64(v.Float32()), 'f', -1, 32)\n\tcase v.IsFloat64():\n\t\treturn strconv.FormatFloat(v.Float64(), 'f', -1, 64)\n\tcase v.IsInt():\n\t\treturn strconv.FormatInt(int64(v.Int()), 10)\n\tcase v.IsInt():\n\t\treturn strconv.FormatInt(int64(v.Int()), 10)\n\tcase v.IsInt8():\n\t\treturn strconv.FormatInt(int64(v.Int8()), 10)\n\tcase v.IsInt16():\n\t\treturn strconv.FormatInt(int64(v.Int16()), 10)\n\tcase v.IsInt32():\n\t\treturn strconv.FormatInt(int64(v.Int32()), 10)\n\tcase v.IsInt64():\n\t\treturn strconv.FormatInt(v.Int64(), 10)\n\tcase v.IsUint():\n\t\treturn strconv.FormatUint(uint64(v.Uint()), 10)\n\tcase v.IsUint8():\n\t\treturn strconv.FormatUint(uint64(v.Uint8()), 10)\n\tcase v.IsUint16():\n\t\treturn strconv.FormatUint(uint64(v.Uint16()), 10)\n\tcase v.IsUint32():\n\t\treturn strconv.FormatUint(uint64(v.Uint32()), 10)\n\tcase v.IsUint64():\n\t\treturn strconv.FormatUint(v.Uint64(), 10)\n\t}\n\n\treturn fmt.Sprintf(\"%#v\", v.Data())\n}\n"
},
{
"path": "src/main.go",
"content": "package main\n\nimport (\n\t\"github.com/dolotech/leaf\"\n\t\"server/conf\"\n\t\"server/gate\"\n\t\"server/login\"\n\t\"net/http\"\n\t\"flag\"\n\t\"github.com/golang/glog\"\n\t\"github.com/dolotech/lib/db\"\n\t\"server/model\"\n\t\"server/game\"\n)\n\nvar Commit = \"\"\nvar BUILD_TIME = \"\"\nvar VERSION = \"\"\n\nvar createdb bool\n\nfunc init() {\n\tflag.StringVar(&conf.Server.WSAddr, \"addr\", \":8989\", \"websocket port\")\n\tflag.IntVar(&conf.Server.MaxConnNum, \"maxconn\", 20000, \"Max Conn Num\")\n\tflag.StringVar(&conf.Server.DBUrl, \"pg\", \"postgres://postgres:haosql@127.0.0.1:5432/postgres?sslmode=disable\", \"pg addr\")\n\tflag.BoolVar(&createdb, \"createdb\", false, \"initial database\")\n\n\tflag.Parse()\n\n\tdb.Init(conf.Server.DBUrl)\n\tif createdb {\n\t\tcreateDb()\n\t}\n}\n\nfunc main() {\n\n\tgo leaf.Run(\n\t\tgame.Module,\n\t\tgate.Module,\n\t\tlogin.Module,\n\t)\n\n\t// for test client\n\thttp.Handle(\"/\", http.StripPrefix(\"/\", http.FileServer(http.Dir(\"./\"))))\n\terr := http.ListenAndServe(\":12345\", nil)\n\tif err != nil {\n\t\tglog.Fatalf(\"ListenAndServe: %v \", err)\n\t}\n}\n\nfunc createDb() {\n\t// 建表,只维护和服务器game里面有关的表\n\terr := db.C().Sync(model.User{}, model.Room{})\n\tif err != nil {\n\t\tglog.Errorln(err)\n\t}\n}\n"
},
{
"path": "src/server/algorithm/7462.txt",
"content": "TOTAL FIVE CARDS HAND VALUE POKER HAND\n=====================================================================\n 4 T J Q K A Royal Flush ROYAL FLUSH\n 4 9 T J Q K King High Straight Flush STRAIGHT FLUSH\n 4 8 9 T J Q Queen High Straight Flush\n 4 7 8 9 T J Jack High Straight Flush\n 4 6 7 8 9 T Ten High Straight Flush\n 4 5 6 7 8 9 Nine High Straight Flush\n 4 4 5 6 7 8 Eight High Straight Flush\n 4 3 4 5 6 7 Seven High Straight Flush\n 4 2 3 4 5 6 Six High Straight Flush\n 4 A 2 3 4 5 Five High Straight Flush\n 4 A A A A K Four Aces FOUR OF A KIND\n 4 A A A A Q\n 4 A A A A J\n 4 A A A A T\n 4 A A A A 9\n 4 A A A A 8\n 4 A A A A 7\n 4 A A A A 6\n 4 A A A A 5\n 4 A A A A 4\n 4 A A A A 3\n 4 A A A A 2\n 4 K K K K A Four Kings\n 4 K K K K Q\n 4 K K K K J\n 4 K K K K T\n 4 K K K K 9\n 4 K K K K 8\n 4 K K K K 7\n 4 K K K K 6\n 4 K K K K 5\n 4 K K K K 4\n 4 K K K K 3\n 4 K K K K 2\n 4 Q Q Q Q A Four Queens\n 4 Q Q Q Q K\n 4 Q Q Q Q J\n 4 Q Q Q Q T\n 4 Q Q Q Q 9\n 4 Q Q Q Q 8\n 4 Q Q Q Q 7\n 4 Q Q Q Q 6\n 4 Q Q Q Q 5\n 4 Q Q Q Q 4\n 4 Q Q Q Q 3\n 4 Q Q Q Q 2\n 4 J J J J A Four Jacks\n 4 J J J J K\n 4 J J J J Q\n 4 J J J J T\n 4 J J J J 9\n 4 J J J J 8\n 4 J J J J 7\n 4 J J J J 6\n 4 J J J J 5\n 4 J J J J 4\n 4 J J J J 3\n 4 J J J J 2\n 4 T T T T A Four Tens\n 4 T T T T K\n 4 T T T T Q\n 4 T T T T J\n 4 T T T T 9\n 4 T T T T 8\n 4 T T T T 7\n 4 T T T T 6\n 4 T T T T 5\n 4 T T T T 4\n 4 T T T T 3\n 4 T T T T 2\n 4 9 9 9 9 A Four Nines\n 4 9 9 9 9 K\n 4 9 9 9 9 Q\n 4 9 9 9 9 J\n 4 9 9 9 9 T\n 4 9 9 9 9 8\n 4 9 9 9 9 7\n 4 9 9 9 9 6\n 4 9 9 9 9 5\n 4 9 9 9 9 4\n 4 9 9 9 9 3\n 4 9 9 9 9 2\n 4 8 8 8 8 A Four Eights\n 4 8 8 8 8 K\n 4 8 8 8 8 Q\n 4 8 8 8 8 J\n 4 8 8 8 8 T\n 4 8 8 8 8 9\n 4 8 8 8 8 7\n 4 8 8 8 8 6\n 4 8 8 8 8 5\n 4 8 8 8 8 4\n 4 8 8 8 8 3\n 4 8 8 8 8 2\n 4 7 7 7 7 A Four Sevens\n 4 7 7 7 7 K\n 4 7 7 7 7 Q\n 4 7 7 7 7 J\n 4 7 7 7 7 T\n 4 7 7 7 7 9\n 4 7 7 7 7 8\n 4 7 7 7 7 6\n 4 7 7 7 7 5\n 4 7 7 7 7 4\n 4 7 7 7 7 3\n 4 7 7 7 7 2\n 4 6 6 6 6 A Four Sixes\n 4 6 6 6 6 K\n 4 6 6 6 6 Q\n 4 6 6 6 6 J\n 4 6 6 6 6 T\n 4 6 6 6 6 9\n 4 6 6 6 6 8\n 4 6 6 6 6 7\n 4 6 6 6 6 5\n 4 6 6 6 6 4\n 4 6 6 6 6 3\n 4 6 6 6 6 2\n 4 5 5 5 5 A Four Fives\n 4 5 5 5 5 K\n 4 5 5 5 5 Q\n 4 5 5 5 5 J\n 4 5 5 5 5 T\n 4 5 5 5 5 9\n 4 5 5 5 5 8\n 4 5 5 5 5 7\n 4 5 5 5 5 6\n 4 5 5 5 5 4\n 4 5 5 5 5 3\n 4 5 5 5 5 2\n 4 4 4 4 4 A Four Fours\n 4 4 4 4 4 K\n 4 4 4 4 4 Q\n 4 4 4 4 4 J\n 4 4 4 4 4 T\n 4 4 4 4 4 9\n 4 4 4 4 4 8\n 4 4 4 4 4 7\n 4 4 4 4 4 6\n 4 4 4 4 4 5\n 4 4 4 4 4 3\n 4 4 4 4 4 2\n 4 3 3 3 3 A Four Treys\n 4 3 3 3 3 K\n 4 3 3 3 3 Q\n 4 3 3 3 3 J\n 4 3 3 3 3 T\n 4 3 3 3 3 9\n 4 3 3 3 3 8\n 4 3 3 3 3 7\n 4 3 3 3 3 6\n 4 3 3 3 3 5\n 4 3 3 3 3 4\n 4 3 3 3 3 2\n 4 2 2 2 2 A Four Deuces\n 4 2 2 2 2 K\n 4 2 2 2 2 Q\n 4 2 2 2 2 J\n 4 2 2 2 2 T\n 4 2 2 2 2 9\n 4 2 2 2 2 8\n 4 2 2 2 2 7\n 4 2 2 2 2 6\n 4 2 2 2 2 5\n 4 2 2 2 2 4\n 4 2 2 2 2 3\n 24 A A A K K Aces Full FULL HOUSE\n 24 A A A Q Q\n 24 A A A J J\n 24 A A A T T\n 24 A A A 9 9\n 24 A A A 8 8\n 24 A A A 7 7\n 24 A A A 6 6\n 24 A A A 5 5\n 24 A A A 4 4\n 24 A A A 3 3\n 24 A A A 2 2\n 24 K K K A A Kings Full\n 24 K K K Q Q\n 24 K K K J J\n 24 K K K T T\n 24 K K K 9 9\n 24 K K K 8 8\n 24 K K K 7 7\n 24 K K K 6 6\n 24 K K K 5 5\n 24 K K K 4 4\n 24 K K K 3 3\n 24 K K K 2 2\n 24 Q Q Q A A Queens Full\n 24 Q Q Q K K\n 24 Q Q Q J J\n 24 Q Q Q T T\n 24 Q Q Q 9 9\n 24 Q Q Q 8 8\n 24 Q Q Q 7 7\n 24 Q Q Q 6 6\n 24 Q Q Q 5 5\n 24 Q Q Q 4 4\n 24 Q Q Q 3 3\n 24 Q Q Q 2 2\n 24 J J J A A Jacks Full\n 24 J J J K K\n 24 J J J Q Q\n 24 J J J T T\n 24 J J J 9 9\n 24 J J J 8 8\n 24 J J J 7 7\n 24 J J J 6 6\n 24 J J J 5 5\n 24 J J J 4 4\n 24 J J J 3 3\n 24 J J J 2 2\n 24 T T T A A Tens Full\n 24 T T T K K\n 24 T T T Q Q\n 24 T T T J J\n 24 T T T 9 9\n 24 T T T 8 8\n 24 T T T 7 7\n 24 T T T 6 6\n 24 T T T 5 5\n 24 T T T 4 4\n 24 T T T 3 3\n 24 T T T 2 2\n 24 9 9 9 A A Nines Full\n 24 9 9 9 K K\n 24 9 9 9 Q Q\n 24 9 9 9 J J\n 24 9 9 9 T T\n 24 9 9 9 8 8\n 24 9 9 9 7 7\n 24 9 9 9 6 6\n 24 9 9 9 5 5\n 24 9 9 9 4 4\n 24 9 9 9 3 3\n 24 9 9 9 2 2\n 24 8 8 8 A A Eights Full\n 24 8 8 8 K K\n 24 8 8 8 Q Q\n 24 8 8 8 J J\n 24 8 8 8 T T\n 24 8 8 8 9 9\n 24 8 8 8 7 7\n 24 8 8 8 6 6\n 24 8 8 8 5 5\n 24 8 8 8 4 4\n 24 8 8 8 3 3\n 24 8 8 8 2 2\n 24 7 7 7 A A Sevens Full\n 24 7 7 7 K K\n 24 7 7 7 Q Q\n 24 7 7 7 J J\n 24 7 7 7 T T\n 24 7 7 7 9 9\n 24 7 7 7 8 8\n 24 7 7 7 6 6\n 24 7 7 7 5 5\n 24 7 7 7 4 4\n 24 7 7 7 3 3\n 24 7 7 7 2 2\n 24 6 6 6 A A Sixes Full\n 24 6 6 6 K K\n 24 6 6 6 Q Q\n 24 6 6 6 J J\n 24 6 6 6 T T\n 24 6 6 6 9 9\n 24 6 6 6 8 8\n 24 6 6 6 7 7\n 24 6 6 6 5 5\n 24 6 6 6 4 4\n 24 6 6 6 3 3\n 24 6 6 6 2 2\n 24 5 5 5 A A Fives Full\n 24 5 5 5 K K\n 24 5 5 5 Q Q\n 24 5 5 5 J J\n 24 5 5 5 T T\n 24 5 5 5 9 9\n 24 5 5 5 8 8\n 24 5 5 5 7 7\n 24 5 5 5 6 6\n 24 5 5 5 4 4\n 24 5 5 5 3 3\n 24 5 5 5 2 2\n 24 4 4 4 A A Fours Full\n 24 4 4 4 K K\n 24 4 4 4 Q Q\n 24 4 4 4 J J\n 24 4 4 4 T T\n 24 4 4 4 9 9\n 24 4 4 4 8 8\n 24 4 4 4 7 7\n 24 4 4 4 6 6\n 24 4 4 4 5 5\n 24 4 4 4 3 3\n 24 4 4 4 2 2\n 24 3 3 3 A A Threes Full\n 24 3 3 3 K K\n 24 3 3 3 Q Q\n 24 3 3 3 J J\n 24 3 3 3 T T\n 24 3 3 3 9 9\n 24 3 3 3 8 8\n 24 3 3 3 7 7\n 24 3 3 3 6 6\n 24 3 3 3 5 5\n 24 3 3 3 4 4\n 24 3 3 3 2 2\n 24 2 2 2 A A Deuces Full\n 24 2 2 2 K K\n 24 2 2 2 Q Q\n 24 2 2 2 J J\n 24 2 2 2 T T\n 24 2 2 2 9 9\n 24 2 2 2 8 8\n 24 2 2 2 7 7\n 24 2 2 2 6 6\n 24 2 2 2 5 5\n 24 2 2 2 4 4\n 24 2 2 2 3 3\n 4 9 J Q K A Ace High Flush FLUSH\n 4 8 J Q K A\n 4 7 J Q K A\n 4 6 J Q K A\n 4 5 J Q K A\n 4 4 J Q K A\n 4 3 J Q K A\n 4 2 J Q K A\n 4 9 T Q K A\n 4 8 T Q K A\n 4 7 T Q K A\n 4 6 T Q K A\n 4 5 T Q K A\n 4 4 T Q K A\n 4 3 T Q K A\n 4 2 T Q K A\n 4 8 9 Q K A\n 4 7 9 Q K A\n 4 6 9 Q K A\n 4 5 9 Q K A\n 4 4 9 Q K A\n 4 3 9 Q K A\n 4 2 9 Q K A\n 4 7 8 Q K A\n 4 6 8 Q K A\n 4 5 8 Q K A\n 4 4 8 Q K A\n 4 3 8 Q K A\n 4 2 8 Q K A\n 4 6 7 Q K A\n 4 5 7 Q K A\n 4 4 7 Q K A\n 4 3 7 Q K A\n 4 2 7 Q K A\n 4 5 6 Q K A\n 4 4 6 Q K A\n 4 3 6 Q K A\n 4 2 6 Q K A\n 4 4 5 Q K A\n 4 3 5 Q K A\n 4 2 5 Q K A\n 4 3 4 Q K A\n 4 2 4 Q K A\n 4 2 3 Q K A\n 4 9 T J K A\n 4 8 T J K A\n 4 7 T J K A\n 4 6 T J K A\n 4 5 T J K A\n 4 4 T J K A\n 4 3 T J K A\n 4 2 T J K A\n 4 8 9 J K A\n 4 7 9 J K A\n 4 6 9 J K A\n 4 5 9 J K A\n 4 4 9 J K A\n 4 3 9 J K A\n 4 2 9 J K A\n 4 7 8 J K A\n 4 6 8 J K A\n 4 5 8 J K A\n 4 4 8 J K A\n 4 3 8 J K A\n 4 2 8 J K A\n 4 6 7 J K A\n 4 5 7 J K A\n 4 4 7 J K A\n 4 3 7 J K A\n 4 2 7 J K A\n 4 5 6 J K A\n 4 4 6 J K A\n 4 3 6 J K A\n 4 2 6 J K A\n 4 4 5 J K A\n 4 3 5 J K A\n 4 2 5 J K A\n 4 3 4 J K A\n 4 2 4 J K A\n 4 2 3 J K A\n 4 8 9 T K A\n 4 7 9 T K A\n 4 6 9 T K A\n 4 5 9 T K A\n 4 4 9 T K A\n 4 3 9 T K A\n 4 2 9 T K A\n 4 7 8 T K A\n 4 6 8 T K A\n 4 5 8 T K A\n 4 4 8 T K A\n 4 3 8 T K A\n 4 2 8 T K A\n 4 6 7 T K A\n 4 5 7 T K A\n 4 4 7 T K A\n 4 3 7 T K A\n 4 2 7 T K A\n 4 5 6 T K A\n 4 4 6 T K A\n 4 3 6 T K A\n 4 2 6 T K A\n 4 4 5 T K A\n 4 3 5 T K A\n 4 2 5 T K A\n 4 3 4 T K A\n 4 2 4 T K A\n 4 2 3 T K A\n 4 7 8 9 K A\n 4 6 8 9 K A\n 4 5 8 9 K A\n 4 4 8 9 K A\n 4 3 8 9 K A\n 4 2 8 9 K A\n 4 6 7 9 K A\n 4 5 7 9 K A\n 4 4 7 9 K A\n 4 3 7 9 K A\n 4 2 7 9 K A\n 4 5 6 9 K A\n 4 4 6 9 K A\n 4 3 6 9 K A\n 4 2 6 9 K A\n 4 4 5 9 K A\n 4 3 5 9 K A\n 4 2 5 9 K A\n 4 3 4 9 K A\n 4 2 4 9 K A\n 4 2 3 9 K A\n 4 6 7 8 K A\n 4 5 7 8 K A\n 4 4 7 8 K A\n 4 3 7 8 K A\n 4 2 7 8 K A\n 4 5 6 8 K A\n 4 4 6 8 K A\n 4 3 6 8 K A\n 4 2 6 8 K A\n 4 4 5 8 K A\n 4 3 5 8 K A\n 4 2 5 8 K A\n 4 3 4 8 K A\n 4 2 4 8 K A\n 4 2 3 8 K A\n 4 5 6 7 K A\n 4 4 6 7 K A\n 4 3 6 7 K A\n 4 2 6 7 K A\n 4 4 5 7 K A\n 4 3 5 7 K A\n 4 2 5 7 K A\n 4 3 4 7 K A\n 4 2 4 7 K A\n 4 2 3 7 K A\n 4 4 5 6 K A\n 4 3 5 6 K A\n 4 2 5 6 K A\n 4 3 4 6 K A\n 4 2 4 6 K A\n 4 2 3 6 K A\n 4 3 4 5 K A\n 4 2 4 5 K A\n 4 2 3 5 K A\n 4 2 3 4 K A\n 4 9 T J Q A\n 4 8 T J Q A\n 4 7 T J Q A\n 4 6 T J Q A\n 4 5 T J Q A\n 4 4 T J Q A\n 4 3 T J Q A\n 4 2 T J Q A\n 4 8 9 J Q A\n 4 7 9 J Q A\n 4 6 9 J Q A\n 4 5 9 J Q A\n 4 4 9 J Q A\n 4 3 9 J Q A\n 4 2 9 J Q A\n 4 7 8 J Q A\n 4 6 8 J Q A\n 4 5 8 J Q A\n 4 4 8 J Q A\n 4 3 8 J Q A\n 4 2 8 J Q A\n 4 6 7 J Q A\n 4 5 7 J Q A\n 4 4 7 J Q A\n 4 3 7 J Q A\n 4 2 7 J Q A\n 4 5 6 J Q A\n 4 4 6 J Q A\n 4 3 6 J Q A\n 4 2 6 J Q A\n 4 4 5 J Q A\n 4 3 5 J Q A\n 4 2 5 J Q A\n 4 3 4 J Q A\n 4 2 4 J Q A\n 4 2 3 J Q A\n 4 8 9 T Q A\n 4 7 9 T Q A\n 4 6 9 T Q A\n 4 5 9 T Q A\n 4 4 9 T Q A\n 4 3 9 T Q A\n 4 2 9 T Q A\n 4 7 8 T Q A\n 4 6 8 T Q A\n 4 5 8 T Q A\n 4 4 8 T Q A\n 4 3 8 T Q A\n 4 2 8 T Q A\n 4 6 7 T Q A\n 4 5 7 T Q A\n 4 4 7 T Q A\n 4 3 7 T Q A\n 4 2 7 T Q A\n 4 5 6 T Q A\n 4 4 6 T Q A\n 4 3 6 T Q A\n 4 2 6 T Q A\n 4 4 5 T Q A\n 4 3 5 T Q A\n 4 2 5 T Q A\n 4 3 4 T Q A\n 4 2 4 T Q A\n 4 2 3 T Q A\n 4 7 8 9 Q A\n 4 6 8 9 Q A\n 4 5 8 9 Q A\n 4 4 8 9 Q A\n 4 3 8 9 Q A\n 4 2 8 9 Q A\n 4 6 7 9 Q A\n 4 5 7 9 Q A\n 4 4 7 9 Q A\n 4 3 7 9 Q A\n 4 2 7 9 Q A\n 4 5 6 9 Q A\n 4 4 6 9 Q A\n 4 3 6 9 Q A\n 4 2 6 9 Q A\n 4 4 5 9 Q A\n 4 3 5 9 Q A\n 4 2 5 9 Q A\n 4 3 4 9 Q A\n 4 2 4 9 Q A\n 4 2 3 9 Q A\n 4 6 7 8 Q A\n 4 5 7 8 Q A\n 4 4 7 8 Q A\n 4 3 7 8 Q A\n 4 2 7 8 Q A\n 4 5 6 8 Q A\n 4 4 6 8 Q A\n 4 3 6 8 Q A\n 4 2 6 8 Q A\n 4 4 5 8 Q A\n 4 3 5 8 Q A\n 4 2 5 8 Q A\n 4 3 4 8 Q A\n 4 2 4 8 Q A\n 4 2 3 8 Q A\n 4 5 6 7 Q A\n 4 4 6 7 Q A\n 4 3 6 7 Q A\n 4 2 6 7 Q A\n 4 4 5 7 Q A\n 4 3 5 7 Q A\n 4 2 5 7 Q A\n 4 3 4 7 Q A\n 4 2 4 7 Q A\n 4 2 3 7 Q A\n 4 4 5 6 Q A\n 4 3 5 6 Q A\n 4 2 5 6 Q A\n 4 3 4 6 Q A\n 4 2 4 6 Q A\n 4 2 3 6 Q A\n 4 3 4 5 Q A\n 4 2 4 5 Q A\n 4 2 3 5 Q A\n 4 2 3 4 Q A\n 4 8 9 T J A\n 4 7 9 T J A\n 4 6 9 T J A\n 4 5 9 T J A\n 4 4 9 T J A\n 4 3 9 T J A\n 4 2 9 T J A\n 4 7 8 T J A\n 4 6 8 T J A\n 4 5 8 T J A\n 4 4 8 T J A\n 4 3 8 T J A\n 4 2 8 T J A\n 4 6 7 T J A\n 4 5 7 T J A\n 4 4 7 T J A\n 4 3 7 T J A\n 4 2 7 T J A\n 4 5 6 T J A\n 4 4 6 T J A\n 4 3 6 T J A\n 4 2 6 T J A\n 4 4 5 T J A\n 4 3 5 T J A\n 4 2 5 T J A\n 4 3 4 T J A\n 4 2 4 T J A\n 4 2 3 T J A\n 4 7 8 9 J A\n 4 6 8 9 J A\n 4 5 8 9 J A\n 4 4 8 9 J A\n 4 3 8 9 J A\n 4 2 8 9 J A\n 4 6 7 9 J A\n 4 5 7 9 J A\n 4 4 7 9 J A\n 4 3 7 9 J A\n 4 2 7 9 J A\n 4 5 6 9 J A\n 4 4 6 9 J A\n 4 3 6 9 J A\n 4 2 6 9 J A\n 4 4 5 9 J A\n 4 3 5 9 J A\n 4 2 5 9 J A\n 4 3 4 9 J A\n 4 2 4 9 J A\n 4 2 3 9 J A\n 4 6 7 8 J A\n 4 5 7 8 J A\n 4 4 7 8 J A\n 4 3 7 8 J A\n 4 2 7 8 J A\n 4 5 6 8 J A\n 4 4 6 8 J A\n 4 3 6 8 J A\n 4 2 6 8 J A\n 4 4 5 8 J A\n 4 3 5 8 J A\n 4 2 5 8 J A\n 4 3 4 8 J A\n 4 2 4 8 J A\n 4 2 3 8 J A\n 4 5 6 7 J A\n 4 4 6 7 J A\n 4 3 6 7 J A\n 4 2 6 7 J A\n 4 4 5 7 J A\n 4 3 5 7 J A\n 4 2 5 7 J A\n 4 3 4 7 J A\n 4 2 4 7 J A\n 4 2 3 7 J A\n 4 4 5 6 J A\n 4 3 5 6 J A\n 4 2 5 6 J A\n 4 3 4 6 J A\n 4 2 4 6 J A\n 4 2 3 6 J A\n 4 3 4 5 J A\n 4 2 4 5 J A\n 4 2 3 5 J A\n 4 2 3 4 J A\n 4 7 8 9 T A\n 4 6 8 9 T A\n 4 5 8 9 T A\n 4 4 8 9 T A\n 4 3 8 9 T A\n 4 2 8 9 T A\n 4 6 7 9 T A\n 4 5 7 9 T A\n 4 4 7 9 T A\n 4 3 7 9 T A\n 4 2 7 9 T A\n 4 5 6 9 T A\n 4 4 6 9 T A\n 4 3 6 9 T A\n 4 2 6 9 T A\n 4 4 5 9 T A\n 4 3 5 9 T A\n 4 2 5 9 T A\n 4 3 4 9 T A\n 4 2 4 9 T A\n 4 2 3 9 T A\n 4 6 7 8 T A\n 4 5 7 8 T A\n 4 4 7 8 T A\n 4 3 7 8 T A\n 4 2 7 8 T A\n 4 5 6 8 T A\n 4 4 6 8 T A\n 4 3 6 8 T A\n 4 2 6 8 T A\n 4 4 5 8 T A\n 4 3 5 8 T A\n 4 2 5 8 T A\n 4 3 4 8 T A\n 4 2 4 8 T A\n 4 2 3 8 T A\n 4 5 6 7 T A\n 4 4 6 7 T A\n 4 3 6 7 T A\n 4 2 6 7 T A\n 4 4 5 7 T A\n 4 3 5 7 T A\n 4 2 5 7 T A\n 4 3 4 7 T A\n 4 2 4 7 T A\n 4 2 3 7 T A\n 4 4 5 6 T A\n 4 3 5 6 T A\n 4 2 5 6 T A\n 4 3 4 6 T A\n 4 2 4 6 T A\n 4 2 3 6 T A\n 4 3 4 5 T A\n 4 2 4 5 T A\n 4 2 3 5 T A\n 4 2 3 4 T A\n 4 6 7 8 9 A\n 4 5 7 8 9 A\n 4 4 7 8 9 A\n 4 3 7 8 9 A\n 4 2 7 8 9 A\n 4 5 6 8 9 A\n 4 4 6 8 9 A\n 4 3 6 8 9 A\n 4 2 6 8 9 A\n 4 4 5 8 9 A\n 4 3 5 8 9 A\n 4 2 5 8 9 A\n 4 3 4 8 9 A\n 4 2 4 8 9 A\n 4 2 3 8 9 A\n 4 5 6 7 9 A\n 4 4 6 7 9 A\n 4 3 6 7 9 A\n 4 2 6 7 9 A\n 4 4 5 7 9 A\n 4 3 5 7 9 A\n 4 2 5 7 9 A\n 4 3 4 7 9 A\n 4 2 4 7 9 A\n 4 2 3 7 9 A\n 4 4 5 6 9 A\n 4 3 5 6 9 A\n 4 2 5 6 9 A\n 4 3 4 6 9 A\n 4 2 4 6 9 A\n 4 2 3 6 9 A\n 4 3 4 5 9 A\n 4 2 4 5 9 A\n 4 2 3 5 9 A\n 4 2 3 4 9 A\n 4 5 6 7 8 A\n 4 4 6 7 8 A\n 4 3 6 7 8 A\n 4 2 6 7 8 A\n 4 4 5 7 8 A\n 4 3 5 7 8 A\n 4 2 5 7 8 A\n 4 3 4 7 8 A\n 4 2 4 7 8 A\n 4 2 3 7 8 A\n 4 4 5 6 8 A\n 4 3 5 6 8 A\n 4 2 5 6 8 A\n 4 3 4 6 8 A\n 4 2 4 6 8 A\n 4 2 3 6 8 A\n 4 3 4 5 8 A\n 4 2 4 5 8 A\n 4 2 3 5 8 A\n 4 2 3 4 8 A\n 4 4 5 6 7 A\n 4 3 5 6 7 A\n 4 2 5 6 7 A\n 4 3 4 6 7 A\n 4 2 4 6 7 A\n 4 2 3 6 7 A\n 4 3 4 5 7 A\n 4 2 4 5 7 A\n 4 2 3 5 7 A\n 4 2 3 4 7 A\n 4 3 4 5 6 A\n 4 2 4 5 6 A\n 4 2 3 5 6 A\n 4 2 3 4 6 A\n 4 8 T J Q K King High Flush\n 4 7 T J Q K\n 4 6 T J Q K\n 4 5 T J Q K\n 4 4 T J Q K\n 4 3 T J Q K\n 4 2 T J Q K\n 4 8 9 J Q K\n 4 7 9 J Q K\n 4 6 9 J Q K\n 4 5 9 J Q K\n 4 4 9 J Q K\n 4 3 9 J Q K\n 4 2 9 J Q K\n 4 7 8 J Q K\n 4 6 8 J Q K\n 4 5 8 J Q K\n 4 4 8 J Q K\n 4 3 8 J Q K\n 4 2 8 J Q K\n 4 6 7 J Q K\n 4 5 7 J Q K\n 4 4 7 J Q K\n 4 3 7 J Q K\n 4 2 7 J Q K\n 4 5 6 J Q K\n 4 4 6 J Q K\n 4 3 6 J Q K\n 4 2 6 J Q K\n 4 4 5 J Q K\n 4 3 5 J Q K\n 4 2 5 J Q K\n 4 3 4 J Q K\n 4 2 4 J Q K\n 4 2 3 J Q K\n 4 8 9 T Q K\n 4 7 9 T Q K\n 4 6 9 T Q K\n 4 5 9 T Q K\n 4 4 9 T Q K\n 4 3 9 T Q K\n 4 2 9 T Q K\n 4 7 8 T Q K\n 4 6 8 T Q K\n 4 5 8 T Q K\n 4 4 8 T Q K\n 4 3 8 T Q K\n 4 2 8 T Q K\n 4 6 7 T Q K\n 4 5 7 T Q K\n 4 4 7 T Q K\n 4 3 7 T Q K\n 4 2 7 T Q K\n 4 5 6 T Q K\n 4 4 6 T Q K\n 4 3 6 T Q K\n 4 2 6 T Q K\n 4 4 5 T Q K\n 4 3 5 T Q K\n 4 2 5 T Q K\n 4 3 4 T Q K\n 4 2 4 T Q K\n 4 2 3 T Q K\n 4 7 8 9 Q K\n 4 6 8 9 Q K\n 4 5 8 9 Q K\n 4 4 8 9 Q K\n 4 3 8 9 Q K\n 4 2 8 9 Q K\n 4 6 7 9 Q K\n 4 5 7 9 Q K\n 4 4 7 9 Q K\n 4 3 7 9 Q K\n 4 2 7 9 Q K\n 4 5 6 9 Q K\n 4 4 6 9 Q K\n 4 3 6 9 Q K\n 4 2 6 9 Q K\n 4 4 5 9 Q K\n 4 3 5 9 Q K\n 4 2 5 9 Q K\n 4 3 4 9 Q K\n 4 2 4 9 Q K\n 4 2 3 9 Q K\n 4 6 7 8 Q K\n 4 5 7 8 Q K\n 4 4 7 8 Q K\n 4 3 7 8 Q K\n 4 2 7 8 Q K\n 4 5 6 8 Q K\n 4 4 6 8 Q K\n 4 3 6 8 Q K\n 4 2 6 8 Q K\n 4 4 5 8 Q K\n 4 3 5 8 Q K\n 4 2 5 8 Q K\n 4 3 4 8 Q K\n 4 2 4 8 Q K\n 4 2 3 8 Q K\n 4 5 6 7 Q K\n 4 4 6 7 Q K\n 4 3 6 7 Q K\n 4 2 6 7 Q K\n 4 4 5 7 Q K\n 4 3 5 7 Q K\n 4 2 5 7 Q K\n 4 3 4 7 Q K\n 4 2 4 7 Q K\n 4 2 3 7 Q K\n 4 4 5 6 Q K\n 4 3 5 6 Q K\n 4 2 5 6 Q K\n 4 3 4 6 Q K\n 4 2 4 6 Q K\n 4 2 3 6 Q K\n 4 3 4 5 Q K\n 4 2 4 5 Q K\n 4 2 3 5 Q K\n 4 2 3 4 Q K\n 4 8 9 T J K\n 4 7 9 T J K\n 4 6 9 T J K\n 4 5 9 T J K\n 4 4 9 T J K\n 4 3 9 T J K\n 4 2 9 T J K\n 4 7 8 T J K\n 4 6 8 T J K\n 4 5 8 T J K\n 4 4 8 T J K\n 4 3 8 T J K\n 4 2 8 T J K\n 4 6 7 T J K\n 4 5 7 T J K\n 4 4 7 T J K\n 4 3 7 T J K\n 4 2 7 T J K\n 4 5 6 T J K\n 4 4 6 T J K\n 4 3 6 T J K\n 4 2 6 T J K\n 4 4 5 T J K\n 4 3 5 T J K\n 4 2 5 T J K\n 4 3 4 T J K\n 4 2 4 T J K\n 4 2 3 T J K\n 4 7 8 9 J K\n 4 6 8 9 J K\n 4 5 8 9 J K\n 4 4 8 9 J K\n 4 3 8 9 J K\n 4 2 8 9 J K\n 4 6 7 9 J K\n 4 5 7 9 J K\n 4 4 7 9 J K\n 4 3 7 9 J K\n 4 2 7 9 J K\n 4 5 6 9 J K\n 4 4 6 9 J K\n 4 3 6 9 J K\n 4 2 6 9 J K\n 4 4 5 9 J K\n 4 3 5 9 J K\n 4 2 5 9 J K\n 4 3 4 9 J K\n 4 2 4 9 J K\n 4 2 3 9 J K\n 4 6 7 8 J K\n 4 5 7 8 J K\n 4 4 7 8 J K\n 4 3 7 8 J K\n 4 2 7 8 J K\n 4 5 6 8 J K\n 4 4 6 8 J K\n 4 3 6 8 J K\n 4 2 6 8 J K\n 4 4 5 8 J K\n 4 3 5 8 J K\n 4 2 5 8 J K\n 4 3 4 8 J K\n 4 2 4 8 J K\n 4 2 3 8 J K\n 4 5 6 7 J K\n 4 4 6 7 J K\n 4 3 6 7 J K\n 4 2 6 7 J K\n 4 4 5 7 J K\n 4 3 5 7 J K\n 4 2 5 7 J K\n 4 3 4 7 J K\n 4 2 4 7 J K\n 4 2 3 7 J K\n 4 4 5 6 J K\n 4 3 5 6 J K\n 4 2 5 6 J K\n 4 3 4 6 J K\n 4 2 4 6 J K\n 4 2 3 6 J K\n 4 3 4 5 J K\n 4 2 4 5 J K\n 4 2 3 5 J K\n 4 2 3 4 J K\n 4 7 8 9 T K\n 4 6 8 9 T K\n 4 5 8 9 T K\n 4 4 8 9 T K\n 4 3 8 9 T K\n 4 2 8 9 T K\n 4 6 7 9 T K\n 4 5 7 9 T K\n 4 4 7 9 T K\n 4 3 7 9 T K\n 4 2 7 9 T K\n 4 5 6 9 T K\n 4 4 6 9 T K\n 4 3 6 9 T K\n 4 2 6 9 T K\n 4 4 5 9 T K\n 4 3 5 9 T K\n 4 2 5 9 T K\n 4 3 4 9 T K\n 4 2 4 9 T K\n 4 2 3 9 T K\n 4 6 7 8 T K\n 4 5 7 8 T K\n 4 4 7 8 T K\n 4 3 7 8 T K\n 4 2 7 8 T K\n 4 5 6 8 T K\n 4 4 6 8 T K\n 4 3 6 8 T K\n 4 2 6 8 T K\n 4 4 5 8 T K\n 4 3 5 8 T K\n 4 2 5 8 T K\n 4 3 4 8 T K\n 4 2 4 8 T K\n 4 2 3 8 T K\n 4 5 6 7 T K\n 4 4 6 7 T K\n 4 3 6 7 T K\n 4 2 6 7 T K\n 4 4 5 7 T K\n 4 3 5 7 T K\n 4 2 5 7 T K\n 4 3 4 7 T K\n 4 2 4 7 T K\n 4 2 3 7 T K\n 4 4 5 6 T K\n 4 3 5 6 T K\n 4 2 5 6 T K\n 4 3 4 6 T K\n 4 2 4 6 T K\n 4 2 3 6 T K\n 4 3 4 5 T K\n 4 2 4 5 T K\n 4 2 3 5 T K\n 4 2 3 4 T K\n 4 6 7 8 9 K\n 4 5 7 8 9 K\n 4 4 7 8 9 K\n 4 3 7 8 9 K\n 4 2 7 8 9 K\n 4 5 6 8 9 K\n 4 4 6 8 9 K\n 4 3 6 8 9 K\n 4 2 6 8 9 K\n 4 4 5 8 9 K\n 4 3 5 8 9 K\n 4 2 5 8 9 K\n 4 3 4 8 9 K\n 4 2 4 8 9 K\n 4 2 3 8 9 K\n 4 5 6 7 9 K\n 4 4 6 7 9 K\n 4 3 6 7 9 K\n 4 2 6 7 9 K\n 4 4 5 7 9 K\n 4 3 5 7 9 K\n 4 2 5 7 9 K\n 4 3 4 7 9 K\n 4 2 4 7 9 K\n 4 2 3 7 9 K\n 4 4 5 6 9 K\n 4 3 5 6 9 K\n 4 2 5 6 9 K\n 4 3 4 6 9 K\n 4 2 4 6 9 K\n 4 2 3 6 9 K\n 4 3 4 5 9 K\n 4 2 4 5 9 K\n 4 2 3 5 9 K\n 4 2 3 4 9 K\n 4 5 6 7 8 K\n 4 4 6 7 8 K\n 4 3 6 7 8 K\n 4 2 6 7 8 K\n 4 4 5 7 8 K\n 4 3 5 7 8 K\n 4 2 5 7 8 K\n 4 3 4 7 8 K\n 4 2 4 7 8 K\n 4 2 3 7 8 K\n 4 4 5 6 8 K\n 4 3 5 6 8 K\n 4 2 5 6 8 K\n 4 3 4 6 8 K\n 4 2 4 6 8 K\n 4 2 3 6 8 K\n 4 3 4 5 8 K\n 4 2 4 5 8 K\n 4 2 3 5 8 K\n 4 2 3 4 8 K\n 4 4 5 6 7 K\n 4 3 5 6 7 K\n 4 2 5 6 7 K\n 4 3 4 6 7 K\n 4 2 4 6 7 K\n 4 2 3 6 7 K\n 4 3 4 5 7 K\n 4 2 4 5 7 K\n 4 2 3 5 7 K\n 4 2 3 4 7 K\n 4 3 4 5 6 K\n 4 2 4 5 6 K\n 4 2 3 5 6 K\n 4 2 3 4 6 K\n 4 2 3 4 5 K\n 4 7 9 T J Q Queen High Flush\n 4 6 9 T J Q\n 4 5 9 T J Q\n 4 4 9 T J Q\n 4 3 9 T J Q\n 4 2 9 T J Q\n 4 7 8 T J Q\n 4 6 8 T J Q\n 4 5 8 T J Q\n 4 4 8 T J Q\n 4 3 8 T J Q\n 4 2 8 T J Q\n 4 6 7 T J Q\n 4 5 7 T J Q\n 4 4 7 T J Q\n 4 3 7 T J Q\n 4 2 7 T J Q\n 4 5 6 T J Q\n 4 4 6 T J Q\n 4 3 6 T J Q\n 4 2 6 T J Q\n 4 4 5 T J Q\n 4 3 5 T J Q\n 4 2 5 T J Q\n 4 3 4 T J Q\n 4 2 4 T J Q\n 4 2 3 T J Q\n 4 7 8 9 J Q\n 4 6 8 9 J Q\n 4 5 8 9 J Q\n 4 4 8 9 J Q\n 4 3 8 9 J Q\n 4 2 8 9 J Q\n 4 6 7 9 J Q\n 4 5 7 9 J Q\n 4 4 7 9 J Q\n 4 3 7 9 J Q\n 4 2 7 9 J Q\n 4 5 6 9 J Q\n 4 4 6 9 J Q\n 4 3 6 9 J Q\n 4 2 6 9 J Q\n 4 4 5 9 J Q\n 4 3 5 9 J Q\n 4 2 5 9 J Q\n 4 3 4 9 J Q\n 4 2 4 9 J Q\n 4 2 3 9 J Q\n 4 6 7 8 J Q\n 4 5 7 8 J Q\n 4 4 7 8 J Q\n 4 3 7 8 J Q\n 4 2 7 8 J Q\n 4 5 6 8 J Q\n 4 4 6 8 J Q\n 4 3 6 8 J Q\n 4 2 6 8 J Q\n 4 4 5 8 J Q\n 4 3 5 8 J Q\n 4 2 5 8 J Q\n 4 3 4 8 J Q\n 4 2 4 8 J Q\n 4 2 3 8 J Q\n 4 5 6 7 J Q\n 4 4 6 7 J Q\n 4 3 6 7 J Q\n 4 2 6 7 J Q\n 4 4 5 7 J Q\n 4 3 5 7 J Q\n 4 2 5 7 J Q\n 4 3 4 7 J Q\n 4 2 4 7 J Q\n 4 2 3 7 J Q\n 4 4 5 6 J Q\n 4 3 5 6 J Q\n 4 2 5 6 J Q\n 4 3 4 6 J Q\n 4 2 4 6 J Q\n 4 2 3 6 J Q\n 4 3 4 5 J Q\n 4 2 4 5 J Q\n 4 2 3 5 J Q\n 4 2 3 4 J Q\n 4 7 8 9 T Q\n 4 6 8 9 T Q\n 4 5 8 9 T Q\n 4 4 8 9 T Q\n 4 3 8 9 T Q\n 4 2 8 9 T Q\n 4 6 7 9 T Q\n 4 5 7 9 T Q\n 4 4 7 9 T Q\n 4 3 7 9 T Q\n 4 2 7 9 T Q\n 4 5 6 9 T Q\n 4 4 6 9 T Q\n 4 3 6 9 T Q\n 4 2 6 9 T Q\n 4 4 5 9 T Q\n 4 3 5 9 T Q\n 4 2 5 9 T Q\n 4 3 4 9 T Q\n 4 2 4 9 T Q\n 4 2 3 9 T Q\n 4 6 7 8 T Q\n 4 5 7 8 T Q\n 4 4 7 8 T Q\n 4 3 7 8 T Q\n 4 2 7 8 T Q\n 4 5 6 8 T Q\n 4 4 6 8 T Q\n 4 3 6 8 T Q\n 4 2 6 8 T Q\n 4 4 5 8 T Q\n 4 3 5 8 T Q\n 4 2 5 8 T Q\n 4 3 4 8 T Q\n 4 2 4 8 T Q\n 4 2 3 8 T Q\n 4 5 6 7 T Q\n 4 4 6 7 T Q\n 4 3 6 7 T Q\n 4 2 6 7 T Q\n 4 4 5 7 T Q\n 4 3 5 7 T Q\n 4 2 5 7 T Q\n 4 3 4 7 T Q\n 4 2 4 7 T Q\n 4 2 3 7 T Q\n 4 4 5 6 T Q\n 4 3 5 6 T Q\n 4 2 5 6 T Q\n 4 3 4 6 T Q\n 4 2 4 6 T Q\n 4 2 3 6 T Q\n 4 3 4 5 T Q\n 4 2 4 5 T Q\n 4 2 3 5 T Q\n 4 2 3 4 T Q\n 4 6 7 8 9 Q\n 4 5 7 8 9 Q\n 4 4 7 8 9 Q\n 4 3 7 8 9 Q\n 4 2 7 8 9 Q\n 4 5 6 8 9 Q\n 4 4 6 8 9 Q\n 4 3 6 8 9 Q\n 4 2 6 8 9 Q\n 4 4 5 8 9 Q\n 4 3 5 8 9 Q\n 4 2 5 8 9 Q\n 4 3 4 8 9 Q\n 4 2 4 8 9 Q\n 4 2 3 8 9 Q\n 4 5 6 7 9 Q\n 4 4 6 7 9 Q\n 4 3 6 7 9 Q\n 4 2 6 7 9 Q\n 4 4 5 7 9 Q\n 4 3 5 7 9 Q\n 4 2 5 7 9 Q\n 4 3 4 7 9 Q\n 4 2 4 7 9 Q\n 4 2 3 7 9 Q\n 4 4 5 6 9 Q\n 4 3 5 6 9 Q\n 4 2 5 6 9 Q\n 4 3 4 6 9 Q\n 4 2 4 6 9 Q\n 4 2 3 6 9 Q\n 4 3 4 5 9 Q\n 4 2 4 5 9 Q\n 4 2 3 5 9 Q\n 4 2 3 4 9 Q\n 4 5 6 7 8 Q\n 4 4 6 7 8 Q\n 4 3 6 7 8 Q\n 4 2 6 7 8 Q\n 4 4 5 7 8 Q\n 4 3 5 7 8 Q\n 4 2 5 7 8 Q\n 4 3 4 7 8 Q\n 4 2 4 7 8 Q\n 4 2 3 7 8 Q\n 4 4 5 6 8 Q\n 4 3 5 6 8 Q\n 4 2 5 6 8 Q\n 4 3 4 6 8 Q\n 4 2 4 6 8 Q\n 4 2 3 6 8 Q\n 4 3 4 5 8 Q\n 4 2 4 5 8 Q\n 4 2 3 5 8 Q\n 4 2 3 4 8 Q\n 4 4 5 6 7 Q\n 4 3 5 6 7 Q\n 4 2 5 6 7 Q\n 4 3 4 6 7 Q\n 4 2 4 6 7 Q\n 4 2 3 6 7 Q\n 4 3 4 5 7 Q\n 4 2 4 5 7 Q\n 4 2 3 5 7 Q\n 4 2 3 4 7 Q\n 4 3 4 5 6 Q\n 4 2 4 5 6 Q\n 4 2 3 5 6 Q\n 4 2 3 4 6 Q\n 4 2 3 4 5 Q\n 4 6 8 9 T J Jack High Flush\n 4 5 8 9 T J\n 4 4 8 9 T J\n 4 3 8 9 T J\n 4 2 8 9 T J\n 4 6 7 9 T J\n 4 5 7 9 T J\n 4 4 7 9 T J\n 4 3 7 9 T J\n 4 2 7 9 T J\n 4 5 6 9 T J\n 4 4 6 9 T J\n 4 3 6 9 T J\n 4 2 6 9 T J\n 4 4 5 9 T J\n 4 3 5 9 T J\n 4 2 5 9 T J\n 4 3 4 9 T J\n 4 2 4 9 T J\n 4 2 3 9 T J\n 4 6 7 8 T J\n 4 5 7 8 T J\n 4 4 7 8 T J\n 4 3 7 8 T J\n 4 2 7 8 T J\n 4 5 6 8 T J\n 4 4 6 8 T J\n 4 3 6 8 T J\n 4 2 6 8 T J\n 4 4 5 8 T J\n 4 3 5 8 T J\n 4 2 5 8 T J\n 4 3 4 8 T J\n 4 2 4 8 T J\n 4 2 3 8 T J\n 4 5 6 7 T J\n 4 4 6 7 T J\n 4 3 6 7 T J\n 4 2 6 7 T J\n 4 4 5 7 T J\n 4 3 5 7 T J\n 4 2 5 7 T J\n 4 3 4 7 T J\n 4 2 4 7 T J\n 4 2 3 7 T J\n 4 4 5 6 T J\n 4 3 5 6 T J\n 4 2 5 6 T J\n 4 3 4 6 T J\n 4 2 4 6 T J\n 4 2 3 6 T J\n 4 3 4 5 T J\n 4 2 4 5 T J\n 4 2 3 5 T J\n 4 2 3 4 T J\n 4 6 7 8 9 J\n 4 5 7 8 9 J\n 4 4 7 8 9 J\n 4 3 7 8 9 J\n 4 2 7 8 9 J\n 4 5 6 8 9 J\n 4 4 6 8 9 J\n 4 3 6 8 9 J\n 4 2 6 8 9 J\n 4 4 5 8 9 J\n 4 3 5 8 9 J\n 4 2 5 8 9 J\n 4 3 4 8 9 J\n 4 2 4 8 9 J\n 4 2 3 8 9 J\n 4 5 6 7 9 J\n 4 4 6 7 9 J\n 4 3 6 7 9 J\n 4 2 6 7 9 J\n 4 4 5 7 9 J\n 4 3 5 7 9 J\n 4 2 5 7 9 J\n 4 3 4 7 9 J\n 4 2 4 7 9 J\n 4 2 3 7 9 J\n 4 4 5 6 9 J\n 4 3 5 6 9 J\n 4 2 5 6 9 J\n 4 3 4 6 9 J\n 4 2 4 6 9 J\n 4 2 3 6 9 J\n 4 3 4 5 9 J\n 4 2 4 5 9 J\n 4 2 3 5 9 J\n 4 2 3 4 9 J\n 4 5 6 7 8 J\n 4 4 6 7 8 J\n 4 3 6 7 8 J\n 4 2 6 7 8 J\n 4 4 5 7 8 J\n 4 3 5 7 8 J\n 4 2 5 7 8 J\n 4 3 4 7 8 J\n 4 2 4 7 8 J\n 4 2 3 7 8 J\n 4 4 5 6 8 J\n 4 3 5 6 8 J\n 4 2 5 6 8 J\n 4 3 4 6 8 J\n 4 2 4 6 8 J\n 4 2 3 6 8 J\n 4 3 4 5 8 J\n 4 2 4 5 8 J\n 4 2 3 5 8 J\n 4 2 3 4 8 J\n 4 4 5 6 7 J\n 4 3 5 6 7 J\n 4 2 5 6 7 J\n 4 3 4 6 7 J\n 4 2 4 6 7 J\n 4 2 3 6 7 J\n 4 3 4 5 7 J\n 4 2 4 5 7 J\n 4 2 3 5 7 J\n 4 2 3 4 7 J\n 4 3 4 5 6 J\n 4 2 4 5 6 J\n 4 2 3 5 6 J\n 4 2 3 4 6 J\n 4 2 3 4 5 J\n 4 5 7 8 9 T Ten High Flush\n 4 4 7 8 9 T\n 4 3 7 8 9 T\n 4 2 7 8 9 T\n 4 5 6 8 9 T\n 4 4 6 8 9 T\n 4 3 6 8 9 T\n 4 2 6 8 9 T\n 4 4 5 8 9 T\n 4 3 5 8 9 T\n 4 2 5 8 9 T\n 4 3 4 8 9 T\n 4 2 4 8 9 T\n 4 2 3 8 9 T\n 4 5 6 7 9 T\n 4 4 6 7 9 T\n 4 3 6 7 9 T\n 4 2 6 7 9 T\n 4 4 5 7 9 T\n 4 3 5 7 9 T\n 4 2 5 7 9 T\n 4 3 4 7 9 T\n 4 2 4 7 9 T\n 4 2 3 7 9 T\n 4 4 5 6 9 T\n 4 3 5 6 9 T\n 4 2 5 6 9 T\n 4 3 4 6 9 T\n 4 2 4 6 9 T\n 4 2 3 6 9 T\n 4 3 4 5 9 T\n 4 2 4 5 9 T\n 4 2 3 5 9 T\n 4 2 3 4 9 T\n 4 5 6 7 8 T\n 4 4 6 7 8 T\n 4 3 6 7 8 T\n 4 2 6 7 8 T\n 4 4 5 7 8 T\n 4 3 5 7 8 T\n 4 2 5 7 8 T\n 4 3 4 7 8 T\n 4 2 4 7 8 T\n 4 2 3 7 8 T\n 4 4 5 6 8 T\n 4 3 5 6 8 T\n 4 2 5 6 8 T\n 4 3 4 6 8 T\n 4 2 4 6 8 T\n 4 2 3 6 8 T\n 4 3 4 5 8 T\n 4 2 4 5 8 T\n 4 2 3 5 8 T\n 4 2 3 4 8 T\n 4 4 5 6 7 T\n 4 3 5 6 7 T\n 4 2 5 6 7 T\n 4 3 4 6 7 T\n 4 2 4 6 7 T\n 4 2 3 6 7 T\n 4 3 4 5 7 T\n 4 2 4 5 7 T\n 4 2 3 5 7 T\n 4 2 3 4 7 T\n 4 3 4 5 6 T\n 4 2 4 5 6 T\n 4 2 3 5 6 T\n 4 2 3 4 6 T\n 4 2 3 4 5 T\n 4 4 6 7 8 9 Nine High Flush\n 4 3 6 7 8 9\n 4 2 6 7 8 9\n 4 4 5 7 8 9\n 4 3 5 7 8 9\n 4 2 5 7 8 9\n 4 3 4 7 8 9\n 4 2 4 7 8 9\n 4 2 3 7 8 9\n 4 4 5 6 8 9\n 4 3 5 6 8 9\n 4 2 5 6 8 9\n 4 3 4 6 8 9\n 4 2 4 6 8 9\n 4 2 3 6 8 9\n 4 3 4 5 8 9\n 4 2 4 5 8 9\n 4 2 3 5 8 9\n 4 2 3 4 8 9\n 4 4 5 6 7 9\n 4 3 5 6 7 9\n 4 2 5 6 7 9\n 4 3 4 6 7 9\n 4 2 4 6 7 9\n 4 2 3 6 7 9\n 4 3 4 5 7 9\n 4 2 4 5 7 9\n 4 2 3 5 7 9\n 4 2 3 4 7 9\n 4 3 4 5 6 9\n 4 2 4 5 6 9\n 4 2 3 5 6 9\n 4 2 3 4 6 9\n 4 2 3 4 5 9\n 4 3 5 6 7 8 Eight High Flush\n 4 2 5 6 7 8\n 4 3 4 6 7 8\n 4 2 4 6 7 8\n 4 2 3 6 7 8\n 4 3 4 5 7 8\n 4 2 4 5 7 8\n 4 2 3 5 7 8\n 4 2 3 4 7 8\n 4 3 4 5 6 8\n 4 2 4 5 6 8\n 4 2 3 5 6 8\n 4 2 3 4 6 8\n 4 2 3 4 5 8\n 4 2 4 5 6 7 Seven High Flush\n 4 2 3 5 6 7\n 4 2 3 4 6 7\n 4 2 3 4 5 7\n1024 T J Q K A Ace High Straight STRAIGHT\n1024 9 T J Q K King High Straight\n1024 8 9 T J Q Queen High Straight\n1024 7 8 9 T J Jack High Straight\n1024 6 7 8 9 T Ten High Straight\n1024 5 6 7 8 9 Nine High Straight\n1024 4 5 6 7 8 Eight High Straight\n1024 3 4 5 6 7 Seven High Straight\n1024 2 3 4 5 6 Six High Straight\n1024 A 2 3 4 5 Five High Straight\n 64 Q K A A A Three Aces THREE OF A KIND\n 64 J K A A A\n 64 T K A A A\n 64 9 K A A A\n 64 8 K A A A\n 64 7 K A A A\n 64 6 K A A A\n 64 5 K A A A\n 64 4 K A A A\n 64 3 K A A A\n 64 2 K A A A\n 64 J Q A A A\n 64 T Q A A A\n 64 9 Q A A A\n 64 8 Q A A A\n 64 7 Q A A A\n 64 6 Q A A A\n 64 5 Q A A A\n 64 4 Q A A A\n 64 3 Q A A A\n 64 2 Q A A A\n 64 T J A A A\n 64 9 J A A A\n 64 8 J A A A\n 64 7 J A A A\n 64 6 J A A A\n 64 5 J A A A\n 64 4 J A A A\n 64 3 J A A A\n 64 2 J A A A\n 64 9 T A A A\n 64 8 T A A A\n 64 7 T A A A\n 64 6 T A A A\n 64 5 T A A A\n 64 4 T A A A\n 64 3 T A A A\n 64 2 T A A A\n 64 8 9 A A A\n 64 7 9 A A A\n 64 6 9 A A A\n 64 5 9 A A A\n 64 4 9 A A A\n 64 3 9 A A A\n 64 2 9 A A A\n 64 7 8 A A A\n 64 6 8 A A A\n 64 5 8 A A A\n 64 4 8 A A A\n 64 3 8 A A A\n 64 2 8 A A A\n 64 6 7 A A A\n 64 5 7 A A A\n 64 4 7 A A A\n 64 3 7 A A A\n 64 2 7 A A A\n 64 5 6 A A A\n 64 4 6 A A A\n 64 3 6 A A A\n 64 2 6 A A A\n 64 4 5 A A A\n 64 3 5 A A A\n 64 2 5 A A A\n 64 3 4 A A A\n 64 2 4 A A A\n 64 2 3 A A A\n 64 Q K K K A Three Kings\n 64 J K K K A\n 64 T K K K A\n 64 9 K K K A\n 64 8 K K K A\n 64 7 K K K A\n 64 6 K K K A\n 64 5 K K K A\n 64 4 K K K A\n 64 3 K K K A\n 64 2 K K K A\n 64 J Q K K K\n 64 T Q K K K\n 64 9 Q K K K\n 64 8 Q K K K\n 64 7 Q K K K\n 64 6 Q K K K\n 64 5 Q K K K\n 64 4 Q K K K\n 64 3 Q K K K\n 64 2 Q K K K\n 64 T J K K K\n 64 9 J K K K\n 64 8 J K K K\n 64 7 J K K K\n 64 6 J K K K\n 64 5 J K K K\n 64 4 J K K K\n 64 3 J K K K\n 64 2 J K K K\n 64 9 T K K K\n 64 8 T K K K\n 64 7 T K K K\n 64 6 T K K K\n 64 5 T K K K\n 64 4 T K K K\n 64 3 T K K K\n 64 2 T K K K\n 64 8 9 K K K\n 64 7 9 K K K\n 64 6 9 K K K\n 64 5 9 K K K\n 64 4 9 K K K\n 64 3 9 K K K\n 64 2 9 K K K\n 64 7 8 K K K\n 64 6 8 K K K\n 64 5 8 K K K\n 64 4 8 K K K\n 64 3 8 K K K\n 64 2 8 K K K\n 64 6 7 K K K\n 64 5 7 K K K\n 64 4 7 K K K\n 64 3 7 K K K\n 64 2 7 K K K\n 64 5 6 K K K\n 64 4 6 K K K\n 64 3 6 K K K\n 64 2 6 K K K\n 64 4 5 K K K\n 64 3 5 K K K\n 64 2 5 K K K\n 64 3 4 K K K\n 64 2 4 K K K\n 64 2 3 K K K\n 64 Q Q Q K A Three Queens\n 64 J Q Q Q A\n 64 T Q Q Q A\n 64 9 Q Q Q A\n 64 8 Q Q Q A\n 64 7 Q Q Q A\n 64 6 Q Q Q A\n 64 5 Q Q Q A\n 64 4 Q Q Q A\n 64 3 Q Q Q A\n 64 2 Q Q Q A\n 64 J Q Q Q K\n 64 T Q Q Q K\n 64 9 Q Q Q K\n 64 8 Q Q Q K\n 64 7 Q Q Q K\n 64 6 Q Q Q K\n 64 5 Q Q Q K\n 64 4 Q Q Q K\n 64 3 Q Q Q K\n 64 2 Q Q Q K\n 64 T J Q Q Q\n 64 9 J Q Q Q\n 64 8 J Q Q Q\n 64 7 J Q Q Q\n 64 6 J Q Q Q\n 64 5 J Q Q Q\n 64 4 J Q Q Q\n 64 3 J Q Q Q\n 64 2 J Q Q Q\n 64 9 T Q Q Q\n 64 8 T Q Q Q\n 64 7 T Q Q Q\n 64 6 T Q Q Q\n 64 5 T Q Q Q\n 64 4 T Q Q Q\n 64 3 T Q Q Q\n 64 2 T Q Q Q\n 64 8 9 Q Q Q\n 64 7 9 Q Q Q\n 64 6 9 Q Q Q\n 64 5 9 Q Q Q\n 64 4 9 Q Q Q\n 64 3 9 Q Q Q\n 64 2 9 Q Q Q\n 64 7 8 Q Q Q\n 64 6 8 Q Q Q\n 64 5 8 Q Q Q\n 64 4 8 Q Q Q\n 64 3 8 Q Q Q\n 64 2 8 Q Q Q\n 64 6 7 Q Q Q\n 64 5 7 Q Q Q\n 64 4 7 Q Q Q\n 64 3 7 Q Q Q\n 64 2 7 Q Q Q\n 64 5 6 Q Q Q\n 64 4 6 Q Q Q\n 64 3 6 Q Q Q\n 64 2 6 Q Q Q\n 64 4 5 Q Q Q\n 64 3 5 Q Q Q\n 64 2 5 Q Q Q\n 64 3 4 Q Q Q\n 64 2 4 Q Q Q\n 64 2 3 Q Q Q\n 64 J J J K A Three Jacks\n 64 J J J Q A\n 64 T J J J A\n 64 9 J J J A\n 64 8 J J J A\n 64 7 J J J A\n 64 6 J J J A\n 64 5 J J J A\n 64 4 J J J A\n 64 3 J J J A\n 64 2 J J J A\n 64 J J J Q K\n 64 T J J J K\n 64 9 J J J K\n 64 8 J J J K\n 64 7 J J J K\n 64 6 J J J K\n 64 5 J J J K\n 64 4 J J J K\n 64 3 J J J K\n 64 2 J J J K\n 64 T J J J Q\n 64 9 J J J Q\n 64 8 J J J Q\n 64 7 J J J Q\n 64 6 J J J Q\n 64 5 J J J Q\n 64 4 J J J Q\n 64 3 J J J Q\n 64 2 J J J Q\n 64 9 T J J J\n 64 8 T J J J\n 64 7 T J J J\n 64 6 T J J J\n 64 5 T J J J\n 64 4 T J J J\n 64 3 T J J J\n 64 2 T J J J\n 64 8 9 J J J\n 64 7 9 J J J\n 64 6 9 J J J\n 64 5 9 J J J\n 64 4 9 J J J\n 64 3 9 J J J\n 64 2 9 J J J\n 64 7 8 J J J\n 64 6 8 J J J\n 64 5 8 J J J\n 64 4 8 J J J\n 64 3 8 J J J\n 64 2 8 J J J\n 64 6 7 J J J\n 64 5 7 J J J\n 64 4 7 J J J\n 64 3 7 J J J\n 64 2 7 J J J\n 64 5 6 J J J\n 64 4 6 J J J\n 64 3 6 J J J\n 64 2 6 J J J\n 64 4 5 J J J\n 64 3 5 J J J\n 64 2 5 J J J\n 64 3 4 J J J\n 64 2 4 J J J\n 64 2 3 J J J\n 64 T T T K A Three Tens\n 64 T T T Q A\n 64 T T T J A\n 64 9 T T T A\n 64 8 T T T A\n 64 7 T T T A\n 64 6 T T T A\n 64 5 T T T A\n 64 4 T T T A\n 64 3 T T T A\n 64 2 T T T A\n 64 T T T Q K\n 64 T T T J K\n 64 9 T T T K\n 64 8 T T T K\n 64 7 T T T K\n 64 6 T T T K\n 64 5 T T T K\n 64 4 T T T K\n 64 3 T T T K\n 64 2 T T T K\n 64 T T T J Q\n 64 9 T T T Q\n 64 8 T T T Q\n 64 7 T T T Q\n 64 6 T T T Q\n 64 5 T T T Q\n 64 4 T T T Q\n 64 3 T T T Q\n 64 2 T T T Q\n 64 9 T T T J\n 64 8 T T T J\n 64 7 T T T J\n 64 6 T T T J\n 64 5 T T T J\n 64 4 T T T J\n 64 3 T T T J\n 64 2 T T T J\n 64 8 9 T T T\n 64 7 9 T T T\n 64 6 9 T T T\n 64 5 9 T T T\n 64 4 9 T T T\n 64 3 9 T T T\n 64 2 9 T T T\n 64 7 8 T T T\n 64 6 8 T T T\n 64 5 8 T T T\n 64 4 8 T T T\n 64 3 8 T T T\n 64 2 8 T T T\n 64 6 7 T T T\n 64 5 7 T T T\n 64 4 7 T T T\n 64 3 7 T T T\n 64 2 7 T T T\n 64 5 6 T T T\n 64 4 6 T T T\n 64 3 6 T T T\n 64 2 6 T T T\n 64 4 5 T T T\n 64 3 5 T T T\n 64 2 5 T T T\n 64 3 4 T T T\n 64 2 4 T T T\n 64 2 3 T T T\n 64 9 9 9 K A Three Nines\n 64 9 9 9 Q A\n 64 9 9 9 J A\n 64 9 9 9 T A\n 64 8 9 9 9 A\n 64 7 9 9 9 A\n 64 6 9 9 9 A\n 64 5 9 9 9 A\n 64 4 9 9 9 A\n 64 3 9 9 9 A\n 64 2 9 9 9 A\n 64 9 9 9 Q K\n 64 9 9 9 J K\n 64 9 9 9 T K\n 64 8 9 9 9 K\n 64 7 9 9 9 K\n 64 6 9 9 9 K\n 64 5 9 9 9 K\n 64 4 9 9 9 K\n 64 3 9 9 9 K\n 64 2 9 9 9 K\n 64 9 9 9 J Q\n 64 9 9 9 T Q\n 64 8 9 9 9 Q\n 64 7 9 9 9 Q\n 64 6 9 9 9 Q\n 64 5 9 9 9 Q\n 64 4 9 9 9 Q\n 64 3 9 9 9 Q\n 64 2 9 9 9 Q\n 64 9 9 9 T J\n 64 8 9 9 9 J\n 64 7 9 9 9 J\n 64 6 9 9 9 J\n 64 5 9 9 9 J\n 64 4 9 9 9 J\n 64 3 9 9 9 J\n 64 2 9 9 9 J\n 64 8 9 9 9 T\n 64 7 9 9 9 T\n 64 6 9 9 9 T\n 64 5 9 9 9 T\n 64 4 9 9 9 T\n 64 3 9 9 9 T\n 64 2 9 9 9 T\n 64 7 8 9 9 9\n 64 6 8 9 9 9\n 64 5 8 9 9 9\n 64 4 8 9 9 9\n 64 3 8 9 9 9\n 64 2 8 9 9 9\n 64 6 7 9 9 9\n 64 5 7 9 9 9\n 64 4 7 9 9 9\n 64 3 7 9 9 9\n 64 2 7 9 9 9\n 64 5 6 9 9 9\n 64 4 6 9 9 9\n 64 3 6 9 9 9\n 64 2 6 9 9 9\n 64 4 5 9 9 9\n 64 3 5 9 9 9\n 64 2 5 9 9 9\n 64 3 4 9 9 9\n 64 2 4 9 9 9\n 64 2 3 9 9 9\n 64 8 8 8 K A Three Eights\n 64 8 8 8 Q A\n 64 8 8 8 J A\n 64 8 8 8 T A\n 64 8 8 8 9 A\n 64 7 8 8 8 A\n 64 6 8 8 8 A\n 64 5 8 8 8 A\n 64 4 8 8 8 A\n 64 3 8 8 8 A\n 64 2 8 8 8 A\n 64 8 8 8 Q K\n 64 8 8 8 J K\n 64 8 8 8 T K\n 64 8 8 8 9 K\n 64 7 8 8 8 K\n 64 6 8 8 8 K\n 64 5 8 8 8 K\n 64 4 8 8 8 K\n 64 3 8 8 8 K\n 64 2 8 8 8 K\n 64 8 8 8 J Q\n 64 8 8 8 T Q\n 64 8 8 8 9 Q\n 64 7 8 8 8 Q\n 64 6 8 8 8 Q\n 64 5 8 8 8 Q\n 64 4 8 8 8 Q\n 64 3 8 8 8 Q\n 64 2 8 8 8 Q\n 64 8 8 8 T J\n 64 8 8 8 9 J\n 64 7 8 8 8 J\n 64 6 8 8 8 J\n 64 5 8 8 8 J\n 64 4 8 8 8 J\n 64 3 8 8 8 J\n 64 2 8 8 8 J\n 64 8 8 8 9 T\n 64 7 8 8 8 T\n 64 6 8 8 8 T\n 64 5 8 8 8 T\n 64 4 8 8 8 T\n 64 3 8 8 8 T\n 64 2 8 8 8 T\n 64 7 8 8 8 9\n 64 6 8 8 8 9\n 64 5 8 8 8 9\n 64 4 8 8 8 9\n 64 3 8 8 8 9\n 64 2 8 8 8 9\n 64 6 7 8 8 8\n 64 5 7 8 8 8\n 64 4 7 8 8 8\n 64 3 7 8 8 8\n 64 2 7 8 8 8\n 64 5 6 8 8 8\n 64 4 6 8 8 8\n 64 3 6 8 8 8\n 64 2 6 8 8 8\n 64 4 5 8 8 8\n 64 3 5 8 8 8\n 64 2 5 8 8 8\n 64 3 4 8 8 8\n 64 2 4 8 8 8\n 64 2 3 8 8 8\n 64 7 7 7 K A Three Sevens\n 64 7 7 7 Q A\n 64 7 7 7 J A\n 64 7 7 7 T A\n 64 7 7 7 9 A\n 64 7 7 7 8 A\n 64 6 7 7 7 A\n 64 5 7 7 7 A\n 64 4 7 7 7 A\n 64 3 7 7 7 A\n 64 2 7 7 7 A\n 64 7 7 7 Q K\n 64 7 7 7 J K\n 64 7 7 7 T K\n 64 7 7 7 9 K\n 64 7 7 7 8 K\n 64 6 7 7 7 K\n 64 5 7 7 7 K\n 64 4 7 7 7 K\n 64 3 7 7 7 K\n 64 2 7 7 7 K\n 64 7 7 7 J Q\n 64 7 7 7 T Q\n 64 7 7 7 9 Q\n 64 7 7 7 8 Q\n 64 6 7 7 7 Q\n 64 5 7 7 7 Q\n 64 4 7 7 7 Q\n 64 3 7 7 7 Q\n 64 2 7 7 7 Q\n 64 7 7 7 T J\n 64 7 7 7 9 J\n 64 7 7 7 8 J\n 64 6 7 7 7 J\n 64 5 7 7 7 J\n 64 4 7 7 7 J\n 64 3 7 7 7 J\n 64 2 7 7 7 J\n 64 7 7 7 9 T\n 64 7 7 7 8 T\n 64 6 7 7 7 T\n 64 5 7 7 7 T\n 64 4 7 7 7 T\n 64 3 7 7 7 T\n 64 2 7 7 7 T\n 64 7 7 7 8 9\n 64 6 7 7 7 9\n 64 5 7 7 7 9\n 64 4 7 7 7 9\n 64 3 7 7 7 9\n 64 2 7 7 7 9\n 64 6 7 7 7 8\n 64 5 7 7 7 8\n 64 4 7 7 7 8\n 64 3 7 7 7 8\n 64 2 7 7 7 8\n 64 5 6 7 7 7\n 64 4 6 7 7 7\n 64 3 6 7 7 7\n 64 2 6 7 7 7\n 64 4 5 7 7 7\n 64 3 5 7 7 7\n 64 2 5 7 7 7\n 64 3 4 7 7 7\n 64 2 4 7 7 7\n 64 2 3 7 7 7\n 64 6 6 6 K A Three Sixes\n 64 6 6 6 Q A\n 64 6 6 6 J A\n 64 6 6 6 T A\n 64 6 6 6 9 A\n 64 6 6 6 8 A\n 64 6 6 6 7 A\n 64 5 6 6 6 A\n 64 4 6 6 6 A\n 64 3 6 6 6 A\n 64 2 6 6 6 A\n 64 6 6 6 Q K\n 64 6 6 6 J K\n 64 6 6 6 T K\n 64 6 6 6 9 K\n 64 6 6 6 8 K\n 64 6 6 6 7 K\n 64 5 6 6 6 K\n 64 4 6 6 6 K\n 64 3 6 6 6 K\n 64 2 6 6 6 K\n 64 6 6 6 J Q\n 64 6 6 6 T Q\n 64 6 6 6 9 Q\n 64 6 6 6 8 Q\n 64 6 6 6 7 Q\n 64 5 6 6 6 Q\n 64 4 6 6 6 Q\n 64 3 6 6 6 Q\n 64 2 6 6 6 Q\n 64 6 6 6 T J\n 64 6 6 6 9 J\n 64 6 6 6 8 J\n 64 6 6 6 7 J\n 64 5 6 6 6 J\n 64 4 6 6 6 J\n 64 3 6 6 6 J\n 64 2 6 6 6 J\n 64 6 6 6 9 T\n 64 6 6 6 8 T\n 64 6 6 6 7 T\n 64 5 6 6 6 T\n 64 4 6 6 6 T\n 64 3 6 6 6 T\n 64 2 6 6 6 T\n 64 6 6 6 8 9\n 64 6 6 6 7 9\n 64 5 6 6 6 9\n 64 4 6 6 6 9\n 64 3 6 6 6 9\n 64 2 6 6 6 9\n 64 6 6 6 7 8\n 64 5 6 6 6 8\n 64 4 6 6 6 8\n 64 3 6 6 6 8\n 64 2 6 6 6 8\n 64 5 6 6 6 7\n 64 4 6 6 6 7\n 64 3 6 6 6 7\n 64 2 6 6 6 7\n 64 4 5 6 6 6\n 64 3 5 6 6 6\n 64 2 5 6 6 6\n 64 3 4 6 6 6\n 64 2 4 6 6 6\n 64 2 3 6 6 6\n 64 5 5 5 K A Three Fives\n 64 5 5 5 Q A\n 64 5 5 5 J A\n 64 5 5 5 T A\n 64 5 5 5 9 A\n 64 5 5 5 8 A\n 64 5 5 5 7 A\n 64 5 5 5 6 A\n 64 4 5 5 5 A\n 64 3 5 5 5 A\n 64 2 5 5 5 A\n 64 5 5 5 Q K\n 64 5 5 5 J K\n 64 5 5 5 T K\n 64 5 5 5 9 K\n 64 5 5 5 8 K\n 64 5 5 5 7 K\n 64 5 5 5 6 K\n 64 4 5 5 5 K\n 64 3 5 5 5 K\n 64 2 5 5 5 K\n 64 5 5 5 J Q\n 64 5 5 5 T Q\n 64 5 5 5 9 Q\n 64 5 5 5 8 Q\n 64 5 5 5 7 Q\n 64 5 5 5 6 Q\n 64 4 5 5 5 Q\n 64 3 5 5 5 Q\n 64 2 5 5 5 Q\n 64 5 5 5 T J\n 64 5 5 5 9 J\n 64 5 5 5 8 J\n 64 5 5 5 7 J\n 64 5 5 5 6 J\n 64 4 5 5 5 J\n 64 3 5 5 5 J\n 64 2 5 5 5 J\n 64 5 5 5 9 T\n 64 5 5 5 8 T\n 64 5 5 5 7 T\n 64 5 5 5 6 T\n 64 4 5 5 5 T\n 64 3 5 5 5 T\n 64 2 5 5 5 T\n 64 5 5 5 8 9\n 64 5 5 5 7 9\n 64 5 5 5 6 9\n 64 4 5 5 5 9\n 64 3 5 5 5 9\n 64 2 5 5 5 9\n 64 5 5 5 7 8\n 64 5 5 5 6 8\n 64 4 5 5 5 8\n 64 3 5 5 5 8\n 64 2 5 5 5 8\n 64 5 5 5 6 7\n 64 4 5 5 5 7\n 64 3 5 5 5 7\n 64 2 5 5 5 7\n 64 4 5 5 5 6\n 64 3 5 5 5 6\n 64 2 5 5 5 6\n 64 3 4 5 5 5\n 64 2 4 5 5 5\n 64 2 3 5 5 5\n 64 4 4 4 K A Three Fours\n 64 4 4 4 Q A\n 64 4 4 4 J A\n 64 4 4 4 T A\n 64 4 4 4 9 A\n 64 4 4 4 8 A\n 64 4 4 4 7 A\n 64 4 4 4 6 A\n 64 4 4 4 5 A\n 64 3 4 4 4 A\n 64 2 4 4 4 A\n 64 4 4 4 Q K\n 64 4 4 4 J K\n 64 4 4 4 T K\n 64 4 4 4 9 K\n 64 4 4 4 8 K\n 64 4 4 4 7 K\n 64 4 4 4 6 K\n 64 4 4 4 5 K\n 64 3 4 4 4 K\n 64 2 4 4 4 K\n 64 4 4 4 J Q\n 64 4 4 4 T Q\n 64 4 4 4 9 Q\n 64 4 4 4 8 Q\n 64 4 4 4 7 Q\n 64 4 4 4 6 Q\n 64 4 4 4 5 Q\n 64 3 4 4 4 Q\n 64 2 4 4 4 Q\n 64 4 4 4 T J\n 64 4 4 4 9 J\n 64 4 4 4 8 J\n 64 4 4 4 7 J\n 64 4 4 4 6 J\n 64 4 4 4 5 J\n 64 3 4 4 4 J\n 64 2 4 4 4 J\n 64 4 4 4 9 T\n 64 4 4 4 8 T\n 64 4 4 4 7 T\n 64 4 4 4 6 T\n 64 4 4 4 5 T\n 64 3 4 4 4 T\n 64 2 4 4 4 T\n 64 4 4 4 8 9\n 64 4 4 4 7 9\n 64 4 4 4 6 9\n 64 4 4 4 5 9\n 64 3 4 4 4 9\n 64 2 4 4 4 9\n 64 4 4 4 7 8\n 64 4 4 4 6 8\n 64 4 4 4 5 8\n 64 3 4 4 4 8\n 64 2 4 4 4 8\n 64 4 4 4 6 7\n 64 4 4 4 5 7\n 64 3 4 4 4 7\n 64 2 4 4 4 7\n 64 4 4 4 5 6\n 64 3 4 4 4 6\n 64 2 4 4 4 6\n 64 3 4 4 4 5\n 64 2 4 4 4 5\n 64 2 3 4 4 4\n 64 3 3 3 K A Three Treys\n 64 3 3 3 Q A\n 64 3 3 3 J A\n 64 3 3 3 T A\n 64 3 3 3 9 A\n 64 3 3 3 8 A\n 64 3 3 3 7 A\n 64 3 3 3 6 A\n 64 3 3 3 5 A\n 64 3 3 3 4 A\n 64 2 3 3 3 A\n 64 3 3 3 Q K\n 64 3 3 3 J K\n 64 3 3 3 T K\n 64 3 3 3 9 K\n 64 3 3 3 8 K\n 64 3 3 3 7 K\n 64 3 3 3 6 K\n 64 3 3 3 5 K\n 64 3 3 3 4 K\n 64 2 3 3 3 K\n 64 3 3 3 J Q\n 64 3 3 3 T Q\n 64 3 3 3 9 Q\n 64 3 3 3 8 Q\n 64 3 3 3 7 Q\n 64 3 3 3 6 Q\n 64 3 3 3 5 Q\n 64 3 3 3 4 Q\n 64 2 3 3 3 Q\n 64 3 3 3 T J\n 64 3 3 3 9 J\n 64 3 3 3 8 J\n 64 3 3 3 7 J\n 64 3 3 3 6 J\n 64 3 3 3 5 J\n 64 3 3 3 4 J\n 64 2 3 3 3 J\n 64 3 3 3 9 T\n 64 3 3 3 8 T\n 64 3 3 3 7 T\n 64 3 3 3 6 T\n 64 3 3 3 5 T\n 64 3 3 3 4 T\n 64 2 3 3 3 T\n 64 3 3 3 8 9\n 64 3 3 3 7 9\n 64 3 3 3 6 9\n 64 3 3 3 5 9\n 64 3 3 3 4 9\n 64 2 3 3 3 9\n 64 3 3 3 7 8\n 64 3 3 3 6 8\n 64 3 3 3 5 8\n 64 3 3 3 4 8\n 64 2 3 3 3 8\n 64 3 3 3 6 7\n 64 3 3 3 5 7\n 64 3 3 3 4 7\n 64 2 3 3 3 7\n 64 3 3 3 5 6\n 64 3 3 3 4 6\n 64 2 3 3 3 6\n 64 3 3 3 4 5\n 64 2 3 3 3 5\n 64 2 3 3 3 4\n 64 2 2 2 K A Three Deuces\n 64 2 2 2 Q A\n 64 2 2 2 J A\n 64 2 2 2 T A\n 64 2 2 2 9 A\n 64 2 2 2 8 A\n 64 2 2 2 7 A\n 64 2 2 2 6 A\n 64 2 2 2 5 A\n 64 2 2 2 4 A\n 64 2 2 2 3 A\n 64 2 2 2 Q K\n 64 2 2 2 J K\n 64 2 2 2 T K\n 64 2 2 2 9 K\n 64 2 2 2 8 K\n 64 2 2 2 7 K\n 64 2 2 2 6 K\n 64 2 2 2 5 K\n 64 2 2 2 4 K\n 64 2 2 2 3 K\n 64 2 2 2 J Q\n 64 2 2 2 T Q\n 64 2 2 2 9 Q\n 64 2 2 2 8 Q\n 64 2 2 2 7 Q\n 64 2 2 2 6 Q\n 64 2 2 2 5 Q\n 64 2 2 2 4 Q\n 64 2 2 2 3 Q\n 64 2 2 2 T J\n 64 2 2 2 9 J\n 64 2 2 2 8 J\n 64 2 2 2 7 J\n 64 2 2 2 6 J\n 64 2 2 2 5 J\n 64 2 2 2 4 J\n 64 2 2 2 3 J\n 64 2 2 2 9 T\n 64 2 2 2 8 T\n 64 2 2 2 7 T\n 64 2 2 2 6 T\n 64 2 2 2 5 T\n 64 2 2 2 4 T\n 64 2 2 2 3 T\n 64 2 2 2 8 9\n 64 2 2 2 7 9\n 64 2 2 2 6 9\n 64 2 2 2 5 9\n 64 2 2 2 4 9\n 64 2 2 2 3 9\n 64 2 2 2 7 8\n 64 2 2 2 6 8\n 64 2 2 2 5 8\n 64 2 2 2 4 8\n 64 2 2 2 3 8\n 64 2 2 2 6 7\n 64 2 2 2 5 7\n 64 2 2 2 4 7\n 64 2 2 2 3 7\n 64 2 2 2 5 6\n 64 2 2 2 4 6\n 64 2 2 2 3 6\n 64 2 2 2 4 5\n 64 2 2 2 3 5\n 64 2 2 2 3 4\n 144 Q K K A A Aces over Kings TWO PAIR\n 144 J K K A A\n 144 T K K A A\n 144 9 K K A A\n 144 8 K K A A\n 144 7 K K A A\n 144 6 K K A A\n 144 5 K K A A\n 144 4 K K A A\n 144 3 K K A A\n 144 2 K K A A\n 144 Q Q K A A Aces over Queens\n 144 J Q Q A A\n 144 T Q Q A A\n 144 9 Q Q A A\n 144 8 Q Q A A\n 144 7 Q Q A A\n 144 6 Q Q A A\n 144 5 Q Q A A\n 144 4 Q Q A A\n 144 3 Q Q A A\n 144 2 Q Q A A\n 144 J J K A A Aces over Jacks\n 144 J J Q A A\n 144 T J J A A\n 144 9 J J A A\n 144 8 J J A A\n 144 7 J J A A\n 144 6 J J A A\n 144 5 J J A A\n 144 4 J J A A\n 144 3 J J A A\n 144 2 J J A A\n 144 T T K A A Aces over Tens\n 144 T T Q A A\n 144 T T J A A\n 144 9 T T A A\n 144 8 T T A A\n 144 7 T T A A\n 144 6 T T A A\n 144 5 T T A A\n 144 4 T T A A\n 144 3 T T A A\n 144 2 T T A A\n 144 9 9 K A A Aces over Nines\n 144 9 9 Q A A\n 144 9 9 J A A\n 144 9 9 T A A\n 144 8 9 9 A A\n 144 7 9 9 A A\n 144 6 9 9 A A\n 144 5 9 9 A A\n 144 4 9 9 A A\n 144 3 9 9 A A\n 144 2 9 9 A A\n 144 8 8 K A A Aces over Eights\n 144 8 8 Q A A\n 144 8 8 J A A\n 144 8 8 T A A\n 144 8 8 9 A A\n 144 7 8 8 A A\n 144 6 8 8 A A\n 144 5 8 8 A A\n 144 4 8 8 A A\n 144 3 8 8 A A\n 144 2 8 8 A A\n 144 7 7 K A A Aces over Sevens\n 144 7 7 Q A A\n 144 7 7 J A A\n 144 7 7 T A A\n 144 7 7 9 A A\n 144 7 7 8 A A\n 144 6 7 7 A A\n 144 5 7 7 A A\n 144 4 7 7 A A\n 144 3 7 7 A A\n 144 2 7 7 A A\n 144 6 6 K A A Aces over Sixes\n 144 6 6 Q A A\n 144 6 6 J A A\n 144 6 6 T A A\n 144 6 6 9 A A\n 144 6 6 8 A A\n 144 6 6 7 A A\n 144 5 6 6 A A\n 144 4 6 6 A A\n 144 3 6 6 A A\n 144 2 6 6 A A\n 144 5 5 K A A Aces over Fives\n 144 5 5 Q A A\n 144 5 5 J A A\n 144 5 5 T A A\n 144 5 5 9 A A\n 144 5 5 8 A A\n 144 5 5 7 A A\n 144 5 5 6 A A\n 144 4 5 5 A A\n 144 3 5 5 A A\n 144 2 5 5 A A\n 144 4 4 K A A Aces over Fours\n 144 4 4 Q A A\n 144 4 4 J A A\n 144 4 4 T A A\n 144 4 4 9 A A\n 144 4 4 8 A A\n 144 4 4 7 A A\n 144 4 4 6 A A\n 144 4 4 5 A A\n 144 3 4 4 A A\n 144 2 4 4 A A\n 144 3 3 K A A Aces over Treys\n 144 3 3 Q A A\n 144 3 3 J A A\n 144 3 3 T A A\n 144 3 3 9 A A\n 144 3 3 8 A A\n 144 3 3 7 A A\n 144 3 3 6 A A\n 144 3 3 5 A A\n 144 3 3 4 A A\n 144 2 3 3 A A\n 144 2 2 K A A Aces over Deuces\n 144 2 2 Q A A\n 144 2 2 J A A\n 144 2 2 T A A\n 144 2 2 9 A A\n 144 2 2 8 A A\n 144 2 2 7 A A\n 144 2 2 6 A A\n 144 2 2 5 A A\n 144 2 2 4 A A\n 144 2 2 3 A A\n 144 Q Q K K A Kings over Queens\n 144 J Q Q K K\n 144 T Q Q K K\n 144 9 Q Q K K\n 144 8 Q Q K K\n 144 7 Q Q K K\n 144 6 Q Q K K\n 144 5 Q Q K K\n 144 4 Q Q K K\n 144 3 Q Q K K\n 144 2 Q Q K K\n 144 J J K K A Kings over Jacks\n 144 J J Q K K\n 144 T J J K K\n 144 9 J J K K\n 144 8 J J K K\n 144 7 J J K K\n 144 6 J J K K\n 144 5 J J K K\n 144 4 J J K K\n 144 3 J J K K\n 144 2 J J K K\n 144 T T K K A Kings over Tens\n 144 T T Q K K\n 144 T T J K K\n 144 9 T T K K\n 144 8 T T K K\n 144 7 T T K K\n 144 6 T T K K\n 144 5 T T K K\n 144 4 T T K K\n 144 3 T T K K\n 144 2 T T K K\n 144 9 9 K K A Kings over Nines\n 144 9 9 Q K K\n 144 9 9 J K K\n 144 9 9 T K K\n 144 8 9 9 K K\n 144 7 9 9 K K\n 144 6 9 9 K K\n 144 5 9 9 K K\n 144 4 9 9 K K\n 144 3 9 9 K K\n 144 2 9 9 K K\n 144 8 8 K K A Kings over Eights\n 144 8 8 Q K K\n 144 8 8 J K K\n 144 8 8 T K K\n 144 8 8 9 K K\n 144 7 8 8 K K\n 144 6 8 8 K K\n 144 5 8 8 K K\n 144 4 8 8 K K\n 144 3 8 8 K K\n 144 2 8 8 K K\n 144 7 7 K K A Kings over Sevens\n 144 7 7 Q K K\n 144 7 7 J K K\n 144 7 7 T K K\n 144 7 7 9 K K\n 144 7 7 8 K K\n 144 6 7 7 K K\n 144 5 7 7 K K\n 144 4 7 7 K K\n 144 3 7 7 K K\n 144 2 7 7 K K\n 144 6 6 K K A Kings over Sixes\n 144 6 6 Q K K\n 144 6 6 J K K\n 144 6 6 T K K\n 144 6 6 9 K K\n 144 6 6 8 K K\n 144 6 6 7 K K\n 144 5 6 6 K K\n 144 4 6 6 K K\n 144 3 6 6 K K\n 144 2 6 6 K K\n 144 5 5 K K A Kings over Fives\n 144 5 5 Q K K\n 144 5 5 J K K\n 144 5 5 T K K\n 144 5 5 9 K K\n 144 5 5 8 K K\n 144 5 5 7 K K\n 144 5 5 6 K K\n 144 4 5 5 K K\n 144 3 5 5 K K\n 144 2 5 5 K K\n 144 4 4 K K A Kings over Fours\n 144 4 4 Q K K\n 144 4 4 J K K\n 144 4 4 T K K\n 144 4 4 9 K K\n 144 4 4 8 K K\n 144 4 4 7 K K\n 144 4 4 6 K K\n 144 4 4 5 K K\n 144 3 4 4 K K\n 144 2 4 4 K K\n 144 3 3 K K A Kings over Treys\n 144 3 3 Q K K\n 144 3 3 J K K\n 144 3 3 T K K\n 144 3 3 9 K K\n 144 3 3 8 K K\n 144 3 3 7 K K\n 144 3 3 6 K K\n 144 3 3 5 K K\n 144 3 3 4 K K\n 144 2 3 3 K K\n 144 2 2 K K A Kings over Deuces\n 144 2 2 Q K K\n 144 2 2 J K K\n 144 2 2 T K K\n 144 2 2 9 K K\n 144 2 2 8 K K\n 144 2 2 7 K K\n 144 2 2 6 K K\n 144 2 2 5 K K\n 144 2 2 4 K K\n 144 2 2 3 K K\n 144 J J Q Q A Queens over Jacks\n 144 J J Q Q K\n 144 T J J Q Q\n 144 9 J J Q Q\n 144 8 J J Q Q\n 144 7 J J Q Q\n 144 6 J J Q Q\n 144 5 J J Q Q\n 144 4 J J Q Q\n 144 3 J J Q Q\n 144 2 J J Q Q\n 144 T T Q Q A Queens over Tens\n 144 T T Q Q K\n 144 T T J Q Q\n 144 9 T T Q Q\n 144 8 T T Q Q\n 144 7 T T Q Q\n 144 6 T T Q Q\n 144 5 T T Q Q\n 144 4 T T Q Q\n 144 3 T T Q Q\n 144 2 T T Q Q\n 144 9 9 Q Q A Queens over Nines\n 144 9 9 Q Q K\n 144 9 9 J Q Q\n 144 9 9 T Q Q\n 144 8 9 9 Q Q\n 144 7 9 9 Q Q\n 144 6 9 9 Q Q\n 144 5 9 9 Q Q\n 144 4 9 9 Q Q\n 144 3 9 9 Q Q\n 144 2 9 9 Q Q\n 144 8 8 Q Q A Queens over Eights\n 144 8 8 Q Q K\n 144 8 8 J Q Q\n 144 8 8 T Q Q\n 144 8 8 9 Q Q\n 144 7 8 8 Q Q\n 144 6 8 8 Q Q\n 144 5 8 8 Q Q\n 144 4 8 8 Q Q\n 144 3 8 8 Q Q\n 144 2 8 8 Q Q\n 144 7 7 Q Q A Queens over Sevens\n 144 7 7 Q Q K\n 144 7 7 J Q Q\n 144 7 7 T Q Q\n 144 7 7 9 Q Q\n 144 7 7 8 Q Q\n 144 6 7 7 Q Q\n 144 5 7 7 Q Q\n 144 4 7 7 Q Q\n 144 3 7 7 Q Q\n 144 2 7 7 Q Q\n 144 6 6 Q Q A Queens over Sixes\n 144 6 6 Q Q K\n 144 6 6 J Q Q\n 144 6 6 T Q Q\n 144 6 6 9 Q Q\n 144 6 6 8 Q Q\n 144 6 6 7 Q Q\n 144 5 6 6 Q Q\n 144 4 6 6 Q Q\n 144 3 6 6 Q Q\n 144 2 6 6 Q Q\n 144 5 5 Q Q A Queens over Fives\n 144 5 5 Q Q K\n 144 5 5 J Q Q\n 144 5 5 T Q Q\n 144 5 5 9 Q Q\n 144 5 5 8 Q Q\n 144 5 5 7 Q Q\n 144 5 5 6 Q Q\n 144 4 5 5 Q Q\n 144 3 5 5 Q Q\n 144 2 5 5 Q Q\n 144 4 4 Q Q A Queens over Fours\n 144 4 4 Q Q K\n 144 4 4 J Q Q\n 144 4 4 T Q Q\n 144 4 4 9 Q Q\n 144 4 4 8 Q Q\n 144 4 4 7 Q Q\n 144 4 4 6 Q Q\n 144 4 4 5 Q Q\n 144 3 4 4 Q Q\n 144 2 4 4 Q Q\n 144 3 3 Q Q A Queens over Treys\n 144 3 3 Q Q K\n 144 3 3 J Q Q\n 144 3 3 T Q Q\n 144 3 3 9 Q Q\n 144 3 3 8 Q Q\n 144 3 3 7 Q Q\n 144 3 3 6 Q Q\n 144 3 3 5 Q Q\n 144 3 3 4 Q Q\n 144 2 3 3 Q Q\n 144 2 2 Q Q A Queens over Deuces\n 144 2 2 Q Q K\n 144 2 2 J Q Q\n 144 2 2 T Q Q\n 144 2 2 9 Q Q\n 144 2 2 8 Q Q\n 144 2 2 7 Q Q\n 144 2 2 6 Q Q\n 144 2 2 5 Q Q\n 144 2 2 4 Q Q\n 144 2 2 3 Q Q\n 144 T T J J A Jacks over Tens\n 144 T T J J K\n 144 T T J J Q\n 144 9 T T J J\n 144 8 T T J J\n 144 7 T T J J\n 144 6 T T J J\n 144 5 T T J J\n 144 4 T T J J\n 144 3 T T J J\n 144 2 T T J J\n 144 9 9 J J A Jacks over Nines\n 144 9 9 J J K\n 144 9 9 J J Q\n 144 9 9 T J J\n 144 8 9 9 J J\n 144 7 9 9 J J\n 144 6 9 9 J J\n 144 5 9 9 J J\n 144 4 9 9 J J\n 144 3 9 9 J J\n 144 2 9 9 J J\n 144 8 8 J J A Jacks over Eights\n 144 8 8 J J K\n 144 8 8 J J Q\n 144 8 8 T J J\n 144 8 8 9 J J\n 144 7 8 8 J J\n 144 6 8 8 J J\n 144 5 8 8 J J\n 144 4 8 8 J J\n 144 3 8 8 J J\n 144 2 8 8 J J\n 144 7 7 J J A Jacks over Sevens\n 144 7 7 J J K\n 144 7 7 J J Q\n 144 7 7 T J J\n 144 7 7 9 J J\n 144 7 7 8 J J\n 144 6 7 7 J J\n 144 5 7 7 J J\n 144 4 7 7 J J\n 144 3 7 7 J J\n 144 2 7 7 J J\n 144 6 6 J J A Jacks over Sixes\n 144 6 6 J J K\n 144 6 6 J J Q\n 144 6 6 T J J\n 144 6 6 9 J J\n 144 6 6 8 J J\n 144 6 6 7 J J\n 144 5 6 6 J J\n 144 4 6 6 J J\n 144 3 6 6 J J\n 144 2 6 6 J J\n 144 5 5 J J A Jacks over Fives\n 144 5 5 J J K\n 144 5 5 J J Q\n 144 5 5 T J J\n 144 5 5 9 J J\n 144 5 5 8 J J\n 144 5 5 7 J J\n 144 5 5 6 J J\n 144 4 5 5 J J\n 144 3 5 5 J J\n 144 2 5 5 J J\n 144 4 4 J J A Jacks over Fours\n 144 4 4 J J K\n 144 4 4 J J Q\n 144 4 4 T J J\n 144 4 4 9 J J\n 144 4 4 8 J J\n 144 4 4 7 J J\n 144 4 4 6 J J\n 144 4 4 5 J J\n 144 3 4 4 J J\n 144 2 4 4 J J\n 144 3 3 J J A Jacks over Treys\n 144 3 3 J J K\n 144 3 3 J J Q\n 144 3 3 T J J\n 144 3 3 9 J J\n 144 3 3 8 J J\n 144 3 3 7 J J\n 144 3 3 6 J J\n 144 3 3 5 J J\n 144 3 3 4 J J\n 144 2 3 3 J J\n 144 2 2 J J A Jacks over Deuces\n 144 2 2 J J K\n 144 2 2 J J Q\n 144 2 2 T J J\n 144 2 2 9 J J\n 144 2 2 8 J J\n 144 2 2 7 J J\n 144 2 2 6 J J\n 144 2 2 5 J J\n 144 2 2 4 J J\n 144 2 2 3 J J\n 144 9 9 T T A Tens over Nines\n 144 9 9 T T K\n 144 9 9 T T Q\n 144 9 9 T T J\n 144 8 9 9 T T\n 144 7 9 9 T T\n 144 6 9 9 T T\n 144 5 9 9 T T\n 144 4 9 9 T T\n 144 3 9 9 T T\n 144 2 9 9 T T\n 144 8 8 T T A Tens over Eights\n 144 8 8 T T K\n 144 8 8 T T Q\n 144 8 8 T T J\n 144 8 8 9 T T\n 144 7 8 8 T T\n 144 6 8 8 T T\n 144 5 8 8 T T\n 144 4 8 8 T T\n 144 3 8 8 T T\n 144 2 8 8 T T\n 144 7 7 T T A Tens over Sevens\n 144 7 7 T T K\n 144 7 7 T T Q\n 144 7 7 T T J\n 144 7 7 9 T T\n 144 7 7 8 T T\n 144 6 7 7 T T\n 144 5 7 7 T T\n 144 4 7 7 T T\n 144 3 7 7 T T\n 144 2 7 7 T T\n 144 6 6 T T A Tens over Sixes\n 144 6 6 T T K\n 144 6 6 T T Q\n 144 6 6 T T J\n 144 6 6 9 T T\n 144 6 6 8 T T\n 144 6 6 7 T T\n 144 5 6 6 T T\n 144 4 6 6 T T\n 144 3 6 6 T T\n 144 2 6 6 T T\n 144 5 5 T T A Tens over Fives\n 144 5 5 T T K\n 144 5 5 T T Q\n 144 5 5 T T J\n 144 5 5 9 T T\n 144 5 5 8 T T\n 144 5 5 7 T T\n 144 5 5 6 T T\n 144 4 5 5 T T\n 144 3 5 5 T T\n 144 2 5 5 T T\n 144 4 4 T T A Tens over Fours\n 144 4 4 T T K\n 144 4 4 T T Q\n 144 4 4 T T J\n 144 4 4 9 T T\n 144 4 4 8 T T\n 144 4 4 7 T T\n 144 4 4 6 T T\n 144 4 4 5 T T\n 144 3 4 4 T T\n 144 2 4 4 T T\n 144 3 3 T T A Tens over Treys\n 144 3 3 T T K\n 144 3 3 T T Q\n 144 3 3 T T J\n 144 3 3 9 T T\n 144 3 3 8 T T\n 144 3 3 7 T T\n 144 3 3 6 T T\n 144 3 3 5 T T\n 144 3 3 4 T T\n 144 2 3 3 T T\n 144 2 2 T T A Tens over Deuces\n 144 2 2 T T K\n 144 2 2 T T Q\n 144 2 2 T T J\n 144 2 2 9 T T\n 144 2 2 8 T T\n 144 2 2 7 T T\n 144 2 2 6 T T\n 144 2 2 5 T T\n 144 2 2 4 T T\n 144 2 2 3 T T\n 144 8 8 9 9 A Nines over Eights\n 144 8 8 9 9 K\n 144 8 8 9 9 Q\n 144 8 8 9 9 J\n 144 8 8 9 9 T\n 144 7 8 8 9 9\n 144 6 8 8 9 9\n 144 5 8 8 9 9\n 144 4 8 8 9 9\n 144 3 8 8 9 9\n 144 2 8 8 9 9\n 144 7 7 9 9 A Nines over Sevens\n 144 7 7 9 9 K\n 144 7 7 9 9 Q\n 144 7 7 9 9 J\n 144 7 7 9 9 T\n 144 7 7 8 9 9\n 144 6 7 7 9 9\n 144 5 7 7 9 9\n 144 4 7 7 9 9\n 144 3 7 7 9 9\n 144 2 7 7 9 9\n 144 6 6 9 9 A Nines over Sixes\n 144 6 6 9 9 K\n 144 6 6 9 9 Q\n 144 6 6 9 9 J\n 144 6 6 9 9 T\n 144 6 6 8 9 9\n 144 6 6 7 9 9\n 144 5 6 6 9 9\n 144 4 6 6 9 9\n 144 3 6 6 9 9\n 144 2 6 6 9 9\n 144 5 5 9 9 A Nines over Fives\n 144 5 5 9 9 K\n 144 5 5 9 9 Q\n 144 5 5 9 9 J\n 144 5 5 9 9 T\n 144 5 5 8 9 9\n 144 5 5 7 9 9\n 144 5 5 6 9 9\n 144 4 5 5 9 9\n 144 3 5 5 9 9\n 144 2 5 5 9 9\n 144 4 4 9 9 A Nines over Fours\n 144 4 4 9 9 K\n 144 4 4 9 9 Q\n 144 4 4 9 9 J\n 144 4 4 9 9 T\n 144 4 4 8 9 9\n 144 4 4 7 9 9\n 144 4 4 6 9 9\n 144 4 4 5 9 9\n 144 3 4 4 9 9\n 144 2 4 4 9 9\n 144 3 3 9 9 A Nines over Treys\n 144 3 3 9 9 K\n 144 3 3 9 9 Q\n 144 3 3 9 9 J\n 144 3 3 9 9 T\n 144 3 3 8 9 9\n 144 3 3 7 9 9\n 144 3 3 6 9 9\n 144 3 3 5 9 9\n 144 3 3 4 9 9\n 144 2 3 3 9 9\n 144 2 2 9 9 A Nines over Deuces\n 144 2 2 9 9 K\n 144 2 2 9 9 Q\n 144 2 2 9 9 J\n 144 2 2 9 9 T\n 144 2 2 8 9 9\n 144 2 2 7 9 9\n 144 2 2 6 9 9\n 144 2 2 5 9 9\n 144 2 2 4 9 9\n 144 2 2 3 9 9\n 144 7 7 8 8 A Eights over Sevens\n 144 7 7 8 8 K\n 144 7 7 8 8 Q\n 144 7 7 8 8 J\n 144 7 7 8 8 T\n 144 7 7 8 8 9\n 144 6 7 7 8 8\n 144 5 7 7 8 8\n 144 4 7 7 8 8\n 144 3 7 7 8 8\n 144 2 7 7 8 8\n 144 6 6 8 8 A Eights over Sixes\n 144 6 6 8 8 K\n 144 6 6 8 8 Q\n 144 6 6 8 8 J\n 144 6 6 8 8 T\n 144 6 6 8 8 9\n 144 6 6 7 8 8\n 144 5 6 6 8 8\n 144 4 6 6 8 8\n 144 3 6 6 8 8\n 144 2 6 6 8 8\n 144 5 5 8 8 A Eights over Fives\n 144 5 5 8 8 K\n 144 5 5 8 8 Q\n 144 5 5 8 8 J\n 144 5 5 8 8 T\n 144 5 5 8 8 9\n 144 5 5 7 8 8\n 144 5 5 6 8 8\n 144 4 5 5 8 8\n 144 3 5 5 8 8\n 144 2 5 5 8 8\n 144 4 4 8 8 A Eights over Fours\n 144 4 4 8 8 K\n 144 4 4 8 8 Q\n 144 4 4 8 8 J\n 144 4 4 8 8 T\n 144 4 4 8 8 9\n 144 4 4 7 8 8\n 144 4 4 6 8 8\n 144 4 4 5 8 8\n 144 3 4 4 8 8\n 144 2 4 4 8 8\n 144 3 3 8 8 A Eights over Treys\n 144 3 3 8 8 K\n 144 3 3 8 8 Q\n 144 3 3 8 8 J\n 144 3 3 8 8 T\n 144 3 3 8 8 9\n 144 3 3 7 8 8\n 144 3 3 6 8 8\n 144 3 3 5 8 8\n 144 3 3 4 8 8\n 144 2 3 3 8 8\n 144 2 2 8 8 A Eights over Deuces\n 144 2 2 8 8 K\n 144 2 2 8 8 Q\n 144 2 2 8 8 J\n 144 2 2 8 8 T\n 144 2 2 8 8 9\n 144 2 2 7 8 8\n 144 2 2 6 8 8\n 144 2 2 5 8 8\n 144 2 2 4 8 8\n 144 2 2 3 8 8\n 144 6 6 7 7 A Sevens over Sixes\n 144 6 6 7 7 K\n 144 6 6 7 7 Q\n 144 6 6 7 7 J\n 144 6 6 7 7 T\n 144 6 6 7 7 9\n 144 6 6 7 7 8\n 144 5 6 6 7 7\n 144 4 6 6 7 7\n 144 3 6 6 7 7\n 144 2 6 6 7 7\n 144 5 5 7 7 A Sevens over Fives\n 144 5 5 7 7 K\n 144 5 5 7 7 Q\n 144 5 5 7 7 J\n 144 5 5 7 7 T\n 144 5 5 7 7 9\n 144 5 5 7 7 8\n 144 5 5 6 7 7\n 144 4 5 5 7 7\n 144 3 5 5 7 7\n 144 2 5 5 7 7\n 144 4 4 7 7 A Sevens over Fours\n 144 4 4 7 7 K\n 144 4 4 7 7 Q\n 144 4 4 7 7 J\n 144 4 4 7 7 T\n 144 4 4 7 7 9\n 144 4 4 7 7 8\n 144 4 4 6 7 7\n 144 4 4 5 7 7\n 144 3 4 4 7 7\n 144 2 4 4 7 7\n 144 3 3 7 7 A Sevens over Treys\n 144 3 3 7 7 K\n 144 3 3 7 7 Q\n 144 3 3 7 7 J\n 144 3 3 7 7 T\n 144 3 3 7 7 9\n 144 3 3 7 7 8\n 144 3 3 6 7 7\n 144 3 3 5 7 7\n 144 3 3 4 7 7\n 144 2 3 3 7 7\n 144 2 2 7 7 A Sevens over Deuces\n 144 2 2 7 7 K\n 144 2 2 7 7 Q\n 144 2 2 7 7 J\n 144 2 2 7 7 T\n 144 2 2 7 7 9\n 144 2 2 7 7 8\n 144 2 2 6 7 7\n 144 2 2 5 7 7\n 144 2 2 4 7 7\n 144 2 2 3 7 7\n 144 5 5 6 6 A Sixes over Fives\n 144 5 5 6 6 K\n 144 5 5 6 6 Q\n 144 5 5 6 6 J\n 144 5 5 6 6 T\n 144 5 5 6 6 9\n 144 5 5 6 6 8\n 144 5 5 6 6 7\n 144 4 5 5 6 6\n 144 3 5 5 6 6\n 144 2 5 5 6 6\n 144 4 4 6 6 A Sixes over Fours\n 144 4 4 6 6 K\n 144 4 4 6 6 Q\n 144 4 4 6 6 J\n 144 4 4 6 6 T\n 144 4 4 6 6 9\n 144 4 4 6 6 8\n 144 4 4 6 6 7\n 144 4 4 5 6 6\n 144 3 4 4 6 6\n 144 2 4 4 6 6\n 144 3 3 6 6 A Sixes over Treys\n 144 3 3 6 6 K\n 144 3 3 6 6 Q\n 144 3 3 6 6 J\n 144 3 3 6 6 T\n 144 3 3 6 6 9\n 144 3 3 6 6 8\n 144 3 3 6 6 7\n 144 3 3 5 6 6\n 144 3 3 4 6 6\n 144 2 3 3 6 6\n 144 2 2 6 6 A Sixes over Deuces\n 144 2 2 6 6 K\n 144 2 2 6 6 Q\n 144 2 2 6 6 J\n 144 2 2 6 6 T\n 144 2 2 6 6 9\n 144 2 2 6 6 8\n 144 2 2 6 6 7\n 144 2 2 5 6 6\n 144 2 2 4 6 6\n 144 2 2 3 6 6\n 144 4 4 5 5 A Fives over Fours\n 144 4 4 5 5 K\n 144 4 4 5 5 Q\n 144 4 4 5 5 J\n 144 4 4 5 5 T\n 144 4 4 5 5 9\n 144 4 4 5 5 8\n 144 4 4 5 5 7\n 144 4 4 5 5 6\n 144 3 4 4 5 5\n 144 2 4 4 5 5\n 144 3 3 5 5 A Fives over Treys\n 144 3 3 5 5 K\n 144 3 3 5 5 Q\n 144 3 3 5 5 J\n 144 3 3 5 5 T\n 144 3 3 5 5 9\n 144 3 3 5 5 8\n 144 3 3 5 5 7\n 144 3 3 5 5 6\n 144 3 3 4 5 5\n 144 2 3 3 5 5\n 144 2 2 5 5 A Fives over Deuces\n 144 2 2 5 5 K\n 144 2 2 5 5 Q\n 144 2 2 5 5 J\n 144 2 2 5 5 T\n 144 2 2 5 5 9\n 144 2 2 5 5 8\n 144 2 2 5 5 7\n 144 2 2 5 5 6\n 144 2 2 4 5 5\n 144 2 2 3 5 5\n 144 3 3 4 4 A Fours over Treys\n 144 3 3 4 4 K\n 144 3 3 4 4 Q\n 144 3 3 4 4 J\n 144 3 3 4 4 T\n 144 3 3 4 4 9\n 144 3 3 4 4 8\n 144 3 3 4 4 7\n 144 3 3 4 4 6\n 144 3 3 4 4 5\n 144 3 3 4 4 2\n 144 2 2 4 4 A Fours over Deuces\n 144 2 2 4 4 K\n 144 2 2 4 4 Q\n 144 2 2 4 4 J\n 144 2 2 4 4 T\n 144 2 2 4 4 9\n 144 2 2 4 4 8\n 144 2 2 4 4 7\n 144 2 2 4 4 6\n 144 2 2 4 4 5\n 144 2 2 4 4 3\n 144 2 2 3 3 A Treys over Deuces\n 144 2 2 3 3 K\n 144 2 2 3 3 Q\n 144 2 2 3 3 J\n 144 2 2 3 3 T\n 144 2 2 3 3 9\n 144 2 2 3 3 8\n 144 2 2 3 3 7\n 144 2 2 3 3 6\n 144 2 2 3 3 5\n 144 2 2 3 3 4\n 384 J Q K A A Pair of Aces ONE PAIR\n 384 T Q K A A\n 384 9 Q K A A\n 384 8 Q K A A\n 384 7 Q K A A\n 384 6 Q K A A\n 384 5 Q K A A\n 384 4 Q K A A\n 384 3 Q K A A\n 384 2 Q K A A\n 384 T J K A A\n 384 9 J K A A\n 384 8 J K A A\n 384 7 J K A A\n 384 6 J K A A\n 384 5 J K A A\n 384 4 J K A A\n 384 3 J K A A\n 384 2 J K A A\n 384 9 T K A A\n 384 8 T K A A\n 384 7 T K A A\n 384 6 T K A A\n 384 5 T K A A\n 384 4 T K A A\n 384 3 T K A A\n 384 2 T K A A\n 384 8 9 K A A\n 384 7 9 K A A\n 384 6 9 K A A\n 384 5 9 K A A\n 384 4 9 K A A\n 384 3 9 K A A\n 384 2 9 K A A\n 384 7 8 K A A\n 384 6 8 K A A\n 384 5 8 K A A\n 384 4 8 K A A\n 384 3 8 K A A\n 384 2 8 K A A\n 384 6 7 K A A\n 384 5 7 K A A\n 384 4 7 K A A\n 384 3 7 K A A\n 384 2 7 K A A\n 384 5 6 K A A\n 384 4 6 K A A\n 384 3 6 K A A\n 384 2 6 K A A\n 384 4 5 K A A\n 384 3 5 K A A\n 384 2 5 K A A\n 384 3 4 K A A\n 384 2 4 K A A\n 384 2 3 K A A\n 384 T J Q A A\n 384 9 J Q A A\n 384 8 J Q A A\n 384 7 J Q A A\n 384 6 J Q A A\n 384 5 J Q A A\n 384 4 J Q A A\n 384 3 J Q A A\n 384 2 J Q A A\n 384 9 T Q A A\n 384 8 T Q A A\n 384 7 T Q A A\n 384 6 T Q A A\n 384 5 T Q A A\n 384 4 T Q A A\n 384 3 T Q A A\n 384 2 T Q A A\n 384 8 9 Q A A\n 384 7 9 Q A A\n 384 6 9 Q A A\n 384 5 9 Q A A\n 384 4 9 Q A A\n 384 3 9 Q A A\n 384 2 9 Q A A\n 384 7 8 Q A A\n 384 6 8 Q A A\n 384 5 8 Q A A\n 384 4 8 Q A A\n 384 3 8 Q A A\n 384 2 8 Q A A\n 384 6 7 Q A A\n 384 5 7 Q A A\n 384 4 7 Q A A\n 384 3 7 Q A A\n 384 2 7 Q A A\n 384 5 6 Q A A\n 384 4 6 Q A A\n 384 3 6 Q A A\n 384 2 6 Q A A\n 384 4 5 Q A A\n 384 3 5 Q A A\n 384 2 5 Q A A\n 384 3 4 Q A A\n 384 2 4 Q A A\n 384 2 3 Q A A\n 384 9 T J A A\n 384 8 T J A A\n 384 7 T J A A\n 384 6 T J A A\n 384 5 T J A A\n 384 4 T J A A\n 384 3 T J A A\n 384 2 T J A A\n 384 8 9 J A A\n 384 7 9 J A A\n 384 6 9 J A A\n 384 5 9 J A A\n 384 4 9 J A A\n 384 3 9 J A A\n 384 2 9 J A A\n 384 7 8 J A A\n 384 6 8 J A A\n 384 5 8 J A A\n 384 4 8 J A A\n 384 3 8 J A A\n 384 2 8 J A A\n 384 6 7 J A A\n 384 5 7 J A A\n 384 4 7 J A A\n 384 3 7 J A A\n 384 2 7 J A A\n 384 5 6 J A A\n 384 4 6 J A A\n 384 3 6 J A A\n 384 2 6 J A A\n 384 4 5 J A A\n 384 3 5 J A A\n 384 2 5 J A A\n 384 3 4 J A A\n 384 2 4 J A A\n 384 2 3 J A A\n 384 8 9 T A A\n 384 7 9 T A A\n 384 6 9 T A A\n 384 5 9 T A A\n 384 4 9 T A A\n 384 3 9 T A A\n 384 2 9 T A A\n 384 7 8 T A A\n 384 6 8 T A A\n 384 5 8 T A A\n 384 4 8 T A A\n 384 3 8 T A A\n 384 2 8 T A A\n 384 6 7 T A A\n 384 5 7 T A A\n 384 4 7 T A A\n 384 3 7 T A A\n 384 2 7 T A A\n 384 5 6 T A A\n 384 4 6 T A A\n 384 3 6 T A A\n 384 2 6 T A A\n 384 4 5 T A A\n 384 3 5 T A A\n 384 2 5 T A A\n 384 3 4 T A A\n 384 2 4 T A A\n 384 2 3 T A A\n 384 7 8 9 A A\n 384 6 8 9 A A\n 384 5 8 9 A A\n 384 4 8 9 A A\n 384 3 8 9 A A\n 384 2 8 9 A A\n 384 6 7 9 A A\n 384 5 7 9 A A\n 384 4 7 9 A A\n 384 3 7 9 A A\n 384 2 7 9 A A\n 384 5 6 9 A A\n 384 4 6 9 A A\n 384 3 6 9 A A\n 384 2 6 9 A A\n 384 4 5 9 A A\n 384 3 5 9 A A\n 384 2 5 9 A A\n 384 3 4 9 A A\n 384 2 4 9 A A\n 384 2 3 9 A A\n 384 6 7 8 A A\n 384 5 7 8 A A\n 384 4 7 8 A A\n 384 3 7 8 A A\n 384 2 7 8 A A\n 384 5 6 8 A A\n 384 4 6 8 A A\n 384 3 6 8 A A\n 384 2 6 8 A A\n 384 4 5 8 A A\n 384 3 5 8 A A\n 384 2 5 8 A A\n 384 3 4 8 A A\n 384 2 4 8 A A\n 384 2 3 8 A A\n 384 5 6 7 A A\n 384 4 6 7 A A\n 384 3 6 7 A A\n 384 2 6 7 A A\n 384 4 5 7 A A\n 384 3 5 7 A A\n 384 2 5 7 A A\n 384 3 4 7 A A\n 384 2 4 7 A A\n 384 2 3 7 A A\n 384 4 5 6 A A\n 384 3 5 6 A A\n 384 2 5 6 A A\n 384 3 4 6 A A\n 384 2 4 6 A A\n 384 2 3 6 A A\n 384 3 4 5 A A\n 384 2 4 5 A A\n 384 2 3 5 A A\n 384 2 3 4 A A\n 384 J Q K K A Pair of Kings\n 384 T Q K K A\n 384 9 Q K K A\n 384 8 Q K K A\n 384 7 Q K K A\n 384 6 Q K K A\n 384 5 Q K K A\n 384 4 Q K K A\n 384 3 Q K K A\n 384 2 Q K K A\n 384 T J K K A\n 384 9 J K K A\n 384 8 J K K A\n 384 7 J K K A\n 384 6 J K K A\n 384 5 J K K A\n 384 4 J K K A\n 384 3 J K K A\n 384 2 J K K A\n 384 9 T K K A\n 384 8 T K K A\n 384 7 T K K A\n 384 6 T K K A\n 384 5 T K K A\n 384 4 T K K A\n 384 3 T K K A\n 384 2 T K K A\n 384 8 9 K K A\n 384 7 9 K K A\n 384 6 9 K K A\n 384 5 9 K K A\n 384 4 9 K K A\n 384 3 9 K K A\n 384 2 9 K K A\n 384 7 8 K K A\n 384 6 8 K K A\n 384 5 8 K K A\n 384 4 8 K K A\n 384 3 8 K K A\n 384 2 8 K K A\n 384 6 7 K K A\n 384 5 7 K K A\n 384 4 7 K K A\n 384 3 7 K K A\n 384 2 7 K K A\n 384 5 6 K K A\n 384 4 6 K K A\n 384 3 6 K K A\n 384 2 6 K K A\n 384 4 5 K K A\n 384 3 5 K K A\n 384 2 5 K K A\n 384 3 4 K K A\n 384 2 4 K K A\n 384 2 3 K K A\n 384 T J Q K K\n 384 9 J Q K K\n 384 8 J Q K K\n 384 7 J Q K K\n 384 6 J Q K K\n 384 5 J Q K K\n 384 4 J Q K K\n 384 3 J Q K K\n 384 2 J Q K K\n 384 9 T Q K K\n 384 8 T Q K K\n 384 7 T Q K K\n 384 6 T Q K K\n 384 5 T Q K K\n 384 4 T Q K K\n 384 3 T Q K K\n 384 2 T Q K K\n 384 8 9 Q K K\n 384 7 9 Q K K\n 384 6 9 Q K K\n 384 5 9 Q K K\n 384 4 9 Q K K\n 384 3 9 Q K K\n 384 2 9 Q K K\n 384 7 8 Q K K\n 384 6 8 Q K K\n 384 5 8 Q K K\n 384 4 8 Q K K\n 384 3 8 Q K K\n 384 2 8 Q K K\n 384 6 7 Q K K\n 384 5 7 Q K K\n 384 4 7 Q K K\n 384 3 7 Q K K\n 384 2 7 Q K K\n 384 5 6 Q K K\n 384 4 6 Q K K\n 384 3 6 Q K K\n 384 2 6 Q K K\n 384 4 5 Q K K\n 384 3 5 Q K K\n 384 2 5 Q K K\n 384 3 4 Q K K\n 384 2 4 Q K K\n 384 2 3 Q K K\n 384 9 T J K K\n 384 8 T J K K\n 384 7 T J K K\n 384 6 T J K K\n 384 5 T J K K\n 384 4 T J K K\n 384 3 T J K K\n 384 2 T J K K\n 384 8 9 J K K\n 384 7 9 J K K\n 384 6 9 J K K\n 384 5 9 J K K\n 384 4 9 J K K\n 384 3 9 J K K\n 384 2 9 J K K\n 384 7 8 J K K\n 384 6 8 J K K\n 384 5 8 J K K\n 384 4 8 J K K\n 384 3 8 J K K\n 384 2 8 J K K\n 384 6 7 J K K\n 384 5 7 J K K\n 384 4 7 J K K\n 384 3 7 J K K\n 384 2 7 J K K\n 384 5 6 J K K\n 384 4 6 J K K\n 384 3 6 J K K\n 384 2 6 J K K\n 384 4 5 J K K\n 384 3 5 J K K\n 384 2 5 J K K\n 384 3 4 J K K\n 384 2 4 J K K\n 384 2 3 J K K\n 384 8 9 T K K\n 384 7 9 T K K\n 384 6 9 T K K\n 384 5 9 T K K\n 384 4 9 T K K\n 384 3 9 T K K\n 384 2 9 T K K\n 384 7 8 T K K\n 384 6 8 T K K\n 384 5 8 T K K\n 384 4 8 T K K\n 384 3 8 T K K\n 384 2 8 T K K\n 384 6 7 T K K\n 384 5 7 T K K\n 384 4 7 T K K\n 384 3 7 T K K\n 384 2 7 T K K\n 384 5 6 T K K\n 384 4 6 T K K\n 384 3 6 T K K\n 384 2 6 T K K\n 384 4 5 T K K\n 384 3 5 T K K\n 384 2 5 T K K\n 384 3 4 T K K\n 384 2 4 T K K\n 384 2 3 T K K\n 384 7 8 9 K K\n 384 6 8 9 K K\n 384 5 8 9 K K\n 384 4 8 9 K K\n 384 3 8 9 K K\n 384 2 8 9 K K\n 384 6 7 9 K K\n 384 5 7 9 K K\n 384 4 7 9 K K\n 384 3 7 9 K K\n 384 2 7 9 K K\n 384 5 6 9 K K\n 384 4 6 9 K K\n 384 3 6 9 K K\n 384 2 6 9 K K\n 384 4 5 9 K K\n 384 3 5 9 K K\n 384 2 5 9 K K\n 384 3 4 9 K K\n 384 2 4 9 K K\n 384 2 3 9 K K\n 384 6 7 8 K K\n 384 5 7 8 K K\n 384 4 7 8 K K\n 384 3 7 8 K K\n 384 2 7 8 K K\n 384 5 6 8 K K\n 384 4 6 8 K K\n 384 3 6 8 K K\n 384 2 6 8 K K\n 384 4 5 8 K K\n 384 3 5 8 K K\n 384 2 5 8 K K\n 384 3 4 8 K K\n 384 2 4 8 K K\n 384 2 3 8 K K\n 384 5 6 7 K K\n 384 4 6 7 K K\n 384 3 6 7 K K\n 384 2 6 7 K K\n 384 4 5 7 K K\n 384 3 5 7 K K\n 384 2 5 7 K K\n 384 3 4 7 K K\n 384 2 4 7 K K\n 384 2 3 7 K K\n 384 4 5 6 K K\n 384 3 5 6 K K\n 384 2 5 6 K K\n 384 3 4 6 K K\n 384 2 4 6 K K\n 384 2 3 6 K K\n 384 3 4 5 K K\n 384 2 4 5 K K\n 384 2 3 5 K K\n 384 2 3 4 K K\n 384 J Q Q K A Pair of Queens\n 384 T Q Q K A\n 384 9 Q Q K A\n 384 8 Q Q K A\n 384 7 Q Q K A\n 384 6 Q Q K A\n 384 5 Q Q K A\n 384 4 Q Q K A\n 384 3 Q Q K A\n 384 2 Q Q K A\n 384 T J Q Q A\n 384 9 J Q Q A\n 384 8 J Q Q A\n 384 7 J Q Q A\n 384 6 J Q Q A\n 384 5 J Q Q A\n 384 4 J Q Q A\n 384 3 J Q Q A\n 384 2 J Q Q A\n 384 9 T Q Q A\n 384 8 T Q Q A\n 384 7 T Q Q A\n 384 6 T Q Q A\n 384 5 T Q Q A\n 384 4 T Q Q A\n 384 3 T Q Q A\n 384 2 T Q Q A\n 384 8 9 Q Q A\n 384 7 9 Q Q A\n 384 6 9 Q Q A\n 384 5 9 Q Q A\n 384 4 9 Q Q A\n 384 3 9 Q Q A\n 384 2 9 Q Q A\n 384 7 8 Q Q A\n 384 6 8 Q Q A\n 384 5 8 Q Q A\n 384 4 8 Q Q A\n 384 3 8 Q Q A\n 384 2 8 Q Q A\n 384 6 7 Q Q A\n 384 5 7 Q Q A\n 384 4 7 Q Q A\n 384 3 7 Q Q A\n 384 2 7 Q Q A\n 384 5 6 Q Q A\n 384 4 6 Q Q A\n 384 3 6 Q Q A\n 384 2 6 Q Q A\n 384 4 5 Q Q A\n 384 3 5 Q Q A\n 384 2 5 Q Q A\n 384 3 4 Q Q A\n 384 2 4 Q Q A\n 384 2 3 Q Q A\n 384 T J Q Q K\n 384 9 J Q Q K\n 384 8 J Q Q K\n 384 7 J Q Q K\n 384 6 J Q Q K\n 384 5 J Q Q K\n 384 4 J Q Q K\n 384 3 J Q Q K\n 384 2 J Q Q K\n 384 9 T Q Q K\n 384 8 T Q Q K\n 384 7 T Q Q K\n 384 6 T Q Q K\n 384 5 T Q Q K\n 384 4 T Q Q K\n 384 3 T Q Q K\n 384 2 T Q Q K\n 384 8 9 Q Q K\n 384 7 9 Q Q K\n 384 6 9 Q Q K\n 384 5 9 Q Q K\n 384 4 9 Q Q K\n 384 3 9 Q Q K\n 384 2 9 Q Q K\n 384 7 8 Q Q K\n 384 6 8 Q Q K\n 384 5 8 Q Q K\n 384 4 8 Q Q K\n 384 3 8 Q Q K\n 384 2 8 Q Q K\n 384 6 7 Q Q K\n 384 5 7 Q Q K\n 384 4 7 Q Q K\n 384 3 7 Q Q K\n 384 2 7 Q Q K\n 384 5 6 Q Q K\n 384 4 6 Q Q K\n 384 3 6 Q Q K\n 384 2 6 Q Q K\n 384 4 5 Q Q K\n 384 3 5 Q Q K\n 384 2 5 Q Q K\n 384 3 4 Q Q K\n 384 2 4 Q Q K\n 384 2 3 Q Q K\n 384 9 T J Q Q\n 384 8 T J Q Q\n 384 7 T J Q Q\n 384 6 T J Q Q\n 384 5 T J Q Q\n 384 4 T J Q Q\n 384 3 T J Q Q\n 384 2 T J Q Q\n 384 8 9 J Q Q\n 384 7 9 J Q Q\n 384 6 9 J Q Q\n 384 5 9 J Q Q\n 384 4 9 J Q Q\n 384 3 9 J Q Q\n 384 2 9 J Q Q\n 384 7 8 J Q Q\n 384 6 8 J Q Q\n 384 5 8 J Q Q\n 384 4 8 J Q Q\n 384 3 8 J Q Q\n 384 2 8 J Q Q\n 384 6 7 J Q Q\n 384 5 7 J Q Q\n 384 4 7 J Q Q\n 384 3 7 J Q Q\n 384 2 7 J Q Q\n 384 5 6 J Q Q\n 384 4 6 J Q Q\n 384 3 6 J Q Q\n 384 2 6 J Q Q\n 384 4 5 J Q Q\n 384 3 5 J Q Q\n 384 2 5 J Q Q\n 384 3 4 J Q Q\n 384 2 4 J Q Q\n 384 2 3 J Q Q\n 384 8 9 T Q Q\n 384 7 9 T Q Q\n 384 6 9 T Q Q\n 384 5 9 T Q Q\n 384 4 9 T Q Q\n 384 3 9 T Q Q\n 384 2 9 T Q Q\n 384 7 8 T Q Q\n 384 6 8 T Q Q\n 384 5 8 T Q Q\n 384 4 8 T Q Q\n 384 3 8 T Q Q\n 384 2 8 T Q Q\n 384 6 7 T Q Q\n 384 5 7 T Q Q\n 384 4 7 T Q Q\n 384 3 7 T Q Q\n 384 2 7 T Q Q\n 384 5 6 T Q Q\n 384 4 6 T Q Q\n 384 3 6 T Q Q\n 384 2 6 T Q Q\n 384 4 5 T Q Q\n 384 3 5 T Q Q\n 384 2 5 T Q Q\n 384 3 4 T Q Q\n 384 2 4 T Q Q\n 384 2 3 T Q Q\n 384 7 8 9 Q Q\n 384 6 8 9 Q Q\n 384 5 8 9 Q Q\n 384 4 8 9 Q Q\n 384 3 8 9 Q Q\n 384 2 8 9 Q Q\n 384 6 7 9 Q Q\n 384 5 7 9 Q Q\n 384 4 7 9 Q Q\n 384 3 7 9 Q Q\n 384 2 7 9 Q Q\n 384 5 6 9 Q Q\n 384 4 6 9 Q Q\n 384 3 6 9 Q Q\n 384 2 6 9 Q Q\n 384 4 5 9 Q Q\n 384 3 5 9 Q Q\n 384 2 5 9 Q Q\n 384 3 4 9 Q Q\n 384 2 4 9 Q Q\n 384 2 3 9 Q Q\n 384 6 7 8 Q Q\n 384 5 7 8 Q Q\n 384 4 7 8 Q Q\n 384 3 7 8 Q Q\n 384 2 7 8 Q Q\n 384 5 6 8 Q Q\n 384 4 6 8 Q Q\n 384 3 6 8 Q Q\n 384 2 6 8 Q Q\n 384 4 5 8 Q Q\n 384 3 5 8 Q Q\n 384 2 5 8 Q Q\n 384 3 4 8 Q Q\n 384 2 4 8 Q Q\n 384 2 3 8 Q Q\n 384 5 6 7 Q Q\n 384 4 6 7 Q Q\n 384 3 6 7 Q Q\n 384 2 6 7 Q Q\n 384 4 5 7 Q Q\n 384 3 5 7 Q Q\n 384 2 5 7 Q Q\n 384 3 4 7 Q Q\n 384 2 4 7 Q Q\n 384 2 3 7 Q Q\n 384 4 5 6 Q Q\n 384 3 5 6 Q Q\n 384 2 5 6 Q Q\n 384 3 4 6 Q Q\n 384 2 4 6 Q Q\n 384 2 3 6 Q Q\n 384 3 4 5 Q Q\n 384 2 4 5 Q Q\n 384 2 3 5 Q Q\n 384 2 3 4 Q Q\n 384 J J Q K A Pair of Jacks\n 384 T J J K A\n 384 9 J J K A\n 384 8 J J K A\n 384 7 J J K A\n 384 6 J J K A\n 384 5 J J K A\n 384 4 J J K A\n 384 3 J J K A\n 384 2 J J K A\n 384 T J J Q A\n 384 9 J J Q A\n 384 8 J J Q A\n 384 7 J J Q A\n 384 6 J J Q A\n 384 5 J J Q A\n 384 4 J J Q A\n 384 3 J J Q A\n 384 2 J J Q A\n 384 9 T J J A\n 384 8 T J J A\n 384 7 T J J A\n 384 6 T J J A\n 384 5 T J J A\n 384 4 T J J A\n 384 3 T J J A\n 384 2 T J J A\n 384 8 9 J J A\n 384 7 9 J J A\n 384 6 9 J J A\n 384 5 9 J J A\n 384 4 9 J J A\n 384 3 9 J J A\n 384 2 9 J J A\n 384 7 8 J J A\n 384 6 8 J J A\n 384 5 8 J J A\n 384 4 8 J J A\n 384 3 8 J J A\n 384 2 8 J J A\n 384 6 7 J J A\n 384 5 7 J J A\n 384 4 7 J J A\n 384 3 7 J J A\n 384 2 7 J J A\n 384 5 6 J J A\n 384 4 6 J J A\n 384 3 6 J J A\n 384 2 6 J J A\n 384 4 5 J J A\n 384 3 5 J J A\n 384 2 5 J J A\n 384 3 4 J J A\n 384 2 4 J J A\n 384 2 3 J J A\n 384 T J J Q K\n 384 9 J J Q K\n 384 8 J J Q K\n 384 7 J J Q K\n 384 6 J J Q K\n 384 5 J J Q K\n 384 4 J J Q K\n 384 3 J J Q K\n 384 2 J J Q K\n 384 9 T J J K\n 384 8 T J J K\n 384 7 T J J K\n 384 6 T J J K\n 384 5 T J J K\n 384 4 T J J K\n 384 3 T J J K\n 384 2 T J J K\n 384 8 9 J J K\n 384 7 9 J J K\n 384 6 9 J J K\n 384 5 9 J J K\n 384 4 9 J J K\n 384 3 9 J J K\n 384 2 9 J J K\n 384 7 8 J J K\n 384 6 8 J J K\n 384 5 8 J J K\n 384 4 8 J J K\n 384 3 8 J J K\n 384 2 8 J J K\n 384 6 7 J J K\n 384 5 7 J J K\n 384 4 7 J J K\n 384 3 7 J J K\n 384 2 7 J J K\n 384 5 6 J J K\n 384 4 6 J J K\n 384 3 6 J J K\n 384 2 6 J J K\n 384 4 5 J J K\n 384 3 5 J J K\n 384 2 5 J J K\n 384 3 4 J J K\n 384 2 4 J J K\n 384 2 3 J J K\n 384 9 T J J Q\n 384 8 T J J Q\n 384 7 T J J Q\n 384 6 T J J Q\n 384 5 T J J Q\n 384 4 T J J Q\n 384 3 T J J Q\n 384 2 T J J Q\n 384 8 9 J J Q\n 384 7 9 J J Q\n 384 6 9 J J Q\n 384 5 9 J J Q\n 384 4 9 J J Q\n 384 3 9 J J Q\n 384 2 9 J J Q\n 384 7 8 J J Q\n 384 6 8 J J Q\n 384 5 8 J J Q\n 384 4 8 J J Q\n 384 3 8 J J Q\n 384 2 8 J J Q\n 384 6 7 J J Q\n 384 5 7 J J Q\n 384 4 7 J J Q\n 384 3 7 J J Q\n 384 2 7 J J Q\n 384 5 6 J J Q\n 384 4 6 J J Q\n 384 3 6 J J Q\n 384 2 6 J J Q\n 384 4 5 J J Q\n 384 3 5 J J Q\n 384 2 5 J J Q\n 384 3 4 J J Q\n 384 2 4 J J Q\n 384 2 3 J J Q\n 384 8 9 T J J\n 384 7 9 T J J\n 384 6 9 T J J\n 384 5 9 T J J\n 384 4 9 T J J\n 384 3 9 T J J\n 384 2 9 T J J\n 384 7 8 T J J\n 384 6 8 T J J\n 384 5 8 T J J\n 384 4 8 T J J\n 384 3 8 T J J\n 384 2 8 T J J\n 384 6 7 T J J\n 384 5 7 T J J\n 384 4 7 T J J\n 384 3 7 T J J\n 384 2 7 T J J\n 384 5 6 T J J\n 384 4 6 T J J\n 384 3 6 T J J\n 384 2 6 T J J\n 384 4 5 T J J\n 384 3 5 T J J\n 384 2 5 T J J\n 384 3 4 T J J\n 384 2 4 T J J\n 384 2 3 T J J\n 384 7 8 9 J J\n 384 6 8 9 J J\n 384 5 8 9 J J\n 384 4 8 9 J J\n 384 3 8 9 J J\n 384 2 8 9 J J\n 384 6 7 9 J J\n 384 5 7 9 J J\n 384 4 7 9 J J\n 384 3 7 9 J J\n 384 2 7 9 J J\n 384 5 6 9 J J\n 384 4 6 9 J J\n 384 3 6 9 J J\n 384 2 6 9 J J\n 384 4 5 9 J J\n 384 3 5 9 J J\n 384 2 5 9 J J\n 384 3 4 9 J J\n 384 2 4 9 J J\n 384 2 3 9 J J\n 384 6 7 8 J J\n 384 5 7 8 J J\n 384 4 7 8 J J\n 384 3 7 8 J J\n 384 2 7 8 J J\n 384 5 6 8 J J\n 384 4 6 8 J J\n 384 3 6 8 J J\n 384 2 6 8 J J\n 384 4 5 8 J J\n 384 3 5 8 J J\n 384 2 5 8 J J\n 384 3 4 8 J J\n 384 2 4 8 J J\n 384 2 3 8 J J\n 384 5 6 7 J J\n 384 4 6 7 J J\n 384 3 6 7 J J\n 384 2 6 7 J J\n 384 4 5 7 J J\n 384 3 5 7 J J\n 384 2 5 7 J J\n 384 3 4 7 J J\n 384 2 4 7 J J\n 384 2 3 7 J J\n 384 4 5 6 J J\n 384 3 5 6 J J\n 384 2 5 6 J J\n 384 3 4 6 J J\n 384 2 4 6 J J\n 384 2 3 6 J J\n 384 3 4 5 J J\n 384 2 4 5 J J\n 384 2 3 5 J J\n 384 2 3 4 J J\n 384 T T Q K A Pair of Tens\n 384 T T J K A\n 384 9 T T K A\n 384 8 T T K A\n 384 7 T T K A\n 384 6 T T K A\n 384 5 T T K A\n 384 4 T T K A\n 384 3 T T K A\n 384 2 T T K A\n 384 T T J Q A\n 384 9 T T Q A\n 384 8 T T Q A\n 384 7 T T Q A\n 384 6 T T Q A\n 384 5 T T Q A\n 384 4 T T Q A\n 384 3 T T Q A\n 384 2 T T Q A\n 384 9 T T J A\n 384 8 T T J A\n 384 7 T T J A\n 384 6 T T J A\n 384 5 T T J A\n 384 4 T T J A\n 384 3 T T J A\n 384 2 T T J A\n 384 8 9 T T A\n 384 7 9 T T A\n 384 6 9 T T A\n 384 5 9 T T A\n 384 4 9 T T A\n 384 3 9 T T A\n 384 2 9 T T A\n 384 7 8 T T A\n 384 6 8 T T A\n 384 5 8 T T A\n 384 4 8 T T A\n 384 3 8 T T A\n 384 2 8 T T A\n 384 6 7 T T A\n 384 5 7 T T A\n 384 4 7 T T A\n 384 3 7 T T A\n 384 2 7 T T A\n 384 5 6 T T A\n 384 4 6 T T A\n 384 3 6 T T A\n 384 2 6 T T A\n 384 4 5 T T A\n 384 3 5 T T A\n 384 2 5 T T A\n 384 3 4 T T A\n 384 2 4 T T A\n 384 2 3 T T A\n 384 T T J Q K\n 384 9 T T Q K\n 384 8 T T Q K\n 384 7 T T Q K\n 384 6 T T Q K\n 384 5 T T Q K\n 384 4 T T Q K\n 384 3 T T Q K\n 384 2 T T Q K\n 384 9 T T J K\n 384 8 T T J K\n 384 7 T T J K\n 384 6 T T J K\n 384 5 T T J K\n 384 4 T T J K\n 384 3 T T J K\n 384 2 T T J K\n 384 8 9 T T K\n 384 7 9 T T K\n 384 6 9 T T K\n 384 5 9 T T K\n 384 4 9 T T K\n 384 3 9 T T K\n 384 2 9 T T K\n 384 7 8 T T K\n 384 6 8 T T K\n 384 5 8 T T K\n 384 4 8 T T K\n 384 3 8 T T K\n 384 2 8 T T K\n 384 6 7 T T K\n 384 5 7 T T K\n 384 4 7 T T K\n 384 3 7 T T K\n 384 2 7 T T K\n 384 5 6 T T K\n 384 4 6 T T K\n 384 3 6 T T K\n 384 2 6 T T K\n 384 4 5 T T K\n 384 3 5 T T K\n 384 2 5 T T K\n 384 3 4 T T K\n 384 2 4 T T K\n 384 2 3 T T K\n 384 9 T T J Q\n 384 8 T T J Q\n 384 7 T T J Q\n 384 6 T T J Q\n 384 5 T T J Q\n 384 4 T T J Q\n 384 3 T T J Q\n 384 2 T T J Q\n 384 8 9 T T Q\n 384 7 9 T T Q\n 384 6 9 T T Q\n 384 5 9 T T Q\n 384 4 9 T T Q\n 384 3 9 T T Q\n 384 2 9 T T Q\n 384 7 8 T T Q\n 384 6 8 T T Q\n 384 5 8 T T Q\n 384 4 8 T T Q\n 384 3 8 T T Q\n 384 2 8 T T Q\n 384 6 7 T T Q\n 384 5 7 T T Q\n 384 4 7 T T Q\n 384 3 7 T T Q\n 384 2 7 T T Q\n 384 5 6 T T Q\n 384 4 6 T T Q\n 384 3 6 T T Q\n 384 2 6 T T Q\n 384 4 5 T T Q\n 384 3 5 T T Q\n 384 2 5 T T Q\n 384 3 4 T T Q\n 384 2 4 T T Q\n 384 2 3 T T Q\n 384 8 9 T T J\n 384 7 9 T T J\n 384 6 9 T T J\n 384 5 9 T T J\n 384 4 9 T T J\n 384 3 9 T T J\n 384 2 9 T T J\n 384 7 8 T T J\n 384 6 8 T T J\n 384 5 8 T T J\n 384 4 8 T T J\n 384 3 8 T T J\n 384 2 8 T T J\n 384 6 7 T T J\n 384 5 7 T T J\n 384 4 7 T T J\n 384 3 7 T T J\n 384 2 7 T T J\n 384 5 6 T T J\n 384 4 6 T T J\n 384 3 6 T T J\n 384 2 6 T T J\n 384 4 5 T T J\n 384 3 5 T T J\n 384 2 5 T T J\n 384 3 4 T T J\n 384 2 4 T T J\n 384 2 3 T T J\n 384 7 8 9 T T\n 384 6 8 9 T T\n 384 5 8 9 T T\n 384 4 8 9 T T\n 384 3 8 9 T T\n 384 2 8 9 T T\n 384 6 7 9 T T\n 384 5 7 9 T T\n 384 4 7 9 T T\n 384 3 7 9 T T\n 384 2 7 9 T T\n 384 5 6 9 T T\n 384 4 6 9 T T\n 384 3 6 9 T T\n 384 2 6 9 T T\n 384 4 5 9 T T\n 384 3 5 9 T T\n 384 2 5 9 T T\n 384 3 4 9 T T\n 384 2 4 9 T T\n 384 2 3 9 T T\n 384 6 7 8 T T\n 384 5 7 8 T T\n 384 4 7 8 T T\n 384 3 7 8 T T\n 384 2 7 8 T T\n 384 5 6 8 T T\n 384 4 6 8 T T\n 384 3 6 8 T T\n 384 2 6 8 T T\n 384 4 5 8 T T\n 384 3 5 8 T T\n 384 2 5 8 T T\n 384 3 4 8 T T\n 384 2 4 8 T T\n 384 2 3 8 T T\n 384 5 6 7 T T\n 384 4 6 7 T T\n 384 3 6 7 T T\n 384 2 6 7 T T\n 384 4 5 7 T T\n 384 3 5 7 T T\n 384 2 5 7 T T\n 384 3 4 7 T T\n 384 2 4 7 T T\n 384 2 3 7 T T\n 384 4 5 6 T T\n 384 3 5 6 T T\n 384 2 5 6 T T\n 384 3 4 6 T T\n 384 2 4 6 T T\n 384 2 3 6 T T\n 384 3 4 5 T T\n 384 2 4 5 T T\n 384 2 3 5 T T\n 384 2 3 4 T T\n 384 9 9 Q K A Pair of Nines\n 384 9 9 J K A\n 384 9 9 T K A\n 384 8 9 9 K A\n 384 7 9 9 K A\n 384 6 9 9 K A\n 384 5 9 9 K A\n 384 4 9 9 K A\n 384 3 9 9 K A\n 384 2 9 9 K A\n 384 9 9 J Q A\n 384 9 9 T Q A\n 384 8 9 9 Q A\n 384 7 9 9 Q A\n 384 6 9 9 Q A\n 384 5 9 9 Q A\n 384 4 9 9 Q A\n 384 3 9 9 Q A\n 384 2 9 9 Q A\n 384 9 9 T J A\n 384 8 9 9 J A\n 384 7 9 9 J A\n 384 6 9 9 J A\n 384 5 9 9 J A\n 384 4 9 9 J A\n 384 3 9 9 J A\n 384 2 9 9 J A\n 384 8 9 9 T A\n 384 7 9 9 T A\n 384 6 9 9 T A\n 384 5 9 9 T A\n 384 4 9 9 T A\n 384 3 9 9 T A\n 384 2 9 9 T A\n 384 7 8 9 9 A\n 384 6 8 9 9 A\n 384 5 8 9 9 A\n 384 4 8 9 9 A\n 384 3 8 9 9 A\n 384 2 8 9 9 A\n 384 6 7 9 9 A\n 384 5 7 9 9 A\n 384 4 7 9 9 A\n 384 3 7 9 9 A\n 384 2 7 9 9 A\n 384 5 6 9 9 A\n 384 4 6 9 9 A\n 384 3 6 9 9 A\n 384 2 6 9 9 A\n 384 4 5 9 9 A\n 384 3 5 9 9 A\n 384 2 5 9 9 A\n 384 3 4 9 9 A\n 384 2 4 9 9 A\n 384 2 3 9 9 A\n 384 9 9 J Q K\n 384 9 9 T Q K\n 384 8 9 9 Q K\n 384 7 9 9 Q K\n 384 6 9 9 Q K\n 384 5 9 9 Q K\n 384 4 9 9 Q K\n 384 3 9 9 Q K\n 384 2 9 9 Q K\n 384 9 9 T J K\n 384 8 9 9 J K\n 384 7 9 9 J K\n 384 6 9 9 J K\n 384 5 9 9 J K\n 384 4 9 9 J K\n 384 3 9 9 J K\n 384 2 9 9 J K\n 384 8 9 9 T K\n 384 7 9 9 T K\n 384 6 9 9 T K\n 384 5 9 9 T K\n 384 4 9 9 T K\n 384 3 9 9 T K\n 384 2 9 9 T K\n 384 7 8 9 9 K\n 384 6 8 9 9 K\n 384 5 8 9 9 K\n 384 4 8 9 9 K\n 384 3 8 9 9 K\n 384 2 8 9 9 K\n 384 6 7 9 9 K\n 384 5 7 9 9 K\n 384 4 7 9 9 K\n 384 3 7 9 9 K\n 384 2 7 9 9 K\n 384 5 6 9 9 K\n 384 4 6 9 9 K\n 384 3 6 9 9 K\n 384 2 6 9 9 K\n 384 4 5 9 9 K\n 384 3 5 9 9 K\n 384 2 5 9 9 K\n 384 3 4 9 9 K\n 384 2 4 9 9 K\n 384 2 3 9 9 K\n 384 9 9 T J Q\n 384 8 9 9 J Q\n 384 7 9 9 J Q\n 384 6 9 9 J Q\n 384 5 9 9 J Q\n 384 4 9 9 J Q\n 384 3 9 9 J Q\n 384 2 9 9 J Q\n 384 8 9 9 T Q\n 384 7 9 9 T Q\n 384 6 9 9 T Q\n 384 5 9 9 T Q\n 384 4 9 9 T Q\n 384 3 9 9 T Q\n 384 2 9 9 T Q\n 384 7 8 9 9 Q\n 384 6 8 9 9 Q\n 384 5 8 9 9 Q\n 384 4 8 9 9 Q\n 384 3 8 9 9 Q\n 384 2 8 9 9 Q\n 384 6 7 9 9 Q\n 384 5 7 9 9 Q\n 384 4 7 9 9 Q\n 384 3 7 9 9 Q\n 384 2 7 9 9 Q\n 384 5 6 9 9 Q\n 384 4 6 9 9 Q\n 384 3 6 9 9 Q\n 384 2 6 9 9 Q\n 384 4 5 9 9 Q\n 384 3 5 9 9 Q\n 384 2 5 9 9 Q\n 384 3 4 9 9 Q\n 384 2 4 9 9 Q\n 384 2 3 9 9 Q\n 384 8 9 9 T J\n 384 7 9 9 T J\n 384 6 9 9 T J\n 384 5 9 9 T J\n 384 4 9 9 T J\n 384 3 9 9 T J\n 384 2 9 9 T J\n 384 7 8 9 9 J\n 384 6 8 9 9 J\n 384 5 8 9 9 J\n 384 4 8 9 9 J\n 384 3 8 9 9 J\n 384 2 8 9 9 J\n 384 6 7 9 9 J\n 384 5 7 9 9 J\n 384 4 7 9 9 J\n 384 3 7 9 9 J\n 384 2 7 9 9 J\n 384 5 6 9 9 J\n 384 4 6 9 9 J\n 384 3 6 9 9 J\n 384 2 6 9 9 J\n 384 4 5 9 9 J\n 384 3 5 9 9 J\n 384 2 5 9 9 J\n 384 3 4 9 9 J\n 384 2 4 9 9 J\n 384 2 3 9 9 J\n 384 7 8 9 9 T\n 384 6 8 9 9 T\n 384 5 8 9 9 T\n 384 4 8 9 9 T\n 384 3 8 9 9 T\n 384 2 8 9 9 T\n 384 6 7 9 9 T\n 384 5 7 9 9 T\n 384 4 7 9 9 T\n 384 3 7 9 9 T\n 384 2 7 9 9 T\n 384 5 6 9 9 T\n 384 4 6 9 9 T\n 384 3 6 9 9 T\n 384 2 6 9 9 T\n 384 4 5 9 9 T\n 384 3 5 9 9 T\n 384 2 5 9 9 T\n 384 3 4 9 9 T\n 384 2 4 9 9 T\n 384 2 3 9 9 T\n 384 6 7 8 9 9\n 384 5 7 8 9 9\n 384 4 7 8 9 9\n 384 3 7 8 9 9\n 384 2 7 8 9 9\n 384 5 6 8 9 9\n 384 4 6 8 9 9\n 384 3 6 8 9 9\n 384 2 6 8 9 9\n 384 4 5 8 9 9\n 384 3 5 8 9 9\n 384 2 5 8 9 9\n 384 3 4 8 9 9\n 384 2 4 8 9 9\n 384 2 3 8 9 9\n 384 5 6 7 9 9\n 384 4 6 7 9 9\n 384 3 6 7 9 9\n 384 2 6 7 9 9\n 384 4 5 7 9 9\n 384 3 5 7 9 9\n 384 2 5 7 9 9\n 384 3 4 7 9 9\n 384 2 4 7 9 9\n 384 2 3 7 9 9\n 384 4 5 6 9 9\n 384 3 5 6 9 9\n 384 2 5 6 9 9\n 384 3 4 6 9 9\n 384 2 4 6 9 9\n 384 2 3 6 9 9\n 384 3 4 5 9 9\n 384 2 4 5 9 9\n 384 2 3 5 9 9\n 384 2 3 4 9 9\n 384 8 8 Q K A Pair of Eights\n 384 8 8 J K A\n 384 8 8 T K A\n 384 8 8 9 K A\n 384 7 8 8 K A\n 384 6 8 8 K A\n 384 5 8 8 K A\n 384 4 8 8 K A\n 384 3 8 8 K A\n 384 2 8 8 K A\n 384 8 8 J Q A\n 384 8 8 T Q A\n 384 8 8 9 Q A\n 384 7 8 8 Q A\n 384 6 8 8 Q A\n 384 5 8 8 Q A\n 384 4 8 8 Q A\n 384 3 8 8 Q A\n 384 2 8 8 Q A\n 384 8 8 T J A\n 384 8 8 9 J A\n 384 7 8 8 J A\n 384 6 8 8 J A\n 384 5 8 8 J A\n 384 4 8 8 J A\n 384 3 8 8 J A\n 384 2 8 8 J A\n 384 8 8 9 T A\n 384 7 8 8 T A\n 384 6 8 8 T A\n 384 5 8 8 T A\n 384 4 8 8 T A\n 384 3 8 8 T A\n 384 2 8 8 T A\n 384 7 8 8 9 A\n 384 6 8 8 9 A\n 384 5 8 8 9 A\n 384 4 8 8 9 A\n 384 3 8 8 9 A\n 384 2 8 8 9 A\n 384 6 7 8 8 A\n 384 5 7 8 8 A\n 384 4 7 8 8 A\n 384 3 7 8 8 A\n 384 2 7 8 8 A\n 384 5 6 8 8 A\n 384 4 6 8 8 A\n 384 3 6 8 8 A\n 384 2 6 8 8 A\n 384 4 5 8 8 A\n 384 3 5 8 8 A\n 384 2 5 8 8 A\n 384 3 4 8 8 A\n 384 2 4 8 8 A\n 384 2 3 8 8 A\n 384 8 8 J Q K\n 384 8 8 T Q K\n 384 8 8 9 Q K\n 384 7 8 8 Q K\n 384 6 8 8 Q K\n 384 5 8 8 Q K\n 384 4 8 8 Q K\n 384 3 8 8 Q K\n 384 2 8 8 Q K\n 384 8 8 T J K\n 384 8 8 9 J K\n 384 7 8 8 J K\n 384 6 8 8 J K\n 384 5 8 8 J K\n 384 4 8 8 J K\n 384 3 8 8 J K\n 384 2 8 8 J K\n 384 8 8 9 T K\n 384 7 8 8 T K\n 384 6 8 8 T K\n 384 5 8 8 T K\n 384 4 8 8 T K\n 384 3 8 8 T K\n 384 2 8 8 T K\n 384 7 8 8 9 K\n 384 6 8 8 9 K\n 384 5 8 8 9 K\n 384 4 8 8 9 K\n 384 3 8 8 9 K\n 384 2 8 8 9 K\n 384 6 7 8 8 K\n 384 5 7 8 8 K\n 384 4 7 8 8 K\n 384 3 7 8 8 K\n 384 2 7 8 8 K\n 384 5 6 8 8 K\n 384 4 6 8 8 K\n 384 3 6 8 8 K\n 384 2 6 8 8 K\n 384 4 5 8 8 K\n 384 3 5 8 8 K\n 384 2 5 8 8 K\n 384 3 4 8 8 K\n 384 2 4 8 8 K\n 384 2 3 8 8 K\n 384 8 8 T J Q\n 384 8 8 9 J Q\n 384 7 8 8 J Q\n 384 6 8 8 J Q\n 384 5 8 8 J Q\n 384 4 8 8 J Q\n 384 3 8 8 J Q\n 384 2 8 8 J Q\n 384 8 8 9 T Q\n 384 7 8 8 T Q\n 384 6 8 8 T Q\n 384 5 8 8 T Q\n 384 4 8 8 T Q\n 384 3 8 8 T Q\n 384 2 8 8 T Q\n 384 7 8 8 9 Q\n 384 6 8 8 9 Q\n 384 5 8 8 9 Q\n 384 4 8 8 9 Q\n 384 3 8 8 9 Q\n 384 2 8 8 9 Q\n 384 6 7 8 8 Q\n 384 5 7 8 8 Q\n 384 4 7 8 8 Q\n 384 3 7 8 8 Q\n 384 2 7 8 8 Q\n 384 5 6 8 8 Q\n 384 4 6 8 8 Q\n 384 3 6 8 8 Q\n 384 2 6 8 8 Q\n 384 4 5 8 8 Q\n 384 3 5 8 8 Q\n 384 2 5 8 8 Q\n 384 3 4 8 8 Q\n 384 2 4 8 8 Q\n 384 2 3 8 8 Q\n 384 8 8 9 T J\n 384 7 8 8 T J\n 384 6 8 8 T J\n 384 5 8 8 T J\n 384 4 8 8 T J\n 384 3 8 8 T J\n 384 2 8 8 T J\n 384 7 8 8 9 J\n 384 6 8 8 9 J\n 384 5 8 8 9 J\n 384 4 8 8 9 J\n 384 3 8 8 9 J\n 384 2 8 8 9 J\n 384 6 7 8 8 J\n 384 5 7 8 8 J\n 384 4 7 8 8 J\n 384 3 7 8 8 J\n 384 2 7 8 8 J\n 384 5 6 8 8 J\n 384 4 6 8 8 J\n 384 3 6 8 8 J\n 384 2 6 8 8 J\n 384 4 5 8 8 J\n 384 3 5 8 8 J\n 384 2 5 8 8 J\n 384 3 4 8 8 J\n 384 2 4 8 8 J\n 384 2 3 8 8 J\n 384 7 8 8 9 T\n 384 6 8 8 9 T\n 384 5 8 8 9 T\n 384 4 8 8 9 T\n 384 3 8 8 9 T\n 384 2 8 8 9 T\n 384 6 7 8 8 T\n 384 5 7 8 8 T\n 384 4 7 8 8 T\n 384 3 7 8 8 T\n 384 2 7 8 8 T\n 384 5 6 8 8 T\n 384 4 6 8 8 T\n 384 3 6 8 8 T\n 384 2 6 8 8 T\n 384 4 5 8 8 T\n 384 3 5 8 8 T\n 384 2 5 8 8 T\n 384 3 4 8 8 T\n 384 2 4 8 8 T\n 384 2 3 8 8 T\n 384 6 7 8 8 9\n 384 5 7 8 8 9\n 384 4 7 8 8 9\n 384 3 7 8 8 9\n 384 2 7 8 8 9\n 384 5 6 8 8 9\n 384 4 6 8 8 9\n 384 3 6 8 8 9\n 384 2 6 8 8 9\n 384 4 5 8 8 9\n 384 3 5 8 8 9\n 384 2 5 8 8 9\n 384 3 4 8 8 9\n 384 2 4 8 8 9\n 384 2 3 8 8 9\n 384 5 6 7 8 8\n 384 4 6 7 8 8\n 384 3 6 7 8 8\n 384 2 6 7 8 8\n 384 4 5 7 8 8\n 384 3 5 7 8 8\n 384 2 5 7 8 8\n 384 3 4 7 8 8\n 384 2 4 7 8 8\n 384 2 3 7 8 8\n 384 4 5 6 8 8\n 384 3 5 6 8 8\n 384 2 5 6 8 8\n 384 3 4 6 8 8\n 384 2 4 6 8 8\n 384 2 3 6 8 8\n 384 3 4 5 8 8\n 384 2 4 5 8 8\n 384 2 3 5 8 8\n 384 2 3 4 8 8\n 384 7 7 Q K A Pair of Sevens\n 384 7 7 J K A\n 384 7 7 T K A\n 384 7 7 9 K A\n 384 7 7 8 K A\n 384 6 7 7 K A\n 384 5 7 7 K A\n 384 4 7 7 K A\n 384 3 7 7 K A\n 384 2 7 7 K A\n 384 7 7 J Q A\n 384 7 7 T Q A\n 384 7 7 9 Q A\n 384 7 7 8 Q A\n 384 6 7 7 Q A\n 384 5 7 7 Q A\n 384 4 7 7 Q A\n 384 3 7 7 Q A\n 384 2 7 7 Q A\n 384 7 7 T J A\n 384 7 7 9 J A\n 384 7 7 8 J A\n 384 6 7 7 J A\n 384 5 7 7 J A\n 384 4 7 7 J A\n 384 3 7 7 J A\n 384 2 7 7 J A\n 384 7 7 9 T A\n 384 7 7 8 T A\n 384 6 7 7 T A\n 384 5 7 7 T A\n 384 4 7 7 T A\n 384 3 7 7 T A\n 384 2 7 7 T A\n 384 7 7 8 9 A\n 384 6 7 7 9 A\n 384 5 7 7 9 A\n 384 4 7 7 9 A\n 384 3 7 7 9 A\n 384 2 7 7 9 A\n 384 6 7 7 8 A\n 384 5 7 7 8 A\n 384 4 7 7 8 A\n 384 3 7 7 8 A\n 384 2 7 7 8 A\n 384 5 6 7 7 A\n 384 4 6 7 7 A\n 384 3 6 7 7 A\n 384 2 6 7 7 A\n 384 4 5 7 7 A\n 384 3 5 7 7 A\n 384 2 5 7 7 A\n 384 3 4 7 7 A\n 384 2 4 7 7 A\n 384 2 3 7 7 A\n 384 7 7 J Q K\n 384 7 7 T Q K\n 384 7 7 9 Q K\n 384 7 7 8 Q K\n 384 6 7 7 Q K\n 384 5 7 7 Q K\n 384 4 7 7 Q K\n 384 3 7 7 Q K\n 384 2 7 7 Q K\n 384 7 7 T J K\n 384 7 7 9 J K\n 384 7 7 8 J K\n 384 6 7 7 J K\n 384 5 7 7 J K\n 384 4 7 7 J K\n 384 3 7 7 J K\n 384 2 7 7 J K\n 384 7 7 9 T K\n 384 7 7 8 T K\n 384 6 7 7 T K\n 384 5 7 7 T K\n 384 4 7 7 T K\n 384 3 7 7 T K\n 384 2 7 7 T K\n 384 7 7 8 9 K\n 384 6 7 7 9 K\n 384 5 7 7 9 K\n 384 4 7 7 9 K\n 384 3 7 7 9 K\n 384 2 7 7 9 K\n 384 6 7 7 8 K\n 384 5 7 7 8 K\n 384 4 7 7 8 K\n 384 3 7 7 8 K\n 384 2 7 7 8 K\n 384 5 6 7 7 K\n 384 4 6 7 7 K\n 384 3 6 7 7 K\n 384 2 6 7 7 K\n 384 4 5 7 7 K\n 384 3 5 7 7 K\n 384 2 5 7 7 K\n 384 3 4 7 7 K\n 384 2 4 7 7 K\n 384 2 3 7 7 K\n 384 7 7 T J Q\n 384 7 7 9 J Q\n 384 7 7 8 J Q\n 384 6 7 7 J Q\n 384 5 7 7 J Q\n 384 4 7 7 J Q\n 384 3 7 7 J Q\n 384 2 7 7 J Q\n 384 7 7 9 T Q\n 384 7 7 8 T Q\n 384 6 7 7 T Q\n 384 5 7 7 T Q\n 384 4 7 7 T Q\n 384 3 7 7 T Q\n 384 2 7 7 T Q\n 384 7 7 8 9 Q\n 384 6 7 7 9 Q\n 384 5 7 7 9 Q\n 384 4 7 7 9 Q\n 384 3 7 7 9 Q\n 384 2 7 7 9 Q\n 384 6 7 7 8 Q\n 384 5 7 7 8 Q\n 384 4 7 7 8 Q\n 384 3 7 7 8 Q\n 384 2 7 7 8 Q\n 384 5 6 7 7 Q\n 384 4 6 7 7 Q\n 384 3 6 7 7 Q\n 384 2 6 7 7 Q\n 384 4 5 7 7 Q\n 384 3 5 7 7 Q\n 384 2 5 7 7 Q\n 384 3 4 7 7 Q\n 384 2 4 7 7 Q\n 384 2 3 7 7 Q\n 384 7 7 9 T J\n 384 7 7 8 T J\n 384 6 7 7 T J\n 384 5 7 7 T J\n 384 4 7 7 T J\n 384 3 7 7 T J\n 384 2 7 7 T J\n 384 7 7 8 9 J\n 384 6 7 7 9 J\n 384 5 7 7 9 J\n 384 4 7 7 9 J\n 384 3 7 7 9 J\n 384 2 7 7 9 J\n 384 6 7 7 8 J\n 384 5 7 7 8 J\n 384 4 7 7 8 J\n 384 3 7 7 8 J\n 384 2 7 7 8 J\n 384 5 6 7 7 J\n 384 4 6 7 7 J\n 384 3 6 7 7 J\n 384 2 6 7 7 J\n 384 4 5 7 7 J\n 384 3 5 7 7 J\n 384 2 5 7 7 J\n 384 3 4 7 7 J\n 384 2 4 7 7 J\n 384 2 3 7 7 J\n 384 7 7 8 9 T\n 384 6 7 7 9 T\n 384 5 7 7 9 T\n 384 4 7 7 9 T\n 384 3 7 7 9 T\n 384 2 7 7 9 T\n 384 6 7 7 8 T\n 384 5 7 7 8 T\n 384 4 7 7 8 T\n 384 3 7 7 8 T\n 384 2 7 7 8 T\n 384 5 6 7 7 T\n 384 4 6 7 7 T\n 384 3 6 7 7 T\n 384 2 6 7 7 T\n 384 4 5 7 7 T\n 384 3 5 7 7 T\n 384 2 5 7 7 T\n 384 3 4 7 7 T\n 384 2 4 7 7 T\n 384 2 3 7 7 T\n 384 6 7 7 8 9\n 384 5 7 7 8 9\n 384 4 7 7 8 9\n 384 3 7 7 8 9\n 384 2 7 7 8 9\n 384 5 6 7 7 9\n 384 4 6 7 7 9\n 384 3 6 7 7 9\n 384 2 6 7 7 9\n 384 4 5 7 7 9\n 384 3 5 7 7 9\n 384 2 5 7 7 9\n 384 3 4 7 7 9\n 384 2 4 7 7 9\n 384 2 3 7 7 9\n 384 5 6 7 7 8\n 384 4 6 7 7 8\n 384 3 6 7 7 8\n 384 2 6 7 7 8\n 384 4 5 7 7 8\n 384 3 5 7 7 8\n 384 2 5 7 7 8\n 384 3 4 7 7 8\n 384 2 4 7 7 8\n 384 2 3 7 7 8\n 384 4 5 6 7 7\n 384 3 5 6 7 7\n 384 2 5 6 7 7\n 384 3 4 6 7 7\n 384 2 4 6 7 7\n 384 2 3 6 7 7\n 384 3 4 5 7 7\n 384 2 4 5 7 7\n 384 2 3 5 7 7\n 384 2 3 4 7 7\n 384 6 6 Q K A Pair of Sixes\n 384 6 6 J K A\n 384 6 6 T K A\n 384 6 6 9 K A\n 384 6 6 8 K A\n 384 6 6 7 K A\n 384 5 6 6 K A\n 384 4 6 6 K A\n 384 3 6 6 K A\n 384 2 6 6 K A\n 384 6 6 J Q A\n 384 6 6 T Q A\n 384 6 6 9 Q A\n 384 6 6 8 Q A\n 384 6 6 7 Q A\n 384 5 6 6 Q A\n 384 4 6 6 Q A\n 384 3 6 6 Q A\n 384 2 6 6 Q A\n 384 6 6 T J A\n 384 6 6 9 J A\n 384 6 6 8 J A\n 384 6 6 7 J A\n 384 5 6 6 J A\n 384 4 6 6 J A\n 384 3 6 6 J A\n 384 2 6 6 J A\n 384 6 6 9 T A\n 384 6 6 8 T A\n 384 6 6 7 T A\n 384 5 6 6 T A\n 384 4 6 6 T A\n 384 3 6 6 T A\n 384 2 6 6 T A\n 384 6 6 8 9 A\n 384 6 6 7 9 A\n 384 5 6 6 9 A\n 384 4 6 6 9 A\n 384 3 6 6 9 A\n 384 2 6 6 9 A\n 384 6 6 7 8 A\n 384 5 6 6 8 A\n 384 4 6 6 8 A\n 384 3 6 6 8 A\n 384 2 6 6 8 A\n 384 5 6 6 7 A\n 384 4 6 6 7 A\n 384 3 6 6 7 A\n 384 2 6 6 7 A\n 384 4 5 6 6 A\n 384 3 5 6 6 A\n 384 2 5 6 6 A\n 384 3 4 6 6 A\n 384 2 4 6 6 A\n 384 2 3 6 6 A\n 384 6 6 J Q K\n 384 6 6 T Q K\n 384 6 6 9 Q K\n 384 6 6 8 Q K\n 384 6 6 7 Q K\n 384 5 6 6 Q K\n 384 4 6 6 Q K\n 384 3 6 6 Q K\n 384 2 6 6 Q K\n 384 6 6 T J K\n 384 6 6 9 J K\n 384 6 6 8 J K\n 384 6 6 7 J K\n 384 5 6 6 J K\n 384 4 6 6 J K\n 384 3 6 6 J K\n 384 2 6 6 J K\n 384 6 6 9 T K\n 384 6 6 8 T K\n 384 6 6 7 T K\n 384 5 6 6 T K\n 384 4 6 6 T K\n 384 3 6 6 T K\n 384 2 6 6 T K\n 384 6 6 8 9 K\n 384 6 6 7 9 K\n 384 5 6 6 9 K\n 384 4 6 6 9 K\n 384 3 6 6 9 K\n 384 2 6 6 9 K\n 384 6 6 7 8 K\n 384 5 6 6 8 K\n 384 4 6 6 8 K\n 384 3 6 6 8 K\n 384 2 6 6 8 K\n 384 5 6 6 7 K\n 384 4 6 6 7 K\n 384 3 6 6 7 K\n 384 2 6 6 7 K\n 384 4 5 6 6 K\n 384 3 5 6 6 K\n 384 2 5 6 6 K\n 384 3 4 6 6 K\n 384 2 4 6 6 K\n 384 2 3 6 6 K\n 384 6 6 T J Q\n 384 6 6 9 J Q\n 384 6 6 8 J Q\n 384 6 6 7 J Q\n 384 5 6 6 J Q\n 384 4 6 6 J Q\n 384 3 6 6 J Q\n 384 2 6 6 J Q\n 384 6 6 9 T Q\n 384 6 6 8 T Q\n 384 6 6 7 T Q\n 384 5 6 6 T Q\n 384 4 6 6 T Q\n 384 3 6 6 T Q\n 384 2 6 6 T Q\n 384 6 6 8 9 Q\n 384 6 6 7 9 Q\n 384 5 6 6 9 Q\n 384 4 6 6 9 Q\n 384 3 6 6 9 Q\n 384 2 6 6 9 Q\n 384 6 6 7 8 Q\n 384 5 6 6 8 Q\n 384 4 6 6 8 Q\n 384 3 6 6 8 Q\n 384 2 6 6 8 Q\n 384 5 6 6 7 Q\n 384 4 6 6 7 Q\n 384 3 6 6 7 Q\n 384 2 6 6 7 Q\n 384 4 5 6 6 Q\n 384 3 5 6 6 Q\n 384 2 5 6 6 Q\n 384 3 4 6 6 Q\n 384 2 4 6 6 Q\n 384 2 3 6 6 Q\n 384 6 6 9 T J\n 384 6 6 8 T J\n 384 6 6 7 T J\n 384 5 6 6 T J\n 384 4 6 6 T J\n 384 3 6 6 T J\n 384 2 6 6 T J\n 384 6 6 8 9 J\n 384 6 6 7 9 J\n 384 5 6 6 9 J\n 384 4 6 6 9 J\n 384 3 6 6 9 J\n 384 2 6 6 9 J\n 384 6 6 7 8 J\n 384 5 6 6 8 J\n 384 4 6 6 8 J\n 384 3 6 6 8 J\n 384 2 6 6 8 J\n 384 5 6 6 7 J\n 384 4 6 6 7 J\n 384 3 6 6 7 J\n 384 2 6 6 7 J\n 384 4 5 6 6 J\n 384 3 5 6 6 J\n 384 2 5 6 6 J\n 384 3 4 6 6 J\n 384 2 4 6 6 J\n 384 2 3 6 6 J\n 384 6 6 8 9 T\n 384 6 6 7 9 T\n 384 5 6 6 9 T\n 384 4 6 6 9 T\n 384 3 6 6 9 T\n 384 2 6 6 9 T\n 384 6 6 7 8 T\n 384 5 6 6 8 T\n 384 4 6 6 8 T\n 384 3 6 6 8 T\n 384 2 6 6 8 T\n 384 5 6 6 7 T\n 384 4 6 6 7 T\n 384 3 6 6 7 T\n 384 2 6 6 7 T\n 384 4 5 6 6 T\n 384 3 5 6 6 T\n 384 2 5 6 6 T\n 384 3 4 6 6 T\n 384 2 4 6 6 T\n 384 2 3 6 6 T\n 384 6 6 7 8 9\n 384 5 6 6 8 9\n 384 4 6 6 8 9\n 384 3 6 6 8 9\n 384 2 6 6 8 9\n 384 5 6 6 7 9\n 384 4 6 6 7 9\n 384 3 6 6 7 9\n 384 2 6 6 7 9\n 384 4 5 6 6 9\n 384 3 5 6 6 9\n 384 2 5 6 6 9\n 384 3 4 6 6 9\n 384 2 4 6 6 9\n 384 2 3 6 6 9\n 384 5 6 6 7 8\n 384 4 6 6 7 8\n 384 3 6 6 7 8\n 384 2 6 6 7 8\n 384 4 5 6 6 8\n 384 3 5 6 6 8\n 384 2 5 6 6 8\n 384 3 4 6 6 8\n 384 2 4 6 6 8\n 384 2 3 6 6 8\n 384 4 5 6 6 7\n 384 3 5 6 6 7\n 384 2 5 6 6 7\n 384 3 4 6 6 7\n 384 2 4 6 6 7\n 384 2 3 6 6 7\n 384 3 4 5 6 6\n 384 2 4 5 6 6\n 384 2 3 5 6 6\n 384 2 3 4 6 6\n 384 5 5 Q K A Pair of Fives\n 384 5 5 J K A\n 384 5 5 T K A\n 384 5 5 9 K A\n 384 5 5 8 K A\n 384 5 5 7 K A\n 384 5 5 6 K A\n 384 4 5 5 K A\n 384 3 5 5 K A\n 384 2 5 5 K A\n 384 5 5 J Q A\n 384 5 5 T Q A\n 384 5 5 9 Q A\n 384 5 5 8 Q A\n 384 5 5 7 Q A\n 384 5 5 6 Q A\n 384 4 5 5 Q A\n 384 3 5 5 Q A\n 384 2 5 5 Q A\n 384 5 5 T J A\n 384 5 5 9 J A\n 384 5 5 8 J A\n 384 5 5 7 J A\n 384 5 5 6 J A\n 384 4 5 5 J A\n 384 3 5 5 J A\n 384 2 5 5 J A\n 384 5 5 9 T A\n 384 5 5 8 T A\n 384 5 5 7 T A\n 384 5 5 6 T A\n 384 4 5 5 T A\n 384 3 5 5 T A\n 384 2 5 5 T A\n 384 5 5 8 9 A\n 384 5 5 7 9 A\n 384 5 5 6 9 A\n 384 4 5 5 9 A\n 384 3 5 5 9 A\n 384 2 5 5 9 A\n 384 5 5 7 8 A\n 384 5 5 6 8 A\n 384 4 5 5 8 A\n 384 3 5 5 8 A\n 384 2 5 5 8 A\n 384 5 5 6 7 A\n 384 4 5 5 7 A\n 384 3 5 5 7 A\n 384 2 5 5 7 A\n 384 4 5 5 6 A\n 384 3 5 5 6 A\n 384 2 5 5 6 A\n 384 3 4 5 5 A\n 384 2 4 5 5 A\n 384 2 3 5 5 A\n 384 5 5 J Q K\n 384 5 5 T Q K\n 384 5 5 9 Q K\n 384 5 5 8 Q K\n 384 5 5 7 Q K\n 384 5 5 6 Q K\n 384 4 5 5 Q K\n 384 3 5 5 Q K\n 384 2 5 5 Q K\n 384 5 5 T J K\n 384 5 5 9 J K\n 384 5 5 8 J K\n 384 5 5 7 J K\n 384 5 5 6 J K\n 384 4 5 5 J K\n 384 3 5 5 J K\n 384 2 5 5 J K\n 384 5 5 9 T K\n 384 5 5 8 T K\n 384 5 5 7 T K\n 384 5 5 6 T K\n 384 4 5 5 T K\n 384 3 5 5 T K\n 384 2 5 5 T K\n 384 5 5 8 9 K\n 384 5 5 7 9 K\n 384 5 5 6 9 K\n 384 4 5 5 9 K\n 384 3 5 5 9 K\n 384 2 5 5 9 K\n 384 5 5 7 8 K\n 384 5 5 6 8 K\n 384 4 5 5 8 K\n 384 3 5 5 8 K\n 384 2 5 5 8 K\n 384 5 5 6 7 K\n 384 4 5 5 7 K\n 384 3 5 5 7 K\n 384 2 5 5 7 K\n 384 4 5 5 6 K\n 384 3 5 5 6 K\n 384 2 5 5 6 K\n 384 3 4 5 5 K\n 384 2 4 5 5 K\n 384 2 3 5 5 K\n 384 5 5 T J Q\n 384 5 5 9 J Q\n 384 5 5 8 J Q\n 384 5 5 7 J Q\n 384 5 5 6 J Q\n 384 4 5 5 J Q\n 384 3 5 5 J Q\n 384 2 5 5 J Q\n 384 5 5 9 T Q\n 384 5 5 8 T Q\n 384 5 5 7 T Q\n 384 5 5 6 T Q\n 384 4 5 5 T Q\n 384 3 5 5 T Q\n 384 2 5 5 T Q\n 384 5 5 8 9 Q\n 384 5 5 7 9 Q\n 384 5 5 6 9 Q\n 384 4 5 5 9 Q\n 384 3 5 5 9 Q\n 384 2 5 5 9 Q\n 384 5 5 7 8 Q\n 384 5 5 6 8 Q\n 384 4 5 5 8 Q\n 384 3 5 5 8 Q\n 384 2 5 5 8 Q\n 384 5 5 6 7 Q\n 384 4 5 5 7 Q\n 384 3 5 5 7 Q\n 384 2 5 5 7 Q\n 384 4 5 5 6 Q\n 384 3 5 5 6 Q\n 384 2 5 5 6 Q\n 384 3 4 5 5 Q\n 384 2 4 5 5 Q\n 384 2 3 5 5 Q\n 384 5 5 9 T J\n 384 5 5 8 T J\n 384 5 5 7 T J\n 384 5 5 6 T J\n 384 4 5 5 T J\n 384 3 5 5 T J\n 384 2 5 5 T J\n 384 5 5 8 9 J\n 384 5 5 7 9 J\n 384 5 5 6 9 J\n 384 4 5 5 9 J\n 384 3 5 5 9 J\n 384 2 5 5 9 J\n 384 5 5 7 8 J\n 384 5 5 6 8 J\n 384 4 5 5 8 J\n 384 3 5 5 8 J\n 384 2 5 5 8 J\n 384 5 5 6 7 J\n 384 4 5 5 7 J\n 384 3 5 5 7 J\n 384 2 5 5 7 J\n 384 4 5 5 6 J\n 384 3 5 5 6 J\n 384 2 5 5 6 J\n 384 3 4 5 5 J\n 384 2 4 5 5 J\n 384 2 3 5 5 J\n 384 5 5 8 9 T\n 384 5 5 7 9 T\n 384 5 5 6 9 T\n 384 4 5 5 9 T\n 384 3 5 5 9 T\n 384 2 5 5 9 T\n 384 5 5 7 8 T\n 384 5 5 6 8 T\n 384 4 5 5 8 T\n 384 3 5 5 8 T\n 384 2 5 5 8 T\n 384 5 5 6 7 T\n 384 4 5 5 7 T\n 384 3 5 5 7 T\n 384 2 5 5 7 T\n 384 4 5 5 6 T\n 384 3 5 5 6 T\n 384 2 5 5 6 T\n 384 3 4 5 5 T\n 384 2 4 5 5 T\n 384 2 3 5 5 T\n 384 5 5 7 8 9\n 384 5 5 6 8 9\n 384 4 5 5 8 9\n 384 3 5 5 8 9\n 384 2 5 5 8 9\n 384 5 5 6 7 9\n 384 4 5 5 7 9\n 384 3 5 5 7 9\n 384 2 5 5 7 9\n 384 4 5 5 6 9\n 384 3 5 5 6 9\n 384 2 5 5 6 9\n 384 3 4 5 5 9\n 384 2 4 5 5 9\n 384 2 3 5 5 9\n 384 5 5 6 7 8\n 384 4 5 5 7 8\n 384 3 5 5 7 8\n 384 2 5 5 7 8\n 384 4 5 5 6 8\n 384 3 5 5 6 8\n 384 2 5 5 6 8\n 384 3 4 5 5 8\n 384 2 4 5 5 8\n 384 2 3 5 5 8\n 384 4 5 5 6 7\n 384 3 5 5 6 7\n 384 2 5 5 6 7\n 384 3 4 5 5 7\n 384 2 4 5 5 7\n 384 2 3 5 5 7\n 384 3 4 5 5 6\n 384 2 4 5 5 6\n 384 2 3 5 5 6\n 384 2 3 4 5 5\n 384 4 4 Q K A Pair of Fours\n 384 4 4 J K A\n 384 4 4 T K A\n 384 4 4 9 K A\n 384 4 4 8 K A\n 384 4 4 7 K A\n 384 4 4 6 K A\n 384 4 4 5 K A\n 384 3 4 4 K A\n 384 2 4 4 K A\n 384 4 4 J Q A\n 384 4 4 T Q A\n 384 4 4 9 Q A\n 384 4 4 8 Q A\n 384 4 4 7 Q A\n 384 4 4 6 Q A\n 384 4 4 5 Q A\n 384 3 4 4 Q A\n 384 2 4 4 Q A\n 384 4 4 T J A\n 384 4 4 9 J A\n 384 4 4 8 J A\n 384 4 4 7 J A\n 384 4 4 6 J A\n 384 4 4 5 J A\n 384 3 4 4 J A\n 384 2 4 4 J A\n 384 4 4 9 T A\n 384 4 4 8 T A\n 384 4 4 7 T A\n 384 4 4 6 T A\n 384 4 4 5 T A\n 384 3 4 4 T A\n 384 2 4 4 T A\n 384 4 4 8 9 A\n 384 4 4 7 9 A\n 384 4 4 6 9 A\n 384 4 4 5 9 A\n 384 3 4 4 9 A\n 384 2 4 4 9 A\n 384 4 4 7 8 A\n 384 4 4 6 8 A\n 384 4 4 5 8 A\n 384 3 4 4 8 A\n 384 2 4 4 8 A\n 384 4 4 6 7 A\n 384 4 4 5 7 A\n 384 3 4 4 7 A\n 384 2 4 4 7 A\n 384 4 4 5 6 A\n 384 3 4 4 6 A\n 384 2 4 4 6 A\n 384 3 4 4 5 A\n 384 2 4 4 5 A\n 384 2 3 4 4 A\n 384 4 4 J Q K\n 384 4 4 T Q K\n 384 4 4 9 Q K\n 384 4 4 8 Q K\n 384 4 4 7 Q K\n 384 4 4 6 Q K\n 384 4 4 5 Q K\n 384 3 4 4 Q K\n 384 2 4 4 Q K\n 384 4 4 T J K\n 384 4 4 9 J K\n 384 4 4 8 J K\n 384 4 4 7 J K\n 384 4 4 6 J K\n 384 4 4 5 J K\n 384 3 4 4 J K\n 384 2 4 4 J K\n 384 4 4 9 T K\n 384 4 4 8 T K\n 384 4 4 7 T K\n 384 4 4 6 T K\n 384 4 4 5 T K\n 384 3 4 4 T K\n 384 2 4 4 T K\n 384 4 4 8 9 K\n 384 4 4 7 9 K\n 384 4 4 6 9 K\n 384 4 4 5 9 K\n 384 3 4 4 9 K\n 384 2 4 4 9 K\n 384 4 4 7 8 K\n 384 4 4 6 8 K\n 384 4 4 5 8 K\n 384 3 4 4 8 K\n 384 2 4 4 8 K\n 384 4 4 6 7 K\n 384 4 4 5 7 K\n 384 3 4 4 7 K\n 384 2 4 4 7 K\n 384 4 4 5 6 K\n 384 3 4 4 6 K\n 384 2 4 4 6 K\n 384 3 4 4 5 K\n 384 2 4 4 5 K\n 384 2 3 4 4 K\n 384 4 4 T J Q\n 384 4 4 9 J Q\n 384 4 4 8 J Q\n 384 4 4 7 J Q\n 384 4 4 6 J Q\n 384 4 4 5 J Q\n 384 3 4 4 J Q\n 384 2 4 4 J Q\n 384 4 4 9 T Q\n 384 4 4 8 T Q\n 384 4 4 7 T Q\n 384 4 4 6 T Q\n 384 4 4 5 T Q\n 384 3 4 4 T Q\n 384 2 4 4 T Q\n 384 4 4 8 9 Q\n 384 4 4 7 9 Q\n 384 4 4 6 9 Q\n 384 4 4 5 9 Q\n 384 3 4 4 9 Q\n 384 2 4 4 9 Q\n 384 4 4 7 8 Q\n 384 4 4 6 8 Q\n 384 4 4 5 8 Q\n 384 3 4 4 8 Q\n 384 2 4 4 8 Q\n 384 4 4 6 7 Q\n 384 4 4 5 7 Q\n 384 3 4 4 7 Q\n 384 2 4 4 7 Q\n 384 4 4 5 6 Q\n 384 3 4 4 6 Q\n 384 2 4 4 6 Q\n 384 3 4 4 5 Q\n 384 2 4 4 5 Q\n 384 2 3 4 4 Q\n 384 4 4 9 T J\n 384 4 4 8 T J\n 384 4 4 7 T J\n 384 4 4 6 T J\n 384 4 4 5 T J\n 384 3 4 4 T J\n 384 2 4 4 T J\n 384 4 4 8 9 J\n 384 4 4 7 9 J\n 384 4 4 6 9 J\n 384 4 4 5 9 J\n 384 3 4 4 9 J\n 384 2 4 4 9 J\n 384 4 4 7 8 J\n 384 4 4 6 8 J\n 384 4 4 5 8 J\n 384 3 4 4 8 J\n 384 2 4 4 8 J\n 384 4 4 6 7 J\n 384 4 4 5 7 J\n 384 3 4 4 7 J\n 384 2 4 4 7 J\n 384 4 4 5 6 J\n 384 3 4 4 6 J\n 384 2 4 4 6 J\n 384 3 4 4 5 J\n 384 2 4 4 5 J\n 384 2 3 4 4 J\n 384 4 4 8 9 T\n 384 4 4 7 9 T\n 384 4 4 6 9 T\n 384 4 4 5 9 T\n 384 3 4 4 9 T\n 384 2 4 4 9 T\n 384 4 4 7 8 T\n 384 4 4 6 8 T\n 384 4 4 5 8 T\n 384 3 4 4 8 T\n 384 2 4 4 8 T\n 384 4 4 6 7 T\n 384 4 4 5 7 T\n 384 3 4 4 7 T\n 384 2 4 4 7 T\n 384 4 4 5 6 T\n 384 3 4 4 6 T\n 384 2 4 4 6 T\n 384 3 4 4 5 T\n 384 2 4 4 5 T\n 384 2 3 4 4 T\n 384 4 4 7 8 9\n 384 4 4 6 8 9\n 384 4 4 5 8 9\n 384 3 4 4 8 9\n 384 2 4 4 8 9\n 384 4 4 6 7 9\n 384 4 4 5 7 9\n 384 3 4 4 7 9\n 384 2 4 4 7 9\n 384 4 4 5 6 9\n 384 3 4 4 6 9\n 384 2 4 4 6 9\n 384 3 4 4 5 9\n 384 2 4 4 5 9\n 384 2 3 4 4 9\n 384 4 4 6 7 8\n 384 4 4 5 7 8\n 384 3 4 4 7 8\n 384 2 4 4 7 8\n 384 4 4 5 6 8\n 384 3 4 4 6 8\n 384 2 4 4 6 8\n 384 3 4 4 5 8\n 384 2 4 4 5 8\n 384 2 3 4 4 8\n 384 4 4 5 6 7\n 384 3 4 4 6 7\n 384 2 4 4 6 7\n 384 3 4 4 5 7\n 384 2 4 4 5 7\n 384 2 3 4 4 7\n 384 3 4 4 5 6\n 384 2 4 4 5 6\n 384 2 3 4 4 6\n 384 2 3 4 4 5\n 384 3 3 Q K A Pair of Treys\n 384 3 3 J K A\n 384 3 3 T K A\n 384 3 3 9 K A\n 384 3 3 8 K A\n 384 3 3 7 K A\n 384 3 3 6 K A\n 384 3 3 5 K A\n 384 3 3 4 K A\n 384 2 3 3 K A\n 384 3 3 J Q A\n 384 3 3 T Q A\n 384 3 3 9 Q A\n 384 3 3 8 Q A\n 384 3 3 7 Q A\n 384 3 3 6 Q A\n 384 3 3 5 Q A\n 384 3 3 4 Q A\n 384 2 3 3 Q A\n 384 3 3 T J A\n 384 3 3 9 J A\n 384 3 3 8 J A\n 384 3 3 7 J A\n 384 3 3 6 J A\n 384 3 3 5 J A\n 384 3 3 4 J A\n 384 2 3 3 J A\n 384 3 3 9 T A\n 384 3 3 8 T A\n 384 3 3 7 T A\n 384 3 3 6 T A\n 384 3 3 5 T A\n 384 3 3 4 T A\n 384 2 3 3 T A\n 384 3 3 8 9 A\n 384 3 3 7 9 A\n 384 3 3 6 9 A\n 384 3 3 5 9 A\n 384 3 3 4 9 A\n 384 2 3 3 9 A\n 384 3 3 7 8 A\n 384 3 3 6 8 A\n 384 3 3 5 8 A\n 384 3 3 4 8 A\n 384 2 3 3 8 A\n 384 3 3 6 7 A\n 384 3 3 5 7 A\n 384 3 3 4 7 A\n 384 2 3 3 7 A\n 384 3 3 5 6 A\n 384 3 3 4 6 A\n 384 2 3 3 6 A\n 384 3 3 4 5 A\n 384 2 3 3 5 A\n 384 2 3 3 4 A\n 384 3 3 J Q K\n 384 3 3 T Q K\n 384 3 3 9 Q K\n 384 3 3 8 Q K\n 384 3 3 7 Q K\n 384 3 3 6 Q K\n 384 3 3 5 Q K\n 384 3 3 4 Q K\n 384 2 3 3 Q K\n 384 3 3 T J K\n 384 3 3 9 J K\n 384 3 3 8 J K\n 384 3 3 7 J K\n 384 3 3 6 J K\n 384 3 3 5 J K\n 384 3 3 4 J K\n 384 2 3 3 J K\n 384 3 3 9 T K\n 384 3 3 8 T K\n 384 3 3 7 T K\n 384 3 3 6 T K\n 384 3 3 5 T K\n 384 3 3 4 T K\n 384 2 3 3 T K\n 384 3 3 8 9 K\n 384 3 3 7 9 K\n 384 3 3 6 9 K\n 384 3 3 5 9 K\n 384 3 3 4 9 K\n 384 2 3 3 9 K\n 384 3 3 7 8 K\n 384 3 3 6 8 K\n 384 3 3 5 8 K\n 384 3 3 4 8 K\n 384 2 3 3 8 K\n 384 3 3 6 7 K\n 384 3 3 5 7 K\n 384 3 3 4 7 K\n 384 2 3 3 7 K\n 384 3 3 5 6 K\n 384 3 3 4 6 K\n 384 2 3 3 6 K\n 384 3 3 4 5 K\n 384 2 3 3 5 K\n 384 2 3 3 4 K\n 384 3 3 T J Q\n 384 3 3 9 J Q\n 384 3 3 8 J Q\n 384 3 3 7 J Q\n 384 3 3 6 J Q\n 384 3 3 5 J Q\n 384 3 3 4 J Q\n 384 2 3 3 J Q\n 384 3 3 9 T Q\n 384 3 3 8 T Q\n 384 3 3 7 T Q\n 384 3 3 6 T Q\n 384 3 3 5 T Q\n 384 3 3 4 T Q\n 384 2 3 3 T Q\n 384 3 3 8 9 Q\n 384 3 3 7 9 Q\n 384 3 3 6 9 Q\n 384 3 3 5 9 Q\n 384 3 3 4 9 Q\n 384 2 3 3 9 Q\n 384 3 3 7 8 Q\n 384 3 3 6 8 Q\n 384 3 3 5 8 Q\n 384 3 3 4 8 Q\n 384 2 3 3 8 Q\n 384 3 3 6 7 Q\n 384 3 3 5 7 Q\n 384 3 3 4 7 Q\n 384 2 3 3 7 Q\n 384 3 3 5 6 Q\n 384 3 3 4 6 Q\n 384 2 3 3 6 Q\n 384 3 3 4 5 Q\n 384 2 3 3 5 Q\n 384 2 3 3 4 Q\n 384 3 3 9 T J\n 384 3 3 8 T J\n 384 3 3 7 T J\n 384 3 3 6 T J\n 384 3 3 5 T J\n 384 3 3 4 T J\n 384 2 3 3 T J\n 384 3 3 8 9 J\n 384 3 3 7 9 J\n 384 3 3 6 9 J\n 384 3 3 5 9 J\n 384 3 3 4 9 J\n 384 2 3 3 9 J\n 384 3 3 7 8 J\n 384 3 3 6 8 J\n 384 3 3 5 8 J\n 384 3 3 4 8 J\n 384 2 3 3 8 J\n 384 3 3 6 7 J\n 384 3 3 5 7 J\n 384 3 3 4 7 J\n 384 2 3 3 7 J\n 384 3 3 5 6 J\n 384 3 3 4 6 J\n 384 2 3 3 6 J\n 384 3 3 4 5 J\n 384 2 3 3 5 J\n 384 2 3 3 4 J\n 384 3 3 8 9 T\n 384 3 3 7 9 T\n 384 3 3 6 9 T\n 384 3 3 5 9 T\n 384 3 3 4 9 T\n 384 2 3 3 9 T\n 384 3 3 7 8 T\n 384 3 3 6 8 T\n 384 3 3 5 8 T\n 384 3 3 4 8 T\n 384 2 3 3 8 T\n 384 3 3 6 7 T\n 384 3 3 5 7 T\n 384 3 3 4 7 T\n 384 2 3 3 7 T\n 384 3 3 5 6 T\n 384 3 3 4 6 T\n 384 2 3 3 6 T\n 384 3 3 4 5 T\n 384 2 3 3 5 T\n 384 2 3 3 4 T\n 384 3 3 7 8 9\n 384 3 3 6 8 9\n 384 3 3 5 8 9\n 384 3 3 4 8 9\n 384 2 3 3 8 9\n 384 3 3 6 7 9\n 384 3 3 5 7 9\n 384 3 3 4 7 9\n 384 2 3 3 7 9\n 384 3 3 5 6 9\n 384 3 3 4 6 9\n 384 2 3 3 6 9\n 384 3 3 4 5 9\n 384 2 3 3 5 9\n 384 2 3 3 4 9\n 384 3 3 6 7 8\n 384 3 3 5 7 8\n 384 3 3 4 7 8\n 384 2 3 3 7 8\n 384 3 3 5 6 8\n 384 3 3 4 6 8\n 384 2 3 3 6 8\n 384 3 3 4 5 8\n 384 2 3 3 5 8\n 384 2 3 3 4 8\n 384 3 3 5 6 7\n 384 3 3 4 6 7\n 384 2 3 3 6 7\n 384 3 3 4 5 7\n 384 2 3 3 5 7\n 384 2 3 3 4 7\n 384 3 3 4 5 6\n 384 2 3 3 5 6\n 384 2 3 3 4 6\n 384 2 3 3 4 5\n 384 2 2 Q K A Pair of Deuces\n 384 2 2 J K A\n 384 2 2 T K A\n 384 2 2 9 K A\n 384 2 2 8 K A\n 384 2 2 7 K A\n 384 2 2 6 K A\n 384 2 2 5 K A\n 384 2 2 4 K A\n 384 2 2 3 K A\n 384 2 2 J Q A\n 384 2 2 T Q A\n 384 2 2 9 Q A\n 384 2 2 8 Q A\n 384 2 2 7 Q A\n 384 2 2 6 Q A\n 384 2 2 5 Q A\n 384 2 2 4 Q A\n 384 2 2 3 Q A\n 384 2 2 T J A\n 384 2 2 9 J A\n 384 2 2 8 J A\n 384 2 2 7 J A\n 384 2 2 6 J A\n 384 2 2 5 J A\n 384 2 2 4 J A\n 384 2 2 3 J A\n 384 2 2 9 T A\n 384 2 2 8 T A\n 384 2 2 7 T A\n 384 2 2 6 T A\n 384 2 2 5 T A\n 384 2 2 4 T A\n 384 2 2 3 T A\n 384 2 2 8 9 A\n 384 2 2 7 9 A\n 384 2 2 6 9 A\n 384 2 2 5 9 A\n 384 2 2 4 9 A\n 384 2 2 3 9 A\n 384 2 2 7 8 A\n 384 2 2 6 8 A\n 384 2 2 5 8 A\n 384 2 2 4 8 A\n 384 2 2 3 8 A\n 384 2 2 6 7 A\n 384 2 2 5 7 A\n 384 2 2 4 7 A\n 384 2 2 3 7 A\n 384 2 2 5 6 A\n 384 2 2 4 6 A\n 384 2 2 3 6 A\n 384 2 2 4 5 A\n 384 2 2 3 5 A\n 384 2 2 3 4 A\n 384 2 2 J Q K\n 384 2 2 T Q K\n 384 2 2 9 Q K\n 384 2 2 8 Q K\n 384 2 2 7 Q K\n 384 2 2 6 Q K\n 384 2 2 5 Q K\n 384 2 2 4 Q K\n 384 2 2 3 Q K\n 384 2 2 T J K\n 384 2 2 9 J K\n 384 2 2 8 J K\n 384 2 2 7 J K\n 384 2 2 6 J K\n 384 2 2 5 J K\n 384 2 2 4 J K\n 384 2 2 3 J K\n 384 2 2 9 T K\n 384 2 2 8 T K\n 384 2 2 7 T K\n 384 2 2 6 T K\n 384 2 2 5 T K\n 384 2 2 4 T K\n 384 2 2 3 T K\n 384 2 2 8 9 K\n 384 2 2 7 9 K\n 384 2 2 6 9 K\n 384 2 2 5 9 K\n 384 2 2 4 9 K\n 384 2 2 3 9 K\n 384 2 2 7 8 K\n 384 2 2 6 8 K\n 384 2 2 5 8 K\n 384 2 2 4 8 K\n 384 2 2 3 8 K\n 384 2 2 6 7 K\n 384 2 2 5 7 K\n 384 2 2 4 7 K\n 384 2 2 3 7 K\n 384 2 2 5 6 K\n 384 2 2 4 6 K\n 384 2 2 3 6 K\n 384 2 2 4 5 K\n 384 2 2 3 5 K\n 384 2 2 3 4 K\n 384 2 2 T J Q\n 384 2 2 9 J Q\n 384 2 2 8 J Q\n 384 2 2 7 J Q\n 384 2 2 6 J Q\n 384 2 2 5 J Q\n 384 2 2 4 J Q\n 384 2 2 3 J Q\n 384 2 2 9 T Q\n 384 2 2 8 T Q\n 384 2 2 7 T Q\n 384 2 2 6 T Q\n 384 2 2 5 T Q\n 384 2 2 4 T Q\n 384 2 2 3 T Q\n 384 2 2 8 9 Q\n 384 2 2 7 9 Q\n 384 2 2 6 9 Q\n 384 2 2 5 9 Q\n 384 2 2 4 9 Q\n 384 2 2 3 9 Q\n 384 2 2 7 8 Q\n 384 2 2 6 8 Q\n 384 2 2 5 8 Q\n 384 2 2 4 8 Q\n 384 2 2 3 8 Q\n 384 2 2 6 7 Q\n 384 2 2 5 7 Q\n 384 2 2 4 7 Q\n 384 2 2 3 7 Q\n 384 2 2 5 6 Q\n 384 2 2 4 6 Q\n 384 2 2 3 6 Q\n 384 2 2 4 5 Q\n 384 2 2 3 5 Q\n 384 2 2 3 4 Q\n 384 2 2 9 T J\n 384 2 2 8 T J\n 384 2 2 7 T J\n 384 2 2 6 T J\n 384 2 2 5 T J\n 384 2 2 4 T J\n 384 2 2 3 T J\n 384 2 2 8 9 J\n 384 2 2 7 9 J\n 384 2 2 6 9 J\n 384 2 2 5 9 J\n 384 2 2 4 9 J\n 384 2 2 3 9 J\n 384 2 2 7 8 J\n 384 2 2 6 8 J\n 384 2 2 5 8 J\n 384 2 2 4 8 J\n 384 2 2 3 8 J\n 384 2 2 6 7 J\n 384 2 2 5 7 J\n 384 2 2 4 7 J\n 384 2 2 3 7 J\n 384 2 2 5 6 J\n 384 2 2 4 6 J\n 384 2 2 3 6 J\n 384 2 2 4 5 J\n 384 2 2 3 5 J\n 384 2 2 3 4 J\n 384 2 2 8 9 T\n 384 2 2 7 9 T\n 384 2 2 6 9 T\n 384 2 2 5 9 T\n 384 2 2 4 9 T\n 384 2 2 3 9 T\n 384 2 2 7 8 T\n 384 2 2 6 8 T\n 384 2 2 5 8 T\n 384 2 2 4 8 T\n 384 2 2 3 8 T\n 384 2 2 6 7 T\n 384 2 2 5 7 T\n 384 2 2 4 7 T\n 384 2 2 3 7 T\n 384 2 2 5 6 T\n 384 2 2 4 6 T\n 384 2 2 3 6 T\n 384 2 2 4 5 T\n 384 2 2 3 5 T\n 384 2 2 3 4 T\n 384 2 2 7 8 9\n 384 2 2 6 8 9\n 384 2 2 5 8 9\n 384 2 2 4 8 9\n 384 2 2 3 8 9\n 384 2 2 6 7 9\n 384 2 2 5 7 9\n 384 2 2 4 7 9\n 384 2 2 3 7 9\n 384 2 2 5 6 9\n 384 2 2 4 6 9\n 384 2 2 3 6 9\n 384 2 2 4 5 9\n 384 2 2 3 5 9\n 384 2 2 3 4 9\n 384 2 2 6 7 8\n 384 2 2 5 7 8\n 384 2 2 4 7 8\n 384 2 2 3 7 8\n 384 2 2 5 6 8\n 384 2 2 4 6 8\n 384 2 2 3 6 8\n 384 2 2 4 5 8\n 384 2 2 3 5 8\n 384 2 2 3 4 8\n 384 2 2 5 6 7\n 384 2 2 4 6 7\n 384 2 2 3 6 7\n 384 2 2 4 5 7\n 384 2 2 3 5 7\n 384 2 2 3 4 7\n 384 2 2 4 5 6\n 384 2 2 3 5 6\n 384 2 2 3 4 6\n 384 2 2 3 4 5\n1024 9 J Q K A Ace High HIGH CARD\n1024 8 J Q K A\n1024 7 J Q K A\n1024 6 J Q K A\n1024 5 J Q K A\n1024 4 J Q K A\n1024 3 J Q K A\n1024 2 J Q K A\n1024 9 T Q K A\n1024 8 T Q K A\n1024 7 T Q K A\n1024 6 T Q K A\n1024 5 T Q K A\n1024 4 T Q K A\n1024 3 T Q K A\n1024 2 T Q K A\n1024 8 9 Q K A\n1024 7 9 Q K A\n1024 6 9 Q K A\n1024 5 9 Q K A\n1024 4 9 Q K A\n1024 3 9 Q K A\n1024 2 9 Q K A\n1024 7 8 Q K A\n1024 6 8 Q K A\n1024 5 8 Q K A\n1024 4 8 Q K A\n1024 3 8 Q K A\n1024 2 8 Q K A\n1024 6 7 Q K A\n1024 5 7 Q K A\n1024 4 7 Q K A\n1024 3 7 Q K A\n1024 2 7 Q K A\n1024 5 6 Q K A\n1024 4 6 Q K A\n1024 3 6 Q K A\n1024 2 6 Q K A\n1024 4 5 Q K A\n1024 3 5 Q K A\n1024 2 5 Q K A\n1024 3 4 Q K A\n1024 2 4 Q K A\n1024 2 3 Q K A\n1024 9 T J K A\n1024 8 T J K A\n1024 7 T J K A\n1024 6 T J K A\n1024 5 T J K A\n1024 4 T J K A\n1024 3 T J K A\n1024 2 T J K A\n1024 8 9 J K A\n1024 7 9 J K A\n1024 6 9 J K A\n1024 5 9 J K A\n1024 4 9 J K A\n1024 3 9 J K A\n1024 2 9 J K A\n1024 7 8 J K A\n1024 6 8 J K A\n1024 5 8 J K A\n1024 4 8 J K A\n1024 3 8 J K A\n1024 2 8 J K A\n1024 6 7 J K A\n1024 5 7 J K A\n1024 4 7 J K A\n1024 3 7 J K A\n1024 2 7 J K A\n1024 5 6 J K A\n1024 4 6 J K A\n1024 3 6 J K A\n1024 2 6 J K A\n1024 4 5 J K A\n1024 3 5 J K A\n1024 2 5 J K A\n1024 3 4 J K A\n1024 2 4 J K A\n1024 2 3 J K A\n1024 8 9 T K A\n1024 7 9 T K A\n1024 6 9 T K A\n1024 5 9 T K A\n1024 4 9 T K A\n1024 3 9 T K A\n1024 2 9 T K A\n1024 7 8 T K A\n1024 6 8 T K A\n1024 5 8 T K A\n1024 4 8 T K A\n1024 3 8 T K A\n1024 2 8 T K A\n1024 6 7 T K A\n1024 5 7 T K A\n1024 4 7 T K A\n1024 3 7 T K A\n1024 2 7 T K A\n1024 5 6 T K A\n1024 4 6 T K A\n1024 3 6 T K A\n1024 2 6 T K A\n1024 4 5 T K A\n1024 3 5 T K A\n1024 2 5 T K A\n1024 3 4 T K A\n1024 2 4 T K A\n1024 2 3 T K A\n1024 7 8 9 K A\n1024 6 8 9 K A\n1024 5 8 9 K A\n1024 4 8 9 K A\n1024 3 8 9 K A\n1024 2 8 9 K A\n1024 6 7 9 K A\n1024 5 7 9 K A\n1024 4 7 9 K A\n1024 3 7 9 K A\n1024 2 7 9 K A\n1024 5 6 9 K A\n1024 4 6 9 K A\n1024 3 6 9 K A\n1024 2 6 9 K A\n1024 4 5 9 K A\n1024 3 5 9 K A\n1024 2 5 9 K A\n1024 3 4 9 K A\n1024 2 4 9 K A\n1024 2 3 9 K A\n1024 6 7 8 K A\n1024 5 7 8 K A\n1024 4 7 8 K A\n1024 3 7 8 K A\n1024 2 7 8 K A\n1024 5 6 8 K A\n1024 4 6 8 K A\n1024 3 6 8 K A\n1024 2 6 8 K A\n1024 4 5 8 K A\n1024 3 5 8 K A\n1024 2 5 8 K A\n1024 3 4 8 K A\n1024 2 4 8 K A\n1024 2 3 8 K A\n1024 5 6 7 K A\n1024 4 6 7 K A\n1024 3 6 7 K A\n1024 2 6 7 K A\n1024 4 5 7 K A\n1024 3 5 7 K A\n1024 2 5 7 K A\n1024 3 4 7 K A\n1024 2 4 7 K A\n1024 2 3 7 K A\n1024 4 5 6 K A\n1024 3 5 6 K A\n1024 2 5 6 K A\n1024 3 4 6 K A\n1024 2 4 6 K A\n1024 2 3 6 K A\n1024 3 4 5 K A\n1024 2 4 5 K A\n1024 2 3 5 K A\n1024 2 3 4 K A\n1024 9 T J Q A\n1024 8 T J Q A\n1024 7 T J Q A\n1024 6 T J Q A\n1024 5 T J Q A\n1024 4 T J Q A\n1024 3 T J Q A\n1024 2 T J Q A\n1024 8 9 J Q A\n1024 7 9 J Q A\n1024 6 9 J Q A\n1024 5 9 J Q A\n1024 4 9 J Q A\n1024 3 9 J Q A\n1024 2 9 J Q A\n1024 7 8 J Q A\n1024 6 8 J Q A\n1024 5 8 J Q A\n1024 4 8 J Q A\n1024 3 8 J Q A\n1024 2 8 J Q A\n1024 6 7 J Q A\n1024 5 7 J Q A\n1024 4 7 J Q A\n1024 3 7 J Q A\n1024 2 7 J Q A\n1024 5 6 J Q A\n1024 4 6 J Q A\n1024 3 6 J Q A\n1024 2 6 J Q A\n1024 4 5 J Q A\n1024 3 5 J Q A\n1024 2 5 J Q A\n1024 3 4 J Q A\n1024 2 4 J Q A\n1024 2 3 J Q A\n1024 8 9 T Q A\n1024 7 9 T Q A\n1024 6 9 T Q A\n1024 5 9 T Q A\n1024 4 9 T Q A\n1024 3 9 T Q A\n1024 2 9 T Q A\n1024 7 8 T Q A\n1024 6 8 T Q A\n1024 5 8 T Q A\n1024 4 8 T Q A\n1024 3 8 T Q A\n1024 2 8 T Q A\n1024 6 7 T Q A\n1024 5 7 T Q A\n1024 4 7 T Q A\n1024 3 7 T Q A\n1024 2 7 T Q A\n1024 5 6 T Q A\n1024 4 6 T Q A\n1024 3 6 T Q A\n1024 2 6 T Q A\n1024 4 5 T Q A\n1024 3 5 T Q A\n1024 2 5 T Q A\n1024 3 4 T Q A\n1024 2 4 T Q A\n1024 2 3 T Q A\n1024 7 8 9 Q A\n1024 6 8 9 Q A\n1024 5 8 9 Q A\n1024 4 8 9 Q A\n1024 3 8 9 Q A\n1024 2 8 9 Q A\n1024 6 7 9 Q A\n1024 5 7 9 Q A\n1024 4 7 9 Q A\n1024 3 7 9 Q A\n1024 2 7 9 Q A\n1024 5 6 9 Q A\n1024 4 6 9 Q A\n1024 3 6 9 Q A\n1024 2 6 9 Q A\n1024 4 5 9 Q A\n1024 3 5 9 Q A\n1024 2 5 9 Q A\n1024 3 4 9 Q A\n1024 2 4 9 Q A\n1024 2 3 9 Q A\n1024 6 7 8 Q A\n1024 5 7 8 Q A\n1024 4 7 8 Q A\n1024 3 7 8 Q A\n1024 2 7 8 Q A\n1024 5 6 8 Q A\n1024 4 6 8 Q A\n1024 3 6 8 Q A\n1024 2 6 8 Q A\n1024 4 5 8 Q A\n1024 3 5 8 Q A\n1024 2 5 8 Q A\n1024 3 4 8 Q A\n1024 2 4 8 Q A\n1024 2 3 8 Q A\n1024 5 6 7 Q A\n1024 4 6 7 Q A\n1024 3 6 7 Q A\n1024 2 6 7 Q A\n1024 4 5 7 Q A\n1024 3 5 7 Q A\n1024 2 5 7 Q A\n1024 3 4 7 Q A\n1024 2 4 7 Q A\n1024 2 3 7 Q A\n1024 4 5 6 Q A\n1024 3 5 6 Q A\n1024 2 5 6 Q A\n1024 3 4 6 Q A\n1024 2 4 6 Q A\n1024 2 3 6 Q A\n1024 3 4 5 Q A\n1024 2 4 5 Q A\n1024 2 3 5 Q A\n1024 2 3 4 Q A\n1024 8 9 T J A\n1024 7 9 T J A\n1024 6 9 T J A\n1024 5 9 T J A\n1024 4 9 T J A\n1024 3 9 T J A\n1024 2 9 T J A\n1024 7 8 T J A\n1024 6 8 T J A\n1024 5 8 T J A\n1024 4 8 T J A\n1024 3 8 T J A\n1024 2 8 T J A\n1024 6 7 T J A\n1024 5 7 T J A\n1024 4 7 T J A\n1024 3 7 T J A\n1024 2 7 T J A\n1024 5 6 T J A\n1024 4 6 T J A\n1024 3 6 T J A\n1024 2 6 T J A\n1024 4 5 T J A\n1024 3 5 T J A\n1024 2 5 T J A\n1024 3 4 T J A\n1024 2 4 T J A\n1024 2 3 T J A\n1024 7 8 9 J A\n1024 6 8 9 J A\n1024 5 8 9 J A\n1024 4 8 9 J A\n1024 3 8 9 J A\n1024 2 8 9 J A\n1024 6 7 9 J A\n1024 5 7 9 J A\n1024 4 7 9 J A\n1024 3 7 9 J A\n1024 2 7 9 J A\n1024 5 6 9 J A\n1024 4 6 9 J A\n1024 3 6 9 J A\n1024 2 6 9 J A\n1024 4 5 9 J A\n1024 3 5 9 J A\n1024 2 5 9 J A\n1024 3 4 9 J A\n1024 2 4 9 J A\n1024 2 3 9 J A\n1024 6 7 8 J A\n1024 5 7 8 J A\n1024 4 7 8 J A\n1024 3 7 8 J A\n1024 2 7 8 J A\n1024 5 6 8 J A\n1024 4 6 8 J A\n1024 3 6 8 J A\n1024 2 6 8 J A\n1024 4 5 8 J A\n1024 3 5 8 J A\n1024 2 5 8 J A\n1024 3 4 8 J A\n1024 2 4 8 J A\n1024 2 3 8 J A\n1024 5 6 7 J A\n1024 4 6 7 J A\n1024 3 6 7 J A\n1024 2 6 7 J A\n1024 4 5 7 J A\n1024 3 5 7 J A\n1024 2 5 7 J A\n1024 3 4 7 J A\n1024 2 4 7 J A\n1024 2 3 7 J A\n1024 4 5 6 J A\n1024 3 5 6 J A\n1024 2 5 6 J A\n1024 3 4 6 J A\n1024 2 4 6 J A\n1024 2 3 6 J A\n1024 3 4 5 J A\n1024 2 4 5 J A\n1024 2 3 5 J A\n1024 2 3 4 J A\n1024 7 8 9 T A\n1024 6 8 9 T A\n1024 5 8 9 T A\n1024 4 8 9 T A\n1024 3 8 9 T A\n1024 2 8 9 T A\n1024 6 7 9 T A\n1024 5 7 9 T A\n1024 4 7 9 T A\n1024 3 7 9 T A\n1024 2 7 9 T A\n1024 5 6 9 T A\n1024 4 6 9 T A\n1024 3 6 9 T A\n1024 2 6 9 T A\n1024 4 5 9 T A\n1024 3 5 9 T A\n1024 2 5 9 T A\n1024 3 4 9 T A\n1024 2 4 9 T A\n1024 2 3 9 T A\n1024 6 7 8 T A\n1024 5 7 8 T A\n1024 4 7 8 T A\n1024 3 7 8 T A\n1024 2 7 8 T A\n1024 5 6 8 T A\n1024 4 6 8 T A\n1024 3 6 8 T A\n1024 2 6 8 T A\n1024 4 5 8 T A\n1024 3 5 8 T A\n1024 2 5 8 T A\n1024 3 4 8 T A\n1024 2 4 8 T A\n1024 2 3 8 T A\n1024 5 6 7 T A\n1024 4 6 7 T A\n1024 3 6 7 T A\n1024 2 6 7 T A\n1024 4 5 7 T A\n1024 3 5 7 T A\n1024 2 5 7 T A\n1024 3 4 7 T A\n1024 2 4 7 T A\n1024 2 3 7 T A\n1024 4 5 6 T A\n1024 3 5 6 T A\n1024 2 5 6 T A\n1024 3 4 6 T A\n1024 2 4 6 T A\n1024 2 3 6 T A\n1024 3 4 5 T A\n1024 2 4 5 T A\n1024 2 3 5 T A\n1024 2 3 4 T A\n1024 6 7 8 9 A\n1024 5 7 8 9 A\n1024 4 7 8 9 A\n1024 3 7 8 9 A\n1024 2 7 8 9 A\n1024 5 6 8 9 A\n1024 4 6 8 9 A\n1024 3 6 8 9 A\n1024 2 6 8 9 A\n1024 4 5 8 9 A\n1024 3 5 8 9 A\n1024 2 5 8 9 A\n1024 3 4 8 9 A\n1024 2 4 8 9 A\n1024 2 3 8 9 A\n1024 5 6 7 9 A\n1024 4 6 7 9 A\n1024 3 6 7 9 A\n1024 2 6 7 9 A\n1024 4 5 7 9 A\n1024 3 5 7 9 A\n1024 2 5 7 9 A\n1024 3 4 7 9 A\n1024 2 4 7 9 A\n1024 2 3 7 9 A\n1024 4 5 6 9 A\n1024 3 5 6 9 A\n1024 2 5 6 9 A\n1024 3 4 6 9 A\n1024 2 4 6 9 A\n1024 2 3 6 9 A\n1024 3 4 5 9 A\n1024 2 4 5 9 A\n1024 2 3 5 9 A\n1024 2 3 4 9 A\n1024 5 6 7 8 A\n1024 4 6 7 8 A\n1024 3 6 7 8 A\n1024 2 6 7 8 A\n1024 4 5 7 8 A\n1024 3 5 7 8 A\n1024 2 5 7 8 A\n1024 3 4 7 8 A\n1024 2 4 7 8 A\n1024 2 3 7 8 A\n1024 4 5 6 8 A\n1024 3 5 6 8 A\n1024 2 5 6 8 A\n1024 3 4 6 8 A\n1024 2 4 6 8 A\n1024 2 3 6 8 A\n1024 3 4 5 8 A\n1024 2 4 5 8 A\n1024 2 3 5 8 A\n1024 2 3 4 8 A\n1024 4 5 6 7 A\n1024 3 5 6 7 A\n1024 2 5 6 7 A\n1024 3 4 6 7 A\n1024 2 4 6 7 A\n1024 2 3 6 7 A\n1024 3 4 5 7 A\n1024 2 4 5 7 A\n1024 2 3 5 7 A\n1024 2 3 4 7 A\n1024 3 4 5 6 A\n1024 2 4 5 6 A\n1024 2 3 5 6 A\n1024 2 3 4 6 A\n1024 8 T J Q K King High\n1024 7 T J Q K\n1024 6 T J Q K\n1024 5 T J Q K\n1024 4 T J Q K\n1024 3 T J Q K\n1024 2 T J Q K\n1024 8 9 J Q K\n1024 7 9 J Q K\n1024 6 9 J Q K\n1024 5 9 J Q K\n1024 4 9 J Q K\n1024 3 9 J Q K\n1024 2 9 J Q K\n1024 7 8 J Q K\n1024 6 8 J Q K\n1024 5 8 J Q K\n1024 4 8 J Q K\n1024 3 8 J Q K\n1024 2 8 J Q K\n1024 6 7 J Q K\n1024 5 7 J Q K\n1024 4 7 J Q K\n1024 3 7 J Q K\n1024 2 7 J Q K\n1024 5 6 J Q K\n1024 4 6 J Q K\n1024 3 6 J Q K\n1024 2 6 J Q K\n1024 4 5 J Q K\n1024 3 5 J Q K\n1024 2 5 J Q K\n1024 3 4 J Q K\n1024 2 4 J Q K\n1024 2 3 J Q K\n1024 8 9 T Q K\n1024 7 9 T Q K\n1024 6 9 T Q K\n1024 5 9 T Q K\n1024 4 9 T Q K\n1024 3 9 T Q K\n1024 2 9 T Q K\n1024 7 8 T Q K\n1024 6 8 T Q K\n1024 5 8 T Q K\n1024 4 8 T Q K\n1024 3 8 T Q K\n1024 2 8 T Q K\n1024 6 7 T Q K\n1024 5 7 T Q K\n1024 4 7 T Q K\n1024 3 7 T Q K\n1024 2 7 T Q K\n1024 5 6 T Q K\n1024 4 6 T Q K\n1024 3 6 T Q K\n1024 2 6 T Q K\n1024 4 5 T Q K\n1024 3 5 T Q K\n1024 2 5 T Q K\n1024 3 4 T Q K\n1024 2 4 T Q K\n1024 2 3 T Q K\n1024 7 8 9 Q K\n1024 6 8 9 Q K\n1024 5 8 9 Q K\n1024 4 8 9 Q K\n1024 3 8 9 Q K\n1024 2 8 9 Q K\n1024 6 7 9 Q K\n1024 5 7 9 Q K\n1024 4 7 9 Q K\n1024 3 7 9 Q K\n1024 2 7 9 Q K\n1024 5 6 9 Q K\n1024 4 6 9 Q K\n1024 3 6 9 Q K\n1024 2 6 9 Q K\n1024 4 5 9 Q K\n1024 3 5 9 Q K\n1024 2 5 9 Q K\n1024 3 4 9 Q K\n1024 2 4 9 Q K\n1024 2 3 9 Q K\n1024 6 7 8 Q K\n1024 5 7 8 Q K\n1024 4 7 8 Q K\n1024 3 7 8 Q K\n1024 2 7 8 Q K\n1024 5 6 8 Q K\n1024 4 6 8 Q K\n1024 3 6 8 Q K\n1024 2 6 8 Q K\n1024 4 5 8 Q K\n1024 3 5 8 Q K\n1024 2 5 8 Q K\n1024 3 4 8 Q K\n1024 2 4 8 Q K\n1024 2 3 8 Q K\n1024 5 6 7 Q K\n1024 4 6 7 Q K\n1024 3 6 7 Q K\n1024 2 6 7 Q K\n1024 4 5 7 Q K\n1024 3 5 7 Q K\n1024 2 5 7 Q K\n1024 3 4 7 Q K\n1024 2 4 7 Q K\n1024 2 3 7 Q K\n1024 4 5 6 Q K\n1024 3 5 6 Q K\n1024 2 5 6 Q K\n1024 3 4 6 Q K\n1024 2 4 6 Q K\n1024 2 3 6 Q K\n1024 3 4 5 Q K\n1024 2 4 5 Q K\n1024 2 3 5 Q K\n1024 2 3 4 Q K\n1024 8 9 T J K\n1024 7 9 T J K\n1024 6 9 T J K\n1024 5 9 T J K\n1024 4 9 T J K\n1024 3 9 T J K\n1024 2 9 T J K\n1024 7 8 T J K\n1024 6 8 T J K\n1024 5 8 T J K\n1024 4 8 T J K\n1024 3 8 T J K\n1024 2 8 T J K\n1024 6 7 T J K\n1024 5 7 T J K\n1024 4 7 T J K\n1024 3 7 T J K\n1024 2 7 T J K\n1024 5 6 T J K\n1024 4 6 T J K\n1024 3 6 T J K\n1024 2 6 T J K\n1024 4 5 T J K\n1024 3 5 T J K\n1024 2 5 T J K\n1024 3 4 T J K\n1024 2 4 T J K\n1024 2 3 T J K\n1024 7 8 9 J K\n1024 6 8 9 J K\n1024 5 8 9 J K\n1024 4 8 9 J K\n1024 3 8 9 J K\n1024 2 8 9 J K\n1024 6 7 9 J K\n1024 5 7 9 J K\n1024 4 7 9 J K\n1024 3 7 9 J K\n1024 2 7 9 J K\n1024 5 6 9 J K\n1024 4 6 9 J K\n1024 3 6 9 J K\n1024 2 6 9 J K\n1024 4 5 9 J K\n1024 3 5 9 J K\n1024 2 5 9 J K\n1024 3 4 9 J K\n1024 2 4 9 J K\n1024 2 3 9 J K\n1024 6 7 8 J K\n1024 5 7 8 J K\n1024 4 7 8 J K\n1024 3 7 8 J K\n1024 2 7 8 J K\n1024 5 6 8 J K\n1024 4 6 8 J K\n1024 3 6 8 J K\n1024 2 6 8 J K\n1024 4 5 8 J K\n1024 3 5 8 J K\n1024 2 5 8 J K\n1024 3 4 8 J K\n1024 2 4 8 J K\n1024 2 3 8 J K\n1024 5 6 7 J K\n1024 4 6 7 J K\n1024 3 6 7 J K\n1024 2 6 7 J K\n1024 4 5 7 J K\n1024 3 5 7 J K\n1024 2 5 7 J K\n1024 3 4 7 J K\n1024 2 4 7 J K\n1024 2 3 7 J K\n1024 4 5 6 J K\n1024 3 5 6 J K\n1024 2 5 6 J K\n1024 3 4 6 J K\n1024 2 4 6 J K\n1024 2 3 6 J K\n1024 3 4 5 J K\n1024 2 4 5 J K\n1024 2 3 5 J K\n1024 2 3 4 J K\n1024 7 8 9 T K\n1024 6 8 9 T K\n1024 5 8 9 T K\n1024 4 8 9 T K\n1024 3 8 9 T K\n1024 2 8 9 T K\n1024 6 7 9 T K\n1024 5 7 9 T K\n1024 4 7 9 T K\n1024 3 7 9 T K\n1024 2 7 9 T K\n1024 5 6 9 T K\n1024 4 6 9 T K\n1024 3 6 9 T K\n1024 2 6 9 T K\n1024 4 5 9 T K\n1024 3 5 9 T K\n1024 2 5 9 T K\n1024 3 4 9 T K\n1024 2 4 9 T K\n1024 2 3 9 T K\n1024 6 7 8 T K\n1024 5 7 8 T K\n1024 4 7 8 T K\n1024 3 7 8 T K\n1024 2 7 8 T K\n1024 5 6 8 T K\n1024 4 6 8 T K\n1024 3 6 8 T K\n1024 2 6 8 T K\n1024 4 5 8 T K\n1024 3 5 8 T K\n1024 2 5 8 T K\n1024 3 4 8 T K\n1024 2 4 8 T K\n1024 2 3 8 T K\n1024 5 6 7 T K\n1024 4 6 7 T K\n1024 3 6 7 T K\n1024 2 6 7 T K\n1024 4 5 7 T K\n1024 3 5 7 T K\n1024 2 5 7 T K\n1024 3 4 7 T K\n1024 2 4 7 T K\n1024 2 3 7 T K\n1024 4 5 6 T K\n1024 3 5 6 T K\n1024 2 5 6 T K\n1024 3 4 6 T K\n1024 2 4 6 T K\n1024 2 3 6 T K\n1024 3 4 5 T K\n1024 2 4 5 T K\n1024 2 3 5 T K\n1024 2 3 4 T K\n1024 6 7 8 9 K\n1024 5 7 8 9 K\n1024 4 7 8 9 K\n1024 3 7 8 9 K\n1024 2 7 8 9 K\n1024 5 6 8 9 K\n1024 4 6 8 9 K\n1024 3 6 8 9 K\n1024 2 6 8 9 K\n1024 4 5 8 9 K\n1024 3 5 8 9 K\n1024 2 5 8 9 K\n1024 3 4 8 9 K\n1024 2 4 8 9 K\n1024 2 3 8 9 K\n1024 5 6 7 9 K\n1024 4 6 7 9 K\n1024 3 6 7 9 K\n1024 2 6 7 9 K\n1024 4 5 7 9 K\n1024 3 5 7 9 K\n1024 2 5 7 9 K\n1024 3 4 7 9 K\n1024 2 4 7 9 K\n1024 2 3 7 9 K\n1024 4 5 6 9 K\n1024 3 5 6 9 K\n1024 2 5 6 9 K\n1024 3 4 6 9 K\n1024 2 4 6 9 K\n1024 2 3 6 9 K\n1024 3 4 5 9 K\n1024 2 4 5 9 K\n1024 2 3 5 9 K\n1024 2 3 4 9 K\n1024 5 6 7 8 K\n1024 4 6 7 8 K\n1024 3 6 7 8 K\n1024 2 6 7 8 K\n1024 4 5 7 8 K\n1024 3 5 7 8 K\n1024 2 5 7 8 K\n1024 3 4 7 8 K\n1024 2 4 7 8 K\n1024 2 3 7 8 K\n1024 4 5 6 8 K\n1024 3 5 6 8 K\n1024 2 5 6 8 K\n1024 3 4 6 8 K\n1024 2 4 6 8 K\n1024 2 3 6 8 K\n1024 3 4 5 8 K\n1024 2 4 5 8 K\n1024 2 3 5 8 K\n1024 2 3 4 8 K\n1024 4 5 6 7 K\n1024 3 5 6 7 K\n1024 2 5 6 7 K\n1024 3 4 6 7 K\n1024 2 4 6 7 K\n1024 2 3 6 7 K\n1024 3 4 5 7 K\n1024 2 4 5 7 K\n1024 2 3 5 7 K\n1024 2 3 4 7 K\n1024 3 4 5 6 K\n1024 2 4 5 6 K\n1024 2 3 5 6 K\n1024 2 3 4 6 K\n1024 2 3 4 5 K\n1024 7 9 T J Q Queen High\n1024 6 9 T J Q\n1024 5 9 T J Q\n1024 4 9 T J Q\n1024 3 9 T J Q\n1024 2 9 T J Q\n1024 7 8 T J Q\n1024 6 8 T J Q\n1024 5 8 T J Q\n1024 4 8 T J Q\n1024 3 8 T J Q\n1024 2 8 T J Q\n1024 6 7 T J Q\n1024 5 7 T J Q\n1024 4 7 T J Q\n1024 3 7 T J Q\n1024 2 7 T J Q\n1024 5 6 T J Q\n1024 4 6 T J Q\n1024 3 6 T J Q\n1024 2 6 T J Q\n1024 4 5 T J Q\n1024 3 5 T J Q\n1024 2 5 T J Q\n1024 3 4 T J Q\n1024 2 4 T J Q\n1024 2 3 T J Q\n1024 7 8 9 J Q\n1024 6 8 9 J Q\n1024 5 8 9 J Q\n1024 4 8 9 J Q\n1024 3 8 9 J Q\n1024 2 8 9 J Q\n1024 6 7 9 J Q\n1024 5 7 9 J Q\n1024 4 7 9 J Q\n1024 3 7 9 J Q\n1024 2 7 9 J Q\n1024 5 6 9 J Q\n1024 4 6 9 J Q\n1024 3 6 9 J Q\n1024 2 6 9 J Q\n1024 4 5 9 J Q\n1024 3 5 9 J Q\n1024 2 5 9 J Q\n1024 3 4 9 J Q\n1024 2 4 9 J Q\n1024 2 3 9 J Q\n1024 6 7 8 J Q\n1024 5 7 8 J Q\n1024 4 7 8 J Q\n1024 3 7 8 J Q\n1024 2 7 8 J Q\n1024 5 6 8 J Q\n1024 4 6 8 J Q\n1024 3 6 8 J Q\n1024 2 6 8 J Q\n1024 4 5 8 J Q\n1024 3 5 8 J Q\n1024 2 5 8 J Q\n1024 3 4 8 J Q\n1024 2 4 8 J Q\n1024 2 3 8 J Q\n1024 5 6 7 J Q\n1024 4 6 7 J Q\n1024 3 6 7 J Q\n1024 2 6 7 J Q\n1024 4 5 7 J Q\n1024 3 5 7 J Q\n1024 2 5 7 J Q\n1024 3 4 7 J Q\n1024 2 4 7 J Q\n1024 2 3 7 J Q\n1024 4 5 6 J Q\n1024 3 5 6 J Q\n1024 2 5 6 J Q\n1024 3 4 6 J Q\n1024 2 4 6 J Q\n1024 2 3 6 J Q\n1024 3 4 5 J Q\n1024 2 4 5 J Q\n1024 2 3 5 J Q\n1024 2 3 4 J Q\n1024 7 8 9 T Q\n1024 6 8 9 T Q\n1024 5 8 9 T Q\n1024 4 8 9 T Q\n1024 3 8 9 T Q\n1024 2 8 9 T Q\n1024 6 7 9 T Q\n1024 5 7 9 T Q\n1024 4 7 9 T Q\n1024 3 7 9 T Q\n1024 2 7 9 T Q\n1024 5 6 9 T Q\n1024 4 6 9 T Q\n1024 3 6 9 T Q\n1024 2 6 9 T Q\n1024 4 5 9 T Q\n1024 3 5 9 T Q\n1024 2 5 9 T Q\n1024 3 4 9 T Q\n1024 2 4 9 T Q\n1024 2 3 9 T Q\n1024 6 7 8 T Q\n1024 5 7 8 T Q\n1024 4 7 8 T Q\n1024 3 7 8 T Q\n1024 2 7 8 T Q\n1024 5 6 8 T Q\n1024 4 6 8 T Q\n1024 3 6 8 T Q\n1024 2 6 8 T Q\n1024 4 5 8 T Q\n1024 3 5 8 T Q\n1024 2 5 8 T Q\n1024 3 4 8 T Q\n1024 2 4 8 T Q\n1024 2 3 8 T Q\n1024 5 6 7 T Q\n1024 4 6 7 T Q\n1024 3 6 7 T Q\n1024 2 6 7 T Q\n1024 4 5 7 T Q\n1024 3 5 7 T Q\n1024 2 5 7 T Q\n1024 3 4 7 T Q\n1024 2 4 7 T Q\n1024 2 3 7 T Q\n1024 4 5 6 T Q\n1024 3 5 6 T Q\n1024 2 5 6 T Q\n1024 3 4 6 T Q\n1024 2 4 6 T Q\n1024 2 3 6 T Q\n1024 3 4 5 T Q\n1024 2 4 5 T Q\n1024 2 3 5 T Q\n1024 2 3 4 T Q\n1024 6 7 8 9 Q\n1024 5 7 8 9 Q\n1024 4 7 8 9 Q\n1024 3 7 8 9 Q\n1024 2 7 8 9 Q\n1024 5 6 8 9 Q\n1024 4 6 8 9 Q\n1024 3 6 8 9 Q\n1024 2 6 8 9 Q\n1024 4 5 8 9 Q\n1024 3 5 8 9 Q\n1024 2 5 8 9 Q\n1024 3 4 8 9 Q\n1024 2 4 8 9 Q\n1024 2 3 8 9 Q\n1024 5 6 7 9 Q\n1024 4 6 7 9 Q\n1024 3 6 7 9 Q\n1024 2 6 7 9 Q\n1024 4 5 7 9 Q\n1024 3 5 7 9 Q\n1024 2 5 7 9 Q\n1024 3 4 7 9 Q\n1024 2 4 7 9 Q\n1024 2 3 7 9 Q\n1024 4 5 6 9 Q\n1024 3 5 6 9 Q\n1024 2 5 6 9 Q\n1024 3 4 6 9 Q\n1024 2 4 6 9 Q\n1024 2 3 6 9 Q\n1024 3 4 5 9 Q\n1024 2 4 5 9 Q\n1024 2 3 5 9 Q\n1024 2 3 4 9 Q\n1024 5 6 7 8 Q\n1024 4 6 7 8 Q\n1024 3 6 7 8 Q\n1024 2 6 7 8 Q\n1024 4 5 7 8 Q\n1024 3 5 7 8 Q\n1024 2 5 7 8 Q\n1024 3 4 7 8 Q\n1024 2 4 7 8 Q\n1024 2 3 7 8 Q\n1024 4 5 6 8 Q\n1024 3 5 6 8 Q\n1024 2 5 6 8 Q\n1024 3 4 6 8 Q\n1024 2 4 6 8 Q\n1024 2 3 6 8 Q\n1024 3 4 5 8 Q\n1024 2 4 5 8 Q\n1024 2 3 5 8 Q\n1024 2 3 4 8 Q\n1024 4 5 6 7 Q\n1024 3 5 6 7 Q\n1024 2 5 6 7 Q\n1024 3 4 6 7 Q\n1024 2 4 6 7 Q\n1024 2 3 6 7 Q\n1024 3 4 5 7 Q\n1024 2 4 5 7 Q\n1024 2 3 5 7 Q\n1024 2 3 4 7 Q\n1024 3 4 5 6 Q\n1024 2 4 5 6 Q\n1024 2 3 5 6 Q\n1024 2 3 4 6 Q\n1024 2 3 4 5 Q\n1024 6 8 9 T J Jack High\n1024 5 8 9 T J\n1024 4 8 9 T J\n1024 3 8 9 T J\n1024 2 8 9 T J\n1024 6 7 9 T J\n1024 5 7 9 T J\n1024 4 7 9 T J\n1024 3 7 9 T J\n1024 2 7 9 T J\n1024 5 6 9 T J\n1024 4 6 9 T J\n1024 3 6 9 T J\n1024 2 6 9 T J\n1024 4 5 9 T J\n1024 3 5 9 T J\n1024 2 5 9 T J\n1024 3 4 9 T J\n1024 2 4 9 T J\n1024 2 3 9 T J\n1024 6 7 8 T J\n1024 5 7 8 T J\n1024 4 7 8 T J\n1024 3 7 8 T J\n1024 2 7 8 T J\n1024 5 6 8 T J\n1024 4 6 8 T J\n1024 3 6 8 T J\n1024 2 6 8 T J\n1024 4 5 8 T J\n1024 3 5 8 T J\n1024 2 5 8 T J\n1024 3 4 8 T J\n1024 2 4 8 T J\n1024 2 3 8 T J\n1024 5 6 7 T J\n1024 4 6 7 T J\n1024 3 6 7 T J\n1024 2 6 7 T J\n1024 4 5 7 T J\n1024 3 5 7 T J\n1024 2 5 7 T J\n1024 3 4 7 T J\n1024 2 4 7 T J\n1024 2 3 7 T J\n1024 4 5 6 T J\n1024 3 5 6 T J\n1024 2 5 6 T J\n1024 3 4 6 T J\n1024 2 4 6 T J\n1024 2 3 6 T J\n1024 3 4 5 T J\n1024 2 4 5 T J\n1024 2 3 5 T J\n1024 2 3 4 T J\n1024 6 7 8 9 J\n1024 5 7 8 9 J\n1024 4 7 8 9 J\n1024 3 7 8 9 J\n1024 2 7 8 9 J\n1024 5 6 8 9 J\n1024 4 6 8 9 J\n1024 3 6 8 9 J\n1024 2 6 8 9 J\n1024 4 5 8 9 J\n1024 3 5 8 9 J\n1024 2 5 8 9 J\n1024 3 4 8 9 J\n1024 2 4 8 9 J\n1024 2 3 8 9 J\n1024 5 6 7 9 J\n1024 4 6 7 9 J\n1024 3 6 7 9 J\n1024 2 6 7 9 J\n1024 4 5 7 9 J\n1024 3 5 7 9 J\n1024 2 5 7 9 J\n1024 3 4 7 9 J\n1024 2 4 7 9 J\n1024 2 3 7 9 J\n1024 4 5 6 9 J\n1024 3 5 6 9 J\n1024 2 5 6 9 J\n1024 3 4 6 9 J\n1024 2 4 6 9 J\n1024 2 3 6 9 J\n1024 3 4 5 9 J\n1024 2 4 5 9 J\n1024 2 3 5 9 J\n1024 2 3 4 9 J\n1024 5 6 7 8 J\n1024 4 6 7 8 J\n1024 3 6 7 8 J\n1024 2 6 7 8 J\n1024 4 5 7 8 J\n1024 3 5 7 8 J\n1024 2 5 7 8 J\n1024 3 4 7 8 J\n1024 2 4 7 8 J\n1024 2 3 7 8 J\n1024 4 5 6 8 J\n1024 3 5 6 8 J\n1024 2 5 6 8 J\n1024 3 4 6 8 J\n1024 2 4 6 8 J\n1024 2 3 6 8 J\n1024 3 4 5 8 J\n1024 2 4 5 8 J\n1024 2 3 5 8 J\n1024 2 3 4 8 J\n1024 4 5 6 7 J\n1024 3 5 6 7 J\n1024 2 5 6 7 J\n1024 3 4 6 7 J\n1024 2 4 6 7 J\n1024 2 3 6 7 J\n1024 3 4 5 7 J\n1024 2 4 5 7 J\n1024 2 3 5 7 J\n1024 2 3 4 7 J\n1024 3 4 5 6 J\n1024 2 4 5 6 J\n1024 2 3 5 6 J\n1024 2 3 4 6 J\n1024 2 3 4 5 J\n1024 5 7 8 9 T Ten High\n1024 4 7 8 9 T\n1024 3 7 8 9 T\n1024 2 7 8 9 T\n1024 5 6 8 9 T\n1024 4 6 8 9 T\n1024 3 6 8 9 T\n1024 2 6 8 9 T\n1024 4 5 8 9 T\n1024 3 5 8 9 T\n1024 2 5 8 9 T\n1024 3 4 8 9 T\n1024 2 4 8 9 T\n1024 2 3 8 9 T\n1024 5 6 7 9 T\n1024 4 6 7 9 T\n1024 3 6 7 9 T\n1024 2 6 7 9 T\n1024 4 5 7 9 T\n1024 3 5 7 9 T\n1024 2 5 7 9 T\n1024 3 4 7 9 T\n1024 2 4 7 9 T\n1024 2 3 7 9 T\n1024 4 5 6 9 T\n1024 3 5 6 9 T\n1024 2 5 6 9 T\n1024 3 4 6 9 T\n1024 2 4 6 9 T\n1024 2 3 6 9 T\n1024 3 4 5 9 T\n1024 2 4 5 9 T\n1024 2 3 5 9 T\n1024 2 3 4 9 T\n1024 5 6 7 8 T\n1024 4 6 7 8 T\n1024 3 6 7 8 T\n1024 2 6 7 8 T\n1024 4 5 7 8 T\n1024 3 5 7 8 T\n1024 2 5 7 8 T\n1024 3 4 7 8 T\n1024 2 4 7 8 T\n1024 2 3 7 8 T\n1024 4 5 6 8 T\n1024 3 5 6 8 T\n1024 2 5 6 8 T\n1024 3 4 6 8 T\n1024 2 4 6 8 T\n1024 2 3 6 8 T\n1024 3 4 5 8 T\n1024 2 4 5 8 T\n1024 2 3 5 8 T\n1024 2 3 4 8 T\n1024 4 5 6 7 T\n1024 3 5 6 7 T\n1024 2 5 6 7 T\n1024 3 4 6 7 T\n1024 2 4 6 7 T\n1024 2 3 6 7 T\n1024 3 4 5 7 T\n1024 2 4 5 7 T\n1024 2 3 5 7 T\n1024 2 3 4 7 T\n1024 3 4 5 6 T\n1024 2 4 5 6 T\n1024 2 3 5 6 T\n1024 2 3 4 6 T\n1024 2 3 4 5 T\n1024 4 6 7 8 9 Nine High\n1024 3 6 7 8 9\n1024 2 6 7 8 9\n1024 4 5 7 8 9\n1024 3 5 7 8 9\n1024 2 5 7 8 9\n1024 3 4 7 8 9\n1024 2 4 7 8 9\n1024 2 3 7 8 9\n1024 4 5 6 8 9\n1024 3 5 6 8 9\n1024 2 5 6 8 9\n1024 3 4 6 8 9\n1024 2 4 6 8 9\n1024 2 3 6 8 9\n1024 3 4 5 8 9\n1024 2 4 5 8 9\n1024 2 3 5 8 9\n1024 2 3 4 8 9\n1024 4 5 6 7 9\n1024 3 5 6 7 9\n1024 2 5 6 7 9\n1024 3 4 6 7 9\n1024 2 4 6 7 9\n1024 2 3 6 7 9\n1024 3 4 5 7 9\n1024 2 4 5 7 9\n1024 2 3 5 7 9\n1024 2 3 4 7 9\n1024 3 4 5 6 9\n1024 2 4 5 6 9\n1024 2 3 5 6 9\n1024 2 3 4 6 9\n1024 2 3 4 5 9\n1024 3 5 6 7 8 Eight High\n1024 2 5 6 7 8\n1024 3 4 6 7 8\n1024 2 4 6 7 8\n1024 2 3 6 7 8\n1024 3 4 5 7 8\n1024 2 4 5 7 8\n1024 2 3 5 7 8\n1024 2 3 4 7 8\n1024 3 4 5 6 8\n1024 2 4 5 6 8\n1024 2 3 5 6 8\n1024 2 3 4 6 8\n1024 2 3 4 5 8\n1024 2 4 5 6 7 Seven High\n1024 2 3 5 6 7\n1024 2 3 4 6 7\n1024 2 3 4 5 7\n"
},
{
"path": "src/server/algorithm/Pocker Rule.html",
"content": "德州扑克流程与规则德州扑克玩法与规则
游戏规则
使用道具
游戏人数
发牌下注
Pre-flop
Flop
Turn
River
比牌
比牌方法
玩法介绍
庄家(Dealer)
盲注(Blinds)
底牌(Hole cards)
第一轮下注(Pre-flop)
翻牌及第二轮下注(Flop)
转牌及第三轮下注(Turn)
河牌及第四轮下注(River)
摊牌和比牌(Showdown)
新手盲注
全押(All-in)
底池(Pot)
主池(Main pot)与边池(Side pot)
参考文档
游戏规则
使用道具
一副标准扑克牌去掉大小王后的52张牌进行游戏
游戏人数
理论上一桌同时最多可容纳22位玩家，一般2-10个玩家
发牌下注
发牌一般分为5个步骤，分别为：
Pre-flop
先下大小盲注，然后给每个玩家发2张底牌，大盲注后面第一个玩家选择跟注、加注或者盖牌放弃，按照顺时针方向，其他玩家依次表态，大盲注玩家最后表态，如果玩家有加注情况，前面已经跟注的玩家需要再次表态甚至多次表态。
Flop
同时发三张公牌，由小盲注开始（如果小盲注已盖牌，由后面最近的玩家开始，以此类推），按照顺时针方向依次表态，玩家可以选择下注、加注、或者盖牌放弃。
Turn
发第4张牌，由小盲注开始，按照顺时针方向依次表态。
River
发第五张牌，由小盲注开始，按照顺时针方向依次表态，玩家可以选择下注、加注、或者盖牌放弃。
比牌
经过前面4轮发牌和下注，剩余的玩家开始亮牌比大小，成牌最大的玩家赢取池底。
比牌方法
用自己的2张底牌和5张公共牌结合在一起，选出5张牌，不论手中的牌使用几张（甚至可以不用手中的底牌），凑成最大的成牌，跟其他玩家比大小。
比牌先比牌型，大的牌型大于小的牌型，牌型一般分为10种，从大到小为：
皇家同花顺（Royal Flush）
同花色的A, K, Q, J和10。
平手牌：在摊牌的时候有两副多副皇家同花顺时，平分筹码。
同花顺（Straight Flush）
五张同花色的连续牌。
平手牌：如果摊牌时有两副或多副同花顺，连续牌的头张牌大的获得筹码。如果是两副或多副相同的连续牌，平分筹码。
四条（Four of a Kind，亦称“铁支”、“四张”或“炸弹”）
其中四张是相同点数但不同花的扑克牌，第五张是随意的一张牌。
平手牌：如果两组或者更多组摊牌，则四张牌中的最大者赢局，如果一组人持有的四张牌是一样的，那么第五张牌最大者赢局（起脚牌）。如果起脚牌也一样，平分彩池。
满堂彩（Fullhouse，葫芦，三带二）
由三张相同点数及任何两张其他相同点数的扑克牌组成。
平手牌：如果两组或者更多组摊牌，那么三张相同点数中较大者赢局。如果三张牌都一样，则两张牌中点数较大者赢局，如果所有的牌都一样，则平分彩池。
同花（Flush，简称“花”）
此牌由五张不按顺序但相同花的扑克牌组成。
平手牌：如果不止一人抓到此牌相，则牌点最高的人赢得该局，如果最大点相同，则由第二、第三、第四或者第五张牌来决定胜负，如果所有的牌都相同，平分彩池。
顺子（Straight，亦称“蛇”）
此牌由五张顺序扑克牌组成。
平手牌：如果不止一人抓到此牌，则五张牌中点数最大的赢得此局，如果所有牌点数都相同，平分彩池。
三条（Three of a kind，亦称“三张”）
由三张相同点数和两张不同点数的扑克组成。
平手牌：如果不止一人抓到此牌，则三张牌中最大点数者赢局，如果三张牌都相同，比较第四张牌，必要时比较第五张，点数大的人赢局。如果所有牌都相同，则平分彩池。
两对（Two Pairs）
两对点数相同但两两不同的扑克和随意的一张牌组成。
平手牌：如果不止一人抓大此牌相，牌点比较大的人赢，如果比较大的牌点相同，那么较小牌点中的较大者赢，如果两对牌点相同，那么第五张牌点较大者赢（起脚牌）。如果起脚牌也相同，则平分彩池。
一对（One Pair）
由两张相同点数的扑克牌和另三张随意的牌组成。
平手牌：如果不止一人抓到此牌，则两张牌中点数大的赢，如果对牌都一样，则比较另外三张牌中大的赢，如果另外三张牌中较大的也一样则比较第二大的和第三大的，如果所有的牌都一样，则平分彩池。
高牌（high card）
既不是同一花色也不是同一点数的五张牌组成。
平手牌：如果不止一人抓到此牌，则比较点数最大者，如果点数最大的相同，则比较第二、第三、第四和第五大的，如果所有牌都相同，则平分彩池。
玩法介绍
庄家(Dealer)
首先确定庄家（英文为Button，固也称按钮）位置。第一局庄家位置系统随机指定，以后每局庄家位置按照顺时针方向下移一位。
盲注(Blinds)
为了使得游戏能够进行，强制庄家左边第一个人下一注（称小盲注 Small Blind），按钮左边第二个人下两注（称大盲注 Big Blind）。
底牌(Hole cards)
下盲注后从下大盲注玩家开始按顺时针方向每人发两张牌，皆为暗牌，称底牌或起手牌。
第一轮下注(Pre-flop)
发底牌后，从大盲注左边的玩家开始行动/叫注/说话(Action)，行动指从以下几项选择其一：
- 弃牌(Fold)：放弃本副牌，不参与竞争。
- 让牌(Check)：观望态度，或者是挖陷阱。
- 跟注(Call)：跟到和上家相同的注额。
- 加注(Raise)：增加下注额，直到全部筹码即全押(All-in)。
一人结束行动后按顺时针方向下一玩家获得行动权，直到不再有人弃牌，且每人已向奖池投入相同注额。已弃牌玩家不再有行动权。
如无盲注，则为发牌人左方的玩家，如为一对一时，则由大盲注先行叫注。
翻牌及第二轮下注(Flop)
发三张牌到牌桌中央，称为“翻牌”，为公共牌，所有人可见。
从小盲注玩家按顺时针方向做同于第一轮的行动，直到不再有人弃牌，且每人已向奖池投入相同注额。已弃牌玩家不再参与游戏。
转牌及第三轮下注(Turn)
发第四张牌，称为“转牌”，为公共牌，所有人可见。
从小盲注玩家按顺时针方向做同于第一轮的行动，直到不再有人弃牌，且每人已向奖池投入相同注额。已弃牌玩家不再参与游戏。
河牌及第四轮下注(River)
发第五张牌，称为“河牌”，为公共牌，所有人可见。
从小盲注玩家按顺时针方向做同于第一轮的行动，直到不再有人弃牌，且每人已向奖池投入相同注额。已弃牌玩家不再参与游戏。
摊牌和比牌(Showdown)
四轮下注都完成后，若仍剩余两名或两名以上玩家，则进行比牌。
比牌时，每位玩家用手中2张底牌与5张公共牌中任选5张组成最大牌者进行比较大小。胜者赢得底池所有注码。若有多人获胜，则平分底池注码。
當彩池由兩個以上玩家平分時，若有無法平分之小額籌碼，由順時鐘方向算過去，最靠近發牌者的贏家取得，舉例來說有ABCDE依順時鐘方向入座，A為本局發牌者，最小面額籌碼為$10，所有玩家皆未蓋牌至攤牌，最終由CDE勝出平分本局彩池$1000時，則DE各分到$330，而多出的$10將分配給最靠近A的贏家C，C於本局可分到$340。
新手盲注
在牌局已经形成的情况下，新加入牌局的人，需要下新手盲注，新手盲注等于大盲注。
全押(All-in)
当一个玩家加注或企图跟注却筹码不足时，他可以选择全押。当有玩家全押时，他会跟进他所有的筹码，底池被分为主池和边池。其他玩家多出全押玩家筹码的注额将都会被加入边池，此全押玩家将不可能获得边池而只可能赢得主池。同理，当多个玩家全押时可能出现多个边池。
底池(Pot)
每一个牌局里众人已押上的筹码总额，也即该局的奖金数目。
主池(Main pot)与边池(Side pot)
当没有玩家全押(All-in)时，底池由未弃牌的玩家中牌型最大者独得。
当有一个或多个玩家全押时，超过玩家压注金额的部分将会形成一个或多个边池。玩家参与投注该边池才有机会赢取改边池。
当一局结束而且所有已全押的玩家未持有最大牌型时，边池和主池都由牌面最佳获胜者赢取。
当一局结束而且有全押的玩家赢牌时，该玩家有参与投注的主池和边池均归该玩家，而其他边池由参与改池投注里，持有最大牌面的玩家赢得。
在几个玩家全押形成多个边池时，依全押的顺序分配给各边池中最佳牌面的玩家，有最大牌面的玩家赢得该玩家全押前所累积的边池。已全押的玩家无法赢取全押后产生的边池，即最多只能从其他每个跟牌玩家处取得相当于本身全押的总筹码数。全押后的下注可视为只在之后参与的玩家之间的独立输赢分配。
无人跟注的边池(仅有一位玩家下注，剩下其他玩家都弃牌)将会直接赢得该边池，相当于退换下注于该边池的筹码。
底池分配范例
例如ABCDEF六名玩家參與牌局，F於中途蓋牌退出，最終A全押投入$50，B全押投入$250，C全押投入$350，DE各投入$800，F投入$500，此時總彩池大小為$2750，形成了一個主池為50*6=$300，邊池各為（250-50）*5=$1000，（350-250）*4=$400，（500-350）*3=$450，（800-500）*2=$600，若最終組成牌面大小為F>A>B>D>E>C，但F已蓋牌不能分配任何彩池，則此局主池即為A於此局贏得的籌碼（$300），B可贏得第一個邊池（$1000），D參與至最後一個邊池，且牌面勝過參與第二、第三及第四邊池的所有玩家，因此可贏得剩下所有的邊池（400+450+600=$1450）
因为每个人手中的筹码量会不时的产生变化，当出现多个筹码量不等的玩家“全下(ALL-IN)”争夺底池的时候就会出现多个奖池，这时候底池将分出主池和边池，主池里的筹码可由任何一位争夺者胜利后将其拿走，其后每个边池将分别由参与者按牌型大小分别拿走。
举个例子，假如发到河牌后共有三个人争夺底池，三人分别用ABC代替，假设A玩家手中有60，B手中有80，C手中有100。三人ALL-IN后则先把每人的筹码划分成：
A玩家60；B玩家60+20；C玩家60+20+20，然后分出底池：
主池 由60乘以三个人(A+B+C)形成一个堆，总额为180；
边池一 由20乘以剩下的两个人(B+C)多出的部分为一个堆，总额为40；
边池二 由筹码最多者C的多出的部分20单独组成一个堆，总额为20。
现在三个底池形成了，然后分别按照牌型的大小来决定谁拿走哪个底池……
首先，主池可以由三人中的任何一人得到胜利都可以拿走；但是边池一的争夺就只能在B与C之间产生，两人谁赢谁拿走，与A无关(就算A玩家的牌最大也只能拿走他参与的主池)。而最后剩下的边池二不论三人谁输谁赢都只能由C拿走，因为边池二里的筹码只有C自己参与了，与其他人无关。
参考文档
http://jingyan.baidu.com/article/0aa223758306b688cd0d6462.html
http://zhidao.baidu.com/question/1446347228032870540.html
"
},
{
"path": "src/server/algorithm/cards.go",
"content": "package algorithm\n\ntype Cards []byte\n\n// todo 两对和四张起脚牌的判定\n\nvar StraightMask = []uint16{15872, 7936, 3968, 1984, 992, 496, 248, 124, 62, 31}\n//顺子（Straight，亦称“蛇”）\n//此牌由五张顺序扑克牌组成。\n//平手牌：如果不止一人抓到此牌，则五张牌中点数最大的赢得此局，\n// 如果所有牌点数都相同，平分彩池。\nfunc (this *Cards) straight() uint32 {\n\tvar handvalue uint16\n\tfor _, v := range (*this) {\n\t\tvalue := v & 0xF\n\t\tif value == 0xE {\n\t\t\thandvalue |= 1\n\t\t}\n\t\thandvalue |= (1 << (value - 1 ) )\n\t}\n\n\tfor i := uint8(0); i < 10; i++ {\n\t\tif handvalue&StraightMask[i] == StraightMask[i] {\n\t\t\treturn En(STRAIGHT, uint32(10-i+4))\n\t\t}\n\t}\n\treturn 0\n}\n\n//同花顺（Straight Flush）\n//五张同花色的连续牌。\n//平手牌：如果摊牌时有两副或多副同花顺，连续牌的头张牌大的获得筹码。\n//如果是两副或多副相同的连续牌，平分筹码。\nfunc (this *Cards) straightFlush() uint32 {\n\tcards := *this\n\tfor i := byte(0); i < SUITSIZE; i++ {\n\t\tvar handvalue uint16\n\t\tfor _, v := range cards {\n\t\t\tif (v >> 4) == i {\n\t\t\t\tvalue := v & 0xF\n\t\t\t\tif value == 0xE {\n\t\t\t\t\thandvalue |= 1\n\t\t\t\t}\n\t\t\t\thandvalue |= (1 << (value - 1 ) )\n\t\t\t}\n\t\t}\n\n\t\tfor i := uint8(0); i < 10; i++ {\n\t\t\tif handvalue&StraightMask[i] == StraightMask[i] {\n\t\t\t\treturn En(STRAIGHT_FLUSH, uint32(10-i+4))\n\t\t\t}\n\t\t}\n\t}\n\treturn 0\n}\n\n//皇家同花顺（Royal Flush）\n//同花色的A, K, Q, J和10。\n//平手牌：在摊牌的时候有两副多副皇家同花顺时，平分筹码。\nfunc (this *Cards) royalFlush() uint32 {\n\tcards := *this\n\tfor i := byte(0); i < SUITSIZE; i++ {\n\t\tvar handvalue uint16\n\t\tfor _, v := range cards {\n\t\t\tif (v >> 4) == i {\n\t\t\t\tvalue := v & 0xF\n\t\t\t\tif value == 0xE {\n\t\t\t\t\thandvalue |= 1\n\t\t\t\t}\n\t\t\t\thandvalue |= (1 << (value - 1 ) )\n\n\t\t\t}\n\t\t}\n\n\t\tif handvalue&StraightMask[0] == StraightMask[0] {\n\t\t\treturn En(ROYAL_FLUSH, 0)\n\t\t}\n\t}\n\treturn 0\n}\n\n//四条（Four of a Kind，亦称“铁支”、“四张”或“炸弹”）\n//其中四张是相同点数但不同花的扑克牌，第五张是随意的一张牌。\n//平手牌：如果两组或者更多组摊牌，则四张牌中的最大者赢局，如果一组人持有的四张牌是一样的，\n//那么第五张牌最大者赢局（起脚牌,2张起手牌中小的那张就叫做起脚牌）。如果起脚牌也一样，平分彩池。\nfunc (this *Cards) four(counter *ValueCounter) uint32 {\n\tcards := *this\n\tif counter.Get(cards[len(cards)-1]) == 4 {\n\t\treturn En(FOUR, ToValue(cards))\n\t}\n\treturn 0\n}\n\n//满堂彩（Fullhouse，葫芦，三带二）\n//由三张相同点数及任何两张其他相同点数的扑克牌组成。\n//平手牌：如果两组或者更多组摊牌，那么三张相同点数中较大者赢局。\n//如果三张牌都一样，则两张牌中点数较大者赢局，如果所有的牌都一样，则平分彩池。\nfunc (this *Cards) fullFouse(counter *ValueCounter) uint32 {\n\tcards := *this\n\tlength := len(cards)\n\n\tif length >= 5 {\n\t\tif cards[length-1]&0xF == cards[length-2]&0xF &&\n\t\t\tcards[length-3]&0xF == cards[length-1]&0xF &&\n\t\t\tcards[length-4]&0xF == cards[length-5]&0xF {\n\n\t\t\treturn En(FULL_HOUSE, ToValue(cards))\n\t\t}\n\t}\n\treturn 0\n}\n\n//同花（Flush，简称“花”）\n//此牌由五张不按顺序但相同花的扑克牌组成。\n//平手牌：如果不止一人抓到此牌相，则牌点最高的人赢得该局，\n//如果最大点相同，则由第二、第三、第四或者第五张牌来决定胜负，如果所有的牌都相同，平分彩池。\nfunc (this *Cards) flush() uint32 {\n\tcards := *this\n\tfor i := byte(0); i < SUITSIZE; i++ {\n\t\tvar count uint8\n\t\tfor _, v := range cards {\n\t\t\tif (v >> 4) == i {\n\t\t\t\tcount ++\n\t\t\t\tif count == 5 {\n\t\t\t\t\tvar handvalue uint16\n\t\t\t\t\tfor _, v1 := range cards {\n\t\t\t\t\t\tif (v1 >> 4) == i {\n\t\t\t\t\t\t\tvalue := v1 & 0xF\n\t\t\t\t\t\t\tif value == 0xE {\n\t\t\t\t\t\t\t\thandvalue |= 1\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\thandvalue |= (1 << (value - 1 ) )\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\treturn En(FLUSH, uint32(handvalue))\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t}\n\treturn 0\n}\n\n//三条（Three of a kind，亦称“三张”）\n//由三张相同点数和两张不同点数的扑克组成。\n//平手牌：如果不止一人抓到此牌，则三张牌中最大点数者赢局，\n//如果三张牌都相同，比较第四张牌，必要时比较第五张，点数大的人赢局。如果所有牌都相同，则平分彩池。\nfunc (this *Cards) three(counter *ValueCounter) uint32 {\n\tcards := *this\n\tif counter.Get(cards[len(cards)-1]) == 3 {\n\t\treturn En(THREE, ToValue(cards))\n\t}\n\treturn 0\n}\n\n//两对（Two Pairs）\n//两对点数相同但两两不同的扑克和随意的一张牌组成。\n//平手牌：如果不止一人抓大此牌相，牌点比较大的人赢，如果比较大的牌点相同，那么较小牌点中的较大者赢，\n//如果两对牌点相同，那么第五张牌点较大者赢（起脚牌,2张起手牌中小的那张就叫做起脚牌）。如果起脚牌也相同，则平分彩池。\nfunc (this *Cards) twoPair() uint32 {\n\tcards := *this\n\tlength := len(cards)\n\tif length >= 4 {\n\t\tif cards[length-1]&0xF == cards[length-2]&0xF &&\n\t\t\tcards[length-3]&0xF == cards[length-4]&0xF {\n\t\t\treturn En(TWO_PAIR, ToValue(cards))\n\t\t}\n\t}\n\treturn 0\n}\n\n//一对（One Pair）\n//由两张相同点数的扑克牌和另三张随意的牌组成。\n//平手牌：如果不止一人抓到此牌，则两张牌中点数大的赢，如果对牌都一样，则比较另外三张牌中大的赢，\n//如果另外三张牌中较大的也一样则比较第二大的和第三大的，如果所有的牌都一样，则平分彩池。\nfunc (this *Cards) onePair() uint32 {\n\tcards := *this\n\tlength := len(cards)\n\tif length >= 2 {\n\t\tif cards[length-1]&0xF == cards[length-2]&0xF {\n\t\t\treturn En(ONE_PAIR, ToValue(cards))\n\t\t}\n\t}\n\treturn 0\n}\n\nfunc ToValue(cards []byte) uint32 {\n\tvar res uint32\n\tfor i := len(cards) - 1; i >= 0; i-- {\n\t\tres *= 10\n\t\tres += uint32(cards[i] & 0xF)\n\t}\n\treturn res\n}\n\nfunc De(v uint32) (uint8, uint32) {\n\treturn uint8(v >> 24), v & 0xFFFFFF\n}\n\nfunc En(t uint8, v uint32) uint32 {\n\tv1 := v | ( uint32(t) << 24)\n\treturn v1\n}\n"
},
{
"path": "src/server/algorithm/cards_test.go",
"content": "package algorithm\n\nimport (\n\t\"testing\"\n\t\"strings\"\n\t\"github.com/stretchr/testify/assert\"\n)\n\nfunc TestFour(t *testing.T) {\n\tcards := Cards{0x12, 0x02, 0x22, 0xb, 0x1b, 0x7, 0x32}\n\tk,_:=De(cards.GetType())\n\tassert.Equal(t, k, FOUR)\n\n\tcards = Cards{0x12, 0x02, 0x22, 0x32}\n\tk,_=De(cards.GetType())\n\tassert.Equal(t, k, FOUR)\n}\n\nfunc TestThree(t *testing.T) {\n\tcards := Cards{0x12, 0x02, 0x22, 0x3a, 0x2a, 0x1a, 0x33}\n\tk,_:=De(cards.GetType())\n\tassert.Equal(t, k, FULL_HOUSE)\n\n}\n\nfunc TestHighCard(t *testing.T) {\n\t//var cs Cards\n\tcards := Cards{0x1E, 0x02, 0x22, 0x3a, 0x2a, 0x1a, 0x33}\n\tk, _ := De(cards.GetType())\n\tassert.Equal(t, k, FULL_HOUSE)\n\t//assert.Equal(t, v, uint32(0xE))\n}\n\nfunc TestCards_OnePair(t *testing.T) {\n\tcards := Cards{0x12, 0x0e, 0x2e, 0x3a, 0x2a, 0x1a, 0x32}\n\n\tk, _ := De(cards.GetType())\n\tassert.Equal(t, k, FULL_HOUSE)\n}\n\nfunc TestCards_Straight(t *testing.T) {\n\n\tcards := Cards{0x12, 0x03, 0x24, 0x35, 0x26, 0x17, 0x33}\n\tk, v := De(cards.GetType())\n\tassert.Equal(t, k, STRAIGHT)\n\tassert.Equal(t, v, uint32(7))\n\n\tcards = Cards{0x12, 0x03, 0x24, 0x34, 0x26, 0x17, 0x37}\n\tassert.Equal(t, k, STRAIGHT)\n\tassert.Equal(t, v, uint32(7))\n\n\tcards = Cards{0x12, 0x03, 0x24, 0x34, 0x25, 0x17, 0x3E}\n\n\tk, v = De(cards.GetType())\n\tassert.Equal(t, k, STRAIGHT)\n\tassert.Equal(t, v, uint32(0x5))\n\n\n\tcards = Cards{0x12, 0x03, 0x2a, 0x3c, 0x2b, 0x1d, 0x3E}\n\tk, v = De(cards.GetType())\n\tassert.Equal(t, k, STRAIGHT)\n\tassert.Equal(t, v, uint32(0xe))\n}\n\nfunc TestCards_Flush(t *testing.T) {\n\n\tcards := Cards{0x32, 0x33, 0x34, 0x35, 0x26, 0x37, 0x28}\n\n\tk, _ := De(cards.GetType())\n\tassert.Equal(t, k,FLUSH)\n\t//assert.Equal(t, v, uint32(6))\n}\n\nfunc TestCards_TwoPair(t *testing.T) {\n\n\tcards := Cards{0x12, 0x22, 0x34, 0x35, 0x25, 0x38, 0x28}\n\n\tk, _ := De(cards.GetType())\n\tassert.Equal(t, k, TWO_PAIR)\n}\nfunc TestCards_RoyalFlush(t *testing.T) {\n\n\tcards := Cards{0x3A, 0x3B, 0x3C, 0x3E, 0x3D, 0x38, 0x28}\n\tk, _ := De(cards.GetType())\n\tassert.Equal(t, k, ROYAL_FLUSH)\n\n\tcards = Cards{0x3A, 0x3B, 0x3C, 0x3E, 0x2D, 0x38, 0x28}\n\n\tk, _ = De(cards.GetType())\n\tassert.Equal(t, k, FLUSH)\n}\n\n\nfunc TestCards_FLUSH1(t *testing.T) {\n\tcards1 := Cards{0x22, 0x22, 0x22, 0x25, 0x38, 0x28}\n\tcards2 := Cards{0x32, 0x32, 0x33, 0x34, 0x25, 0x36}\n\tv1:=cards1.GetType()\n\tv2:=cards2.GetType()\n\n\tassert.Equal(t,v1 > v2 ,true)\n\n\n\tcards1 = Cards{0x22, 0x22, 0x2E, 0x25, 0x38, 0x28}\n\tcards2 = Cards{0x32, 0x32, 0x33, 0x3a, 0x2a, 0x3E}\n\tassert.Equal(t,cards1.GetType() > cards2.GetType() ,false)\n}\n\nfunc TestCards_FLUSH(t *testing.T) {\n\tcards1 := Cards{0x22, 0x22, 0x24, 0x25, 0x38, 0x28}\n\tcards2 := Cards{0x32, 0x32, 0x33, 0x34, 0x25, 0x36}\n\tv1:=cards1.GetType()\n\tv2:=cards2.GetType()\n\n\tassert.Equal(t,v1 > v2 ,true)\n}\n\nfunc TestCards_PK(t *testing.T) {\n\n\tcards1 := Cards{0x32, 0x32, 0x34, 0x35, 0x25, 0x38, 0x28}\n\tcards2 := Cards{0x32, 0x32, 0x33, 0x34, 0x25, 0x36}\n\tv1:=cards1.GetType()\n\tv2:=cards2.GetType()\n\tassert.Equal(t,v1 > v2 ,true)\n\n}\nfunc TestCards_StraightFlush(t *testing.T) {\n\tcards := Cards{0x32, 0x33, 0x34, 0x35, 0x36, 0x27, 0x28}\n\tk, v := De(cards.GetType())\n\tassert.Equal(t, k, uint8(9))\n\tassert.Equal(t, v, uint32(6))\n\n\tcards = Cards{0x32, 0x33, 0x34, 0x35, 0x3E, 0x37, 0x28}\n\tk, v = De(cards.GetType())\n\tassert.Equal(t, k, uint8(9))\n\tassert.Equal(t, v, uint32(5))\n\n\tcards = Cards{0x32, 0x33, 0x34, 0x35, 0x3E, 0x36, 0x28}\n\tk, v = De(cards.GetType())\n\tassert.Equal(t, k, uint8(9))\n\tassert.Equal(t, v, uint32(6))\n}\n\nfunc TestCards_FullFouse(t *testing.T) {\n\n\tcards := Cards{0x33, 0x33, 0x33, 0x35, 0x25, 0x35, 0x28}\n\tk, _ := De(cards.GetType())\n\n\t//t.Logf(\"%v %v %#v \",k,v,cards)\n\tassert.Equal(t, k, FULL_HOUSE)\n\t//assert.Equal(t, v, FULL_HOUSE)\n\n\t//t.Log(cards.String())\n\t//t.Log(cards.Hex())\n}\n\nfunc TestString2Num(t *testing.T) {\n\n\tarray := Cards{0x33, 0x33, 0x33, 0x35, 0x25, 0x35, 0x3E, 0x1A}\n\n\t//for i := 0; i < N; i++ {\n\tgo array.Shuffle()\n\tt.Log(array.String())\n\t//}\n\n}\n\nfunc TestFullFouse(t *testing.T) {\n\tvar s = \"A A A K K|\" +\n\t\t\"A A A Q Q|\" +\n\t\t\"A A A J J|\" +\n\t\t\"A A A T T|\" +\n\t\t\"A A A 9 9|\" +\n\t\t\"A A A 8 8|\" +\n\t\t\"A A A 7 7|\" +\n\t\t\"A A A 6 6|\" +\n\t\t\"A A A 5 5|\" +\n\t\t\"A A A 4 4|\" +\n\t\t\"A A A 3 3|\" +\n\t\t\"A A A 2 2|\" +\n\t\t\"K K K A A|\" +\n\t\t\"K K K Q Q|\" +\n\t\t\"K K K J J|\" +\n\t\t\"K K K T T|\" +\n\t\t\"K K K 9 9|\" +\n\t\t\"K K K 8 8|\" +\n\t\t\"K K K 7 7|\" +\n\t\t\"K K K 6 6|\" +\n\t\t\"K K K 5 5|\" +\n\t\t\"K K K 4 4|\" +\n\t\t\"K K K 3 3|\" +\n\t\t\"K K K 2 2|\" +\n\t\t\"Q Q Q A A|\" +\n\t\t\"Q Q Q K K|\" +\n\t\t\"Q Q Q J J|\" +\n\t\t\"Q Q Q T T|\" +\n\t\t\"Q Q Q 9 9\"\n\n\tarray := strings.Split(s, \"|\")\n\n\tvar oldValue uint32\n\tfor _, v := range array {\n\t\tcards := &Cards{}\n\t\tcards.SetByString(v)\n\t\t//t.Log(cards.String())\n\n\t\tk, value := De(cards.GetType())\n\t\tif oldValue == 0{\n\t\t\toldValue = value\n\t\t\tcontinue\n\t\t}\n\n\t\tassert.Equal(t, oldValue> value, true)\n\n\t\tassert.Equal(t, k, FULL_HOUSE)\n\t\t//assert.Equal(t,v,uint32(6))\n\n\t\t//t.Log(De(cards.FullFouse(cards.Counter())))\n\t}\n}\n\nfunc Test_Straight1(t *testing.T) {\n\n\t/*\ttestCards := \"T J Q K A|\" +\n\t\t\"9 T J Q K|\" +\n\t\t\"8 9 T J Q|\" +\n\t\t\"7 8 9 T J|\" +\n\t\t\"6 7 8 9 T|\" +\n\t\t\"5 6 7 8 9|\" +\n\t\t\"4 5 6 7 8|\" +\n\t\t\"3 4 5 6 7|\" +\n\t\t\"2 3 4 5 6|\" +\n\t\t\"A 2 3 4 5\"\n\n\t//array := strings.Split(testCards, \"|\")\nfor _, v := range array {\n\t\tcards := &Cards{}\n\t\tcards.SetByString(v)\n\t\tcards.Sort()\n\t\tt.Log(cards.String(), cards.Straight() > 0)\n\t}\n\tt.Log(\"--------------------------------------\")\n\n\tfor _, v := range array {\n\t\tcards := &Cards{}\n\t\tcards.SetByString(v)\n\t\tcards.Sort()\n\t\tt.Log(cards.String(), cards.StraightFlush() > 0)\n\t}*/\n\t/*\tt.Log(\"--------------------------------------\")\n\n\t\tfor _, v := range array {\n\t\t\tcards := &Cards{}\n\t\t\tcards.SetByString(v)\n\t\t\tcards.Sort()\n\t\t\tt.Log(cards.String(), cards.RoyalFlush())\n\t\t}*/\n}\n\nfunc Test_AnalyseCards(t *testing.T) {\n\tvar a ColorCounter\n\tcards := []byte{0x33, 0x35, 0x25, 0x35, 0x28}\n\ta.Set(cards)\n\n\tt.Log(a.Get(0x33), a.Get(0x35), a.Get(0x28))\n}\nfunc Test_Append(t *testing.T) {\n\tcards := Cards{0x33, 0x35, 0x25, 0x35, 0x28}\n\tcards = cards.Append(Cards{0x33, 0x33}...)\n\n\tt.Logf(\"%#v \", cards.GetType())\n}\n\nfunc Test_turnToValue1(t *testing.T) {\n\tv1 := []byte{0x33, 0x35, 0x25, 0x35, 0x28}\n\tv2 := []byte{0x35, 0x35, 0x25, 0x35, 0x27}\n\n\tt.Logf(\"%#v %#v \", v1, v2)\n\tb1 := ToValue(v1)\n\tb2 := ToValue(v2)\n\n\tt.Log(b1, b2)\n\n}\nfunc Test_ColorCounter(t *testing.T) {\n\tv2 := []byte{0x35, 0x35, 0x25, 0x35, 0x27}\n\n\tvar colorCounter ColorCounter\n\n\tcolorCounter.Set(v2)\n\n\tt.Log(v2)\n}\nfunc Test_turnToValue(t *testing.T) {\n\n\tv := ToValue([]byte{0x3E, 0x3E, 0x3E, 0x3E, 0x3E, 0x3E, 0x3E})\n\n\t//var v3 uint16 = v\n\tv1 := v | ( 10 << 24)\n\n\t//t.Log(v3)\n\n\tt.Logf(\"%v %v %v\", v, v1>>24, v1&0xFFFFFF)\n\tt.Logf(\"%v \", ToValue([]byte{0x33, 0x35, 0x25, 0x35, 0x28}))\n\n}\n"
},
{
"path": "src/server/algorithm/constan.go",
"content": "package algorithm\n\n// 扑克牌52张，分别包含普通牌52张 2-10、J、Q、K、A （以上每种牌4个花色 黑桃、梅花、红心、方块）\nvar CARDS = []byte{\n\t//方块\n\t0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E,\n\t//梅花\n\t0x12, 0x13, 0x14, 0x15, 0x16, 0x17, 0x18, 0x19, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E,\n\t//红桃\n\t0x22, 0x23, 0x24, 0x25, 0x26, 0x27, 0x28, 0x29, 0x2A, 0x2B, 0x2C, 0x2D, 0x2E,\n\t//黑桃\n\t0x32, 0x33, 0x34, 0x35, 0x36, 0x37, 0x38, 0x39, 0x3A, 0x3B, 0x3C, 0x3D, 0x3E,\n}\n\nconst (\n\tCARDRANK = 13\n\tSUITSIZE = 4\n\tTOTAL = 13 * 4\n\n\tTYPE_LEN = 5 // 牌型长度\n\tCARDS_LEN = 7 // 河牌+底牌长度\n)\n\n//牌型大小：\n//1、皇家同花顺＞同花顺＞四条＞葫芦＞同花＞顺子＞三条＞两队＞一对＞单牌\n//2、牌点从大到小为：A、K、Q、J、10、9、8、7、6、5、4、3、2，各花色不分大小。\n//3、同种牌型，对子时比对子的大小，其它牌型比最大的牌张，如最大牌张相同则比第二大的牌张，以此类推，都相同时为相同。\n//4、A 可以组顺子 A、1、2、3、4、5 也可以组顺子 10、J、Q、K、A 同花顺同理\n//所有牌型如下：\nconst (\n\tROYAL_FLUSH uint8= 10 // 皇家同花顺：同一花色的最大顺子。（最大牌：A-K-Q-J-10）\n\tSTRAIGHT_FLUSH uint8= 9 // 同花顺：同一花色的顺子。（最大牌：K-Q-J-10-9 最小牌：A-2-3-4-5）\n\tFOUR uint8= 8 // 四条：四同张加单张。（最大牌：A-A-A-A-K 最小牌：2-2-2-2-3）\n\tFULL_HOUSE uint8= 7 // 葫芦（豪斯）：三同张加对子。（最大牌：A-A-A-K-K 最小牌：2-2-2-3-3）\n\tFLUSH uint8= 6 // 同花：同一花色。（最大牌：A-K-Q-J-9 最小牌：2-3-4-5-7）\n\tSTRAIGHT uint8= 5 // 顺子：花色不一样的顺子。（最大牌：A-K-Q-J-10 最小牌：A-2-3-4-5）\n\tTHREE uint8= 4 // 三条：三同张加两单张。（最大牌：A-A-A-K-Q 最小牌：2-2-2-3-4）\n\tTWO_PAIR uint8= 3 // 两对：（最大牌：A-A-K-K-Q 最小牌：2-2-3-3-4）\n\tONE_PAIR uint8= 2 // 一对：（最大牌：A-A-K-Q-J 最小牌：2-2-3-4-5）\n\tHIGH_CARD uint8= 1 // 高牌：（最大牌：A-K-Q-J-9 最小牌：2-3-4-5-7）\n)\n"
},
{
"path": "src/server/algorithm/dealer.go",
"content": "package algorithm\n\nimport (\n\t\"time\"\n\t\"math/rand\"\n)\n\n\n\n//var n int64\n//var a int64= 1<<62\n// 洗牌\nfunc (this *Cards) Shuffle() {\n\t*this = make([]byte, TOTAL)\n\tcopy(*this, CARDS)\n\tsource := rand.NewSource(time.Now().UnixNano() )\n\t//n ++\n\t//n %=a\n\tr := rand.New(source)\n\tfor i := TOTAL - 1; i > 0; i-- {\n\t\tindex := r.Int() % i\n\t\t(*this)[i], (*this)[index] = (*this)[index], (*this)[i]\n\t}\n\n}\n"
},
{
"path": "src/server/algorithm/dealer_test.go",
"content": "package algorithm\n\nimport \"testing\"\n\nfunc Test_Dealer(t *testing.T) {\n\td:= &Cards{}\n\n\td.Shuffle()\n\td.Shuffle()\n\tt.Logf(\"%#v \",d)\n\n}\n"
},
{
"path": "src/server/algorithm/flush_test.go",
"content": "package algorithm\n\nimport (\n\t\"testing\"\n\t\"strings\"\n\t\"github.com/stretchr/testify/assert\"\n)\n\nfunc TestFlush1(t *testing.T) {\n\tvar s = \"9 J Q K A |\" +\n\t\t\"8 J Q K A |\" +\n\t\t\"7 J Q K A |\" +\n\t\t\"6 J Q K A |\" +\n\t\t\"5 J Q K A |\" +\n\t\t\"4 J Q K A |\" +\n\t\t\"3 J Q K A |\" +\n\t\t\"2 J Q K A |\" +\n\t\t\"9 T Q K A |\" +\n\t\t\"8 T Q K A |\" +\n\t\t\"7 T Q K A |\" +\n\t\t\"6 T Q K A |\" +\n\t\t\"5 T Q K A |\" +\n\t\t\"4 T Q K A |\" +\n\t\t\"3 T Q K A |\" +\n\t\t\"2 T Q K A |\" +\n\t\t\"8 9 Q K A |\" +\n\t\t\"7 9 Q K A |\" +\n\t\t\"6 9 Q K A |\" +\n\t\t\"5 9 Q K A |\" +\n\t\t\"4 9 Q K A |\" +\n\t\t\"3 9 Q K A |\" +\n\t\t\"2 9 Q K A |\" +\n\t\t\"7 8 Q K A |\" +\n\t\t\"6 8 Q K A |\" +\n\t\t\"5 8 Q K A |\" +\n\t\t\"4 8 Q K A |\" +\n\t\t\"3 8 Q K A |\" +\n\t\t\"2 8 Q K A |\" +\n\t\t\"6 7 Q K A |\" +\n\t\t\"5 7 Q K A |\" +\n\t\t\"4 7 Q K A |\" +\n\t\t\"3 7 Q K A |\" +\n\t\t\"2 7 Q K A |\" +\n\t\t\"5 6 Q K A |\" +\n\t\t\"4 6 Q K A |\" +\n\t\t\"3 6 Q K A |\" +\n\t\t\"2 6 Q K A |\" +\n\t\t\"4 5 Q K A |\" +\n\t\t\"3 5 Q K A |\" +\n\t\t\"2 5 Q K A |\" +\n\t\t\"3 4 Q K A |\" +\n\t\t\"2 4 Q K A |\" +\n\t\t\"2 3 Q K A |\" +\n\t\t\"9 T J K A |\" +\n\t\t\"8 T J K A |\" +\n\t\t\"7 T J K A |\" +\n\t\t\"6 T J K A |\" +\n\t\t\"5 T J K A |\" +\n\t\t\"4 T J K A |\" +\n\t\t\"3 T J K A |\" +\n\t\t\"2 T J K A |\" +\n\t\t\"8 9 J K A |\" +\n\t\t\"7 9 J K A |\" +\n\t\t\"6 9 J K A |\" +\n\t\t\"5 9 J K A |\" +\n\t\t\"4 9 J K A |\" +\n\t\t\"3 9 J K A |\" +\n\t\t\"2 9 J K A |\" +\n\t\t\"7 8 J K A |\" +\n\t\t\"6 8 J K A |\" +\n\t\t\"5 8 J K A |\" +\n\t\t\"4 8 J K A |\" +\n\t\t\"3 8 J K A |\" +\n\t\t\"2 8 J K A |\" +\n\t\t\"6 7 J K A |\" +\n\t\t\"5 7 J K A |\" +\n\t\t\"4 7 J K A |\" +\n\t\t\"3 7 J K A |\" +\n\t\t\"2 7 J K A |\" +\n\t\t\"5 6 J K A |\" +\n\t\t\"4 6 J K A |\" +\n\t\t\"3 6 J K A |\" +\n\t\t\"2 6 J K A |\" +\n\t\t\"4 5 J K A |\" +\n\t\t\"3 5 J K A |\" +\n\t\t\"2 5 J K A |\" +\n\t\t\"3 4 J K A |\" +\n\t\t\"2 4 J K A |\" +\n\t\t\"2 3 J K A |\" +\n\t\t\"8 9 T K A |\" +\n\t\t\"7 9 T K A |\" +\n\t\t\"6 9 T K A |\" +\n\t\t\"5 9 T K A |\" +\n\t\t\"4 9 T K A |\" +\n\t\t\"3 9 T K A |\" +\n\t\t\"2 9 T K A |\" +\n\t\t\"7 8 T K A |\" +\n\t\t\"6 8 T K A |\" +\n\t\t\"5 8 T K A |\" +\n\t\t\"4 8 T K A |\" +\n\t\t\"3 8 T K A |\" +\n\t\t\"2 8 T K A |\" +\n\t\t\"6 7 T K A |\" +\n\t\t\"5 7 T K A |\" +\n\t\t\"4 7 T K A |\" +\n\t\t\"3 7 T K A |\" +\n\t\t\"2 7 T K A |\" +\n\t\t\"5 6 T K A |\" +\n\t\t\"4 6 T K A |\" +\n\t\t\"3 6 T K A |\" +\n\t\t\"2 6 T K A |\" +\n\t\t\"4 5 T K A |\" +\n\t\t\"3 5 T K A |\" +\n\t\t\"2 5 T K A |\" +\n\t\t\"3 4 T K A |\" +\n\t\t\"2 4 T K A |\" +\n\t\t\"2 3 T K A |\" +\n\t\t\"7 8 9 K A |\" +\n\t\t\"6 8 9 K A |\" +\n\t\t\"5 8 9 K A |\" +\n\t\t\"4 8 9 K A |\" +\n\t\t\"3 8 9 K A |\" +\n\t\t\"2 8 9 K A |\" +\n\t\t\"6 7 9 K A |\" +\n\t\t\"5 7 9 K A |\" +\n\t\t\"4 7 9 K A |\" +\n\t\t\"3 7 9 K A |\" +\n\t\t\"2 7 9 K A |\" +\n\t\t\"5 6 9 K A |\" +\n\t\t\"4 6 9 K A |\" +\n\t\t\"3 6 9 K A |\" +\n\t\t\"2 6 9 K A |\" +\n\t\t\"4 5 9 K A |\" +\n\t\t\"3 5 9 K A |\" +\n\t\t\"2 5 9 K A |\" +\n\t\t\"3 4 9 K A |\" +\n\t\t\"2 4 9 K A |\" +\n\t\t\"2 3 9 K A |\" +\n\t\t\"6 7 8 K A |\" +\n\t\t\"5 7 8 K A |\" +\n\t\t\"4 7 8 K A |\" +\n\t\t\"3 7 8 K A |\" +\n\t\t\"2 7 8 K A |\" +\n\t\t\"5 6 8 K A |\" +\n\t\t\"4 6 8 K A |\" +\n\t\t\"3 6 8 K A |\" +\n\t\t\"2 6 8 K A |\" +\n\t\t\"4 5 8 K A |\" +\n\t\t\"3 5 8 K A |\" +\n\t\t\"2 5 8 K A |\" +\n\t\t\"3 4 8 K A |\" +\n\t\t\"2 4 8 K A |\" +\n\t\t\"2 3 8 K A |\" +\n\t\t\"5 6 7 K A |\" +\n\t\t\"4 6 7 K A |\" +\n\t\t\"3 6 7 K A |\" +\n\t\t\"2 6 7 K A |\" +\n\t\t\"4 5 7 K A |\" +\n\t\t\"3 5 7 K A |\" +\n\t\t\"2 5 7 K A |\" +\n\t\t\"3 4 7 K A |\" +\n\t\t\"2 4 7 K A |\" +\n\t\t\"2 3 7 K A |\" +\n\t\t\"4 5 6 K A |\" +\n\t\t\"3 5 6 K A |\" +\n\t\t\"2 5 6 K A |\" +\n\t\t\"3 4 6 K A |\" +\n\t\t\"2 4 6 K A |\" +\n\t\t\"2 3 6 K A |\" +\n\t\t\"3 4 5 K A |\" +\n\t\t\"2 4 5 K A |\" +\n\t\t\"2 3 5 K A |\" +\n\t\t\"2 3 4 K A |\" +\n\t\t\"9 T J Q A |\" +\n\t\t\"8 T J Q A |\" +\n\t\t\"7 T J Q A |\" +\n\t\t\"6 T J Q A |\" +\n\t\t\"5 T J Q A |\" +\n\t\t\"4 T J Q A |\" +\n\t\t\"3 T J Q A |\" +\n\t\t\"2 T J Q A |\" +\n\t\t\"8 9 J Q A |\" +\n\t\t\"7 9 J Q A |\" +\n\t\t\"6 9 J Q A |\" +\n\t\t\"5 9 J Q A |\" +\n\t\t\"4 9 J Q A |\" +\n\t\t\"3 9 J Q A |\" +\n\t\t\"2 9 J Q A |\" +\n\t\t\"7 8 J Q A |\" +\n\t\t\"6 8 J Q A |\" +\n\t\t\"5 8 J Q A |\" +\n\t\t\"4 8 J Q A |\" +\n\t\t\"3 8 J Q A |\" +\n\t\t\"2 8 J Q A |\" +\n\t\t\"6 7 J Q A |\" +\n\t\t\"5 7 J Q A |\" +\n\t\t\"4 7 J Q A |\" +\n\t\t\"3 7 J Q A |\" +\n\t\t\"2 7 J Q A |\" +\n\t\t\"5 6 J Q A |\" +\n\t\t\"4 6 J Q A |\" +\n\t\t\"3 6 J Q A |\" +\n\t\t\"2 6 J Q A |\" +\n\t\t\"4 5 J Q A |\" +\n\t\t\"3 5 J Q A |\" +\n\t\t\"2 5 J Q A |\" +\n\t\t\"3 4 J Q A |\" +\n\t\t\"2 4 J Q A |\" +\n\t\t\"2 3 J Q A |\" +\n\t\t\"8 9 T Q A |\" +\n\t\t\"7 9 T Q A |\" +\n\t\t\"6 9 T Q A |\" +\n\t\t\"5 9 T Q A |\" +\n\t\t\"4 9 T Q A |\" +\n\t\t\"3 9 T Q A |\" +\n\t\t\"2 9 T Q A |\" +\n\t\t\"7 8 T Q A |\" +\n\t\t\"6 8 T Q A |\" +\n\t\t\"5 8 T Q A |\" +\n\t\t\"4 8 T Q A |\" +\n\t\t\"3 8 T Q A |\" +\n\t\t\"2 8 T Q A |\" +\n\t\t\"6 7 T Q A |\" +\n\t\t\"5 7 T Q A |\" +\n\t\t\"4 7 T Q A |\" +\n\t\t\"3 7 T Q A |\" +\n\t\t\"2 7 T Q A |\" +\n\t\t\"5 6 T Q A |\" +\n\t\t\"4 6 T Q A |\" +\n\t\t\"3 6 T Q A |\" +\n\t\t\"2 6 T Q A |\" +\n\t\t\"4 5 T Q A |\" +\n\t\t\"3 5 T Q A |\" +\n\t\t\"2 5 T Q A |\" +\n\t\t\"3 4 T Q A |\" +\n\t\t\"2 4 T Q A |\" +\n\t\t\"2 3 T Q A |\" +\n\t\t\"7 8 9 Q A |\" +\n\t\t\"6 8 9 Q A |\" +\n\t\t\"5 8 9 Q A |\" +\n\t\t\"4 8 9 Q A |\" +\n\t\t\"3 8 9 Q A |\" +\n\t\t\"2 8 9 Q A |\" +\n\t\t\"6 7 9 Q A |\" +\n\t\t\"5 7 9 Q A |\" +\n\t\t\"4 7 9 Q A |\" +\n\t\t\"3 7 9 Q A |\" +\n\t\t\"2 7 9 Q A |\" +\n\t\t\"5 6 9 Q A |\" +\n\t\t\"4 6 9 Q A |\" +\n\t\t\"3 6 9 Q A |\" +\n\t\t\"2 6 9 Q A |\" +\n\t\t\"4 5 9 Q A |\" +\n\t\t\"3 5 9 Q A |\" +\n\t\t\"2 5 9 Q A |\" +\n\t\t\"3 4 9 Q A |\" +\n\t\t\"2 4 9 Q A |\" +\n\t\t\"2 3 9 Q A |\" +\n\t\t\"6 7 8 Q A |\" +\n\t\t\"5 7 8 Q A |\" +\n\t\t\"4 7 8 Q A |\" +\n\t\t\"3 7 8 Q A |\" +\n\t\t\"2 7 8 Q A |\" +\n\t\t\"5 6 8 Q A |\" +\n\t\t\"4 6 8 Q A |\" +\n\t\t\"3 6 8 Q A |\" +\n\t\t\"2 6 8 Q A |\" +\n\t\t\"4 5 8 Q A |\" +\n\t\t\"3 5 8 Q A |\" +\n\t\t\"2 5 8 Q A |\" +\n\t\t\"3 4 8 Q A |\" +\n\t\t\"2 4 8 Q A |\" +\n\t\t\"2 3 8 Q A |\" +\n\t\t\"5 6 7 Q A |\" +\n\t\t\"4 6 7 Q A |\" +\n\t\t\"3 6 7 Q A |\" +\n\t\t\"2 6 7 Q A |\" +\n\t\t\"4 5 7 Q A |\" +\n\t\t\"3 5 7 Q A |\" +\n\t\t\"2 5 7 Q A |\" +\n\t\t\"3 4 7 Q A |\" +\n\t\t\"2 4 7 Q A |\" +\n\t\t\"2 3 7 Q A |\" +\n\t\t\"4 5 6 Q A |\" +\n\t\t\"3 5 6 Q A |\" +\n\t\t\"2 5 6 Q A |\" +\n\t\t\"3 4 6 Q A |\" +\n\t\t\"2 4 6 Q A |\" +\n\t\t\"2 3 6 Q A |\" +\n\t\t\"3 4 5 Q A |\" +\n\t\t\"2 4 5 Q A |\" +\n\t\t\"2 3 5 Q A |\" +\n\t\t\"2 3 4 Q A |\" +\n\t\t\"8 9 T J A |\" +\n\t\t\"7 9 T J A |\" +\n\t\t\"6 9 T J A |\" +\n\t\t\"5 9 T J A |\" +\n\t\t\"4 9 T J A |\" +\n\t\t\"3 9 T J A |\" +\n\t\t\"2 9 T J A |\" +\n\t\t\"7 8 T J A |\" +\n\t\t\"6 8 T J A |\" +\n\t\t\"5 8 T J A |\" +\n\t\t\"4 8 T J A |\" +\n\t\t\"3 8 T J A |\" +\n\t\t\"2 8 T J A |\" +\n\t\t\"6 7 T J A |\" +\n\t\t\"5 7 T J A |\" +\n\t\t\"4 7 T J A |\" +\n\t\t\"3 7 T J A |\" +\n\t\t\"2 7 T J A |\" +\n\t\t\"5 6 T J A |\" +\n\t\t\"4 6 T J A |\" +\n\t\t\"3 6 T J A |\" +\n\t\t\"2 6 T J A |\" +\n\t\t\"4 5 T J A |\" +\n\t\t\"3 5 T J A |\" +\n\t\t\"2 5 T J A |\" +\n\t\t\"3 4 T J A |\" +\n\t\t\"2 4 T J A |\" +\n\t\t\"2 3 T J A |\" +\n\t\t\"7 8 9 J A |\" +\n\t\t\"6 8 9 J A |\" +\n\t\t\"5 8 9 J A |\" +\n\t\t\"4 8 9 J A |\" +\n\t\t\"3 8 9 J A |\" +\n\t\t\"2 8 9 J A |\" +\n\t\t\"6 7 9 J A |\" +\n\t\t\"5 7 9 J A |\" +\n\t\t\"4 7 9 J A |\" +\n\t\t\"3 7 9 J A |\" +\n\t\t\"2 7 9 J A |\" +\n\t\t\"5 6 9 J A |\" +\n\t\t\"4 6 9 J A |\" +\n\t\t\"3 6 9 J A |\" +\n\t\t\"2 6 9 J A |\" +\n\t\t\"4 5 9 J A |\" +\n\t\t\"3 5 9 J A |\" +\n\t\t\"2 5 9 J A |\" +\n\t\t\"3 4 9 J A |\" +\n\t\t\"2 4 9 J A |\" +\n\t\t\"2 3 9 J A |\" +\n\t\t\"6 7 8 J A |\" +\n\t\t\"5 7 8 J A |\" +\n\t\t\"4 7 8 J A |\" +\n\t\t\"3 7 8 J A |\" +\n\t\t\"2 7 8 J A |\" +\n\t\t\"5 6 8 J A |\" +\n\t\t\"4 6 8 J A |\" +\n\t\t\"3 6 8 J A |\" +\n\t\t\"2 6 8 J A |\" +\n\t\t\"4 5 8 J A |\" +\n\t\t\"3 5 8 J A |\" +\n\t\t\"2 5 8 J A |\" +\n\t\t\"3 4 8 J A |\" +\n\t\t\"2 4 8 J A |\" +\n\t\t\"2 3 8 J A |\" +\n\t\t\"5 6 7 J A |\" +\n\t\t\"4 6 7 J A |\" +\n\t\t\"3 6 7 J A |\" +\n\t\t\"2 6 7 J A |\" +\n\t\t\"4 5 7 J A |\" +\n\t\t\"3 5 7 J A |\" +\n\t\t\"2 5 7 J A |\" +\n\t\t\"3 4 7 J A |\" +\n\t\t\"2 4 7 J A |\" +\n\t\t\"2 3 7 J A |\" +\n\t\t\"4 5 6 J A |\" +\n\t\t\"3 5 6 J A |\" +\n\t\t\"2 5 6 J A |\" +\n\t\t\"3 4 6 J A |\" +\n\t\t\"2 4 6 J A |\" +\n\t\t\"2 3 6 J A |\" +\n\t\t\"3 4 5 J A |\" +\n\t\t\"2 4 5 J A |\" +\n\t\t\"2 3 5 J A |\" +\n\t\t\"2 3 4 J A |\" +\n\t\t\"7 8 9 T A |\" +\n\t\t\"6 8 9 T A |\" +\n\t\t\"5 8 9 T A |\" +\n\t\t\"4 8 9 T A |\" +\n\t\t\"3 8 9 T A |\" +\n\t\t\"2 8 9 T A |\" +\n\t\t\"6 7 9 T A |\" +\n\t\t\"5 7 9 T A |\" +\n\t\t\"4 7 9 T A |\" +\n\t\t\"3 7 9 T A |\" +\n\t\t\"2 7 9 T A |\" +\n\t\t\"5 6 9 T A |\" +\n\t\t\"4 6 9 T A |\" +\n\t\t\"3 6 9 T A |\" +\n\t\t\"2 6 9 T A |\" +\n\t\t\"4 5 9 T A |\" +\n\t\t\"3 5 9 T A |\" +\n\t\t\"2 5 9 T A |\" +\n\t\t\"3 4 9 T A |\" +\n\t\t\"2 4 9 T A |\" +\n\t\t\"2 3 9 T A |\" +\n\t\t\"6 7 8 T A |\" +\n\t\t\"5 7 8 T A |\" +\n\t\t\"4 7 8 T A |\" +\n\t\t\"3 7 8 T A |\" +\n\t\t\"2 7 8 T A |\" +\n\t\t\"5 6 8 T A |\" +\n\t\t\"4 6 8 T A |\" +\n\t\t\"3 6 8 T A |\" +\n\t\t\"2 6 8 T A |\" +\n\t\t\"4 5 8 T A |\" +\n\t\t\"3 5 8 T A |\" +\n\t\t\"2 5 8 T A |\" +\n\t\t\"3 4 8 T A |\" +\n\t\t\"2 4 8 T A |\" +\n\t\t\"2 3 8 T A |\" +\n\t\t\"5 6 7 T A |\" +\n\t\t\"4 6 7 T A |\" +\n\t\t\"3 6 7 T A |\" +\n\t\t\"2 6 7 T A |\" +\n\t\t\"4 5 7 T A |\" +\n\t\t\"3 5 7 T A |\" +\n\t\t\"2 5 7 T A |\" +\n\t\t\"3 4 7 T A |\" +\n\t\t\"2 4 7 T A |\" +\n\t\t\"2 3 7 T A |\" +\n\t\t\"4 5 6 T A |\" +\n\t\t\"3 5 6 T A |\" +\n\t\t\"2 5 6 T A |\" +\n\t\t\"3 4 6 T A |\" +\n\t\t\"2 4 6 T A |\" +\n\t\t\"2 3 6 T A |\" +\n\t\t\"3 4 5 T A |\" +\n\t\t\"2 4 5 T A |\" +\n\t\t\"2 3 5 T A |\" +\n\t\t\"2 3 4 T A |\" +\n\t\t\"6 7 8 9 A |\" +\n\t\t\"5 7 8 9 A |\" +\n\t\t\"4 7 8 9 A |\" +\n\t\t\"3 7 8 9 A |\" +\n\t\t\"2 7 8 9 A |\" +\n\t\t\"5 6 8 9 A |\" +\n\t\t\"4 6 8 9 A |\" +\n\t\t\"3 6 8 9 A |\" +\n\t\t\"2 6 8 9 A |\" +\n\t\t\"4 5 8 9 A |\" +\n\t\t\"3 5 8 9 A |\" +\n\t\t\"2 5 8 9 A |\" +\n\t\t\"3 4 8 9 A |\" +\n\t\t\"2 4 8 9 A |\" +\n\t\t\"2 3 8 9 A |\" +\n\t\t\"5 6 7 9 A |\" +\n\t\t\"4 6 7 9 A |\" +\n\t\t\"3 6 7 9 A |\" +\n\t\t\"2 6 7 9 A |\" +\n\t\t\"4 5 7 9 A |\" +\n\t\t\"3 5 7 9 A |\" +\n\t\t\"2 5 7 9 A |\" +\n\t\t\"3 4 7 9 A |\" +\n\t\t\"2 4 7 9 A |\" +\n\t\t\"2 3 7 9 A |\" +\n\t\t\"4 5 6 9 A |\" +\n\t\t\"3 5 6 9 A |\" +\n\t\t\"2 5 6 9 A |\" +\n\t\t\"3 4 6 9 A |\" +\n\t\t\"2 4 6 9 A |\" +\n\t\t\"2 3 6 9 A |\" +\n\t\t\"3 4 5 9 A |\" +\n\t\t\"2 4 5 9 A |\" +\n\t\t\"2 3 5 9 A |\" +\n\t\t\"2 3 4 9 A |\" +\n\t\t\"5 6 7 8 A |\" +\n\t\t\"4 6 7 8 A |\" +\n\t\t\"3 6 7 8 A |\" +\n\t\t\"2 6 7 8 A |\" +\n\t\t\"4 5 7 8 A |\" +\n\t\t\"3 5 7 8 A |\" +\n\t\t\"2 5 7 8 A |\" +\n\t\t\"3 4 7 8 A |\" +\n\t\t\"2 4 7 8 A |\" +\n\t\t\"2 3 7 8 A |\" +\n\t\t\"4 5 6 8 A |\" +\n\t\t\"3 5 6 8 A |\" +\n\t\t\"2 5 6 8 A |\" +\n\t\t\"3 4 6 8 A |\" +\n\t\t\"2 4 6 8 A |\" +\n\t\t\"2 3 6 8 A |\" +\n\t\t\"3 4 5 8 A |\" +\n\t\t\"2 4 5 8 A |\" +\n\t\t\"2 3 5 8 A |\" +\n\t\t\"2 3 4 8 A |\" +\n\t\t\"4 5 6 7 A |\" +\n\t\t\"3 5 6 7 A |\" +\n\t\t\"2 5 6 7 A |\" +\n\t\t\"3 4 6 7 A |\" +\n\t\t\"2 4 6 7 A |\" +\n\t\t\"2 3 6 7 A |\" +\n\t\t\"3 4 5 7 A |\" +\n\t\t\"2 4 5 7 A |\" +\n\t\t\"2 3 5 7 A |\" +\n\t\t\"2 3 4 7 A |\" +\n\t\t\"3 4 5 6 A |\" +\n\t\t\"2 4 5 6 A |\" +\n\t\t\"2 3 5 6 A |\" +\n\t\t\"2 3 4 6 A |\" +\n\t\t\"8 T J Q K |\" +\n\t\t\"7 T J Q K |\" +\n\t\t\"6 T J Q K |\" +\n\t\t\"5 T J Q K |\" +\n\t\t\"4 T J Q K |\" +\n\t\t\"3 T J Q K |\" +\n\t\t\"2 T J Q K |\" +\n\t\t\"8 9 J Q K |\" +\n\t\t\"7 9 J Q K |\" +\n\t\t\"6 9 J Q K |\" +\n\t\t\"5 9 J Q K |\" +\n\t\t\"4 9 J Q K |\" +\n\t\t\"3 9 J Q K |\" +\n\t\t\"2 9 J Q K |\" +\n\t\t\"7 8 J Q K |\" +\n\t\t\"6 8 J Q K |\" +\n\t\t\"5 8 J Q K |\" +\n\t\t\"4 8 J Q K |\" +\n\t\t\"3 8 J Q K |\" +\n\t\t\"2 8 J Q K |\" +\n\t\t\"6 7 J Q K |\" +\n\t\t\"5 7 J Q K |\" +\n\t\t\"4 7 J Q K |\" +\n\t\t\"3 7 J Q K |\" +\n\t\t\"2 7 J Q K |\" +\n\t\t\"5 6 J Q K |\" +\n\t\t\"4 6 J Q K |\" +\n\t\t\"3 6 J Q K |\" +\n\t\t\"2 6 J Q K |\" +\n\t\t\"4 5 J Q K |\" +\n\t\t\"3 5 J Q K |\" +\n\t\t\"2 5 J Q K |\" +\n\t\t\"3 4 J Q K |\" +\n\t\t\"2 4 J Q K |\" +\n\t\t\"2 3 J Q K |\" +\n\t\t\"8 9 T Q K |\" +\n\t\t\"7 9 T Q K |\" +\n\t\t\"6 9 T Q K |\" +\n\t\t\"5 9 T Q K |\" +\n\t\t\"4 9 T Q K |\" +\n\t\t\"3 9 T Q K |\" +\n\t\t\"2 9 T Q K |\" +\n\t\t\"7 8 T Q K |\" +\n\t\t\"6 8 T Q K |\" +\n\t\t\"5 8 T Q K |\" +\n\t\t\"4 8 T Q K |\" +\n\t\t\"3 8 T Q K |\" +\n\t\t\"2 8 T Q K |\" +\n\t\t\"6 7 T Q K |\" +\n\t\t\"5 7 T Q K |\" +\n\t\t\"4 7 T Q K |\" +\n\t\t\"3 7 T Q K |\" +\n\t\t\"2 7 T Q K |\" +\n\t\t\"5 6 T Q K |\" +\n\t\t\"4 6 T Q K |\" +\n\t\t\"3 6 T Q K |\" +\n\t\t\"2 6 T Q K |\" +\n\t\t\"4 5 T Q K |\" +\n\t\t\"3 5 T Q K |\" +\n\t\t\"2 5 T Q K |\" +\n\t\t\"3 4 T Q K |\" +\n\t\t\"2 4 T Q K |\" +\n\t\t\"2 3 T Q K |\" +\n\t\t\"7 8 9 Q K |\" +\n\t\t\"6 8 9 Q K |\" +\n\t\t\"5 8 9 Q K |\" +\n\t\t\"4 8 9 Q K |\" +\n\t\t\"3 8 9 Q K |\" +\n\t\t\"2 8 9 Q K |\" +\n\t\t\"6 7 9 Q K |\" +\n\t\t\"5 7 9 Q K |\" +\n\t\t\"4 7 9 Q K |\" +\n\t\t\"3 7 9 Q K |\" +\n\t\t\"2 7 9 Q K |\" +\n\t\t\"5 6 9 Q K |\" +\n\t\t\"4 6 9 Q K |\" +\n\t\t\"3 6 9 Q K |\" +\n\t\t\"2 6 9 Q K |\" +\n\t\t\"4 5 9 Q K |\" +\n\t\t\"3 5 9 Q K |\" +\n\t\t\"2 5 9 Q K |\" +\n\t\t\"3 4 9 Q K |\" +\n\t\t\"2 4 9 Q K |\" +\n\t\t\"2 3 9 Q K |\" +\n\t\t\"6 7 8 Q K |\" +\n\t\t\"5 7 8 Q K |\" +\n\t\t\"4 7 8 Q K |\" +\n\t\t\"3 7 8 Q K |\" +\n\t\t\"2 7 8 Q K |\" +\n\t\t\"5 6 8 Q K |\" +\n\t\t\"4 6 8 Q K |\" +\n\t\t\"3 6 8 Q K |\" +\n\t\t\"2 6 8 Q K |\" +\n\t\t\"4 5 8 Q K |\" +\n\t\t\"3 5 8 Q K |\" +\n\t\t\"2 5 8 Q K |\" +\n\t\t\"3 4 8 Q K |\" +\n\t\t\"2 4 8 Q K |\" +\n\t\t\"2 3 8 Q K |\" +\n\t\t\"5 6 7 Q K |\" +\n\t\t\"4 6 7 Q K |\" +\n\t\t\"3 6 7 Q K |\" +\n\t\t\"2 6 7 Q K |\" +\n\t\t\"4 5 7 Q K |\" +\n\t\t\"3 5 7 Q K |\" +\n\t\t\"2 5 7 Q K |\" +\n\t\t\"3 4 7 Q K |\" +\n\t\t\"2 4 7 Q K |\" +\n\t\t\"2 3 7 Q K |\" +\n\t\t\"4 5 6 Q K |\" +\n\t\t\"3 5 6 Q K |\" +\n\t\t\"2 5 6 Q K |\" +\n\t\t\"3 4 6 Q K |\" +\n\t\t\"2 4 6 Q K |\" +\n\t\t\"2 3 6 Q K |\" +\n\t\t\"3 4 5 Q K |\" +\n\t\t\"2 4 5 Q K |\" +\n\t\t\"2 3 5 Q K |\" +\n\t\t\"2 3 4 Q K |\" +\n\t\t\"8 9 T J K |\" +\n\t\t\"7 9 T J K |\" +\n\t\t\"6 9 T J K |\" +\n\t\t\"5 9 T J K |\" +\n\t\t\"4 9 T J K |\" +\n\t\t\"3 9 T J K |\" +\n\t\t\"2 9 T J K |\" +\n\t\t\"7 8 T J K |\" +\n\t\t\"6 8 T J K |\" +\n\t\t\"5 8 T J K |\" +\n\t\t\"4 8 T J K |\" +\n\t\t\"3 8 T J K |\" +\n\t\t\"2 8 T J K |\" +\n\t\t\"6 7 T J K |\" +\n\t\t\"5 7 T J K |\" +\n\t\t\"4 7 T J K |\" +\n\t\t\"3 7 T J K |\" +\n\t\t\"2 7 T J K |\" +\n\t\t\"5 6 T J K |\" +\n\t\t\"4 6 T J K |\" +\n\t\t\"3 6 T J K |\" +\n\t\t\"2 6 T J K |\" +\n\t\t\"4 5 T J K |\" +\n\t\t\"3 5 T J K |\" +\n\t\t\"2 5 T J K |\" +\n\t\t\"3 4 T J K |\" +\n\t\t\"2 4 T J K |\" +\n\t\t\"2 3 T J K |\" +\n\t\t\"7 8 9 J K |\" +\n\t\t\"6 8 9 J K |\" +\n\t\t\"5 8 9 J K |\" +\n\t\t\"4 8 9 J K |\" +\n\t\t\"3 8 9 J K |\" +\n\t\t\"2 8 9 J K |\" +\n\t\t\"6 7 9 J K |\" +\n\t\t\"5 7 9 J K |\" +\n\t\t\"4 7 9 J K |\" +\n\t\t\"3 7 9 J K |\" +\n\t\t\"2 7 9 J K |\" +\n\t\t\"5 6 9 J K |\" +\n\t\t\"4 6 9 J K |\" +\n\t\t\"3 6 9 J K |\" +\n\t\t\"2 6 9 J K |\" +\n\t\t\"4 5 9 J K |\" +\n\t\t\"3 5 9 J K |\" +\n\t\t\"2 5 9 J K |\" +\n\t\t\"3 4 9 J K |\" +\n\t\t\"2 4 9 J K |\" +\n\t\t\"2 3 9 J K |\" +\n\t\t\"6 7 8 J K |\" +\n\t\t\"5 7 8 J K |\" +\n\t\t\"4 7 8 J K |\" +\n\t\t\"3 7 8 J K |\" +\n\t\t\"2 7 8 J K |\" +\n\t\t\"5 6 8 J K |\" +\n\t\t\"4 6 8 J K |\" +\n\t\t\"3 6 8 J K |\" +\n\t\t\"2 6 8 J K |\" +\n\t\t\"4 5 8 J K |\" +\n\t\t\"3 5 8 J K |\" +\n\t\t\"2 5 8 J K |\" +\n\t\t\"3 4 8 J K |\" +\n\t\t\"2 4 8 J K |\" +\n\t\t\"2 3 8 J K |\" +\n\t\t\"5 6 7 J K |\" +\n\t\t\"4 6 7 J K |\" +\n\t\t\"3 6 7 J K |\" +\n\t\t\"2 6 7 J K |\" +\n\t\t\"4 5 7 J K |\" +\n\t\t\"3 5 7 J K |\" +\n\t\t\"2 5 7 J K |\" +\n\t\t\"3 4 7 J K |\" +\n\t\t\"2 4 7 J K |\" +\n\t\t\"2 3 7 J K |\" +\n\t\t\"4 5 6 J K |\" +\n\t\t\"3 5 6 J K |\" +\n\t\t\"2 5 6 J K |\" +\n\t\t\"3 4 6 J K |\" +\n\t\t\"2 4 6 J K |\" +\n\t\t\"2 3 6 J K |\" +\n\t\t\"3 4 5 J K |\" +\n\t\t\"2 4 5 J K |\" +\n\t\t\"2 3 5 J K |\" +\n\t\t\"2 3 4 J K |\" +\n\t\t\"7 8 9 T K |\" +\n\t\t\"6 8 9 T K |\" +\n\t\t\"5 8 9 T K |\" +\n\t\t\"4 8 9 T K |\" +\n\t\t\"3 8 9 T K |\" +\n\t\t\"2 8 9 T K |\" +\n\t\t\"6 7 9 T K |\" +\n\t\t\"5 7 9 T K |\" +\n\t\t\"4 7 9 T K |\" +\n\t\t\"3 7 9 T K |\" +\n\t\t\"2 7 9 T K |\" +\n\t\t\"5 6 9 T K |\" +\n\t\t\"4 6 9 T K |\" +\n\t\t\"3 6 9 T K |\" +\n\t\t\"2 6 9 T K |\" +\n\t\t\"4 5 9 T K |\" +\n\t\t\"3 5 9 T K |\" +\n\t\t\"2 5 9 T K |\" +\n\t\t\"3 4 9 T K |\" +\n\t\t\"2 4 9 T K |\" +\n\t\t\"2 3 9 T K |\" +\n\t\t\"6 7 8 T K |\" +\n\t\t\"5 7 8 T K |\" +\n\t\t\"4 7 8 T K |\" +\n\t\t\"3 7 8 T K |\" +\n\t\t\"2 7 8 T K |\" +\n\t\t\"5 6 8 T K |\" +\n\t\t\"4 6 8 T K |\" +\n\t\t\"3 6 8 T K |\" +\n\t\t\"2 6 8 T K |\" +\n\t\t\"4 5 8 T K |\" +\n\t\t\"3 5 8 T K |\" +\n\t\t\"2 5 8 T K |\" +\n\t\t\"3 4 8 T K |\" +\n\t\t\"2 4 8 T K |\" +\n\t\t\"2 3 8 T K |\" +\n\t\t\"5 6 7 T K |\" +\n\t\t\"4 6 7 T K |\" +\n\t\t\"3 6 7 T K |\" +\n\t\t\"2 6 7 T K |\" +\n\t\t\"4 5 7 T K |\" +\n\t\t\"3 5 7 T K |\" +\n\t\t\"2 5 7 T K |\" +\n\t\t\"3 4 7 T K |\" +\n\t\t\"2 4 7 T K |\" +\n\t\t\"2 3 7 T K |\" +\n\t\t\"4 5 6 T K |\" +\n\t\t\"3 5 6 T K |\" +\n\t\t\"2 5 6 T K |\" +\n\t\t\"3 4 6 T K |\" +\n\t\t\"2 4 6 T K |\" +\n\t\t\"2 3 6 T K |\" +\n\t\t\"3 4 5 T K |\" +\n\t\t\"2 4 5 T K |\" +\n\t\t\"2 3 5 T K |\" +\n\t\t\"2 3 4 T K |\" +\n\t\t\"6 7 8 9 K |\" +\n\t\t\"5 7 8 9 K |\" +\n\t\t\"4 7 8 9 K |\" +\n\t\t\"3 7 8 9 K |\" +\n\t\t\"2 7 8 9 K |\" +\n\t\t\"5 6 8 9 K |\" +\n\t\t\"4 6 8 9 K |\" +\n\t\t\"3 6 8 9 K |\" +\n\t\t\"2 6 8 9 K |\" +\n\t\t\"4 5 8 9 K |\" +\n\t\t\"3 5 8 9 K |\" +\n\t\t\"2 5 8 9 K |\" +\n\t\t\"3 4 8 9 K |\" +\n\t\t\"2 4 8 9 K |\" +\n\t\t\"2 3 8 9 K |\" +\n\t\t\"5 6 7 9 K |\" +\n\t\t\"4 6 7 9 K |\" +\n\t\t\"3 6 7 9 K |\" +\n\t\t\"2 6 7 9 K |\" +\n\t\t\"4 5 7 9 K |\" +\n\t\t\"3 5 7 9 K |\" +\n\t\t\"2 5 7 9 K |\" +\n\t\t\"3 4 7 9 K |\" +\n\t\t\"2 4 7 9 K |\" +\n\t\t\"2 3 7 9 K |\" +\n\t\t\"4 5 6 9 K |\" +\n\t\t\"3 5 6 9 K |\" +\n\t\t\"2 5 6 9 K |\" +\n\t\t\"3 4 6 9 K |\" +\n\t\t\"2 4 6 9 K |\" +\n\t\t\"2 3 6 9 K |\" +\n\t\t\"3 4 5 9 K |\" +\n\t\t\"2 4 5 9 K |\" +\n\t\t\"2 3 5 9 K |\" +\n\t\t\"2 3 4 9 K |\" +\n\t\t\"5 6 7 8 K |\" +\n\t\t\"4 6 7 8 K |\" +\n\t\t\"3 6 7 8 K |\" +\n\t\t\"2 6 7 8 K |\" +\n\t\t\"4 5 7 8 K |\" +\n\t\t\"3 5 7 8 K |\" +\n\t\t\"2 5 7 8 K |\" +\n\t\t\"3 4 7 8 K |\" +\n\t\t\"2 4 7 8 K |\" +\n\t\t\"2 3 7 8 K |\" +\n\t\t\"4 5 6 8 K |\" +\n\t\t\"3 5 6 8 K |\" +\n\t\t\"2 5 6 8 K |\" +\n\t\t\"3 4 6 8 K |\" +\n\t\t\"2 4 6 8 K |\" +\n\t\t\"2 3 6 8 K |\" +\n\t\t\"3 4 5 8 K |\" +\n\t\t\"2 4 5 8 K |\" +\n\t\t\"2 3 5 8 K |\" +\n\t\t\"2 3 4 8 K |\" +\n\t\t\"4 5 6 7 K |\" +\n\t\t\"3 5 6 7 K |\" +\n\t\t\"2 5 6 7 K |\" +\n\t\t\"3 4 6 7 K |\" +\n\t\t\"2 4 6 7 K |\" +\n\t\t\"2 3 6 7 K |\" +\n\t\t\"3 4 5 7 K |\" +\n\t\t\"2 4 5 7 K |\" +\n\t\t\"2 3 5 7 K |\" +\n\t\t\"2 3 4 7 K |\" +\n\t\t\"3 4 5 6 K |\" +\n\t\t\"2 4 5 6 K |\" +\n\t\t\"2 3 5 6 K |\" +\n\t\t\"2 3 4 6 K |\" +\n\t\t\"2 3 4 5 K |\" +\n\t\t\"7 9 T J Q |\" +\n\t\t\"6 9 T J Q |\" +\n\t\t\"5 9 T J Q |\" +\n\t\t\"4 9 T J Q |\" +\n\t\t\"3 9 T J Q |\" +\n\t\t\"2 9 T J Q |\" +\n\t\t\"7 8 T J Q |\" +\n\t\t\"6 8 T J Q |\" +\n\t\t\"5 8 T J Q |\" +\n\t\t\"4 8 T J Q |\" +\n\t\t\"3 8 T J Q |\" +\n\t\t\"2 8 T J Q |\" +\n\t\t\"6 7 T J Q |\" +\n\t\t\"5 7 T J Q |\" +\n\t\t\"4 7 T J Q |\" +\n\t\t\"3 7 T J Q |\" +\n\t\t\"2 7 T J Q |\" +\n\t\t\"5 6 T J Q |\" +\n\t\t\"4 6 T J Q |\" +\n\t\t\"3 6 T J Q |\" +\n\t\t\"2 6 T J Q |\" +\n\t\t\"4 5 T J Q |\" +\n\t\t\"3 5 T J Q |\" +\n\t\t\"2 5 T J Q |\" +\n\t\t\"3 4 T J Q |\" +\n\t\t\"2 4 T J Q |\" +\n\t\t\"2 3 T J Q |\" +\n\t\t\"7 8 9 J Q |\" +\n\t\t\"6 8 9 J Q |\" +\n\t\t\"5 8 9 J Q |\" +\n\t\t\"4 8 9 J Q |\" +\n\t\t\"3 8 9 J Q |\" +\n\t\t\"2 8 9 J Q |\" +\n\t\t\"6 7 9 J Q |\" +\n\t\t\"5 7 9 J Q |\" +\n\t\t\"4 7 9 J Q |\" +\n\t\t\"3 7 9 J Q |\" +\n\t\t\"2 7 9 J Q |\" +\n\t\t\"5 6 9 J Q |\" +\n\t\t\"4 6 9 J Q |\" +\n\t\t\"3 6 9 J Q |\" +\n\t\t\"2 6 9 J Q |\" +\n\t\t\"4 5 9 J Q |\" +\n\t\t\"3 5 9 J Q |\" +\n\t\t\"2 5 9 J Q |\" +\n\t\t\"3 4 9 J Q |\" +\n\t\t\"2 4 9 J Q |\" +\n\t\t\"2 3 9 J Q |\" +\n\t\t\"6 7 8 J Q |\" +\n\t\t\"5 7 8 J Q |\" +\n\t\t\"4 7 8 J Q |\" +\n\t\t\"3 7 8 J Q |\" +\n\t\t\"2 7 8 J Q |\" +\n\t\t\"5 6 8 J Q |\" +\n\t\t\"4 6 8 J Q |\" +\n\t\t\"3 6 8 J Q |\" +\n\t\t\"2 6 8 J Q |\" +\n\t\t\"4 5 8 J Q |\" +\n\t\t\"3 5 8 J Q |\" +\n\t\t\"2 5 8 J Q |\" +\n\t\t\"3 4 8 J Q |\" +\n\t\t\"2 4 8 J Q |\" +\n\t\t\"2 3 8 J Q |\" +\n\t\t\"5 6 7 J Q |\" +\n\t\t\"4 6 7 J Q |\" +\n\t\t\"3 6 7 J Q |\" +\n\t\t\"2 6 7 J Q |\" +\n\t\t\"4 5 7 J Q |\" +\n\t\t\"3 5 7 J Q |\" +\n\t\t\"2 5 7 J Q |\" +\n\t\t\"3 4 7 J Q |\" +\n\t\t\"2 4 7 J Q |\" +\n\t\t\"2 3 7 J Q |\" +\n\t\t\"4 5 6 J Q |\" +\n\t\t\"3 5 6 J Q |\" +\n\t\t\"2 5 6 J Q |\" +\n\t\t\"3 4 6 J Q |\" +\n\t\t\"2 4 6 J Q |\" +\n\t\t\"2 3 6 J Q |\" +\n\t\t\"3 4 5 J Q |\" +\n\t\t\"2 4 5 J Q |\" +\n\t\t\"2 3 5 J Q |\" +\n\t\t\"2 3 4 J Q |\" +\n\t\t\"7 8 9 T Q |\" +\n\t\t\"6 8 9 T Q |\" +\n\t\t\"5 8 9 T Q |\" +\n\t\t\"4 8 9 T Q |\" +\n\t\t\"3 8 9 T Q |\" +\n\t\t\"2 8 9 T Q |\" +\n\t\t\"6 7 9 T Q |\" +\n\t\t\"5 7 9 T Q\"\n\n\tarray := strings.Split(s, \" |\")\n\n\tvar oldValue uint32\n\tfor _, v := range array {\n\t\tcards := &Cards{}\n\t\tcards.SetByString(v)\n\t\t//t.Log(cards.String())\n\n\t\tk, value := De(cards.GetType())\n\t\tif oldValue == 0 {\n\t\t\toldValue = value\n\t\t\tcontinue\n\t\t}\n\n\t\tassert.Equal(t, oldValue > value, true)\n\t\tassert.Equal(t, k, FLUSH)\n\t\t//assert.Equal(t,v,uint32(6))\n\t\t//t.Log(De(cards.FullFouse(cards.Counter())))\n\t}\n\n}\n"
},
{
"path": "src/server/algorithm/pk.go",
"content": "package algorithm\n\nfunc (this *Cards) Counter() *ValueCounter {\n\tvar counter ValueCounter\n\tcounter.Set(*this)\n\treturn &counter\n}\nfunc (this *Cards) GetType() uint32 {\n\tif len(*this) == 0 {\n\t\treturn 0\n\t}\n\n\tcounter := this.Counter()\n\tASort(*this, 0, int8(len(*this))-1, counter)\n\n\tif res := this.royalFlush(); res > 0 {\n\t\treturn res\n\t}\n\n\tif res := this.straightFlush(); res > 0 {\n\t\treturn res\n\t}\n\n\tif res := this.four(counter); res > 0 {\n\t\treturn res\n\t}\n\n\tif res := this.fullFouse(counter); res > 0 {\n\t\treturn res\n\t}\n\n\tif res := this.flush(); res > 0 {\n\t\treturn res\n\t}\n\n\tif res := this.straight(); res > 0 {\n\t\treturn res\n\t}\n\tif res := this.three(counter); res > 0 {\n\t\treturn res\n\t}\n\tif res := this.twoPair(); res > 0 {\n\t\treturn res\n\t}\n\n\tif res := this.onePair(); res > 0 {\n\t\treturn res\n\t}\n\t//高牌（high card）\n\t//既不是同一花色也不是同一点数的五张牌组成。\n\t//平手牌：如果不止一人抓到此牌，则比较点数最大者，\n\t//如果点数最大的相同，则比较第二、第三、第四和第五大的，如果所有牌都相同，则平分彩池。\n\treturn En(HIGH_CARD, ToValue(*this))\n}\n"
},
{
"path": "src/server/algorithm/sort.go",
"content": "package algorithm\n\n// 对牌值从小到大排序，采用快速排序算法\nfunc SortCards(arr []byte, start, end int8) {\n\tif start < end {\n\t\ti, j := start, end\n\t\tcard := arr[(start+end)/2]\n\t\tkey := card & 0xF\n\t\tsuit := card >> 4\n\t\tfor i <= j {\n\t\t\tfor (arr[i])&0xF < key || ((arr[i])&0xF == key && arr[i]>>4 < suit) {\n\t\t\t\ti++\n\t\t\t}\n\t\t\tfor (arr[j])&0xF > key || ((arr[j])&0xF == key && arr[j]>>4 > suit) {\n\n\t\t\t\tj--\n\t\t\t}\n\t\t\tif i <= j {\n\t\t\t\tarr[i], arr[j] = arr[j], arr[i]\n\t\t\t\ti++\n\t\t\t\tj--\n\t\t\t}\n\t\t}\n\t\tif start < j {\n\t\t\tSortCards(arr, start, j)\n\t\t}\n\t\tif end > i {\n\t\t\tSortCards(arr, i, end)\n\t\t}\n\t}\n}\n\nfunc Sort(cards []byte, start, end int8) {\n\tif start < end {\n\t\ti, j := start, end\n\t\tcard := cards[(start+end)/2]\n\t\tfor i <= j {\n\t\t\tfor cards[i] < card {\n\t\t\t\ti++\n\t\t\t}\n\t\t\tfor cards[j] > card {\n\t\t\t\tj--\n\t\t\t}\n\t\t\tif i <= j {\n\t\t\t\tcards[i], cards[j] = cards[j], cards[i]\n\t\t\t\ti++\n\t\t\t\tj--\n\t\t\t}\n\t\t}\n\t\tif start < j {\n\t\t\tSort(cards, start, j)\n\t\t}\n\t\tif end > i {\n\t\t\tSort(cards, i, end)\n\t\t}\n\t}\n}\n\ntype ColorCounter uint16\n\nfunc (this *ColorCounter) Set(cards []byte) {\n\t//*this = 0\n\tl := uint8(len(cards))\n\tfor i := uint8(0); i < l; i++ {\n\t\tcard := (cards[i] >> 4) * 3\n\t\tcount := ((*this >> card) & 0x07) + 1\n\t\t*this &= (^(0x07 << card))\n\t\t*this |= (count << card)\n\t}\n}\n\nfunc (this *ColorCounter) Get(card byte) uint8 {\n\treturn uint8((*this >> (card >> 4) * 3 ) & 0x07)\n}\n\ntype ValueCounter uint64\n\nfunc (this *ValueCounter) Set(cards []byte) {\n\t//*this = 0\n\tl := uint8(len(cards))\n\tfor i := uint8(0); i < l; i++ {\n\t\tcard := (cards[i] & 0xF) * 3\n\t\tcount := ((*this >> card) & 0x07) + 1\n\t\t*this &= (^(0x07 << card))\n\t\t*this |= (count << card)\n\t}\n}\n\nfunc (this *ValueCounter) Get(card byte) uint8 {\n\treturn uint8((*this >> (card & 0xF * 3 )) & 0x07)\n}\n\nfunc ASort(arr []byte, start, end int8, counter *ValueCounter) {\n\tif start < end {\n\t\ti, j := start, end\n\t\tcard := arr[(start+end)/2]\n\t\tkey := card & 0xF\n\t\tcount := counter.Get(key)\n\t\tfor i <= j {\n\t\t\tfor (counter.Get(arr[i]&0xF) < count) || ((counter.Get(arr[i]&0xF) == count) && (arr[i])&0xF < key ) {\n\t\t\t\ti++\n\t\t\t}\n\t\t\tfor (counter.Get(arr[j]&0xF) > count) || ((counter.Get(arr[j]&0xF) == count) && (arr[j])&0xF > key ) {\n\n\t\t\t\tj--\n\t\t\t}\n\t\t\tif i <= j {\n\t\t\t\tarr[i], arr[j] = arr[j], arr[i]\n\t\t\t\ti++\n\t\t\t\tj--\n\t\t\t}\n\t\t}\n\t\tif start < j {\n\t\t\tASort(arr, start, j, counter)\n\t\t}\n\t\tif end > i {\n\t\t\tASort(arr, i, end, counter)\n\t\t}\n\t}\n}\n"
},
{
"path": "src/server/algorithm/sort_test.go",
"content": "package algorithm\n\nimport \"testing\"\n\nfunc Test11Base(t *testing.T) {\n\n\tcards := Cards{0x12, 0x03, 0x24, 0x35, 0x26, 0x17, 0x33}\n\tvar a ValueCounter\n\ta.Set(cards)\n\tASort(cards, 0, int8(len(cards) -1), &a)\n\n\tt.Logf(\"%#v \",cards)\n}\nfunc Test10Base(t *testing.T) {\n\tarr := Cards([]byte{1, 2, 3, 4, 4, 5, 6})\n\n\tarr.Shuffle()\n\n\tt.Logf(\"%#v \", arr)\n\n\tt.Logf(\"%#v \", arr)\n}\n"
},
{
"path": "src/server/algorithm/tostring.go",
"content": "package algorithm\n\nimport (\n\t\"strings\"\n\t\"fmt\"\n)\n\nfunc (this *Cards) Bytes() []byte {\n\tb := make([]byte, len(*this))\n\tfor k, v := range *this {\n\t\tb[k] = byte(v)\n\t}\n\treturn b\n}\nfunc (this *Cards) Len() int {\n\treturn len(*this)\n}\nfunc (this *Cards) Take() byte {\n\tcard := (*this)[0]\n\t(*this) = (*this)[1:]\n\treturn card\n}\nfunc (this *Cards) Append(cards ...byte) Cards {\n\tcs := make([]byte, 0, len(cards)+len(*this))\n\tcs = append(cs, (*this)...)\n\tcs = append(cs, cards...)\n\treturn cs\n}\n\nfunc (this *Cards) Equal(cards []byte) bool {\n\tif len(*this) != len(cards) {\n\t\treturn false\n\t}\n\tfor k, v := range *this {\n\t\tif cards[k] != v {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\nfunc Color(color byte) (char string) {\n\tswitch color {\n\tcase 0:\n\t\tchar = \"♦\"\n\tcase 1:\n\t\tchar = \"♣\"\n\tcase 2:\n\t\tchar = \"♥\"\n\tcase 3:\n\t\tchar = \"♠\"\n\t}\n\treturn\n}\n\nfunc String2Num(c byte) (n byte) {\n\tswitch c {\n\tcase '2':\n\t\tn = 2\n\tcase '3':\n\t\tn = 3\n\tcase '4':\n\t\tn = 4\n\tcase '5':\n\t\tn = 5\n\tcase '6':\n\t\tn = 6\n\tcase '7':\n\t\tn = 7\n\tcase '8':\n\t\tn = 8\n\tcase '9':\n\t\tn = 9\n\tcase 'T':\n\t\tn = 0xA\n\tcase 'J':\n\t\tn = 0xB\n\tcase 'Q':\n\t\tn = 0xC\n\tcase 'K':\n\t\tn = 0xD\n\tcase 'A':\n\t\tn = 0xE\n\t}\n\treturn\n}\nfunc Num2String(n byte) (c byte) {\n\tswitch n {\n\tcase 2:\n\t\tc = '2'\n\tcase 3:\n\t\tc = '3'\n\tcase 4:\n\t\tc = '4'\n\tcase 5:\n\t\tc = '5'\n\tcase 6:\n\t\tc = '6'\n\tcase 7:\n\t\tc = '7'\n\tcase 8:\n\t\tc = '8'\n\tcase 9:\n\t\tc = '9'\n\tcase 0xA:\n\t\tc = 'T'\n\tcase 0xB:\n\t\tc = 'J'\n\tcase 0xC:\n\t\tc = 'Q'\n\tcase 0xD:\n\t\tc = 'K'\n\tcase 0xE:\n\t\tc = 'A'\n\t}\n\treturn\n}\n\nfunc (this *Cards) SetByString(str string) {\n\tarray := strings.Split(str, \" \")\n\t*this = make([]byte, len(array))\n\tfor k, v := range array {\n\t\t(*this)[k] = String2Num(byte(v[0]))\n\t}\n\n}\nfunc (this *Cards) String() (str string) {\n\tfor k, v := range *this {\n\t\tcolor := Color(v)\n\t\tvalue := Num2String(v)\n\t\tstr += string(color) + string(value)\n\t\tif k < len(*this)-1 {\n\t\t\tstr += \" \"\n\t\t}\n\t}\n\treturn\n}\n\nfunc (this *Cards) Hex() string {\n\treturn fmt.Sprintf(\"%#v\", *this)\n}\n"
},
{
"path": "src/server/base/skeleton.go",
"content": "package base\n\nimport (\n\t\"github.com/dolotech/leaf/chanrpc\"\n\t\"github.com/dolotech/leaf/module\"\n\t\"server/conf\"\n)\n\nfunc NewSkeleton() *module.Skeleton {\n\tskeleton := &module.Skeleton{\n\t\tGoLen: conf.GoLen,\n\t\tTimerDispatcherLen: conf.TimerDispatcherLen,\n\t\tAsynCallLen: conf.AsynCallLen,\n\t\tChanRPCServer: chanrpc.NewServer(conf.ChanRPCLen),\n\t}\n\tskeleton.Init()\n\treturn skeleton\n}\n"
},
{
"path": "src/server/conf/conf.go",
"content": "package conf\n\nimport (\n\t\"log\"\n\t\"time\"\n)\n\nvar (\n\t// glog conf\n\tLogFlag = log.LstdFlags\n\n\t// gate conf\n\tPendingWriteNum = 2000\n\tMaxMsgLen uint32 = 4096\n\tHTTPTimeout = 10 * time.Second\n\tLenMsgLen = 2\n\tLittleEndian = false\n\n\t// skeleton conf\n\tGoLen = 10000\n\tTimerDispatcherLen = 10000\n\tAsynCallLen = 10000\n\tChanRPCLen = 10000\n)\n\n\n\nvar Server struct {\n\tWSAddr string\n\tCertFile string\n\tKeyFile string\n\tTCPAddr string\n\tMaxConnNum int\n\tDBMaxConnNum int\n\tDBUrl string\n}"
},
{
"path": "src/server/game/external.go",
"content": "package game\n\nimport (\n\t\"server/game/internal\"\n)\n\nvar (\n\tModule = new(internal.Module)//建立模块新的\n\tChanRPC = internal.ChanRPC\n)\n"
},
{
"path": "src/server/game/internal/chanrpc.go",
"content": "package internal\n\nimport (\n\t\"github.com/dolotech/leaf/gate\"\n\t\"github.com/golang/glog\"\n\t\"server/model\"\n\t\"github.com/dolotech/leaf/room\"\n)\n\nfunc init() {\n\tskeleton.RegisterChanRPC(model.Agent_New, rpcNewAgent)\n\tskeleton.RegisterChanRPC(model.Agent_Close, rpcCloseAgent)\n\tskeleton.RegisterChanRPC(model.Agent_Login, rpcLoginAgent)\n}\n\nfunc rpcNewAgent(a gate.Agent) {\n\tglog.Errorln(\"新建链接 \", a)\n}\n\nfunc rpcCloseAgent(a gate.Agent) {\n\tglog.Errorln(\"链接关闭 \", a)\n}\n\nfunc rpcLoginAgent(u *model.User, a gate.Agent) {\n\n\to := NewOccupant(u, a)\n\ta.SetUserData(o)\n\n\tif len(u.RoomID) > 0 {\n\t\to.room = room.GetRoom(u.RoomID)\n\t}\n\tglog.Errorln(\"rpcLoginAgent\", u)\n}\n"
},
{
"path": "src/server/game/internal/game_rule.go",
"content": "package internal\n\nimport (\n\t\"github.com/golang/glog\"\n\t\"server/protocol\"\n\t\"server/model\"\n\t\"server/algorithm\"\n\t\"time\"\n\t\"github.com/dolotech/lib/utils\"\n)\n\nfunc (r *Room) startDelay(startDelay *startDelay, o *Occupant) {\n\tif startDelay.kind == 0 {\n\t\tr.Info()\n\t\tr.start()\n\t}\n}\nfunc (r *Room) start() {\n\tif r.status == RUNNING {\n\t\treturn\n\t}\n\t// 产生庄\n\tvar dealer *Occupant\n\tbutton := r.Button - 1\n\tr.Each((button+1)%r.Cap(), func(o *Occupant) bool {\n\t\tr.Button = o.Pos\n\t\tdealer = o\n\t\treturn false\n\t})\n\n\tif dealer == nil {\n\t\treturn\n\t}\n\n\tr.remain = 0\n\tr.allin = 0\n\t// 剔除筹码小于大盲和离线的玩家\n\n\tn := 0\n\tr.Each(0, func(o *Occupant) bool {\n\t\tif o.chips < r.BB || o.IsOffline() {\n\t\t\to.SetSitdown()\n\t\t\treturn true\n\t\t}\n\t\to.SetGameing()\n\t\tn ++\n\t\treturn true\n\t})\n\n\t// 2人及以上才开始游戏\n\tif n < 2 {\n\t\treturn\n\t}\n\n\tr.status = RUNNING\n\t// 洗牌\n\tr.Cards.Shuffle()\n\n\t// 产生小盲\n\tsb := r.next(dealer.Pos)\n\tif n == 2 { // one-to-one\n\t\tsb = dealer\n\t}\n\t// 产生大盲\n\tbb := r.next(sb.Pos)\n\tbbPos := bb.Pos\n\n\t// 通报本局庄家\n\tr.WriteMsg(&protocol.Button{Uid: dealer.Uid})\n\n\t// 小大盲下注\n\tr.betting(sb, int32(r.SB))\n\tr.betting(bb, int32(r.BB))\n\n\t// Round 1 : preflop\n\tr.ready()\n\tr.Each(0, func(o *Occupant) bool {\n\t\to.cards = algorithm.Cards{r.Cards.Take(), r.Cards.Take()}\n\n\t\tkind, _ := algorithm.De(o.cards.GetType())\n\t\tm := &protocol.PreFlop{\n\t\t\tCards: o.cards.Bytes(),\n\t\t\tKind: kind,\n\t\t}\n\t\to.WriteMsg(m)\n\t\treturn true\n\t})\n\tr.Broadcast(&protocol.PreFlop{}, false)\n\n\tr.action(0)\n\n\tif r.remain <= 1 {\n\t\tgoto showdown\n\t}\n\tr.calc()\n\n\t// Round 2 : Flop\n\tr.ready()\n\tr.Cards = algorithm.Cards{r.Cards.Take(), r.Cards.Take(), r.Cards.Take()}\n\tr.Each(0, func(o *Occupant) bool {\n\t\tcs := r.Cards.Append(o.cards...)\n\n\t\tkind, _ := algorithm.De(cs.GetType())\n\t\tm := &protocol.Flop{\n\t\t\tCards: cs.Bytes(),\n\t\t\tKind: kind,\n\t\t}\n\t\to.WriteMsg(m)\n\t\treturn true\n\t})\n\tr.Broadcast(&protocol.Flop{Cards: r.Cards.Bytes()}, false)\n\n\tr.action(0)\n\n\tif r.remain <= 1 {\n\t\tgoto showdown\n\t}\n\tr.calc()\n\n\t// Round 3 : Turn\n\tr.ready()\n\tr.Cards = r.Cards.Append(r.Cards.Take())\n\tr.Each(0, func(o *Occupant) bool {\n\t\tcs := r.Cards.Append(o.cards...)\n\t\tkind, _ := algorithm.De(cs.GetType())\n\t\tm := &protocol.Turn{\n\t\t\tCard: r.Cards[3],\n\t\t\tKind: kind,\n\t\t}\n\t\to.WriteMsg(m)\n\t\treturn true\n\t})\n\tr.Broadcast(&protocol.Turn{Card: r.Cards[3]}, false)\n\n\tr.action(0)\n\n\tif r.remain <= 1 {\n\t\tgoto showdown\n\t}\n\tr.calc()\n\n\t// Round 4 : River\n\tr.ready()\n\tr.Cards = r.Cards.Append(r.Cards.Take())\n\tr.Each(0, func(o *Occupant) bool {\n\t\tcs := r.Cards.Append(o.cards...)\n\t\tvalue := cs.GetType()\n\t\tkind, _ := algorithm.De(value)\n\t\tm := &protocol.River{\n\t\t\tCard: r.Cards[4],\n\t\t\tKind: kind,\n\t\t}\n\t\to.WriteMsg(m)\n\t\to.HandValue = value\n\t\treturn true\n\t})\n\tr.Broadcast(&protocol.River{Card: r.Cards[4]}, false)\n\n\tr.action(0)\n\nshowdown:\n\tr.showdown()\n\tshowdown := &protocol.Showdown{}\n\tfor _, o := range r.Occupants {\n\t\tif o != nil && o.IsGameing() {\n\t\t\to.SetSitdown()\n\n\t\t\titem := &protocol.ShowdownItem{\n\t\t\t\tUid: o.Uid,\n\t\t\t\tChipsWin: r.Chips[o.Pos-1],\n\t\t\t\tChips: o.chips,\n\t\t\t}\n\t\t\tshowdown.Showdown = append(showdown.Showdown, item)\n\t\t}\n\t}\n\tr.Broadcast(showdown, true)\n\tr.Info(sb.Pos, bbPos)\n\n\tr.status = GAMEOVER\n\n\ttime.AfterFunc(time.Second*2, func() {\n\t\tdefer utils.PrintPanicStack()\n\t\tr.Send(nil, &startDelay{})\n\t})\n}\n\nfunc (r *Room) calc() (pots []handPot) {\n\tpots = calcPot(r.Chips)\n\tr.Pot = r.Pot[:]\n\tvar ps []uint32\n\tfor _, pot := range pots {\n\t\tr.Pot = append(r.Pot, pot.Pot)\n\t\tps = append(ps, pot.Pot)\n\t}\n\tr.Broadcast(&protocol.Pot{Pot: ps}, true)\n\treturn\n}\n\nfunc (r *Room) action(pos uint8) {\n\tif r.allin+1 >= r.remain {\n\t\treturn\n\t}\n\tvar skip uint8\n\tif pos == 0 { // start from left hand of button\n\t\tpos = (r.Button)%r.Cap() + 1\n\t}\n\n\tfor {\n\t\tvar raised uint8\n\t\tr.Each(pos-1, func(o *Occupant) bool {\n\t\t\tif r.remain <= 1 {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tif o.Pos == skip || o.chips == 0 {\n\t\t\t\treturn true\n\t\t\t}\n\t\t\tr.WriteMsg(&protocol.BetPrompt{})\n\t\t\tn := o.GetAction(r.Timeout)\n\t\t\tif r.remain <= 1 {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tif r.betting(o, n) {\n\t\t\t\traised = o.Pos\n\t\t\t\treturn false\n\t\t\t}\n\t\t\treturn true\n\t\t})\n\t\tif raised == 0 {\n\t\t\tbreak\n\t\t}\n\t\tpos = raised\n\t\tskip = pos\n\t}\n}\n\nfunc (r *Room) ready() {\n\tr.Bet = 0\n\tr.Each(0, func(o *Occupant) bool {\n\t\to.Bet = 0\n\t\to.waitAction = false\n\t\tr.remain++\n\t\to.HandValue = 0\n\t\treturn true\n\t})\n}\n\n// 比牌\nfunc (r *Room) showdown() {\n\tpots := r.calc()\n\n\tfor i, _ := range r.Chips {\n\t\tr.Chips[i] = 0\n\t}\n\n\tfor _, pot := range pots {\n\t\tvar maxO *Occupant\n\t\tfor _, pos := range pot.OPos {\n\t\t\to := r.Occupants[pos-1]\n\t\t\tif o != nil && len(o.cards) > 0 {\n\t\t\t\tif maxO == nil {\n\t\t\t\t\tmaxO = o\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tif o.HandValue > maxO.HandValue {\n\t\t\t\t\tmaxO = o\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tvar winners []uint8\n\n\t\tfor _, pos := range pot.OPos {\n\t\t\to := r.Occupants[pos-1]\n\t\t\tif o != nil && o.HandValue == maxO.HandValue && o.IsGameing() {\n\t\t\t\twinners = append(winners, o.Pos)\n\t\t\t}\n\t\t}\n\n\t\tif len(winners) == 0 {\n\t\t\tglog.Errorln(\"!!!no winners!!!\")\n\t\t\treturn\n\t\t}\n\n\t\tfor _, winner := range winners {\n\t\t\tr.Chips[winner-1] += pot.Pot / uint32(len(winners))\n\t\t}\n\t\tr.Chips[winners[0]-1] += pot.Pot % uint32(len(winners)) // odd chips\n\t}\n\n\tfor i, _ := range r.Chips {\n\t\tif r.Occupants[i] != nil {\n\t\t\tr.Occupants[i].chips += r.Chips[i]\n\t\t}\n\t}\n}\n\nfunc (r *Room) betting(o *Occupant, n int32) (raised bool) {\n\tif n > int32(o.chips) || // 手上筹码不足\n\t\t(n == 0 && o.Bet != r.Bet) || // 让牌\n\t\t(n > 0 && n != int32(o.chips) && ((n + int32(o.Bet)) < int32(r.Bet))) {\n\t\tglog.Errorf(\"下注筹码不合法!!！ n:%d p.Bet:%d p.Chips:%d t.Bet:%d\", n, o.Bet, o.chips, r.Bet)\n\t\treturn\n\t}\n\n\tvalue := n\n\tactionName := \"\"\n\tif n < 0 {\n\t\tactionName = model.BET_FOLD\n\t\tn = 0\n\t\tr.remain--\n\t\to.SetSitdown()\n\t} else if n == 0 {\n\t\tactionName = model.BET_CHECK\n\t} else if uint32(n)+o.Bet <= r.Bet {\n\t\tactionName = model.BET_CALL\n\t\to.chips -= uint32(n)\n\t\to.Bet += uint32(n)\n\t} else {\n\t\tactionName = model.BET_RAISE\n\t\to.chips -= uint32(n)\n\t\to.Bet += uint32(n)\n\t\tr.Bet = o.Bet\n\t\traised = true\n\t}\n\tif o.chips == 0 {\n\t\tr.allin++\n\t\tactionName = model.BET_ALLIN\n\t}\n\tr.Chips[o.Pos-1] += uint32(n)\n\n\tr.Broadcast(&protocol.BetBroadcast{\n\t\tUid: o.Uid,\n\t\tKind: actionName,\n\t\tValue: value,\n\t}, true)\n\n\treturn\n}\n\nfunc (r *Room) next(pos uint8) *Occupant {\n\tvolume := r.Cap()\n\tfor i := (pos) % volume; i != pos-1; i = (i + 1) % volume {\n\t\tif r.Occupants[i] != nil && r.Occupants[i].IsGameing() {\n\t\t\treturn r.Occupants[i]\n\t\t}\n\t}\n\treturn nil\n}\n"
},
{
"path": "src/server/game/internal/module.go",
"content": "package internal\n\nimport (\n\t\"github.com/dolotech/leaf/module\"\n\t\"server/base\"\n\t\"github.com/golang/glog\"\n\t\"server/protocol\"\n\t\"github.com/dolotech/leaf/room\"\n\t\"reflect\"\n\t\"server/model\"\n)\n\nvar (\n\tskeleton = base.NewSkeleton()\n\tChanRPC = skeleton.ChanRPCServer\n)\n\nfunc handler(m interface{}, h interface{}) {\n\tskeleton.RegisterChanRPC(reflect.TypeOf(m), h)\n}\nfunc init() {\n\thandler(&protocol.JoinRoom{}, room.OnMessage)\n\thandler(&protocol.LeaveRoom{}, room.OnMessage)\n\thandler(&protocol.Bet{}, room.OnMessage)\n\thandler(&protocol.SitDown{}, room.OnMessage) //\n\thandler(&protocol.StandUp{}, room.OnMessage) //\n\thandler(&protocol.Chat{}, room.OnMessage) //\n}\n\ntype Module struct {\n\t*module.Skeleton\n}\n\nfunc (m *Module) OnInit() {\n\tm.Skeleton = skeleton\n\troom.Init(&Creator{})\n}\n\nfunc (m *Module) OnDestroy() {\n\tglog.Errorln(\"OnDestroy\")\n}\n\ntype Creator struct{}\n\n// 对玩家未进入房间，或者没房间数据的处理\nfunc (this *Creator) Create(m interface{}) room.IRoom {\n\tif msg, ok := m.(*protocol.JoinRoom); ok {\n\t\tif len(msg.RoomNumber) == 0 {\n\t\t\tr := room.FindRoom()\n\t\t\treturn r\n\t\t}\n\t\tr := room.GetRoom(msg.RoomNumber)\n\t\tif r != nil {\n\t\t\treturn r\n\t\t}\n\t\troom := NewRoom(9, 5, 10, 1000, model.Timeout)\n\t\troom.Insert()\n\t\treturn room\n\t}\n\treturn nil\n}\n"
},
{
"path": "src/server/game/internal/occupant.go",
"content": "package internal\n\nimport (\n\t\"server/model\"\n\t\"github.com/dolotech/leaf/gate\"\n\t\"server/algorithm\"\n\t\"time\"\n\t\"errors\"\n\t\"github.com/dolotech/leaf/room\"\n)\n\ntype Occupant struct {\n\t*model.User\n\tgate.Agent\n\troom room.IRoom\n\tcards algorithm.Cards\n\tPos uint8 // 玩家座位号，从1开始\n\tstatus int32 // 1为离线状态\n\n\tBet uint32 // 当前下注\n\tactions chan int32\n\twaitAction bool\n\n\tchips uint32 // 带入的筹码\n\tHandValue uint32\n}\n\nconst (\n\tOccupant_status_InGame int32 = 3\n\tOccupant_status_Offline int32 = 1\n\tOccupant_status_Observe int32 = 2\n\tOccupant_status_Sitdown int32 = 0\n)\n\nfunc (o *Occupant) GetRoom() room.IRoom {\n\treturn o.room\n}\nfunc (o *Occupant) SetRoom(m room.IRoom) {\n\to.room = m\n}\nfunc (o *Occupant) SetAction(n int32)error {\n\tif o.waitAction {\n\t\to.actions <- n\n\t\treturn nil\n\t}\n\treturn errors.New(\"not your action\")\n}\nfunc (o *Occupant) GetAction(timeout time.Duration) int32 {\n\ttimer := time.NewTimer(timeout)\n\to.waitAction = true\n\tselect {\n\tcase n := <-o.actions:\n\t\ttimer.Stop()\n\t\to.waitAction = false\n\t\treturn n\n\tcase <-o.room.Closed():\n\t\ttimer.Stop()\n\t\to.waitAction = false\n\t\treturn -1\n\tcase <-timer.C:\n\t\to.waitAction = false\n\t\ttimer.Stop()\n\t\treturn -1 // 超时弃牌\n\t}\n}\nfunc (o *Occupant)SetPos(pos uint8) {\n\t o.Pos = pos\n}\nfunc (o *Occupant) GetPos() uint8 {\n\treturn o.Pos\n}\nfunc (o *Occupant) GetUid() uint32 {\n\treturn o.Uid\n}\nfunc (o *Occupant) WriteMsg(msg interface{}) {\n\tif o.status != Occupant_status_Offline {\n\t\to.Agent.WriteMsg(msg)\n\t}\n}\n\nfunc (o *Occupant) SetData(d interface{}) {\n\to.User = d.(*model.User)\n}\nfunc (o *Occupant) GetId() uint32 {\n\treturn o.Uid\n}\n\nfunc (o *Occupant) SetObserve() {\n\to.status = Occupant_status_Observe\n}\n\nfunc (o *Occupant) IsObserve() bool {\n\treturn o.status == Occupant_status_Observe\n}\n\nfunc (o *Occupant) SetOffline() {\n\to.status = Occupant_status_Offline\n}\n\nfunc (o *Occupant) IsOffline() bool {\n\treturn o.status == Occupant_status_Offline\n}\n\nfunc (o *Occupant) SetSitdown() {\n\to.status = Occupant_status_Sitdown\n}\n\nfunc (o *Occupant) IsSitdown() bool {\n\treturn o.status == Occupant_status_Sitdown\n}\n\nfunc (o *Occupant) SetGameing() {\n\to.status = Occupant_status_InGame\n}\n\nfunc (o *Occupant) IsGameing() bool {\n\treturn o.status == Occupant_status_InGame\n}\n\nfunc (o *Occupant) Replace(value *Occupant) {\n\to.Pos = value.Pos\n\to.cards = value.cards\n\to.room = value.room\n}\n\nfunc NewOccupant(data *model.User, conn gate.Agent) *Occupant {\n\to := &Occupant{\n\t\tUser: data,\n\t\tAgent: conn,\n\t\tactions: make(chan int32),\n\t}\n\treturn o\n}\n"
},
{
"path": "src/server/game/internal/pot.go",
"content": "package internal\n\nimport (\n\t\"sort\"\n)\n\ntype handBet struct {\n\tPos uint8\n\tBet uint32\n}\n\ntype handBets []handBet\n\nfunc (p handBets) Len() int {\n\treturn len(p)\n}\n\nfunc (p handBets) Less(i, j int) bool {\n\treturn p[i].Bet < p[j].Bet\n}\n\nfunc (p handBets) Swap(i, j int) {\n\tp[i], p[j] = p[j], p[i]\n}\n\ntype handPot struct {\n\tPot uint32\n\tOPos []uint32\n}\n\n//因为每个人手中的筹码量会不时的产生变化，当出现多个筹码量不等的玩家“全下(ALL-IN)”争夺底池的时候就会出现多个奖池，\n//这时候底池将分出主池和边池，主池里的筹码可 由任何一位争夺者胜利后将其拿走，其后每个边池将分别由参与者按牌型大小分别拿走。\n//举个例子，假如发到河牌后共有三个人争夺底池，三人分别用ABC代替，\n//假设A玩家手中有60，B手中有80，C手中有100。三人ALL-IN后则先把每人的筹码划分成：\n//A玩家60；B玩家60+20；C玩家60+20+20，然后分出底池：\n//主池 由60乘以三个人(A+B+C)形成一个堆，总额为180；\n//边池一 由20乘以剩下的两个人(B+C)多出的部分为一个堆，总额为40；\n//边池二 由筹码最多者C的多出的部分20单独组成一个堆，总额为20。\n//现在三个底池形成了，然后分别按照牌型的大小来决定谁拿走哪个底池……\n//首先，主池可以由三人中的任何一人得到胜利都可以拿走；\n// 但是边池一的争夺就只能在B与C之间产生，两人谁赢谁拿走，与A无关(就算A玩家的牌最大也只能拿走他参与的主池)。\n//而最后剩下的边池二不论三人谁输谁赢都只能由C拿走，因为边池二里的筹码只有C自己参与了，与其他人无关。\nfunc calcPot(bets []uint32) (pots []handPot) {\n\tvar obs handBets\n\tfor i, bet := range bets {\n\t\tif bet > 0 {\n\t\t\tobs = append(obs, handBet{Pos: uint8(i) + 1, Bet: bet})\n\t\t}\n\t}\n\tsort.Sort(obs)\n\n\tfor i, ob := range obs {\n\t\tif ob.Bet > 0 {\n\t\t\ts := obs[i:]\n\t\t\thpot := handPot{Pot: ob.Bet * uint32(len(s))}\n\t\t\tfor j, _ := range s {\n\t\t\t\ts[j].Bet -= ob.Bet\n\t\t\t\thpot.OPos = append(hpot.OPos, uint32(s[j].Pos))\n\t\t\t}\n\t\t\tpots = append(pots, hpot)\n\t\t}\n\t}\n\treturn\n}\n"
},
{
"path": "src/server/game/internal/pot_test.go",
"content": "package internal\n\nimport \"testing\"\n\nfunc Test_Pot(t *testing.T) {\n\tbets := []uint32{60,80,90,0,0,0,0,0,0}\n\tres:=calcPot(bets)\n\t//[{180 [1 2 3]} {40 [2 3]} {10 [3]}]\n\tt.Log(res)\n\n\n\tbets = []uint32{60,60,60,0,0,0,0,0,0}\n\tres=calcPot(bets)\n\t//[{180 [1 2 3]}]\n\tt.Log(res)\n\n\ta:= []byte{}\n\n\ta = nil\n\tt.Log(len(a))\n\n}\n"
},
{
"path": "src/server/game/internal/room.go",
"content": "package internal\n\nimport (\n\t\"server/model\"\n\t\"server/protocol\"\n\t\"server/algorithm\"\n\t\"time\"\n\t\"github.com/dolotech/leaf/room\"\n\t\"github.com/golang/glog\"\n)\n\nconst (\n\tRUNNING uint8= 1\n\tGAMEOVER uint8= 0\n)\n\ntype Room struct {\n\t*model.Room\n\t*room.MsgLoop\n\t*room.Log\n\tOccupants []*Occupant\n\tobserves []*Occupant // 站起的玩家\n\tAutoSitdown []*Occupant // 自动坐下队列\n\n\tremain int\n\tallin int\n\tn uint8\n\tstatus uint8\n\n\tSB uint32 // 小盲注\n\tBB uint32 // 大盲注\n\tCards algorithm.Cards // 公共牌\n\tPot []uint32 // 奖池筹码数, 第一项为主池，其他项(若存在)为边池\n\tTimeout time.Duration // 倒计时超时时间(秒)\n\tButton uint8 // 当前庄家座位号，从1开始\n\tChips []uint32 // 玩家本局下注的总筹码数，与occupants一一对应\n\tBet uint32 // 当前回合 上一玩家下注额\n\tMax uint8 // 房间最大玩家人数\n\tMaxChips uint32\n\tMinChips uint32\n}\n\nfunc NewRoom(max uint8, sb, bb uint32, chips uint32, timeout uint8) *Room {\n\tif max <= 0 || max > 9 {\n\t\tmax = 9 // default 9 Occupants\n\t}\n\n\tr := &Room{\n\t\tRoom: &model.Room{DraginChips: chips,},\n\t\tMsgLoop: room.NewMsgLoop(),\n\t\tChips: make([]uint32, max),\n\t\tOccupants: make([]*Occupant, max),\n\t\tPot: make([]uint32, 0, max),\n\t\tTimeout: time.Second * time.Duration(timeout),\n\t\tSB: sb,\n\t\tBB: bb,\n\t\tMax: max,\n\t}\n\n\tr.Log = room.NewLog(r)\n\tr.Regist(&protocol.JoinRoom{}, r.joinRoom)\n\tr.Regist(&protocol.LeaveRoom{}, r.leaveRoom)\n\tr.Regist(&protocol.Bet{}, r.bet)\n\tr.Regist(&protocol.SitDown{}, r.sitDown) //\n\tr.Regist(&protocol.StandUp{}, r.standUp) //\n\tr.Regist(&protocol.Chat{}, r.chat) //\n\tr.Regist(&protocol.Chat{}, r.chat) //\n\tr.Regist(&startDelay{}, r.startDelay) //\n\n\treturn r\n}\n\ntype startDelay struct {\n\tkind uint8\n}\n\nfunc (r *Room) New(m interface{}) room.IRoom {\n\tglog.Errorln(r, m)\n\tif msg, ok := m.(*protocol.JoinRoom); ok {\n\t\tif len(msg.RoomNumber) == 0 {\n\t\t\tr := room.FindRoom()\n\t\t\treturn r\n\t\t}\n\t\tr := room.GetRoom(msg.RoomNumber)\n\t\tif r != nil {\n\t\t\treturn r\n\t\t}\n\t\troom := NewRoom(9, 5, 10, 1000, model.Timeout)\n\t\troom.Insert()\n\t\treturn room\n\t}\n\treturn nil\n}\n\nfunc (r *Room) WriteMsg(msg interface{}, exc ...uint32) {\n\tfor _, v := range r.Occupants {\n\t\tif v != nil {\n\t\t\tfor _, uid := range exc {\n\t\t\t\tif uid == v.GetUid() {\n\t\t\t\t\tgoto End\n\t\t\t\t}\n\t\t\t}\n\t\t\tv.WriteMsg(msg)\n\t\t}\n\tEnd:\n\t}\n}\n\nfunc (r *Room) Broadcast(msg interface{}, all bool, exc ...uint32) {\n\tfor _, v := range r.Occupants {\n\t\tif v != nil && (all || !v.IsGameing()) {\n\t\t\tfor _, uid := range exc {\n\t\t\t\tif uid == v.GetUid() {\n\t\t\t\t\tgoto End1\n\t\t\t\t}\n\t\t\t}\n\t\t\tv.WriteMsg(msg)\n\t\t}\n\tEnd1:\n\t}\n\tfor _, v := range r.observes {\n\t\tif v != nil {\n\t\t\tfor _, uid := range exc {\n\t\t\t\tif uid == v.Uid {\n\t\t\t\t\tgoto End\n\t\t\t\t}\n\t\t\t}\n\t\t\tv.WriteMsg(msg)\n\t\t}\n\tEnd:\n\t}\n}\n\nfunc (r *Room) addOccupant(o *Occupant) uint8 {\n\tfor _, v := range r.Occupants {\n\t\tif v != nil && v.GetUid() == o.Uid {\n\t\t\treturn 0\n\t\t}\n\t}\n\n\tfor k, v := range r.Occupants {\n\t\tif v == nil {\n\t\t\tr.Occupants[k] = o\n\t\t\to.SetRoom(r)\n\t\t\to.Pos = uint8(k + 1)\n\t\t\to.SetSitdown()\n\t\t\treturn o.Pos\n\t\t}\n\t}\n\treturn 0\n}\n\nfunc (r *Room) removeOccupant(o *Occupant) uint8 {\n\tfor k, v := range r.Occupants {\n\t\tif v != nil && v.GetUid() == o.Uid {\n\t\t\tv.SetPos(0)\n\t\t\tr.Occupants[k] = nil\n\t\t\treturn uint8(k + 1)\n\t\t}\n\t}\n\treturn 0\n}\n\nfunc (r *Room) addObserve(o *Occupant) uint8 {\n\tfor _, v := range r.observes {\n\t\tif v != nil && v.Uid == o.Uid {\n\t\t\treturn 0\n\t\t}\n\t}\n\to.SetObserve()\n\tr.observes = append(r.observes, o)\n\n\treturn 0\n}\n\nfunc (r *Room) removeObserve(o *Occupant) {\n\tfor k, v := range r.observes {\n\t\tif v != nil && v.Uid == o.Uid {\n\t\t\tr.observes = append(r.observes[:k], r.observes[k+1:]...)\n\t\t\treturn\n\t\t}\n\t}\n}\n\n// start starts from 0\nfunc (r *Room) Each(start uint8, f func(o *Occupant) bool) {\n\tvolume := r.Cap()\n\tend := (volume + start - 1) % volume\n\ti := start\n\tfor ; i != end; i = (i + 1) % volume {\n\t\tif r.Occupants[i] != nil && r.Occupants[i].IsGameing() && !f(r.Occupants[i]) {\n\t\t\treturn\n\t\t}\n\t}\n\n\t// end\n\tif r.Occupants[i] != nil && r.Occupants[i].IsGameing() {\n\t\tf(r.Occupants[i])\n\t}\n}\n\nfunc (r *Room) Cap() uint8 {\n\treturn r.Max\n}\nfunc (r *Room) Len() uint8 {\n\tvar num uint8\n\tfor _, v := range r.Occupants {\n\t\tif v != nil {\n\t\t\tnum ++\n\t\t}\n\t}\n\treturn num\n}\n\nfunc (r *Room) GetNumber() string {\n\treturn r.Number\n}\nfunc (r *Room) SetNumber(value string) {\n\tr.Number = value\n}\n\nfunc (r *Room) Data() interface{} { return r.Room }\nfunc (r *Room) SetData(d interface{}) {\n\tr.Room = d.(*model.Room)\n}\n"
},
{
"path": "src/server/game/internal/room_internal_handler.go",
"content": "package internal\n\nimport (\n\t\"server/protocol\"\n\t\"github.com/golang/glog\"\n\t\"github.com/davecgh/go-spew/spew\"\n\t\"time\"\n\t\"github.com/dolotech/lib/utils\"\n)\n\nfunc (r *Room) joinRoom(m *protocol.JoinRoom, o *Occupant) {\n\tif o.room != nil {\n\t\tfor k, v := range r.Occupants {\n\t\t\tglog.Infoln(v, o)\n\t\t\tif v.Uid == o.Uid {\n\t\t\t\t// todo 掉线重连现场数据替换处理\n\t\t\t\to.Replace(r.Occupants[k])\n\t\t\t\tr.Occupants[k] = o\n\n\t\t\t\tif o != v {\n\t\t\t\t\tv.Close()\n\t\t\t\t\tglog.Infoln(\"掉线重连处理\")\n\t\t\t\t} else {\n\t\t\t\t\tglog.Infoln(\"同一个链接重复请求加入房间\")\n\t\t\t\t}\n\n\t\t\t\tr.WriteMsg(&protocol.UserInfo{Uid: o.Uid}, o.Uid)\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t}\n\n\trinfo := &protocol.RoomInfo{\n\t\tNumber: r.Number,\n\t}\n\tuserinfos := make([]*protocol.UserInfo, 0, r.Cap())\n\tr.Each(0, func(o *Occupant) bool {\n\t\tuserinfo := &protocol.UserInfo{\n\t\t\tNickname: o.Nickname,\n\t\t\tUid: o.Uid,\n\t\t\tAccount: o.Account,\n\t\t\tSex: o.Sex,\n\t\t\tProfile: o.Profile,\n\t\t\tChips: o.chips,\n\t\t}\n\t\tuserinfos = append(userinfos, userinfo)\n\t\treturn true\n\t})\n\n\tpos := r.addOccupant(o)\n\n\t// 坐下失败转为旁观\n\tif pos == 0 {\n\t\tr.addObserve(o)\n\t} else {\n\t\tuserInfo := &protocol.UserInfo{\n\t\t\tNickname: o.Nickname,\n\t\t\tUid: o.Uid,\n\t\t\tAccount: o.Account,\n\t\t\tSex: o.Sex,\n\t\t\tProfile: o.Profile,\n\t\t\tChips: o.chips,\n\t\t}\n\t\tr.Broadcast(&protocol.JoinRoomBroadcast{UserInfo: userInfo}, true, o.Uid)\n\t}\n\n\to.RoomID = r.Number\n\to.UpdateRoomId()\n\n\to.WriteMsg(&protocol.JoinRoomResp{UserInfos: userinfos, RoomInfo: rinfo})\n\n\n\ttime.AfterFunc(time.Second*2, func() {\n\t\tdefer utils.PrintPanicStack()\n\t\tr.Send(o,&startDelay{})\n\t})\n\tr.Debug(\"joinRoom\", spew.Sdump(m))\n}\n\nfunc (r *Room) leaveAndRecycleChips(o *Occupant) {\n\tif r.removeOccupant(o) > 0 {\n\t\t// 玩家站起回收带入筹码\n\t\tgap := int32(o.chips) - int32(r.DraginChips)\n\t\tif gap == 0 {\n\t\t\to.UpdateChips(gap)\n\t\t}\n\t}\n}\nfunc (r *Room) leaveRoom(m *protocol.LeaveRoom, o *Occupant) {\n\n\tr.removeObserve(o)\n\tr.removeOccupant(o)\n\tr.leaveAndRecycleChips(o)\n\n\to.RoomID = \"\"\n\to.room = nil\n\to.UpdateRoomId()\n\n\tleave := &protocol.LeaveRoom{\n\t\tRoomNumber: r.Number,\n\t\tUid: o.Uid,\n\t}\n\tr.Broadcast(leave, true)\n\n\tr.Debug()\n\n\t// 房间里没有玩家时关闭并从列表中删除\n\tif r.Len() == 0 {\n\t\tr.Close(r)\n\t}\n\tglog.Errorln(\"leaveRoom\", m)\n}\n\nfunc (r *Room) bet(m *protocol.Bet, o *Occupant) {\n\tif !o.IsGameing() {\n\t\to.WriteMsg(protocol.MSG_NOT_NOT_START)\n\t\treturn\n\t}\n\n\tif m.Value < 0 {\n\t\terr := o.SetAction(-1)\n\t\tif err != nil {\n\t\t\to.WriteMsg(protocol.MSG_NOT_TURN)\n\t\t}\n\n\t} else {\n\t\terr := o.SetAction(m.Value)\n\t\tif err != nil {\n\t\t\to.WriteMsg(protocol.MSG_NOT_TURN)\n\t\t}\n\t}\n\n\tglog.Errorln(\"bet\", m)\n}\n\nfunc (r *Room) sitDown(m *protocol.SitDown, o *Occupant) {\n\tpos := r.addOccupant(o)\n\tif pos == 0 {\n\t\t// 给进入房间的玩家带入筹码\n\t\to.chips = r.DraginChips\n\t\tr.addObserve(o)\n\t} else {\n\n\t}\n\tr.Broadcast(&protocol.SitDown{Uid: o.Uid, Pos: o.Pos}, true)\n\n\tglog.Errorln(\"sitDown\", m)\n}\n\nfunc (r *Room) standUp(m *protocol.StandUp, o *Occupant) {\n\n\to.SetAction(-1)\n\tr.leaveAndRecycleChips(o)\n\n\tr.addObserve(o)\n\tr.Broadcast(&protocol.StandUp{Uid: o.Uid}, true)\n\n\tglog.Errorln(\"standUp\", m)\n}\n\nfunc (r *Room) chat(m *protocol.Chat, o *Occupant) {\n\tr.Broadcast(m, true)\n}\n"
},
{
"path": "src/server/game/internal/room_test.go",
"content": "package internal\n\nimport (\n\t\"testing\"\n\t\"time\"\n\t\"reflect\"\n)\n\nfunc TestRoom_Value(t *testing.T) {\n\tt.Log(reflect.ValueOf(12))\n}\nfunc TestRoom_RecvMsg(t *testing.T) {\n\n\t/*room:= NewRoom(&model.Room{})\n\n\n\tprotocol:= &msg2.JoinRoom{RoomNumber:\"9999\"}\n\n\n\troom.Send(12,protocol)\n\n*/\n\t//msg1:= &msg2.LeaveRoom{RoomNumber:\"9999\"}\n\t//room.RecvMsg(12,msg1)\n\n\ttime.Sleep(time.Second * 2)\n}\nfunc TestClose(t *testing.T) {\n\n\tc:= make(chan struct{},1)\n\n\n\tgo func() {\n\t\tselect {\n\t\tcase <-c:\n\t\tdefault:\n\t\t\tt.Log(\"default\")\n\t\t}\n\t}()\n\t<- time.After(time.Second)\n\tclose(c)\n\n\tselect {\n\t\tcase c<- struct{}{}:\n\tdefault:\n\t\tt.Log(\"default\")\n\t}\n\n\t<- time.After(time.Second)\n\n}\nfunc BenchmarkCloseRoom(t *testing.B) {\n\n\t/*\n\n\t\tfor i:=0;i